diff --git a/.claude/CLAUDE.md b/.claude/CLAUDE.md index d5cc2e2..f8c5c55 100644 --- a/.claude/CLAUDE.md +++ b/.claude/CLAUDE.md @@ -92,7 +92,7 @@ OptunaSharp/ │ │ ├── Version.cs # OptunaSharp.OptunaSharpVersion (the version constant) │ │ └── README.md # packed into the .nupkg │ └── OptunaSharp.*/ # optional satellite packages — Storage.{Sqlite,EFCore,Grpc,Redis,…}, Visualization.Plotly, Integration.{LightGbm,ML.NET}, Interop.{pythonnet,BoTorch,PyCma}, Artifacts.{S3,Gcs,AzureBlob,R2}, Cli -├── refs/ # reference-only pinned submodules (NOT built) — optuna @ v5.0.0 (01ddd17, the porting reference), NumSharp @ v0.80.0, optunahub @ v0.5.0, optuna-integration @ v5.0.0, shap, scikit-learn +├── refs/ # reference-only pinned submodules (NOT built) — optuna @ v5.0.0 (01ddd17, the porting reference), NumSharp @ v0.81.0, optunahub @ v0.5.0, optuna-integration @ v5.0.0, shap, scikit-learn ├── test/ │ ├── OptunaSharp.Tests/ # unit tests — MSTest v3 + AwesomeAssertions │ ├── OptunaSharp.Tests.Interop/ # LIVE-Optuna parity harness (pythonnet) @@ -133,18 +133,21 @@ package dependency** (see below), not a solution member. `OptunaSharp.Core` depends on **NumSharp** and its native LAPACK/CBLAS backend **NumSharp.Interop.OpenBLAS**, both consumed as **NuGet packages from nuget.org** (SciSharp STACK) — two plain `PackageReference`s in `OptunaSharp.Core.csproj`, versioned by the single-sourced -`$(NumSharpVersion)` property in `Directory.Build.props` (currently `0.80.0`; bump that one value to -move to a newer release). **Build and CI restore these from nuget.org, always** — there is no submodule +`$(NumSharpVersion)` property in `Directory.Build.props` (currently `0.81.0`; bump that one value to +move to a newer release, and move the CI NumPy pin with it, below). **Build and CI restore these from nuget.org, always** — there is no submodule init and no OpenBLAS-native staging step anymore. - **OpenBLAS ships the natives.** `NumSharp.Interop.OpenBLAS` carries the prebuilt scipy-openblas binaries NumPy itself bundles, under `runtimes//native/`; the package's `buildTransitive` targets copy the right RID's natives to the consuming executable/test output automatically (no `fetch_openblas.py`). So `np.linalg` (cholesky / eigh / solve / matrix_rank / svd / qr) computes - through LAPACK and is **bit-identical to NumPy** (verified byte-for-byte vs numpy 2.4.2) — the basis + through LAPACK and is **bit-identical to NumPy** (0.81.0 bundles numpy 2.5.4's scipy-openblas 0.3.34.106.0; + 0.80.0 bundled numpy 2.4.2's) — the basis for the byte-exact linalg-backed samplers (NSGA-III's hyperplane solve, CMA-ES's eigendecomposition, the GP stack's Cholesky). OpenBLAS depends on the same NumSharp version, so pack records both as - direct dependencies. + direct dependencies. **The CI NumPy pin follows the bundle:** `build-and-release.yml` and the package-parity + `Dockerfile` pin `numpy==2.5.4` for NumSharp 0.81.0; a NumPy whose OpenBLAS differs moves the seeded CMA-ES, + xNES, UNDX and JANUS results in their last bits and fails their byte-exact oracles. - **The backend is force-loaded.** OpenBLAS self-registers from its own `[ModuleInitializer]`, but the CLR runs a referenced assembly's initializer only when the assembly is first touched. `src/OptunaSharp.Core/Internal/OpenBlasActivation.cs` touches `OpenBlasEngine.LapackAvailable` from @@ -359,7 +362,18 @@ Rules every workflow follows: a `Test (slow)` step runs the `Slow` category on Linux for `v*` tags and manual dispatch (dispatch input `run_slow`, default on; off skips ~2 h of BoTorch parity when re-checking an OS leg). The `setup` job decides the matrix per trigger: push = ubuntu+windows × both TFMs, PR = net10.0 only, - tags/dispatch = +macOS. + tags/dispatch = +macOS. On Windows the unit tests run with `--blame-crash`, so a test host that crashes leaves + the test sequence (`Sequence_*.xml`), and a mini dump when the runtime sees the crash, in the + `test-results-windows-2025` artifact. +- **The OpenBLAS kernel pin** — every x64 test step sources `.github/scripts/openblas_coretype.sh`, which exports + `OPENBLAS_CORETYPE=Haswell` (the kernels the committed linalg oracles were captured on) EXCEPT on Windows on AMD + CPUs with AVX-512 (Zen 4/5, e.g. the EPYC 9V74 / 9V45 runners): there the Windows build of NumSharp 0.81.0's + OpenBLAS 0.3.34.106.0 running forced Haswell kernels faults with an access violation in JANUS-DE's quadratic chart + (found 2026-11-14 by the `ci/win-crash-diag` runs; OpenBLAS's own kernel choice and 0.3.31 both pass), so OpenBLAS + chooses and the Haswell-captured oracles (AGE-MOEA-2's linalg cases, the CMA-ES state oracle, the xNES digest) + report Inconclusive through an `OpenBlasEngine.CoreName == "Haswell"` guard. Linux keeps the pin on every CPU: + forced Haswell passes on Linux Zen 4, and unpinned it breaks the live `LongRun_40D_FullState_IsBitIdentical` + gate. A new oracle captured on Haswell kernels needs the same guard. - **`satellite-tests`** — ubuntu + windows on every trigger, never macOS: the arm64 runner has no ML.NET LightGBM native and cannot host the Linux service containers. It runs every other `test/OptunaSharp.Tests.*` suite (Storage, Artifacts, Cli, Hosting, Importance.*, Integration.*, Benchmark.VolleyEval); Interop and diff --git a/.github/scripts/openblas_coretype.sh b/.github/scripts/openblas_coretype.sh new file mode 100644 index 0000000..1c2ccc3 --- /dev/null +++ b/.github/scripts/openblas_coretype.sh @@ -0,0 +1,52 @@ +#!/usr/bin/env bash +# Sourced by the test steps of build-and-release.yml: decides OpenBLAS's kernel family for this runner and exports +# OPENBLAS_CORETYPE accordingly. +# +# Why a pin at all: OpenBLAS (a DYNAMIC_ARCH build, both in NumSharp.Interop.OpenBLAS and in NumPy's wheels) picks its +# kernels per CPU. The committed linalg oracles (AGE-MOEA-2's operator parity, the CMA-ES state oracle, the xNES digest) +# were captured on its Haswell kernels, and the other families (SkylakeX / Zen on AVX-512 hosts) land 1-2 ULP away, so +# CI pins Haswell on x64; every x64 runner has the AVX2/FMA those kernels need. +# +# The one exception, Windows on an AMD CPU with AVX-512: NumSharp 0.81.0 bundles OpenBLAS 0.3.34.106.0, whose WINDOWS +# build running FORCED Haswell kernels on Zen 4 / Zen 5 (the EPYC 9V74 and 9V45 runners) faults with an access violation +# (0xC0000005) inside JANUS-DE's quadratic chart, on net8.0 and net10.0, with one OpenBLAS thread or four, with .NET's +# AVX-512 on or off. On the same machines OpenBLAS's own kernel choice passes, and so does NumSharp 0.80.0's OpenBLAS +# 0.3.31.22.0 with the pin; AMD EPYC 7763 (Zen 3) and the Intel Xeons pass every way. Found 2026-11-14 by the diagnostic +# runs 43548926143, 43549856491 and 43550350376 (throwaway branch ci/win-crash-diag). There the pin is left off: +# OpenBLAS chooses, and the oracle guards (OpenBlasEngine.CoreName must be "Haswell") report the Haswell-captured cases +# Inconclusive instead of red. +# +# Linux keeps the pin on every CPU: the same console repro with Haswell forced passed on three Linux EPYC 9V74 (Zen 4) +# runners, both TFMs (run 43553335934, branch ci/linux-haswell-check), and leaving the pin off there broke a live +# byte-for-byte gate (CmaEsSamplerParityTests.LongRun_40D_FullState_IsBitIdentical on an AMD AVX-512 runner, +# rehearsal 43551908135), so the exception would cost a parity gate for nothing. +# +# Usage: source "$GITHUB_WORKSPACE/.github/scripts/openblas_coretype.sh" (bash; reads RUNNER_ARCH and RUNNER_OS) +# Effect: exports OPENBLAS_CORETYPE=Haswell or unsets it, and prints one line saying which and why. Off x64 (the macOS +# arm64 runner) it does nothing: Haswell kernels do not exist there. + +# True on an AMD CPU with AVX-512 (Zen 4 and later). Windows asks .NET through PowerShell 7, which every hosted Windows +# runner has; it is tested first because Git Bash also has a /proc/cpuinfo (MSYS2's emulation), whose flag list is not +# known to name AVX-512. Elsewhere it reads the kernel's /proc/cpuinfo. Anything it cannot tell counts as "not AMD with +# AVX-512", i.e. pinned. +openblas_amd_avx512() { + if [[ "${RUNNER_OS:-}" == "Windows" || "$(uname -s)" == MINGW* || "$(uname -s)" == MSYS* ]]; then + command -v pwsh >/dev/null 2>&1 || return 1 + [[ "$(pwsh -NoProfile -NonInteractive -Command '[Console]::Write(((Get-CimInstance Win32_Processor | Select-Object -First 1).Manufacturer -eq "AuthenticAMD") -and [System.Runtime.Intrinsics.X86.Avx512F]::IsSupported)')" == "True" ]] + elif [[ -r /proc/cpuinfo ]]; then + grep -m1 '^vendor_id' /proc/cpuinfo | grep -q AuthenticAMD && grep -qw avx512f /proc/cpuinfo + else + return 1 + fi +} + +if [[ "${RUNNER_ARCH:-}" == "X64" ]]; then + # The exception applies to Windows only (see above); Linux and any other x64 host keep the pin. + if [[ "${RUNNER_OS:-}" == "Windows" ]] && openblas_amd_avx512; then + unset OPENBLAS_CORETYPE + echo "OpenBLAS: Windows on an AMD CPU with AVX-512, Haswell pin left off (OpenBLAS 0.3.34's forced Haswell kernels fault there); the Haswell-captured oracles report Inconclusive" + else + export OPENBLAS_CORETYPE=Haswell + echo "OpenBLAS: OPENBLAS_CORETYPE=Haswell (the kernels the committed linalg oracles were captured on)" + fi +fi diff --git a/.github/workflows/build-and-release.yml b/.github/workflows/build-and-release.yml index afd2d86..10b7e60 100644 --- a/.github/workflows/build-and-release.yml +++ b/.github/workflows/build-and-release.yml @@ -161,16 +161,28 @@ jobs: # (SkylakeX/Zen on AVX-512 hosts), whose last bits differ from the committed linalg oracles (generated # on Haswell kernels — AgeMoea2OperatorParityTests' Normalize/Do failed by 1-2 ULP on such a runner) # and could differ between NumPy's and NumSharp's OpenBLAS copies. Every x64 runner has AVX2/FMA. - if [[ "$RUNNER_ARCH" == "X64" ]]; then export OPENBLAS_CORETYPE=Haswell; fi + # Except Windows on AMD CPUs with AVX-512 (Zen 4/5), where OpenBLAS 0.3.34's forced Haswell kernels fault: the script + # decides per runner and says which it chose, and why. + source "$GITHUB_WORKSPACE/.github/scripts/openblas_coretype.sh" FILTER="TestCategory!=OpenBugs&TestCategory!=HighMemory&TestCategory!=RequiresPython&TestCategory!=Slow" if [[ "$RUNNER_OS" != "Windows" ]]; then FILTER="$FILTER&TestCategory!=WindowsOnly" fi + # Windows only: a test-host crash leaves the blame sequence (the tests that ran, the last one unfinished) + # and, when the runtime sees the crash, a mini dump under TestResults, which the upload below keeps. It + # earned its place on 2026-11-14: PR #6's test hosts died with nothing logged, and the sequence named + # JanusDeSamplerTests.Sampler_ScalarMode_Runs, which led to OpenBLAS 0.3.34's forced Haswell kernels + # faulting on AMD Zen 4/5 (see .github/scripts/openblas_coretype.sh; that access violation left no dump). + # Linux and macOS keep the plain run: the flag was only tried on Windows. + BLAME=() + if [[ "$RUNNER_OS" == "Windows" ]]; then + BLAME=(--blame-crash --blame-crash-dump-type mini) + fi for TFM in ${{ needs.setup.outputs.tfms_space }}; do echo "::group::Unit tests ($TFM)" dotnet test test/OptunaSharp.Tests/OptunaSharp.Tests.csproj \ --configuration Release --no-build --framework "$TFM" \ - --filter "$FILTER" --logger "trx" + --filter "$FILTER" --logger "trx" "${BLAME[@]}" echo "::endgroup::" done @@ -186,7 +198,9 @@ jobs: # (SkylakeX/Zen on AVX-512 hosts), whose last bits differ from the committed linalg oracles (generated # on Haswell kernels — AgeMoea2OperatorParityTests' Normalize/Do failed by 1-2 ULP on such a runner) # and could differ between NumPy's and NumSharp's OpenBLAS copies. Every x64 runner has AVX2/FMA. - if [[ "$RUNNER_ARCH" == "X64" ]]; then export OPENBLAS_CORETYPE=Haswell; fi + # Except Windows on AMD CPUs with AVX-512 (Zen 4/5), where OpenBLAS 0.3.34's forced Haswell kernels fault: the script + # decides per runner and says which it chose, and why. + source "$GITHUB_WORKSPACE/.github/scripts/openblas_coretype.sh" for TFM in ${{ needs.setup.outputs.tfms_space }}; do echo "::group::Slow unit tests ($TFM)" dotnet test test/OptunaSharp.Tests/OptunaSharp.Tests.csproj \ @@ -195,12 +209,17 @@ jobs: echo "::endgroup::" done + # The TRX files, plus what --blame-crash leaves after a Windows test-host crash (the dump and the sequence of + # tests): a pattern with no match is skipped, so a clean run uploads the TRX files only. - name: Upload Test Results uses: actions/upload-artifact@v7 if: always() with: name: test-results-${{ matrix.os }} - path: ${{ github.workspace }}/**/TestResults/**/*.trx + path: | + ${{ github.workspace }}/**/TestResults/**/*.trx + ${{ github.workspace }}/**/TestResults/**/*.dmp + ${{ github.workspace }}/**/TestResults/**/Sequence_*.xml retention-days: 5 # --------------------------------------------------------------------------------------------- @@ -273,13 +292,13 @@ jobs: python-version: '3.12' # The same vendored Optuna (v5.0.0) the interop job pins, so the CLI parity cases compare against - # the exact release the port tracks. numpy 2.4.2 matches the interop job. + # the exact release the port tracks. numpy 2.5.4 matches the interop job (NumSharp 0.81.0's reference NumPy). - name: Install vendored Optuna (CLI parity + upgrade-test assets) shell: bash run: | git submodule update --init refs/optuna python -m pip install --upgrade pip - python -m pip install "numpy==2.4.2" + python -m pip install "numpy==2.5.4" python -m pip install -e refs/optuna optuna --version @@ -320,7 +339,8 @@ jobs: timeout-minutes: 45 run: | set -uo pipefail - if [[ "$RUNNER_ARCH" == "X64" ]]; then export OPENBLAS_CORETYPE=Haswell; fi + # OpenBLAS's Haswell pin on x64, except Windows on AMD CPUs with AVX-512 (the script explains both halves). + source "$GITHUB_WORKSPACE/.github/scripts/openblas_coretype.sh" FILTER="TestCategory!=OpenBugs&TestCategory!=HighMemory&TestCategory!=Slow" if [[ "$RUNNER_OS" != "Windows" ]]; then FILTER="$FILTER&TestCategory!=WindowsOnly"; fi failed=() @@ -426,9 +446,12 @@ jobs: # PyPI optuna — a version mismatch makes the differential oracle assert against the wrong impl. git submodule update --init refs/optuna python -m pip install --upgrade pip - # Pin numpy to 2.4.2: its wheel bundles the exact scipy-openblas the NumSharp OpenBLAS natives - # mirror, so BLAS-backed oracles (np.linalg / CMA-ES eigh) stay byte-identical to C#. - python -m pip install "numpy==2.4.2" + # Pin numpy to 2.5.4: its wheel bundles the exact scipy-openblas (0.3.34.106.0) that NumSharp 0.81.0's + # OpenBLAS natives mirror, so BLAS-backed oracles (np.linalg / CMA-ES eigh / UNDX dot products) stay + # byte-identical to C#. Move this pin with $(NumSharpVersion): each NumSharp release bundles the OpenBLAS + # of its reference NumPy (0.80.0 carried numpy 2.4.2's; the step to 0.81.0 moved the seeded CMA-ES, xNES, + # UNDX and JANUS studies in their last bits, so a stale pin fails those byte-exact oracles). + python -m pip install "numpy==2.5.4" python -m pip install -e refs/optuna # Pin SQLAlchemy to 2.0.45, the release the storage-URL port reproduces (StorageUrlStandardParityTests): # its driver registry maps a bare postgresql:// to psycopg2. SQLAlchemy 2.1 maps it to psycopg 3, which @@ -504,15 +527,15 @@ jobs: # generation-by-generation (OptunaSharp.Interop.Pymoo → AgeMoea2ParityTests + PymooSamplerParityTests / # PymooApiUnitTests). --no-deps keeps pymoo from dragging its own numpy/scipy; its AGE-MOEA-2 survival # kernels JIT through numba (llvmlite comes with it), and autograd/alive_progress are import-time deps - # (scipy/matplotlib are already installed above). The "Re-pin numpy last" below keeps numpy on 2.4.2 so - # the byte-exact BLAS oracles stay identical; numba 0.65+ supports numpy 2.4.2. AGE-MOEA-2 parity is + # (scipy/matplotlib are already installed above). The "Re-pin numpy last" below keeps numpy on 2.5.4 so + # the byte-exact BLAS oracles stay identical; numba 0.68 supports numpy < 2.6. AGE-MOEA-2 parity is # host-pinned to x64 (AgeMoea2ParityTests self-skips on the macOS arm64 runner, like CMA-ES/linalg). python -m pip install pymoo==0.6.1.3 --no-deps python -m pip install autograd alive_progress numba # Re-pin numpy last: torch/optuna/numba resolution can drag in a different numpy. - python -m pip install "numpy==2.4.2" + python -m pip install "numpy==2.5.4" python -c "import numpy, optuna; print('optuna', optuna.__version__, '| numpy', numpy.__version__)" - python -c "import numpy; assert numpy.__version__ == '2.4.2', 'numpy must be 2.4.2 for byte-exact BLAS parity'" + python -c "import numpy; assert numpy.__version__ == '2.5.4', 'numpy must be 2.5.4 (NumSharp 0.81.0 bundles its OpenBLAS) for byte-exact BLAS parity'" python -c "from pymoo.algorithms.moo.age2 import AGEMOEA2; import pymoo, numba; print('pymoo', pymoo.__version__, '| numba', numba.__version__)" # Compute the libpython path and export it so pythonnet binds deterministically (PythonSession @@ -585,7 +608,9 @@ jobs: # (SkylakeX/Zen on AVX-512 hosts), whose last bits differ from the committed linalg oracles (generated # on Haswell kernels — AgeMoea2OperatorParityTests' Normalize/Do failed by 1-2 ULP on such a runner) # and could differ between NumPy's and NumSharp's OpenBLAS copies. Every x64 runner has AVX2/FMA. - if [[ "$RUNNER_ARCH" == "X64" ]]; then export OPENBLAS_CORETYPE=Haswell; fi + # Except Windows on AMD CPUs with AVX-512 (Zen 4/5), where OpenBLAS 0.3.34's forced Haswell kernels fault: the script + # decides per runner and says which it chose, and why. + source "$GITHUB_WORKSPACE/.github/scripts/openblas_coretype.sh" for TFM in ${{ needs.setup.outputs.tfms_space }}; do echo "::group::Interop tests ($TFM)" dotnet test test/OptunaSharp.Tests.Interop/OptunaSharp.Tests.Interop.csproj \ @@ -607,7 +632,9 @@ jobs: # (SkylakeX/Zen on AVX-512 hosts), whose last bits differ from the committed linalg oracles (generated # on Haswell kernels — AgeMoea2OperatorParityTests' Normalize/Do failed by 1-2 ULP on such a runner) # and could differ between NumPy's and NumSharp's OpenBLAS copies. Every x64 runner has AVX2/FMA. - if [[ "$RUNNER_ARCH" == "X64" ]]; then export OPENBLAS_CORETYPE=Haswell; fi + # Except Windows on AMD CPUs with AVX-512 (Zen 4/5), where OpenBLAS 0.3.34's forced Haswell kernels fault: the script + # decides per runner and says which it chose, and why. + source "$GITHUB_WORKSPACE/.github/scripts/openblas_coretype.sh" dotnet test test/OptunaSharp.Tests.Interop/OptunaSharp.Tests.Interop.csproj \ --configuration Release --no-build --framework net10.0 \ --filter "TestCategory=Slow" --logger "trx" @@ -786,6 +813,11 @@ jobs: contents: write steps: + # Only the release notes are read from the tagged commit, so only docs/releases is checked out. + - uses: actions/checkout@v7 + with: + sparse-checkout: docs/releases + - name: Download NuGet Packages uses: actions/download-artifact@v8 with: @@ -811,15 +843,41 @@ jobs: echo "IS_PRERELEASE=false" >> "$GITHUB_OUTPUT" fi - # The package table is generated from the packages actually built, so it lists every package the - # release ships and nothing it does not. + # The release notes are a committed file, docs/releases/RELEASE_.md, written in NumSharp's house style + # (the same file and the same sections NumSharp's releases use). Its H1, "# OptunaSharp - ", + # names the GitHub Release; everything after it opens the body, and the install lines and the package table close + # it, the layout of the published 1.0.0 release. Without the file the body is the install header alone, named + # "OptunaSharp v<version>", and GitHub's generated notes are added. The package table is generated from the + # packages actually built, so it lists every package the release ships and nothing it does not. - name: Compose release notes + id: notes shell: bash run: | VERSION="${{ needs.validate-release.outputs.version }}" + NOTES_FILE="docs/releases/RELEASE_${VERSION}.md" + if [ -f "$NOTES_FILE" ]; then + NAME=$(head -n 1 "$NOTES_FILE" | sed -n 's/^# \{1,\}//p') + # A missing H1, or one naming another version (notes copied from the last release and not renamed), would + # publish the wrong title next to these packages: refuse before anything is created. + case "$NAME" in + "OptunaSharp ${VERSION}"|"OptunaSharp ${VERSION} "*) ;; + *) echo "::error::$NOTES_FILE must start with '# OptunaSharp ${VERSION}' (optionally '- <title>'); its first line is: $(head -n 1 "$NOTES_FILE")"; exit 1 ;; + esac + HAS_NOTES=true + else + NAME="OptunaSharp v${VERSION}" + HAS_NOTES=false + fi { - echo "## OptunaSharp v${VERSION}" - echo "" + if [ "$HAS_NOTES" = true ]; then + tail -n +2 "$NOTES_FILE" + echo "" + echo "---" + echo "" + else + echo "## OptunaSharp v${VERSION}" + echo "" + fi echo "### Install via NuGet" echo "" echo '```' @@ -834,17 +892,28 @@ jobs: echo "| ${ID} | [![NuGet](https://img.shields.io/nuget/v/${ID}.svg)](https://www.nuget.org/packages/${ID}/${VERSION}) |" done } > RELEASE_BODY.md + # A heredoc-style output, so a title holding characters a key=value line would misread passes through whole. + { + echo "NAME<<RELEASE_NAME_EOF" + echo "$NAME" + echo "RELEASE_NAME_EOF" + echo "HAS_NOTES=$HAS_NOTES" + } >> "$GITHUB_OUTPUT" + echo "Release name: $NAME (notes file present: $HAS_NOTES)" cat RELEASE_BODY.md - name: Create Release uses: softprops/action-gh-release@v3 with: + name: ${{ steps.notes.outputs.NAME }} files: | artifacts/*.nupkg artifacts/*.sha256 draft: false prerelease: ${{ steps.prerelease.outputs.IS_PRERELEASE }} - generate_release_notes: true + # GitHub's generated notes are only the compare link when nothing merges through pull requests, so they are + # added only when the release has no notes file of its own. + generate_release_notes: ${{ steps.notes.outputs.HAS_NOTES != 'true' }} body_path: RELEASE_BODY.md publish-nuget: diff --git a/.gitignore b/.gitignore index 9f361e9..52c677d 100644 --- a/.gitignore +++ b/.gitignore @@ -7,6 +7,9 @@ [Dd]ebugPublic/ [Rr]elease/ [Rr]eleases/ +# ...except the committed release notes (docs/releases/RELEASE_<version>.md), which the create-release job publishes as +# the GitHub Release: the build-output rule above would otherwise hide them, as NumSharp's .gitignore also re-includes. +!docs/releases/ [Pp]ublish/ x64/ x86/ diff --git a/Directory.Build.props b/Directory.Build.props index 89a8193..4cefb1c 100644 --- a/Directory.Build.props +++ b/Directory.Build.props @@ -77,7 +77,7 @@ NOT part of the build. Bump this one value to move to a newer NumSharp release. ==================================================================================== --> <PropertyGroup> - <NumSharpVersion Condition="'$(NumSharpVersion)' == ''">0.80.0</NumSharpVersion> + <NumSharpVersion Condition="'$(NumSharpVersion)' == ''">0.81.0</NumSharpVersion> </PropertyGroup> <!-- ==================================================================================== @@ -116,4 +116,32 @@ <MicrosoftExtensionsDIImplementationVersion Condition="'$(MicrosoftExtensionsDIImplementationVersion)' == ''">$(MicrosoftExtensionsDIVersion)</MicrosoftExtensionsDIImplementationVersion> </PropertyGroup> + <!-- ==================================================================================== + JIT posture: TieredCompilation + TieredPGO, ON for the whole repository, as NumSharp's own + Directory.Build.props sets them. + + WHAT IT SETS. Both properties become runtimeconfig.json options + (`System.Runtime.TieredCompilation` / `System.Runtime.TieredPGO`) in every project here that + PRODUCES a runtimeconfig: the test hosts, the `optunasharp` CLI, the benchmarks, and the file-based + `dotnet run` apps under the repository root such as examples/ (Directory.Build.props is an implicit + import for those). A hot method then goes from quick tier-0 code through an instrumented tier to + PGO-guided tier-1 code, the most optimized code the JIT produces. + + SCOPE / REAL EFFECT. Both values are the .NET 8+ defaults, so this pins the intent across SDKs and + environments rather than changing measured behaviour. On the src/ class LIBRARIES (OptunaSharp and + every satellite package) it is INERT: a library emits no runtimeconfig, and the consuming + application's own runtimeconfig governs the whole process. An application that wants a shorter + start-up sets `PublishReadyToRun` (and, for a short-lived process, `TieredPGO=false`) in ITS OWN + project; docs/website-src/docs/performance.md ("Start-up time") has the measurements. + + OVERRIDES. A project overrides in its own body (imported AFTER this file, so it wins), and the + `== ''` guards also let a command-line `-p:` / global property win. The CLI turns TieredPGO off: + each `optunasharp` command is a fresh, short process, where PGO's instrumented tier never pays back + before the process exits (measurements in src/OptunaSharp.Cli/OptunaSharp.Cli.csproj). + ==================================================================================== --> + <PropertyGroup> + <TieredCompilation Condition="'$(TieredCompilation)' == ''">true</TieredCompilation> + <TieredPGO Condition="'$(TieredPGO)' == ''">true</TieredPGO> + </PropertyGroup> + </Project> diff --git a/README.md b/README.md index b5b4b43..2ea9924 100644 --- a/README.md +++ b/README.md @@ -24,7 +24,7 @@ <p align="center"> OptunaSharp is <a href="https://scisharp.github.io/OptunaSharp/docs/key-features/parallelization.html"><strong>thread-safe and truly parallel.</strong></a><br> <a href="https://scisharp.github.io/OptunaSharp/docs/key-features/parallelization.html#multi-thread-optimization"><code>nJobs</code></a> runs trials on all your cores at once, with no GIL in the way, and workers on <br><a href="https://scisharp.github.io/OptunaSharp/docs/key-features/parallelization.html#multi-node-optimization">many machines</a> share one study, <a href="https://scisharp.github.io/OptunaSharp/docs/storage.html#concurrency-workers-studies-and-languages-on-one-journal">Python Optuna workers included</a>.<br> - OptunaSharp supports parallelism powered by:<br> single-threaded, <a href="https://scisharp.github.io/OptunaSharp/docs/key-features/parallelization.html#which-threads-run-the-trials">reused dedicated threads and ThreadPool</a> async-await. + OptunaSharp supports parallelism powered by:<br> single-threaded, <a href="https://scisharp.github.io/OptunaSharp/docs/key-features/parallelization.html#which-threads-run-the-trials">reused dedicated threads or the .NET ThreadPool</a>. </p> <p align="center"> @@ -255,19 +255,51 @@ sampler's own work dominates. OptunaSharp's times include the .NET JIT warming u | Study | OptunaSharp | Python Optuna 5.0 | |---|---|---| -| TPE, 6 parameters, 500 trials | 1.12 s | 2.52 s | -| TPE multivariate, 6 parameters, 500 trials | 1.14 s | 2.42 s | -| TPE, 100 parameters, 150 trials | 2.4 s | 19.1 s | +| TPE, 6 parameters, 500 trials | 0.61 s | 2.52 s | +| TPE multivariate, 6 parameters, 500 trials | 0.66 s | 2.42 s | +| TPE, 100 parameters, 150 trials | 1.6 s | 19.1 s | | GP, 6 parameters, 100 trials | 3.47 s | 17.55 s | -| CMA-ES, 6 parameters, 3,000 trials | 1.75 s | 5.21 s | -| CMA-ES, 200 parameters, 100 trials | 2.8 s | 3.3 s | -| NSGA-II, 6 parameters, 3,000 trials | 0.60 s | 3.39 s | -| QMC, 6 parameters, 3,000 trials | 0.64 s | 3.49 s | -| Random, 6 parameters, 5,000 trials | 1.34 s | 1.36 s | -| Random, 1,000 parameters, 200 trials | 13.5 s | 8.4 s | -| Random, 4 parameters, 50,000 trials: each block of 10,000 | 0.7-0.9 s (the first 1.7 s) | 1.9-2.1 s | - -Random sampling over 1,000 parameters is the one measured case where OptunaSharp is slower. +| CMA-ES, 6 parameters, 3,000 trials | 0.74 s | 5.21 s | +| CMA-ES, 200 parameters, 100 trials | 1.0 s | 3.3 s | +| NSGA-II, 6 parameters, 3,000 trials | 0.31 s | 3.39 s | +| QMC, 6 parameters, 3,000 trials | 0.13 s | 3.49 s | +| Random, 6 parameters, 5,000 trials | 0.15 s | 1.36 s | +| Random, 1,000 parameters, 200 trials | 0.6 s | 8.4 s | +| Random, 4 parameters, 50,000 trials: each block of 10,000 | 0.08-0.25 s | 1.9-2.1 s | + +Every OptunaSharp row except GP was measured again on 2026-11-09 after the Rustuna-derived speedups of +[plan 13](docs/plans/13-rustuna-derived-performance.md) and [plan 14](docs/plans/14-rustuna-second-pass.md), which +keep every seeded result: the same probes built before and after plan 14, run back to back. GP moved less than the +noise of a machine that was also running other work, so it keeps its earlier number. + +### Large studies + +40 float parameters in [-10, 10], seed 0, each sampler's defaults (TPE multivariate for one objective, independent +for two), the workloads of [Rustuna's announcement](https://medium.com/optuna/announcing-rustuna-cc82a6815bf7). +[Rustuna](https://github.com/optuna/rustuna) is the Optuna team's Rust port. OptunaSharp ran on 2026-11-09 after +[plan 14](docs/plans/14-rustuna-second-pass.md), on a machine also running other work (about 30 % CPU load), the other +two on 2026-11-08 on a quieter one, so OptunaSharp's column errs on the slow side. OptunaSharp's times include the .NET +JIT warming up. + +| Study | OptunaSharp | Python Optuna 5.0 | Rustuna 0.2.1 | +|---|---|---|---| +| TPE, 1,000 trials | 3.2 s | 35.2 s | 1.36 s | +| TPE, two objectives, 1,000 trials | 10.5 s | 163 s | 6.30 s | +| CMA-ES, 10,000 trials | 3.6 s | 56.9 s | 1.59 s | +| CMA-ES, 100,000 trials | 22.1 s | not run | 13.6 s | +| NSGA-II, 10,000 trials | 1.4 s | 44.2 s | 0.82 s | +| NSGA-II, 100,000 trials | 8.6 s | not run | 19.4 s | + +OptunaSharp's seeded trials are Optuna's; Rustuna's differ from the first trial (its own random generator). Where +OptunaSharp is still behind Rustuna, part of the gap is the protocol it keeps so Python workers can share a study: +CMA-ES pickles its state into the storage every generation, and TPE scores candidates in NumPy's order. The +[Performance and Compatibility](docs/website-src/docs/performance.md) guide lists the opt-in switches that trade +that compatibility for speed. + +For memory, `new InMemoryStorage(compactFinishedTrials: true)` keeps finished trials compactly and gives the same +trials: the 100,000-trial CMA-ES study above keeps 257 MB instead of 1,287 MB once finished, and NSGA-II's 88 MB +instead of 671 MB, in the same time. Finished trials then hand out read-only views instead of dictionaries; the +guide lists what that changes. ### Executors diff --git a/docs/PORTING_PLAN.md b/docs/PORTING_PLAN.md index 2428268..e96bc9d 100644 --- a/docs/PORTING_PLAN.md +++ b/docs/PORTING_PLAN.md @@ -193,7 +193,9 @@ BLAS/LAPACK drift from scipy's by ULPs — the documented GP boundary). The plot precedent): scale-type/bounds/steps construction, `NormalizeOneParam`/`UnnormalizeOneParam`/ `RoundOneNormalizedParam` (affine + log/exp + floor-to-grid), `GetChoicesOfDiscreteParams`, `GetNormalizedParams`, `GetUnnormalizedParam`. **Bit-exact vs Optuna** (pure numpy — no erf/LAPACK; - `log`/`exp`/`floor` match Python bit-for-bit): scale-types/steps/indices, all discrete choice grids, + `log`/`exp`/`floor` match Python bit-for-bit; **corrected 2026-11-11, `8a7e19e`:** the stepped grids' + `np.arange` fill (QA-49) and the rounding's `//` (QA-87) were not NumPy's until they moved onto NumSharp's + `np.arange` and `NDDivision.FloorDivDouble`): scale-types/steps/indices, all discrete choice grids, and the one-param transforms over a 60-config sweep (`Should().Be(0.0)`), plus the boxed int/log-float/ categorical `get_unnormalized_param`. `SampleNormalizedParams` is a documented `NotImplementedException` (needs the 2.12 scrambled Sobol'). `GPRegressor.Kernel(X1,X2)` + `Posterior(x)` — the two-argument cross @@ -496,7 +498,7 @@ moment OptunaSharp.Core loads. Keep it. placeholder with the full `TPESampler`: univariate (independent) AND non-group multivariate paths, so a default `TPESampler()` optimizes single-objective studies end-to-end. Completed the numeric kernel — `Internal/TruncNorm.cs` sampling half (`_ndtri_exp` Newton iter, `ppf`, vectorized - `_log_ndtr`, `_norm_logpdf`), new bit-exact `MathUtil.Expm1` (Kahan `(u-1)x/log(u)`) + `LogAddExp` + `_log_ndtr`, `_norm_logpdf`), new `MathUtil.Expm1` (Kahan `(u-1)x/log(u)`; **corrected 2026-11-11, `0e18eba`:** not bit-exact, 62-84% equal to NumPy where TPE calls it, now NumSharp's UCRT model) + `LogAddExp` (`npy_logaddexp`), `Samplers/Tpe/ProbabilityDistributions.cs` (all four numerical batched kinds, `_MixtureOfProductDistribution.sample` incl. the bit-exact `rng.choice(p=)`/`rand`/`uniform` draw order, and the continuous branch of `log_pdf`), new `Samplers/Tpe/ParzenEstimator.cs` @@ -510,7 +512,7 @@ moment OptunaSharp.Core loads. Keep it. 14 unit tests + 8 live trajectory-parity tests (multivariate continuous/log-float/categorical, independent mode, sum-of-squares, bit-exact startup) across seeds. - **Numeric strategy (all verified against live Optuna before porting):** `Expm1`/`LogAddExp` are - **bit-exact** vs NumPy (checked over the truncnorm input range); `_ndtri_exp` is bit-exact for its + **bit-exact** vs NumPy (checked over the truncnorm input range; **corrected 2026-11-11:** `LogAddExp` is, `Expm1` was not, and both now call NumSharp 0.80.0's public UCRT models); `_ndtri_exp` is bit-exact for its own inputs but the sampling `ppf`/density ride the scalar `erf` → the same **erf/ucrt few-ULP tolerance** as 2.7 (the flagship parity is tolerance-bounded, not bit-for-bit, exactly as the plan anticipates). RNG draw **count and order** are identical regardless, so the study stays in @@ -557,7 +559,7 @@ moment OptunaSharp.Core loads. Keep it. `MultiObjective.UniqueRowsFirstIndex`). Wired the HSSP tie-break into `TpeTrialSplit.SplitCompleteTrialsMultiObjective` (`_get_reference_point` + `SolveHssp`), **removing the `NotImplementedException`** — multi-objective TPE splitting and PED-ANOVA with `target=null` now - run end-to-end. **Numeric:** NumPy `@`/`np.dot` as a sequential dot, `.prod` sequential; + run end-to-end. **Numeric:** NumPy `@`/`np.dot` as a sequential dot (**superseded 2026-11-11, `c600736`:** the 2-D/3-D products now go through NumSharp's `np.dot` on NumPy's OpenBLAS, bit-identical to Optuna on 240 live fronts, and the HSSP tie note below is resolved), `.prod` sequential; `compute_hypervolume` bit-exact-to-tolerance vs Optuna over 120 mixed 2–6D cases (max rel err 2e-16); end-to-end 2-/3-objective MO TPE trajectories match live Optuna in RNG lock-step to the erf tolerance (max abs diff 5.7e-14); MO PED-ANOVA `target=null` matches (exact selection path, erf-tolerance @@ -679,8 +681,11 @@ moment OptunaSharp.Core loads. Keep it. **Parity (verified vs live Optuna 5.0.0.dev):** a **400-config offline differential** — 5 crossovers × {2,3,4} objectives × 25 seeds + 25 constrained (set_constraint), ~10k trials — matched **byte-for-byte with zero divergence** (full study state: every trial's params/values, per-trial generation, parent-cache - trial-id lists). 15 unit tests (hardcoded seed=42 SO sequence, default reference points for M=2/3, - MO/crossover/custom-reference-point reproducibility, validation, experimental+deprecation warnings) + 11 + trial-id lists). (**Extended 2026-11-11, `128761d`:** from eight objectives on NumPy's pairwise row norms in the + association differ from the left-to-right sums the port used, which the 2-4-objective differential could not see + (QA-86); the norms, argmin and min now run through NumSharp, pinned by the live + `ManyObjectives_FullState_IsBitIdentical` at 8 and 10 objectives.) 15 unit tests (hardcoded seed=42 SO + sequence, default reference points for M=2/3, MO/crossover/custom-reference-point reproducibility, validation, experimental+deprecation warnings) + 11 live full-state parity tests (2-/3-objective defaults, 4 crossovers, custom reference points, poly mutation, set_constraint). **Numeric due-diligence (all verified before porting):** `_filter_inf` and the reference-point association are bit-exact (the 4-operand `einsum("ni,pi,p,pm->npm")` reproduced @@ -992,7 +997,7 @@ moment OptunaSharp.Core loads. Keep it. - **`Internal/Hypervolume.cs`** — **new in 2.10 core**. `_hypervolume/wfg.py: compute_hypervolume` (2-D/3-D/N-D WFG) + `hssp.py: _solve_hssp` (2-D + n-D greedy). Consumed by the TPE MO split; the remaining `box_decomposition.py` (`get_non_dominated_box_bounds`) is deferred to **3.2** with its GP - consumer. Carries the 2.10 `[Misaligned]` HSSP ≥3-obj zero-contribution tie note. + consumer. Carried the 2.10 `[Misaligned]` HSSP ≥3-obj zero-contribution tie note, resolved 2026-11-11 (`c600736`) by taking Optuna's BLAS products through NumSharp. - **`Samplers/TPESampler.cs`** — **the complete sampler**: numeric kernel + univariate + non-group multivariate (2.8), the group-decomposed multivariate `group=true` path (2.9), the MO split via `Internal/Hypervolume.cs` (2.10), and — verified in **2.11** — multivariate multi-objective (MOTPE) @@ -1074,7 +1079,7 @@ moment OptunaSharp.Core loads. Keep it. 2.7 **erf/ucrt** ~1-3 ULP tolerance on the truncnorm density, which also bounds 2.8 TPE; the 2.8 **argsort tie order** in `compute_sigmas` (stable vs NumPy's unreproducible x86-simd-sort — diverges only on repeated numerical observations in a multivariate study; continuous/categorical - studies are exact); and the 2.10 **HSSP ≥3-objective zero-contribution tie** on `Internal/Hypervolume.cs` + studies are exact); and the 2.10 **HSSP ≥3-objective zero-contribution tie** on `Internal/Hypervolume.cs` (**resolved 2026-11-11, `c600736`**: the products now run through NumSharp's `np.dot`, so the residuals are Optuna's) (the sequential dot cancels a dominated point's marginal HV to exactly 0 where Optuna's BLAS `np.dot` leaves a sub-ULP residual, so `np.argmax` can pick a different but hypervolume-equivalent point — 2-obj HSSP is dot-free and exact; does not surface in realistic MO TPE); and the 2.13 **UNDX QR column diff --git a/docs/THREADING.md b/docs/THREADING.md index 84937bb..750cc31 100644 --- a/docs/THREADING.md +++ b/docs/THREADING.md @@ -32,7 +32,10 @@ - 2026-11-08: no Core sampler hands one point to two trials asked at once: the samplers that derived a candidate from state that changes only when a trial finishes now also look at the running trials, which leaves sequential runs unchanged; BruteForce diverges from Optuna's strict mode to do so; the Python bridges are measured and - pinned (§6.3; [plan 12](plans/12-parallel-read-duplicates.md)). + pinned (§6.3; [plan 12](plans/12-parallel-read-duplicates.md)); +- 2026-11-12: the genetic samplers redraw a child only when a running trial asked on *another thread* holds it, so a + batch one caller asks on one thread before telling it (Optuna's batch-optimization pattern) draws Optuna's + children again (owner's decision, QA-57 of `docs/qa/PARITY_QA_2026-11-10.md`; §6.3). No threading item is open. §12 lists the known limits. @@ -460,7 +463,7 @@ trial, and the others skip it. | Pruner monitor | `BasePruner.SyncRoot`, one per pruner instance | `Prune` and `FilterStudy` | yes | | Sampler-private locks | `BaseGASampler`, `JanusSampler`, `JanusDeSampler`, `MoeaDSampler`, `SmsEmoaSampler`, `RandomEmbeddingSampler`, `OptunaHubSampler` | per-study caches | taken inside the sampler monitor; `OptunaHubSampler`'s inside the GIL too | | The GIL | CPython | Python objects | taken by the bridges inside the sampler or pruner monitor; released by a thread that holds it while it waits for any lock above (§8) | -| Storage monitors | `InMemoryStorage`, `JournalStorage`, `CachedStorage`, the SQLite `RDBStorage`, the gRPC client's trial cache | the storage's in-memory state | all but `InMemoryStorage`'s: the journal's spans every round trip of an operation, SQLite's every database call, and `CachedStorage`'s and the gRPC cache's the read of new and unfinished trials | +| Storage monitors | `InMemoryStorage`, `JournalStorage`, `CachedStorage`, the SQLite `RDBStorage`, the gRPC client's trial cache | the storage's in-memory state; `InMemoryStorage`'s is also taken by its `GetTrialsPrefixView` for each unfinished record read through it (§6.1) | all but `InMemoryStorage`'s: the journal's spans every round trip of an operation, SQLite's every database call, and `CachedStorage`'s and the gRPC cache's the read of new and unfinished trials | | Journal file locks | `JournalFileBackend`'s offset-cache lock (short), and the lock file (`JournalFileSymlinkLock` or `JournalFileOpenLock`) around each append | the offset cache; one append at a time across processes | the lock file spans the write and its `fsync` | | Database locks | EF Core: `SELECT … FOR UPDATE` row locks and a PostgreSQL advisory lock for schema creation; SQLite's database lock | arbitration between storage instances and processes | yes | | Progress bar | `ProgressBar._updateLock` | the count and the line | reads the best trial | @@ -501,9 +504,11 @@ terms: (§7.1), and the Redis backends' disposed flags. - The heartbeat thread's stop signal, a `ManualResetEventSlim`. -The internal concurrent collections in `OptunaSharp.Collections` (a vendored `ConcurrentDictionary` and -`ConcurrentOrderedDict`) are not used by the library yet; `ConcurrentOrderedDictTests` pins their -contract. +The library uses no concurrent ordered map. OptunaSharp vendored one (`ConcurrentOrderedDict`, over a copy of +dotnet's `ConcurrentDictionary`) until NumSharp 0.81.0 shipped it publicly as +`NumSharp.Collections.ConcurrentOrderedDictionary`; the copies are gone, and +`NumSharpConcurrentOrderedDictionaryTests` pins the contract OptunaSharp expects of NumSharp's type, for when a +concurrent insertion-ordered map is needed. ### 5.2 Lock order @@ -568,9 +573,24 @@ and ends, around one native call to OpenBLAS). or an `UpdateFinishedTrialError`, and tries the next trial. - `EnqueueTrial(skipIfExists: true)` checks the existing trials and then enqueues, in two steps, as in Python. Two threads enqueueing the same parameters at the same moment can therefore both enqueue them. -- `InMemoryStorage` replaces a trial's record on every update instead of changing it (copy-on-write), so - a record read with `deepcopy: false` never changes under its reader. Records read that way are the - storage's own, shared by every thread: never mutate them (§10). +- A record read with `deepcopy: false` never changes under its reader. `InMemoryStorage` writes a running + trial's record in place only while no reader holds it (plan 13, item S4): every read that returns the + stored record (`GetTrial`, `GetAllTrials(deepcopy: false)`, the attribute reads, an unfinished record + read through `GetTrialsPrefixView`) marks it under the storage lock, and the next write copies it + first, as Optuna's copy-on-write does on every write. A finished record is never written again, so the + view reads it without the lock. Records read that way are the storage's own, shared by every thread: + never mutate them (§10). +- With `InMemoryStorage(compactFinishedTrials: true)` (plan 13, item S12) a finished record holds compact, + immutable forms instead of dictionaries. The storage builds them under its lock, on the new record object + before it publishes it, and only reads the dictionaries it compacts (the running record a reader may hold + shares them), so no reader ever sees a record change form. The read-only accessors return the compact + form itself, which any number of threads may read. The mutable accessors (`ParamsDict` and the other + `…Dict` properties, `IntermediateValues`) give the record back a real dictionary with a compare-exchange: + however many threads ask at once, one dictionary becomes the record's and every caller gets that one, so a + write through any of them stays. A thread that loaded the compact form a moment earlier keeps reading it, + which is safe because it holds the same entries. Pinned by + `CompactFinishedTrialsTests.MutableAccessors_UnderContention_AllReturnTheOneDictionary` and + `ParallelWorkers_AndReaders_SeeConsistentRecords`. ### 6.2 Trial @@ -604,6 +624,17 @@ and ends, around one native call to OpenBLAS). - Per-study state lives in `PerStudyState<T>`, keyed by the storage object (held weakly) and the study id, because study ids repeat across storages. `TrialAnchor` detects a deleted study whose id was reused. The class is not synchronized itself: the sampler monitor covers it. +- The performance caches of plan 13 are sampler state of the same kind, unsynchronized and covered by the + monitor: `CmaEsSampler`'s restored optimizer and its folded history (`CmaTrialHistory`, which starts + over when it is handed another storage, study or history), and `TPESampler`'s last trial split + (`TpeSplitCache`). Plan 14 added two more of the same kind: `TPESampler`'s finished trials' internal + values (`TpeObservationCache`, which starts over for another study or storage, holds the storage weakly, + never holds a running trial, and checks each cached row's trial identity, so a study recreated under a + reused id is not read from the deleted one's rows) and `QMCSampler`'s last sample-id key (kept with the + very distribution objects it was computed from). A `SamplerConcurrency.PerWorker` worker instance gets + its own of each, so workers never share one. Each is keyed by what it was computed from (the holder + trial's id, the very records split, the study and storage plus each row's trial, the distribution + objects), so a cache that outlives its study only misses. - Random numbers come from `LazyRandomState`, MT19937, never `System.Random`. An unseeded sampler seeds itself from OS entropy (`RandomNumberGenerator`) rather than the clock. Samplers created at the same moment therefore draw different streams: in one process, in worker processes, and in parallel @@ -643,20 +674,32 @@ and ends, around one native call to OpenBLAS). | `LmCmaSampler` | 8–10 | a Rademacher candidate no running trial of the generation holds (redrawn up to 32 times); otherwise an independent sample | | `TurboSampler`, `SaasboSampler` | every startup round, 7 | the first row of the startup Sobol design no completed or running trial holds (stamped `turbo:init`, `saasbo:init`); rows past the design are the sequence's next points | | `RandomEmbeddingSampler` | up to 21 | an acquisition fitted with the running trials' latents as constant lies, so its optimum moves | - | NSGA-II/III and their CPT variant, AGE-MOEA-2 and its CPT variant, SMS-EMOA, RVEA, MOEA/D, the JANUS multi-objective samplers | 1 in one run of 12–20 | a child generated again while a running trial holds it (up to 32 times); otherwise an independent sample | + | NSGA-II/III and their CPT variant, AGE-MOEA-2 and its CPT variant, SMS-EMOA, RVEA, MOEA/D, the JANUS multi-objective samplers | 1 in one run of 12–20 | a child generated again while a running trial asked on another thread holds it (up to 32 times); otherwise an independent sample. A batch asked on one thread is not redrawn (below) | | `BruteForceSampler`, both modes | strict 3–8 per 88 trials, default 0–1 | a point no running trial holds or will take (below) | - **Sequential runs are unchanged.** Every rule but JANUS's keys on *other* running trials, and a run of one trial at a time has none; JANUS's hands each slot of a generation out once, which consecutive trials asked one at a time do anyway. So such a run never skips a slot, redraws or lies, and seeded results, Optuna parity and JANUS's byte - parity with its reference are the same. (One edge: after a JANUS trial fails, its generation is never told, and + parity with its reference are the same. + - **One caller's batch follows Optuna in the genetic samplers** (owner's decision of 2026-11-12, QA-57). A caller + that asks several trials on one thread before telling any of them (Optuna's batch-optimization tutorial) keeps + them all running without any concurrency, and Optuna generates each of their children once. The genetic samplers + (the row above) therefore redraw a child only when a running trial asked on *another* thread holds it: each held + child records a token of the thread that claimed it (`AskingThread`, an object per thread, since .NET reuses the + managed ids of exited threads). Under `Optimize(nJobs)` every trial runs on one worker thread, and concurrent + callers ask on their own threads, so both are still steered apart. Seed 311031104, population 6, batches of 5: + trial 18 is Optuna's `v5=0.02621137972316322` again (it was trial 1's value, from a redrawn child). The other + rules still key on every other running trial, so a one-thread batch of PSO, DE, LM-CMA, JANUS, TuRBO, SAASBO, + REMBO or BruteForce is steered apart like concurrent asks; those samplers have no Optuna trajectory to follow, + except BruteForce, whose concurrency rule is already `[Misaligned]` (below). (One edge: after a JANUS trial fails, its generation is never told, and the trials past its slots are sampled independently instead of evaluating its candidates again.) - **Pinned by** `SamplerParallelReadTests`, over every Core sampler, both on eight threads (`ParallelReads.Fire`) - and in lockstep, every read of a round landing before any write (`ParallelReads.ReadInLockstep`), with the + and in lockstep, every read of a round landing before any write, each on a thread of its own as a concurrent + worker's (`ParallelReads.ReadInLockstep(readsOnOwnThreads: true)`), with the per-worker instances too; with populations larger than a round, so a generation's trials finish before the generation is complete; and in whole `Optimize(nJobs: 16)` runs, where no sampler that never re-proposes a finished point evaluated a point twice in 120 trials (xNES aside: its distribution can degenerate one trial at - a time too, plan 12 §8). The rounds alone were not enough: a first JANUS fix, + a time too, plan 12 §8; REMBO aside since 2026-11-14, below). The rounds alone were not enough: a first JANUS fix, which freed a slot once its trial finished, passed every volley and still repeated 41–65 points in 120 trials of `Optimize(nJobs: 16)`, because rounds release a population of 7 together. - **History repeats are not collisions.** The genetic samplers, DE, JANUS-DE, PSO and LM-CMA re-propose finished @@ -664,6 +707,14 @@ and ends, around one native call to OpenBLAS). point of an earlier generation), one trial at a time as well; every other Core sampler repeats no told trial under parallel reads either, except that CMA-ES and VkD-CMA seed each trial with `randint(1, 65536) + trial.number`, as Optuna does, so two trials of a generation share a point about once in 65,535 pairs. + REMBO is the open exception (found 2026-11-14): its paper-faithful optimizer repeats told trials one trial at a + time too, in 82 of 120 seeds of the whole-run objective. It reaches the same parameters from latent points that + the projection clips onto one corner of the box, and it proposes the incumbent's latent point again once its GP is + confident. That is a bug, not a design choice: `RandomEmbeddingSamplerTests.Optimize_OneWorker_EvaluatesNoPointTwice` + reproduces it, and REMBO's whole-run case, which failed 2 of about 45 CI runs of the 1.1.0 branch, is + `[OpenBugs]` (`Optimize_SixteenWorkers_Rembo_EvaluatesNoPointTwice`). A trace of 13,200 concurrent proposals + found no read that missed a running trial's latent point, so the cause is not the concurrency; its volleys still + repeat nothing and stay asserted. - **One process.** PSO's particles, DE's targets and TuRBO's and SAASBO's design rows are stamped in the storage, so they steer apart asks from different processes too. JANUS's slots, the redraws and BruteForce's record of handed-out values live in the sampler instance, guarded by its monitor: two processes on one storage can still @@ -1245,13 +1296,13 @@ table above repeats the measurement on 2026-11-07, after the flag became the bac | `JournalConcurrencyTests` | both lock protocols under contention; stale-lock takeover after the grace period; mixed protocols on one journal; separate storages on one study; a shared backend's offset cache; many studies on one journal; enqueued trials popped once; one trial's concurrent reports, suggestions and constraints; the create race | | `HeartbeatTests` | heartbeat threads beat and stop; a failed write ends only its thread, reported like `threading.excepthook`; trials complete when every heartbeat write fails; `FailStaleTrials` and the retry callback; `Ask`'s warning outside `Optimize` | | `SamplerNJobsSweepTests`, `PrunerNJobsSweepTests` | every Core sampler and pruner under `nJobs` on a journal: contiguous numbers, every trial ends as its rule dictates | -| `SamplerParallelReadTests` | §6.3, plan 12: every Core sampler, read by eight trials at once on eight threads and in lockstep, hands no point to two of them, and the samplers that never re-propose a finished point repeat none (CMA-ES and VkD-CMA one, through Optuna's seeding); per-worker instances; populations larger than a round; whole `Optimize(nJobs: 16)` runs evaluating no point twice; Grid and BruteForce (both modes, `[Misaligned]`) over 88 of 90 points; DE and PSO with more trials than members, the rest sampled independently without warnings; the sequential repeats of the samplers allowed them | +| `SamplerParallelReadTests` | §6.3, plan 12: every Core sampler, read by eight trials at once on eight threads and in lockstep, hands no point to two of them, and the samplers that never re-propose a finished point repeat none (CMA-ES and VkD-CMA one, through Optuna's seeding); per-worker instances; populations larger than a round; whole `Optimize(nJobs: 16)` runs evaluating no point twice (REMBO's held out as `[OpenBugs]`, with its one-worker reproduction in `RandomEmbeddingSamplerTests`); Grid and BruteForce (both modes, `[Misaligned]`) over 88 of 90 points; DE and PSO with more trials than members, the rest sampled independently without warnings; the sequential repeats of the samplers allowed them | | `BridgeSamplerParallelReadTests` (interop) | §6.3, plan 12: each Python bridge's repeats under parallel reads, exact in lockstep (PyCma's compared bit for bit with `optuna_integration.PyCmaSampler`) and bounded on threads; BoTorch in the slow category | | `LazyRandomStateSeedingTests` | unseeded samplers created together never share a stream; seeded ones stay reproducible | | `OsEntropySeedTests` | numpy's OS-entropy seeding: the constructor's key, position 623 and draws, and a reseed's kept position and dropped Gaussian, against numpy 2.4.2 output for injected entropy; no repeated draw in 300,000 reseeds | | `TerminatorTests` | `TerminatorCallback` at `nJobs: 8` runs its terminator one call at a time | | `ProgressBarTests` | the bar counts every `nJobs` trial once, in order | -| `ConcurrentOrderedDictTests` | the contract of the internal concurrent collection (§5.1) | +| `NumSharpConcurrentOrderedDictionaryTests` | the contract OptunaSharp expects of NumSharp's `ConcurrentOrderedDictionary` (§5.1) | | `ConcurrencyGunTests` | the harness below: shooters are dedicated threads, halted at the gate and released into the shot together; the callbacks run while every shooter is halted; failures are reported by round and thread. It catches a lost update in an unguarded read-modify-write, with a control that must show nothing, and pins that NumSharp's generator (0.80.0 and later) never tears when drawn without the sampler monitor (§6.3). A lock-order deadlock is reported as a hang, and its shooters are freed | | `TrialConcurrencyCoverageTests` | one trial driven by every shooter at once (§6.2, §6.4, §6.5): one report of a step stored, and the trial's view agrees with the storage; one name sampled once; distinct names each sampled once with distinct draws; several tells (through the `Trial` and through its number) store one result, refuse the rest, and run `AfterTrial` once; `skipIfFinished` tells all return the stored result; pruning decisions made on each trial's own values, one at a time | | `StudyConcurrencyCoverageTests` | one study used by every shooter at once (§6.1, §7.1), in memory, through one journal storage, and through one journal storage per thread: asks get distinct trials numbered without a gap; an enqueued trial goes to exactly one asker; a waiting trial claimed through the storage has one winner; `CreateStudy(loadIfExists: true)` creates the study once | diff --git a/docs/plans/13-rustuna-derived-performance.md b/docs/plans/13-rustuna-derived-performance.md new file mode 100644 index 0000000..cec8075 --- /dev/null +++ b/docs/plans/13-rustuna-derived-performance.md @@ -0,0 +1,472 @@ +# Plan 13 — Rustuna-derived performance: compatible speedups first, opt-in paths where results would change + +> **Status: BUILT (2026-11-09).** Phases 1-4 are on `main`: `99e9e73` (S1-S3, D1), +> `f8df1a5` (S4, S7), `4464e8a` (S3, S5, S6), `9043b43` (S10, S9 as measured). The owner then decided the three open +> items (2026-11-09): S8 built (`53a7a0f`), S12 built as an opt-in (`f0d62a0`, `InMemoryStorage(compactFinishedTrials: true)`, +> §10.2), D2 not built (exact kernel only). S11 was measured and changes nothing. §10 records what was built, how it +> was gated, and the before/after measurements. Background, benchmarks and the full Rustuna read-through: catalog note +> `optunasharp/notes/rustuna-comparison-2026-11-08.md`. + +--- + +## 1. The request and the decisions (owner, 2026-11-08) + +The request: "Write a plan for rustuna's optimization's integration, with evaluation for dual-impl recommendation +(user chooses if we use Optuna's path or Rustuna)." + +[Rustuna](https://github.com/optuna/rustuna) is the Optuna team's Rust port (0.2.1 on PyPI). On its announcement's +workloads it is 3-60x faster than OptunaSharp, which is itself 3-5x faster than Optuna 5.0 (§2.1). Most of the gap is +implementation, not anything Optuna compatibility requires: a scratch prototype took CMA-ES at 100,000 trials from +812 s to 26 s with byte-identical results (§2.3). + +| Question | Answer | +|---|---| +| Default when a Rustuna-style path would change results or storage contents | "We would prefer rustuna unless it affects results." So a Rustuna-style change that keeps every result becomes the only implementation; one that changes results needs a measurement of how different (§2.4) and a decision per item | +| CMA-ES keeping the optimizer it just told (Rustuna's live object) | Opt-in; Optuna's path stays the default (§5.1) | +| TPE fast numerics in candidate scoring | Decide after the exact fused kernel exists and can be measured (§5.2) | +| Separate trial queue (Rustuna's `TrialQueue`) | Deferred. The owner asked whether Rustuna has one: it does (§5.3) | +| Trial discarding (Rustuna's `apply_discard`) | Deferred: "what's best + don't break Optuna compatibility". §5.4 proposes compacting finished trials in memory instead, which keeps every API result | +| Where a user flips a switch | Deferred. The CMA-ES choice above was made on a page that showed a constructor parameter; §5.5 proposes that shape for every switch | + +## 2. Evidence + +### 2.1 Where we stand + +i9-13900K, Windows 11, Release, every process opted out of power throttling; OptunaSharp `d0558f5`, Rustuna 0.2.1, +Optuna 5.0.0; 40 float parameters in [-10, 10], seed 0, default samplers. + +| Workload | OptunaSharp | Rustuna 0.2.1 | Optuna 5.0 | +|---|---|---|---| +| TPE, 1,000 trials | 9.94 s | 1.36 s | 35.2 s | +| MOTPE (2 objectives), 1,000 trials | 36.6 s | 6.30 s | 163 s | +| TPE, 1,000 trials, 4 threads | 9.29 s shared / 2.77 s PerWorker | 0.40 s | 32.5 s | +| CMA-ES, 10,000 trials | 18.3 s | 1.59 s | 56.9 s | +| CMA-ES, 100,000 trials | 812 s | 13.6 s | not run | +| NSGA-II, 10,000 trials | 3.51 s | 0.82 s | 44.2 s | +| NSGA-II, 100,000 trials | 62.9 s | 19.4 s | not run | + +Rustuna is API-compatible, not result-compatible: its seeded trials differ from Optuna's from the first trial (its +own RNG, `rand::StdRng`), while OptunaSharp's are identical to Optuna's. + +### 2.2 Where the time goes (dotnet-trace, `dotnet-sampled-thread-time`) + +| Workload | Profile | +|---|---| +| CMA-ES, 10k | 88 % per ask: eigendecomposition 40 % (the optimizer is rebuilt from its pickle every ask and loses its cached decomposition), restore 21 %, generation scan 17 % (O(n) per ask) | +| NSGA-II, 10k | ~66 % in `Trial.SuggestFloat`: `InMemoryStorage.SetTrialParam` clones the trial's dictionaries on every suggest (Optuna's copy-on-write), O(d²) per trial; GC pauses 22 % | +| TPE, 1k | `MixtureOfProductDistribution.LogPdf` 58 %, with 4.4 GB of candidate × kernel × dimension temporaries per 1,000 trials | +| MOTPE, 300 trials (3.87 s) | the trial split 0.93 s (24 %: `FastNonDominationRank` 0.53 s, `UniqueRows` 0.39 s), recomputed for each of the 40 parameters; `SetTrialParam` 0.89 s (23 %); scoring 0.95 s | + +### 2.3 The CMA-ES prototype (scratch copy of `d0558f5`) + +`Samplers/CmaEsSampler.cs` changed in three ways, and one line of `SearchSpace/IntersectionSearchSpace.cs`: + +1. **Optimizer cache.** The optimizer deserialized from the latest stored state is kept, keyed by the trial that holds + that state (a finished trial cannot change). Later asks of the generation reuse it, eigendecomposition included. + After every tell it is dropped, so the next ask deserializes the state just stored, as Optuna does. +2. **Folded history.** Instead of copying and filtering every trial on every ask, the sampler folds the leading run of + finished trials once, in trial order, into a completed list, a by-generation index and the latest state holder. Each + ask classifies only the trials after the first unfinished one. +3. **Zero-copy reads.** The sampler and `IntersectionSearchSpace.Calculate` read `Study.GetTrialsView()`, the window the + genetic samplers already use, instead of a full copy of the history. + +| CMA-ES, 40-D, seed 0 | `d0558f5` | prototype | prototype, `OPENBLAS_NUM_THREADS=1` | Rustuna 0.2.1 | +|---|---|---|---|---| +| 10,000 trials | 17.7-18.9 s | 3.3-5.2 s | 2.56-2.59 s | 1.4-1.65 s | +| 100,000 trials | 812 s, 3.4 GB peak | 33.0-34.2 s, 31 GB allocated, 15 gen-2 GCs | 26.0 s | 13.4-13.9 s | + +**Byte-identical**, three ways: +- Five seeded studies were hashed over every trial's number, state, values, params and system attributes (the stored + `cma:optimizer:N` pickle chunks included): 40-D CMA 3,000 trials, SepCMA, with-margin, lr-adapt, and 8-D where + every 7th trial fails. The hashes equal the unmodified build's. +- 86/86 CMA-ES, pickle and search-space unit tests pass, as on the unmodified build. +- 29/29 live-Python interop tests pass, including C# and Python workers taking turns on one study, with the engine + required. + +**The trap.** Reusing the *told* object instead of reloading the stored state moved seeded results. Optuna's pickle +stores only the upper triangle of the covariance matrix and mirrors it on load; the told matrix keeps the +floating-point asymmetry of the update. SepCMA, which stores its diagonal exactly, did not move. + +**OpenBLAS.** At `nJobs: 1`, `TrialExecutorSnapshot.BlasThreadsFor` leaves OpenBLAS at its default thread count, and +the trace shows about three cores of unmanaged time beside the one optimizing thread. With `OPENBLAS_NUM_THREADS=1` +the unmodified 3,000-trial study ran in 5.6 s instead of 8.3-9.0 s, with the same hashes. + +### 2.4 How different the result-changing paths are (measured 2026-11-08) + +**CMA-ES keeping the told optimizer**, against the compatible cache, 10 seeds × 3,000 trials: +- 40-D sphere: the first trial that differs is trial 32 (generation 3) in every seed. The first difference can already + be large (a parameter can change sign): a last-bit change in the covariance can flip an eigenvector's sign, so the + same random draw maps to a different point of the same distribution. Best value, told / compatible: median 0.79, + range 0.51-1.48. Same quality, a different run. +- 10-D Rastrigin: the first difference is at trial 22, 4e-14 to 7e-12 relative, and the best value is identical in all + 10 seeds. +- Storage is unchanged: the pickle is still written every generation, so Python workers and resuming still work; + they just don't reproduce the C# run exactly. +- Speed with single-threaded OpenBLAS: 10k 2.57 → 2.18 s, 100k 26.0 → 21.9 s (about 15 %). With the default thread + count the gap is larger (10k 4.7-5.2 → 2.6 s, 100k 33.0 → 25.3 s), because each skipped eigendecomposition is a + multi-threaded one. + +**TPE fast numerics**, simulated: noise of a chosen size was added to every acquisition value, drawn from its own +counter so the sampler's random stream was untouched. +- TPE, 40-D multivariate, 1,000 trials, 3 seeds (990 decisions each): noise of 1e-12, 1e-9 and even 1e-6 changed no + decision. The smallest gap between the best and second-best candidate was 3.4e-4 (median 1.2; acquisition values + up to 89). +- MOTPE, 40 parameters, 300 trials, 2 seeds (11,600 decisions each): identical with 1e-12 and 1e-9; 1e-6 changed + decisions (first difference at trial 99 and trial 244). Smallest gaps 1.6e-7 and 3.8e-7. +- A reordered sum here errs by about 1e-13, so these runs had a margin of 5-9 orders of magnitude. That is not a + guarantee: one near-tie in a long run flips one decision, and from there the run differs from Python. Noise in + candidate *sampling* (not tested) would change stored parameters in the last bit. + +**Trial queue** (no numbers): in one process it is identical, since Rustuna also creates the WAITING trial at enqueue +time and first-in-first-out equals Optuna's lowest-number-first pop. Across processes, an in-memory queue is private; +a SQLite queue is shared and pops atomically. + +**Trial discarding** (no numbers): sampling is unchanged when only trials no sampler needs are dropped (CMA-ES reads +only the latest state holder and the current generation). `study.Trials`, the trials dataframe and the best trial (if +the best was dropped) change. + +## 3. The rule: one implementation or two + +The owner's rule, applied to each change: + +1. **Does the Rustuna-style path change anything observable?** Observable means any of: + - seeded parameters or values, compared with Python Optuna; + - bytes written to storage; + - what public APIs return (`Study.Trials`, the best trial, attributes, counts); + - behavior across processes or with Python workers sharing the storage; + - which inputs raise errors, and when. +2. **No** → one implementation. The faster path replaces the Optuna-structured code; there is nothing for a user to + choose between. The gate is §6's "no observable change". +3. **Yes** → measure how different (trajectory divergence, quality over seeds, cross-process semantics), then the owner + decides per item. A path that changes results defaults to Optuna's behavior so far (§1); the other path is a switch + on the component it changes (§5.5). +4. **Build a second path only if it pays.** It needs a measured gain on a §7 workload and no compatible change that + gets most of it. Otherwise it is not built: two paths mean two code paths to test and document forever. + +## 4. Inventory and verdicts + +"Same results" items are a single implementation (rule 2). Rustuna references are to `K:/source/rustuna` at `8acb2dd`. + +| ID | Change | Rustuna does | OptunaSharp today | Evidence | Verdict | +|---|---|---|---|---|---| +| S1 | CMA-ES optimizer cache, dropped after each tell | keeps the live `cmaes.CMA` object (`rustuna_pyo3/src/sampler/cmaes.rs`) | restores from the pickle every ask | §2.3 (measured) | same results: build (Phase 1) | +| S2 | Folded history for CMA-ES | keeps the generation's trial ids; `StudyCache` folds with a cursor | full copy + scan every ask | §2.3 (measured) | same results: build (Phase 1) | +| S3 | Zero-copy history reads in the search spaces and the remaining samplers | samplers read `&PersistedTrial` under the storage lock | `IntersectionSearchSpace`, `GroupDecomposedSearchSpace`, QMC and CMA-ES copy the list per call | §2.3 for the intersection space | same results: build (Phases 1, 3) | +| S4 | In-place writes to a running trial, snapshots built only when read | `set_trial_param` inserts in place; `get_trials` clones for callers | `InMemoryStorage.SetTrialParam` clones the trial's dictionaries per suggest | §2.2: 66 % NSGA-II, 23 % MOTPE, 12 % CMA-ES | same results: build (Phase 2) | +| S5 | MOTPE split cache | `split_cache` per (completed trial numbers, gamma) | split recomputed per parameter; only the HSSP is cached (as in Optuna) | §2.2: 24 % of MOTPE | same results: build (Phase 3) | +| S6 | TPE exact fused kernel | accumulates each candidate into one n-kernel vector with precomputed kernel constants | builds candidate × kernel × dimension matrices | §2.2: 58 % of TPE, 4.4 GB per 1k trials | same results if NumPy's operation order is kept: build (Phase 3) | +| S7 | Interning of parameter names and distributions | interned keys; categorical labels stored once per study | a new key string per suggest when computed; distribution objects per trial | memory: CMA-ES history 2.5 GB at 100k | same results: build (Phase 2) | +| S8 | Bulk attribute writes (`SetUserAttrs`) | `set_trial_attrs` / `set_study_attrs` in bulk | one storage call per attribute | not measured | added API: build (Phase 4) | +| S9 | Lazy attribute decoding in database storages | attributes are strings (no JSON) | JSON parsed per attribute at load | Rustuna's motive: 100,000 `json.loads` to load 10k trials × 10 attrs | same values; errors surface on access: evaluate (Phase 4) | +| S10 | Incremental reads in `CachedStorage` | `CachedStorage` wrapper returns references after a sync | `GetTrialsPrefixView` falls back to a full copy | not measured | same results: build (Phase 4) | +| S11 | OpenBLAS thread policy at `nJobs: 1` | n/a | default thread count | §2.3: 8.3-9.0 → 5.6 s, same hashes | same results; GP's large matrices need measuring first (Phase 5) | +| S12 | Compact storage of finished trials | `PersistedTrial` keeps internal values only | per-trial boxed dictionaries | 2.5 GB at 100k CMA-ES | same results: the compatible answer to discarding (Phase 6) | +| D1 | CMA-ES reuses the told optimizer | yes | no | §2.4: results differ from generation 3; ~15 % faster | **opt-in, Optuna default** (owner) (Phase 7) | +| D2 | TPE fast numerics in scoring | its own numerics | NumPy's | §2.4: no decision changed in measured runs; gain unknown | **decide after S6** (owner) | +| D3 | Separate trial queue | `TrialQueue`: in-memory, SQLite3, directory; Redis planned | WAITING trials in storage | §2.4 | **deferred** (owner) | +| D4 | Trial discarding | `apply_discard` + `discard_trials` | none | §2.4 | **deferred** (owner); S12 first | +| — | Process-local CMA-ES state (no pickle) | yes | no | after S1, the pickle is ~2 % of the 10k profile | rejected: breaks resuming and mixed fleets for ~2 % | +| — | ChaCha RNG | `rand::StdRng` | MT19937 | the RNG never shows in a profile | rejected: loses parity, gains nothing | +| — | String-only attributes | yes | JSON values | | rejected: an API break; S9 gets the gain | +| — | Seeding CMA-ES once instead of per ask | yes | per ask (Optuna) | negligible | rejected | +| — | Dropping pruners, callbacks, timeout, `n_jobs`, per-trial logging | yes | no | the log line is already skipped unless INFO is on | rejected | +| — | Parallel sampling under one shared sampler | fine-grained locks; the GIL released while sampling | `SamplerConcurrency.Shared` serializes; `PerWorker` samples in parallel | 4-thread TPE: 0.40 s vs 2.77 s PerWorker | no new work: `PerWorker` is the existing switch, and plan 12's no-duplicate guarantee rests on the shared lock | + +Already done before this plan: the genetic samplers fold their generations incrementally +(`BaseGASampler.GenerationTracker`, O(new trials) per ask), which is Rustuna's `generation_to_numbers`. + +### 4.1 Notes on the single-implementation items + +- **S1-S3 (Phase 1).** Port the prototype to HEAD (NumSharp 0.80.0 since), without its bisection switches and its + first-version leftovers (the string-keyed cache, the generation memo). Edge cases to test: + - trials that finish out of order wait in the tail and fold in trial order; + - a FAIL trial that told a generation (the old state is restored again); + - `considerPrunedTrials` (pruned trials folded as value-rewritten copies); + - warm start (`sourceTrials`); + - a new study on a storage that reuses ids (the fold resets when the history no longer starts with the folded trials); + - `SamplerConcurrency.PerWorker` (the clone gets an empty cache); + - a stuck RUNNING trial (the fold stops there; speed degrades toward today's, results stay right). +- **S4 (Phase 2).** Keep a mutable draft for each running trial inside `InMemoryStorage`. A write changes the draft in + O(1) and marks it dirty; a read (`GetTrial`, `GetAllTrials`, a `TrialsPrefixView` index) publishes an immutable + `FrozenTrial` snapshot from a dirty draft, under the storage lock, and caches it until the next write. A sequential + trial does 40 writes and a few reads, so O(d) instead of O(d²). + - The view then takes the storage lock only for a dirty running trial, which keeps plan 12's readers of running + trials (`HandedOutParams`) correct. + - The invariant is the one Optuna's copy-on-write protects: a snapshot a caller holds never changes. Tests assert it + for every path that hands one out. +- **S5 (Phase 3).** Cache the identities of the split, not snapshots: constant liar re-reads running trials, whose + parameters change between suggests. Key it by a per-study counter of finished trials that `InMemoryStorage` bumps, + so the key costs O(1); other storages fall back to keying by the list of trial numbers and states. +- **S6 (Phase 3).** Fuse `MixtureOfProductDistribution.LogPdf` / `AddContinuousLogPdf` into per (candidate, kernel) + loops without the big temporaries. Byte identity requires NumPy's order: + - the batched truncated-normal log-pdf (`_truncnorm.logpdf(...).sum(axis=-1)` in `probability_distributions.py`) + computes each term as `(_norm_logpdf(z) - log_gauss_mass) - log(scale)`, with NumPy's `z**2` on an array (a + square, not `pow`), then sums over the continuous dimensions with NumPy's pairwise summation over a contiguous + axis; replicate that per (candidate, kernel) on a stack buffer with `MathUtil.PairwiseSum`; + - precompute only the terms NumPy computes per kernel anyway (log mass, log scale); the same value computed once + instead of 24 times has the same bits; + - Rustuna's binned bandwidths (`binned_sigmas`, O(n) instead of a sort) are probably bit-identical: test that, adopt + if so. + - If some kernel cannot be made byte-identical, keep the old one for it and move the fast one into D2. +- **S9 (Phase 4).** Measure first: load time and allocations of a 10k-trial SQLite study with CMA-ES pickles. The only + observable difference is when malformed JSON raises (on access instead of on load); document it, or validate + cheaply at load. +- **S11 (Phase 5).** Measure `GPSampler` (500 and 1,000 trials) and CMA-ES (10, 40, 100 dimensions) with OpenBLAS at 1 + thread and at the default. Results are identical either way, so this is a resource policy: choose from the numbers + (one thread at `nJobs: 1`, or by matrix size). `TrialExecutorOptions.BlasThreads` already lets a user override it. +- **S12 (Phase 6).** Store finished trials compactly while every API still returns the same `FrozenTrial` contents: + - parameter values as one internal-representation `double[]` per trial against a per-study parameter index; + - distributions and names shared (S7); + - attributes as raw JSON until read (S9); + - snapshots materialized on read and cached weakly. + Measure the memory of a 100k-trial CMA-ES study before and after. This is the compatible answer to the owner's + "what's best + don't break Optuna compatibility" for discarding. + +## 5. The switches (two paths) + +### 5.1 D1: `CmaEsSampler(..., reuseToldOptimizer: false)`, decided + +The owner chose opt-in with Optuna's path as the default. +- **When true,** after a tell the told optimizer becomes the cache for the state it just stored, so the next asks skip + the restore. It is still written to storage exactly as before, so resuming and Python workers work, but no worker + reproduces the C# run. +- **API.** The parameter goes after every Optuna parameter, so positional calls ported from Python keep their meaning. + The XML doc states the consequence in its first sentence: seeded runs stop matching Python Optuna from generation 3. +- **Tests:** + - default-path parity is unchanged (the Phase 0 gates); + - with the switch on: convergence over seeds on sphere and Rastrigin (§2.4's numbers as the bar), the mixed-fleet + interop case still completes, and a failing teller still restores the old state; + - a guard test that a default-constructed sampler stays on Optuna's path. + +### 5.2 D2: TPE fast numerics, decide after S6 + +Phase 3 builds S6. Then measure two things: +- the time scoring still takes; +- a fast scoring kernel (vectorized exp and log, reordered sums), with candidate sampling left exact. + +Rerun §2.4's noise harness, extended to MOTPE with 1,000 trials and to constraints, and ask the owner with both numbers. +If built, it is `TPESampler(..., numerics: TpeNumerics.Exact)` with the default the owner picks. + +### 5.3 D3: separate trial queue, deferred + +Rustuna's design, for the record: +- A `TrialQueue` trait (`rustuna_core/src/trial_queue.rs`) with an in-memory default. +- `SQLite3TrialQueue`: a namespaced `trial_queue` table with an atomic pop. +- `DirectoryTrialQueue`: `pending/` and `processing/` files. +- A Redis backend, planned. +- `enqueue_trial` still creates the WAITING trial in storage, numbered at enqueue time, then pushes its id. `ask` pops + from the queue instead of scanning storage. +- `add_trial` with WAITING is not queued. + +Recommendation when the owner returns to it: opt-in, with Optuna's storage-backed WAITING trials as the default: +- the gain in memory is nil (our WAITING pop is already O(1) through a cursor); +- on database storages it saves one query per ask; +- a SQLite or Redis queue fixes Optuna's duplicate pops on SQLite. + +The risk of a default in-memory queue is private enqueues across processes. + +### 5.4 D4: trial discarding, deferred + +S12 comes first because it saves memory without changing any API result. Discarding is worth reopening only if S12's +measured memory is not enough. If it is reopened, the compatible slice is sampler-driven discarding of what no +sampler or API caller can need, which is hard to define for the public `Study.Trials`. Anything beyond that changes +`Study.Trials`, so it would be opt-in on `InMemoryStorage`. + +### 5.5 Where switches live (proposed; the owner deferred the general question) + +- **On the component they change:** a constructor parameter or options property of the sampler, storage or queue. + Nothing process-wide: a process default would also reach libraries in the same process (the study `OptunaSearchCV` + creates). +- **Named for the behavior, not for Rustuna:** `reuseToldOptimizer`, `TpeNumerics.Fast`, `DiscardTrials`. +- **Defaults chosen per item by the owner;** so far Optuna's behavior (§1). +- **One documentation page,** "Performance and compatibility", lists every switch: what it changes, whether seeded runs + still match Python, and whether the storage can still be shared with Python workers. + +## 6. Phases and gates + +| Phase | Content | Depends on | +|---|---|---| +| 0 | Gates and benchmarks: long-horizon live-parity cases and the benchmark harness (below) | — | +| 1 | S1, S2, S3 for CMA-ES and the intersection search space | 0 | +| 2 | S4 in-place writes behind snapshots, S7 interning | 0 | +| 3 | S5 MOTPE split cache, S6 TPE exact kernel, S3 for the remaining samplers (QMC) and `GroupDecomposedSearchSpace`; then the D2 measurement and question | 0, 2 | +| 4 | S10 `CachedStorage` incremental reads, S9 lazy attributes (after measuring), S8 bulk attribute API | 0 | +| 5 | S11 OpenBLAS policy (measure, then choose) | 1 | +| 6 | S12 compact finished trials | 2 | +| 7 | D1 `reuseToldOptimizer` | 1 | +| 8 | Docs: the "Performance and compatibility" page; README Performance rerun; THREADING.md §6 (the new sampler state is guarded by the sampler lock); catalog | each phase | + +**Gate A: no observable change** (every S item): +- The live-parity suites: unit, interop with the engine required, package parity. +- Phase 0 adds [Slow] interop cases that run Python Optuna and compare every trial, stored pickles included: + - CMA-ES 40-D for 3,000 trials, and the failing-trial study; + - TPE 40-D for 1,000 trials; + - MOTPE 300 trials; + - NSGA-II 2,000 trials. + Python is the oracle on every CI OS, so no hash is committed (the bit-exact suites depend on each image's libm). +- During development: a before/after hash probe of seeded studies, built from two trees. `dotnet run probe.cs` re-runs + a stale build after a referenced project changes, so build explicitly and check that the DLL holds the new code. + +**Gate B: concurrency.** +- `ConcurrencyGun` and plan 12's parallel-read tests stay green. +- Each phase that adds state to a sampler or storage adds `Fire` / `ReadInLockstep` cases for it. + +**Gate C: the gain is real.** +- The §7 workloads before and after, in Release, with power throttling opted out and the OpenBLAS thread count stated. +- Every number goes into this plan and, at the end, the README. + +**Gate D: two paths** (D items). +- Both paths are tested; the default path keeps Gate A. +- A guard test pins the default. + +## 7. Targets (to measure, not promises) + +| Workload | Today (`d0558f5`) | After the S items (expected) | Rustuna 0.2.1 | +|---|---|---|---| +| CMA-ES, 10k / 100k | 18.3 / 812 s | 2.6 / 26 s measured in the prototype with single-threaded OpenBLAS; lower after S4 and S12 | 1.6 / 13.6 s | +| NSGA-II, 10k / 100k | 3.5 / 62.9 s | about half, if S4 removes most of the 66 % | 0.8 / 19.4 s | +| MOTPE, 1k | 36.6 s | about half, from S5 (24 %) and S4 (23 %) | 6.3 s | +| TPE, 1k | 9.9 s | unknown until S6; the scoring is 58 % | 1.4 s | + +Rustuna will stay ahead on TPE, where its acquisition math is native and ours follows NumPy's order. It will also stay +ahead wherever Optuna's protocol costs time (the pickle per generation, per-trial system attributes); keeping that +protocol is what lets Python workers share OptunaSharp's studies. + +## 8. Risks + +- **S4 aliasing.** A `FrozenTrial` handed out and then changed would silently break samplers and users. Tests must + cover every path that hands out a snapshot, under concurrency. +- **Index memory.** The folds and caches hold references the storage already holds; they must reset on a new study and + must not pin discarded or deleted studies. +- **Database storages.** S1-S3 save sampler work there too, but the per-ask history read stays O(n) until S10. +- **Two paths rot.** Every D item doubles a code path; rule 4 builds one only with a measured gain, and Gate D keeps + both tested. +- **Stale measurements.** Throttling (EcoQoS), Debug builds of file-based probes and stale probe builds have each + produced wrong numbers in this repository. Gate C's conditions exist because of them. + +## 9. Open questions for the owner + +- D3 (trial queue) and D4 (discarding) after S12's memory numbers. +- D2's default once S6 and its fast variant are measured. +- §5.5's switch shape for future switches; D1 uses a constructor parameter. + +## 10. Implementation record (2026-11-08/09) + +Every item below keeps OptunaSharp's results to the bit unless it says otherwise. The gates, each run per phase: +the unit suite's CI filter on net8.0 and net10.0; the live-Python interop suite on net10.0 with the engine required; +the documentation gate; a before/after hash of seeded studies (every trial's parameters and values by bits) built from +the `5e5ba53` snapshot and the working tree; and, for the concurrency-sensitive items, `ConcurrencyGun` cases. + +| Item | Commit | What was built | Measured | +|---|---|---|---| +| S1, S2 | `99e9e73` | `CmaTrialHistory` folds finished trials once; the optimizer restored from a state is cached by its holder trial and dropped after each tell | CMA-ES 40-D 100k trials: see the proof table | +| S3 | `99e9e73`, `4464e8a` | `Study.GetTrialsForSampler` (zero-copy view in memory, Optuna's read elsewhere) for the intersection space and CMA-ES; TPE's constant-liar read skips the current trial without reading it; QMC stops at the first finished trial instead of sorting; the group-decomposed space filters while scanning | QMC 3,000 trials 2.23 → 1.23 s | +| D1 | `99e9e73` | `CmaEsSampler(..., reuseToldOptimizer: false)`, opt-in | ~15 % on 40-D; results differ from generation 3 (§2.4) | +| S4 | `f8df1a5` | `InMemoryStorage` writes a running trial in place while no reader holds it (`FrozenTrial.StorageExclusive`, `HandOut`, `WritableTrialUnlocked`); the view reads unfinished records under the lock | 40,000 MOTPE suggestions: 71.5 ms of `SetTrialParam` in total | +| S7 | `f8df1a5` | Bitwise-identical float/int distributions and parameter names shared per study | CMA-ES 100k peak working set ~2.5 GB → 1.44 GB (with S4) | +| S5 | `4464e8a` | `TpeSplitCache`: the last split reused for the very same records | MOTPE 1,000: one split per trial instead of 40 | +| S6 | `4464e8a` | Fused continuous log-pdf (per-pair precomputation, `Vector<double>` lanes per kernel, scalar order kept), pooled grids and matrix, span `LogGaussMass`/`Ndtr`/`Erf.ComputeArray`, `StableArgsort`, presized `GetInternalRepr` | TPE 1,000: 10.08 → 3.93 s steady; MOTPE 1,000: 41.07 → 15.77 s | +| S10 | `9043b43` | `CachedStorage` keeps its cache in number order (`ByNumber`, placeholders for unsynced numbers); `GetAllTrials` stops sorting and `GetTrialsPrefixView` wraps the cache | O(n log n) → O(n) per read, O(1) view | +| S9 | `9043b43` | Measured first: attribute JSON is 3-4 % of a 10k-trial SQLite cold load, so lazy decoding was not built. Parsing each `distribution_json` row was ~40 %: both RDB storages now parse each distinct text once per load (`JournalDistributionCache`) | Cold load 2.1 → 1.4-1.5 s, 1.22 GB → 479 MB | +| S11 | none | Measured: at 10-D and 40-D CMA-ES and 6-D GP the OpenBLAS thread count changes no result, but at 100-D every count gives a different (deterministic) result, as NumPy's does. Pinning one thread at `nJobs: 1` would break parity with Python's default-thread NumPy, so the automatic policy stays (pin only when `nJobs > 1`). One thread was 12 % faster at 40-D and 24-35 % at 100-D: available through `TrialExecutorOptions.BlasThreads = 1`, at the cost of parity | — | +| S8 | `53a7a0f` | Owner 2026-11-09: "Build it", "Also have optuna's api overload". `SetTrialUserAttrs`/`SetTrialSystemAttrs`/`SetStudyUserAttrs`/`SetStudySystemAttrs` (virtual, default = one call per entry) plus Optuna-named overloads taking a dictionary; `Trial`/`Study.SetUserAttrs` and `SetUserAttr(dict)`. Overrides write in one step: one lock in memory, one transaction in SQLite and EF Core, one appended batch of single-key records in a journal (Python's replay asserts one key per record), with a drain so a rejected own record cannot poison the next call. Same result as the loop; a finished or unknown trial gets nothing written. Live Python reads a C#-written batch | — | +| S12 | `f0d62a0` | Owner 2026-11-09: "Build it", opt-in if behavior changes. Built as `InMemoryStorage(compactFinishedTrials: true)`: results unchanged (every proof pair hash-identical, live-Optuna parity on it), but finished trials' read-only accessors return views and values are rebuilt per read, hence the switch. §10.2 | CMA-ES 100k: retained 1,287 → 257 MB, peak 1,846 → 458 MB | +| D2 | not built | Owner 2026-11-09: "Keep exact only". TPE scores in NumPy's order with the S6 exact kernel; no fast-numerics path | — | + +**Findings along the way.** +- The CMA-ES pickle stores only C's upper triangle; keeping the told optimizer instead of a restore is therefore + observable (§2.4), which is why S1 drops its cache after every tell and D1 is opt-in. +- `GetNTrials` in Optuna's base storage counts through `GetAllTrials(deepcopy: false)`, so a count hands out every + running record; kept as Optuna has it (nothing in `src/` calls it). +- Profiles taken with `dotnet-trace`'s sampled thread time put whole seconds into `Monitor.Enter`'s slow path and + `PollGC` in single-threaded runs: the sampler's thread suspensions surface there. A stopwatch around + `SetTrialParam` measured 1.8 µs per call where the profile implied 66 µs. +- `OptunaHubBridgeParityTests.BenchmarkBridge_ToyProblem_ExposesSpaceAndOptimizes` asserted a bound on an unseeded TPE + study and failed in a few percent of runs; it is seeded now (`4464e8a`). + +### 10.1 Before/after proof + +Gate C. `scratchpad/proof/Program.cs` (session `5417a82e`) built twice in Release: against the `5e5ba53` snapshot +(before) and against `9043b43` (after). 40 float parameters in [-10, 10], seed 0, sampler defaults; objective +`sum((x - 1)^2)`, or `sum(x^2)` and `sum((x - 2)^2)` for two objectives. i9-13900K, Windows 11, .NET 10, power throttling +opted out, OpenBLAS at its default thread count. Each workload ran before then after, back to back, 2026-11-09 +00:39-01:03, while other sessions loaded the machine to 30-90 % CPU, so both columns are slower than §2.1's quieter +run (CMA-ES 100k before: 988 s here, 812 s there). Rep 0 includes the JIT; rep 1 is a second study in the same +process. The hash covers every trial's parameters and values by their bits. + +| Workload | Before rep 0 / rep 1 | After rep 0 / rep 1 | Speed-up | Allocated before → after | Peak working set | Hash | +|---|---|---|---|---|---|---| +| Random, 10,000 | 5.79 / 4.92 s | 4.72 / 3.96 s | 1.2× | 3.6 → 2.3 GB | 216 → 256 MB | same | +| QMC, 10,000 | 4.76 / 3.43 s | 2.47 / 1.05 s | 1.9× / 3.3× | 3.7 → 1.6 GB | 285 → 258 MB | same | +| NSGA-II, 10,000 | 3.82 / 2.75 s | 2.88 / 1.77 s | 1.3× / 1.6× | 2.9 → 1.2 GB | 230 → 205 MB | same | +| TPE, 1,000 | 10.53 / 9.37 s | 5.01 / 4.11 s | 2.1× / 2.3× | 4.4 → 1.6 GB (gen-2 GCs 254 → 2) | 98 → 107 MB | same | +| MOTPE, 1,000 | 47.42 s | 18.07 s | 2.6× | 28.7 → 3.4 GB (gen-2 594 → 2) | 82 → 79 MB | same | +| CMA-ES, 10,000 | 25.35 / 23.05 s | 4.49 / 2.64 s | 5.6× / 8.7× | 10.9 → 1.8 GB | 340 → 317 MB | same | +| NSGA-II, 100,000 | 73.17 s | 22.16 s | 3.3× | 63.4 → 12.4 GB | 1,527 → 750 MB | same | +| CMA-ES, 100,000 | 987.71 s | 27.49 s | 35.9× | 519 → 17.4 GB | 2,680 → 1,876 MB | same | +| CMA-ES, 10,000, `reuseToldOptimizer: true` (D1) | — | 3.43 / 2.04 s | 1.3× over after | 1.5 GB | 304 MB | differs, by design | +| CMA-ES, 100,000, `reuseToldOptimizer: true` (D1) | — | 18.18 s | 1.5× over after | 15.2 GB | 1,758 MB | differs, by design | + +Against Rustuna 0.2.1 (§2.1, quieter machine): TPE 1k 1.36 s, MOTPE 1k 6.30 s, CMA-ES 10k 1.59 s and 100k 13.6 s, +NSGA-II 10k 0.82 s and 100k 19.4 s. The §7 targets were "about half" for NSGA-II and MOTPE and 2.6 / 26 s for CMA-ES: +met or beaten except CMA-ES 10k's first rep, which carries the JIT (2.64 s steady). + +The README's sampler table (benchmark 14's C# probes, rebuilt against `9043b43`, three fresh processes each) moved +where the change is beyond the busy machine's noise: random over 1,000 parameters 13.5 → 3.2 s (now faster than +Python's 8.4 s), CMA-ES 200-D 2.8 → 1.2 s, CMA-ES 6-D 1.75 → 0.91 s, QMC 0.64 → 0.39 s, random 6-D 1.34 → 0.98 s, +TPE 100-D 2.4 → 2.1 s. GP was rerun interleaved against a `5e5ba53` build: the same within noise. + +### 10.2 S12: compact finished trials (opt-in) + +**What it is.** `new InMemoryStorage(compactFinishedTrials: true)` (default false) compacts each record as it finishes +(`Internal/CompactTrialParts.cs`, `FrozenTrial.CompactFinished`): + +- parameters: one internal value per name against a `ParamSchema` the study's trials share; +- distributions: the schema's one shared view; +- attributes: arrays, with long ASCII strings as bytes. Lowercase hexadecimal is stored two digits a byte, an odd + trailing digit kept aside, because CMA-ES's 2,045-character pickle chunks have an odd length. +- empty dictionaries: no memory. + +**Why it keeps results.** A trial is compacted only when every value reads back indistinguishable from what it stored; +the fallbacks keep the dictionary. + +**Why it is a switch.** The read-only accessors return views, values are rebuilt per read, and the mutable accessors +re-materialize the record's dictionary with a compare-exchange. The owner's rule was "if it changes optuna's/rustuna's +behavior then make the feature optin". + +**Read paths.** About 70 internal reads of finished trials moved to the read-only accessors (identical objects without +the switch), so samplers never undo compaction. A test runs every sampler family on and off and asserts every record +is still compact. + +**Two allocation sites found by profiling** (`dotnet-trace --profile gc-verbose`, TraceEvent tally by type and frame): + +- TPE's history read boxed every value per ask. It now copies the stored internal value where the search-space + distribution is interchangeable (`ParamSchema.PositionsFor`). +- `GetConstraintsFromSystemAttrs` walked every attribute pair, rebuilding each trial's relative-parameter JSON string + per ask (86 MB in a 300-trial run). It now scans keys and fetches only matching values. + +With both, compact TPE allocates what plain does. + +**Proof.** The plan 13 workloads (40 floats in [-10, 10], seed 0, sampler defaults) on the final build, plain then +compact back to back in separate processes, 2026-11-09 09:04-09:07, load 20-55 %. Retained = heap the finished study +keeps after a full collection (rep 0). Times are the steady rep where there are two. Every pair hash-identical. + +| Workload | Retained, plain → compact | Per trial | Peak working set | Time | Allocated | +|---|---|---|---|---|---| +| Random, 10,000 | 64.2 → 6.7 MB | 6,732 → 704 B | 200 → 91 MB | 3.52 → 3.53 s | 2.31 → 2.32 GB | +| QMC, 10,000 | 64.2 → 6.7 MB | 6,735 → 704 B | 198 → 93 MB | 1.02 → 0.85 s | 1.58 → 1.60 GB | +| NSGA-II, 10,000 | 67.7 → 9.7 MB | 7,099 → 1,012 B | 205 → 103 MB | 1.57 → 1.44 s | 1.23 → 1.29 GB | +| TPE, 1,000 | 13.4 → 6.9 MB | 14,059 → 7,243 B | 109 → 92 MB | 3.84 → 3.37 s | 1.57 → 1.60 GB | +| MOTPE, 1,000 | 7.2 → 1.4 MB | 7,537 → 1,461 B | 76 → 77 MB | 12.7 → 11.6 s | 3.42 → 3.45 GB | +| CMA-ES, 10,000 | 129.5 → 26.5 MB | 13,581 → 2,779 B | 372 → 137 MB | 2.15 → 2.46 s | 1.74 → 1.85 GB | +| NSGA-II, 100,000 | 670.9 → 87.5 MB | 7,035 → 917 B | 751 → 167 MB | 15.7 → 14.6 s | 12.4 → 13.0 GB | +| CMA-ES, 100,000 | 1,287.3 → 256.8 MB | 13,499 → 2,692 B | 1,846 → 458 MB | 23.2 → 22.1 s | 17.4 → 18.4 GB | + +**Time.** The CMA-ES 10,000 pair was repeated alternately three times with three reps each, and is noise: the steady +reps averaged 2.28 s plain and 2.31 s compact. Earlier runs had it at 2.88 → 2.86 s and 3.41 → 3.09 s. Garbage-collector +pauses drop on the large studies (CMA-ES 100,000: 2.73 → 1.36 s). + +**Before the fixes.** Compact TPE allocated 3.06 GB against plain's 1.57 GB, and MOTPE 3.90 GB against 3.42 GB. + +**Memory per trial.** The probe in session scratchpad `s12probe` agrees: random over 40 parameters 6,681 → 648 B per +trial at 5,000 trials, with the first study warmed up. diff --git a/docs/plans/14-rustuna-second-pass.md b/docs/plans/14-rustuna-second-pass.md new file mode 100644 index 0000000..7f96d2d --- /dev/null +++ b/docs/plans/14-rustuna-second-pass.md @@ -0,0 +1,241 @@ +# Plan 14 — Rustuna, second pass: compatible speedups, each gated byte for byte + +> **Status: BUILT (2026-11-09).** Six steps on `main`: A `adda96c`, B `db4e46c`, C `a279254`, D `45fadd1`, +> E `2dc35cf`, F `14b4698`. None of them changes a seeded trial or a stored byte, so none is a switch. §4 lists the +> byte-for-byte gates of every affected area, §5 the final before/after proof. §8 is the concurrency review that +> followed: no threading defect, new concurrency tests, and a fix to the TPE cache for studies recreated under a +> reused id. The comparison behind the plan: catalog note `optunasharp/notes/rustuna-comparison-2026-11-08.md`, +> section "Second pass". + +--- + +## 1. The request + +After plan 13 the owner asked (2026-11-09): "Keep comparing, what other rustuna optimizations with backwards +compatability have been achieved and we can use it aswell". The answer was a second read of Rustuna's `main` +(`d0ec7db`, 2026-11-04) against OptunaSharp at `f4eca0c` (plan 13 with S8 and S12), with new profiles of the plan 13 +workloads. Then: + +> 1. Each affected area must have byte-for-byte parity test coverage +> 2. Improve performance +> +> Implement. + +Plan 13's rule carries over: a change that keeps every result is the only implementation. Nothing here changes a +result, so nothing here is opt-in. "Byte for byte" is checked three ways: + +- **Against the code it replaced.** Unit tests pin each new path to the old one, value bits and, for random draws, the + generator's next state. +- **Across whole studies.** A hash probe (scratchpad `p14/hashprobe`, session `5417a82e`) runs 36 seeded studies over + every sampler family the changes reach, directly or through `RandomSampler` and `SearchSpaceTransform`, and hashes + every trial's number, state, parameter names and value bits, and objective-value bits. It was built against the + `f4eca0c` snapshot and against each step; every hash stayed equal. +- **Against live Optuna 5.0** (pythonnet, Python 3.12.12, the vendored `refs/optuna`), where OptunaSharp's parity with + it is bit-exact: random search, NSGA-II, NSGA-III, CMA-ES, QMC, and the journal and SQLite storages. TPE's live + parity stays what it was before this plan: the same trajectory, with values compared within the documented `erf` + tolerance. TPE's byte-for-byte gates are therefore the unit pins and the hash probe. + +## 2. Inventory and verdicts + +"Where it showed" is the state at `f4eca0c`. Profile shares are from stopwatch-instrumented scratch copies where +marked; `dotnet-trace`'s sampled thread time misplaces whole seconds (§6). + +| ID | Change | From | Where it showed | Verdict | +|---|---|---|---|---| +| A | Random draws and search-space transforms without NumSharp arrays on per-parameter paths | Found while comparing; Rust has no finalizers | GC pauses: 47 % of a 40-parameter random search, 41 % of NSGA-II; random 10k gen-0/1 collections 154/153 | Built, `adda96c` | +| B1 | TPE kernel widths in O(n), exact | Rustuna's `binned_sigmas`, made exact by verifying each bin | The width argsort: 24 % of TPE 1k (stopwatch) | Built, `db4e46c` | +| B2 | Finished trials' internal values cached across asks | Rustuna `ddd9c56`, `e7a22d7`, `a51e6db` | History conversion: 14 % of TPE 1k (stopwatch) | Built, `db4e46c` | +| B3 | No `exp` call where its result is exactly +0.0 | OptunaSharp's own, from measured `Math.Exp` costs | The log-sum-exp of the candidate scoring | Built, `db4e46c` | +| C | QMC's sample-id key computed once per search space | OptunaSharp's own, from an allocation trace | Most of QMC's 1.58 GB allocated per 10k trials | Built, `a279254` | +| D | The journal file backend keeps sparse line offsets | Rustuna `82b13d8` | One dictionary entry per log line: 160 MB for a 4.3M-line journal | Built, `45fadd1` | +| E | SQLite's cached refresh as `UNION ALL` | Rustuna `d46ace5` | The OR form scans `ix_trials_study_id`: 2.6 ms against 64 µs per refresh at 20k trials | Built, `2dc35cf` | +| F | A categorical weight's log taken once per (kernel, choice) | Rustuna `198e484` cuts the same logs, with other numerics | One `log` per candidate and kernel | Built, `14b4698` | +| — | Rustuna's binned sigmas as written, its categorical numerics, `log_diff_cdf` (`a4d0bc3`) | Rustuna | | Not taken: different bits | +| — | A `(study_id, number)` index (part of `d46ace5`) | Rustuna | | Not taken: changes Optuna's schema | +| — | `UNION ALL` in the EF Core storage | | PostgreSQL and MySQL combine ORed index ranges | Not changed | +| — | Candidates scored as ordered arrays (`93c2abe`); the copies left in model construction (rest of `fa4af9a`) | Rustuna | Second-pass profile: the dictionary path of `ParzenEstimator.LogPdf` 9 % of TPE 1k, `Transform` 9 % of MOTPE | Open (§7) | +| — | NSGA-II per-trial precomputation (`946fdf1`, `bd72444`, `cbecbf3`, `ed090c4`) | Rustuna | After this plan: NSGA-II 10k 0.75 s warm, 1.4 s with the JIT; Rustuna 0.2.1 0.82 s | Open (§7) | +| — | CMA-ES: an in-memory copy instead of the restore after each tell | OptunaSharp's own | `RestoreOptimizer` 6 % and the hex decode 4 % of a traced CMA-ES 20k run | Open (§7): byte-safe only if the copy pickles exactly like a restore | +| — | `apply_discard` / `discard_trials` | Rustuna | | Not compatible (plan 13, D4); plan 13's S12 cut the memory instead | + +## 3. What each step does + +**A — NumSharp temporaries (`adda96c`).** Every NumSharp `NDArray` has a finalizer. An array nobody disposes +survives its first collection on the finalization queue and is promoted, so the sampler paths that built small arrays +per suggestion turned almost every gen-0 collection into a gen-1. The new `Internal/NumPyDraws` reads the generator's +bit generator directly (`BitGenerator.NextDouble` under its lock, what NumSharp's own scalar and fill paths do): +`Rand`, `RandomSample` and `Uniform` create no array; `RandInt` and `Normal` still call NumSharp and dispose the +result. `Uniform` keeps NumPy's order: the range, its finiteness check before any draw, then `low + range * U`. +`SearchSpaceTransform` gained `TransformValues` and `UntransformValues(ReadOnlySpan<double>)`, and `Untransform` +disposes its `astype` copy. `RandomSampler` draws each bound row through `NumPyDraws.Uniform` instead of building five +arrays per suggestion; the NSGA-II family (child generation, crossover, every crossover operator, polynomial mutation), +CMA-ES, QMC and TPE's candidate sampling use the helpers. Every draw is the same call on the same generator in the +same order. + +**B — TPE (`db4e46c`).** (1) `ParzenEstimator.BinnedRawSigmas`: a width is the larger distance to the two sorted +neighbours, clipped up to `minsigma`, so binning the centres at width `minsigma` decides most widths without a sort. +Rustuna trusts its binning and can differ in the last bits; this version proves its answer: bin assignment is +monotone, so bins are contiguous runs of the sorted order; a bin's extremes are taken at the stable sort's positions; +every bin is checked to span at most `minsigma`. Anything else falls back to the sort (`SortedRawSigmas`). +(2) `TpeObservationCache`: each finished trial's internal value per (parameter name, distribution), or the fact that it +lacks the name; running trials (constant liar) are never cached; another study or storage, or more than 256 columns, +starts over. (3) The log-sum-exp stores 0.0 below `ExpIsZeroBelow` (-746) instead of calling `Math.Exp`, which returns +exactly +0.0 below about -745.1332 on every runtime and platform CI uses; the zero still enters the pairwise sum. + +**C — QMC (`a279254`).** The sample-id attribute is `"qmc:" + sha256(json.dumps(qmc_vars))`, rebuilt per trial from +every distribution's repr. `QmcIdKey` keeps it for the last search space and reuses it while the next call passes the +very same distribution objects in the same order. Reference identity decides, because two categoricals can be equal +by Python's rules (`True == 1`) and still print differently. + +**D — Journal file backend (`45fadd1`).** Instead of one offset per log line (Python's `_log_number_offset`), the +backend keeps the furthest line start any read established and one checkpoint every 4,096 lines. A sync still seeks +straight to the next unread line; an earlier start seeks to the nearest checkpoint and skips forward, as Python skips +lines when it reads from byte 0. A line's successor is recorded only after the line decodes. + +**E — SQLite refresh (`2dc35cf`).** `CachedStorage` asks for `trial_id > watermark` plus the unfinished trials at or +below it. Optuna's `... AND (trial_id > ? OR trial_id IN (...))` makes SQLite walk the study's whole index; the two +halves joined by `UNION ALL`, each answered through the primary key, return the same rows, and the final +`ORDER BY trial_id` the same order. Only studies with a running trial below the last finished one take this query +(parallel workers, or a crashed worker's trial, which then costs on every refresh). + +**F — TPE categorical (`14b4698`).** A categorical dimension added `log(weights[k, x])` per candidate and kernel. The +log of a (kernel, choice) column is now taken the first time a candidate draws that choice and reused. `Math.Log` is +deterministic and the terms enter the same buffer elements in the same order, so every sum keeps its bits. + +## 4. Byte-for-byte gates, per affected area + +| Area | Unit (OptunaSharp against the code it replaced) | Live Optuna 5.0 | +|---|---|---| +| Random draws (`NumPyDraws`) | `NumPyDrawsTests`: every helper against the NumSharp call it replaces, value bits and the generator's next state; scalar and vector uniforms, every bound shape `RandomSampler` meets, row-by-row against the array uniform, non-finite ranges, `randint` seed ranges, Gaussians with the cached polar value, NSGA-II's mixed draw sequence | through every suite below | +| `SearchSpaceTransform` | `SearchSpaceTransformTests`: `TransformValues` = `Transform`, `UntransformValues` = `Untransform` to the bit (mixed space, with and without the unit cube, clamped and tied coordinates); the `NDArray` overload still reads float32/int64 input | through the sampler suites | +| `RandomSampler` | `RandomSamplerTests`: 60 trials × 3 seeds over every distribution kind replay the pre-plan-14 array draw | `RandomSamplerParityTests.LongRun_AllDistributionKinds_IsBitIdentical_ToLiveOptuna`: 300 trials × 2 seeds, every value compared through Python's `repr` | +| NSGA-II family, NSGA-III, CMA-ES | the draw-sequence pins above | NSGA-II (every crossover, polynomial mutation, constraints, a 2,000-trial 40-parameter run), NSGA-III, CMA-ES and the mixed fleet, all green | +| TPE kernel widths | `TpeBinnedSigmasTests`: binned against sorted widths bit for bit over uniform, tied, clustered, on-edge, one-ulp-off-edge and floor-spaced centres, 2 to 1,500 centres, ten domains, both endpoint settings; asserts the fast path answers more than 90 % of uniform inputs. Scratch fuzz: 800,000 more cases, 0 mismatches | TPE suite (trajectory within the `erf` tolerance), including the 1,000-trial 40-parameter and MOTPE 300-trial runs | +| TPE observation cache | `TpeObservationCacheTests`: a warm cache against one emptied before every suggestion, same trials: dynamic ranges, a conditional parameter, pruned trials, both modes, plain and compact storage, MOTPE, constant liar with running trials, an ever-changing range, a sampler reused for a second study | `TpeSamplerParityTests.DynamicRangesConditionalAndPrunedTrials`, `ConstantLiarWithRunningTrials_AskTell` | +| TPE `exp` skip | `TpeExpUnderflowTests`: `Math.Exp` gives +0.0 for the 100,000 doubles below the bound and 200,000 inputs down to -1e6, `-inf` and `double.MinValue`, on every CI platform | TPE suite | +| TPE categorical logs | `TpeExactKernelTests.CategoricalLogPdf_OneLogPerKernelAndChoice_MatchesThePerCandidateLogsToTheBit`: 1, 2 and 4 categorical dimensions, 2-7 choices, weights with exact zeros (`-inf` terms), 1-40 kernels, against the per-candidate logs | TPE suite | +| QMC sample-id key | `QmcSamplerTests.QmcIdKey_Memoized_EqualsAFreshComputation`, including equal-by-value categoricals that print differently | `QmcSamplerParityTests.LongRun_40Parameters_300Trials_FullState_IsBitIdentical`: Sobol and Halton, scrambled and not, the whole study state with the `qmc:<sha256>` counter | +| Journal file backend | `JournalOffsetCheckpointTests`: reads from 13 positions around the checkpoints equal a full read, cold and warm; a reader that stopped half way resumes exactly; 12 concurrent readers; an undecodable record fails every read that reaches it; a partial last line waits | `JournalStateParityTests.LargeJournal_PythonWrites_CSharpReplaysAndContinues_SharedBackendCatchesUp_FullState`: Python writes 250 trials × 40 parameters; a C# storage replays it, two share a backend while one writes 30 more; the lagging storage, a cold one and Python's replay give the identical state | +| SQLite refresh | `SqliteRdbStorageTests.CachedRefresh_WithRunningTrialsBelowTheWatermark_EqualsAFreshRead`: after every step the cached view equals a fresh storage's read | `SqliteRdbInteropParityTests.RunningTrialBelowTheWatermark_CachedRefresh_MatchesPythonsRead`: C#'s cached view equals Python's fresh read field for field | +| Every sampler family | hash probe: 36 seeded studies equal before and after each step | | + +## 5. Final before/after proof + +`scratchpad/p14/final-proof.sh` (session `5417a82e`): the plan 13 proof program (`proof/Program.cs`) built twice in +Release, against the `f4eca0c` snapshot (before: plan 13 with S8 and S12) and against `14b4698` (after). 40 float +parameters in [-10, 10], seed 0, sampler defaults, `InMemoryStorage`; objective `sum((x - 1)^2)`, or `sum(x^2)` and +`sum((x - 2)^2)` for two objectives. i9-13900K, Windows 11, .NET 10, power throttling opted out, OpenBLAS at its +default thread count. Each workload ran before, after, before, after, back to back, 2026-11-09 14:23-14:27, with other +sessions loading the machine to about 30 % CPU. Rep 0 includes the JIT; rep 1 is a second study in the same process. +Ranges span the two runs. The hash covers every trial's parameters and values by their bits; every pair was equal. + +| Workload | Before rep 0 / rep 1 | After rep 0 / rep 1 | Speed-up, rep 1 | Allocated, rep 1 | gen-0/1/2, rep 1 | GC pauses, rep 1 | +|---|---|---|---|---|---|---| +| Random, 10,000 | 4.31-4.46 / 3.52-3.61 s | 0.81-0.82 / 0.50-0.52 s | 6.8-7.2× | 2,306 → 654 MB | 130/129/2 → 37/9/1 | 1.63-1.72 → 0.14 s | +| QMC, 10,000 | 2.31-2.38 / 0.99-1.01 s | 0.82-0.87 / 0.43-0.45 s | 2.2-2.3× | 1,584 → 472 MB | 89/17/1 → 27/9/1 | 0.20-0.21 → 0.12-0.13 s | +| NSGA-II, 10,000 | 2.64-2.71 / 1.51-1.57 s | 1.40-1.45 / 0.75 s | 2.0-2.1× | 1,234 → 710 MB | 70/69/2 → 40/10/1 | 0.66-0.68 → 0.16 s | +| TPE, 1,000 | 4.75-4.85 / 3.86-3.91 s | 3.18-3.30 / 2.47 s | 1.6× | 1,569 → 1,026 MB | 87/4/0 → 56/3/0 | 0.06 → 0.04 s | +| TPE, 1,000, `compactFinishedTrials: true` (one pair) | 4.28 / 3.39 s | 3.43 / 2.43 s | 1.4× | 1,595 → 1,051 MB | 88/2/0 → 58/2/0 | 0.04 → 0.02 s | +| MOTPE, 1,000 (rep 0) | 12.70-12.82 s | 10.44-10.52 s | 1.2× | 3,418 → 2,832 MB | 190/3/1 → 157/1/0 | 0.18 → 0.09-0.10 s | +| CMA-ES, 10,000 (three runs; rep 0 medians 3.66 → 3.64 s) | 3.64-3.99 / 2.09-2.28 s | 3.61-4.68 / 2.10-2.21 s | unchanged | 1,744 → 1,678 MB | 99/28/4 → 93/23-24/4 | 0.26-0.28 → 0.24-0.25 s | +| NSGA-II, 100,000 (rep 0, one pair) | 17.19 s | 8.60 s | 2.0× | 12,438 → 7,240 MB | 704/698/10 → 408/108/7 | 7.12 → 1.81 s | +| CMA-ES, 100,000 (rep 0, one pair) | 23.88 s | 22.11 s | within noise | 17,419 → 16,766 MB | 969/248/21 → 913/211/19 | 2.74 → 2.29 s | + +The categorical-heavy scenario of the hash probe (TPE, 500 trials, 20 five-choice categoricals and 20 floats; two +pairs, same hash `E015C07493B6830A`): 2.5 and 2.7 s → 1.8 and 1.8 s. + +The storage steps were measured at their commits with their own probes (scratchpad `p14/journalmem`, `p14/sqlgrowth2`): + +| Storage workload | Before | After | Same records | +|---|---|---|---| +| Journal file backend: memory kept after a full read of a 4.3M-line, 1.09 GB journal | 160.3 MB | 0.1 MB | yes | +| Journal file backend: full read / next sync | 5.48-7.36 s / 0.28-0.35 ms | 5.22-5.26 s / 0.34-0.36 ms | yes | +| SQLite through `CachedStorage`, 8,000 trials with one trial left running from the start | 13.0 s | 9.6 s | yes | + +Against Rustuna 0.2.1 (plan 13 §2.1, measured on a quieter day): NSGA-II 10k 0.82 s and 100k 19.4 s, TPE 1k 1.36 s, +MOTPE 1k 6.30 s, CMA-ES 10k 1.59 s and 100k 13.6 s. NSGA-II at 100k (8.6 s, JIT included) is now below Rustuna's +time, and so is a warm NSGA-II 10k (0.75 s); with the JIT, NSGA-II 10k takes 1.4 s. TPE, MOTPE and CMA-ES remain +behind; part of that gap is the compatibility OptunaSharp keeps (TPE scores candidates in NumPy's order, and CMA-ES +pickles its state into the storage every generation so Python workers can share the study). + +The README's sampler table (benchmark 14's C# probes, three fresh processes per configuration, built against +`f4eca0c` and `14b4698`, interleaved, 2026-11-09 14:29-14:31, load 16-57 %), medians: + +| Probe | Before | After | +|---|---|---| +| TPE, 6 parameters, 500 trials | 0.96 s | 0.61 s | +| TPE multivariate, 6 parameters, 500 trials | 0.97 s | 0.66 s | +| TPE, 100 parameters, 150 trials | 1.8 s | 1.6 s | +| GP, 6 parameters, 100 trials | 3.52 s | 3.43 s | +| CMA-ES, 6 parameters, 3,000 trials | 0.83 s | 0.74 s | +| CMA-ES, 200 parameters, 100 trials | 1.1 s | 1.0 s | +| NSGA-II, 6 parameters, 3,000 trials | 0.65 s | 0.31 s | +| QMC, 6 parameters, 3,000 trials | 0.36 s | 0.13 s | +| Random, 6 parameters, 5,000 trials | 0.78 s | 0.15 s | +| Random, 1,000 parameters, 200 trials | 2.6 s | 0.6 s | +| Random, 4 parameters, 50,000 trials: each block of 10,000 | 0.39-0.77 s (the first 1.08-1.19 s) | 0.08-0.25 s | + +## 6. Findings along the way + +- **Sampled thread time hid TPE's stages.** `dotnet-trace`'s `dotnet-sampled-thread-time` charged EventPipe's thread + suspensions to `PollGC`, `Monitor.Enter` and `memmove`. Stopwatches around TPE's stages in a scratch copy gave the + real split before step B: scoring 1.74 s (40 %), estimator construction 1.34 s (31 %, of which the width argsort + 1.05 s), history conversion 0.60 s (14 %). After B1 and B2: construction 0.54 s, conversion 0.15 s. +- **`Math.Exp` has three speeds here:** 5 ns for a normal result, 16 ns on its underflow-to-zero path, 63 ns for a + subnormal result. MOTPE's scoring is dominated by subnormal results, which an exact port has to compute. +- **A flaky journal lock test.** `JournalConcurrencyTests.Lock_WithoutAGracePeriod_WaitsForALeftBehindLockUntilItIsRemoved` + failed once on net10.0 under load and passed on three reruns; the lock code is untouched. +- **Out-of-tree builds.** The schema-upgrade live cases (`SqliteRdbUpgradeInteropParityTests`) find the repository + root from the test binaries, so they cannot run from a build with `--artifacts-path` outside the repository. They + exercise the migration chain, which step E does not touch. + +## 7. Open + +- TPE: score candidates as ordered arrays instead of name-keyed dictionaries (Rustuna `93c2abe`), and drop the copies + left in estimator construction (the rest of `fa4af9a`). Both are the same arithmetic. +- NSGA-II: precompute each trial's values and constraints, build parameters only for the selected parents, update the + joint search space in place (Rustuna `946fdf1`, `bd72444`, `cbecbf3`, `ed090c4`). +- CMA-ES: replace the restore after each tell by an in-memory copy that applies the pickle round trip's normalizations + (C mirrored from its upper triangle, B and D dropped). About 10 % of a traced run by sampled thread time, so to be + measured with a stopwatch first; it must serialize to the same `CmaPickle.ToHex` as a restore. +- QMC, scrambled Sobol: `QMCSampler` takes the point at `sample_id` by generating every point up to it + (`ScrambledSobol.Random(d, sampleId + 1, seed)`), so a study costs O(n²) points. Computing the one point directly + would be O(1) per trial; it has to stay bit-exact with scipy's scrambled `Sobol.fast_forward(...).random(1)`. +- NumSharp temporaries were traced (allocation ticks by creating frame, scratch `p14/nd/AnalyzeNd.cs`) on the five + plan 13 workloads only: random, QMC, NSGA-II, TPE, CMA-ES. GP, DE, PSO, the NES family and the other samplers were + not traced. + +## 8. Concurrency review (2026-11-09, after the build) + +The owner asked: "Did we not break the concurrency?" Everything plan 14 added that more than one thread can reach, and +what guards it: + +| State | Reached from | Guard | Tests | +|---|---|---|---| +| `TpeObservationCache` (a `TPESampler` field) | `GetInternalRepr` ← `BuildParzenEstimator` ← `Sample` ← `SampleRelative` / `SampleIndependent` only | The sampler monitor (`BaseSampler.SyncRoot`), held for every study-driven call, also when several studies share the sampler. A `PerWorker` instance gets its own cache: the field initializer runs for the private copy constructor, which does not copy it | New: `WorkerInstances_OwnTheirCaches_AndThePrototypesStaysUnused`, `SharedByEightWorkers_EveryCachedRowIsItsTrialsOwnValue` (eight workers, constant liar; every cached row equals its trial's conversion to the bit). Existing: `SamplerParallelReadTests` and `SamplerSharingConcurrencyCoverageTests` (`tpe`, `tpe-independent`) | +| `QMCSampler._lastKeyNames` / `_lastKeyDistributions` / `_lastKeyQmcId` | `QmcIdKey` ← `FindSampleId` ← `SampleQmc` ← `SampleRelative` only | The sampler monitor; QMC has no worker instances, so it is always shared and called one at a time | Existing: `SamplerParallelReadTests`, `SamplerSharingConcurrencyCoverageTests` (`qmc`, `qmc-scrambled`); `QmcIdKey_Memoized_EqualsAFreshComputation` | +| `JournalFileBackend` offsets (`_latestLogNumber`, `_latestLogOffset`, `_offsetCheckpoints`) | `ReadLogs`, from any number of storages sharing the backend | `_offsetLock` on every access; each read carries its own byte position; a line start is recorded only after the line decodes, so the furthest start advances one line at a time and each checkpoint is appended once, in order (index check) | New: `ReadersSyncingWhileOneWriterAppends_AcrossCheckpoints_AllReadExactly` (one writer and six syncing readers on one backend across three checkpoints). Existing: `ConcurrentReaders_FromScatteredPositions_AllReadExactly`, `JournalConcurrencyTests` | +| `Internal/NumPyDraws` | Every sampler that draws | No state. Each draw or fill holds `BitGenerator.@lock`, the lock NumSharp's own primitives take and the one NumSharp asks callers outside its `Generator` to hold | Through the suites above | +| Exact widths, the `exp` skip, categorical logs, `TransformValues` / `UntransformValues`, the SQLite query | | No shared state; the SQLite query runs under the storage's one-connection lock as before | | + +Runs on the fixed tree: the unit suite with CI's filter, 2172 passed on net8.0 and on net10.0 (one Windows self-skip +each); every concurrency-focused class (`OptunaSharp.Tests.Concurrency`, `OptimizeConcurrencyTests`, +`SamplerNJobsSweepTests`, `JournalConcurrencyTests`, `JournalOffsetCheckpointTests`, `TpeObservationCacheTests`, +`QmcSamplerTests`) three more times in a row, 342/342 each time; live TPE, compact-storage, importance and +battle-tested parity, 83/83; the storage suite's gRPC, SQLite and journal-contract classes, 114/114. + +**Found by the review, not a threading bug: recreated studies.** `TpeObservationCache` reset only when the storage +object or the study id changed. SQLite reuses the highest deleted study and trial ids, and a gRPC proxy (or a custom +storage) passes them through as one storage object, so a reused `TPESampler` on a study deleted and recreated under the +same id read the deleted study's values for the cached trial numbers. Optuna has no such cache, and TPE before plan 14 +re-read every trial, so this was a regression. The storage suite's new +`GrpcStorageProxyTests.Tpe_ReusedOnARecreatedStudyUnderTheSameId_SamplesAsUnderANewId` reproduced it: the same run +with the deleted study's id reused suggested different parameters from the first TPE trial on. The fix applies +`PerStudyState`'s `TrialAnchor` rule per row: each cached row keeps its trial's storage id and start time, and every +call checks the trials it is about to read, starting over on a mismatch. The cache also holds its storage weakly now, +as `PerStudyState` does, so a long-lived sampler does not keep the last storage alive. New unit tests: +`LiveStudy_NeverStartsOverOnATrialsIdentity` (no false alarm in either TPE mode, plain or compact storage, constant +liar with running trials), `TrialNumbersCarryingOtherTrials_StartTheCacheOver`, `Cache_DoesNotKeepTheStorageAlive`. +Mutation checks: with the identity check disabled, or the storage held strongly, those tests fail. The 36-study hash +probe is unchanged, and TPE / MOTPE times are unchanged within noise (TPE 1k warm: 2.68-2.90 s before the fix, +2.58-3.04 s after; allocations equal). diff --git a/docs/plans/15-performance-pass-3.md b/docs/plans/15-performance-pass-3.md new file mode 100644 index 0000000..f326b85 --- /dev/null +++ b/docs/plans/15-performance-pass-3.md @@ -0,0 +1,492 @@ +# Plan 15 — third performance pass: speed and memory gaps (2026-11-11) + +> **Status: DONE.** A four-hour working session, 2026-11-11 05:44 → 09:44 JST, on `main` after `4b65852`: seventeen +> steps and one regression fix (`5440021`..`cc1e4f3`), every seeded result unchanged; QA-84 recorded (`9346647`); +> a Windows race in the journal file lock found (§6). Results in §7. The owner's decisions of 2026-11-12 on the two +> open items (the lock race fixed `4ae4a1f`, QA-84 fixed through NumSharp `465f91c`, NumSharp's two costs pinned as +> OpenBugs on its journey5 `e9c38c2f`) are in §8; that work is on the local branch `journey1`. **Closed 2026-11-12** +> (owner: "document the remaining and stop"): QA-84's cost stays until NumSharp fixes its pins; the remaining work is +> listed in §9. +> This file is its central record: the rules, the baseline survey, the backlog, the progress log and the results. + +## 1. The request + +Owner, 2026-11-11: "Now lets do 4 hours of performance impact and gaps, striving to speed up and reduce memory". + +## 2. Rules (carried over from plans 13 and 14) + +- **Results do not change.** The owner's standing rule is "prefer rustuna unless it affects results"; plan 14 added "each + affected area must have byte-for-byte parity test coverage". A change ships only when every seeded study gives the + same trials, bit for bit. A technique that would change results is measured and listed for the owner, not built. +- **Gates for each change:** (1) a unit test pinning the new path to the code it replaces where the replaced code is a + numeric kernel; (2) the hash probe (36 seeded studies across every sampler family, hashed over every trial's + parameters and values by their bits) built against a `git archive` snapshot of the starting commit and against the + tree, with equal lines; (3) the area's existing unit and live-Optuna suites. +- **Measuring on this machine:** every probe opts out of Windows power throttling (EcoQoS moves background console + processes to the E-cores), is built in Release and prints `IsJITOptimizerDisabled`; before/after runs are + interleaved because other sessions share the machine; GC counts and allocated bytes are trusted over wall time. + +## 3. Baseline survey + +Probe `survey` (session scratchpad `4852dc9e`, `survey/Program.cs`): one workload per sampler family on +`InMemoryStorage`, 10 float parameters in [-10, 10] (GP: 6), seed 0, sampler defaults, objective `sum((x - 1)^2)` +or `sum(x^2)` and `sum((x - 2)^2)` for two objectives; BruteForce exhausts a 4,320-point mixed grid. Built in Release +against `4b65852`, power throttling opted out; the warm repetition (a second study in the same process). "Second +half's share" is the share of the time spent on the second half of the trials: about 0.5 when a trial costs the same +throughout, above that when its cost grows with the history (0.75 for a cost proportional to the history). + +| Workload | Trials | Warm time | Second half's share | Allocated | Per trial | gen-0/1/2 | GC pauses | +|---|---|---|---|---|---|---|---| +| random | 10,000 | 0.402 s | 0.53 | 195 MB | 20.0 KB | 10/3/0 | 0.04 s | +| tpe | 1,000 | 0.814 s | 0.71 | 351 MB | 359.4 KB | 19/1/0 | 0.01 s | +| tpe-mv | 1,000 | 0.809 s | 0.71 | 351 MB | 359.4 KB | 19/1/0 | 0.01 s | +| motpe | 400 | 0.501 s | 0.73 | 171 MB | 437.8 KB | 9/1/0 | 0.00 s | +| cmaes | 5,000 | 0.465 s | 0.55 | 217 MB | 44.4 KB | 12/3/0 | 0.05 s | +| cmaes-sep | 5,000 | 0.249 s | 0.53 | 138 MB | 28.3 KB | 7/2/0 | 0.04 s | +| qmc-sobol | 4,000 | 2.900 s | 0.54 | 963 MB | 246.5 KB | 147/115/113 | 0.08 s | +| qmc-halton | 4,000 | 1.192 s | 0.51 | 645 MB | 165.1 KB | 39/38/1 | 0.49 s | +| nsga2 | 5,000 | 0.162 s | 0.49 | 145 MB | 29.7 KB | 8/2/0 | 0.03 s | +| nsga3 | 3,000 | 0.092 s | 0.49 | 89 MB | 30.4 KB | 4/1/0 | 0.01 s | +| sms-emoa | 2,000 | 0.266 s | 0.64 | 275 MB | 140.8 KB | 15/1/0 | 0.02 s | +| age-moea2 | 2,000 | 0.078 s | 0.58 | 65 MB | 33.3 KB | 3/1/0 | 0.01 s | +| moead | 2,000 | 0.320 s | 0.68 | 165 MB | 84.5 KB | 9/8/0 | 0.04 s | +| rvea | 2,000 | 0.057 s | 0.52 | 62 MB | 31.7 KB | 3/0/0 | 0.01 s | +| de | 3,000 | 0.594 s | 0.72 | 333 MB | 113.7 KB | 18/2/0 | 0.05 s | +| pso | 3,000 | 0.651 s | 0.69 | 417 MB | 142.3 KB | 23/2/0 | 0.04 s | +| snes | 3,000 | 0.421 s | 0.72 | 505 MB | 172.4 KB | 28/2/0 | 0.04 s | +| xnes | 2,000 | 0.274 s | 0.66 | 286 MB | 146.4 KB | 15/0/0 | 0.02 s | +| openai-es | 3,000 | 0.453 s | 0.71 | 547 MB | 186.7 KB | 30/1/0 | 0.04 s | +| lm-cma | 3,000 | 0.432 s | 0.67 | 345 MB | 117.8 KB | 19/2/0 | 0.04 s | +| vkd-cma | 2,000 | 0.184 s | 0.63 | 141 MB | 72.2 KB | 7/1/0 | 0.02 s | +| janus | 2,000 | 0.163 s | 0.64 | 216 MB | 110.6 KB | 12/0/0 | 0.02 s | +| gp | 60 | 0.631 s | 0.82 | 425 MB | 7,253.3 KB | 37/29/24 | 0.04 s | +| bruteforce | 4,320 | 12.200 s | — | 13,967 MB | 3,310.7 KB | 779/199/1 | 1.04 s | + +Reading: QMC (both scrambled engines) re-did per trial work that depends only on the seed — Sobol even generated +every earlier point — and BruteForce allocates 3.3 MB per trial. TPE, the default sampler, costs 0.8 ms and 360 KB per +trial at 1,000 trials and grows with the history; GP allocates 7 MB per trial with a gen-2 collection every few trials. + +## 4. Backlog + +Open after plan 14 (its §7), with what this pass did about each: + +1. TPE: score candidates as ordered arrays instead of name-keyed dictionaries, drop the copies left in estimator + construction. — **The copies are gone (step G).** Ordered-array scoring was not attempted: the kernels (steps B, F) + were the larger costs. +2. NSGA-II: precompute each trial's values and constraints, build parameters only for the selected parents, update the + joint search space in place. — Open (NSGA-II costs 30 µs per trial). +3. CMA-ES: an in-memory copy instead of the restore after each tell (must serialize to the same pickle). — Open. +4. QMC, scrambled Sobol: the point at `sample_id` is found by generating every earlier point, O(n²) per study. — + **Done (step A).** +5. NumSharp temporaries left to the finalizer in samplers plan 14 did not trace (GP, DE, PSO, the NES family, …). — + **Traced:** GP, DE, PSO and the NES family are plain managed code; their per-trial memory was LOH churn (GP, + steps C and D) and history scans (steps H and I). Open: an unidentified source of NumSharp `UInt32` blocks the GP + run leaves to the finalizer. Ruled out since: the optimizers' entropy-seeded `RandomState()` (its `SeedSequence` + state is not an `NDArray` left behind: ~6.2 KB managed either way, step M's note). The per-ask draws that dropped + `NDArray`s (DE, MOEA/D, CMA-ES and others; the allocation sampler listed `UnmanagedStorage`, `ArraySlice<T>` and + `Disposer<T>` for them) read through `NumPyDraws` since steps P and R; MOEA/D's gen-1 collections fell 8 → 0. + +New, found by this pass and left open: + +6. BruteForce: cache each finished trial's path across rebuilds (a finished trial's path never changes; building + paths is 28% of its time). The per-rebuild categorical cache (`catCache`, first trial seen per name after + filtering) has to be reproduced exactly. +7. DE: it deserializes its JSON optimizer state on every ask; a cached copy would need cloning before each mutation. + — **Done (steps M, N, O)** without cloning: the cache holds the parsed *state*, from which every `FromState` builds a + new optimizer by copying; done for DE, LM-CMA, PSO, VkD-CMA, SNES, xNES and OpenAI-ES. +8. Multi-objective split (MOTPE): `lvals` through nested LINQ, `UniqueRows` with a delegate sort. The sort is unstable + and its representative among equal rows (±0) reaches the hypervolume arithmetic, so changing it is not provably + bit-identical; the LINQ part is. +9. Parity, not performance: QA-84 (§6). +10. The study core's per-suggest cost (random search, 20 KB per trial): about 40 % is the in-memory storage's + copy-on-write (plan 13 S4) copying a running trial's parameter and distribution dictionaries on each suggest after + the sampler has read the record, and 20 % is closures and delegates (`Locked(() => …)`, `Trial.Suggest`). Every + sampler pays it; changing the copy-on-write needs its own correctness argument. +11. TPE's remaining bytes are the Parzen estimators' own per-kernel arrays (66 % of a TPE trial's allocation is + `double[]`); pooling them means reworking the estimator's ownership, not a local change. +12. MOEA/D scans every completed trial's `SystemAttrs` by string key twice per ask (the offspring count and the new + offspring); an incremental count would make it O(new trials). + +## 5. Progress log + +- 05:44 — session starts; harness copied from session `5417a82e` (hash probe, proof program, power-throttling opt-out). +- 05:48 — baseline survey (§3). +- 05:55 — **step A, QMC engines.** `ScrambledSobol.Create` / `ScrambledHalton.Create` build an immutable engine per + `(d, seed)` (the shift and scrambled direction numbers; the Owen digit permutations) and `QMCSampler` keeps it across + trials. Sobol's point at `sample_id` is now computed directly: `shift XOR` the direction numbers of the bits set in + `gray(sample_id)`, the same integer state stepping reaches, so the same double. Halton's shuffle arrays are disposed + when copied out. Warm 4,000 trials: Sobol 2.900 → 0.150 s (963 → 58 MB, gen-2 113 → 0), Halton 1.192 → 0.161 s + (645 → 58 MB, GC pauses 0.49 → 0.02 s); same hashes. Gates: new `ScrambledSobolTests` (direct point = stepped row + over 4,100 indexes × 5 `(d, seed)`; `Create`+`Generate` = `Random`; the past-the-end guard) and `ScrambledHaltonTests` + (engine = the replaced per-call algorithm, written out, over 11 indexes × 4 `(dim, seed)`); QMC / GP / TuRBO / SAASBO + unit tests 246/246; live QMC and Sobol parity 20/20; hash probe 36/36 identical. +- 06:10 — a kernel bench (`kbench`, a friend assembly) times `ParzenEstimator` construction and `LogPdf` at 100, 1,000 + and 3,000 kernels for 10 floats, a mixed space (floats, log floats, ints) and 10 ints, and hashes every output by its + bits. Finding: the **stepped (int) branch** was the slow one — 10 ints at 100 kernels took 1.8 ms and 976 KB per call, + against 0.1 ms and 7 KB for 10 floats — because its three `np.unique`-style dedups sorted with LINQ over up to + 24 × n_kernels grid cells. The sampled profiler could not say where the continuous branch spent its time: a call-free + loop's time is charged to the next safe point (memset and GC-poll frames with no GC running), so the parts were timed + on their own and the JIT's code read instead. +- 06:38 — **step B, TPE log density** (`2189a12`). (1) The stepped branch moved to `AddDiscreteLogPdf`: the dedups hash + (`UniqueInverse`, first-occurrence order, NumPy's `==` grouping: ±0 together, every NaN alone) and every buffer is + rented. Same values: the unique set and its size are unchanged, the log mass is elementwise and picks its `erf` path + from the central count alone, and a group's members differ at most in the sign of a zero, which no log mass sees. + (2) The continuous accumulation (`AccumulateContinuous`) keeps each candidate's sums for a vector-wide kernel block in + a register across the dimensions and loads through `Vector.LoadUnsafe` at one offset (mu and sigma copied in as grid + rows; every length checked once up front): the JIT had emitted ~60 instructions per vector step, mostly bounds checks, + around one division. `-(z*z) / 2` became `* 0.5` (both are the correctly rounded half, the same bits). Same-process A/B, + best of five: 2.0–2.4× faster, same bits. Per the owner's rule (2026-11-11) the vector path and a separate scalar path + sit in an explicit if/else. Kernel bench per `LogPdf` call (24 candidates, 10 parameters), base → tree: floats + K=1,000 868 → 721 µs; mixed K=1,000 1,814 → 959 µs (415 → 20 KB); ints K=1,000 5,293 → 1,846 µs (1.9 MB → 18 KB), + K=100 1,838 → 1,203 µs (976 → 4 KB); identical hash over all nine configurations. Survey, 1,000 trials, warm: + `tpe` 1.44 → 1.15 s; new `tpe-int` (10 ints) 4.08 → 2.39 s, 1,301 → 337 MB, gen-2 3 → 0; new `tpe-mixed` + 1.51 → 1.02 s, 532 → 352 MB; same study hashes. Gates: new `TpeDiscreteKernelTests` (stepped `LogPdf` against the + replaced branch over sorted dedups, both sides of the `erf` switch; `UniqueInverse` against the sorted dedup's grouping + and representatives; both accumulate branches against the replaced loop; the up-front length check) with the plan 13 + `TpeExactKernelTests`; unit CI filter 2,190/2,190 on net10.0 and net8.0; live TPE / PED-ANOVA / truncnorm parity + 35/35; hash probe 36/36 identical. + +- 06:40 — `motpe` profile: Optuna 5 resolves `multivariate=None` to True for one objective and False for several (the + port does the same), so MOTPE samples each parameter on its own; its cost is in the same kernels. BruteForce (12 s, + 14 GB for 4,320 points) rebuilds its tree from every trial per parameter and per finished trial, which is Optuna's + design; an incremental tree is possible but was judged too risky for this pass (backlog). +- 06:45 — `gp` at 150 trials: 11.0 s, 37.6 MB allocated per trial, **782 gen-2 collections**; the finalizer thread was + busy for 12 of 12.5 s (trimming the array pools after every gen-2 collection, and finalizing NumSharp blocks), and + `LinAlg.SolveTriangular` with a matrix right-hand side solved one column at a time through a captured accessor, two + arrays per column. +- 07:02 — **step C, GP linear algebra and fit scratch.** (1) `LinAlg.SolveTriangular(matrix)` sweeps all right-hand + sides at once (`SweepTriangular`: row `i` minus a coefficient times row `j`, vectorized across the right-hand sides, + with a separate scalar branch per the owner's rule); a right solve works on the transposed block. Every element still + gets `TriSolveVec`'s sequence. (2) `LinAlg.CholeskySolve(L, B, left)` runs both triangular solves of a Cholesky solve + on one block, no intermediate matrix and no materialized `Lᵀ` (solving with `Lᵀ` stored upper reads the coefficients + that sweeping `L` transposed reads, in the same direction); the GP's fit (`C⁻¹`), `Posterior` (`V`) and + `SolveCholesky` use it. (3) `LinAlg.SolveTriangular(a, b, upper, transposeA)` for vectors reads `a` transposed in + place; the per-point posterior, `CacheMatrix` and the vector `SolveCholesky` no longer transpose the factor per call. + (4) `LossAndGrad` keeps its nine n × n buffers on the regressor across the fit's evaluations (`FitScratch`, dropped + when the fit ends so a cached regressor does not keep them). Survey (base → tree, same hashes): `gp` 150 trials + 15.6 → 13.2 s (machine loaded; 11.0 → 9.7 s after (1) alone), 5,509 → 1,408 MB (−74%), gen-2 collections + 795 → 143; 60 trials 0.71 → 0.56 s, 425 → 142 MB. Gates: `LinAlgTests` +3 (the matrix solve against the replaced + one-at-a-time code over every triangle, side, size 1–17 and 1–33 right-hand sides; `CholeskySolve` against the two + spelled-out solves; the transposed vector solve against a materialized transpose), 15/15; GP-family probe (GPSampler + float, mixed, deterministic, constrained, two objectives; TuRBO; SAASBO-MAP; REMBO) 8/8 identical; hash probe 36/36; + unit CI filter 2,193/2,193 on net10.0 and net8.0; live GP / terminator / TuRBO / SAASBO / REMBO / LinAlg parity + 70/70. Not found: the source of the NumSharp `UInt32` blocks the GP run left to the finalizer (not `SeedSequence`, + which keeps a managed pool, nor `randint`, which defaults to int64). Committed `cebb1c9`. +- 07:07 — **step D, the forked regressor.** `Samplers/ModelBased/Gp/GPRegressor.cs` (TuRBO's fit, and the fork's + posterior) takes step C's changes line for line: the fit's `FitScratch` (released when `FitInner` ends, and by + `TurboGpFit` after its own L-BFGS-B), `CholeskySolve` for `C⁻¹`, `V` and `SolveCholesky`, the in-place transposed + vector solve for the per-point posterior, `CacheMatrix` and the vector `SolveCholesky`. GP-family probe with TuRBO at + 120 trials and REMBO at 60 (base → tree): all 8 hashes identical; TuRBO 4.64 → 4.28 s, 1,857 → 1,215 MB; REMBO + unchanged (its embedded GP does not go through this fit); the GPSampler rows show step C (e.g. 26 trials 52 → 24 MB, + two objectives 197 → 121 MB). Gates: GP-family, LinAlg and terminator unit tests 266/266 (net10.0); live parity + 70/70. Committed `9533366`. +- 07:16 — **step E, BruteForce tree rebuilds.** Profile (12.4 s): `PopulateTree` 76% — paths 3.5 s, `AddPath` 3.8 s + of which `EnumerateCandidates` 1.2 s (Python-faithful decimal arithmetic: a float repr, a decimal parse and a + correctly rounded conversion per candidate, for every newly expanded node, about a thousand per rebuild). (1) One path + buffer serves every trial of a rebuild (`AddPath` walks a path once and keeps nothing). (2) `CandidatesFor` caches the + candidate lists per rebuild, keyed by the progression's exact bits and kind (`ChoicesArgs.Equals` treats -0.0 as 0.0 + and ignores `IsInt`, so it is not the key); a progression without a step throws on every call and is never cached. + Survey `bruteforce` (4,320 points, all of them): 13.9 → 11.6 s (base runs ranged 13.9–17.6 s on the loaded + machine), 13,967 → 5,448 MB (−61%), gen-0 collections 779 → 307; same hash. Gates: two new `BruteForceSamplerTests` + (the cache equals a fresh enumeration by bits and returns the same list again; -0.0 / 0.0 and int / float are + separate keys; the stepless progression throws twice and caches nothing), BruteForce unit tests 26/26; live + BruteForce parity 13/13; hash probe 36/36. Left for later: caching each finished trial's path across rebuilds (the + path of a finished trial never changes; 28% of the time). Committed `c78c0ab`. +- 07:25 — **step F, TPE's trial split.** A split bench (`sbench`) on studies of 1,000 and 3,000 completed trials with + many ties: 175–190 µs and 155 KB per split at 1,000 trials, 705–735 µs and 476 KB at 3,000 — about 15% of a TPE + trial. (1) `GetInfeasibleTrialScore` returns the empty loop's 0.0 for a trial that records no constraint + (`ConstrainedOptimization.HasConstraints`: the two tests the dictionary's construction makes) instead of building an + empty constraints dictionary per trial per split, two thirds of the bytes. (2) The partition lists are pre-sized + and both sides built at their final sizes. (3) The single-objective sort sorts (value, position) structs that + implement `IComparable<T>` (the order of LINQ's stable `OrderBy` / `OrderByDescending`, with `double.CompareTo`), so + the generic sort calls `CompareTo` directly; a struct `IComparer<int>` passed to `Span.Sort` is boxed and gained + nothing. (4) Both sides are sorted by number on primitive keys (`Array.Sort(int[], FrozenTrial[])`; numbers are + unique). Split bench: 130 µs / 52 KB at 1,000 trials, 553–576 µs / 154 KB at 3,000; same split hash. Survey, + interleaved: `tpe` 1,000 trials 0.94–0.99 → 0.86–0.88 s (all of plan 15 against the base), 358 → 300 KB per trial; + `motpe` 400 trials time unchanged, 440 → 405 KB per trial. Gates: new `TpeTrialSplitSortTests` (the split against + the LINQ code written out, shuffled histories with ties, both zeros, both infinities and NaN, both directions, every + seventh group size; constraints in both formats still score infeasible); TPE, constraint and split unit tests + 117/117; hash probe 36/36. Committed `ca6723d`. +- 07:29 — **step G, Parzen estimator construction.** Each numerical parameter computed its centers (logs, for the log + kinds) and widths into arrays of their own and then copied both into arrays one longer for the prior kernel. The + centers are now written straight into the prior-extended array and the widths computed into its slots: + `ComputeSigmas`, `SortedRawSigmas` and `BinnedRawSigmas` gain span-filling cores (the binned one returns whether it + wrote, and every refusing check runs before its first write), `StableArgsort` a span overload; the array forms stay + as thin wrappers for `TpeBinnedSigmasTests`. Kernel bench: estimator build K=1,000 259–275 → 181 KB, K=3,000 + 775–822 → 540 KB; output hash unchanged. Survey, all of plan 15 against the base: `tpe` 1,000 trials + 0.92 → 0.78 s, 358 → 261 KB per trial; `tpe-mixed` 1.32 → 1.05 s, 544 → 258 KB per trial; same hashes. Gates: + TPE, Parzen and PED-ANOVA unit tests 122/122; kernel-bench hash; hash probe 36/36. Committed `5019c5d`. Unit CI + filter through step G: 2,199/2,199 (1 skipped) on net10.0 and net8.0; documentation gate (`check_documentation.cs`, + 5,840 declarations) 0 issues; Core built with the documentation warnings as errors, both TFMs: 0 errors. +- 07:36 — **step H, the evolution-strategy samplers' attribute keys.** SNES, xNES and OpenAI-ES spent most of their + per-trial allocation (147–187 KB) rebuilding one string: `AttrKeyGeneration` was an expression-bodied + `AttrPrefix + "generation"` read for every trial of the history by `GetSolutionTrials` and `CountRunningMembers` on + every ask. The two keys are now built once per sampler (`AttrPrefix` is a constant per sampler type), and the + completed-trials list is sized for the history. DE, PSO, LM-CMA and VkD-CMA concatenate `const` prefixes, which + the compiler folds; CMA-ES hands its keys to its trial history once, and the GA samplers read theirs once per newly + folded trial: none of those allocate per scan. Survey (machine loaded by other sessions, base and tree back to + back): SNES 3,000 trials 1.06 → 0.89 s, 173 → 59 KB per trial; xNES 2,000 0.90 → 0.86 s, 148 → 73 KB; OpenAI-ES + 3,000 1.08 → 0.89 s, 188 → 61 KB; same hashes. Gates: ES, parallel-read and nJobs sampler tests 248/248; hash + probe 36/36 (SNES, xNES and OpenAI-ES studies included). Committed `882a043`. +- 07:39 — **step I, the other samplers' history lists.** DE, PSO, LM-CMA, VkD-CMA, JANUS and JANUS-DE collect their + completed trials into a list grown from empty on every ask; it is now sized for the history (the same contents in + the same order). Survey, back to back, same hashes: DE 115 → 91 KB per trial, PSO 143 → 120, LM-CMA 119 → 95, + VkD-CMA 73 → 60, JANUS 112 → 98; wall times within the loaded machine's noise. DE's remaining per-trial cost is + deserializing its JSON optimizer state on every ask (backlog). Gates: their unit tests 103/103; hash probe 36/36. + Committed `4367338`. +- 07:45 — **A regression in step F, found and fixed.** Re-measuring the split bench for a planned step J (the + multi-objective `lvals` as plain loops) showed the **two-objective split 10–20% slower than the base** — step F's + own measurements had shown it too, and I had put it down to noise. Cause: the multi-objective path builds both sides + in the history's order, so step F's `SortByNumber` copied two already-ordered lists out and back where the old + in-place delegate sort barely moved anything. Fix: `SortByNumber` returns at once when the list is already strictly + ascending by number (sorting would leave every trial in place). Best of five alternating runs, base → fixed: + one objective 165.9 → 125.5 µs (1,000 trials), 693.6 → 551.7 µs (3,000); two objectives 540.3 → 489.8 µs, + 1,505.2 → 1,320.1 µs; same split hash. Step J itself was dropped: the loop version measured ~250 µs slower at + 3,000 trials than the LINQ it replaced, for a reason not found (the property it reads is a plain field). Lesson: + re-run a step's A/B in both orders before calling a difference noise. Gates: split, TPE and multi-objective unit + tests 134/134; hash probe 36/36. +- 08:00 — checkpoint: §7 written for `d7aa9d9` (`998bc21`); work continues. A new probe, an **in-process allocation + sampler** (the runtime's `GCAllocationTick` events counted by type through an `EventListener`, `ALLOC_TICKS=1`, + scratch `common/AllocTicks.cs`), showed where each workload's bytes go. Two sinks shared by several samplers: copies of + the whole history (`FrozenTrial[]`: DE 40 %, MOEA/D 13 %, SMS-EMOA 13 %, TPE 12 %) and dictionaries over every + completed trial rebuilt per ask (`Dictionary<int, FrozenTrial>`: SMS-EMOA 37 %, MOEA/D 38 %, plus their buckets). +- 08:12 — **step K, TPE's history reads** (`8b0fb61`). TPE read the filtered history twice per trial in multivariate + mode and twice per *parameter* in independent mode (MOTPE's default), a fresh copy each time, and copied both split + groups per parameter. `Study.GetTrialsCachedReadOnly(states)` shares one filtered list per trial snapshot and state set + (memo keyed by the snapshot's identity and a state bit mask; `CachedAllTrials` became a property whose setter drops + it, so a tell drops both); `Study.FilterByState` filters by bit mask into a list allocated at its final size; + `TpeSplitCache.SplitShared` returns the cached groups without copies. Same history: both reads filter the same snapshot, + and a handed-out record's state never changes (the storages change a shallow copy, plan 13 S4). MOTPE 386.6 → 353.3 KB + per trial (base 440.3), TPE about −4 KB per trial: .NET 10's `Where().ToList()` already avoids most growth garbage, so + the gain is the sharing. Gates: new `StudyTrialFilterTests` (13 state sets incl. values outside the enum, the memo's + sharing and invalidation, `SplitShared` = `Split`); unit tests 526/526; hash probe 36/36; live TPE / multi-objective + parity 74 passed, 1 skipped. +- 08:24 — **step L, steady-state population lookups** (`66f83d4`). `Internal/TrialsByNumber`: a binary search over the + number-ordered history (one allocation-free order check per ask; a list out of order gets the replaced dictionary + itself, later record winning). SMS-EMOA and MOEA/D keep their populations as trial numbers instead of storage ids (the + same records within a study; a recreated study is discarded first by the anchor check), and MOEA/D's new-offspring + `OrderBy` runs only when the history is not ascending. SMS-EMOA 141.8 → 80.9 KB per trial, MOEA/D 85.5 → 54.8; cold + runs 15–20 % faster, warm runs 5–12 %. **A trap found on the way:** a first version (hand-written loops, the list + walked through `IReadOnlyList`) made MOEA/D's 2,000-trial run 0.54–0.57 s against 0.36–0.49 s, while 4,000 trials + were even and `DOTNET_TC_QuickJitForLoops=0` made the tree equal or faster on every repetition: new loops run as + unoptimized tier-0 code through the first few thousand asks, while the LINQ they replace ships precompiled + (ReadyToRun). The final form keeps LINQ's `Where().ToList()` and walks a span in methods marked + `AggressiveOptimization`. Probably also the reason step J measured slower. Gates: new `TrialsByNumberTests`; unit tests + 660/660 and 35/35 (recreated studies); hash probe 36/36. +- 08:29 — **step M, DE's optimizer state** (`9edc1d4`, backlog 7). DE parsed its stored JSON population on every ask; + the text changes once per generation. A one-entry cache keyed by the whole text, safe because `De.FromState` copies + every array out of the state. DE 267 → 241 MB (base 335); time within noise (the parse was cheap). Measured and + dropped on the way: the optimizers' OS-entropy `np.random.RandomState()` before the reseed that precedes every draw + costs ~13 µs against 6–13 µs seeded, both ~6.2 KB, same stream after the reseed (scratch `rsbench`): ~2 % of a DE ask. + Gates: hash probe 36/36; DE / JANUS-DE / nJobs / reuse tests 179/179. +- 08:33 — **step N, the same cache for LM-CMA, PSO and VkD-CMA** (`af20df1`), each `FromState` checked for aliasing. + PSO 351 → 280 MB, LM-CMA 279 → 220, VkD-CMA 117 → 103 (base 419 / 348 / 143). Gates: hash probe 36/36; their tests + 254/254. +- 08:36 — **step O, the same cache for SNES, xNES and OpenAI-ES** (`adc76c2`). SNES 174 → 167 MB, xNES 143 → 125, + OpenAI-ES 178 → 169 (small states; step H was the large cut). Gates: hash probe 36/36; their tests 222/222; + documentation gate (5,855 declarations) 0 issues, Core's strict documentation build 0 errors. +- 08:41 — **step P, draws that left arrays to the finalizer** (`9d94a6a`). 21 per-ask or per-parameter sites still + cast a NumSharp draw (`(int)rng.randint(…)`, `(double)rng.rand()`), each dropping a finalizable `NDArray`; they read + through plan 14's `NumPyDraws` now (`RandInt` is the same call with the array disposed, `Rand` is pinned to `rand()` + by `NumPyDrawsTests`): DE and `De`, LM-CMA, MOEA/D and its offspring, BruteForce, Grid, GPSampler, CMA-ES, the ES + base class and both GP search spaces. Left: NSGA-III-CPT, SAASBO, `OptunaSearchCV` (not hot). Gates: hash probe + 36/36; GP-family probe 8/8; their unit tests 460/460; live Grid and BruteForce parity 24/24. +- 08:48 — **step Q, the state filter compiled optimized** (`8c52e7c`). The final survey read SMS-EMOA and MOEA/D + slower at the second repetition (0.37 → 0.50 s and 0.37 → 0.45 s, machine loaded). Four repetitions per process, + alternating: the tree is ahead from the cold run on (SMS-EMOA cold + second 1.20 / 1.16 → 1.04 / 1.01 s, all four + 1.76 / 1.69 → 1.55 / 1.52 s; MOEA/D cold + second 1.19 → 0.94 s); only the second repetition is about 10 % behind + while the tree's code tiers up. `Study.FilterByState` (step K) now indexes a span and carries + `AggressiveOptimization`, which took SMS-EMOA's cold run from 0.56–0.58 to 0.53–0.54 s; the second repetition's gap + stayed, so it comes from tiering elsewhere. Gates: hash probe 36/36; 630/630 unit tests. +- 08:55 — **step R, Gaussian draws disposed** (`cc1e4f3`), the other half of step P: `NumPyDraws.Randn` is the same + `rng.randn(n)` call with its array disposed, now used by CMA-ES and SepCMA (every sampled point), VkD-CMA, the ES + noise matrix, JANUS, SAASBO's NUTS, REMBO and TuRBO / TuRBO-m (10 sites; JANUS-MOO draws through a NumSharp + `Generator` and stays as it was). Measured on CMA-ES 5,000 trials: no visible change in bytes, collections (12/3/0) + or time; disposing spares only the finalizer's work, which never showed as collections here. Kept as hygiene. + Gates (probe DLLs checked fresh after a first build failed on the JANUS-MOO site): hash probe 36/36; GP-family probe + 8/8; their unit tests 343/343. + +## 6. Findings and notes for the owner + +- **NumSharp `NDIter` / `NDExpr` / `np.evaluate` (asked 2026-11-11).** `NDExpr` compiles an elementwise tree over + `NDIter` operands into one IL kernel with a SIMD body (numexpr-style `np.evaluate`, no intermediate arrays), and its + generator keeps multiplications and additions unfused, so an elementwise tree would keep its bits. No hot path in + Core runs on `NDArray` arithmetic any more, though: plans 13 and 14 moved TPE, the RNG draws and the samplers' kernels + to loops over `double[]`; what still goes through NumSharp is LAPACK (`LinAlg`, OpenBLAS), the MT19937 generator and + a few small array steps (CMA-ES, NSGA-III); `Hypervolume.cs`'s `np.` mentions are comments, and the GP stack, DE, PSO + and the NES family are plain managed code (151 `new double[]` sites in `Gp/`, one NumSharp line per ES/DE/PSO file). + So there is no chain of `NDArray` temporaries for `np.evaluate` to fuse today. A reduction tree (`NDExpr.Sum`) would + need checking against NumPy's pairwise order before any use. +- **QA-84 (parity, not performance; not changed).** TPE sums each candidate's continuous log terms over the + dimensions left to right, `((0 + t0) + t1) + …`; Optuna's `.sum(axis=-1)` runs over a C-contiguous last axis, which + NumPy sums pairwise (eight accumulators) from eight elements on. Measured with Optuna 5.0.0's own `_truncnorm.logpdf` + and NumPy 2.4.2: the pairwise model matches NumPy in 7,200 of 7,200 (candidate, kernel) entries for 8, 10 and 16 + dimensions, the left-to-right sum differs in 31–54% of them. A ULP-level difference in the log densities of studies + with eight or more continuous parameters, the class of the documented `erf` divergence; fixing it changes results, so + it is recorded with an `[OpenBugs]` repro rather than changed here (`9346647`). Fixed 2026-11-12 (`465f91c`, §8). +- **An allocation sampler beats the CPU profiler for finding memory sinks.** An `EventListener` on + `Microsoft-Windows-DotNETRuntime` with the GC keyword at Verbose receives `GCAllocationTick` (one per ~100 KB, naming + the type of the object that crossed the threshold); counted per type over a run, the shares are proportional to the + bytes. It found steps K, L and P in minutes, where the sampled CPU profiler charges call-free loops to safe points. + No stacks (the callback runs on the dispatch thread), but the types point at the code. +- **Hand-written loops replacing LINQ can be slower for the first few thousand calls.** Framework LINQ ships + precompiled (ReadyToRun) and optimized; a new loop in OptunaSharp starts as unoptimized tier-0 code, and with tiered + PGO it can take thousands of calls to reach its final tier. A 2,000-trial study can end before that: step L's first + version measured 40 % slower on MOEA/D's 2,000-trial run, even at 4,000 trials, and equal or faster with + `DOTNET_TC_QuickJitForLoops=0`. Compare a rewrite with warm-up included (rep 1) and warm (rep 3), and when it must be + a loop, keep it small and mark it `AggressiveOptimization`, or keep the LINQ. +- **The entropy-seeded generators are not the `UInt32` blocks.** The optimizers' `np.random.RandomState()` (as cmaes' + `__setstate__` does) before the reseed that precedes every draw costs ~13 µs against 6–13 µs for a seeded one, and + both allocate ~6.2 KB managed; the stream after the reseed is identical (scratch `rsbench`). Not changed. +- **A journal-lock flake, cause found, not changed (an owner decision).** Two of about eight full net10.0 runs of + this pass, both on a machine loaded by other test processes, failed + `JournalConcurrencyTests.Lock_WithoutAGracePeriod_WaitsForALeftBehindLockUntilItIsRemoved` with + `UnauthorizedAccessException: Access to the path '…\optunasharp-journal-cc-….log.lock' is denied` (once at + `d7aa9d9`, once at `8c52e7c`); the test alone, its class three times in a row (21/21 each) and the other runs pass. + Nothing in this pass touches the journal. Cause: `JournalFileOpenLock.Acquire` creates the lock file with + `FileMode.CreateNew` and treats only an "already exists" `IOException` as contention; on Windows, creating a file + whose deletion is pending (the holder deleted it while another handle, e.g. a waiter's `GetLastWriteTimeUtc`, is still + open) fails with ACCESS_DENIED, which .NET raises as `UnauthorizedAccessException`, so the waiter fails instead of + retrying. It is a faithful port: Optuna's `os.open(O_CREAT | O_EXCL)` raises `PermissionError` in the same window + and catches only `FileExistsError`. Treating ACCESS_DENIED on an existing-or-deleting lock file as contention would + depart from Optuna to fix a Windows race; recorded for the owner. Decided and fixed 2026-11-12 (`4ae4a1f`, §8). + +## 7. Results + +Final survey, every workload, base `4b65852` → tree `8c52e7c` (all of plan 15 but step R), back to back per workload, +warm repetition (the second study in the process), the same probe and settings as §3. The machine was shared with +other sessions and, for this run, with the full unit suites, so allocations and collections are the dependable columns; +times are compared pairwise. Every study hash is the same. Step R (`cc1e4f3`, Gaussian draws disposed) was measured on +its own: no visible change in CMA-ES's bytes, collections or time, same hashes. + +| Workload | Trials | Warm time | Allocated | Per trial | gen-0/1/2 | GC pauses | Hash | +|---|---|---|---|---|---|---|---| +| random | 10000 | 0.335 → 0.347 s | 192 → 190 MB | 19.7 → 19.5 KB | 10/3/0 → 10/3/0 | 0.05 → 0.05 s | same | +| tpe | 1000 | 0.909 → 0.753 s | 351 → 252 MB | 359.4 → 258.0 KB | 19/1/0 → 14/1/0 | 0.01 → 0.01 s | same | +| tpe-int | 1000 | 2.915 → 1.382 s | 1,301 → 242 MB | 1,332.2 → 247.8 KB | 72/2/0 → 13/1/0 | 0.04 → 0.01 s | same | +| tpe-mixed | 1000 | 1.260 → 0.877 s | 532 → 249 MB | 544.8 → 255.0 KB | 29/2/0 → 13/1/0 | 0.02 → 0.01 s | same | +| motpe | 400 | 0.522 → 0.543 s | 172 → 138 MB | 440.3 → 353.3 KB | 9/1/0 → 7/1/0 | 0.00 → 0.00 s | same | +| cmaes | 5000 | 0.757 → 0.800 s | 223 → 223 MB | 45.7 → 45.7 KB | 12/3/0 → 12/3/0 | 0.05 → 0.05 s | same | +| cmaes-sep | 5000 | 0.649 → 0.497 s | 143 → 143 MB | 29.3 → 29.3 KB | 7/2/0 → 7/2/0 | 0.04 → 0.03 s | same | +| qmc-sobol | 4000 | 2.530 → 0.136 s | 962 → 58 MB | 246.3 → 14.8 KB | 158/128/127 → 3/1/0 | 0.15 → 0.01 s | same | +| qmc-halton | 4000 | 1.283 → 0.140 s | 644 → 58 MB | 164.9 → 14.8 KB | 39/38/2 → 3/1/0 | 0.59 → 0.01 s | same | +| nsga2 | 5000 | 0.490 → 0.561 s | 158 → 162 MB | 32.4 → 33.2 KB | 8/2/0 → 9/2/0 | 0.03 → 0.03 s | same | +| nsga3 | 3000 | 0.316 → 0.341 s | 101 → 101 MB | 34.5 → 34.5 KB | 5/0/0 → 5/0/0 | 0.01 → 0.01 s | same | +| sms-emoa | 2000 | 0.412 → 0.431 s | 276 → 159 MB | 141.3 → 81.4 KB | 15/1/0 → 8/1/0 | 0.02 → 0.01 s | same | +| age-moea2 | 2000 | 0.277 → 0.249 s | 72 → 72 MB | 36.9 → 36.9 KB | 4/2/0 → 4/2/0 | 0.02 → 0.02 s | same | +| moead | 2000 | 0.380 → 0.435 s | 167 → 95 MB | 85.5 → 48.6 KB | 9/8/0 → 5/0/0 | 0.04 → 0.01 s | same | +| rvea | 2000 | 0.186 → 0.182 s | 68 → 68 MB | 34.8 → 34.8 KB | 3/0/0 → 3/0/0 | 0.01 → 0.01 s | same | +| de | 3000 | 1.059 → 1.010 s | 336 → 241 MB | 114.7 → 82.3 KB | 18/3/0 → 13/2/0 | 0.05 → 0.03 s | same | +| pso | 3000 | 1.003 → 1.032 s | 419 → 280 MB | 143.0 → 95.6 KB | 24/4/1 → 15/2/0 | 0.04 → 0.04 s | same | +| snes | 3000 | 0.870 → 0.650 s | 508 → 167 MB | 173.4 → 57.0 KB | 28/2/0 → 9/1/0 | 0.04 → 0.03 s | same | +| xnes | 2000 | 0.787 → 0.603 s | 288 → 125 MB | 147.5 → 64.0 KB | 16/1/0 → 6/0/0 | 0.03 → 0.01 s | same | +| openai-es | 3000 | 1.065 → 0.707 s | 550 → 169 MB | 187.7 → 57.7 KB | 30/2/0 → 9/1/0 | 0.04 → 0.03 s | same | +| lm-cma | 3000 | 1.135 → 0.920 s | 348 → 220 MB | 118.8 → 75.1 KB | 19/2/0 → 12/2/0 | 0.04 → 0.03 s | same | +| vkd-cma | 2000 | 0.651 → 0.466 s | 143 → 103 MB | 73.2 → 52.7 KB | 8/1/0 → 5/1/0 | 0.02 → 0.01 s | same | +| janus | 2000 | 0.487 → 0.476 s | 218 → 192 MB | 111.6 → 98.3 KB | 12/0/0 → 10/0/0 | 0.02 → 0.02 s | same | +| gp | 60 | 0.629 → 0.521 s | 425 → 137 MB | 7,253.3 → 2,338.1 KB | 38/33/24 → 21/20/17 | 0.02 → 0.01 s | same | +| bruteforce | 4320 | 12.291 → 8.742 s | 13,965 → 5,446 MB | 3,310.2 → 1,290.9 KB | 779/199/1 → 304/62/1 | 0.98 → 0.38 s | same | + +- `sms-emoa` and `moead` read slower here because the column times the second repetition, the one in which the tree's + code is still tiering up (step Q). Over four repetitions per process the tree is ahead from the cold run on: + SMS-EMOA all four 1.76 / 1.69 → 1.55 / 1.52 s, MOEA/D cold + second 1.19 → 0.94 s. +- `motpe`: at `d7aa9d9` its time moved within noise (six runs per side in both orders: base best 0.517 s, tree best + 0.474 s); step K then cut its allocation 386.6 → 353.3 KB per trial. +- Larger runs measured during the steps: `gp` 150 trials 15.6 → 13.2 s, 5,509 → 1,408 MB, gen-2 collections + 795 → 143 (step C); TuRBO 120 trials 4.64 → 4.28 s, 1,857 → 1,215 MB (step D); the TPE split at 3,000 trials + 693.6 → 551.7 µs (one objective) and 1,505.2 → 1,320.1 µs (two objectives), best of five (step F and its fix). +- `moead`'s gen-1 collections fell 8 → 0 with step P: its per-parameter mutation draws had left one + finalizable array each to the finalizer, which promoted them past gen 0. +- Unchanged by design: random, CMA-ES, NSGA-II/III, AGE-MOEA-2 and RVEA kept their per-trial bytes (CMA-ES and the + GA samplers were already 30–45 KB per trial after plans 13 and 14); their rows move within noise, allocations + included (the base itself measured 158–161 MB for `nsga2` across this pass's surveys). + +Gates over the final tree `cc1e4f3`: unit CI filter 2,209 passed, 1 skipped, 0 failed on net10.0 and on net8.0. +Earlier snapshots: `af20df1` and `9d94a6a` 2,209 passed, 1 skipped, 0 failed on both TFMs; `8c52e7c` net10.0 2,208 +passed, 1 skipped, 1 failed (the §6 journal-lock flake, under three concurrent test and survey processes), net8.0 +2,209 passed, 1 skipped, 0 failed. Documentation gate (5,855 declarations) 0 issues and Core built with the +documentation warnings as errors 0 errors. Hash probe 36/36 and GP-family probe 8/8 identical to the `4b65852` snapshot after every step. +Live-Optuna suites of the touched areas at their steps: TPE / PED-ANOVA / truncnorm 35, GP family 70, BruteForce 13, +QMC 20, ES / JANUS / VkD-CMA reference parity 39 + 6 skipped without the JANUS reference checkout, TPE / +multi-objective 74 + 1 skipped (step K), Grid and BruteForce 24 (step P). + +## 8. Follow-ups: the owner's decisions (2026-11-12) + +Asked through design pages after the pass; the work lives on the local branch `journey1` (the owner's plan: work there, +reset `main` to `origin/main`; nothing pushed). + +- **Journal-lock race: "Test fix + bounded retry" (`4ae4a1f`).** The owner first asked what holds the file and whether + anything but a retry would do. Measured: nothing holds it. A lock path deleted IN PLACE stays "delete pending" while + the deleting handle lives, and an exclusive create of a pending name is ACCESS_DENIED; releases never do that (C# and + Python Optuna rename the lock away, then unlink it), the flaky test did (`File.Delete` of its stale lock). Two threads + taking one lock 40,000 times each: in-place delete 5,070 denials idle and 14,277 under load, rename-then-delete 0 + and 0. Fix: the test removes its stale lock by rename-then-delete, and on Windows `JournalFileOpenLock.Acquire` waits + out ACCESS_DENIED like contention while the denials run unbroken for at most 1 s + (`JournalFileLockProtocol.MaxDeniedStreakMilliseconds`), then rethrows; off Windows unchanged. A documented departure + from Optuna's error path (its waiters raise `PermissionError` there); new tests `Lock_DeletedInPlace_IsWaitedOutOnWindows` + (`[Misaligned]`) and `Lock_PersistentlyDenied_IsReportedAfterTheBound`. Journal unit tests 98/98. +- **QA-84: "Call NumSharp directly" (`465f91c`).** The owner asked whether NumSharp would do instead of porting + NumPy's order: it does. NumSharp's `np.sum(axis=-1)` equals NumPy 2.4.2 at every row length 1–300 (the recursive + split past 128 included), but its pairwise kernel is private, so the TPE kernel now stores every term in NumPy's + `(n_samples, n_kernels, n_cont)` layout (rented) and calls `np.sum(terms, axis: -1, @out: sums)` on the wrapped + buffers. Seeded results: the 36-study hash probe and the survey's TPE studies unchanged (none samples eight or more + continuous dimensions jointly). Cost, 1,000 trials: `tpe` 0.75–0.81 → 1.20–1.34 s (+60–66%), `tpe-mixed` +27–41%, + `motpe` +39% (one dimension per call), `tpe-int` unchanged; allocation +6–25 MB. Not built, the owner's call: below + eight continuous dimensions NumPy's order IS left to right, so a bit-identical in-register path could skip NumSharp + there (MOTPE's whole +39%). +- **NumSharp OpenBugs for that cost ("create OpenBugs at journey5 … for the slowness or memory overallocation", + NumSharp `e9c38c2f`, `test/NumSharp.Tests/OpenBugs.Consumers.OptunaSharp.cs`).** Memory: nothing to pin; the call + allocates a constant 1.7–1.9 KB managed per call (the earlier "output-proportional garbage" was a cold-JIT + measurement). Two speed pins, same-process ratios with their batches alternating: + - `SumOverShortRows_CostsAFewLongRowSums`: 2,400 rows of 10 against the same values as 24 rows of 1,000, limit 5.0; + NumSharp 6.1–7.4, NumPy 3.3–3.5. NumSharp pays 17.6 ns per output row (NumPy 7.9) through `ForEach`'s one + inner-loop call per row, though its elements are cheaper (0.04 against 0.25 ns). + - `SumIntoOut_CostsAboutAFreshSum`: `out=` against the fresh call at `[24, 3000, 1]`, limit 1.25; NumSharp + 1.84–2.19, NumPy 1.02–1.04: `ReduceIntoOut` computes a fresh result and copies it into `out`. + - Calibration traps: a flat-sum reference moved with the process (NumSharp's flat sum is 4–5 µs in the test host, + 7.1–7.5 µs in a console probe); timed one route after the other, a hybrid CPU's slow stretch let the first version + pass with the bug present (alternating batches fixed it); the `out=` pin is Release-only (Debug 1.05–1.90). +- **QA-84's cost: "Keep; wait for NumSharp" (second round, same day).** Offered: a bit-identical in-register sum below + eight continuous dimensions (NumPy's own order there is left to right from `-0.0`, and the reduction's identity add + makes it equal to the old sum; `465f91c`'s tests already assert that), a full port of NumPy's order, or keeping it. + Kept: TPE keeps calling `np.sum(axis: -1, out:)` for every call, so Optuna's default independent TPE, which sums ONE + continuous dimension per call through NumSharp's `out=` path, stays 27–66% slower until NumSharp fixes the two pins. + Even fixed, a NumSharp call keeps a fixed per-call cost and the stored terms, so the shortcut stays the way to + recover all of it (§9, item 1). +- **Next performance work: "document the remaining and stop".** No further steps; §9 lists what is left. + +## 9. Remaining work (documented at the owner's request, 2026-11-12) + +Nothing below is scheduled. Each item names its measured cost and the rule a change must keep; every one is a +performance change that must leave seeded results bit-identical (the 36-study hash probe and the GP-family probe, +plus the area's live-Optuna suite), unless it says otherwise. + +1. **QA-84's cost in TPE** (§8). Today: `tpe` 1,000 trials 1.20–1.34 s against 0.75–0.81 s before `465f91c`, + `tpe-mixed` +27–41%, `motpe` +39%, allocation +6–25 MB. Owner decision: wait for NumSharp (its journey5 pins + `SumOverShortRows_CostsAFewLongRowSums` and `SumIntoOut_CostsAboutAFreshSum`; after a fix, bump NumSharp and + re-measure). The full recovery is the in-register sum below eight continuous dimensions, provably bit-identical + there. +2. **The study core's per-suggest cost** (§4 item 10). Random search spends 19.5 KB per trial: about 40% is the + in-memory storage's copy-on-write of a running trial's parameter and distribution dictionaries on each suggest, + about 20% closures and delegates. Every sampler pays it. Rule: copy-on-write is plan 13 S4's design for concurrent + readers; changing it needs its own correctness argument and the concurrency suite. +3. **BruteForce: cache finished trials' paths across rebuilds** (§4 item 6). Path building is 28% of its time; 4,320 + trials take 8.7 s and 5,446 MB (1.29 MB per trial). Rule: the per-rebuild categorical cache (`catCache`, the first + trial seen per name after filtering) must be reproduced exactly. +4. **NSGA-II precompute** (§4 item 2): each trial's values and constraints once, parameters only for the selected + parents, the joint search space updated in place (the sampler costs about 30 µs per trial; 5,000 trials 0.56 s, + 33 KB per trial). +5. **MOEA/D's `SystemAttrs` scans** (§4 item 12): two scans of every completed trial per ask (the offspring count and + the new offspring); an incremental count makes them O(new trials). 2,000 trials: 0.44 s, 48.6 KB per trial. +6. **TPE's estimator arrays** (§4 item 11): about 66% of a TPE trial's allocation (258 KB per trial at the end of the + pass) is the Parzen estimators' per-kernel `double[]`; pooling them means reworking who owns and returns them. +7. **The multi-objective split** (§4 item 8): `lvals` through nested LINQ (the LINQ part is provably bit-identical + to replace) and `UniqueRows` with an unstable delegate sort (its representative among equal rows, ±0, reaches the + hypervolume arithmetic, so changing it is not provably bit-identical). +8. **CMA-ES: keep the optimizer between tells** (§4 item 3) instead of restoring it from the stored state after each + tell (5,000 trials 0.80 s, 45.7 KB per trial). Rule: the stored state must stay the pickle cmaes 0.13.1 reads, and a + cached optimizer must be dropped when another worker tells. +9. **An unidentified source of NumSharp `UInt32` blocks** that the GP run leaves to the finalizer (§4 item 5): not the + entropy-seeded `RandomState()` (measured); find it with the `GCAllocationTick` sampler (§6). +10. **TPE scoring through ordered arrays** instead of name-keyed dictionaries (§4 item 1): not attempted; the kernels + were the larger costs. diff --git a/docs/plans/README.md b/docs/plans/README.md index 80a9a7c..b86eba9 100644 --- a/docs/plans/README.md +++ b/docs/plans/README.md @@ -46,6 +46,8 @@ numeric prefix is the recommended execution order. | [10](10-threading.md) | Threading: a configurable `nJobs` executor, then seven follow-ups | the reused worker threads of `9cfcb12` (done) | N | ★★ / medium | | [11](11-threading-round-2.md) | Threading, round 2: sampler per worker, OpenBLAS threads, locked log handlers, the async question | plan 10 (done) | N | ★★ / medium | | [12](12-parallel-read-duplicates.md) | Parallel reads never hand one point to two trials: per-sampler fixes and tests, the bridges pinned | plan 11 (done) | N | ★★ / medium | +| [13](13-rustuna-derived-performance.md) | **Built (2026-11-09)** — Rustuna-derived performance: compatible speedups as the only path, opt-in switches where results would change | plans 10-12 (done) | N | ★★★ / high | +| [14](14-rustuna-second-pass.md) | **Built (2026-11-09)** — Rustuna, second pass: NumSharp temporaries, exact O(n) TPE widths, TPE and QMC caches, sparse journal offsets, SQLite `UNION ALL`; each area gated byte for byte | plan 13 (done) | N | ★★ / medium | **Threading workstream (10, 11, 12).** Unrelated to JANUS. Plan 12 (done 2026-11-08) makes every Core sampler give trials that ask at once different points, without changing sequential runs, and pins what the four Python bridges @@ -57,6 +59,16 @@ through an options class at four levels. Phase 2, done only after Phase 1, close [`docs/THREADING.md`](../THREADING.md) §12: OS seed width, the terminator lock, Redis round trips and `DedicatedThreads`, cancellation, `PymooSampler` on any thread, and ML.NET search under `nJobs`. +**Performance workstream (13).** Designed with the owner on 2026-11-08; built 2026-11-09 (`99e9e73`, `f8df1a5`, +`4464e8a`, `9043b43`) except two items left for the owner. Rustuna, the Optuna team's Rust port, ran its announcement's +workloads 3-60x faster than OptunaSharp. Plan 13 adopts each of its techniques that keeps every result identical as +the only implementation: seeded studies hash identically before and after, and CMA-ES at 100,000 trials went from +988 s to 27.5 s, TPE at 1,000 trials from 10.5 s to 5.0 s, NSGA-II at 100,000 from 73 s to 22 s (§10 of the plan). +CMA-ES reusing its told optimizer is opt-in with Optuna's path as the default; the OpenBLAS thread count was measured +and left as it is (it changes results from about 100 dimensions); lazy attribute decoding was measured and replaced by +parsing each distribution text once. Left for the owner with numbers: TPE fast numerics, the bulk attribute API, and +compact storage of finished trials; the trial queue and trial discarding stay deferred. + **Tier-X pymoo-interop workstream (08–09).** Separate from the Tier-N native ports above: unlocked by the 2026-09-10 pymoo-on-numpy-2.4.2 migration (pymoo now runs in the interop interpreter, commit `9c7aec2`), these ship a `OptunaSharp.Interop.Pymoo` satellite that drives the **real** pymoo via pythonnet (the diff --git a/docs/qa/PARITY_QA_2026-11-02.md b/docs/qa/PARITY_QA_2026-11-02.md index 32db923..be44107 100644 --- a/docs/qa/PARITY_QA_2026-11-02.md +++ b/docs/qa/PARITY_QA_2026-11-02.md @@ -620,7 +620,7 @@ re-reported here. |----|----------|------|---------|------|--------| | QA-1 | MEDIUM | Distributions → every sampler | A stepped float range whose adjusted `high` is 0 stores `-0.0` (Python `+0.0`), e.g. `suggest_float("x", -0.5, 0.2, step=0.25)`. Random, TPE, TPE-mv, QMC, CMA-ES and NSGA-II then return `-0.0` for the top grid point every time (12–23 hits per 40 trials, Python: all `+0.0`); it reaches the objective, storage, logs and `best_params`. Cause: .NET's decimal sum `0.50 + (-0.5)` is a negative zero when the operand scales differ. | `SteppedHigh_AdjustedToZero_IsPositiveZero`, `SteppedHigh_AdjustedToZero_SamplersReturnPositiveZero` | **fixed 2026-11-06**: `AdjustDiscreteUniformHigh` normalizes a zero decimal sum to `+0`, as Python's Decimal addition gives; both tests pass without `[OpenBugs]` | | QA-2 | MEDIUM | Distributions, storage reads, mixed fleets | `_adjust_discrete_uniform_high` ends with `(double)decimal`, which is not correctly rounded (Python's `float(Decimal)` is). 1,726 of 20,000 realistic stepped ranges (8.6%) get a `high` one ULP off; C# reads a Python-written stepped distribution differently in 1,426 of 20,000 cases (7%), so mixed fleets hold different distributions for one parameter and `IntersectionSearchSpace` drops it. Upstream note: Optuna's own JSON round trip drops a whole step in 14% of these cases (2,836/20,000); the port's 1-ULP error moves *which* cases do (3,078/20,000). | `SteppedHigh_Adjustment_IsCorrectlyRounded`, `FromJson_PythonWrittenSteppedDistribution_ReadsLikePython` | **fixed 2026-11-06**: `PyNumbers.DecimalToDouble` (exact digits, then IEEE `double.Parse`) replaces `(double)decimal`; both tests pass without `[OpenBugs]` | -| QA-3 | LOW | Distributions | Magnitudes outside .NET decimal's range: values below `1e-28` parse as 0 (no adjustment, or `high < low`: `FloatDistribution(5e-324, 0.30000000000000004, step=1.0)` stores `high=0.0`); a quotient beyond 28 digits (`(0, 1e20, step=1e-09)`) raises `decimal.InvalidOperation` in Python and is accepted by the port; NaN/inf steps give `FormatException` where Python gives `high=nan` or `InvalidOperation`; so do NaN / inf *bounds* with a finite step (`suggest_float("a", nan, 1.0, step=0.1)`: Python `decimal.InvalidOperation`, port `FormatException: The input string 'nan' was not in a correct format.`; seen 18 times in D79). | `SteppedHigh_TinyMagnitudes_FollowPythonDecimal`, `SteppedHigh_QuotientBeyondDecimalPrecision_RaisesLikePython` | open (question Q1) | +| QA-3 | LOW | Distributions | Magnitudes outside .NET decimal's range: values below `1e-28` parse as 0 (no adjustment, or `high < low`: `FloatDistribution(5e-324, 0.30000000000000004, step=1.0)` stores `high=0.0`); a quotient beyond 28 digits (`(0, 1e20, step=1e-09)`) raises `decimal.InvalidOperation` in Python and is accepted by the port; NaN/inf steps give `FormatException` where Python gives `high=nan` or `InvalidOperation`; so do NaN / inf *bounds* with a finite step (`suggest_float("a", nan, 1.0, step=0.1)`: Python `decimal.InvalidOperation`, port `FormatException: The input string 'nan' was not in a correct format.`; seen 18 times in D79). | `SteppedHigh_TinyMagnitudes_RoundLikeDotNetDecimal`, `SteppedHigh_QuotientBeyondDecimalPrecision_IsAccepted` (both `[Misaligned]`) | **kept, `[Misaligned]` 2026-11-12** (owner's answer to Q1, asked with QA-62 of `PARITY_QA_2026-11-10.md`: keep .NET `decimal`); the tests pin the port's values and `FloatDistribution`'s docs list the cases | | QA-4 | LOW | Distributions | `AdjustIntUniformHigh` computes `high - low` in 64 bits: `IntDistribution(long.MinValue, long.MaxValue, step=2)` collapses to `high = long.MinValue` (single value) with a warning saying so; Python adjusts to `9223372036854775806`. | `SteppedIntHigh_FullInt64Range_DoesNotOverflow` | open | | QA-5 | LOW | Distributions, `suggest_int` | `IntDistribution.ToExternalRepr(±inf / NaN / 1e30)` saturates or returns 0; Python raises `OverflowError` / `ValueError`. Public path: an enqueued `inf` for an int parameter makes `SuggestInt` return and store `9223372036854775807` (Python: `OverflowError`), and `1e30` is clamped. | `IntToExternalRepr_NonFinite_RaisesLikePython`, `SuggestInt_EnqueuedInfinity_RaisesLikePython` | open | | QA-6 | LOW | Distributions | `float()` string parsing rejects PEP 515 underscores (`'1_000'`), which Python accepts. Same gap for non-ASCII decimal digits (`'1.5'`, `'١٢'`), which `float()` maps to ASCII and .NET's invariant parser rejects (D101). | `ToInternalRepr_UnderscoreDigitString_ParsesLikePythonFloat` | open | @@ -634,45 +634,46 @@ re-reported here. | QA-14 | HIGH | WilcoxonPruner (`SignedRankTest`) | scipy 1.16.3 switches `method="auto"` to the normal approximation when n > 50 **before** checking ties; the port uses the exact distribution at any length when there are no ties/zeros (the usual case for continuous losses). p-values differ from the 3rd significant digit (n=60: 0.00121 vs 0.00103) and prune decisions flip near `p_threshold` (repro: step 59 prunes in Python, not in C#). From ~1,024 steps the exact path overflows `2^n` and returns NaN, so the pruner never prunes, and it costs ~0.7 s per `should_prune` (O(n³)). | `Wilcoxon_MoreThan50Steps_UsesScipyNormalApproximation`, `Wilcoxon_1100Steps_PValueIsFiniteLikeScipy`, `WilcoxonPruner_60Steps_PrunesAtPythonsSteps` | **fixed 2026-11-06**: `PValueZsplit` takes the normal approximation for every n > 50, as scipy's `_wilcoxon_iv` does; the three tests pass without `[OpenBugs]` | | QA-15 | NIT | fANOVA | Zero total variance raises `InvalidOperationException`; Python raises `RuntimeError` (same text). | `Fanova_ZeroVariance_RaisesRuntimeError` | open — known before this run (catalog Open item 20, 2026-10-26 review LOW list: fANOVA constant objective); this run adds the test | | QA-16 | LOW | PED-ANOVA, artifacts `Backoff`, multi-objective TPE split | Python validates user arguments with `assert` (`PedAnovaImportanceEvaluator` quantiles; `Backoff` retries/multiplier/delays; `assert 0 < n_below < len(trials)` in `_split_complete_trials_multi_objective`); the port uses `Debug.Assert`, compiled out of the Release package, so bad arguments are accepted. `Backoff(store, maxRetries: 0).Write(...)` then silently writes nothing; a multi-objective TPE with a `gamma` returning a negative count completes trials that Optuna fails with `AssertionError()`. Same class, NIT: `CrossValidationErrorEvaluator.evaluate([])` raises `ArgumentOutOfRangeException` where Python raises `AssertionError`. The full audit of the 124 `Debug.Assert` sites (D51) found no other user-reachable one. | `PedAnova_InvalidQuantiles_RejectedInReleaseBuilds`, `Backoff_ZeroRetries_RejectedAtConstruction`, `TpeMultiObjective_NegativeGamma_FailsTrialsLikePythonAssert` | open | -| QA-17 | NIT | CmaEsSampler `x0` | An `x0` missing a search-space parameter fails the trial with `KeyNotFoundException: The given key 'li' ...`; Python: `AssertionError: Parameter configuration must contain all distributions.` (trajectories identical up to the failure). | `CmaEs_X0MissingParameter_FailsWithPythonsMessage` | open | +| QA-17 | NIT | CmaEsSampler `x0` | An `x0` missing a search-space parameter fails the trial with `KeyNotFoundException: The given key 'li' ...`; Python: `AssertionError: Parameter configuration must contain all distributions.` (trajectories identical up to the failure). | `CmaEs_X0MissingParameter_FailsWithPythonsMessage` | **fixed 2026-11-12** by `1e8aba6` with run 2's QA-83 (`SearchSpaceTransform.TransformValues` raises Python's `Parameter configuration must contain all distributions.`); the test passes and lost `[OpenBugs]` 2026-11-14 | | QA-18 | LOW | `trials_dataframe` | Nested columns of dict attributes are sorted with a comparer that parses digit-only keys as numbers, so params `"1"`, `"2"`, `"10"` give `params_1, params_2, params_10`; Python's `sorted()` on the string keys gives `params_1, params_10, params_2` (same for user/system attrs). | `TrialsDataframe_DigitOnlyKeys_SortAsStringsLikePython` | open | | QA-19 | LOW | `trials_dataframe` | Only a fixed attribute list is supported: `attrs=("distributions", ...)` throws `ValueError: Unsupported attr: distributions` and `_number`-style private names are rejected, where Python's `getattr` expands `distributions` into nested columns and strips the underscore. | `TrialsDataframe_DistributionsAndPrivateAttrs_SupportedLikePython` | open | | QA-20 | LOW | `PyJson.Dumps` | A `BigInteger` (Python int beyond 64 bits) throws `TypeError: Object of type BigInteger is not JSON serializable`; `json.dumps` writes the exact digits. With the known read side (catalog 21c, big ints parse as double), a Python-written big int never survives a C# read and re-write. Also visible in every plot hovertext: `_make_json_compatible` falls back to `str()` on the `TypeError`, so a user attribute `10**20` shows as the string `"100000000000000000000"` (Python: the bare number). | `Dumps_BigInteger_WritesExactDigitsLikePython` | open | | QA-21 | LOW | `PyJson.Loads` | Accepts JSON that Python's strict decoder rejects: raw control characters in strings, leading zeros (`01`), `1.`, `.5`, `+1`. Reachable from the CLI's `--search-space` / `--sampler-kwargs`. | `Loads_MalformedJson_RejectedLikePythonStrictDecoder` | open | -| QA-22 | LOW | Terminator `CrossValidationErrorEvaluator` | `np.var(cv_scores)` is ported as a sequential loop (`NumpyVar`), but numpy's `add.reduce` uses 8 interleaved accumulators from 8 elements on; 1,584 of 5,000 random 10-fold score sets give a different error (e.g. `0.03772062328635506` vs `...505`). `MathUtil.Mean/Std/PairwiseSum` already implement numpy's order. | `CrossValidationError_TenScores_MatchesNumpyPairwiseVar` | open — known before this run (catalog Open item 20, 2026-10-26 review LOW list: `NumpyVar` sums sequentially); this run adds the test | +| QA-22 | LOW | Terminator `CrossValidationErrorEvaluator` | `np.var(cv_scores)` is ported as a sequential loop (`NumpyVar`), but numpy's `add.reduce` uses 8 interleaved accumulators from 8 elements on; 1,584 of 5,000 random 10-fold score sets give a different error (e.g. `0.03772062328635506` vs `...505`). `MathUtil.Mean/Std/PairwiseSum` already implement numpy's order. | `CrossValidationError_TenScores_MatchesNumpyPairwiseVar` | **fixed 2026-11-11** (`156ce8a`): `NumpyVar` calls NumSharp's `np.var`, which runs NumPy's `_var` and its pairwise sums (305 of 305 lengths bit-identical to NumPy, against 85 for the old loop); the test passes without `[OpenBugs]` | | QA-23 | LOW | NSGA-II/III constraints, TPE constraints | Constraint-violation totals use sequential sums where Optuna uses CPython 3.12's Neumaier-compensated `sum()` over Python floats: violations `0.1, 0.2, 0.3` total `0.6000000000000001` instead of `0.6`, which flips `_constrained_dominates` and the `_evaluate_penalty` ranking against a trial violating by `0.6000000000000001`. Same in TPE's `_get_infeasible_trial_score`. Same root cause as known M7 (importance normalization). | `ConstraintViolationSums_UseCompensatedSumLikeCPython` | open | | QA-24 | MEDIUM | SHAP importance (`TreeShap`) | shap's `TreeExplainer` casts `X` to `float32` (`input_dtype`) for scikit-learn forests before traversing; the port traverses with float64 (its comment claims shap does). A stepped float such as `0.35000000000000003` (float32 `0.3499999940395355`) sitting exactly on a split threshold takes the other branch: in a Random-seed-42 study with stepped/log params one of 64 trees differs for six rows and the normalized importances move by ~5e-4 relative (`j=0.8293157756066445` vs `0.8285727626755199`). The forest is node-for-node identical (fANOVA bit-exact), so only the traversal is wrong. | `Shapley_SteppedFloatOnSplitThreshold_TraversesFloat32LikeShap` | **fixed 2026-11-06**: `TreeShap` traverses the float32 matrix the forest was fit on, widened to double; the test passes bit-exact without `[OpenBugs]` | | QA-25 | LOW | `upload_artifact` MIME guess | The port's `MimeTypes` is a ~35-entry hand table, not CPython's `mimetypes`: it knows types CPython 3.12 doesn't (`.yaml`, `.yml`, `.webp` → Python stores `application/octet-stream`), misses ones it does (`.tsv`, `.h5`, `.sh`, `.ico`, ...), lacks `suffix_map` (`.tgz` → `('application/x-tar', 'gzip')`, `.svgz`), matches encodings case-insensitively (`a.GZ`, `a.z`) and strips every encoding suffix (`a.txt.gz.gz`). An empty `mimetype=""` / `encoding=""` is stored as-is where Python's `or` chain falls back to the guess. | `UploadArtifact_GuessedMimeTypes_MatchCPythonMimetypes`, `UploadArtifact_EmptyMimeTypeAndEncoding_FallBackLikePython` | **fixed 2026-11-06** (owner: Q2 = CPython's built-in table): `MimeTypes` ports CPython 3.12.10–3.12.12's `_types_map_default` / `_suffix_map_default` / `_encodings_map_default` and `guess_type(strict=True)` (urlparse scheme and `data:` handling, lowercased suffix_map loop, case-sensitive single encoding), and `upload_artifact` falls back on `""` like Python's `or`; both tests pass without `[OpenBugs]`, plus `GuessType_MatchesCPython312BuiltInTable` (42 names) and the live `MimeTypesParityTests` (every table key in seven spellings, 1,141 names) | | QA-26 | MEDIUM | `plot_parallel_coordinate` info | A categorical parameter with a `None` choice crashes `ParallelCoordinate.GetInfo` with `ArgumentNullException: Value cannot be null. (Parameter 'key')`: the categorical vocabulary is a `Dictionary<object?, int>` keyed by the raw choice. Optuna returns the dimension with ticktext `['None', 'a', 'b']`. `suggest_categorical(..., [None, ...])` is a common optional-parameter pattern. The D75 random-study fuzz hit it in 74 of 600 studies. | `ParallelCoordinate_NoneCategoricalChoice_HandledLikePython` | **fixed 2026-11-06**: the vocabulary keys a `None` choice through a sentinel and maps it back for the tick labels; the test passes without `[OpenBugs]` | | QA-27 | LOW | `_SearchSpaceTransform.untransform` (int) | For int spans of 2^63 or more, `floor((t - low) / step + 0.5)` is cast to `long` (saturates on net10.0, `long.MinValue` on net8.0) and `step_index * step + low` wraps: over `[-2**63, 2**63 - 1]` every coordinate `t >= 0` maps to `-1` (Optuna: `9.004502142883758e17` → `900450214288375808`), the top of `[-2**62, 2**62]` maps to `2**62 - 1`. Latent today: the known catalog item 19c (`IntDistribution.Single()` overflows) keeps such parameters away from every sampler, so fixing 19c alone would surface this. | `IntUntransform_SpanOf2Pow63OrMore_DoesNotOverflow` | open | | QA-28 | MEDIUM | PED-ANOVA (default `get_param_importances` / `plot_param_importances` evaluator) | `CountNumericalParamInGrid` computes `Math.Min((int)Math.Round((high - low) / step) + 1, nSteps)`: for 2^31 - 1 or more grid steps the cast saturates (net10.0; `int.MinValue` on net8.0), `+ 1` wraps negative, and allocating the count array throws `OverflowException: Arithmetic operation resulted in an overflow.` Python's ints give `min(huge, 50) = 50`. Triggered by the common `suggest_int("random_state", 0, 2**31 - 1)` / `suggest_int("seed", 0, 2**32 - 1)`, by `suggest_int("n", 0, 10**10)` and by `suggest_float("x", 0, 1, step=1e-10)`. | `PedAnova_IntRangeOf2Pow31Steps_DoesNotOverflow` | **fixed 2026-11-06**: `MinGridSteps` compares in double before narrowing (Int128 spans); the test passes without `[OpenBugs]` | -| QA-29 | LOW | TPESampler `_compare` | The acquisition `log l(x) - log g(x)` is `-inf - (-inf) = NaN` when a candidate has zero mass under both mixtures (a log int above 2^53, where `x ± 0.5` is one double; linear grids of ~1e16+ steps). `np.argmax` returns the first NaN; the port's `ArgMax` uses a strict `>` loop that skips NaN (its comment assumes finite values) and returns the largest finite candidate. `suggest_int("v", 1, 2**62, log=True)`, TPE seed 3: trial 5 is `235956546695320384` in Optuna, `114` in the port. The other strict-`>` argmax helpers (GPSampler, `Gp/OptimSample`, `Hypervolume`, `EmmrEvaluator`) share the pattern, but no NaN input was found for them. | `Tpe_NanAcquisitionValues_PickFirstNanLikeNumpyArgmax` | open | -| QA-30 | NIT | `np.clip` port (`MathUtil.Clip`) | `Math.Min(Math.Max(x, low), high)` orders `-0.0` below `+0.0`; `np.clip` keeps `x` unless it is strictly outside (`np.clip(0.0, -1.0, -0.0)` = `+0.0`, `np.clip(-0.0, 0.0, 1.0)` = `-0.0`). A stepped float with upper bound `-0.0` (`-min_shift` with `min_shift = 0.0`) therefore stores `-0.0` for its top grid point where Optuna stores `0.0` (Random seed 1: 6 of 30 trials), through Random, QMC, CMA-ES and GP; TPE's discrete sampling and NSGA-II's mutation use the same helper. | `SteppedFloat_NegativeZeroHigh_TopGridPointIsPositiveZero` | open | +| QA-29 | LOW | TPESampler `_compare` | The acquisition `log l(x) - log g(x)` is `-inf - (-inf) = NaN` when a candidate has zero mass under both mixtures (a log int above 2^53, where `x ± 0.5` is one double; linear grids of ~1e16+ steps). `np.argmax` returns the first NaN; the port's `ArgMax` uses a strict `>` loop that skips NaN (its comment assumes finite values) and returns the largest finite candidate. `suggest_int("v", 1, 2**62, log=True)`, TPE seed 3: trial 5 is `235956546695320384` in Optuna, `114` in the port. The other strict-`>` argmax helpers (GPSampler, `Gp/OptimSample`, `Hypervolume`, `EmmrEvaluator`) share the pattern, but no NaN input was found for them. | `Tpe_NanAcquisitionValues_PickFirstNanLikeNumpyArgmax` | **argmax fixed 2026-11-11** (`8a7e19e`): `TPESampler.ArgMax` is NumPy's argmax loop (the first NaN wins; NumSharp's `np.argmax` agrees but costs 2.3 µs per call on this per-parameter path), and every other strict-`>` argmax helper named here now follows NumPy too (GPSampler, `Gp/OptimMixed`, `Gp/OptimSample`, EMMR through NumSharp; the HSSP greedy step as a loop). **The reproduction still fails, through the documented erf / UCRT class:** the port's candidate 1 is `222479646760819` (Optuna `222479646760813`), whose log-int bin collapses to one double, so the port has an extra NaN at index 1 and picks it (Optuna's NaNs: 5, 6, 8, 9, 21; the port's: 1, 5, 6, 8, 9, 21). Stays `[OpenBugs]` until that tolerance closes | +| QA-30 | NIT | `np.clip` port (`MathUtil.Clip`) | `Math.Min(Math.Max(x, low), high)` orders `-0.0` below `+0.0`; `np.clip` keeps `x` unless it is strictly outside (`np.clip(0.0, -1.0, -0.0)` = `+0.0`, `np.clip(-0.0, 0.0, 1.0)` = `-0.0`). A stepped float with upper bound `-0.0` (`-min_shift` with `min_shift = 0.0`) therefore stores `-0.0` for its top grid point where Optuna stores `0.0` (Random seed 1: 6 of 30 trials), through Random, QMC, CMA-ES and GP; TPE's discrete sampling and NSGA-II's mutation use the same helper. | `SteppedFloat_NegativeZeroHigh_TopGridPointIsPositiveZero` | **fixed 2026-11-11** (`8a7e19e`): `MathUtil.Clip` is NumPy's const clip loop (a tie keeps the value's zero sign, a NaN bound fills), the GP search space's private clip delegates to it, and the new `MathUtil.ClipGeneral` is NumPy's general loop (a tie takes the bound), which TPE's discrete rounding uses for two or more discrete columns (measured: one column runs const, two or more general); both checked against NumSharp's `np.clip` on the matching layouts. The test passes without `[OpenBugs]` | | QA-31 | MEDIUM | QMCSampler, batched `ask` | With no finished trial, `infer_relative_search_space` unions the distributions of the RUNNING trials from the per-ask trial cache. Python's cache holds the storage's trial objects, which `Trial._suggest` mutates in place through `_cached_frozen_trial`, so in a batch of asks trial 1 already sees trial 0's parameters and gets Sobol point 0. The port's `Trial` keeps a detached copy (introduced in `3a75811` against a data race), so the cached snapshot shows no distributions and trials 1…k-1 of the first batch are sampled at random; QMC starts at trial k with sample id 0, so every later trial is Optuna's trial `n - (k - 1)`. Seed 5, batch of 4, `x ∈ [-3, 3]`: Optuna `-1.668…, -3.0, 0.0, 1.5, -1.5`, port `-1.668…, 2.224…, -1.759…, 2.511…, -3.0`. The other cache readers (TPE, CMA-ES, GP, GA base) only read finished trials, so they are unaffected. | `Qmc_BatchedAsk_UsesSearchSpaceOfRunningTrialsLikeOptuna` | **fixed 2026-11-06**: `Trial.MirrorIntoThreadCache` makes the current thread's trial cache see the trial's writes when Python's would (object identity, no shared mutation); the test passes without `[OpenBugs]` | | QA-32 | NIT | `plot_timeline` info | The reversed-times warning interpolates `DateTime` with the current culture's default format and drops the fraction: Optuna `The start time is 2026-01-02 03:10:00 and the end time is 2026-01-02 03:09:59.500000.`, port `1/2/2026 3:10:00 AM` / `1/2/2026 3:09:59 AM` (en-US; other cultures differ). The only `DateTime` interpolation in a Core message. | `Timeline_ReversedTimesWarning_FormatsDatetimesLikePython` | open | | QA-33 | LOW | Messages and reprs, all of Core | Integers interpolated with `$"{value}"` use the current culture's negative sign: `U+2212` under sv-SE / nb-NO / fi-FI, `U+200E` + `-` under he-IL, `U+061C` + `-` under ar-SA, `U+200E U+2212` under fa-IR. Python always prints `-`. Seen in the int-step adjustment warning (`[−3, 4]`), every "cannot be negative, but got …=-1" validation message and `FrozenTrial`'s repr (`number=؜-1`). Floats go through `PythonRepr` and are unaffected; en-US, ja-JP, de-DE, tr-TR print the same as Python. | `NegativeIntegersInMessages_UseAsciiMinusUnderAnyCulture` | open — known before this run (catalog Open item 22, pass 2B: U+061C / U+200E / U+2212 signs); this run measures all of Core and adds the test | -| QA-34 | LOW | CmaEsSampler (`Cma`, `SepCma`) | cmaes 0.13.1 asserts `_is_valid_bounds(bounds, mean)` ("invalid bounds") when the optimizer is built; the port's `Cma` and `SepCma` constructors skip it (only `CmaWm` checks). `CmaEsSampler(x0={"x": 5.0, "y": 0.0})` on `[-1, 1]²`: Optuna fails trials 1–3 with `AssertionError('invalid bounds')` (and `optimize` without `catch` stops), the port completes them around the outside mean. | `CmaEs_X0OutsideBounds_FailsTrialsLikeCmaes` | open | +| QA-34 | LOW | CmaEsSampler (`Cma`, `SepCma`) | cmaes 0.13.1 asserts `_is_valid_bounds(bounds, mean)` ("invalid bounds") when the optimizer is built; the port's `Cma` and `SepCma` constructors skip it (only `CmaWm` checks). `CmaEsSampler(x0={"x": 5.0, "y": 0.0})` on `[-1, 1]²`: Optuna fails trials 1–3 with `AssertionError('invalid bounds')` (and `optimize` without `catch` stops), the port completes them around the outside mean. | `CmaEs_X0OutsideBounds_FailsTrialsLikeCmaes` | **fixed 2026-11-12** by `1e8aba6` with run 2's QA-80 (`Cma` / `SepCma` assert cmaes' `_is_valid_bounds`); the test passes and lost `[OpenBugs]` 2026-11-14 | | QA-35 | LOW | CLI `tell --values` | `--values` is an `Option<double[]>` parsed by .NET rules, which reject `inf` (and `1_000`): `optunasharp tell … --values 0.25 inf` prints "Cannot parse argument 'inf' for option '--values' as expected type 'System.Double'." plus the help and exits 1 without telling the trial; Optuna tells `[0.25, inf]`. Same parser as the known catalog item on `--values` following the locale; parsing with `PyFloat` semantics would fix both. | `Tell_InfValue_AcceptedLikePythonFloat` (CLI tests) | open | -| QA-36 | NIT | CLI `-f yaml` | On Windows YAML output ends lines with `CR CR LF` (YamlDotNet's `CR LF` text passed through a writer that converts line feeds again); redirected to a file it shows a blank line after every line. Linux is unaffected. YAML byte-parity with PyYAML is documented as best-effort (null as empty, `n` quoted, datetime quoting differ), the doubled CR is a plain defect. | `TrialsYaml_LinesEndOnce` (CLI tests) | open | +| QA-36 | NIT | CLI `-f yaml` | On Windows YAML output ends lines with `CR CR LF` (YamlDotNet's `CR LF` text passed through a writer that converts line feeds again); redirected to a file it shows a blank line after every line. Linux is unaffected. YAML byte-parity with PyYAML is documented as best-effort (null as empty, `n` quoted, datetime quoting differ), the doubled CR is a plain defect. | `TrialsYaml_LinesEndOnce` (CLI tests) | **fixed 2026-11-12** by QA-61 of `PARITY_QA_2026-11-10.md`: `-f yaml` is a port of PyYAML's `safe_dump`, which writes ` +` only | | QA-37 | LOW | CLI usage errors | argparse exits 2 and prints a usage line plus `optuna create-study: error: argument --direction: invalid choice: 'up' (choose from minimize, maximize)` to stderr; the port exits 1 and prints the command's help to stdout. Same for an invalid `tell --state`, an unknown subcommand and a missing required option. | `UsageError_ExitsWith2LikeArgparse` (CLI tests) | open — known before this run (catalog Open item 18; pass 2 notes it); this run adds the test | | QA-38 | NIT | SQLite RDB storage (reads) | Optuna loads trial attributes with `selectinload` and no `ORDER BY`; SQLite answers through `sqlite_autoindex_trial_user_attributes_1 (trial_id, key)`, so attributes set as `err, e, o` read back as `e, err, o`. The port's `LoadTrialAttrs` orders by the attribute row id, i.e. insertion order. Values are equal; the order shows in user code, JSON output, plot hovertexts, and `copy_study` re-inserts in read order. Params are unaffected (Optuna sorts them by `param_id`); journals keep insertion order in both. Study attributes too (D81): Optuna's RDB storage does not cache them, so even the writing process reads `study.user_attrs` set as `u, s, a` back as `a, s, u` (system attributes `zz, b` as `b, zz`); the port returns insertion order. | `TrialUserAttrs_ReadBackInIndexOrderLikeOptuna`, `StudyUserAttrs_ReadBackInIndexOrderLikeOptuna` (Storage tests) | open | | QA-39 | NIT | Deprecated classes | `RetryFailedTrialCallback` and `JournalFileStorage` carry only a compile-time `[Obsolete]`; Optuna's `@deprecated_class` warns at every construction ("RetryFailedTrialCallback has been deprecated in v4.9.0. … Use `RetryHeartbeatStaleTrialCallback` instead.", "JournalFileStorage has been deprecated in v4.0.0. … Use :class:`~optuna.storages.journal.JournalFileBackend` instead."). The port does warn at run time for the other deprecations (distribution classes, `suggest_uniform` family, `get_failed_trial_callback`, sampler arguments). | `DeprecatedClasses_EmitRuntimeFutureWarningLikeOptuna` | open | | QA-40 | LOW | MDI importance (`Mdi.FeatureImportances`) | scikit-learn's `RandomForestRegressor.feature_importances_` returns `mean / np.sum(mean)` with no guard, so a forest whose trees split but whose impurity decreases sum to zero gives NaN; the port's `if (sum != 0.0)` returns zeros, which `get_param_importances` normalizes to a uniform `1 / n`. It happens when the MSE criterion cancels: objective values near `-1e12` with a spread of about 29 make sklearn store root impurity `2^27` and leaf impurities `0` and `2^28` (the port's CART reproduces them bit for bit), so every decrease is exactly 0. Two trials suffice: Optuna `{'b': nan, 'a': nan}`, port `{b: 0.5, a: 0.5}` (`0.0` unnormalized). | `Mdi_ZeroTotalImpurityDecrease_ReturnsNaNLikeSklearn` | open | -| QA-41 | LOW | RandomSampler and every sampler's independent path (`NumPyRandom.uniform`) | numpy's `RandomState.uniform` raises `OverflowError: Range exceeds valid bounds` before drawing when `high - low` is not finite; NumSharp's `uniform(NDArray, NDArray)` computes `low + rand * (high - low)` unchecked. `FloatDistribution` accepts infinite bounds in both languages, so `suggest_float("x", 1e-3, inf)` stores `inf` in the port (Optuna: `OverflowError`), `(-inf, 1)` ends in `ValueError: `nan` is invalid value.`, `(-1e308, 1e308)` (span overflows) is sampled, and the draw consumed by the failed suggestion shifts every later random value of the study (Random seed 0: the next `suggest_float("y", 0, 1)` is `0x3fe6e2d4cf608733` instead of `0x3fe18fe1565f12a8`). TPE start-up, QMC, NSGA-II and CMA-ES all raise `OverflowError` in Optuna through the same call; on a finished trial Optuna reports it before `UpdateFinishedTrialError` because it samples first. The check belongs in NumSharp (`refs/NumSharp`, `RandomSampling/np.random.uniform.cs`) or in a wrapper at the call sites. | `RandomSampler_InfiniteRange_RaisesOverflowWithoutDrawingLikeNumpyUniform` | open | -| QA-42 | LOW | NumSharp `randint` / `choice` over one candidate → NSGA-II / NSGA-III | numpy's bounded-integer generator returns `low` without drawing when the range is 0 (`randint(lo, lo + 1)`, `choice(1)`); NumSharp's `MT19937.Next(1)` draws a 32-bit word and masks it to 0, so every later value of that stream shifts (`RandomState(0)`: next `random_sample()` `0x3fe2f89546dc5a99` instead of `0x3fe18fe1565f12a8`). In Optuna the case arises in NSGA-II / NSGA-III `_select_parent`, whose second parent is drawn from the candidates not yet chosen: with `population_size=2`, or 3 under the three-parent SPX / UNDX, or a parent population that failed trials shrank to that size, the port's children differ from the first offspring generation on (seed 0, `mutation_prob=0.0`, two floats: trial 2 `y` `0.43037873274483895` in Optuna, `0.08976636599379373` here). One-parameter studies hide it, because the default mutation re-draws every parameter from the independent sampler's own stream. The same call shape exists in `GridSampler` / `BruteForceSampler` (harmless there: they stop the study at that point), in `NSGAIIChildGenerationStrategy`'s no-crossover branch, and in beyond-Optuna samplers (`De`, `Moead`); `NsgaiiiCptCrossover` already special-cases a single carrier. Fix in NumSharp (`RandomSampling/MT19937.cs`) or at the call sites. | `RandInt_SingleValueRange_DrawsNothingLikeNumpy`, `NsgaII_PopulationOfTwo_SecondParentDrawLeavesStreamLikeOptuna` | open | +| QA-41 | LOW | RandomSampler and every sampler's independent path (`NumPyRandom.uniform`) | numpy's `RandomState.uniform` raises `OverflowError: Range exceeds valid bounds` before drawing when `high - low` is not finite; NumSharp's `uniform(NDArray, NDArray)` computes `low + rand * (high - low)` unchecked. `FloatDistribution` accepts infinite bounds in both languages, so `suggest_float("x", 1e-3, inf)` stores `inf` in the port (Optuna: `OverflowError`), `(-inf, 1)` ends in `ValueError: `nan` is invalid value.`, `(-1e308, 1e308)` (span overflows) is sampled, and the draw consumed by the failed suggestion shifts every later random value of the study (Random seed 0: the next `suggest_float("y", 0, 1)` is `0x3fe6e2d4cf608733` instead of `0x3fe18fe1565f12a8`). TPE start-up, QMC, NSGA-II and CMA-ES all raise `OverflowError` in Optuna through the same call; on a finished trial Optuna reports it before `UpdateFinishedTrialError` because it samples first. The check belongs in NumSharp (`refs/NumSharp`, `RandomSampling/np.random.uniform.cs`) or in a wrapper at the call sites. | `RandomSampler_InfiniteRange_RaisesOverflowWithoutDrawingLikeNumpyUniform` | **fixed upstream** in NumSharp 0.80.0 (`f87b4d04`: the legacy `RandomState` is NumPy's `legacy-distributions.c` line for line); found passing by the 2026-11-11 `[OpenBugs]` run, marker removed in `8a7e19e` | +| QA-42 | LOW | NumSharp `randint` / `choice` over one candidate → NSGA-II / NSGA-III | numpy's bounded-integer generator returns `low` without drawing when the range is 0 (`randint(lo, lo + 1)`, `choice(1)`); NumSharp's `MT19937.Next(1)` draws a 32-bit word and masks it to 0, so every later value of that stream shifts (`RandomState(0)`: next `random_sample()` `0x3fe2f89546dc5a99` instead of `0x3fe18fe1565f12a8`). In Optuna the case arises in NSGA-II / NSGA-III `_select_parent`, whose second parent is drawn from the candidates not yet chosen: with `population_size=2`, or 3 under the three-parent SPX / UNDX, or a parent population that failed trials shrank to that size, the port's children differ from the first offspring generation on (seed 0, `mutation_prob=0.0`, two floats: trial 2 `y` `0.43037873274483895` in Optuna, `0.08976636599379373` here). One-parameter studies hide it, because the default mutation re-draws every parameter from the independent sampler's own stream. The same call shape exists in `GridSampler` / `BruteForceSampler` (harmless there: they stop the study at that point), in `NSGAIIChildGenerationStrategy`'s no-crossover branch, and in beyond-Optuna samplers (`De`, `Moead`); `NsgaiiiCptCrossover` already special-cases a single carrier. Fix in NumSharp (`RandomSampling/MT19937.cs`) or at the call sites. | `RandInt_SingleValueRange_DrawsNothingLikeNumpy`, `NsgaII_PopulationOfTwo_SecondParentDrawLeavesStreamLikeOptuna` | **fixed upstream** in NumSharp 0.80.0 (`f87b4d04`, same rewrite: `randint(lo, lo + 1)` draws nothing); both tests found passing on 2026-11-11, markers removed in `8a7e19e` | | QA-43 | LOW | Every `sorted()` of names (`GridSampler`, importance evaluators, `trials_dataframe`, contour / slice / rank / parallel coordinates, JANUS MOO) | Python orders strings by code point; the ports use `StringComparer.Ordinal`, i.e. UTF-16 code units, which put a character above U+FFFF (leading surrogate U+D800–U+DBFF) before one in U+E000–U+FFFF (fullwidth / halfwidth forms, private use). With parameters `x` (U+FF58) and `😀` (U+1F600): `GridSampler(seed=0)` visits `(2,5) (1,5) (1,4) (2,3) (1,3) (2,4)` in Optuna and `(2,5) (1,4) (2,3) (2,4) (1,3) (1,5)` in the port; fANOVA gets its columns in another order (`x` 0.990690 vs 0.993145); `trials_dataframe` columns and the slice subplots swap. Sites: `GridSampler.cs:78`, `BaseImportanceEvaluator.cs:116`, `TrialsDataframe.cs:229/283`, `Contour.cs:97/106/303`, `Slice.cs:91/98`, `Rank.cs:108`, `ParallelCoordinate.cs:107`, `JanusMooCmix.cs:142`. A code-point comparer fixes all of them. | `GridSampler_AstralCharacterNames_EnumerateGridLikePython`, `TrialsDataframe_AstralCharacterNames_SortByCodePointLikePython` | open | | QA-44 | NIT | `plot_parallel_coordinate` labels, CLI tables | Python's `len()` and slicing count code points; the ports count UTF-16 units. `TruncateLabel` (`ParallelCoordinate.cs:364`, `label.Length < 20 ? label : label.Substring(0, 17) + "..."`) shortens a name of ten U+1F600 characters (10 code points, kept whole by Optuna) to eight emoji, a lone high surrogate and `...` — not valid UTF-16. The CLI table (`OutputFormat.cs:298/309/336`, `Length` / `PadLeft` / `PadRight`) widens a column by one per character above U+FFFF: Optuna's `params` column for `{'c😀': '😀😀'}` is 12 wide, the port's 15. | `ParallelCoordinate_AstralCharacterLabel_TruncatedByCodePointLikePython`, `TrialsTable_AstralCharacters_ColumnWidthsCountCodePointsLikePython` (CLI tests) | open | | QA-45 | LOW | Plotly satellite tick text (`PlotlyColors.FormatG`, `QuantileSorted`; rank and parallel-coordinate plots) | The hand-written Python `%g` takes the exponent from `floor(log10(|x|))` before rounding, so a value that rounds up to the next power of ten is wrong: `.3g` of `999.95` prints `1000` (Optuna `1e+03`, a parallel-coordinate tick for an axis spanning `[0, 999.95]`), `999999.5` prints `10e+05` (Optuna `1e+06`), `9.99995e-05` prints `10e-05` (Optuna `0.0001`), the subnormal `5e-324` prints `Infinitye-324` (1,201 of 3,023 sampled values at precision 3, 6 at precision 6); the mantissa is computed as `x / 10^exp`, so a value just below a rounding tie can round the wrong way (`6.87e-07` printed `6.88e-07`, D90). The rank colorbar formats with default `g` where Optuna writes `{v:3g}` (minimum width 3), so integer objectives lose their padding (`min. (1)` vs `min. ( 1)`). `QuantileSorted` uses `a + t·(b − a)` where numpy uses `b − (b − a)·(1 − t)` for `t >= 0.5` (1 ULP in 85 of 2,500; with `+inf` objective values numpy's form gives `inf − inf = nan`, so the colorbar shows `75% (nan)` in Optuna and `75% (inf)` here). | `PlotRank_ColorbarTickText_PadsToWidthThreeLikePython`, `PlotParallelCoordinate_TickRoundingToPowerOfTen_FormatsLikePythonG` | open | | QA-46 | NIT | Plotly satellite `plot_slice` | Optuna's `_generate_slice_subplot` appends only `x` / `y` for an infeasible trial, never its trial number, and `_get_categorical_plot_values` zips `(x, y, trial_numbers)`, so on a categorical parameter's subplot the infeasible list is empty and the `Infeasible Trial` trace is skipped — Optuna never draws infeasible trials there (numerical subplots are fine). The port draws them, one extra trace per categorical subplot with infeasible trials. An Optuna defect: copying it or marking the port's behaviour `[Misaligned]` is the owner's choice (the test states Optuna's output). | `PlotSlice_InfeasibleCategoricalTrials_OmittedLikeOptuna` | **fixed 2026-11-06** (owner: copy Optuna): `SlicePlotRenderer` keeps the infeasible trial numbers empty and iterates like `zip`, so a categorical subplot omits its infeasible trials as plotly.py's figure does; the test passes without `[OpenBugs]` | | QA-47 | NIT | Plotly satellite subplot grids (`plot_contour`, `plot_rank` with 3+ parameters) | plotly.py's `make_subplots` puts the bottom row at exactly `0.0` (`yaxis13.domain = [0.0, 0.19375]` for a 4×4 grid); the port's `SubplotGrid` leaves `8.326672684688674e-17` (5×5: `2.8e-17`, `5.6e-17`; 3×3 grids too, `yaxis7`–`yaxis9`, D90). Invisible when rendered, but the figure JSON no longer equals plotly.py's. | `PlotContour_FourParameterGrid_BottomRowDomainStartsAtZeroLikePlotly` | open | -| QA-48 | LOW | TPESampler deprecated `weights` / `prior_weight` / `gamma` arguments | Four gaps, all reachable only through arguments deprecated since v4.9.0: (a) the `weights` validation errors print the rejected array as `[0.5 -0.25]` / `[0.0]`, Optuna as NumPy's `[ 0.5 -0.25]` / `[0.]` (`ParzenEstimator.CallWeightsFunc` calls its format "approximate" in a comment, no `[Misaligned]`); (b) a `weights` function returning fewer values than observations is accepted and the prior kernel silently drops out of the mixture — Optuna fails the trial with NumPy's broadcasting `ValueError`; (c) a NaN or inf `prior_weight` (only `< 0` is rejected) throws `IndexOutOfRangeException` from the port's hand-written `choice` (`ProbabilityDistributions.Choice` skips NumPy's `p` validation), where Optuna raises `ValueError: probabilities contain NaN` — so `optimize(catch: ValueError)` no longer catches it; (d) a single-objective `gamma` returning a negative count: Python slices (`sorted[:-1]` keeps all but the worst trial below), the port's `Take(-1)` keeps none (`TpeTrialSplit.SplitCompleteTrialsSingleObjective`), so the TPE trajectory differs from the first TPE trial (the multi-objective case is QA-16). | `Tpe_InvalidWeights_MessagePrintsArrayLikeNumpy`, `Tpe_ShortWeights_RaisesLikeNumpyBroadcast`, `Tpe_NaNPriorWeight_RaisesProbabilitiesContainNaNLikeNumpy`, `Tpe_NegativeGammaSingleObjective_SplitsWithPythonSliceSemantics` | open | -| QA-49 | LOW | GP search space (`GPSampler`, the GP terminator evaluators) | `get_choices_of_discrete_params` takes NumPy's `np.arange(low, high + step / 2, step)`, whose elements are `low + i * ((low + step) - low)`; `GpSearchSpace.Arange` computes `low + i * step`, so a stepped float's normalized grid differs in the last bits whenever `(low + step) - low != step` (9,641 of 20,000 random ranges; `FloatDistribution(0.1, 1.0, step=0.3)`: last grid point `0.8750000000000002` vs `0.8749999999999999`). `_get_unnormalized_param` only clips floats, so the grid value is what the user gets: GPSampler (seed 0) suggests `1.0` in Optuna and `0.9999999999999998` in the port. The CMA-ES port (`CmaWm`) already uses NumPy's actual step. | `GpSearchSpace_SteppedFloatGrid_UsesNumpyArangeStep`, `GpSampler_SteppedFloat_SuggestsNumpyGridValues` | open | -| QA-50 | NIT | `Study.enqueue_trial(skip_if_exists=True)` | `_should_skip_enqueue` uses `np.isclose(new, existing, atol=0.0, equal_nan=True)`, which compares non-finite pairs with `==`; the port's `ShouldSkipEnqueue` applies `abs(a - b) <= 1e-5 * abs(b)` to them. `inf - inf` is NaN, so a repeated `inf` is enqueued twice; `abs(x - inf) = inf <= 1e-5 * inf` holds for every `x`, so `-inf` or any finite value enqueued over a trial whose parameter is `inf` is silently skipped (Optuna: 1, 2, 2 trials; port: 2, 1, 1). | `EnqueueTrial_SkipIfExists_ComparesInfinitiesLikeNumpyIsclose` | open — partly known (catalog Open item 20, 2026-10-26 review LOW list: `isclose(inf, inf)`; that item's NaN half is outdated for 5.0, which passes `equal_nan=True`); new here: a finite or `-inf` value over an `inf` trial is dropped | +| QA-48 | LOW | TPESampler deprecated `weights` / `prior_weight` / `gamma` arguments | Four gaps, all reachable only through arguments deprecated since v4.9.0: (a) the `weights` validation errors print the rejected array as `[0.5 -0.25]` / `[0.0]`, Optuna as NumPy's `[ 0.5 -0.25]` / `[0.]` (`ParzenEstimator.CallWeightsFunc` calls its format "approximate" in a comment, no `[Misaligned]`); (b) a `weights` function returning fewer values than observations is accepted and the prior kernel silently drops out of the mixture — Optuna fails the trial with NumPy's broadcasting `ValueError`; (c) a NaN or inf `prior_weight` (only `< 0` is rejected) throws `IndexOutOfRangeException` from the port's hand-written `choice` (`ProbabilityDistributions.Choice` skips NumPy's `p` validation), where Optuna raises `ValueError: probabilities contain NaN` — so `optimize(catch: ValueError)` no longer catches it; (d) a single-objective `gamma` returning a negative count: Python slices (`sorted[:-1]` keeps all but the worst trial below), the port's `Take(-1)` keeps none (`TpeTrialSplit.SplitCompleteTrialsSingleObjective`), so the TPE trajectory differs from the first TPE trial (the multi-objective case is QA-16). | `Tpe_InvalidWeights_MessagePrintsArrayLikeNumpy`, `Tpe_ShortWeights_RaisesLikeNumpyBroadcast`, `Tpe_NaNPriorWeight_RaisesProbabilitiesContainNaNLikeNumpy`, `Tpe_NegativeGammaSingleObjective_SplitsWithPythonSliceSemantics` | (a) **fixed 2026-11-11** (`8a7e19e`): the messages print the array with NumSharp's `NDArray.ToString()`, a port of NumPy's `str(ndarray)`; (b), (c), (d) open | +| QA-49 | LOW | GP search space (`GPSampler`, the GP terminator evaluators) | `get_choices_of_discrete_params` takes NumPy's `np.arange(low, high + step / 2, step)`, whose elements are `low + i * ((low + step) - low)`; `GpSearchSpace.Arange` computes `low + i * step`, so a stepped float's normalized grid differs in the last bits whenever `(low + step) - low != step` (9,641 of 20,000 random ranges; `FloatDistribution(0.1, 1.0, step=0.3)`: last grid point `0.8750000000000002` vs `0.8749999999999999`). `_get_unnormalized_param` only clips floats, so the grid value is what the user gets: GPSampler (seed 0) suggests `1.0` in Optuna and `0.9999999999999998` in the port. The CMA-ES port (`CmaWm`) already uses NumPy's actual step. | `GpSearchSpace_SteppedFloatGrid_UsesNumpyArangeStep`, `GpSampler_SteppedFloat_SuggestsNumpyGridValues` | **fixed 2026-11-11** (`8a7e19e`): `GpSearchSpace.Arange` is NumSharp's `np.arange` (both GP search-space copies); while there, `_round_one_normalized_param`'s `//` became NumSharp's `NDDivision.FloorDivDouble` (QA-87). Both tests pass without `[OpenBugs]` | +| QA-50 | NIT | `Study.enqueue_trial(skip_if_exists=True)` | `_should_skip_enqueue` uses `np.isclose(new, existing, atol=0.0, equal_nan=True)`, which compares non-finite pairs with `==`; the port's `ShouldSkipEnqueue` applies `abs(a - b) <= 1e-5 * abs(b)` to them. `inf - inf` is NaN, so a repeated `inf` is enqueued twice; `abs(x - inf) = inf <= 1e-5 * inf` holds for every `x`, so `-inf` or any finite value enqueued over a trial whose parameter is `inf` is silently skipped (Optuna: 1, 2, 2 trials; port: 2, 1, 1). | `EnqueueTrial_SkipIfExists_ComparesInfinitiesLikeNumpyIsclose` | **fixed 2026-11-11** (`8a7e19e`): `MathUtil.IsClose` is NumPy's whole `isclose` formula (`isfinite(b)`, `a == b`, `equal_nan`), checked against NumPy and NumSharp's `np.isclose` (9 µs per scalar call, so not called per comparison); the test passes without `[OpenBugs]` | | QA-51 | NIT | `create_study` direction validation | `_create_study` formats the rejected directions with an f-string, so each enum member appears as its `repr`: `but got [<StudyDirection.MINIMIZE: 1>, <StudyDirection.NOT_SET: 0>].`; `Optuna.CreateStudy` joins `"StudyDirection." + PythonName()`, giving `[StudyDirection.MINIMIZE, StudyDirection.NOT_SET]`. | `CreateStudy_NotSetDirection_MessageListsEnumReprsLikePython` | open | | QA-52 | LOW | CPython builtin `sum()` ports (`get_param_importances` normalization, NSGA-II constraint violations / penalties, TPE infeasible-trial score) | Since 3.12, `sum()` over plain Python floats is Neumaier-compensated; the port adds left to right (`ImportanceFunctions.GetParamImportances`, `NsgaiiConstraintsEvaluation.ConstrainedDominates` / `EvaluatePenalty`, `TpeTrialSplit.GetInfeasibleTrialScore`). Default `get_param_importances` (PED-ANOVA returns plain floats) is off by an ULP in ~1/3 of studies even when the raw importances are bit-identical (22 of 60 categorical-only studies); `0.1 + 0.2 + 0.3` gives `0.6000000000000001` instead of `0.6`, so a trial violating by `0.6` constrained-dominates one violating by `0.1, 0.2, 0.3` (a tie in Optuna) and their penalties differ. fANOVA / MDI normalization is right (their `np.float64` values keep CPython on the sequential loop). | `PedAnova_NormalizedImportances_SumLikeCPythonBuiltinSum` (M7's repro; the constraint test is QA-23's) | withdrawn — duplicate: the constraint sums are QA-23 (found earlier in this run) and the importance normalization is known catalog M7 (Open item 20); kept only as M7's executable repro | -| QA-53 | NIT | GPSampler, all-NaN acquisition (`OptimMixed` discrete line search) | When every acquisition value is NaN (objective values near the float maximum overflow `_standardize_values`: `1.7e308, 1.7e308, -1.7e308`), Optuna's `_discrete_line_search` gives scipy's Brent the bracket `(inf, NaN, inf)` and the suggestion fails with `ValueError: Bracketing values (xa, xb, xc) do not fulfill this requirement: (f(xb) < f(xa)) and (f(xb) < f(xc))` (an `IntDistribution(0, 20)`, 21 grid points); the port returns `16`. `BrentMinimizer.MinimizeScalar` has the same check, so the NaN takes another path before it — root cause not located. Float parameters agree. | `GpSampler_AllNaNAcquisition_IntLineSearchRaisesBracketErrorLikeScipy` | open | -| QA-54 | NIT | `np.linspace` port (`MathUtil.Linspace`: `plot_edf` grid, parallel-coordinate ticks) | NumPy's `linspace` switches to `(arange(num) / div) * delta + start` when `delta / div` underflows to zero (gh-5437); the port always computes `i * step + start`, so over a subnormal range every point but the last collapses onto `start`. Objective values `0.0` and `5e-324`: Optuna's EDF grid is `5e-324` from point 50 on and the curve reaches 1.0 there; the port's grid is `0.0` up to point 98 and its curve stays at 0.5. Ticks over `[0, 1e-323]`: `[0, 0, 5e-324, 1e-323, 1e-323]` vs `[0, 0, 0, 0, 1e-323]`. Exotic input. | `Edf_SubnormalValueRange_GridFollowsNumpyLinspace` | open | -| QA-55 | NIT | `GridSampler` with an empty value list | Optuna accepts `{"x": []}` and fails the first trial in `rng.choice([])` with NumPy's `ValueError: 'a' cannot be empty unless no samples are taken`; `GridSampler.SampleRelative` replaces `choice` with `target_grids[randint(0, len)]` (the same stream for non-empty lists) and fails with NumSharp's `ValueError: low >= high`. | `GridSampler_EmptyValueList_FailsWithNumpyChoiceMessage` | open | +| QA-53 | NIT | GPSampler, all-NaN acquisition (`OptimMixed` discrete line search) | When every acquisition value is NaN (objective values near the float maximum overflow `_standardize_values`: `1.7e308, 1.7e308, -1.7e308`), Optuna's `_discrete_line_search` gives scipy's Brent the bracket `(inf, NaN, inf)` and the suggestion fails with `ValueError: Bracketing values (xa, xb, xc) do not fulfill this requirement: (f(xb) < f(xa)) and (f(xb) < f(xc))` (an `IntDistribution(0, 20)`, 21 grid points); the port returns `16`. `BrentMinimizer.MinimizeScalar` has the same check, so the NaN takes another path before it. Root cause (located 2026-11-11 by run 2, E12 in `PARITY_QA_2026-11-10.md`): the LogEI threshold `standardized_score_vals[:, 0].max()` is NaN in NumPy, but `GPSampler.ColumnMax` skips NaNs and returns `-inf`, so the port's acquisition stays finite; Optuna patched to pass `-inf` returns the port's `16`. Float parameters agree. | `GpSampler_AllNaNAcquisition_IntLineSearchRaisesBracketErrorLikeScipy` | **fixed 2026-11-11** (`8a7e19e`): `GPSampler.ColumnMax` is NumSharp's NaN-propagating `np.amax`; the test passes without `[OpenBugs]` | +| QA-54 | NIT | `np.linspace` port (`MathUtil.Linspace`: `plot_edf` grid, parallel-coordinate ticks) | NumPy's `linspace` switches to `(arange(num) / div) * delta + start` when `delta / div` underflows to zero (gh-5437); the port always computes `i * step + start`, so over a subnormal range every point but the last collapses onto `start`. Objective values `0.0` and `5e-324`: Optuna's EDF grid is `5e-324` from point 50 on and the curve reaches 1.0 there; the port's grid is `0.0` up to point 98 and its curve stays at 0.5. Ticks over `[0, 1e-323]`: `[0, 0, 5e-324, 1e-323, 1e-323]` vs `[0, 0, 0, 0, 1e-323]`. Exotic input. | `Edf_SubnormalValueRange_GridFollowsNumpyLinspace` | **fixed 2026-11-11** (`156ce8a`): `MathUtil.Linspace` calls NumSharp's `np.linspace`, which ports NumPy's zero-step (gh-5437) branch; the test passes without `[OpenBugs]` (TPE's private ramp copy cannot underflow and stays) | +| QA-55 | NIT | `GridSampler` with an empty value list | Optuna accepts `{"x": []}` and fails the first trial in `rng.choice([])` with NumPy's `ValueError: 'a' cannot be empty unless no samples are taken`; `GridSampler.SampleRelative` replaces `choice` with `target_grids[randint(0, len)]` (the same stream for non-empty lists) and fails with NumSharp's `ValueError: low >= high`. | `GridSampler_EmptyValueList_FailsWithNumpyChoiceMessage` | **fixed 2026-11-11** (`8a7e19e`): `GridSampler` calls NumSharp's legacy `RandomState.choice(target_grids)` (same stream, NumPy's empty-list error); the test passes without `[OpenBugs]` | ## Directions queue @@ -772,4 +773,4 @@ no OptunaSharp test; they belong in NumSharp (`refs/NumSharp`, `src/NumSharp.Cor | # | Question | Blocks | |---|----------|--------| | Q2 | QA-25: Optuna calls the module-level `mimetypes.guess_type`, which also reads platform files (on Windows the registry: `.csv` → `application/vnd.ms-excel`, `.zip` → `application/x-zip-compressed`; on Linux `/etc/mime.types`). Should the port follow CPython's built-in table only (platform-independent), or emulate the per-platform lookup? | answered 2026-11-06: the built-in table; QA-25 fixed | -| Q1 | QA-3: Python's decimal context raises `InvalidOperation` for stepped ranges whose quotient needs more than 28 digits (`FloatDistribution(0, 1e20, step=1e-09)`). Should the port copy that limitation (and which exception type), or keep accepting such ranges as a documented `[Misaligned]`? | the fix of QA-3 only | +| Q1 | QA-3: Python's decimal context raises `InvalidOperation` for stepped ranges whose quotient needs more than 28 digits (`FloatDistribution(0, 1e20, step=1e-09)`). Should the port copy that limitation (and which exception type), or keep accepting such ranges as a documented `[Misaligned]`? | answered 2026-11-12 (asked with QA-62 of the 2026-11-10 run): keep .NET `decimal`; QA-3's repros become `[Misaligned]` tests and the distribution docs describe the rounding | diff --git a/docs/qa/PARITY_QA_2026-11-10.md b/docs/qa/PARITY_QA_2026-11-10.md new file mode 100644 index 0000000..f51b33f --- /dev/null +++ b/docs/qa/PARITY_QA_2026-11-10.md @@ -0,0 +1,904 @@ +# Parity QA journal — 8-hour manual QA run (2026-11-10 → 2026-11-11) + +**Goal:** find behavioral parity bugs between OptunaSharp (`main`) and Optuna 5.0.0, reproduce each one in a test, +and explain it. Small fixes are the owner's call: this run reports, it does not fix. + +| | | +|---|---| +| Start | 2026-11-10 21:37:56 JST (epoch 1794339476) | +| End (8 h) | 2026-11-11 05:37:56 JST (epoch 1794368276) | +| Code under test | `main` @ `dfc026f` (there is no `strings` branch; see Q3) | +| Commit range for history review | `master..main` (39 commits, `7aaff94` … `dfc026f`; `master` = `b45615d`) | +| Reference | Optuna 5.0.0 (`refs/optuna` @ `01ddd17`, installed editable), Python 3.12.12, numpy 2.4.2, scipy 1.16.3, SQLAlchemy 2.0.45, pandas 3.0.5 | +| Previous run | [`PARITY_QA_2026-11-02.md`](PARITY_QA_2026-11-02.md) (QA-1 … QA-55, directions D1 … D117). Findings there are not re-reported; this run numbers its findings from QA-56 and its directions from E1 | +| Repro tests | `[OpenBugs]` tests (excluded from CI) that assert Optuna's observed behaviour, so they fail today and pass once the bug is fixed | + +## Summary + +**28 new findings (QA-56 … QA-83): 5 MEDIUM, 16 LOW, 7 NIT**, each with an `[OpenBugs]` repro test that fails today +(37 test methods / 38 cases: 35 in 12 `Run2*` files across 7 test projects, plus two replay cases in +`BoTorchIntegrationParityTests`; QA-70 is a scope question without a test). +None is HIGH. Nothing in `src/` was changed. + +**Added after the run:** QA-84 (LOW), found 2026-11-11 by the performance pass of plan 15 while checking NumPy's +reduction order: TPE sums a candidate's continuous log terms over the dimensions left to right, where Optuna's +`.sum(axis=-1)` is pairwise from eight dimensions on. Its `[OpenBugs]` repro is +`Run2SamplerParityBugTests.Tpe_ContinuousLogPdf_SumsTheDimensionsPairwiseLikeNumPy`. + +**Added after the run:** QA-85 (NIT), found 2026-11-11 while moving `PercentilePruner.NanPercentile` onto +NumSharp's `np.nanpercentile` (commit `156ce8a`): the median of `[0.0, -0.0, -0.0, -1.0]` is `-0.0` in NumPy and +`+0.0` in NumSharp 0.80.0 (and in the former sort-based port), an upstream NumSharp partition tie. Its `[OpenBugs]` +repro is `PrunerTests.NanPercentile_TiedSignedZeros_KeepNumpysZeroSign`; **fixed by NumSharp 0.81.0** (2026-11-14, the QB43 partition fix), and the test lost `[OpenBugs]`. + +**Added after the run (second NumSharp pass, 2026-11-11):** QA-86 … QA-89, found by a seeded many-objective / +high-dimension differential against live Optuna, an AST sweep of Optuna's float `//` / NaN-sensitive calls, a sweep of +the port's NumPy-named private helpers, and three-way probes (OptunaSharp, NumSharp, NumPy). QA-86, QA-87 and QA-88 are +fixed (`128761d`, `8a7e19e`); QA-89 (JANUS) is open. The same pass fixed QA-29's argmax half, QA-30, QA-48 (a), +QA-49, QA-50, QA-53 and QA-55 of `PARITY_QA_2026-11-02.md`, and found QA-41 / QA-42 already fixed upstream by NumSharp +0.80.0. + +- **MEDIUM** — QA-60 CMA-ES `with_margin` over a conditional / dynamic search space (Optuna raises, the port runs on); + QA-63 CLI `tell --state fail|pruned` without `--values` fails (the omitted option binds an empty array); + QA-72 / QA-73 the OptunaHub sampler and pruner bridges rebuild a shadow study per trial, so + `after_trial` never runs and system attributes are lost (PSO, MO-CMA, NSGA-II with initial trials, SPEA-II, + AutoSampler, successive halving / Hyperband pruners all diverge from native Python); QA-82 the BoTorch bridge's + multi-objective qEHVI suggestions (see "Bridges beyond OptunaHub" below). +- **Ordering** — QA-67 (study listing), QA-68 (GridSampler on CPython's small-int set order), QA-69 (gRPC proxy + returns dictionaries in upb hash order, changing QMC / BruteForce), QA-71 (SQLite / MySQL attribute reads in + index order). +- **Error paths and validation** — QA-59 (SQLite variable limit, no fallback), QA-66 (storage API messages), QA-74 + (EF Core lets `DbUpdateException` escape; SQLite with `skip_table_creation`), QA-75 (`5.0` vs `5.0.0`), QA-76 + (LightGBM messages), QA-78 (artifact download onto a directory), QA-79 (MO TPE + `study.direction`), QA-80 (cmaes' + "invalid bounds" and learning-rate assertions missing from `Cma` / `SepCma`), QA-81 (`OptunaSearchCV(nJobs: 0)`), + QA-83 (an `x0` missing a parameter fails with `KeyNotFoundException` instead of Optuna's transform assertion). +- **Bridges beyond OptunaHub** — QA-82 (MEDIUM): for an identical history the BoTorch bridge's two-objective qEHVI + suggestion differs from real optuna-integration — by 3e-9 … 1e-7 over an int and a float, and by 0.66 (a different + point) over two floats; single-objective LogEI over the same space is identical; cause not found. The PyCma bridge + is identical under cma 4.4.4 (E57). +- **Other** — QA-56 (NSGA-III niching with infinite values), QA-57 (NSGA batch redraw, Q4), QA-58 (`deepcopy=False` + aliasing), QA-61 / QA-64 / QA-65 (CLI YAML, sampler kwargs, `--log-file`), QA-62 (stepped-high rounding, Q1 + root cause), QA-70 (beyond-core samplers vs their OptunaHub namesakes, Q7), QA-77 (warnings go through logging: + hidden by `set_verbosity(ERROR)`, repeated where Python shows them once). +- **Root causes found for earlier open items:** QA-53 (GP all-NaN acquisition: `GPSampler.ColumnMax` skips NaN, + NumPy's `max` returns it, proven by patching Optuna). QA-41 and QA-42 turned out fixed in passing (their tests pass). +- **Clean (identical to Optuna)** — tens of thousands of fuzz programs over every bit-exact sampler and storage + (memory, journal, SQLite, MySQL, PostgreSQL, Redis through three clients, gRPC proxies of both languages), mixed + Python / C# fleets on one journal / SQLite file / gRPC server (CMA-ES, NSGA-II, Grid), heartbeats and stale-trial + recovery across languages, artifacts across languages, old-schema databases, the 4.0.0.dev journal asset, the + OptunaHub problem bridge, the BoTorch bridge's single-objective and analytic-EHVI paths, the PyCma bridge, + Warm-Starting CMA-ES (142 / 150, rest = QA-80 and ULP), + `create_trial` / distribution / constructor validation matrices (≈ 150 cases), use-after-finish (135 cases), + `best_trial` ties, zero / negative arguments. +- **Known classes re-found, not relisted:** TPE erf ULP and near-ties, the `[Misaligned]` argsort tie order (Optuna + 5's TPE is always multivariate, so repeated int values reach it early: E48 traced the three-objective case to it), + CMAwM ULP, QA-56 / QA-60 recurrences, BruteForce `avoid_premature_stop`, HSSP zero-contribution ties, the + `_enumerate_candidates` `lru_cache` process state, ExperimentalWarning removal, the CLI version / mysql-URL items. +- **Techniques worth reusing** (all in the scratchpad notes of the progress log): Python twin + C# probe modes on the + same JSONL programs (`gen.py` / `fuzz.py` / probe `fuzz`, `compare.py`, `first_diff.py`), native-vs-bridge runs for + every pythonnet bridge, reflection-built constructor matrices (`ctorcheck`), history rebuild + internal split check + (`split_check.py` / `splitcheck`), patching Optuna to prove a root cause, `pip --target` + `PYTHONPATH` to test a + library version without touching the environment. +- **Open questions:** Q3 (no `strings` branch), Q4 (QA-57), Q5 (QA-65), Q6 (QA-69), Q7 (QA-70). + +## Revalidation (2026-11-12) + +Every finding re-checked on `fb6cd20` (the tip of `main` on the morning of 2026-11-12, about 30 commits after the +run's `dfc026f`: plan 15 performance and the NumSharp parity passes from other sessions, which also added QA-84 … +QA-89; the same commits continue on the branch `journey1` since `main` was reset to `origin/main` at 09:09 that +morning). Two checks per finding: the +repro test still fails, for the documented reason (failure messages read from the TRX files), and Optuna 5.0.0 / +optuna-integration still behave as the test expects (Python re-run with scripts mirroring each test: +`reval_samplers.py`, `reval_core.py`, `reval_warn.py`, `reval_rdb.py`, `reval_efcore.py` on throwaway MySQL 8.0 and +PostgreSQL 16 containers, `reval_cli.py` with the real `optuna` command, `reval_lgbm.py`). + +| Findings | Repro tests on `main` | Optuna side re-run | Result | +|---|---|---|---| +| QA-56, 57, 60, 68, 79, 80, 83 | 8 fail as documented | same values / errors | confirmed | +| QA-58, 62, 66, 67, 77, 78, 81 | 8 fail as documented | same values / errors | confirmed | +| QA-59, 69, 71, 74, 75 | 9 fail (SQLite, gRPC, EF Core via Testcontainers) | same, incl. MySQL / PostgreSQL | confirmed | +| QA-61, 63, 64, 65 | 4 fail | `python -m optuna.cli` behaves as expected | confirmed | +| QA-76 | 4 fail | optuna-integration messages identical (also under a de-DE locale) | confirmed | +| QA-72, 73 | 3 fail (live: native hub sampler / pruner vs bridge) | measured in the same tests | confirmed | +| QA-82 | fail only as the first BoTorch study of a process | native standalone = native embedded | confirmed, re-characterized (row) | +| QA-70 | no test | the four OptunaHub packages exist; the headers still deny them | still accurate | + +Nothing was fixed by the later commits: all 28 findings stay open. QA-84's test (filed by another session) also failed +as documented on `fb6cd20`; that session fixed QA-84 later the same day (`465f91c`). + +**Owner decisions (2026-11-12, asked after the revalidation):** Q3 … Q7 answered (see "Questions for the owner"); run +1's Q1 (QA-3) answered together with QA-62: keep .NET `decimal`, so the QA-3 and QA-62 repros become `[Misaligned]` +tests and the distribution docs describe the rounding. Fix now, one commit per group: the four decisions (QA-57, 65, 69, +70), CMA-ES failures (QA-60, 80, 83), CLI (QA-61, 63, 64), error types and messages (QA-66, 74, 75, 76, 78, 79, 81), +orders and core edge cases (QA-56, 58, 59, 67, 68, 71, 77), the OptunaHub bridges (QA-72, 73). QA-82 deferred: its +repros stay `[OpenBugs]`. + +## Fixes (2026-11-12) + +The six groups the owner chose were fixed the same day on `journey1`, one commit per group. Each commit was gated by +its repro tests turning green and by the surrounding suites: unit tests on both TFMs, Storage with EF Core on +Testcontainers, CLI, LightGBM, interop where relevant, and the documentation gate. + +| Group | Commit | Findings | +|---|---|---| +| The four decisions | `3809bae` | QA-57 fixed (thread-aware redraw); QA-65 fixed (Optuna's empty `--log-file`); QA-69 kept `[Misaligned]` (insertion order); QA-70 fixed (headers corrected, ports kept); run 1's QA-3 and QA-62 kept `[Misaligned]` (.NET `decimal`) | +| CMA-ES failures | `1e8aba6` | QA-60, 80, 83 fixed | +| CLI | `d510728` | QA-61, 63, 64 fixed, and run 1's QA-36 with them | +| Error types and messages | `3009c4a` | QA-66, 74, 75, 76, 78, 79, 81 fixed; kept: QA-66's gRPC-proxy messages and QA-76's four-element cross-validation entries | +| Orders and core edge cases | `16a7f9e` | QA-56, 59, 67, 68, 71 fixed; QA-77 kept `[Misaligned]` (warnings stay on the logger, the owner's choice); QA-58 deferred (the owner's choice) | +| OptunaHub bridges | the commit after `16a7f9e` | QA-72, 73 fixed: a persistent shadow study per OptunaSharp study, with all five sampler hooks forwarded; 12 registry samplers and 6 pruners now give the same trials as native runs, bit for bit (`OptunaHubNativeParityTests`) | + +Of the run's 28 findings, 23 are fixed (QA-70 by correcting the documentation), 3 kept as `[Misaligned]` (QA-62, 69, +77) and 2 deferred (QA-58, QA-82). Two new oracles came with the fixes: `oracle/pyyaml_safe_dump.json` (763 PyYAML +cases, the CLI) and `oracle/cpython_order.json` (CPython 3.12's set iteration and `list.sort` with NaN). + +## How this run works + +1. Pick the next direction from the queue below and mark it **in progress**. +2. Read the Optuna source (and, for the commit review, the whole OptunaSharp commit) for the area; run Python first and + record what it does. +3. Run the same inputs through OptunaSharp (a scratch probe console that references the built Core), diff. For the + performance commits of `master..main`, which all claim "same trials", a second oracle is available: the same probe + built against `master` (a git worktree on C:), so any `master` vs `main` difference is a regression candidate, + then confirmed against Python. +4. Every confirmed difference becomes a finding (ID `QA-n`), with severity, a reproduction test and an explanation. +5. New ideas go to the queue; a direction that needs an owner decision is **paused** with its question listed under + "Questions for the owner". + +Severity: **HIGH** = wrong results/crash on a common path; **MEDIUM** = wrong results/messages on a less common path; +**LOW** = cosmetic or exotic-input divergence; **NIT** = message wording only. + +Dedupe rule (lesson of the previous run): before calling a finding new, grep the previous journal's findings table and +the catalog review notes (`K:\catalog\optunasharp\notes\release-review-2026-10-2*.md`, Open items 17–32). + +## Progress log + +- 21:38 — run started; previous journal read (findings QA-1 … QA-55, directions D1 … D117, the left-overs: D17 older + commits, QA-53's root cause, D116's SQLite half). Range `master..main` listed: 14 commits touch `src/`, 10 of them + performance work of plans 13 and 14 (CMA-ES history folding, in-place running-trial writes, shared distributions, + TPE fused kernel / O(n) widths / observation cache / categorical logs, CachedStorage views, bulk attributes, compact + finished trials, `NumPyDraws`, QMC key memo, sparse journal offsets, SQLite `UNION ALL`). + +- 21:46 — E1 A/B oracle built: one probe (`probe-src`, a JSON random-program interpreter: every parameter kind, + conditional parameters, enqueued trials, constraints via `set_constraint`, pruners with reports, planned + fail / prune / NaN / ±inf outcomes, batches of 1–5 asks told FIFO or LIFO, 1–2 objectives) built against `main` and + against `5e5ba53` (the commit before the first plan 13 change, already on NumSharp 0.80.0). 300 programs over + Random / TPE / CMA-ES / NSGA-II / NSGA-III / QMC: identical. +- 22:00 — E1 widened: 1,500 programs (20–80 trials, in-memory and compact storage), 800 TPE programs (30–120 trials, + every TPE option the generator knows), 500 CMA-ES programs (30–150 trials, separable / margin / lr_adapt / popsize / + pruned trials), 100 programs on journal files and SQLite: every output line identical between `5e5ba53` and + `main`. The plan 13/14 commits keep their "same trials" claims on these paths. +- 22:10 — Python twin interpreter (`fuzz.py`) for the same programs; first 40 programs against Optuna 5.0: Random, + CMA-ES, QMC, NSGA-II identical; TPE within tolerance except one ULP-class flip; two NSGA-III divergences, both + present in `5e5ba53` too (so not plan 13/14 regressions), both traced to the root: + - P33 → **QA-56**: NSGA-III niching sorts NaN distances (an all-infinite borderline front) differently. + - P22 → **QA-57**: shrunk (greedy program shrinker) to 2 parameters, population 6, batches of 5; MT19937 states + compared at every ask are identical up to the last trial, where an instrumented copy of the child generation + shows the plan 12 running-trial redraw (`HandedOutParams.Claim`) generating three extra children. + +- 22:15 — QA-56 confirmed broader on 400 more programs without batches (Random / CMA-ES / NSGA-II / NSGA-III / QMC, + 8–40 trials): every remaining divergence (2, both NSGA-III) has NaN niching distances in Optuna (instrumented), one + of them single-objective (two `+inf` trials in a maximized front). Batched QMC / Random / CMA-ES (300 programs) and + categorical-only TPE with batches and LIFO tells (300): identical — the QA-31 fix holds. +- 22:20 — A/B again with dynamic ranges (`suggest_*` bounds that change per trial) and up to 10 parameters: 1,000 TPE + programs (20–150 trials) and 600 mixed programs (40–200 trials) identical between `5e5ba53` and `main`; the TPE + observation cache keys columns by distribution, so this was its riskiest input. +- 22:25 — new program mode `interleave` (ask a whole batch, then evaluate and tell each trial in turn: the async + worker pattern, which exercises the per-thread `cached_all_trials` snapshot across asks and tells): 300 programs + over TPE / CMA-ES / QMC / Random. CMA-ES, QMC, Random identical (CMA-ES 2 within the documented margin ULPs); TPE 18 + structural differences, of which 17 vanish when Python's `parzen_estimator` sorts stably (the documented tie class) + and the last is MOTPE ULP drift from trial 5 (documented erf class). +- 22:30 — E5 aliasing probe (a `FrozenTrial` read with `deepcopy=False` while its trial runs, then more writes): + **QA-58** — Optuna's in-memory and journal records share the dictionaries that `Trial` updates in place. +- 22:27 — GP checked by value instead of by bits (40 programs, 6–14 trials): suggestions differ up to ~3e-3 relative + from the first GP trial on. Instrumenting both acquisition optimizers on one program: Optuna's `LogEI` at the port's + point is `-0.89593077`, at its own `-0.89593083` — the port's point is as good (better by 5e-8); the port's own + acquisition value differs by 4e-5 relative (the kernel fit's L-BFGS-B tolerance, Optuna passes `tol=1e-4`). The + documented tolerance class, not a finding. +- 22:31 — E11 WilcoxonPruner after the QA-14 fix: 3,000 random cases (1–150 steps, ties, zero differences, steps + reported out of order, steps missing from the best trial, NaN / inf, both directions, five `p_threshold`s, five + `n_startup_steps`): decisions and warning texts identical in all 3,000. +- 22:33 — new technique, message inventory: every literal message of a `raise`, `warnings.warn`, `optuna_warn` and + logger call in Optuna 5.0 (367) searched by its longest fragments in the port's sources. 56 have no match; all but + two are argument type checks C#'s types make unreachable, the removed ExperimentalWarnings, gRPC's generated stubs, + or Python packaging notices. The two left: `RDBStorage._get_trials`' fallback for SQLite's variable limit → + **QA-59** (reproduced: 33,000 running trials below a finished one); and OptunaSearchCV's `verbose` info logs + (`Searching the best hyperparameters using {} samples...`, `Finished refitting! …`), which the port's + `OptunaSearchCV` never emits (its `verbose` field is unused) — invisible in Python unless the user configures the + `optuna_integration` logger, so noted, not listed. +- 22:36 — second message technique, near-miss templates: every Optuna message template against every C# string + template (placeholders normalized, `difflib` ratio ≥ 0.8, 349 messages): 6 near misses, none a finding — the + SuccessiveHalving ``` `min_resource` >= 1 ``` text belongs to the string branch C#'s `long?` cannot reach (the int + branch matches), QMC's `{qmc_type=}` renders the same quotes, the `load_study` `storage={}` part is the known + unlistable one, and GP's `Optimization failed: {res.message}` drops scipy's reason in the port (`Optimization + failed`), which surfaces only inside the kernel-fit fallback warning when L-BFGS-B fails — not reproduced, noted. +- 22:38 — NSGA-II / NSGA-III under `HyperbandPruner` (bracket studies filter what the GA sees, its parent cache lives in + the shared study attributes): 200 programs, identical. Grid and BruteForce added to the interpreters (grids built + from each parameter's range): Grid 119 / 119 with batches identical (3 programs raise `KeyError: 'grid_id'` in both + — an enqueued trial without a grid id; only the exception type's name differs), BruteForce 126 / 128 (the two are + `avoid_premature_stop=True` with batches, the owner's `[Misaligned]` decision). +- 22:41 — dynamic ranges against Optuna (300 programs, no batches): QMC, Random, NSGA-II identical; NSGA-III one + more QA-56; CMA-ES 11 programs where Optuna raises inside `CMAwM.tell` and the port carries on → **QA-60**. +- 22:46 — the interpreters gained `add_trial` warm starts (finished trials injected mid-run), Percentile / Threshold / + Patient / Wilcoxon pruners and a third objective. 300 programs over Random / CMA-ES / QMC / NSGA-II / NSGA-III and + 300 categorical-only TPE programs (MOTPE with 3 objectives included): all identical. E13 (D116's SQLite half): 150 + programs on SQLite and journal storages through both languages, identical. +- 22:50 — new CLI differential (`cli_fuzz.py`: random ask/tell sequences with seeded samplers and random search + spaces through `optuna` and `optunasharp` on fresh SQLite files). First runs show the YAML output changing value + types → **QA-61**. +- 22:58 — E11 continued, the QA-2 / QA-11 fix (`PyNumbers.DecimalToDouble`): 100,000 random stepped ranges (round + steps, 17-digit doubles in every decade, tiny steps) through Optuna's `FloatDistribution` and, for 5,000 of them, + `_enumerate_candidates`. The final conversion is now right, but 1,439 adjusted highs (1 ULP) and 184 candidate + grids still differ — every one an input whose repr needs more than 28 decimal places, which .NET's `decimal` + rounds on the way in → **QA-62**, the QA-3 root cause reaching ordinary tiny steps (Q1). +- 23:00 — E11, the QA-26 fix: 600 random studies (categorical choices from `None` / bools / ints / floats / strings + including the string `"None"`, missing (conditional) parameters, pruned / failed trials, single- and + multi-objective with a target) rebuilt from exact trials in both languages; `_get_parallel_coordinate_info` dumped + canonically: 600 / 600 identical. +- 23:02 — E17 CLI differential, first 14 sequences: `tell --state fail` / `--state pruned` without `--values` dies in + the port → **QA-63** (MEDIUM: the CLI's ask-and-tell workflow). The existing `CliParityTests` fixture runs exactly + these two commands but ignores their exit codes. Other differences: unseeded default samplers (expected), one TPE + ULP (erf class). +- 23:04 — E17 fixed CLI scenarios (`cli_cases.py`, 14 scenarios, 60 commands: no search space, sampler-kwargs without + a sampler, telling twice / unknown trials / with `--skip-if-finished`, multi-objective best trials, empty studies, + `--skip-if-exists`, deleting twice, study user attributes, every output format incl. `value` and `--flatten`, bad + search spaces and sampler kwargs, every `--state`). Exit codes and stdout match except: structured + `--sampler-kwargs` → **QA-64**; `tell --state complete` without values (QA-63's empty array again: "The number of + the values 0 did not match…" instead of "No values were told…"); invalid `--state` choices (argparse exit 2, the + known QA-37). Python-specific crash texts (`TypeError: … got an unexpected keyword argument`, `argument after ** must + be a mapping`, `argument of type 'int' is not iterable`) get the port's own ValueError texts — not listed; chained + exceptions print .NET's inner-exception block where Python prints a chained traceback (same final message). +- 23:06 — E14 custom NSGA strategies (`elite_population_selection_strategy`, `after_trial_strategy` incl. a pruned + trial's `values=None`): NSGA-II and NSGA-III identical. CLI global options: `OPTUNA_STORAGE` (same experimental + warning text), `-q`, `-v` match; `--log-file` → **QA-65** (Optuna's file stays empty). +- 23:14 — new technique, log-stream differential: every log record and warning of 150 programs captured in both languages (`LOGCAP=1`). After removing the known channels (Optuna's ExperimentalWarnings, which the port drops by design; NumPy RuntimeWarnings; the port's `FutureWarning:` prefix when it logs a warning), the streams match except where a program stops early: Optuna raised QA-60's ValueError in a program with a *conditional* parameter and no range change, which made QA-60 a common-path divergence (raised to MEDIUM; second scenario added to its test). +- 23:25 — E11, the QA-28 fix (importances on wide ranges): 250 random studies with int ranges up to `2**40`, log ints + up to `2**50`, stepped ints spanning `7 * 10**10`, log floats `1e-12 … 1e12`, floats `±1e15` (plain and stepped) + and categoricals, rebuilt from exact trials; PED-ANOVA / fANOVA (seed 0) / MDI (seed 0) with `normalize=False`: + fANOVA 250 / 250 bit-identical, PED-ANOVA 21 identical + 229 within 64 ULP, MDI 86 + 164 within 64 ULP (the + documented reduction-order classes), no differences. +- 23:28 — GP programs compared on structure only (exceptions, trial states; values are the L-BFGS-B tolerance class): + 80 programs with dynamic ranges, identical. +- 23:33 — new technique, pruner differential (`prune_fuzz.py` / probe `prunefuzz`): random pruner configurations with + every constructor parameter (Median / Percentile incl. `n_warmup_steps`, `interval_steps`, `n_min_trials`; + SuccessiveHalving with `min_resource` auto or fixed, `reduction_factor`, `min_early_stopping_rate`, + `bootstrap_count`; Hyperband with `max_resource` auto or fixed; Threshold; Patient around Median / Threshold / + nothing with `min_delta`; Wilcoxon with `n_startup_steps`; Nop), report scripts with gaps, offsets, shuffled and + duplicated steps, NaN / ±inf intermediate values, up to three concurrently running trials, `should_prune` before any + report, and every tell outcome, on memory / SQLite / journal. Every decision, warning (duplicate-step warnings + included), final state, value and system attribute (`completed_rung_*`, Hyperband's bracket attributes) compared: + 300 programs identical once NumPy's RuntimeWarnings and Optuna's ExperimentalWarnings are set aside. A second + batch of 400 (34,082 lines): identical. +- 23:38 — E20, fixed values: a 45-case value × distribution matrix (out-of-range, wrong-type, NaN, `None`, bool, + numeric strings, off-step, log ≤ 0, categoricals with `True == 1` and `1.0 == 1`, values not among the choices) + through `PartialFixedSampler`, `enqueue_trial`, `FixedTrial` and `create_trial` + `add_trial`. Warnings, exception + messages (`'c' not in ('a', 'b').`, `'None' is not a valid type…`, `` `0` is invalid value for the case log=True. ``) + and stored values match. Only typed-API returns differ (`suggest_float` returns Python's fixed `int` / `bool` / + `str` as given; the port returns `double`), and a fixed int beyond int64 (`1e20` for an `IntDistribution`) + saturates to `9223372036854775807` where Python keeps `100000000000000000000` — not listed (the port's + `IntDistribution` is int64 throughout). +- 23:42 — E20, `study.ask(fixed_distributions=...)` added to the program fuzz (`askfix`): 250 programs over Random, + TPE, CMA-ES, NSGA-II/III, QMC and BruteForce with interleaved batches. Differences are all known classes: NSGA + batches (QA-57; the same programs without batches are identical), a TPE near-tie (`w2=1` vs `6`, acquisition values + 16 ULP apart in Optuna itself, traced with a `_compare` hook), CMA-ES with margin's ULP class (x_for_tell 1–4 ULP + apart from generation 1, the previous run's "16 ULP from generation 1"; the program differs the same way without + `ask_fixed` and enqueues), BruteForce `avoid_premature_stop` with batches (`[Misaligned]`). +- 23:47 — new technique, Study API sequence differential (`apiseq.py` / probe `apiseq`): random sequences of + ask, tell by trial or number with every state / NaN / inf / missing / wrong-length values and `skip_if_finished`, + reports and user attributes on finished or multi-objective trials, `enqueue_trial(skip_if_exists)`, `add_trial` in + every state (WAITING and RUNNING included) with intermediate values, the four `best_*` accessors, `get_trials` by + state, `trials_dataframe` (flat and multi-index), `set_metric_names` (right and wrong lengths), study user + attributes, `stop()` outside optimize, `optimize(catch=(ValueError,))` with failing trials, `copy_study`, + `get_all_study_summaries`, `get_all_study_names`; memory / journal / SQLite, one and two objectives. 150 sequences + (6,871 lines): identical apart from exception type names (`NotImplementedError` / `NotImplementedException`). + A second batch of 600 sequences (25,640 lines): identical. +- 23:55 — NSGA-III with custom `reference_points` (1–6 random points) and `dividing_parameter` 1 / 2 / 4 added to the + fuzz (`refpts`): 200 programs, 198 identical; the other two have `-inf` objective values before they diverge and + become identical once those values are made finite — QA-56's NaN-distance class. +- 23:56 — multi-objective GPSampler (qLogEHVI / LogEHVI) with and without constraints, structure only: 60 programs + (13 constrained), identical. +- 23:58 — importances under random evaluator options (`imp_gen2.py` / probe `impcheck2`): PED-ANOVA + `target_quantile` / `region_quantile` / `evaluate_on_local` on one to three objectives (the multi-objective split + goes through HSSP), fANOVA and MDI with random `n_trees` / `max_depth` / seed, random `params` subsets, pruned and + failed trials. fANOVA 300 / 300 bit-identical, MDI 292 + 8 within 64 ULP, PED-ANOVA 50 identical + 241 within + 64 ULP; the other 9 are the same class (a few values near zero reach 68–90 ULP or a 1e-5 relative difference at + `5e-25`, cancellation) plus a tie order: PED-ANOVA collects parameter names with `list(set(...))`, so equal + importances (every all-zero result) come out in the order of a hash-randomized `set` — different from one Python + process to the next, so no port can match it. Not listed. +- 23:59 — four and five objectives (the fuzz objective gained two fixed non-linear mixes): 150 four-objective programs + (TPE, NSGA-II, NSGA-III, Random) and 120 five-objective ones (TPE, NSGA-III). NSGA-II / NSGA-III / Random 157 / + 157 identical; MOTPE (hypervolume weights through WFG, HSSP splits) 30 identical, 41 within tolerance, 5 with a + different choice — each one a tie in Optuna itself, found with a `_sample` / `_compare` hook: two candidates with + the exact same acquisition value (P106 `depth3` −5 / 25, P147 `v0` −5 / −3, Optuna takes the first) or + acquisition values that are cancellation residue around zero (`-1.1e-16` vs `-2.2e-16`, `3.3e-16` vs `-1.1e-16`). + The documented TPE tie class. +- 00:00 — dynamic categorical choices (`dyncat`: a categorical gains an extra choice on every third trial or has its + choices rotated on every fourth; Optuna's TPE maps a past trial's stored index through that trial's own + distribution, so a rotated space silently remaps old observations): 300 programs over TPE, NSGA-II / III, QMC, + CMA-ES and Random, identical (TPE within tolerance). +- 00:02 — long runs: 24 CMA-ES programs of 400–600 trials (plain, separable, `lr_adapt`, with margin; popsize 2–10) + against Optuna: 19 bit-identical to the end; the 5 that drift are all `with_margin=True` (first difference at trials + 16–36, the CMAwM ULP class). +- 00:04 — everything at once: 800 programs with `dyncat`, `askfix`, `refpts`, interleaved batches, `add_trial` + warm starts and dynamic ranges over Random, TPE, CMA-ES, NSGA-II / III, QMC and BruteForce. QMC and Random 203 / 203 + identical; every other difference sorted by its program's options: NSGA-II / III 22, all with batches (QA-57; most + also with infinite values, QA-56); CMA-ES 6, all `with_margin` with dynamic ranges (QA-60, Optuna raises); TPE 1 + (a 16-ULP near-tie traced in Optuna); BruteForce 2 (`avoid_premature_stop` with batches, `[Misaligned]`, and one + program where both raise `search_space mismatch` but Optuna's message lists the new candidates as floats, + `(0.0, 1.0, 2.0, 3.0)`: `_enumerate_candidates` is an `lru_cache`, and an earlier program in the same Python process + had called it with `(0.0, 3.0, 1.0)`, which hashes and compares equal to `(0, 3, 1)` — process state, not a port + difference). +- 00:06 — datetimes across languages (masked by every differential so far): SQLite and journal files written by each + CLI and read by both CLIs give the same `datetime_start` / `datetime_complete` (local naive time; both journals + store `+00:00` UTC strings with microseconds, as Optuna 5 does). Identical. +- 00:07 — E17 second generation (`cli_fuzz2.py`: two-objective studies, `best-trials`, `study set-user-attr`, + `studies`, `tell --skip-if-finished` and telling twice, `delete-study`, `create-study --skip-if-exists`, `--flatten` + on every read, `-f value`; QA-61 / QA-63 left out so they cannot mask anything): 40 sequences, 36 identical, 4 TPE + ULP-class asks. +- 00:09 — new technique, storage API script (`storage_api.py` / probe `storageapi`): 66 `BaseStorage` calls with valid + and invalid study / trial ids, finished trials, incompatible and dynamic distributions, templates, NaN values, on + memory / journal / SQLite. Every per-storage message matches (`No study with study_id 999 exists.`, `Record does not + exist.`, the journal's bare `KeyError: 999`, the journal still returning a deleted study's trial, SQLite's + `ValueError: Record does not exist.` for the best trial of an empty study). Differences: `get_trial_param` for a + missing parameter raises `KeyNotFoundException` where Optuna raises `KeyError`, and the storages' + `DuplicatedStudyError` carries .NET's default text where Optuna's is empty → **QA-66** (NIT). Not listed: a NaN + objective written straight into SQLite with `set_trial_state_values` — Optuna stores it as NULL and every later read + of that study fails with a bare `AssertionError` (an Optuna defect, unreachable through `Study.tell`, which turns + NaN into FAIL); the port refuses the write (`InvalidOperationException: Cannot store 'NaN' values.`). +- 00:12 — E11, the QA-24 fix (SHAP traverses float32): `ShapleyImportanceEvaluator` (optuna_integration + shap 0.52.0) + added to the importance-options differential with random `n_trees` / `max_depth` / seed: 200 studies, 175 + bit-identical and 25 within 64 ULP; the fix holds. E11 is complete. +- 00:15 — extreme objective magnitudes (`vscale`: every objective multiplied by `±1e300`, `1e154`, `1e-300`, + `5e-324`, `1e-320`, `-0.0` or `DBL_MAX`): 400 programs over Random, TPE, CMA-ES, NSGA-II / III and QMC. Random, + QMC, NSGA-II and CMA-ES identical (one CMA-ES within tolerance); TPE 2 near-ties (4 ULP; `1.1e-16` vs `0` + cancellation residue); NSGA-III 7, all at the `DBL_MAX` scale, where values overflow — an instrumented + `_preserve_niche_individuals` shows NaN niche distances in every one of them (QA-56: besides fronts that are + entirely infinite, finite values large enough that `_filter_inf`'s `nadir + interval` overflows produce the same + NaN distances). +- 00:18 — pruners under huge and subnormal intermediate values (`±1.7e308`, `±1e308`, `8.9e307`, `5e-324`, `-0.0` + mixed into the report scripts, where NumPy's `nanpercentile` interpolation can overflow): 400 programs, 34,309 + lines, identical. GP with `vscale` (structure): 60 programs, identical. +- 00:20 — extreme parameter ranges (`xrange`: floats over `±1e308`, `±DBL_MAX`, log `[5e-324, 1.7e308]`, subnormal + intervals, a `1e307` step; ints over `±2**62`, `[0, 2**63 - 1]`, `[-2**63, 2**63 - 1]`, log `[1, 2**62]`, + `2**60` steps), 300 random programs plus 160 one-parameter programs (16 ranges × 5 samplers × 2 seeds). Everything + that differs is already on record, so nothing new is listed: int spans of `2**63` or more always give `low` + (release review 2026-10-26 item 19c, `IntDistribution.Single()` computes `High - Low` in 64 bits; QA-4 and QA-27 are + the same overflow in the stepped-high adjustment and the untransform); TPE over `[0, 2**53]` or a log + `[1, 2**62]` meets NaN acquisition values (`x ± 0.5` is one double above `2**52`, so both mixtures give zero mass) + and Optuna's `argmax` returns the first NaN while the port skips it (QA-29); float spans that overflow raise + `OverflowError: Range exceeds valid bounds` in both. That last one was QA-41: the port sampled such ranges until + plan 14 step A (`adda96c`) moved the draw to `NumPyDraws.Uniform`, which checks the span as NumPy does — + **QA-41's `[OpenBugs]` test now passes on net10.0 and net8.0**, so its attribute can go (owner's call; not changed + here). +- 00:30 — new technique, OpenBugs sweep: every `[OpenBugs]` test run on purpose, to find bugs fixed in passing whose + tests CI no longer runs. `OptunaSharp.Tests`: 62 tests, 3 pass — QA-41's and both of **QA-42**'s + (`RandInt_SingleValueRange_DrawsNothingLikeNumpy`, `NsgaII_PopulationOfTwo_SecondParentDrawLeavesStreamLikeOptuna`): + NumSharp's size-1 `randint` / `choice` no longer consume a word (the NumSharp 0.80.0 bump `2048b98` or plan 14's + `NumPyDraws`). Confirmed by the fuzz: 200 NSGA-II / NSGA-III programs with populations of 2–4 (SPX included) are + identical to Optuna with and without the `QA42` emulation this run had been using (the 3 that differ have + infinite values, QA-56). `OptunaSharp.Tests.Cli` (8) and `OptunaSharp.Tests.Storage` (3): all still fail as + expected. QA-41 and QA-42 can be marked fixed and their attributes removed (owner's call). +- 00:32 — the deprecated `constraints_func` mixed with `Trial.set_constraint` in one trial (Optuna 5 reads the old + list format as keys `"0"`, `"1"` and then the new `constraints:<key>` attributes, warning `Overwrite an old format + constraint.` when `set_constraint("0", …)` collides): NSGA-II, NSGA-III, TPE and Random, one and two objectives, + 24 trials each. Constraints dictionaries (order included), system attributes, best trials and warnings + identical; TPE values within its ULP class. +- 00:34 — CMA-ES `x0` added to the fuzz (an in-range start for every numeric parameter, ints as ints, stepped values on + the grid, log values geometric; extra keys for conditional and single-valued parameters): 200 programs, 194 + identical, 5 within tolerance, 1 is QA-60 (Optuna's `CMAwM.tell` broadcast error after a conditional parameter + leaves the search space). +- 00:35 — CLI with special values (`tell --values inf 1`, `-inf 2`, `1e308 -inf`, `nan 1`, `0.5 inf` on a + two-objective study): only known items — `inf` is rejected by the port's `Option<double[]>` (QA-35), and the + failing parse prints the command help to stdout and exits 1 where argparse prints a usage error and exits 2 (QA-37; + argparse itself rejects `-inf` as an option-like token). `nan` turns the trial into FAIL in both. +- 00:36 — long runs of the bit-exact samplers (30 programs of 300–500 trials, populations 2–10): NSGA-II 11 / 11, QMC + 5 / 5 and Random 6 / 6 bit-identical to the end; NSGA-III 3 / 8, the other 5 split at trials 91–292, each after an + instrumented `_preserve_niche_individuals` sees NaN distances from an infinite-valued elite population (QA-56). + So QA-56 is not rare in long runs: with about 5% infinite objective values and small populations it hit 5 of 8. +- 00:37 — new technique, the probe built for net8.0 (every earlier sweep ran net10.0): 300 programs with dynamic + categoricals, `ask(fixed_distributions)`, `add_trial` warm starts and dynamic ranges over every bit-exact sampler. + net8.0 and net10.0 outputs are byte-identical, and against Optuna the same known classes appear (CMA-ES with margin + QA-60, one TPE near-tie). No runtime-specific math (`Math.Exp`/`Log`/`Pow`, casts) shows up on these paths. +- 00:38 — CLI differential on journal files (`cli_fuzz2j.py`: the second-generation sequences with `--storage-class + JournalFileBackend`): 24 sequences, 23 identical, 1 TPE ULP ask. Negative seeds (`seed=-1`) for Random, TPE, + NSGA-II, CMA-ES, QMC, GP, BruteForce and Grid: the same `ValueError: Seed must be between 0 and 2**32 - 1` in both. +- 00:41 — GP on categorical-only spaces compared by value (not just structure): 60 programs, 57 bit-identical to + Optuna; the 3 others take a different but equivalent candidate — for P29 Optuna's own acquisition at the port's + point is `-7.827772217736928` against `-7.82777221768108` at its own (7e-12 relative), a tie broken by GP-fit noise. +- 00:42 — E10 at last, a mixed fleet: 3 Python and 3 C# workers optimizing one study at the same time on one journal + file (each side with `JournalFileOpenLock`, the lock the port also falls back to on Windows), 40 trials each, with + reports and user attributes. 240 trials, numbers contiguous, all COMPLETE, 40 per worker, the same study read back + by both languages (same best value). The same on one SQLite file (2 + 2 workers, 30 trials each after a warm-up + trial): 121 trials, contiguous, all COMPLETE. High-dimensional CMA-ES (20 / 50 / 100 dimensions, plain / separable / + `lr_adapt`, 250–300 trials; the eigendecomposition path through OpenBLAS): 18 / 18 bit-identical to Optuna. +- 00:44 — new technique, a static sweep for .NET-collection semantics that differ from Python's: every unstable + `Array.Sort` / `List.Sort` in Optuna-ported code (unique keys, tie-insensitive outputs, or a documented class — + nothing new), then every `Dictionary` that has entries removed and is later enumerated. Python's `dict` appends a + key inserted after a deletion; .NET's `Dictionary` puts it into the freed slot. Both study containers do this + (`InMemoryStorage._studies`, `JournalStorageReplayResult._studies`): create `a, b, c`, delete `b`, create `d`, delete + `a`, create `e, f` lists `[e, d, c, f]` where Optuna lists `['c', 'd', 'e', 'f']` (SQLite orders by id in both), + and the CLI's `studies` on a journal file prints `a, d, c` where `optuna` prints `a, c, d` → **QA-67**. + The same sweep for Python `set` iteration that leaks into results: PED-ANOVA's `list(set(names))` (hash-randomized, noted + above) and GridSampler's `list(set(range(n)) - visited - running)`, whose small-int order the port replaces with + ascending order under a `[Misaligned]` comment that assumes only concurrency reaches it; a study with 12 added trials + and a 16-point grid parts at the 13th grid trial single-threaded → **QA-68**. +- 00:52 — the sweep's other Python-vs-.NET semantics, checked and clean: tie resolution of `best_trial` / `best_value` + (Python's `min` / `max` keep the first of equal values; ties at `0.5`, `2.0`, `±inf`, `0.0` vs `-0.0`, on memory, + journal and SQLite, including SQLite turning a best `-0.0` into `0.0`): identical; `%` on possibly negative + operands (C# keeps the dividend's sign, Python the divisor's) appears only on non-negative operands in ported code + (`IntDistribution` membership, Hyperband's CRC-32 bracket, grid sizes); no stdlib `random` or clock-dependent + logic in Optuna's samplers to mirror. The `[Misaligned]` notes in Core were re-read for premises like QA-68's: + HSSP zero-contribution ties, erf / ucrt, argsort ties, the parallel-coordinate draw order and the journal snapshot + format all state their scope accurately. +- 00:58 — samplers under HyperbandPruner's bracket studies (`_filter_study` hands each sampler only its bracket's + trials): 240 programs over TPE, CMA-ES, QMC, Random and BruteForce, identical (TPE within tolerance). CLI YAML with + YAML-hostile categorical strings (`"null"`, `"yes"`, `"a: b"`, `"#h"`, `"~"`, `""`, `"1e3"`, `"é ü"`) and a + `"k: v"` study attribute key: after QA-61's quote style and datetime quoting are set aside, the documents match. + CLI `ask` with the five legacy distribution names (`UniformDistribution`, `LogUniformDistribution`, + `DiscreteUniformDistribution`, `IntUniformDistribution`, `IntLogUniformDistribution`): same values and the same + deprecation and conversion warnings. +- 01:00 — categoricals with Python-equal duplicate choices (`[1, True]`, `[0, False]`, `[2, 2.0]` side by side, which + `CategoricalDistribution` accepts and resolves by first match): 300 categorical-only programs over TPE, Random, + NSGA-II / III, QMC and BruteForce, 94 of them with such duplicates — identical. CLI JSON arguments (`cli_json.py`): + duplicate keys, `Infinity` / `NaN` literals, `\u` escapes, ints for float bounds and floats for int bounds, padded + JSON, float / string / duplicated seeds, unknown kwargs — identical; differences only for a `1e20` int bound (the + port's `IntDistribution` is int64 and samples within its own range; known limitation), `{"seed": true}` (Python's + bool is an int, `RandomState(True)` seeds 1; the port's kwargs binder refuses it — QA-64's binder, not listed + separately) and `{"seed": null}` (unseeded in both, so naturally different). +- 01:03 — `storage upgrade` through both CLIs on copies of Optuna's ten upgrade-test databases (0.9.0 … 3.2.0), each + result dumped: same tables and indexes, same columns (type, nullability, default, key), same foreign keys, same + rows (`version_info.library_version` aside, which the port fills with its own version by design). Only the DDL text + in `sqlite_master` differs — the port quotes identifiers and lists `UNIQUE` before `FOREIGN KEY` in rebuilt tables — + which SQLite and SQLAlchemy read the same. A trial whose datetimes have zero microseconds prints the same in both + CLIs (`2026-11-11 00:05:53`, duration `0:00:01`). +- 01:06 — re-check of the QA-25 fix (`upload_artifact`'s MIME guess is CPython 3.12's built-in table): 20,000 random + names and URLs (every built-in type, suffix and encoding extension, case variants, stacked suffixes, dotted + directories, query strings and fragments, `http` / `s3` / `file` / `rtsps` / `data:` URLs, one-letter schemes) + against `mimetypes.MimeTypes().guess_type(name, strict=True)`: 19,983 identical. The 17 others are one-letter + "schemes" followed by dots (`x:...shar`): CPython 3.12.12 treats a one-letter scheme as a drive and strips it with + `os.path.splitdrive`, which is `ntpath` on Windows and `posixpath` elsewhere, so `x:...shar` is `(None, None)` on + Windows and `application/x-shar` on Linux; the port answers like Linux. Platform-dependent CPython behaviour on a + contrived input; not listed. +- 01:08 — re-check of the QA-46 fix (plot_slice omits infeasible categorical trials like Optuna): 500 random studies + with constraints (feasible, infeasible, missing), categorical choices from `None` / bools / ints / floats / + strings including `"None"`, missing parameters, infinite values, pruned and failed trials, rebuilt from exact + trials; `_get_slice_plot_info` dumped canonically (x, y, trial numbers, log / numerical flags, constraint flags, x + labels): 500 / 500 identical. +- 01:10 — D17 (the previous run's commit review) continued with the storage-URL commits `a9fcc99` / `f39763d`: a URL + fuzz (`url_gen.py` / probe `urlcheck`) of 5,000 SQLAlchemy URLs — schemes with drivers, odd casing and stray `+`, + credentials with escapes and `@` / `:` / `#` / `?`, IPv6 hosts with zone ids, ports from `0` to beyond 16 bits and + non-numeric, sqlite paths of every shape (`:memory:`, `file:` URIs, Windows drives, `////`), repeated and escaped + query keys — against SQLAlchemy 2.0.45's `make_url`: 2,683 parsed and 2,317 rejected, every component and every + error message identical. +- 01:28 — E31 the gRPC storage proxy, which neither run had driven with the random harnesses. (1) The 64-call + storage script (E26) through all four client/server language pairs (`sa_grpc.py`, probe `storageapi` with + `SA_KINDS=grpc` / `grpcr:PORT`, probe `grpcserve`): a Python client gets identical results from the C# server and + from the Python server; the C# client differs only in messages — Optuna's client raises bare `KeyError()`, + `ValueError()`, `UpdateFinishedTrialError()`, `DuplicatedStudyError()` (`str(e) == ''`), the port's forwards the + server's text — appended to QA-66. (2) The random-program fuzz with a new `grpc` storage kind (one in-process + server per run, a client per program; 160 programs of six samplers, then 80 BruteForce / Grid / QMC): every + program reads its parameters back in another order in Optuna, and Optuna's own trajectory through the proxy + differs from its in-memory one in 41 of 65 QMC and 3 of 26 BruteForce programs; the port's proxy runs equal its + in-memory runs → **QA-69**: Python protobuf (upb) iterates maps in hash order, and Optuna rebuilds every + `FrozenTrial` dictionary from those maps; QMC's `dict(first_trial.distributions)` and BruteForce's tree follow + the order. Probe `grpcorder` showed the order is decided by the client (a Python client sees the same order from + either server; the C# client keeps the wire order, which from a Python server is a third order). Question **Q6**. +- 01:28 — side observation while looking for OptunaHub counterparts of the beyond-core samplers: the pinned + `refs/optunahub-registry` holds `samplers/moead` (MOEADSampler, 2024-09), `samplers/differential_evolution` + (DESampler, 2024-12), `samplers/pso` (PSOSampler, 2025-09) and `samplers/turbo` (TuRBOSampler by the Optuna team, + 2025-09), while the port's `MoeaDSampler`, `DifferentialEvolutionSampler`, `PsoSampler` and `TurboSampler` state + that no OptunaHub counterpart exists and differ from them in algorithm, parameters and defaults → **QA-70**, + question **Q7**. +- 01:34 — E12 QA-53's root cause (the previous run left it open): the GP's LogEI threshold is + `standardized_score_vals[:, 0].max()`, NaN in NumPy when the overflowed standardization makes every value NaN; the + port's `GPSampler.ColumnMax` skips NaNs (`if (v > max)` from `-inf`) and returns `-inf`, so the acquisition stays + finite and the line search never sees the NaN bracket. Proof: Optuna with `LogEI` patched to receive `-inf` for a NaN + threshold returns `16`, the port's answer. Recorded in QA-53's row (11-02 journal) and its test's remarks. Sweep of + the port's other hand-written max / argmax helpers (`ArgMax` / `ArgMaxColumn` in GP, EMMR, regret bound, + hypervolume, CMA-ES `Max` / `Min`): their inputs cannot be partly NaN (an overflowed standardization makes a whole + column NaN, where first-index `argmax` agrees), hypervolume maps `inf - inf` explicitly; TPE's is QA-29. +- 01:38 — E33 dict order through each storage (QA-69 suggested the class): a template trial whose params, + distributions, user / system attributes and intermediate values are given in different orders, plus a trial grown + in a scrambled order (out-of-order steps, attributes set twice), on memory / journal / SQLite and reloaded + (`order_check.py` / probe `ordercheck`). Memory and journal identical. SQLite: parameters, distributions (Optuna + rebuilds both in `param_id` order) and intermediate values (by step) identical, but Optuna returns study and trial + user / system attributes sorted by key — its queries have no `ORDER BY` and SQLite answers them through the unique + `(study_id, key)` / `(trial_id, key)` autoindex — while the port orders by attribute id → **QA-71**. + `get_all_studies()` scans the table, so its summaries keep insertion order on both sides. +- 01:48 — E34 the OptunaHub sampler bridge (`OptunaSharp.Interop.pythonnet`'s `OptunaHubSampler`), whose parity tests + cover only `samplers/random_search` and `pruners/median`: each hub sampler run natively (`hub_run.py`: the package + loaded from the pinned registry, seed 0, a two-float-one-int objective) and through the bridge (probe `hubrun`), + 30 trials. Identical: `differential_evolution`, `restart_cmaes`, `levy_flight_sampler`, `nelder_mead`, + `tpe_union_multivariate`. Not comparable: `grey_wolf_optimization` (its `_lazy_init` draws from the unseeded global + `np.random`, so two native runs differ — traced with a patched copy of the package), `hill_climb_search` / + `simulated_annealing` (no seed), `whale_optimization`, `catcma`, `moead`, `uniform_design` (fail natively here). + Different: `pso` from trial 11, `nsgaii_with_initial_trials` and `speaii` from trial 8 (the first generation + boundary at `population_size=8`), `implicit_natural_gradient` from trial 7, and `mocma` fails at once with + `KeyError: 'mocma:g'` → **QA-72**: the bridge never forwards `before_trial` / `after_trial` (PSO builds its swarm in + `after_trial`), and its shadow study — rebuilt per trial from `create_trial(state, values, params, + distributions)` — drops the system attributes the hub sampler writes and never carries user attributes, + intermediate values or constraints. In the pinned registry 26 samplers implement `after_trial`, 25 use system + attributes. The interop CI job filters only `Slow`, so the two `[OpenBugs]` tests report Inconclusive under + `CI=true` and reproduce locally. +- 01:52 — E35 the pruner bridge (`OptunaHubPruner`) the same way (`hub_prune.py` / probe `hubprune`: the hub package, + Optuna's `RandomSampler(seed=0)` natively and the port's bit-exact one through the bridge, 40 trials of a ten-step + objective). The registry's pruners re-export Optuna's own: `median`, `percentile`, `wilcoxon`, `threshold` agree + trial for trial; `successive_halving` prunes 36 natively and **none** through the bridge, `hyperband` 31 and none + → **QA-73**: successive halving records each passed rung in the trial's system attributes (`completed_rung_N`) and + compares with the other trials' records; the bridge's shadow study, rebuilt for every `prune` call, carries no + system attributes, so each trial competes only with itself and is always promoted. The problem bridge's + constraints already have a parity suite (`OptunaHubConstraintParityTests`). +- 01:59 — E36 MySQL 8.0 and PostgreSQL 16 (local containers; Optuna through PyMySQL / psycopg2, the port through its + EF Core storage), which the storage scripts of both runs had not reached: (1) the dict-order round trip: MySQL + returns attributes sorted by key like SQLite (QA-71 extended; intermediate values by step on both sides); on + PostgreSQL Optuna's own order is not stable (sorted on a study's first read, insertion order after `load_study`), + so no target there. (2) The 64-call storage script: identical except the known `DuplicatedStudyError` text and, on + MySQL, a NaN objective value written straight through `set_trial_state_values`: Optuna `StorageInternalError`, the + port EF Core's `DbUpdateException`. (3) The same through the public API (`rdb_limits.py` / probe `rdblimits`): a + 600-character study name, parameter name, study or trial attribute key, and on MySQL a 70,000-character attribute + value → Optuna `StorageInternalError` ("An exception is raised during the commit. …", from + `_create_scoped_session`), the port `DbUpdateException`, 9 of 9 cases → **QA-74**. No port storage throws + `StorageInternalError` at all. SQLite has no limits on either side. +- 02:13 — E36 continued: the random-program fuzz with `mysql` / `postgres` storage kinds (60 programs of Random, + CMA-ES, NSGA-II / III, QMC; one database per language): identical, including the two crossover validation errors. + The port's CLI still cannot open `mysql://` / `postgresql://` (it references no EF Core package; an unhandled + `NotSupportedException` with a stack trace, exit 1) — known since the 2026-10-18 gap audit (item 6), not relisted. + Containers removed. +- 02:18 — E37 artifacts across languages (`art_x.py` / probe `artx`): each language uploads six study- and trial-level + artifacts (a Unicode file name, no extension, a `.csv.gz`, explicit `mimetype` / `encoding`) into a journal study and + a `FileSystemArtifactStore`; each reads back both studies (`get_all_artifact_meta`, `download_artifact`, SHA-256 of + the bytes): same metadata, order and bytes in all four directions. One platform note: Python run here guesses + `data.csv.gz` as `application/vnd.ms-excel` (module-level `mimetypes` merges the Windows registry), the port + `text/csv` (CPython's built-in table, the owner's Q2 decision for QA-25), so a Windows Optuna writer and the port + differ for registry-overridden extensions — by design, not relisted. +- 02:18 — E38 the Redis journal backend (redis:7 container; Python `JournalRedisBackend`, the port's + `StackExchangeJournalRedisBackend`), untouched by both runs: 80 random programs (six samplers, a key prefix per + program) give the same trajectories as on in-memory storage in both languages, so Python vs C# shows only the + in-memory classes; the storage script shows only QA-66. The one NSGA-III difference among them (program 4: single + objective, `population_size=2`, 4 of 39 values infinite) is QA-56 (`instr_niche.py`: `dist [nan, nan]` at the + niching). A plain finite single-objective NSGA-III (10 seeds × 30 trials, `nsga3_so.py` / probe `nsga3so`) agrees + bit for bit. Container removed. +- 02:23 — E39 the OptunaHub problem bridge (`OptunaHubProblem`) the same way (`hub_problem.py` / probe `hubproblem`: + the benchmark's `Problem` as the objective of a `RandomSampler(seed=0)` study, 15 trials, params / values / + constraints in hex): `bbob` (f3, 3-D), `bbob_mixint` (f5, 5-D), `bbob_constrained` (f2, 2-D), + `multidimensional_knapsack` and `hpa` (HPA101) identical; `zdt` / `dtlz` / `wfg` need `optproblems` (not installed). + Also read: the Redis journal snapshot is kept apart by design (the port writes its own key and treats Python's + pickle as no snapshot; Optuna warns and replays when it meets a foreign snapshot), so not tested further. +- 02:27 — E40 old-schema databases opened without upgrading (`old_open.py` / probe `oldopen`, a copy of each of Optuna's ten + upgrade-test assets): with `skip_compatibility_check=True` both sides open all ten and report the same current / + head revision and studies; without it the nine pre-3.2 ones fail on both sides with the same `RuntimeError`, except + that Optuna names the runtime version `5.0.0` (`version.__version__`) and the port `5.0` + (`OptunaSharpVersion.OptunaCompatibilityTarget`, also used by the EF Core storage) → **QA-75**. (`--version` + printing `0.1.0` instead of `optuna 5.0.0` is known since the previous run.) +- 02:30 — E14 (heartbeat part) stale trials across languages (`stale.py` / probe `staleresume`): Optuna prepares a SQLite + study with `heartbeat_interval=1`, `grace_period=2` whose trials 1 and 2 start (params, a user attribute, an + intermediate value, a heartbeat) and are abandoned; after the grace period each language resumes a copy with + `RetryHeartbeatStaleTrialCallback(max_retry=2, inherit_intermediate_values=True)` and `optimize(n_trials=3)`: the + same six trials (stale ones FAIL, retries with `failed_trial` / `retry_history`, inherited intermediate values, + copied user attributes). Only Optuna's `ExperimentalWarning`s differ (removed by design, `3cf96b0`). +- 02:36 — E41 integration messages read against `refs/optuna-integration`: the LightGBM pruning callback's not-found + error interpolates each score with C#'s default `double` formatting in the current culture (`100`, `1E-05`, and + `0,5` under de-DE) where optuna-integration prints `str(env.evaluation_result_list)` (`100.0`, `1e-05`, `0.5`) → + **QA-76**; the tuner's alias warning (dict repr) and metric type error (`<class 'int'>` vs `Int64`) join it. A grep of every interpolated message in `src` for other numeric fields found integer-only fields (a + culture with a non-ASCII minus sign would still change `step=-1`, exotic) and the CMA-ES `mean` bound printed as + `1E+32` where cmaes prints `1e+32` (an assertion on `x0` beyond 1e32, exotic; noted, not relisted). +- 02:43 — E42 the other Python bridges by native-vs-bridge runs: (1) value marshalling through `OptunaHubSampler` with + the hub's `random_search` (`hub_cat.py` / probe `hubcat`, 40 trials: categoricals with `None`, `True`, `1`, `1.5`, + `"x"` and the Python-equal `False` / `0` / `0.0` / `"0"`, a stepped float, a log int, a log float): identical, + types included; (2) the BoTorch bridge against optuna-integration's `BoTorchSampler(n_startup_trials=5, seed=0)` + on a float / int / categorical objective (`bt_run.py` / probe `btrun`, 12 trials, 7 of them BoTorch candidates): + identical. PyCma has a 12-configuration parity suite; Pymoo has no Python-side Optuna reference. +- 02:46 — E43 mixed fleets over gRPC (E10's topology on the proxy): three Python and three C# workers (`fleet_py.py`, + probe `fleet` with a `grpc:PORT` storage) × 40 TPE trials on one study, first through a Python proxy server over + SQLite, then through the C# server (`grpcserve`) over an in-memory storage: 240 trials each time, contiguous + numbers, all COMPLETE, the same view from both languages' readers. Clean. +- 02:47 — E43b QA-71's visible consequence on artifacts: E37's cross-language artifact check repeated on a SQLite + storage. Both languages read the same metadata and bytes, but `get_all_artifact_meta(study)` lists the study's + artifacts in a different order: Optuna `notes.txt, plain, data.csv.gz` (the `artifacts:<uuid4>` system-attribute + keys sorted by SQLite's index), the port upload order `notes.txt, data.csv.gz, plain`. Added to QA-71's row. +- 02:48 — E44 the other two Redis clients (`OptunaSharp.Storage.NRedisStack`, `OptunaSharp.Storage.ServiceStack.Redis`) + through the 64-call storage script next to StackExchange.Redis: all three give the same results, which differ from + Optuna's `JournalRedisBackend` only in QA-66's messages. Container removed. +- 02:52 — two checks that came out clean: `FrozenTrial` equality ignores dictionary key order as Python's `dict ==` does + (a first attempt compared two `create_trial` calls and looked like a difference, but that was only the clock: + CPython 3.12 on Windows reads a coarse clock, so two quick `create_trial`s get the same `datetime_start`, while + .NET's `DateTime.Now` differs by microseconds); and this run's repro tests fail the same way on net8.0 as on + net10.0 (8 unit, 8 storage, 4 LightGBM). +- 02:56 — E45 how warnings reach the user: five trials whose `suggest_float(..., step=0.3)` / `suggest_int(..., step=3)` + ranges are not divisible by the step. Python (default warning filters) prints the two distinct `UserWarning`s once + each, to stderr through `warnings.showwarning`, also under `optuna.logging.set_verbosity(ERROR)`; the port logs both + on every trial (10 lines) through the `optuna` logger, so `SetVerbosity(Error)` — the usual way to silence the trial + log — hides every Optuna warning → **QA-77**. The repetition half was already in the 2026-10-26 release review's LOW + notes ("OptunaWarnings logs every occurrence"); the verbosity half is new. (The message shows `[0.0, 1.0]` where a + Python user who passed the ints `0, 1` sees `[0, 1]` — C#'s `double` parameters, not a defect.) +- 03:03 — E46 a mixed CMA-ES fleet (P3-2's pickle under concurrency): two Python and two C# workers × 50 trials of + `CmaEsSampler` on one journal file (`FLEET_SAMPLER=cmaes`), each reading the generations and optimizer pickles the + other language wrote: 200 trials, contiguous, all COMPLETE, `cma:generation` on 198 and `cma:optimizer` chunks on + 158 of them, no errors in any worker, the same study from both readers; the same with `NSGAIISampler(population_size=8)` + (200 trials, contiguous, all COMPLETE), and with a 15-point `GridSampler` (2 + 2 workers × 6 trials: 17 trials, all 15 + points covered, 2 concurrency duplicates as Optuna documents for distributed grids, every worker stopped once the + grid was exhausted). Also: the 77 `optuna_warn` call sites + (plus 3 direct `warnings.warn`) give QA-77 its scope; the bridge repro tests fail on net8.0 too (3/3). +- 03:07 — E47 Optuna's filesystem existence checks against the port's (`os.path.exists` / `isfile` in + `artifacts/_download.py`, `cli.py`, `journal/_file.py`): `download_artifact` onto an existing *directory* raises + `FileExistsError("File already exists: …")` in Optuna (`os.path.exists` is true for directories) and + `UnauthorizedAccessException` in the port (`File.Exists` is false for them, then the directory is opened as a + file) → **QA-78**. The CLI's `isfile` maps to `File.Exists` correctly; a journal path that is a directory fails on + both sides (at a different point; exotic, not relisted). +- 03:24 — E48 the three-objective fuzz (`mo4`, 800 programs, `samplers=nsga2,nsga3,random,tpe`, 3 objectives, + `nan` / `ninf` / `fail` / `prune` plans): NSGA-II 213 / 213 identical, Random 203 / 203, NSGA-III 180 identical + + 1 structural (P170: 3 infinite values, the QA-56 niching class), TPE 63 identical / 81 within tolerance / 59 + structural. `first_diff.py` puts 114 of the TPE differences in the ULP class (first difference within 1e-6) and 26 + first differences structural. Root cause of those 26, followed at P2 T31 (`y1` log-int 10..100, two single-value + floats, constant liar, a `-inf` trial at T29): not near-ties (relative acquisition gaps 4–19 %), not HSSP ties + (`hssp_trace.py`), and not the split — new `split_check.py` / probe `splitcheck` rebuild the history and run Optuna's + `_split_trials` and the port's `TpeTrialSplit.SplitTrials`: identical below sets at every trial (T31: `[3, 4, 29]`). + T31 is the first trial whose above group has 26 observations, so `default_weights(26)` gives the oldest kernel + weight 1/26 instead of 1, and `y1` repeats values (12 three times): `np.argsort(mus)` (x86-simd-sort, unstable) + orders the tied 12s `[22, 0, 18]`, the port's stable sort `[0, 18, 22]`, so the 1/26 kernel gets the clipped + middle sigma in Optuna and the wide left-edge sigma in the port. That is the documented `[Misaligned]` argsort + tie-order class of `ParzenEstimator` ("a ≥25-observation independent study with ties"): known, not relisted. +- 03:24 — E49 (found while reading the split): `TpeTrialSplit.GetPrunedTrialScore` ranks pruned trials with + intermediate values by `study.Directions[0]`; Optuna's `_get_pruned_trial_score` reads `study.direction`, which + raises `RuntimeError("A single direction cannot be retrieved from a multi-objective study. …")` on a + multi-objective study. `Trial.report` refuses multi-objective studies on both sides, so the records come from + `add_trial` (or another writer of the storage): Optuna 5.0.0 with one COMPLETE and four PRUNED-with-reports trials + fails the first TPE trial, the port completes 12 → **QA-79**. The other `Directions[0]` reads in Core are the + single-objective split and PED-ANOVA (Optuna reads `directions[0]` there too). +- 03:24 — E50 `RDBStorage(url, skip_table_creation=True)` over an empty SQLite file: Optuna's version manager reads + `version_info` inside `_create_scoped_session`, so the constructor raises `StorageInternalError` (commit message, + cause `OperationalError: no such table: version_info`), with or without `skip_compatibility_check`; the port + constructs the storage and its first read throws `SqliteException: SQLite Error 1: 'no such table: studies'.` → + **QA-74** extended to SQLite (new test). +- 03:35 — E52 the fresh-seed combined fuzz (`big3`, 2,000 programs: Random, TPE, CMA-ES, NSGA-II / III, QMC, + BruteForce, Grid over memory / journal / SQLite with dynamic ranges, `add_trial`, `dyncat`, `ask(fixed)`, + reference points, `x0`, duplicate categoricals): Random 253 / 253, QMC 245 / 245, Grid 275 / 275, NSGA-II + 231 / 231 identical; BruteForce 258 + 1 (both raise `search_space mismatch`, Optuna lists the new candidates as ints + because `_enumerate_candidates`' `lru_cache` kept an earlier program's equal-hashing tuple — process state, as at + 00:04); CMA-ES 236 + 20, all `with_margin`: 15 where Optuna raises the ragged-array `ValueError` (QA-60) and 5 in the + CMAwM ULP class; NSGA-III 226 + 4, all with ±inf values (QA-56); TPE 99 identical / 88 within tolerance / 64 + structural, of which `first_diff.py` puts 119 first differences in the ULP class and 33 structural: 13 at trial ≥ 29 + and 20 earlier, all earlier ones joint (Optuna 5's TPE is always multivariate: `multivariate` "remains only for + historical reasons") over repeated int values — the argsort tie-order class — or traced near-ties (P1671 4e-15 + relative, P1524 acquisition 2^-53 vs 0). Nothing new. +- 03:35 — E51 Warm-Starting CMA-ES (`source_trials`, not in any fuzz so far): `wscma_gen.py` / `wscma.py` / probe + `wscma`, 150 programs — a RandomSampler source study (10–60 trials, either direction, ranges that may exceed the + target's, pruned trials with a report, trials with an extra parameter) feeding `CmaEsSampler(source_trials=…)` with + random `n_startup_trials`, `popsize`, `with_margin`, `lr_adapt`, `consider_pruned_trials`. 142 identical + (`get_warm_start_mgd` and its determinant byte-exact; cmaes' `assert` statements surface as `ArgumentException` with + the same text, 28 programs with fewer than 10 usable source trials), 5 in the CMAwM ULP class, and 3 where Optuna + fails trial 1 with `AssertionError: invalid bounds` while the port runs on: the warm-start mean lies outside the + target's ranges, and cmaes' `CMA` / `SepCMA` constructors assert `_is_valid_bounds(bounds, mean)`. The port's `Cma` + and `SepCma` lack that assertion (only `CmaWm` has it); the same happens with an `x0` outside the ranges (Optuna: + plain, separable and `lr_adapt` all fail trial 1; the port completes them) → **QA-80**. Also seen: a PRUNED source + trial without a value under `consider_pruned_trials` crashes both sides (`TypeError` vs + `InvalidOperationException`; exotic, not relisted). +- 03:39 — E53 the rest of cmaes' constructor assertions against the port (`CMA`: sigma, dimension, popsize, the + three learning-rate checks, covariance shape, bounds; `SepCMA`: the same plus dimension > 1; `CMAwM`: steps, + continuous bounds, discrete sizes, margin): the port has every one except the bounds check of `Cma` / `SepCma` + (QA-80) and the learning-rate checks (`c1 <= 1 - cmu`, `cmu <= 1 - c1`, `c_sigma < 1`, `cc <= 1`). Reachable with + `popsize=1` (`mu = 0`, NaN `mu_eff`): Optuna fails trial 1 with `AssertionError: invalid learning rate for the + rank-one update` (plain, `with_margin`, `lr_adapt`; separable raises `ZeroDivisionError`), the port completes trial + 1 with NaN rates and fails trial 2 with `ValueError: `nan` is invalid value.`; `popsize=2` identical → **QA-80** + extended (second test). Also clean: `create_trial` / `FrozenTrial._validate` messages, 23 cases (`ftval.py` / + `ftval.cs`: failed / complete / NaN values, parameters outside float / log / step / int / categorical + distributions with their reprs, key mismatch, constraint NaN) — identical. +- 03:48 — E54 constructor-validation matrix (`ctor_cases.py` / probe `ctorcheck`, which builds the port's types by + reflection from the same keyword arguments): 86 cases over Median / Percentile / SuccessiveHalving / Hyperband / + Threshold / Patient / Wilcoxon pruners and TPE / NSGA-II / NSGA-III / QMC / CMA-ES / GP / BruteForce / Random + samplers (negative counts, zero intervals, NaN thresholds and probabilities, out-of-range percentiles and + probabilities, `population_size` 0 / 1, incompatible CMA-ES flags, deprecated `restart_strategy`, negative seeds): + every representable case gives the same outcome and message, including Hyperband's lazy validation (Optuna accepts + `min_resource=0`, `reduction_factor=1`, `min > max` at construction; so does the port). Not representable in C#: + `min_resource` / `max_resource` strings other than `auto` and seeds ≥ 2^31 (the known 32-bit seed type). E55 + use-after-finish (`afterfin.py` / `afterfin.cs`): 15 trial / study operations (suggest existing / new, report, + `should_prune`, user attributes, tell again with and without `skip_if_finished`, tell by number) on COMPLETE, FAIL and + PRUNED trials over memory, journal and SQLite — 135 cases identical. `best_trial` tie-breaking (equal values, ±inf, + -0.0) identical on all three storages. E56 Optuna's journal compatibility asset (`test_log_compatibility.py`'s + `4.0.0.dev.log`, which no port test reads): `jdump.py` / probe `jdump` dump every study and trial identically. +- 04:03 — E57 the PyCma bridge against optuna-integration's `PyCmaSampler`, which E42 could not run (the + environment's `cma 3.2.2` breaks under NumPy 2): `cma==4.4.4` (the CI pin) installed with `pip --target` into a + scratch folder and put first on `PYTHONPATH`, which the embedded interpreter honors too (probe `pyver` prints the + imported `cma.__file__`). First attempt differed from trial 1 — because `seed=0` means "seed from the clock" in + pycma (`None` and `0` both do), so Python's own runs differ from each other; optuna-integration passes the seed + through unchanged, and so does the bridge. With `seed=7`: Python reproducible, and the bridge's 80 trials (float, + int, log-float, categorical) identical to optuna-integration's. +- 04:08 — E58 distribution construction (`distval.py` / `distval.cs`, float bounds as floats, which is all a C# caller + can pass): 24 cases — `low > high`, log with non-positive low, zero / negative steps, log with step, step + adjustments (`[0.0, 1.0]` step 0.3 → `[0.0, 0.9]`, negative int ranges, a step larger than the range), NaN / inf + bounds (accepted by both), empty / duplicated / NaN categorical choices — identical messages and reprs; the + adjustment warning differs only in its channel (`UserWarning` vs a `[W …]` log line, QA-77). WilcoxonPruner under + scipy 1.16.3 surfaces no scipy warnings in a tie-heavy study (only the `ExperimentalWarning` the port dropped by + design). +- 04:12 — E59 `OptunaSearchCV` (no QA run had looked at it; the port's surface is C#-shaped by design: CV, + scoring and `error_score` live on `SklearnEstimator`, no `enable_pruning` / `max_iter` / `subsample`): read + against optuna-integration's `__init__`, `fit` and `_Objective`. The objective, the stored attributes and their + order (`fit_time`, `score_time`, `test_score`, `train_score` as scikit-learn's `cross_validate` orders them), the + seed derivation (`randint(0, iinfo(int32).max)` → `TPESampler(seed)`) and the terminator report match. One + normalization is missing: optuna-integration stores `self.n_jobs = n_jobs if n_jobs else 1`, so `n_jobs=0` runs + sequentially (measured: two trials, `n_jobs == 1`, like `None` and `1`); the port maps only `null` to 1 and + `Fit()` throws `ValueError: max_workers must be greater than 0` from `Study.Optimize` → **QA-81**. +- 04:15 — E60 the same falsy-argument question in Core: `optimize` with `timeout` 0 / -1, `n_trials` 0 / -1, + `n_jobs` -1 / -2, `timeout=0` with `n_jobs=2`, `create_study(directions=[])`, and `get_trials(states=())` (no + trials, unlike `None`) on memory, journal and SQLite — identical. Also read: crossover constructors (SBX / VSBX / + Uniform validations ported verbatim) and the exception hierarchy (`UpdateFinishedTrialError` is also a + `RuntimeError` in Python; the port keeps the `OptunaError` base, documented, and no Optuna code catches it as + `RuntimeError`). A 900-program fresh-seed fuzz with batches and interleaved asks (Random, QMC, Grid, BruteForce, + TPE, CMA-ES; NSGA left out for its known batch class) started in the background. +- 04:17 — E62 terminator constructors through probe `ctorcheck` (now also building `"@Type"` arguments, e.g. the + evaluator `MedianErrorEvaluator` pairs with): 20 cases over `Terminator`, `BestValueStagnationEvaluator`, + `EMMREvaluator`, `RegretBoundEvaluator`, `MedianErrorEvaluator` (negative warm-up, zero initial trials, zero / + negative / NaN threshold ratio) and `StaticErrorEvaluator` — identical. The `optuna.terminator` deprecation is + emitted at the same three points (`Terminator()`, `TerminatorCallback()`, `report_cross_validation_scores`); + repetition is QA-77's. +- 04:47 — E61 result (900 programs with batches of 2–5 and interleaved asks, fresh seed): Random 131 / 131 and QMC + 151 / 151 identical; Grid 145 + 1 (both raise on a missing `grid_id` after `enqueue_trial` of a fixed `None` + choice — Python `KeyError: 'grid_id'`, the port `KeyNotFoundException`, the QA-66 mapping class); BruteForce 151 + 1 + (`avoid_premature_stop` with batches, `[Misaligned]`); CMA-ES 147 + 7, all `with_margin` (5 QA-60 raises, 2 ULP); + TPE 59 / 66 tolerance / 41 structural (83 first differences in the ULP class, 24 structural — the argsort / near-tie + classes as in E52). Nothing new beyond the QA-66 occurrence. +- 04:47 — E63 the BoTorch bridge on a two-objective problem with an int and a float (`n` in [0, 4], `x` in [0, 1], + 4 startup trials, seed 0; `bt_mo.py` / probe `btmo`, with and without a `constraints_func`): full studies agree on + the startup trials and then differ in the eighth significant digit of `x` from the first BoTorch trial on; each side + is deterministic run to run, torch's thread count (1 vs 24) changes nothing in Python, and the candidate-function + bodies are verbatim. The existing replay harness (`BoTorchIntegrationParityTests.AssertReplay`: the bridge's history + fed into real `optuna_integration.BoTorchSampler`, suggestion by suggestion) confirms it: maximum difference + 3.4e-8 for this configuration, while its 16 existing cases (including mixed int / float qEHVI over `n` in [0, 20], + `x` in [-5, 5]) stay at 0 → **QA-82** (cause not found in the time left; the inputs printed in hex are identical). +- 04:55 — QA-82 narrowed with three replay variants: `n` in [0, 20] still differs (2.6e-8), `x` in [-5, 5] still + differs (9.8e-8), and suggesting `n` before `x` (alphabetical order, as every existing replay case does) makes + the replay identical. The bridge's suggestion therefore depends on the order parameters are suggested in; Optuna's + BoTorchSampler works on the name-sorted intersection search space (so does the port's `IntersectionSearchSpace`), + so the order dependence sits somewhere in the bridge's tensor construction. Left for the owner. +- 05:06 — correction to the 04:55 entry: a fourth replay variant (`x` in [0, 1], `n` suggested first) still differs + (3.1e-9), and full studies with `n` suggested first differ too (~1e-9 at T4). The suggestion order changes the + size of the drift but is not its cause; only `x` in [-5, 5] with `n` first happened to come out identical. QA-82's + row and the repro test's documentation now list the measured variants instead of the order claim. +- 05:08 — QA-82 scope: the same replay with one objective (`x*x + 0.05n + 0.5(1-x)^2`, LogEI) over the same space + and suggestion order is identical, so the drift is confined to the multi-objective qEHVI / qLogEHVI path. +- 05:11 — QA-82 with two floats (`n` as `FloatDistribution(0, 4)`, `x` in [0, 1], the same two objectives and + suggestion order): the replay's maximum difference is 0.66, a different suggestion altogether rather than drift, + consistent with the small numerical difference flipping which acquisition restart wins. QA-82 raised to MEDIUM + (wrong suggestions on a less common path). The existing float-only qEHVI case (`a`, `b`, suggested alphabetically) + stays at 0. +- 05:16 — QA-82 with four objectives over the same two floats (Auto picks analytic EHVI there, not qEHVI): the + replay is identical. With LogEI also identical, the drift is confined to the Monte-Carlo qEHVI / qLogEHVI + path (≤ 3 objectives), where the acquisition is estimated with the seeded `SobolQMCNormalSampler(256)`. +- 05:20 — E64 two last probes. `optimize(n_trials=0, show_progress_bar=True)`: Optuna's `_ProgressBar` is valid + only when `(n_trials or timeout) is not None` (so `0` disables it) and the port's when either is non-null, but + with no trials neither draws anything — no visible difference. `CmaEsSampler(x0=...)` without one of the search + space's parameters fails trial 1 on both sides with different errors (Optuna's transform assertion vs + `KeyNotFoundException`) → **QA-83**. +- 05:24 — E65 last quick checks, all identical: GridSampler asked for a parameter outside its grid (`ValueError: + The parameter name, y, is not found in the given grid.`, trial FAIL, `x` kept); NSGA-II `constraints_func` + returning NaN (`ValueError: Constraint values cannot be NaN.`, trial stays COMPLETE, `constraints: None`); + `optimize(catch=(Exception,))` with `TrialPruned`, a `ValueError` and a division error (PRUNED, FAIL, FAIL); + `suggest_categorical([1, 1.0, True, 'a'])` under `RandomSampler(seed=0)` (the same returned objects, and params + read back as the first equal choice, `1`, on both sides); the QMC no-seed warning text including its double space. +- 05:29 — also identical: `create_study(load_if_exists=True)` with other directions loads the stored study as + is, and a plain duplicate raises the same `DuplicatedStudyError` text; SQLite lists studies after deletes as + Optuna does (`c, d, e, f`; QA-67 stays memory / journal only); `Trial.report`'s step checks and duplicate-step + warning are verbatim. The unit suite with CI's filter still passes on net10.0 (2172 passed, 1 Windows skip): the + run's `[OpenBugs]` tests stay out of CI. +- 05:38 — **run ends** (8 h after 21:37:56). 28 findings QA-56 … QA-83 (5 MEDIUM, 16 LOW, 7 NIT), 37 repro test + methods, 65 directions; nothing in `src/` changed. Summary at the top; catalog Open item 34. + +## Findings + +| ID | Severity | Area | Summary | Test | Status | +|----|----------|------|---------|------|--------| +| QA-56 | LOW | NSGA-III elite selection (`PreserveNicheIndividuals`) | Optuna sorts the borderline front's `(distance, index)` pairs with `list.sort(reverse=True)`; a pair holding a NaN distance compares neither smaller nor larger, so timsort keeps such pairs in input order and `pop()` takes the last first. The port's comparer treats NaN as equal to NaN and then orders by index, reversing them. NaN distances arise whenever a front (plus the elites) has no finite value in some objective (`_filter_inf` returns NaN): with population 2 and a first generation of `(inf, inf)` trials Optuna builds the elite population `[T1, T0]`, the port `[T0, T1]`, and the next child copies the other parent (seed 0: `y=0.7151893663724195` vs `0.5448831829968969`). Not rare in long runs: 5 of 8 NSGA-III fuzz programs of 300–500 trials (populations 2–10, about 5% infinite objective values) split from Optuna this way, and finite values large enough to overflow `_filter_inf`'s `nadir + interval` produce the same NaN distances. | `Run2SamplerParityBugTests.Nsga3_AllInfiniteBorderlineFront_KeepsPythonsNichingOrder`; `Internal/CPythonOrderOracleTests` (353 CPython 3.12 sorts, `oracle/cpython_order.json`) | **fixed 2026-11-12**: `PreserveNicheIndividuals` sorts the borderline front with `PyListSort`, a step-for-step port of CPython 3.12's `list.sort` (count_run, binary insertion, powersort merge policy, galloping merges, `reverse` as CPython does it), with Python's tuple `<` (`DistanceIndexLessThan`: equal distances by index, a NaN distance never less, never greater); all 353 recorded NaN-bearing sorts up to 1,000 elements match. CPython 3.13 rewrote `count_run`, so the corpus pins 3.12, the interop interpreter | +| QA-57 | LOW | NSGA-II / NSGA-III (and the other `HandedOutParams` users), batched ask/tell | The plan 12 running-trial redraw (`HandedOutParams.Claim`, `d0558f5`) also fires in a single-threaded, seeded batched ask/tell (Optuna's documented batch-optimization pattern: ask several trials, evaluate, tell), so the trajectory leaves Optuna's; THREADING.md promises parity only for one-trial-at-a-time runs, which this is not, but it also compares partial children: a child whose mutated parameter was dropped (and will be sampled independently by each trial) is called a duplicate of another running trial's partial child. Seed 311031104, population 6, batches of 5: trial 18 gets `v5=0.00021556396515864647` (trial 1's value, from the fourth child generated) where Optuna samples `v5=0.02621137972316322`. See Q4. | `Run2SamplerParityBugTests.Nsga_BatchedAskTell_PartialChildIsNotRedrawn` | **fixed 2026-11-12** (owner's decision Q4: thread-aware redraw): `HandedOutParams` records the claiming thread with each child and redraws only against children another thread asked for, so a batch asked on one thread draws Optuna's children (the test passes) while `Optimize(nJobs)` and concurrent callers stay steered apart; `SamplerParallelReadTests` now reads its lockstep volleys each on a thread of its own (`ReadInLockstep(readsOnOwnThreads: true)`); THREADING.md §6.3 updated | +| QA-58 | LOW | In-memory and journal storages, `get_trials(deepcopy=False)` | A `FrozenTrial` read with `deepcopy=False` while its trial runs keeps receiving that trial's later user attributes, intermediate values and system attributes in Optuna (not its later parameters): `Trial` mutates the dictionaries of the record it was created from in place, and the storages' shallow copy-on-write shares every dictionary a write has not replaced. Measured: before `params=['x'] ui=[] iv=[] sys=[]`, after `set_user_attr` / `report` / `set_constraint` `params=['x'] ui=['k'] iv=[0] sys=['constraints:c']`. The port's record never changes (plan 13 S4 copies all five dictionaries before writing to a handed-out record; `Trial` keeps a detached copy since `3a75811`). SQLite shows nothing in either language. An aliasing artifact rather than a designed contract — owner's call. | `Run2StorageParityBugTests.HeldRunningRecord_SeesTheTrialsLaterAttributeWrites_LikeOptuna` | **deferred by the owner 2026-11-12**: the port keeps handing out snapshots (copying the aliasing would undo the copy-before-write that keeps `n_jobs` readers safe, unless the shared dictionaries became concurrent ones); the repro stays `[OpenBugs]` | +| QA-59 | LOW | SQLite RDB storage (cached refresh) | The cached refresh sends every unfinished trial below the last finished one as `trial_id IN (...)`, one bound variable each. Past SQLite's variable limit (32,766 in Microsoft.Data.Sqlite's `e_sqlite3`) the read throws `SqliteException: 'too many SQL variables'` and the study can no longer be read. Optuna catches that `OperationalError`, logs `Caught an error from sqlalchemy: … Falling back to a slower alternative.` and reads every trial instead (and its Anaconda SQLite 3.51.0 allows 250,000 variables). Reproduced with 33,000 RUNNING trials (crashed workers) below a COMPLETE one: Optuna reads 33,003 trials twice, the port's second read throws. The EF Core storage builds the same list with no fallback (PostgreSQL's limit is 65,535 parameters). | `OptunaSharp.Tests.Storage/Run2SqliteParityBugTests.CachedRefresh_TooManyRunningTrialsBelowTheWatermark_FallsBackLikeOptuna` | **fixed 2026-11-12** (SQLite): the multi-trial read catches the SQLite errors Python's `sqlite3` raises as `OperationalError` (primary codes ERROR, BUSY, LOCKED, ...; "too many SQL variables" is ERROR), logs Optuna's `Caught an error from sqlalchemy: ... Falling back to a slower alternative.` and reads every trial of the base query (study and states), keeping the included ones and those above the watermark, as `_get_trials` does; the 33,000-RUNNING-trial study reads back 33,003 trials. EF Core needs no fallback: measured with `ToQueryString()` on EF Core 8 and 9, Pomelo inlines the ids (`IN (3, 5, ...)`) and Npgsql passes one array (`= ANY (@p)`) | +| QA-60 | MEDIUM | CmaEsSampler `with_margin=True`, conditional or dynamic search space | CMAwM is told the raw `x_for_tell` vectors the generation's trials stored. When the intersection search space loses a dimension before the first generation is told (a parameter's range changes), a new optimizer starts at generation 0 and that generation mixes long and short vectors: Optuna's `np.array([s[0] for s in solutions])` raises `ValueError: setting an array element with a sequence. The requested array has an inhomogeneous shape …` (or, when all vectors are long, `non-broadcastable output operand …`) and the trial fails; the port's `Cma.Tell` reads the first `n_dim` entries of each vector and carries on with points whose coordinates stand for other parameters. Seed 0, `x` int [0, 10] and `y` [0, 1] ([0, 1.5] on trial 2): Optuna raises at trial 3 / 4 / 5 for population 2 / 3 / 4; the port finishes 12 trials. Found in 11 of 68 dynamic-range CMA-ES programs; a merely *conditional* parameter does it too (`y` suggested on even trials only: Optuna raises at trial 4 for seeds 0, 1, 2), so any conditional search space under `with_margin=True` hits it at the end of the first generation. Optuna's crash is arguably its own defect; the owner decides between raising and guarding. | `Run2SamplerParityBugTests.CmaWithMargin_SearchSpaceShrinksInFirstGeneration_RaisesLikeOptuna` (six cases: population 2 / 3 / 4, range change or conditional parameter) | **fixed 2026-11-12**: `Cma.CheckTellShapes` raises NumPy's `ValueError` before the optimizer changes (inhomogeneous shape for a ragged generation; for uniform long vectors, the non-broadcastable output operand against a one-dimensional mean, else the broadcast error); the six cases were re-measured in Optuna that day (population 2 with the range change is the non-broadcastable variant) and pass with the exact messages; `SepCma.Tell` runs the same check | +| QA-61 | LOW | CLI `-f yaml` | PyYAML's `safe_dump` writes every float with a decimal point and quotes the formatted datetimes; the port's YamlDotNet output writes `2.0` as `2`, `1e-07` as `1E-07`, `1e16` as `10000000000000000` and the datetimes bare. Read back with `yaml.safe_load` (YAML 1.1), the port's floats become the int `2`, the string `'1E-07'` (YAML 1.1 floats need a decimal point) and the int `10000000000000000`, and its datetimes become `datetime` objects where Optuna's output gives strings. `OutputFormat.cs` calls YAML byte parity best-effort; these change types, not bytes. (Key quoting `"y"` / `"n"` and double quotes read back the same.) | `OptunaSharp.Tests.Cli/Run2CliParityBugTests.TrialsYaml_FloatsAndDatetimes_KeepTheirTypesLikePyYaml`; `PyYamlSafeDumpOracleTests` (763-case PyYAML corpus, `oracle/pyyaml_safe_dump.json`) | **fixed 2026-11-12**: `-f yaml` goes through `PyYamlSafeDump`, a port of PyYAML 6's `safe_dump` (representer, YAML 1.1 implicit resolvers, the block-style emitter with its scalar analysis, quoting, folding at 80 columns, the tag length in the simple-key limit and `open_ended`); byte for byte on all 763 corpus cases; YamlDotNet is gone from the CLI; it also fixed run 1's QA-36 (doubled CR on Windows) | +| QA-62 | LOW | `FloatDistribution` stepped-high adjustment, BruteForce float candidates | Same root cause as QA-3 (owner question Q1), beyond the range QA-3 describes: Python parses `str(x)` into an exact `Decimal` and computes with 28 significant digits; .NET's `decimal` keeps at most 28 digits *after the point*, so a value whose repr needs more places (a 17-digit double below ~1e-11) is rounded on the way in, although it is far inside decimal's range. After the QA-2 / QA-11 fix, 1,439 of 100,000 random ranges still adjust `high` one ULP off and 184 of 5,000 BruteForce grids differ, all among the 3,021 inputs needing more than 28 places. `FloatDistribution(4.1271208719049127e-14, 4.085121318968367e-13, step=1e-15).high`: Optuna `4.0827120871904913e-13`, the port one ULP below; `_enumerate_candidates(2.942974008882182e-14, 5.614297400888218e-13, 2e-15)`: 266 values in Optuna, 267 in the port. | `Run2DistributionParityBugTests.SteppedHigh_ValuesBeyond28DecimalPlaces_RoundLikeDotNetDecimal` (`[Misaligned]`) | **kept, `[Misaligned]` 2026-11-12** (owner's decision on run 1's Q1, asked with this finding: keep .NET `decimal`): the test pins the port's values (`high` one ULP below Optuna's, 267 BruteForce candidates); `FloatDistribution`, `BruteForceSampler.EnumerateCandidates` and the distributions page describe the rounding; QA-3's two tests are `[Misaligned]` too | +| QA-63 | MEDIUM | CLI `tell` | `tell --state fail` / `tell --state pruned` without `--values` fails: the port's `--values` option (`Option<double[]?>`, one-or-more) yields an empty array, not null, when omitted, so Core's `tell` sees values next to a PRUNED / FAIL state and raises `ValueError: Values were told. Values cannot be specified when state is TrialState.PRUNED or TrialState.FAIL.`; the command prints an unhandled-exception stack, exits 1 and the trial stays RUNNING. Optuna (argparse `nargs="+"`, default `None`) logs "Told trial 0 with values None and state TrialState.FAIL." and exits 0. A bare `tell --trial-number n` (no values, no state) also differs: Optuna warns "The value None could not be cast to float." and logs "with values None", the port warns "The number of the values 0 did not match the number of the objectives 1" and logs "with values []". `--directions` already maps an empty array to null; `--values` does not. `tell --state complete` without values likewise warns "The number of the values 0 did not match the number of the objectives 1" where Optuna raises "No values were told. Values are required when state is TrialState.COMPLETE." | `OptunaSharp.Tests.Cli/Run2CliParityBugTests.Tell_StateWithoutValues_FinishesTheTrialLikeOptuna` | **fixed 2026-11-12**: an omitted `--values` binds `null` (an empty array means the option was omitted, as `--directions` already treated it), so `tell --state fail|pruned` finishes the trial and exits 0; the test passes, and `CliParityTests`' fixture now gets its FAIL / PRUNED trials | +| QA-64 | LOW | CLI `ask --sampler-kwargs` | Optuna builds the sampler with `getattr(optuna.samplers, name)(**kwargs)`, so JSON objects and arrays reach it; the port's `SamplerFactory.TryCoerce` binds only scalars (bool, string, int, long, double, float, enums). `--sampler GridSampler --sampler-kwargs '{"search_space": {"x": [0.5]}}'`, `--sampler CmaEsSampler --sampler-kwargs '{"x0": {"x": 0.25}, "sigma0": 0.1}'` and `--sampler NSGAIIISampler --sampler-kwargs '{"reference_points": [[1.0]]}'` ask normally in Optuna and fail in the port with `Could not construct sampler 'GridSampler' from the given --sampler-kwargs ({search_space}).` | `OptunaSharp.Tests.Cli/Run2CliParityBugTests.Ask_StructuredSamplerKwargs_ConstructTheSamplerLikeOptuna` | **fixed 2026-11-12**: `SamplerFactory` binds JSON objects to string-keyed dictionaries, JSON arrays to lists, arrays and a rectangular `double[,]`, and grid values to `CategoricalChoice`, so GridSampler's `search_space`, CmaEsSampler's `x0` and NSGAIIISampler's `reference_points` construct the sampler (the test now covers NSGA-III too) | +| QA-65 | LOW | CLI `--log-file` | Optuna attaches the `--log-file` `FileHandler` to Python's root logger, but the `optuna` logger has `propagate = False`, so the file stays empty — measured at 0 bytes for `create-study`, with `-v`, and with `--debug` on a failing command. The port attaches its handler to Optuna's logger and writes every line (`[I …] A new study created in RDB with name: f`). An Optuna defect the port does not copy; owner's call (Q5, as QA-46 was). | `OptunaSharp.Tests.Cli/Run2CliParityBugTests.LogFile_ReceivesNoOptunaRecords_LikeOptuna` | **fixed 2026-11-12** (owner's decision Q5: copy Optuna, as QA-46): `--log-file` creates the file and writes nothing, the CLI docs say so and suggest redirecting stderr; the test passes | +| QA-66 | NIT | Storage API errors (`InMemoryStorage`, `JournalStorage`) | `get_trial_param(trial_id, name)` for a parameter the trial does not have raises Python's `KeyError` (the record's dictionary lookup) on the in-memory and journal storages; the port raises `KeyNotFoundException`, which a `catch (KeyError)` written against the port's other storage errors misses — and which `BaseStorage.GetTrialParam`'s own XML doc promises (`<exception cref="KeyError">… or no such parameter exists`); the base implementation (`trial.Distributions[paramName]`) serves the journal, cached and gRPC-proxy storages too. The storages raise `DuplicatedStudyError` with no message (`str(e) == ''`); the port's carries .NET's default text ("Exception of type 'OptunaSharp.DuplicatedStudyError' was thrown."). Only direct storage callers see either: `create_study` replaces the empty error with its own message, which the port copies. Every other message of a 66-call storage script matched on all three storages. Through the gRPC proxy (E31) the same script differs in messages only: Optuna's `GrpcStorageProxy` raises bare `KeyError()`, `ValueError()`, `UpdateFinishedTrialError()` and `DuplicatedStudyError()` (empty `str(e)`), the port's client forwards the server's detail ("No study with study_id 999 exists.", quoted when a Python server sent it). Also on a sampler path (E61): GridSampler's missing `grid_id` after `enqueue_trial` raises Python `KeyError: 'grid_id'` and the port `KeyNotFoundException`. | `Run2StorageParityBugTests.StorageLevelErrors_MissingParamAndDuplicatedStudy_MatchOptuna` | **fixed 2026-11-12** for the storages: `BaseStorage.GetTrialParam` and the in-memory storage raise `KeyError(param_name)` (its message is the name, Python's `e.args[0]`), the in-memory and journal storages raise `DuplicatedStudyError("")`, and GridSampler's missing `grid_id` is `KeyError("grid_id")`; `CompactFinishedTrialsTests` now expects `KeyError` on the compact record too. **Kept**: the gRPC proxy client still forwards the server's detail where Optuna raises bare `KeyError()` / `ValueError()` / … chained `from` the `RpcError` — a .NET `KeyError` cannot carry that cause, and an empty message alone would drop the detail Python keeps in `__cause__` | +| QA-67 | LOW | Study listing order (`InMemoryStorage`, `JournalStorage`) | After a study is deleted, studies are listed in a different order: Python keeps them in a `dict`, which appends a new key after the existing ones; the port's `Dictionary<int, …>` puts the next study into the deleted one's freed slot. Create `a, b, c`, delete `b`, create `d`, delete `a`, create `e, f`: Optuna `['c', 'd', 'e', 'f']`, the port `[e, d, c, f]` (SQLite orders by id in both). Reaches `get_all_study_names`, `get_all_study_summaries`, the CLI's `studies` on a journal file (`optuna`: `a, c, d`; `optunasharp`: `a, d, c`) and the name list in `load_study(study_name=None)`'s error. An insertion-ordered dictionary (the repository's `OrderedDict`) keeps Python's order. | `Run2StorageParityBugTests.StudyListing_AfterDeletions_KeepsCreationOrderLikePythonDicts` | **fixed 2026-11-12**: the in-memory storage's study map and the journal replay result's are insertion-ordered `OrderedDict`s, as Python's dicts are, so studies list in creation order across deletions (`['c', 'd', 'e', 'f']`); the journal snapshot codecs write and read them in that order | +| QA-68 | LOW | GridSampler, trials numbered at or above the grid size | Such a trial picks its grid with `rng.choice(list(set(range(n)) - set(visited) - set(running)))`, so the candidates come in CPython's set-iteration order (the difference builds a fresh small table where values of 8 and more wrap onto smaller ones: `list(set(range(16)) - {0, 1, 2, 3, 5, 6, 7, 9, 10, 12, 13, 14, 15})` is `[8, 11, 4]`); the port lists them in ascending order, so the same random index picks another grid. The port marks this `[Misaligned]` in `GridSampler.GetUnvisitedGridIds` on the premise that only real concurrency reaches the `choice` branch, but a single-threaded `optimize` reaches it whenever the study's numbering is shifted (trials from `add_trial` / `enqueue_trial`, another sampler, a resumed study). `GridSampler({"x": [0.0, …, 15.0]}, seed=0)` on a study holding 12 added trials, `optimize(n_trials=16)`: Optuna's 13th grid trial is `x=11`, the port's `x=4` (seed 2 too; seed 1 agrees). Matching needs CPython's small-int set layout (hash = value, minimum 8 slots, linear probing). | `Run2SamplerParityBugTests.GridSampler_ShiftedNumbering_PicksUnvisitedGridsInCPythonSetOrder`; `Internal/CPythonOrderOracleTests` (271 CPython 3.12 set differences, `oracle/cpython_order.json`) | **fixed 2026-11-12**: `GetUnvisitedGridIds` builds `set(range(n)) - set(visited) - set(running)` (and the unfinished fallback) with `PyIntSet`, a model of CPython 3.12's set table (8-slot minimum, 9 linear probes then perturbation, growth at fill*5 >= mask*3, the last passed dummy reused on insert, `set_difference`'s copy-then-discard and fresh-table strategies, the dummy purge, `set_merge`'s copy), so `rng.choice` indexes CPython's iteration order; `list(set(range(16)) - {0, 1, 2, 3, 5, 6, 7, 9, 10, 12, 13, 14, 15})` is `[8, 11, 4]`; all 271 recorded differences up to 70,000 grids match; the `[Misaligned]` note in GridSampler is gone | +| QA-69 | LOW | gRPC storage proxy client (`GrpcStorageProxy`) | Optuna's client rebuilds every `FrozenTrial` from protobuf maps (`_from_proto_trial`: `params`, `distributions`, `user_attributes`, `system_attributes`; the study attributes likewise), and Python protobuf (upb, protobuf 6.33.5) iterates a map in its hash-table order, so through Optuna's proxy the dictionaries come back in a fixed hash order whichever server answers (nine floats suggested `u0, y1, depth2, x3, lr4, z5, a, b, c` read back `depth2, u0, x3, b, y1, z5, lr4, c, a`; stable across processes and `PYTHONHASHSEED`). The port's client keeps the wire order: insertion order from a C# server, the Python server's serialization order (`a, c, lr4, z5, y1, depth2, x3, u0, b`) from a Python one. Two samplers follow that order: `QMCSampler` (relative space = `dict(first_trial.distributions)`, so dimensions are assigned differently) and `BruteForceSampler` (tree built from `trial.distributions.items()`). Random-program fuzz through the proxy: Optuna's trajectory differs from its own in-memory one in 41 of 65 QMC and 3 of 26 BruteForce programs, the port's does not, so the two disagree there; Random, TPE, CMA-ES, NSGA-II / III and Grid unaffected. `QMCSampler(seed=0)` over `u0, y1, depth2`: trial 3 is `u0=0.25, depth2=0.75` through Optuna's proxy, `u0=0.75, depth2=0.25` in memory and in the port. Owner question Q6. | `Run2GrpcParityBugTests.TrialDictionaries_ReadBackInInsertionOrder_NotOptunasUpbOrder`, `Run2GrpcParityBugTests.QmcThroughGrpc_AssignsDimensionsAsInMemory_NotInOptunasProxyOrder` (both `[Misaligned]`) | **kept, `[Misaligned]` 2026-11-12** (owner's decision Q6: insertion order, as every other storage): the two tests pin the port's order and record Optuna's; the gRPC cross-language page and the package README explain the upb order and its QMC / BruteForce effect | +| QA-70 | LOW | Beyond-core samplers' scope (`MoeaDSampler`, `DifferentialEvolutionSampler`, `PsoSampler`, `TurboSampler`) | Their headers state that no OptunaHub counterpart exists ("MOEA/D has NO Optuna/OptunaHub counterpart", "DE is NOT part of the Optuna ecosystem (… no OptunaHub package)", the same for PSO; "TuRBO has no Optuna counterpart") and that there is "no upstream trajectory to bit-match". The pinned `refs/optunahub-registry` has `samplers/moead` (`MOEADSampler`, Hiroaki Natsume, since 2024-09), `samplers/differential_evolution` (`DESampler`, since 2024-12), `samplers/pso` (`PSOSampler`, since 2025-09) and `samplers/turbo` (`TuRBOSampler`, the Optuna team, since 2025-09). The ports follow papers / pymoo instead, so an OptunaHub user moving over gets another algorithm with other parameters and defaults: MOEA/D `population_size=100`, `n_neighbors=None`, `crossover_prob=0.9` vs the port's 50 / 20 / no crossover probability (pymoo-style `neighborSelectionProb`, `nReplacements`); DE `CR=0.7`, `population_size="auto"` vs `cr=0.9`, `strategy`; PSO `n_particles=10, inertia=0.5, cognitive=1.5, social=1.5` vs `popsize`, `w=0.9→wMin=0.4`, `c1=c2=1.49445`, `maxVelocityRate`; TuRBO `n_trust_region=5, failure_tolerance=5, n_startup_trials=4` vs `numTrustRegions=1`, `failureTolerance=null`, `nInit`. No test: what is wrong today is the documented claim; whether the samplers should follow the OptunaHub packages is owner question Q7. | — | **fixed 2026-11-12** (owner's decision Q7: keep the paper / pymoo ports, correct the claims): the headers of `MoeaDSampler`, `DifferentialEvolutionSampler`, `PsoSampler`, `TurboSampler` (and `De`, `Pso`, `TurboOptimizer`) name the OptunaHub package and what the port follows instead, the class docs and the four method pages carry a parameter map; the registry has no counterpart for the other beyond-core samplers whose headers deny one (SMS-EMOA, RVEA, LM-CMA, VkD-CMA, the ES family), so those stay | +| QA-71 | NIT | SQLite RDB storage, attribute reads | Optuna reads a study's and a trial's user and system attributes in key order: its queries have no `ORDER BY` (`StudyUserAttributeModel.where_study_id`, the `selectinload` of a trial's attributes) and SQLite answers `WHERE study_id = ?` / `WHERE trial_id IN (...)` through the unique `(study_id, key)` / `(trial_id, key)` autoindex (`SEARCH ... USING INDEX sqlite_autoindex_..._1`). The port orders by the attribute id, i.e. insertion order. Study user attributes set `zz, b, m` read back `b, m, zz` in Optuna (`study.user_attrs`, `load_study`), `zz, b, m` in the port; system `q, d` → `d, q`; trial `k, a` → `a, k` (`study.trials`, `get_trial`, `best_trial`). `get_all_studies()` scans the table (no `WHERE`), so summaries keep insertion order on both sides; memory and journal storages keep insertion order on both sides; parameters and intermediate values match. No sampler depends on it, but `get_all_artifact_meta(study_or_trial)` does: it walks the system attributes, so on SQLite Optuna lists artifacts in `artifacts:<uuid4>` key order (effectively random), the port in upload order (E43b). Same on MySQL 8.0 (InnoDB answers through the same unique indexes; the EF Core storage orders by id); on PostgreSQL 16 Optuna's own order is unstable (sorted on a first read, insertion order after `load_study`). | `Run2SqliteParityBugTests.AttributeReads_ComeBackInKeyOrderLikeOptunasIndexScan`, `Run2EFCoreParityBugTests.MySqlAttributeReads_ComeBackInKeyOrderLikeOptuna` | **fixed 2026-11-12**: SQLite reads a study's and a trial's attributes `ORDER BY "key"` (the unique `(…, key)` index's BINARY order Optuna's unordered queries come back in) and keeps insertion order in `get_all_studies`, as Optuna's table scan does; the EF Core storage does the same on MySQL (`ORDER BY key`, the column collation's order) and keeps insertion order on PostgreSQL, where Optuna's own order is unstable; the gRPC cross-language page now says so | +| QA-72 | MEDIUM | OptunaHub sampler bridge (`OptunaSharp.Interop.pythonnet`, `OptunaHubSampler`) | The bridge promises to drive a study with "any of the ~85 samplers on hub.optuna.org", but (1) it never forwards `before_trial` / `after_trial` to the Python sampler, and (2) its shadow study, rebuilt for every trial from `create_trial(state, values, params, distributions)`, loses the trial system attributes the sampler writes and never mirrors user attributes, intermediate values or constraints. Native-vs-bridge runs (seed 0, 30 trials, pinned registry): `PSOSampler` builds its swarm in `after_trial`, so through the bridge it never leaves its random phase (differs from trial 11; native trial 11 is `x=0.5201450987386327, y=1.0528363508210972, n=3`); `MoCmaSampler` fails at once with `KeyError: 'mocma:g'` (its generation lives in `trial.system_attrs`); `nsgaii_with_initial_trials` and `speaii` lose their generation bookkeeping (differ from trial 8, `population_size=8`); `implicit_natural_gradient` differs from trial 7; the Optuna team's `AutoSampler` (`samplers/auto_sampler`) differs from trial 1. All of them are reproducible natively. Unaffected: `differential_evolution`, `restart_cmaes`, `levy_flight_sampler`, `nelder_mead`, `tpe_union_multivariate`, `random_search`. 26 registry samplers implement `after_trial`, 25 use system attributes. The class doc lists only "parallel trials are not mirrored" as a limitation. | `Run2OptunaHubBridgeParityBugTests.PsoThroughBridge_BuildsItsSwarmInAfterTrialLikeNativePython`, `Run2OptunaHubBridgeParityBugTests.MoCmaThroughBridge_KeepsTheSystemAttributesItWrites` (interop suite); `OptunaHubNativeParityTests` (12 registry samplers and 6 pruners, native vs bridge, every trial) | **fixed 2026-11-12**: the bridges keep one persistent shadow study per OptunaSharp study (`OptunaHubShadow`), mirroring every trial in number order and in any state (values, params, user and system attributes, intermediate values) and the study's attributes before each call; the sampler forwards `before_trial` / `after_trial` and passes the trial objects Optuna does (`_cached_frozen_trial` updated in place, `_get_latest_trial()`, the stored record); it clears the shadow's per-trial history cache as `Study.ask` does (without it restart CMA-ES, TPE and the GA samplers read a stale history); the shadow carries the study name; attributes the Python object writes are written to the OptunaSharp trial / study (JSON-shaped values). PSO, MO-CMA, nsgaii_with_initial_trials, speaii, implicit_natural_gradient, DE, restart_cmaes, levy_flight, nelder_mead, tpe_union_multivariate, random_search and AutoSampler match native trial for trial, bit for bit. The hub DE's parallel-read pin moved from 49 collisions / 0 history repeats (artifacts of the rebuilt shadow) to 0 / 4, native Optuna's points exactly under the same lockstep | +| QA-73 | MEDIUM | OptunaHub pruner bridge (`OptunaSharp.Interop.pythonnet`, `OptunaHubPruner`) | Same root cause as QA-72 on the pruner side: the shadow study is rebuilt for every `prune` call from `create_trial(state, values, params, distributions, intermediate_values)`, so trial system attributes never survive. Optuna's `SuccessiveHalvingPruner` (re-exported by the registry's `pruners/successive_halving`) writes `completed_rung_N` to the trial and compares the value with the other trials' rung records; through the bridge each trial competes only with itself, is always promotable and is never pruned. `RandomSampler(seed=0)`, 40 trials of a ten-step objective: 36 pruned natively (trials 3 and 4 after step 1), 0 through the bridge; `pruners/hyperband` 31 vs 0. `median`, `percentile`, `wilcoxon`, `threshold` (stateless) agree trial for trial. The bridge's own parity test covers only `pruners/median`. | `Run2OptunaHubBridgeParityBugTests.SuccessiveHalvingThroughBridge_PrunesLikeNativePython` (interop suite); `OptunaHubNativeParityTests.Pruner_ThroughTheBridge_MatchesNativePython` | **fixed 2026-11-12** with QA-72: the pruner's persistent shadow keeps the `completed_rung_N` records; successive halving prunes 36 of 40 (trial 3 after step 1) and Hyperband, median, percentile, Wilcoxon and threshold match native trial for trial; the CI guard of the repro class is gone | +| QA-74 | LOW | EF Core RDB storage (PostgreSQL, MySQL), database errors | Optuna runs every RDB write in `_create_scoped_session`, which turns any SQLAlchemy error other than an integrity error into `StorageInternalError("An exception is raised during the commit. This typically happens due to invalid data in the commit, e.g. exceeding max length. ")`. The EF Core storage lets EF's `DbUpdateException` ("An error occurred while saving the entity changes. See the inner exception for details.") escape, so a `catch (StorageInternalError)` misses it. Measured on MySQL 8.0 / PostgreSQL 16 through the public API: 600-character study name, parameter name, study / trial attribute key (beyond the 512-character columns), and on MySQL a 70,000-character attribute value (beyond `TEXT`) — 9 of 9 cases. No port storage throws `StorageInternalError` anywhere (the type is unused). SQLite enforces no limits on either side. SQLite half (E50): `RDBStorage(url, skip_table_creation=True)` over a database without Optuna's tables raises the same `StorageInternalError` from Optuna's constructor (its version manager reads `version_info` in `_create_scoped_session`), with or without `skip_compatibility_check`; the port constructs the storage and fails on the first read with `SqliteException: SQLite Error 1: 'no such table: studies'.` | `Run2EFCoreParityBugTests.OverLongAttributeKey_RaisesStorageInternalErrorLikeOptuna` (PostgreSQL, MySQL; Testcontainers); `Run2SqliteParityBugTests.SkipTableCreation_OverAnEmptyDatabase_RaisesStorageInternalErrorLikeOptuna` | **fixed 2026-11-12**: the EF Core storage's `Mutate` turns every database error except an integrity error (PostgreSQL SQLSTATE class 23; on MySQL the seven numbers PyMySQL maps to `IntegrityError`) into `StorageInternalError` with Optuna's message, wrapping the provider's error, outside the execution strategy so retries still see transient errors; SQLite under `skip_table_creation` only reads `version_info` and the constructor raises the same `StorageInternalError` on a database without Optuna's tables; `StorageInternalError` gained an inner-exception constructor; both tests pass (MySQL 8.0 and PostgreSQL 16 through Testcontainers) | +| QA-75 | NIT | RDB storages' schema-compatibility error (SQLite, EF Core) | Opening a database whose schema predates the head revision raises `RuntimeError("The runtime optuna version 5.0.0 is no longer compatible with the table schema (set up by optuna 3.0.0). Please execute ...")` in Optuna (`version.__version__`); the port interpolates `OptunaSharpVersion.OptunaCompatibilityTarget`, the constant `"5.0"`, so the verbatim message reads `5.0`. Every other part of the message, the revisions and the `skip_compatibility_check` behaviour match on all ten of Optuna's upgrade-test assets. | `Run2SqliteParityBugTests.OldSchemaDatabase_CompatibilityErrorNamesOptunasFullVersion` | **fixed 2026-11-12**: `OptunaSharpVersion.OptunaCompatibilityTarget` is `"5.0.0"`, Optuna's `__version__`, so the compatibility error names the full version | +| QA-76 | LOW | `LightGBMPruningCallback` (Integration.LightGbm) not-found error | optuna-integration ends the message with `str(env.evaluation_result_list)`, the Python repr (`[('valid_0', 'l2', 100.0, False), ('valid_1', 'auc', 1e-05, True)]`); the port interpolates each score with C#'s default formatting in the current culture: `100`, `1E-05`, and `0,5` instead of `0.5` under de-DE. Names are always single-quoted (Python switches quotes for a name containing `'`) and a cross-validation result prints four elements instead of five. The tuner's alias handling has the same class: the duplicated-aliases warning prints the dict without quotes on strings and `1` for `1.0` (`{'sub_row': 0.5, 'subsample': 1}`, `bagging_fraction=1`; Python `{'sub_row': 0.5, 'subsample': 1.0}`, `bagging_fraction=1.0`, `'x'` quoted), and the metric type error names `Int64` where Python prints `<class 'int'>`. | `Run2LightGbmParityBugTests.MissingMetric_ListsTheResultsInPythonRepr`, `Run2LightGbmParityBugTests.MissingMetric_FormatsScoresWithoutTheCurrentCulture`, `Run2LightGbmParityBugTests.DuplicatedAliases_WarnWithPythonDictRepr`, `Run2LightGbmParityBugTests.NonIterableMetric_NamesThePythonType` | **fixed 2026-11-12**: the not-found message formats every element with `PythonRepr.Repr` (culture-invariant `100.0`, `1e-05`, quote switching), the duplicated-aliases warning prints the dict in repr and the chosen value in `str`, and the metric type error names the Python type (`<class 'int'>`). **Kept**: a cross-validation result still prints four elements — Python's fifth is the standard deviation, which the public `LightGbmEvaluationResult` record does not hold | +| QA-77 | LOW | Warnings (`OptunaWarnings.Warn`) | Optuna raises its warnings with Python's `warnings.warn`: printed to stderr by `warnings.showwarning`, outside `optuna.logging`, once per distinct message and call site under the default filters. The port logs every warning through the `optuna` logger at WARNING level, so (a) `OptunaLogging.SetVerbosity(LogLevel.Error)` — the usual `set_verbosity(ERROR)` to silence the per-trial log — also hides every Optuna warning, which Python still prints, and (b) a repeated warning is printed on every occurrence (five trials with a non-divisible float and int step: Python 2 lines, the port 10). (b) was already noted in the 2026-10-26 release review's LOW list; (a) is new. Scope: Optuna 5.0 has 77 `optuna_warn` call sites (plus 3 direct `warnings.warn`); on Python 3.12 `optuna_warn` passes `skip_file_prefixes` so each warning is attributed to the user's calling line, which is why a loop of trials shows it once. | `Run2WarningParityBugTests.Warnings_FollowTheLoggersVerbosity_SoErrorHidesThem`, `Run2WarningParityBugTests.RepeatedWarning_IsLoggedOnEveryOccurrence` (both `[Misaligned]`) | **kept, [Misaligned] (owner 2026-11-12, "Keep the logger")**: warnings stay on the `optuna` logger, so log handlers see them, `SetVerbosity(Error)` hides them and every occurrence is logged; the two tests pin that and `OptunaWarnings` documents it | +| QA-78 | NIT | `download_artifact` onto an existing directory | Optuna refuses any existing path with `os.path.exists(file_path)`, true for a directory, and raises `FileExistsError("File already exists: <path>")`; the port checks `File.Exists` (false for a directory), opens the directory as a file and fails with `UnauthorizedAccessException("Access to the path '<path>' is denied.")` on Windows. The file case already maps to `IOException("File already exists: …")`. | `Run2ArtifactParityBugTests.DownloadOntoAnExistingDirectory_RaisesFileExistsLikeOptuna` | **fixed 2026-11-12**: `DownloadArtifact`'s existence check covers directories too, as `os.path.exists` does, so a directory at the path raises the `IOException` (Python `FileExistsError`) before anything is downloaded | +| QA-79 | NIT | Multi-objective TPE over PRUNED trials that carry intermediate values | Optuna's `_get_pruned_trial_score` reads `study.direction`, which raises `RuntimeError("A single direction cannot be retrieved from a multi-objective study. Consider using Study.directions to retrieve a list containing all directions.")` on a multi-objective study, so the first TPE trial fails; the port's `TpeTrialSplit.GetPrunedTrialScore` reads `study.Directions[0]` and samples on. Reachable through `add_trial` / `create_trial` or a storage written by another tool (`Trial.report` refuses multi-objective studies on both sides). Measured: 2 objectives, `TPESampler(n_startup_trials=0, seed=0)`, 1 COMPLETE + 4 PRUNED-with-reports added trials, `optimize(n_trials=12)`: Optuna raises from the first `suggest_float`, the port completes 12 trials. | `Run2SamplerParityBugTests.MultiObjectiveTpe_PrunedTrialsWithIntermediateValues_RaisesLikeOptunasDirectionProperty` | **fixed 2026-11-12**: `TpeTrialSplit.GetPrunedTrialScore` reads `study.Direction`, which raises Optuna's `RuntimeError` on a multi-objective study (a NaN report still scores `(-step, inf)` first, as in Python); `TpeSplitCacheTests` now builds one- and two-objective histories (the two-objective one reports NaN) and checks that a raising split is not cached | +| QA-80 | LOW | `CmaEsSampler` whose initial mean lies outside the search space (`x0` outside the ranges; `source_trials` from wider ranges) | cmaes' `CMA` and `SepCMA` constructors assert `_is_valid_bounds(bounds, mean)` ("invalid bounds"), so Optuna's first CMA-ES trial FAILs and `optimize` raises `AssertionError: invalid bounds`; the port's `Cma` and `SepCma` omit the check (only `CmaWm` has it, as `ArgumentException("invalid bounds")`), so the study samples on around an out-of-bounds mean. Measured: `x0={"x": 12.0, "y": 0.5}` over x in [0, 10], plain / separable / `lr_adapt`: Optuna COMPLETE + FAIL and the error, the port 5 COMPLETE (`x0` on the bound is identical); E51 hit it in 3 of 150 warm-start programs. The same constructor's learning-rate assertions are missing too (E53): with `popsize=1` Optuna fails trial 1 with `AssertionError: invalid learning rate for the rank-one update` (separable: `ZeroDivisionError`), the port completes trial 1 with NaN rates and fails trial 2 with ``ValueError: `nan` is invalid value.``. | `Run2SamplerParityBugTests.CmaEs_InitialMeanOutsideTheBounds_FailsLikeCmaesInvalidBoundsAssertion` (plain, separable, `lr_adapt`, `with_margin`); `Run2SamplerParityBugTests.CmaEs_PopulationOfOne_FailsLikeCmaesLearningRateAssertion` (plain, margin, `lr_adapt`, separable) | **fixed 2026-11-12**: `Cma`'s constructor asserts cmaes' four learning rates (negated comparisons, so NaN fails them) and `_is_valid_bounds`; `SepCma`'s asserts `c_sigma`, `cc` and the bounds and raises `DivideByZeroException("division by zero")` at `mu = 0`, Python's `ZeroDivisionError` from its builtin `sum`; `FromState` sets the stored box after the constructor (an unpickled optimizer runs no assertion); all eight variants re-measured in Optuna and pass | +| QA-81 | NIT | `OptunaSearchCV(nJobs: 0)` | optuna-integration stores `self.n_jobs = n_jobs if n_jobs else 1`, so `n_jobs=0` (falsy) runs sequentially like `None`; the port maps only `null` to 1 (`nJobs ?? 1`) and `Fit()` hands 0 to `Study.Optimize`, which throws `ValueError: max_workers must be greater than 0`. Measured: `OptunaSearchCV(RandomForestRegressor(n_estimators=5), {"max_depth": IntDistribution(1, 4)}, n_trials=2, n_jobs=0, random_state=0).fit(X, y)` completes 2 trials with `n_jobs == 1`. | `Run2IntegrationParityBugTests.OptunaSearchCV_NJobsZero_RunsSequentiallyLikeOptunaIntegration` | **fixed 2026-11-12**: `nJobs: 0` maps to 1 (optuna-integration's `n_jobs if n_jobs else 1`), so OptunaSearchCV runs sequentially | +| QA-82 | MEDIUM | BoTorch bridge (`OptunaSharp.Interop.BoTorch`), two-objective qEHVI | For an identical history, the bridge's BoTorch suggestion differs from real `optuna_integration.BoTorchSampler` by up to 3.4e-8 (eighth significant digit of `x`) from the first BoTorch trial on, so seeded trajectories drift: two minimized objectives, `n` in [0, 4], `x` in [0, 1], `n_startup_trials=4`, `seed=0`, with or without `constraints_func`. Both sides are deterministic run to run, torch's thread count does not matter, the candidate-function bodies are verbatim and the startup trials are identical in hex; the replay harness's 16 other configurations (single- and multi-objective, constraints, running trials, mixed int / float qEHVI over wider ranges) stay at 0. Replay variants (04:55–05:06): `n` in [0, 20] 2.6e-8; `x` in [-5, 5] 9.8e-8; `n` suggested before `x` 3.1e-9; only `x` in [-5, 5] with `n` suggested first is identical; full studies differ with either suggestion order. Configuration-dependent; neither the ranges nor the suggestion order alone explain it; the single-objective (LogEI) replay over the same space and order is identical, so it is confined to the multi-objective qEHVI path. With two floats instead (`n` as `FloatDistribution(0, 4)`, same objectives and order) the replay differs by 0.66 — a different suggestion altogether, consistent with the drift flipping the best of the acquisition restarts — hence MEDIUM. Four objectives (analytic EHVI) over the same floats are identical, so it is confined to the Monte-Carlo qEHVI / qLogEHVI path. **Revalidated 2026-11-12:** the divergence shows only in the first BoTorch study of a process. Run alone, the two cases fail exactly as before (3.4232472856388085e-8; 0.6619209926977506); run after another BoTorch study in the same process, both are byte-exact (the two-float case after the int / float one; the int / float case after `MixedIntFloatMultiObjective_Qehvi_ByteExact`). Three runs of the pair in one test process each gave the same result: the int / float case, run first, failed with 3.4232472856388085e-8, the two-float case passed. Native optuna-integration gives the same trials standalone and inside the .NET process (probe `pyexec`), so the process environment is not the cause; the bridge's first study is. Native optuna-integration has no first-study effect of its own: its first and second studies in one Python process are identical, with and without constraints (`bt_twice.py`, 7 trials each, 2026-11-12), although botorch's first use there also tries and fails to build its C++ extension (`torch.utils.cpp_extension`: "Error checking compiler version for cl"). Prime suspect: a one-time lazy initialization botorch performs on first use (it prints "Failed to compile fused qLogEHVI C++ extension") that the bridge's first call goes through differently. A typical program runs one study per process, so the first study is the common case. Root cause not located. | `BoTorchIntegrationParityTests.Run2SmallIntFloatMultiObjective_Qehvi_ByteExact` (3.4e-8) and `Run2TwoFloatMultiObjective_Qehvi_ByteExact` (0.66) (`[OpenBugs]`, `Slow`; Inconclusive under CI; each reproduces only as the first BoTorch study of its test process, so run them one at a time) | open | +| QA-83 | NIT | `CmaEsSampler(x0=...)` missing a search-space parameter | Both sides fail the first CMA-ES trial, with different errors: Optuna's `_SearchSpaceTransform.transform` asserts `name in params` ("Parameter configuration must contain all distributions."); the port's transform indexes the dictionary and lets `KeyNotFoundException` ("The given key 'y' was not present in the dictionary.") escape. Measured: `x0={"x": 5.0}` over `x` and `y`: COMPLETE, FAIL on both, `AssertionError` vs `KeyNotFoundException`; an extra `x0` key is accepted identically. | `Run2SamplerParityBugTests.CmaEs_X0MissingAParameter_FailsWithOptunasTransformAssertion` | **fixed 2026-11-12**: `SearchSpaceTransform.TransformValues` checks every parameter and raises `ArgumentException("Parameter configuration must contain all distributions.")` (it was a `Debug.Assert`, gone from Release builds); the test passes | +| QA-84 | LOW | TPE continuous log density (`MixtureOfProductDistribution.AccumulateContinuous`) | Found 2026-11-11 by plan 15 (after the run). Optuna's `_MixtureOfProductDistribution.log_pdf` sums `_truncnorm.logpdf(...)` over the continuous dimensions with `.sum(axis=-1)`; that array is C-contiguous with the dimensions last, so NumPy reduces each (candidate, kernel) row with its pairwise sum: from eight elements on, eight accumulators `r[j] += t[i + j]`, then `((r0 + r1) + (r2 + r3)) + ((r4 + r5) + (r6 + r7))`, then the remainder left to right. The port adds the terms left to right from +0.0. Measured with Optuna 5.0.0's own `_truncnorm.logpdf` and NumPy 2.4.2 (24 candidates, 300 kernels): the pairwise model matches NumPy in 7,200 of 7,200 entries for 8, 10 and 16 dimensions; the left-to-right sum differs in 2,998 / 2,232 / 3,919 of them. Fewer than eight dimensions sum identically. A ULP-level difference in the log densities (the class of the documented erf divergence) that can only change a trajectory when it flips the acquisition's argmax; not measured to do so yet. | `Run2SamplerParityBugTests.Tpe_ContinuousLogPdf_SumsTheDimensionsPairwiseLikeNumPy` | **fixed 2026-11-12** (`465f91c`, another session): the continuous terms are summed by NumSharp's `np.sum(axis=-1)`, NumPy's pairwise order; the test passes | +| QA-85 | NIT | `PercentilePruner.NanPercentile` (NumSharp 0.80.0 `np.nanpercentile` / `np.percentile`) | Found 2026-11-11 (after the run) by the NumSharp migration. The median of `[0.0, -0.0, -0.0, -1.0]` is `-0.0` in NumPy 2.4.2: its partition leaves the two `-0.0` as the interpolated neighbours. NumSharp interpolates between `0.0` and `-0.0`, and `_lerp`'s `b - (b - a) * (1 - t)` gives `+0.0`; the former sort-based port did the same. Over 600 seeded cases NumSharp matched NumPy's zero sign in all (the sort-based port in 596), so the pattern is rare; no comparison observes a zero's sign, so no prune decision changes. Upstream (NumSharp's partition tie handling). | `PrunerTests.NanPercentile_TiedSignedZeros_KeepNumpysZeroSign` | **fixed by NumSharp 0.81.0** (its QB43 fix: several-kth partitions run NumPy's `introselect_` statement for statement); the test passes and lost `[OpenBugs]` | +| QA-86 | MEDIUM | NSGA-III reference-point association (`NSGAIIIElitePopulationSelectionStrategy`), 8+ objectives | Found 2026-11-11 by the second NumSharp pass. `_associate_individuals_with_reference_points` takes `np.linalg.norm(reference_points, axis=1)` and `np.linalg.norm(objective_matrix[:, None, :] - perpendicular, axis=2)`: `sqrt(add.reduce(x * x, axis))`, NumPy's pairwise sum over the contiguous objective axis. The port summed left to right: identical up to seven objectives, different from eight on, NSGA-III's target regime (54 random populations: 0 of 30 cases from eight objectives bit-identical; the closest indices all equal). The ulp moves the borderline-front survivors: population 20, 200 trials, the trajectory left Optuna's at trial 80 (8 objectives, seed 4) and trial 100 (10 objectives, seed 0); 6 of 8 seeds at 8 objectives stayed identical. Every earlier NSGA-III differential used 2-4 objectives. | `NsgaiiiSamplerParityTests.ManyObjectives_FullState_IsBitIdentical` (live), `NumPyReductionOrderTests.NsgaiiiAssociation_EightObjectives_DistanceIsNumPysPairwiseRowNorm` | **fixed 2026-11-11** (`128761d`): the norms, the axis argmin and the min are NumSharp's (NumPy's order, and a NaN distance wins its row); the 4-operand `einsum` stays a hand port, because NumSharp's `np.einsum` folds pairwise (the `optimize=` path) and matched NumPy in none of the 54 cases | +| QA-87 | LOW | GP search space `_round_one_normalized_param` (`GpSearchSpace.RoundOneNormalizedParam`, both copies) | Found 2026-11-11 by the second NumSharp pass. Optuna rounds a discrete coordinate with `(x - low + 0.5 * step) // step`, NumPy's `floor_divide`, which floors the EXACT quotient (`npy_divmod`); the port used `Math.Floor(a / b)`, the floor of the ROUNDED quotient. On a grid midpoint they pick neighbouring grid points: `0.9 // 0.05` is 17, `Math.Floor(0.9 / 0.05)` is 18 (the double 0.05 is a little over 1/20), so the Sobol'-style point 0.75 on `[-7.82, -6.67]` step 0.05 rounds to -6.970000000000001 in Optuna and -6.92 in the port. 635 of 508,000 random and dyadic points differed. GP sampling rounds 2,048 preliminary points per discrete dimension per trial. | `SamplerParityBugTests.GpSearchSpace_RoundingAGridMidpoint_FloorsTheExactQuotientLikeNumpy` | **fixed 2026-11-11** (`8a7e19e`): NumSharp's `NDDivision.FloorDivDouble`, the `npy_divmod` port | +| QA-88 | NIT | Plotly rank plot colorbar (`PlotlyColors.QuantileSorted`) and parallel-coordinate ticks (`ParallelCoordinatePlot.Linspace`) | Found 2026-11-11 by the second NumSharp pass. `np.quantile` interpolates with `_lerp`, `b - (b - a) * (1 - t)` from `t = 0.5`, where the port used `a + (b - a) * t` (`[-3.3, 0.2]` at 0.75: NumPy -0.675, port -0.6749999999999998; the label's `%g` usually hides it) and ignored the NaN rule; the renderer's private `linspace` lacked NumPy's zero-step branch (QA-54's class). | `PlotlyParityBugTests.RankColorbarQuantile_TopQuartileBetweenTwoValues_InterpolatesLikeNumPysLerp` | **fixed 2026-11-11** (`8a7e19e`): NumSharp's `np.quantile` and `np.linspace` | +| QA-89 | LOW | JANUS (`JanusOptimizer`, `JanusMetric`, MOO parts): matrix products | Found 2026-11-11 by the second NumSharp pass (three-way probe, d = 4 … 100). The reference computes `M @ v`, `Z.T @ y`, `J @ delta`, `np.dot(delta, M @ delta)` and the grams `Z.T @ Z` with BLAS (`Z.T @ Z` through `syrk`); the port's `MatVec` / `MatTVec` / `Dot` loops and `LinAlg.Dot(Transpose(z), z)` over a materialized transpose (gemm) differ from NumPy at every size tested (except `np.dot(g, delta)` below 16 elements). NumSharp's `np.matmul` / `np.dot` with a transposed VIEW match NumPy in all 56 checks, `np.sum(... ** 2)` matches through the pairwise sum. Not changed: the port also restructures the reference's algebra (`solve(A, Zᵀ·Sc)` for `solve(A, Zᵀ) @ Sc`), so JANUS is tolerance-parity by design; bit parity needs its own re-port. | — | open (JANUS re-port) | + +## Directions queue + +Status: `todo` · `in progress` · `done` · `paused (question)`. + +| # | Direction | Status | Notes | +|---|-----------|--------|-------| +| E1 | `master` vs `main` A/B oracle: build one probe against both trees, run the same random programs (every bit-exact sampler, numeric TPE, CMA-ES variants, QMC, storages), any difference is a regression candidate of the plan 13/14 commits | done | 6,400+ programs (in-memory, compact, journal, SQLite; dynamic ranges; up to 200 trials, 10 parameters): identical | +| E2 | Read `adda96c` (`NumPyDraws`): every hand-written draw against numpy's legacy `RandomState` (Gaussian cache shared with NumSharp's state? `uniform` overflow, size-1 ranges, `choice`) | done | read: uniform draws read the bit generator directly, Gaussians and randint still go through NumSharp (cache shared); covered by E1 | +| E3 | TPE kernel widths, observation cache, categorical logs, fused kernel (`db4e46c`, `dfc026f`, `14b4698`, `4464e8a`) | done | read + E1 (TPE programs with dynamic ranges, constraints, MO, batches, `add_trial`): identical to `5e5ba53` | +| E4 | CMA-ES restore once per generation, incremental history fold (`99e9e73`) | done | E1 identical; against Optuna the dynamic-range fuzz found QA-60 (pre-existing, in `5e5ba53` too) | +| E5 | In-place running-trial writes, shared distributions, compact finished trials (`f8df1a5`, `f0d62a0`): snapshot aliasing | done | QA-58 (Optuna's records alias in the other direction) | +| E6 | CachedStorage number-order view (`9043b43`) + SQLite `UNION ALL` (`2dc35cf`) | done | read; E1/E13 storage programs identical; QA-59 found next to it (the `IN` list's variable limit) | +| E7 | Journal sparse offsets (`45fadd1`) against Python's `read_logs` error semantics | done | read side by side: decode-error deferral, partial last line, offsets recorded after decode — faithful | +| E8 | QMC key memo (`a279254`) | done | read: keyed by reference identity of the distributions, falls back to recomputing; E1 identical | +| E9 | Bulk attributes (`53a7a0f`) | done | read: journal writes N single-key records (Python's replay asserts one key per record), batch == loop | +| E10 | Mixed fleets: a Python worker and a C# worker on one journal file / SQLite file at the same time | done | journal 3 + 3 workers (240 trials) and SQLite 2 + 2 (121): clean | +| E11 | Fixes made after the previous run (2026-11-06) on wider inputs | done | QA-14 Wilcoxon (3,000 cases), QA-31 batched QMC, QA-26 parallel coordinates (600 studies), QA-28 importances (250 studies) and QA-24 SHAP (200 studies) clean; QA-2/QA-11 fix → QA-62 (decimal scale) | +| E12 | QA-53 root cause (GP all-NaN acquisition) | done | `GPSampler.ColumnMax` skips NaN (NumPy's `max` returns it); proven by patching Optuna | +| E13 | D116's SQLite half: fresh-seed cross-language storage fuzz into SQLite | done | 270 programs on SQLite / journal through both languages: identical | +| E14 | APIs the previous run did not reach (heartbeat, `get_all_study_names`, `load_study(sampler, pruner)`, logging API, custom NSGA strategies) | done | heartbeat stale recovery across languages clean; study names via QA-67; logging format clean; NSGA strategies via `nsga_custom.py` earlier | +| E15 | New program modes for the fuzz: `interleave` (ask the batch first), dynamic ranges, `add_trial` warm starts, more pruners, 3 objectives, Grid / BruteForce | done | QA-60 (dynamic ranges); everything else identical or a known class | +| E16 | Message inventory: Optuna's raise / warn / log literals present in the port; near-miss template diff | done | QA-59; OptunaSearchCV `verbose` logs and GP's `Optimization failed: {reason}` noted | +| E17 | CLI ask/tell differential with seeded samplers and random search spaces (`cli_fuzz.py`) | done | QA-61 (YAML types); continued as E23 | +| E18 | GP checked by acquisition value (Optuna's `LogEI` at both points) | done | tolerance class | +| E19 | Pruner differential: every constructor parameter, irregular report steps, non-finite values, concurrent trials | done | 700 programs identical | +| E20 | `study.ask(fixed_distributions=...)` and `PartialFixedSampler` around every sampler (fixed parameters pre-suggested at ask time, relative search spaces that include or exclude them) | done | value matrix and 250 programs: known classes only | +| E21 | Study API sequence differential (`apiseq.py`) | done | 750 sequences identical | +| E22 | NSGA-III `reference_points` / `dividing_parameter`; multi-objective and constrained GP; importance evaluator options | done | QA-56 class only; GP structure identical; importances within ULP classes | +| E24 | Four and five objectives (MOTPE hypervolume weights, HSSP; NSGA-II / III) | done | tie class only | +| E23 | CLI differential, second generation (`cli_fuzz2.py`: multi-objective, `best-trials`, `study set-user-attr`, `studies`, `--skip-if-finished`, `delete-study`, `--flatten`, `-f value`) | done | 36 / 40 identical, 4 TPE ULP | +| E25 | Long runs (400–600 trials) and an all-options combined fuzz (800 programs) | done | known classes only | +| E26 | Storage API script (every `BaseStorage` method, invalid ids, finished trials) | done | QA-66 | +| E27 | Extreme objective magnitudes (`vscale`), extreme intermediate values, extreme parameter ranges (`xrange`) | done | known items only (QA-56, 19c, QA-4, QA-27, QA-29); QA-41 found fixed by `adda96c` (its `[OpenBugs]` test passes) | +| E28 | OpenBugs sweep: run every `[OpenBugs]` test, list the ones that pass | done | QA-41 and QA-42 fixed in passing (3 tests pass); Cli 8 / Storage 3 still fail | +| E29 | `constraints_func` + `set_constraint` mix; CMA-ES `x0`; CLI special values; long bit-exact runs; net8.0 build of the probe; CLI on journal files; negative seeds | done | known items only (QA-35, QA-37, QA-56 frequency, QA-60) | +| E30 | Static sweep: unstable sorts, `Dictionary` removal order and Python `set` iteration order in Optuna-ported code | done | QA-67, QA-68 | +| E31 | gRPC storage proxy: storage script through the four client / server language pairs; random-program fuzz with a `grpc` storage | done | QA-69; QA-66 extended (client messages) | +| E32 | Beyond-core samplers against their OptunaHub counterparts (MOEA/D, DE, PSO, TuRBO; JANUS already has a byte-parity gate) | paused (question) | QA-70, Q7 | +| E33 | Dict-order round trips of every trial / study dictionary through memory, journal, SQLite (template trials, scrambled API order, reloads) | done | QA-71 | +| E34 | OptunaHub sampler bridge: hub samplers natively vs through `OptunaHubSampler` (seeded, pinned registry) | done | QA-72 | +| E35 | OptunaHub pruner / problem bridges the same way | done | QA-73 (pruner); problem constraints already have `OptunaHubConstraintParityTests` | +| E36 | MySQL / PostgreSQL through Optuna's RDB and the EF Core storage: dict order, the storage script, column limits | done | QA-74; QA-71 extended to MySQL | +| E37 | Artifacts across languages (upload in one, metadata + download in the other) | done | clean; Windows-registry MIME note (Q2 decision) | +| E38 | Redis journal backend: random programs and the storage script in both languages | done | clean (in-memory classes and QA-66 only) | +| E39 | OptunaHub problem bridge: benchmark problems natively vs through `OptunaHubProblem` | done | clean (5 packages) | +| E40 | Old-schema databases opened without upgrading (ten upgrade-test assets, with / without the compatibility check) | done | QA-75 | +| E41 | Integration and Core messages: interpolated numbers vs Python repr / culture (static grep + optuna-integration read) | done | QA-76 | +| E42 | Other Python bridges: OptunaHub value marshalling, BoTorch vs optuna-integration | done | clean | +| E43 | Mixed Python / C# fleets through a gRPC proxy server of each language | done | clean | +| E44 | The three Redis clients through the storage script | done | clean (QA-66 only) | +| E45 | How warnings reach the user: repetition and verbosity vs Python's `warnings` module | done | QA-77 | +| E46 | Mixed Python / C# CMA-ES, NSGA-II and Grid fleets on one journal (cross-language sampler state under concurrency) | done | clean | +| E47 | Filesystem existence checks (`os.path.exists` / `isfile`) vs the port's | done | QA-78 | +| E48 | Three-objective fuzz (800 programs) and the root cause of its 26 structural TPE first differences | done | splits identical (`split_check.py` / probe `splitcheck`); the documented `[Misaligned]` argsort tie-order class (≥ 26 above observations, tied log-int values); NSGA-III P170 = QA-56 | +| E49 | `study.direction` reads Optuna makes where the port reads `Directions[0]` | done | QA-79 | +| E50 | RDB construction over an uninitialized database (`skip_table_creation`, `skip_compatibility_check`) | done | QA-74 extended to SQLite | +| E51 | Warm-Starting CMA-ES (`source_trials`) differential | done | 142 / 150 identical, 5 CMAwM ULP, 3 → QA-80 | +| E52 | Fresh-seed combined fuzz, 2,000 programs (`big3`) | done | known classes only (QA-56, QA-60, CMAwM ULP, TPE ULP / argsort, `lru_cache` process state) | +| E53 | cmaes constructor assertions vs the port's CMA classes; `create_trial` validation messages | done | QA-80 extended (learning rates at `popsize=1`); validation messages identical | +| E54 | Constructor-validation matrix for every pruner and sampler | done | clean (86 cases; strings for resources and seeds ≥ 2^31 not representable) | +| E55 | Use-after-finish operations on told trials; `best_trial` ties across storages | done | clean | +| E56 | Optuna's journal log compatibility asset (`4.0.0.dev.log`) | done | clean | +| E57 | PyCma bridge vs optuna-integration with `cma==4.4.4` from a scratch `PYTHONPATH` | done | clean (80 trials; `seed=0` is clock-seeded in pycma on both sides) | +| E58 | Distribution construction errors, step adjustments and their warnings | done | clean (warning channel = QA-77) | +| E59 | `OptunaSearchCV` against optuna-integration (objective, stored attributes, seed, argument normalization) | done | QA-81 | +| E60 | Zero / negative / empty arguments in `optimize`, `create_study`, `get_trials` | done | clean | +| E61 | Fresh-seed batched + interleaved fuzz, 900 programs, no NSGA | done | known classes only; one more QA-66 occurrence (`grid_id` KeyError) | +| E62 | Terminator constructor validations and deprecation points | done | clean | +| E63 | BoTorch bridge, multi-objective (qEHVI) with a small int and a float, with / without constraints | done | QA-82 | +| E64 | Progress bar with `n_trials=0`; CMA-ES `x0` missing / extra parameters | done | QA-83 | +| E65 | Grid outside its grid, NaN constraints, catch-all with TrialPruned, cross-type equal categorical choices | done | clean | + +## Questions for the owner + +| # | Question | Blocks | +|---|----------|--------| +| Q7 | QA-70: `MoeaDSampler`, `DifferentialEvolutionSampler`, `PsoSampler` and `TurboSampler` have OptunaHub counterparts (`samplers/moead`, `differential_evolution`, `pso`, `turbo`) the ports do not follow. Should they become ports of those packages (names, parameters, defaults, seeded trajectories), stay paper / pymoo ports with corrected headers, or exist side by side? | answered 2026-11-12: keep the paper / pymoo ports and correct the headers and docs (name the OptunaHub package, what each port follows instead, a parameter map) | +| Q6 | QA-69: through Optuna's `GrpcStorageProxy` every trial dictionary comes back in Python protobuf's (upb) hash order, which changes QMC and BruteForce trajectories. Reproduce that order in the port's client (upb's map layout for each key set), or keep the order every other storage has and mark the tests `[Misaligned]`? | answered 2026-11-12: keep insertion order; the two repros become `[Misaligned]` and the gRPC docs explain Optuna's upb order (owner's note: NumSharp has a `ConcurrentOrderedDictionary`) | +| Q5 | QA-65: Optuna's `--log-file` never receives a record (its file handler sits on the root logger, the `optuna` logger does not propagate). Copy that, as QA-46's slice-plot defect was copied, or keep the port's working log file? | answered 2026-11-12: copy Optuna (the file is created and stays empty), as QA-46 was copied | +| Q4 | QA-57: should the genetic samplers' running-trial redraw (plan 12) stay on for single-threaded batched ask/tell, where Optuna's seeded trajectory is otherwise reproduced exactly? At least the partial-child comparison (a mutated parameter is sampled per trial, so two partial children are not one point) looks unintended. | answered 2026-11-12: thread-aware redraw: a running trial's child is redrawn only when another thread asked for it, so a single caller's batch matches Optuna | +| Q3 | The task names a `strings` branch; the repository has only `main` and `master` (`master` is 39 commits behind `main`). This run tests `main` and reviews `master..main` as "the difference between the branches". If another branch was meant, say which. | answered 2026-11-12: `strings` was NumSharp's branch, which has since become `journey5` (checked against OptunaSharp on 2026-11-12: catalog Open item 36); nothing more to review here | diff --git a/docs/releases/RELEASE_1.1.0.md b/docs/releases/RELEASE_1.1.0.md new file mode 100644 index 0000000..e88a553 --- /dev/null +++ b/docs/releases/RELEASE_1.1.0.md @@ -0,0 +1,111 @@ +# OptunaSharp 1.1.0 - Performance & Parity Release + +1.1.0 is the same Optuna 5.0.0, faster and closer. Three performance passes made every sampler family cheaper in time and memory while its seeded trials stayed bit for bit what they were: random search and CMA-ES run 5x to 10x faster than 1.0.0 and allocate a fifth to a sixth of the memory. +A second eight-hour parity QA run against Optuna 5.0.0 found 28 more differences; 23 are fixed and the rest documented. The arithmetic Optuna leaves to NumPy now runs through NumSharp, so hypervolume, NSGA-III at eight and more objectives and the GP's grids match Optuna bit for bit. +It builds on NumSharp 0.81.0, whose OpenBLAS is NumPy 2.5.4's, so the bit-for-bit target is Optuna running on NumPy 2.5.4. + +### 🧭 Overview +- **Faster than 1.0.0 on the same seeds** - random search `x5.3->x8.1`, CMA-ES `x5.3->x10.3` (100,000 trials 988 s -> 27.5 s), QMC `x4.1->x6.0` (scrambled Sobol `x12.1->x16.8`), NSGA-II `x2.3->x3.2`, TPE `x1.5->x3.4`, multi-objective TPE `x1.7->x2.3`, GP `x1.5->x1.6`, with 4.0x to 21x less memory allocated; random, QMC, NSGA-II and GP give 1.0.0's trials bit for bit, and CMA-ES's follow NumPy 2.5.4's OpenBLAS. +- **Parity QA run 2 against Optuna 5.0.0** - 28 findings (QA-56 ... QA-83): 23 fixed on the owner's decisions, 3 kept as documented divergences, 2 deferred; the performance and NumSharp passes added QA-84 ... QA-89, of which QA-84, 86, 87 and 88 are fixed. + - OptunaHub bridges - a persistent shadow study: 12 registry samplers (PSO, MO-CMA, SPEA-II, AutoSampler, ...) and 6 pruners (successive halving, Hyperband, ...) give native Optuna's trials, bit for bit. + - Optuna's exception types and messages in the storages, the CLI, CMA-ES and the LightGBM integration; CPython's own `list.sort` and set order where Optuna's results depend on them. +- **NumPy's arithmetic through NumSharp** - Optuna's `np.dot`, reductions, NaN-aware `argmax` / `max`, `floor_divide`, `isclose` and `clip` now compute as NumPy does: hypervolume, HSSP and UNDX are bit-exact, NSGA-III matches from eight objectives on, and the GP's grids and rounding are NumPy's. +- **NumSharp 0.81.0** - the numeric backbone moves from 0.80.0: its OpenBLAS is NumPy 2.5.4's, so BLAS- and LAPACK-backed results (CMA-ES's eigendecomposition, UNDX, xNES, JANUS) match Optuna on NumPy 2.5.4 bit for bit; QA-85 is fixed upstream; Python's `OverflowError`, `ZeroDivisionError`, `FileExistsError` and `FileNotFoundError` are raised where Optuna raises them. +- **New opt-ins** - compact finished trials (100,000 CMA-ES trials retain 257 MB instead of 1,287 MB), batch attribute writes, and CMA-ES's `reuseToldOptimizer`. +- **Binary-compatible with 1.0.0** - ApiCompat against the nuget.org 1.0.0 packages finds no removed or changed API in any of the 20 packages; the behavior changes (Optuna's and Python's exception types, seeded results moving toward Optuna's, BLAS-backed results following NumPy 2.5.4) are listed under Breaking Changes. +- **48 parity fixes, 18 measured speedups and 14 behavior changes** - every line traced to the 52 commits it cites, of the release's 146; 2,309 unit tests on net8.0 and net10.0, 751 live-Optuna interop tests against NumPy 2.5.4. + +## Detailed Breakdown +<details> + <summary>Show All</summary> + +### 📊 Dashboards & Docs +- **[Performance and Compatibility](https://scisharp.github.io/OptunaSharp/docs/performance.html)** - new guide: what is fast and why seeded results stay the same, the before/after tables of the three passes, start-up time (ReadyToRun, TieredPGO), the switches that change results, compact finished trials, batch attribute writes and thread safety. +- **[OptunaHub](https://scisharp.github.io/OptunaSharp/integrations/python/optunahub.html)** - "Compatibility and state" rewritten for the persistent shadow study, with the samplers and pruners measured against native runs and the limits that remain. +- **Method pages** - [MOEA/D](https://scisharp.github.io/OptunaSharp/docs/methods/moea-d.html), [differential evolution](https://scisharp.github.io/OptunaSharp/docs/methods/differential-evolution.html), [PSO](https://scisharp.github.io/OptunaSharp/docs/methods/pso.html) and [TuRBO](https://scisharp.github.io/OptunaSharp/docs/methods/turbo.html) name their OptunaHub counterparts and map their parameters to them. +- **[Getting Started](https://scisharp.github.io/OptunaSharp/docs/getting-started.html)**, the **[FAQ](https://scisharp.github.io/OptunaSharp/docs/faq.html)** and the package README - OptunaSharp needs dynamic code: it does not run under NativeAOT, and a .NET 10 file-based app needs `#:property PublishAot=false`, with the error it fails with otherwise. +- **[Parity QA journal, 2026-11-10](https://github.com/SciSharp/OptunaSharp/blob/main/docs/qa/PARITY_QA_2026-11-10.md)** - the second QA run: every finding with its repro test and fix, the 65 directions worked, the clean areas and the techniques. +- **[Six real-world examples](https://github.com/SciSharp/OptunaSharp/tree/main/examples)** - container loading stopped at a provable bound, a journal shared by three processes under Hyperband, a churn scorecard ended by the Terminator, pricing with C# and Python workers over the gRPC proxy, building energy through `OptunaSearchCV`, concrete mix design with `GPSampler` and constraints. + +### ✨ New APIs & Modules +- `InMemoryStorage(compactFinishedTrials: true)` - opt-in compact records for finished trials: the same trials bit for bit, a fraction of the memory (100,000 CMA-ES trials over 40 floats retain 257 MB instead of 1,287 MB, 100,000 NSGA-II trials 88 MB instead of 671 MB) - `f0d62a0`. +- Batch attribute writes - several attributes in one lock or one transaction, the same result as the single-key loop, and a rejected batch writes nothing - `53a7a0f`. + - `SetTrialUserAttrs`, `SetTrialSystemAttrs`, `SetStudyUserAttrs`, `SetStudySystemAttrs` - on `BaseStorage`, virtual, so a third-party storage gets the loop unchanged. + - `Trial.SetUserAttrs`, `Study.SetUserAttrs` - the trial and study forms. + - `SetUserAttr(IReadOnlyDictionary)`, `SetTrialSystemAttr(int, IReadOnlyDictionary)` and the rest - Optuna-named overloads of each. + - The journal storage writes a batch as single-key records Python Optuna replays; SQLite and EF Core write it in one transaction. +- `CmaEsSampler(reuseToldOptimizer: true)` - opt-in: the optimizer that told a generation keeps answering, about 15 % faster on a 40-D study, but seeded runs stop matching Python Optuna from about the third generation; off by default, and 1.0.0's constructor signature is kept for binary compatibility - `99e9e73` (+ `4d4151e`). +- `StorageInternalError(message, innerException)` - the `raise ... from e` form the EF Core and SQLite storages now raise - `3009c4a`. + +### ⚡ Performance +*Ratios are 1.0.0 ÷ 1.1.0 time - higher is better (`x2` = twice 1.0.0's speed); `xLOW->xHIGH` spans the cold run (JIT included) and the warm one. Measured 2026-11-14 with the published 1.0.0 package against the 1.1.0 candidate on NumSharp 0.81.0: Release, 40 floats unless stated, seed 0, best of two alternating rounds on a shared i9-13900K. Every line keeps seeded results bit for bit unless it says otherwise.* +- `x5.3->x8.1` - `RandomSampler`, 10,000 trials: NumSharp draws no longer reach the finalizer, which had turned almost every gen-0 collection into a gen-1; 3.6 GB -> 0.67 GB allocated - `adda96c` (+ `9d94a6a`). +- `x5.3->x10.3` - `CmaEsSampler`, 10,000 trials: the stored optimizer restored once per generation and the history folded incrementally (Optuna rescans every trial on every ask); 10.9 GB -> 1.7 GB; at 100,000 trials 988 s -> 27.5 s (`x35.9`); the trials follow NumPy 2.5.4's OpenBLAS (see Breaking Changes) - `99e9e73` (+ `cc1e4f3`, `9d3285f`). +- `x4.1->x6.0` - `QMCSampler`, 10,000 trials: the sample-id key computed once per search space; 3.7 GB -> 0.49 GB - `a279254`. +- `x12.1->x16.8` - scrambled Sobol (`QMCSampler(scramble: true)`), 4,000 trials over 10 floats: the engine built once and each point computed directly (every trial regenerated all earlier points); 1.26 GB -> 60 MB - `5440021`. +- `x2.3->x3.2` - `NSGAIISampler`, 10,000 two-objective trials: a running trial nobody reads is written in place, and the draws are disposed; 2.9 GB -> 0.72 GB - `f8df1a5` (+ `adda96c`). +- `x2.7->x3.4` - `TPESampler`, 1,000 trials: a fused scoring kernel, exact O(n) kernel widths, a cache of finished observations, one split per trial; 4.4 GB -> 0.81 GB; includes the cost of the QA-84 parity fix, and the trials move toward Optuna's (see Breaking Changes) - `4464e8a`, `db4e46c`, `14b4698`, `2189a12`, `ca6723d`, `5019c5d`, `8b0fb61`. + - `x1.5->x2.3` - over 10 floats, QA-84's costliest case (that fix alone made it 27-66 % slower than the code before it); 1.3 GB -> 0.26 GB. + - `x1.7->x2.3` - multi-objective, 300 trials; 2.4 GB -> 0.34 GB. +- `x1.5->x1.6` - `GPSampler`, 150 trials over 10 floats: triangular solves swept over every right-hand side, fused Cholesky solves, the fit's scratch reused; 5.9 GB -> 1.3 GB, gen-2 collections 7x to 9x fewer - `cebb1c9` (+ `9533366`). +- Measured in the passes, against each pass's own baseline (same trials): + - `x1.4` - `BruteForceSampler`, a 4,320-point grid: one path buffer per tree rebuild, candidate lists cached per exact progression; 13,965 MB -> 5,446 MB - `c78c0ab`. + - `x1.08` - TuRBO, 120 trials: the GP fit's solves and scratch from `GPSampler`; 1,857 MB -> 1,215 MB - `9533366`. + - SMS-EMOA and MOEA/D allocate 42-43 % less over 2,000 trials (population members found by binary search, not dictionaries rebuilt per ask) - `66f83d4`, `8c52e7c`. + - SNES, xNES and OpenAI-ES allocate 57-69 % less (attribute keys built once, stored states parsed once per generation) - `882a043`, `adc76c2`. + - DE, PSO, LM-CMA and VkD-CMA allocate 28-37 % less (stored states parsed once per generation, history lists sized up front) - `9edc1d4`, `af20df1`, `4367338`. +- `x1.35` - SQLite storage, a study with a stale running trial: the refresh is two indexed halves joined by `UNION ALL` instead of an `OR` scan (8,000 trials 13.0 s -> 9.6 s) - `2dc35cf`. +- `x1.4->x1.5` - SQLite and EF Core, loading a study: each distribution text parsed once per load (10,000 trials 2.1 s -> 1.4-1.5 s, 1.22 GB -> 479 MB) - `9043b43`. +- Journal file backend - sparse line offsets: a 4.3-million-line journal keeps 0.1 MB of offsets instead of 160 MB - `45fadd1`. +- `x1.14` - `optunasharp` CLI: TieredPGO off for its short processes, an `ask` + `tell` cycle 1,794 ms -> 1,578 ms - `27269b1`. + +### 🎯 Parity & Fixes +- `NSGAIIISampler` - a front whose niche distances are NaN (infinite objective values) is sorted by a port of CPython 3.12's `list.sort`, so the elite population is Optuna's (5 of 8 long fuzz runs had left Optuna's trajectory) - `16a7f9e` (QA-56). +- `NSGAIISampler`, `NSGAIIISampler` - a batch asked on one thread before it is told, Optuna's batch-optimization pattern, gets Optuna's children: the duplicate guard redraws only against children another thread holds - `3809bae` (QA-57). +- `GridSampler` - unvisited grids come in CPython's set-iteration order when the study's numbering is shifted (added or enqueued trials, a resumed study), and an empty value list fails with NumPy's `choice` message - `16a7f9e`, `8a7e19e` (QA-68, QA-55). +- `CmaEsSampler` - fails where Optuna and cmaes fail: `with_margin` over a conditional or changing search space (NumPy's tell shape errors; it sampled on with coordinates of other parameters), an initial mean outside the bounds and `popsize=1` (cmaes' assertions), an `x0` missing a parameter - `1e8aba6` (QA-60, QA-80, QA-83; with them run 1's QA-17 and QA-34, whose repro tests run in CI again - `5b0e4fd`). +- `OptunaHubSampler`, `OptunaHubPruner` - one persistent shadow study per OptunaSharp study, mirroring every trial and forwarding `before_trial` / `after_trial`: PSO leaves its random phase, MO-CMA no longer fails with `KeyError: 'mocma:g'`, and successive halving and Hyperband prune 36 and 31 of 40 trials as natively (0 before) - `ed754e4` (QA-72, QA-73). +- SQLite storage - the cached refresh falls back like Optuna's past SQLite's variable limit (a study with 33,000 running trials below a finished one could not be read), and attributes come back in key order as Optuna's index scans return them, on MySQL too - `16a7f9e` (QA-59, QA-71). +- In-memory and journal storages - studies list in creation order after deletions, as Python's dicts keep them - `16a7f9e` (QA-67). +- Optuna's error types and messages - a missing parameter's `KeyError` and the empty `DuplicatedStudyError` (QA-66), `StorageInternalError` from database errors (QA-74), `5.0.0` in the schema-compatibility error (QA-75), LightGBM messages in Python's repr under any culture (QA-76), `DownloadArtifact` onto a directory (QA-78), multi-objective TPE's `study.direction` error (QA-79), and `OptunaSearchCV(nJobs: 0)` runs one job (QA-81) - `3009c4a`. +- `optunasharp` CLI - `-f yaml` is PyYAML's `safe_dump` byte for byte (763-case oracle: floats stay floats, datetimes stay strings, and Windows line ends are no longer doubled), `tell --state fail|pruned` without `--values` finishes the trial, structured `--sampler-kwargs` (`GridSampler`'s `search_space`, `CmaEsSampler`'s `x0`, `NSGAIIISampler`'s `reference_points`) construct the sampler - `d510728` (QA-61, QA-63, QA-64, QA-36); `--log-file` stays empty, as Optuna's does - `3809bae` (QA-65). +- `TPESampler` - the continuous log density sums its dimensions in NumPy's pairwise order; with 8 or more continuous parameters sampled jointly, 31-54 % of the log densities had differed in the last bit - `465f91c` (QA-84). +- `TPESampler`, `CmaEsSampler(withMargin: true)` - `expm1` is NumSharp's model of the UCRT routine NumPy calls, so the truncated normal's quantiles come closer to Optuna's (bit-identical 44 % -> 59 %) - `0e18eba`. +- Hypervolume, HSSP and UNDX - Optuna's 1-D `@`, `np.dot` and `np.linalg.norm` go through NumSharp's OpenBLAS `ddot` / `dgemv`: 37 of 240 volumes and 3 of 240 HSSP selections had differed by an ulp, now none - `c600736`. +- NumPy's reduction order - the terminator's cross-validation variance (QA-22), multi-objective `GPSampler` standardization, the percentile pruner's zero signs, the EDF grid (QA-54), AGE-MOEA-2's row norms and JANUS's component mean go through NumSharp's `np.var`, `np.mean`, `np.std`, `np.nanpercentile`, `np.linspace` and `np.linalg.norm` - `156ce8a`. +- `NSGAIIISampler` - from eight objectives on, the reference-point association uses NumPy's pairwise row norms (8- and 10-objective runs had left Optuna's trajectory at trials 80 and 100) - `128761d` (QA-86). +- `GPSampler` - stepped grids are NumPy's `arange` (the top point of 0.1 to 1.0 by 0.3 was 0.9999999999999998), grid rounding is NumPy's `floor_divide`, and an overflowed LogEI threshold propagates NaN as NumPy's `max` does - `8a7e19e` (QA-49, QA-87, QA-53). +- NumPy's NaN and tie rules - `argmax` / `max` ports in TPE, GP, HSSP and the terminators, `enqueue_trial(skip_if_exists)` comparing infinities like `np.isclose`, stepped floats clipping to a `-0.0` bound like `np.clip`, TPE's `weights` errors printing arrays like NumPy, and the Plotly rank colorbar's quantiles - `8a7e19e` (QA-29, QA-50, QA-30, QA-48, QA-88). +- NumSharp 0.81.0 - its OpenBLAS is NumPy 2.5.4's scipy-openblas 0.3.34.106.0, so CMA-ES's eigendecomposition, UNDX's dot products and norms, xNES and JANUS match Optuna on NumPy 2.5.4: the 57 BLAS-backed live parity cases pass, 14 of which fail against NumPy 2.4.2 - `9d3285f`. +- `PercentilePruner`, `MedianPruner` - the median of tied signed zeros is NumPy's `-0.0` (NumSharp 0.81.0's several-kth partition is NumPy's `introselect_`) - `9d3285f` (QA-85). +- Python's exception classes, now that NumSharp 0.81.0 ships them - `OverflowError` for a non-finite float range (NumPy's `uniform`), `str.format` and URL integer and timeout limits; `ZeroDivisionError` for separable CMA-ES with `popsize=1`; `FileExistsError` from `DownloadArtifact`; `FileNotFoundError` for missing TLS certificate files - so a failed trial logs Optuna's own line, e.g. `ZeroDivisionError('division by zero')` - `9f77939`, `9d3285f`. +- Journal file lock (Windows) - a lock file deleted in place (delete pending) is waited out for at most 1 s instead of failing with `UnauthorizedAccessException` - `4ae4a1f`. + +### 🧰 Testing & Tooling +- A second eight-hour parity QA run against Optuna 5.0.0 - 65 directions, tens of thousands of random programs over every bit-exact sampler and storage, mixed Python and C# fleets; each of its 28 findings got a repro test - `4b65852`. +- New committed oracles, replayed with no Python - CPython 3.12's `list.sort` and set order (624 cases), PyYAML's `safe_dump` (763), NumPy's scalar `log1p` / `expm1` / `logaddexp` (527, win-amd64) - `16a7f9e`, `d510728`, `0e18eba`. +- `OptunaHubNativeParityTests` - each registry sampler and pruner run natively and through the bridge in one interpreter, every trial compared - `ed754e4`. +- Every performance change gated byte for byte - a 36-study hash probe over every sampler family after each step, unit pins against the replaced code, and new live-Optuna gates (random search through `repr`, QMC 40-parameter full state, a 250 x 40 journal replay, SQLite's cached refresh, hypervolume and HSSP over 240 fronts, NSGA-III at 8 and 10 objectives) - `adda96c`, `a279254`, `45fadd1`, `2dc35cf`, `c600736`, `128761d`. +- Binary compatibility checked with ApiCompat against the nuget.org 1.0.0 packages; the one break it found, `CmaEsSampler`'s constructor, is restored - `4d4151e`. +- NumPy 2.5.4 is the live oracle's NumPy - CI and the package-parity container pin it with NumSharp 0.81.0, the CMA-ES pickle oracle is regenerated under it, and the interop harness restores `np.row_stack` for the pinned pymoo 0.6.1.3 (NumPy 2.5 removed it; pymoo 0.6.2 changed AGE-MOEA-2's arithmetic, so 0.6.1.3 stays the oracle) - `9d3285f`, `8e7418e`. +- `SequentialProductTests` - the hand-written hypervolume and fANOVA products, kept for speed, pinned bit for bit to NumSharp 0.81.0's `np.prod` (800 random cases) - `784f495`. +- CI forces OpenBLAS's Haswell kernels, the ones the committed linalg oracles were captured on, everywhere but Windows on AMD CPUs with AVX-512: there NumSharp 0.81.0's OpenBLAS 0.3.34 running forced Haswell kernels faults (an access violation in JANUS-DE's quadratic chart on Zen 4 and Zen 5 runners, while OpenBLAS's own kernel choice and 0.3.31 pass, and Linux on Zen 4 passes with the pin), so OpenBLAS chooses and the Haswell-captured oracles report Inconclusive. A Windows process that sets `OPENBLAS_CORETYPE=Haswell` on such a CPU meets the same fault - `4cbbef1`. +- REMBO's 16-worker no-repeat check, which failed 2 of about 45 CI runs, is now `[OpenBugs]`, beside a one-worker reproduction: `RandomEmbeddingSampler` evaluates a point twice one trial at a time too (82 of 120 seeds of the check's objective). It reaches one corner of the box from latent points the projection clips there, and it proposes a confident GP's incumbent again. A trace of 13,200 concurrent proposals found no lost read, so the cause is the optimizer, not the threading - `6bed3d7`. + +### 💥 Breaking Changes +- `BaseStorage.GetTrialParam` (and the in-memory, journal, cached and gRPC-proxy storages) raises `NumSharp.KeyError` for a parameter the trial lacks (was `KeyNotFoundException`, which `KeyError` does not derive from): catch `KeyError` - `3009c4a`. +- The EF Core storage raises `StorageInternalError` wrapping the provider's exception for a database error other than an integrity error (was `DbUpdateException`); the SQLite storage with `skipTableCreation` over a database without Optuna's tables raises it from the constructor (was a `SqliteException` on the first read) - `3009c4a`. +- `DownloadArtifact` onto an existing directory raises `FileExistsError` ("File already exists", an `IOException`) before downloading (was `UnauthorizedAccessException`) - `3009c4a`, `9f77939`. +- Multi-objective `TPESampler` over PRUNED trials that carry numeric reports raises Optuna's `RuntimeError` (it sampled on) - `3009c4a`. +- `CmaEsSampler` raises where cmaes asserts or NumPy fails (`ArgumentException`, `ValueError`, `ZeroDivisionError` for separable CMA-ES with `popsize=1`) instead of sampling on, and an `x0` missing a parameter raises `ArgumentException` (was `KeyNotFoundException`) - `1e8aba6`, `9f77939`. +- Seeded results move toward Optuna's, so a run that reproduced a 1.0.0 run bit for bit changes: `TPESampler` (through `expm1`; with 8 or more jointly sampled continuous parameters also through QA-84), CMA-ES with margin, NSGA-III with infinite objective values or 8 or more objectives, `UNDXCrossover` over many parameters, `GridSampler` with shifted numbering, multi-objective `GPSampler` and stepped GP grids, and NSGA-II / NSGA-III batches asked on one thread; AGE-MOEA-2 at 8 or more objectives moves toward pymoo's, and a hypervolume can differ from 1.0.0's by an ulp. Random, QMC, NSGA-II with its default crossover and single-objective `GPSampler` over floats give 1.0.0's trials bit for bit - `0e18eba`, `465f91c`, `c600736`, `16a7f9e`, `128761d`, `156ce8a`, `8a7e19e`, `3809bae`. +- BLAS- and LAPACK-backed seeded results follow NumPy 2.5.4's OpenBLAS (NumSharp 0.81.0): CMA-ES's eigendecomposition, xNES, `UNDXCrossover` and JANUS can differ from 1.0.0 in the last bits (5 of 36 seeded probe studies moved). They match Optuna on NumPy 2.5.4, and no longer match it on NumPy 2.4.2 - `9d3285f`. +- Python's exception classes from NumSharp 0.81.0 replace .NET stand-ins: `OverflowError` (a non-finite float range, `str.format`, URL integer and timeout limits), `ZeroDivisionError`, `FileExistsError` and `FileNotFoundError` (TLS certificate files). `OverflowException`, `DivideByZeroException` and `FileNotFoundException` are not their bases: catch the Python class, or `ArithmeticException` / `IOException` - `9f77939`, `9d3285f`. +- OptunaSharp depends on NumSharp 0.81.0 (was 0.80.0), whose own breaking changes reach code that calls NumSharp directly (NumPy's signatures, Python exception classes, read-only scalars); see NumSharp's 0.81.0 notes - `9d3285f`. +- Orders follow Optuna's - studies list in creation order after deletions (in-memory and journal storages), and the SQLite and MySQL storages read attributes in key order, so `get_all_artifact_meta` on SQLite lists artifacts by id - `16a7f9e`. +- `optunasharp` CLI - `-f yaml` writes PyYAML's output (floats keep their decimal point, datetimes and some keys are quoted differently; the YamlDotNet dependency is gone), `--log-file` creates the file and writes nothing (redirect stderr to keep a log), and `tell` without `--values` passes no values - `d510728`, `3809bae`. +- `OptunaSharpVersion.OptunaCompatibilityTarget` is `"5.0.0"` (was `"5.0"`) - `3009c4a`. +- The OptunaHub bridges write the attributes a hub sampler or pruner sets (`mocma:g`, `completed_rung_N`, PSO's swarm) to the OptunaSharp trial and study, as a native run stores them - `ed754e4`. +- The Windows journal lock reports a lock path that stays denied (an unwritable directory, a directory at the lock path) after 1 s instead of at once - `4ae4a1f`. + +</details> diff --git a/docs/website-src/docs/distributions.md b/docs/website-src/docs/distributions.md index 4302d79..d75e62a 100644 --- a/docs/website-src/docs/distributions.md +++ b/docs/website-src/docs/distributions.md @@ -96,6 +96,15 @@ Prefer the modern types. from `1` when mapping a value back to its internal index — the choices collapse under Python equality. This is an accepted upstream behavior, reproduced deliberately and pinned by tests. +**Divergence (kept on purpose).** When a stepped `FloatDistribution`'s range is not divisible by its step, Optuna +lowers `high` to the last grid point with Python's `Decimal` (28 *significant* digits). OptunaSharp uses .NET +`decimal` (28 digits *after the point*, nothing below `1e-28`), and the owner chose on 2026-11-12 to keep it. Ordinary +ranges come out identical. Only tiny magnitudes differ: a bound or step whose shortest repr needs more than 28 decimal +places (a 17-digit value below about `1e-11`) can leave `high` one ULP from Optuna's and `BruteForceSampler`'s grid one +point longer; a bound below `1e-28` counts as zero; and a range whose step count needs more than 28 digits, such as +`(0, 1e20, step: 1e-9)`, is accepted where Optuna raises `decimal.InvalidOperation`. The `FloatDistribution` API docs +list the measured cases. + ## See also [Study and Trials](study-and-trials.md) · [Search Spaces](search-spaces.md) · [Samplers](samplers.md) · diff --git a/docs/website-src/docs/faq.md b/docs/website-src/docs/faq.md index 73ce3af..8eda5a9 100644 --- a/docs/website-src/docs/faq.md +++ b/docs/website-src/docs/faq.md @@ -771,6 +771,29 @@ Here OptunaSharp treats `a` and `A` as distinct, MySQL does not. Workarounds: 3. **Change MySQL's collation** to be case-sensitive at the database, table, or column level — see the [MySQL documentation](https://dev.mysql.com/doc/refman/9.3/en/charset-syntax.html). +## Can I publish with NativeAOT, or run OptunaSharp from a file-based app? + +Not with NativeAOT: OptunaSharp needs dynamic code, because NumSharp compiles its kernels at run time. Anywhere +`RuntimeFeature.IsDynamicCodeSupported` is false, the first trial fails with +`PlatformNotSupportedException: Dynamic code generation is not supported on this platform.` + +A .NET 10 file-based app (`dotnet run app.cs`) works, but it turns NativeAOT on by default, so turn it off next to the +package directive: + +```csharp +#:package OptunaSharp@* +#:property PublishAot=false + +using OptunaSharp; + +var study = Optuna.CreateStudy(); +study.Optimize(trial => Math.Pow(trial.SuggestFloat("x", -10, 10) - 2, 2), nTrials: 20); +Console.WriteLine(study.BestValue); +``` + +A regular project (`dotnet new console` plus `dotnet add package OptunaSharp`) needs nothing extra: it does not +publish with NativeAOT unless asked to. + ## Notable divergences from Optuna | Topic | Optuna (Python) | OptunaSharp | diff --git a/docs/website-src/docs/getting-started.md b/docs/website-src/docs/getting-started.md index 66a0ed4..583642b 100644 --- a/docs/website-src/docs/getting-started.md +++ b/docs/website-src/docs/getting-started.md @@ -8,6 +8,18 @@ dotnet add package OptunaSharp OptunaSharp multi-targets **.NET 8** and **.NET 10** and depends on **NumSharp**. +**OptunaSharp needs dynamic code.** NumSharp compiles its kernels at run time, so OptunaSharp does not run under +NativeAOT, or anywhere `RuntimeFeature.IsDynamicCodeSupported` is false. A .NET 10 file-based app (`dotnet run app.cs`) +turns NativeAOT on by default, so add `PublishAot=false` next to the package directive: + +```csharp +#:package OptunaSharp@* +#:property PublishAot=false +``` + +Without it, the first trial fails with `PlatformNotSupportedException: Dynamic code generation is not supported on this +platform.` + ## Your first study ```csharp diff --git a/docs/website-src/docs/methods/differential-evolution.md b/docs/website-src/docs/methods/differential-evolution.md index ff4e83b..ec54fd2 100644 --- a/docs/website-src/docs/methods/differential-evolution.md +++ b/docs/website-src/docs/methods/differential-evolution.md @@ -3,3 +3,19 @@ > 🚧 **Stub** — a full write-up (idea, pseudocode, OptunaSharp usage) is coming. Back to the [Methods overview](index.md). **Paper:** [Storn & Price, J. Global Optim. 11, 1997](https://doi.org/10.1023/A:1008202821328) + + +## OptunaHub's `DESampler` is a different sampler + +OptunaSharp's `DifferentialEvolutionSampler` follows Storn & Price. OptunaHub also has a DE +([`samplers/differential_evolution`](https://hub.optuna.org/samplers/differential_evolution/), `DESampler`, since +2024-12), and OptunaSharp does not follow it. A study moved over from the hub package therefore gets other defaults and +other trials, even with the same seed: + +| OptunaHub `DESampler` | OptunaSharp `DifferentialEvolutionSampler` | +|---|---| +| `population_size="auto"`: `max(20, 10d)` below 5 dimensions, `max(30, 10d)` up to 30, then `max(50, 5d)` | `popsize`: `max(8, 4 + ⌊3 ln d⌋)` | +| `F=0.8` | `f = 0.8` | +| `CR=0.7` | `cr = 0.9` | +| DE/rand/1/bin only | `strategy`: `"rand1bin"` (default) or `"best1bin"` | +| `search_space`, `debug`, `seed` | `seed`; the search space is inferred; plus `nStartupTrials`, `independentSampler`, `warnIndependentSampling` | diff --git a/docs/website-src/docs/methods/moea-d.md b/docs/website-src/docs/methods/moea-d.md index c15d95b..9b1662f 100644 --- a/docs/website-src/docs/methods/moea-d.md +++ b/docs/website-src/docs/methods/moea-d.md @@ -3,3 +3,22 @@ > 🚧 **Stub** — a full write-up (idea, pseudocode, OptunaSharp usage) is coming. Back to the [Methods overview](index.md). **Paper:** [Zhang & Li, IEEE TEC 11(6), 2007](https://doi.org/10.1109/TEVC.2007.892759) + + +## OptunaHub's `MOEADSampler` is a different sampler + +OptunaSharp's `MoeaDSampler` ports pymoo's `MOEAD`. OptunaHub also has a MOEA/D +([`samplers/moead`](https://hub.optuna.org/samplers/moead/), `MOEADSampler`, since 2024-09), and OptunaSharp does +not follow it. A study moved over from the hub package therefore gets other defaults and other trials, even with the +same seed: + +| OptunaHub `MOEADSampler` | OptunaSharp `MoeaDSampler` | +|---|---| +| `population_size=100` | `populationSize = 50`, rounded down to a Das-Dennis lattice size | +| `n_neighbors=None` (then `population_size // 10`) | `nNeighbors = 20` | +| `scalar_aggregation_func="tchebycheff"` (also `"weighted_sum"`, `"PBI"`) | `scalarization`: Tchebycheff by default, plus PBI and weighted sum | +| `crossover=None`, meaning `UniformCrossover(swapping_prob)` | `crossover`: `SBXCrossover` by default | +| `mutation=None`, meaning `UniformMutation()` | `mutation`: `PolynomialMutation` by default | +| `crossover_prob=0.9` (otherwise a random parent is copied) | none: every offspring is crossed | +| `mutation_prob=None` (1 / number of parameters), `swapping_prob=0.5`, `seed` | `mutationProb`, `swappingProb`, `seed`, same defaults | +| (mates within the neighborhood) | `neighborSelectionProb = 0.9` (pymoo's `prob_neighbor_mating`), `nReplacements = 2` | diff --git a/docs/website-src/docs/methods/pso.md b/docs/website-src/docs/methods/pso.md index e9e2a6e..3c73229 100644 --- a/docs/website-src/docs/methods/pso.md +++ b/docs/website-src/docs/methods/pso.md @@ -3,3 +3,19 @@ > 🚧 **Stub** — a full write-up (idea, pseudocode, OptunaSharp usage) is coming. Back to the [Methods overview](index.md). **Paper:** [Kennedy & Eberhart, Proc. IEEE ICNN 1995](https://doi.org/10.1109/ICNN.1995.488968) + + +## OptunaHub's `PSOSampler` is a different sampler + +OptunaSharp's `PsoSampler` follows Kennedy & Eberhart with Shi & Eberhart's linearly decreasing inertia. OptunaHub +also has a PSO ([`samplers/pso`](https://hub.optuna.org/samplers/pso/), `PSOSampler`, since 2025-09), with a +constant inertia, and OptunaSharp does not follow it. A study moved over from the hub package therefore gets other +defaults and other trials, even with the same seed: + +| OptunaHub `PSOSampler` | OptunaSharp `PsoSampler` | +|---|---| +| `n_particles=10` | `popsize`: `max(10, 4 + ⌊3 ln d⌋)` | +| `inertia=0.5`, constant | `w = 0.9`, decreasing linearly to `wMin = 0.4` over `inertiaDecayGenerations = 100` | +| `cognitive=1.5`, `social=1.5` | `c1 = c2 = 1.49445` | +| velocity clamped to the full range of each parameter | `maxVelocityRate = 0.2` of the unit box | +| `search_space`, `seed` | `seed`; the search space is inferred; plus `nStartupTrials`, `independentSampler`, `warnIndependentSampling` | diff --git a/docs/website-src/docs/methods/turbo.md b/docs/website-src/docs/methods/turbo.md index c9f3287..de44b12 100644 --- a/docs/website-src/docs/methods/turbo.md +++ b/docs/website-src/docs/methods/turbo.md @@ -86,7 +86,20 @@ arguments (see the knob reference below). TuRBO is **absent from Optuna core**, so — like [LM-CMA](lm-cma.md), [Differential Evolution](differential-evolution.md), and the [OpenAI-ES](openai-es.md) family — it is a -*beyond-core*, convergence-validated sampler with no Optuna counterpart. It **reuses the native GP stack** +*beyond-core*, convergence-validated sampler with no Optuna counterpart. OptunaHub does have a TuRBO, by the Optuna +team ([`samplers/turbo`](https://hub.optuna.org/samplers/turbo/), `TuRBOSampler`, since 2025-09); OptunaSharp ports +the paper instead and does not follow that package, so a study moved over from it gets other defaults and other +trials, even with the same seed: + +| OptunaHub `TuRBOSampler` | OptunaSharp `TurboSampler` | +|---|---| +| `n_trust_region=5` | `numTrustRegions = 1` (TuRBO-1; pass 5 for TuRBO-5) | +| `n_startup_trials=4` | `nInit`: `2·d` Sobol points per (re)start | +| `failure_tolerance=5` | `failureTolerance`: the paper's `d` | +| `success_tolerance=3`, `init_length=0.8`, `max_length=1.6`, `min_length=0.5**7` | `successTolerance = 3`, `lengthInit = 0.8`, `lengthMax = 1.6`, `lengthMin = 1/128`: the same values | +| `seed`, `independent_sampler`, `deterministic_objective`, `warn_independent_sampling` | the same names in C# casing; plus `numCandidates`, `successMargin`, `minimumNoise` | + +The sampler **reuses the native GP stack** that [GP-BO](gp.md) ships (`GPRegressor`: Matérn-5/2 ARD, the hand-derived marginal-likelihood gradient, managed L-BFGS-B, OpenBLAS Cholesky), so no new surrogate machinery is introduced — the new code is the trust-region bookkeeping, the Sobol-in-TR candidate set, and the Thompson draw. diff --git a/docs/website-src/docs/multi-objective.md b/docs/website-src/docs/multi-objective.md index cd74c03..8ec553a 100644 --- a/docs/website-src/docs/multi-objective.md +++ b/docs/website-src/docs/multi-objective.md @@ -87,8 +87,11 @@ Two [visualization](visualization.md) builders target multi-objective studies: | `study.best_trials` | `study.BestTrials` | | `study.set_metric_names([...])` | `study.SetMetricNames(new[] { ... })` | -**Divergence.** The hypervolume subset-selection (HSSP) can order zero-contribution ties differently -for 3-or-more objectives — a documented, tested edge case in the shared engine. +**Parity.** The hypervolume computation and the hypervolume subset selection (HSSP) that breaks ties in +multi-objective TPE match Optuna bit for bit, zero-contribution ties with 3 or more objectives included: the +2- and 3-objective volumes use the same BLAS dot products NumPy uses (through NumSharp), so the tiny +residuals that decide those ties are Optuna's own. In OptunaSharp 1.0.0 those ties could resolve to a +different, equally good point. ## See also diff --git a/docs/website-src/docs/performance.md b/docs/website-src/docs/performance.md new file mode 100644 index 0000000..d37a9b5 --- /dev/null +++ b/docs/website-src/docs/performance.md @@ -0,0 +1,149 @@ +# Performance and Compatibility + +OptunaSharp reproduces Optuna's seeded results: the same seed, sampler and objective give the same trials, value for +value, as Python Optuna 5.0. Speed work keeps that promise. A technique that leaves every result unchanged is simply +built in; one that would change results is a switch on the component it changes, off by default, and this page lists +each one. + +## What is fast, and why results stay the same + +The optimizations below came from comparing OptunaSharp with [Rustuna](https://github.com/optuna/rustuna), the Optuna +team's Rust port (plan 13 in the repository, `docs/plans/13-rustuna-derived-performance.md`). None of them is +observable: seeded studies hash identically, every trial's parameters and values by their bits, before and after. + +| Area | What changed | Effect | +|---|---|---| +| `CmaEsSampler` | The optimizer restored from the stored state is kept for the rest of its generation, and finished trials are scanned once instead of on every ask | 40 parameters, 100,000 trials: about 35 times faster | +| `InMemoryStorage` | A running trial nobody has read is written in place; a record any read returned is copied before its next write, so what a caller holds never changes | Suggestions no longer copy the trial's dictionaries | +| `InMemoryStorage` | Identical distributions and parameter names are stored once per study | Less memory for long studies | +| `TPESampler` | The scoring kernel computes per (kernel, dimension) what it used to compute per candidate, on vector lanes that keep the scalar summation order, with pooled buffers | With the next row: 40 parameters, 1,000 trials about twice as fast, and 2.6 times with two objectives | +| `TPESampler` | Independent sampling (the default for several objectives) reuses the trial's below/above split for every parameter | One split per trial instead of one per parameter | +| `QMCSampler`, genetic samplers, search spaces | History read through a zero-copy view instead of a copied list | Per-ask cost no longer grows with the study | +| `CachedStorage` (around every RDB storage) | Cached trials kept in number order instead of sorted on every read | | +| SQLite and EF Core storages | Each distinct distribution text parsed once per load | SQLite, 10,000-trial cold load: 2.1 s to 1.5 s, 60 % less memory | + +Measured on an Intel Core i9-13900K under Windows 11 with .NET 10 Release builds, 40 float parameters, seed 0, the +same program built against the code before and after; each pair ran back to back on a machine that was also running +other work, so compare within a row. The first number of a pair includes the .NET JIT warming up. + +| Study | Before | After | Same results | +|---|---|---|---| +| TPE, 1,000 trials | 10.5 s | 5.0 s | yes | +| TPE (two objectives), 1,000 trials | 47.4 s | 18.1 s | yes | +| CMA-ES, 10,000 trials | 25.4 s | 4.5 s | yes | +| CMA-ES, 100,000 trials | 988 s | 27.5 s | yes | +| NSGA-II, 10,000 trials | 3.8 s | 2.9 s | yes | +| NSGA-II, 100,000 trials | 73.2 s | 22.2 s | yes | +| QMC, 10,000 trials | 4.8 s | 2.5 s | yes | +| Random, 10,000 trials | 5.8 s | 4.7 s | yes | + +### Second comparison + +A second read of Rustuna and new profiles of the same studies (plan 14, `docs/plans/14-rustuna-second-pass.md`) +found more changes that leave every result unchanged. Each one is pinned by tests that compare it with the code it +replaced bit for bit, and by the live-Optuna parity tests of the samplers and storages it touches. + +| Area | What changed | Effect | +|---|---|---| +| `RandomSampler`, the NSGA-II family, `CmaEsSampler`, `QMCSampler`, `TPESampler` | Random draws and search-space transforms no longer create NumSharp arrays for each parameter. A NumSharp array has a finalizer, so every dropped one survived a garbage collection and pulled the next collection into generation 1 | Random search 5 to 7 times faster, NSGA-II about twice | +| `TPESampler` | Kernel widths in linear time where that provably gives the sorted result, and the sort otherwise; finished trials' values reused across asks instead of converted again | Estimator construction and history reading about 2.5 and 4 times faster | +| `TPESampler` | No `exp` call where its result is exactly zero; a categorical weight's logarithm taken once per kernel and choice instead of once per candidate | 20 categorical and 20 float parameters, 500 trials: 2.6 s to 1.8 s | +| `QMCSampler` | The sample-id key (a SHA-256 of the search space) computed once per search space instead of once per trial | Most of QMC's allocations; with the first row, QMC 2.2 times faster | +| `JournalFileBackend` | One line offset kept every 4,096 lines instead of one per line | A 4.3-million-line journal: 160 MB to 0.1 MB kept in memory | +| SQLite storage | A cached refresh with a running trial below the last finished one asks with `UNION ALL` instead of `OR`, which SQLite answers through the primary key | 8,000 trials with one trial left running: 13.0 s to 9.6 s | + +Measured as above, the "before" column being the code after the first comparison, on a machine running other work +at about 30 % load. Times include the .NET JIT warming up: + +| Study | Before | After | Same results | +|---|---|---|---| +| Random, 10,000 trials | 4.4 s | 0.8 s | yes | +| QMC, 10,000 trials | 2.3 s | 0.8 s | yes | +| NSGA-II, 10,000 trials | 2.7 s | 1.4 s | yes | +| NSGA-II, 100,000 trials | 17.2 s | 8.6 s | yes | +| TPE, 1,000 trials | 4.8 s | 3.2 s | yes | +| TPE (two objectives), 1,000 trials | 12.8 s | 10.5 s | yes | + +A second study in the same process, past the JIT, gains more: random search 7 times, QMC 2.2 times, NSGA-II 2 times, +TPE 1.6 times. CMA-ES is unchanged within the noise. + +## Start-up time + +OptunaSharp ships IL, so a process compiles each method with the .NET JIT the first time it calls it. In a short +process that is most of the work: a program that runs five TPE trials spends about 340 ms of its 400 ms of CPU in the +JIT. Two settings in the project of the application that uses OptunaSharp shorten that, and neither changes a result: + +| Setting in your application's project | What it does | A five-trial TPE process | +|---|---|---| +| `<PublishReadyToRun>true</PublishReadyToRun>`, then `dotnet publish -r <runtime identifier>` | Compiles the application and its libraries, OptunaSharp and NumSharp included, ahead of time | Time in the JIT 337 → 108 ms, the five trials 265 → 163 ms, CPU 406 → 281 ms | +| `<TieredPGO>false</TieredPGO>` | Skips the profile-guided recompilation of hot methods, which a short process never pays back | Time in the JIT 337 → 319 ms, CPU 406 → 375 ms | + +36 seeded studies, across every sampler family, hash identically (every trial's parameters and values, by their +bits) whether the program is published ReadyToRun or as IL. A long study gains little from either setting: the JIT's +work is done once. + +The `optunasharp` command-line tool starts one short process per command, so it ships with `TieredPGO` off. An `ask` +and a `tell` (two processes) on a SQLite study driven by TPE took 1.79 s with PGO and 1.58 s without, and 1.44 s +published ReadyToRun; the tool package itself is IL, because a .NET tool package serves every platform. +`<InvariantGlobalization>true</InvariantGlobalization>` saved another 10 % of a cycle by not loading ICU, but it makes +every culture invariant, which changes how an application formats and parses text, so the tool does not set it. + +Measured on the i9-13900K above with .NET 10, medians of 15 interleaved runs (the command-line tool: 10 cycles), on a +machine running other work at 60–100 % load. + +## Switches that change results + +| Switch | What it does | Seeded runs still match Python? | Can Python workers share the storage? | +|---|---|---|---| +| `new CmaEsSampler(..., reuseToldOptimizer: true)` | Keeps the optimizer that just told a generation instead of restoring the state it stored; about 20-25 % faster on 40 parameters | No: from about the third generation (Optuna's pickle stores only the covariance's upper triangle, so a restored optimizer differs in the last bits) | Yes: the state is still stored every generation exactly as Optuna stores it | +| `TrialExecutorOptions.BlasThreads = 1` with `nJobs: 1` | Runs OpenBLAS on one thread; CMA-ES was 12 % faster at 40 parameters and 24-35 % faster at 100 | Up to about 40 parameters, yes; at 100 parameters no, because OpenBLAS's threaded kernels sum in another order (NumPy's results depend on the thread count the same way) | Yes | + +With `nJobs` above 1 OptunaSharp already runs OpenBLAS on one thread automatically: parallel runs reseed every trial, +so they are not reproducible anyway, and several workers in linear algebra at once would otherwise oversubscribe the +cores (see [Easy Parallelization](key-features/parallelization.md)). + +## Memory: compact finished trials + +`new InMemoryStorage(compactFinishedTrials: true)` stores each trial compactly once it finishes. Its parameters +become one internal value each, stored against a parameter schema that the study's trials share, and its +distributions come from that schema. Its attributes become two arrays, with long ASCII strings stored as bytes: +CMA-ES's optimizer state, a hexadecimal string, takes two digits per byte. Empty dictionaries take no memory. +Results do not change: each pair below gave the same trials (equal hashes of every parameter and value), and the +live-Optuna parity tests pass on it bit for bit. + +| Study (40 parameters, seed 0) | Retained by the finished study | Peak working set | Time | +|---|---|---|---| +| CMA-ES, 100,000 trials | 1,287 MB to 257 MB | 1,846 MB to 458 MB | 23.2 s to 22.1 s | +| NSGA-II, 100,000 trials | 671 MB to 88 MB | 751 MB to 167 MB | 15.7 s to 14.6 s | +| CMA-ES, 10,000 trials | 130 MB to 27 MB | 372 MB to 137 MB | 2.28 s to 2.31 s | +| TPE, 1,000 trials | 13.4 MB to 6.9 MB | 109 MB to 92 MB | 3.8 s to 3.4 s | +| Random, 10,000 trials | 64 MB to 6.7 MB | 200 MB to 91 MB | 3.5 s to 3.5 s | + +The times are the same within the machine's noise: CMA-ES over 10,000 trials averaged 2.28 s against 2.31 s over +six steady runs each, and the large studies spend less time in the garbage collector (CMA-ES over 100,000 trials: +2.7 s of pauses against 1.4 s). Allocation stays within 6 %. It is a switch rather than the default because a +finished trial no longer holds dictionaries: + +- `Params`, `Distributions`, `UserAttrs` and `SystemAttrs` of a finished trial are read-only views, with the same + entries in the same order. A cast to `OrderedDict` fails, and a write through `IDictionary` throws. +- Numbers and long strings are rebuilt on each read, so two reads are equal but are not the same object. +- `ParamsDict`, the other `…Dict` properties and `IntermediateValues` still return real dictionaries. The first such + read gives the trial its dictionary back, and it keeps it, so a change made through it stays; that trial then + loses its saving. +- A finished trial no longer shares its dictionaries with the running record it was copied from. +- Only `InMemoryStorage` has the switch; journal and database storages keep their records as before. + +## Writing several attributes at once + +`trial.SetUserAttrs(attrs)`, `study.SetUserAttrs(attrs)` and the storage methods `SetTrialUserAttrs`, +`SetTrialSystemAttrs`, `SetStudyUserAttrs` and `SetStudySystemAttrs` write a dictionary of attributes in one step. +Optuna's singular names take a dictionary too, as overloads (`trial.SetUserAttr(attrs)`, `storage.SetTrialUserAttr(id, +attrs)`). The result is what one call per entry would leave. The in-memory storage takes its lock once, the journal +appends ordinary one-attribute records in one batch (Python Optuna reads them), and the databases use one +transaction. A finished or unknown trial gets nothing written. + +## Thread safety + +None of the caches changes what concurrent callers see. A record read from an in-memory storage, through any read, is +never changed afterwards; the samplers' caches are covered by the sampler's lock like the rest of a sampler's state, +and each `SamplerConcurrency.PerWorker` worker has its own. The repository's `docs/THREADING.md` has the details. diff --git a/docs/website-src/docs/storage.md b/docs/website-src/docs/storage.md index 6d8ca60..2227834 100644 --- a/docs/website-src/docs/storage.md +++ b/docs/website-src/docs/storage.md @@ -43,6 +43,11 @@ study.Optimize(trial => }, nTrials: 100); ``` +A long study in memory can keep its finished trials compactly with `new InMemoryStorage(compactFinishedTrials: +true)`: a 100,000-trial CMA-ES study over 40 parameters retains 257 MB instead of 1,288 MB, with the same trials. +Finished trials then return read-only views instead of dictionaries; [Performance and +Compatibility](performance.md#memory-compact-finished-trials) lists what that changes. + ## Journal file storage (persistent, shareable) `JournalStorage` records every change as an appended JSON line; `JournalFileBackend` stores that diff --git a/docs/website-src/docs/study-and-trials.md b/docs/website-src/docs/study-and-trials.md index b74c28d..f85ad7c 100644 --- a/docs/website-src/docs/study-and-trials.md +++ b/docs/website-src/docs/study-and-trials.md @@ -137,8 +137,12 @@ study.Optimize(trial => ## Attributes, enqueueing, and manual trials ```csharp +using OptunaSharp.Collections; + study.SetUserAttr("dataset", "cifar10"); // arbitrary metadata on the study trial.SetUserAttr("fold", 3); // …or on a trial +trial.SetUserAttrs(new OrderedDict<string, object?> // several at once, in one storage write + { ["seed"] = 7, ["split"] = "val" }); study.EnqueueTrial(new() { ["x"] = 0.0 }); // evaluate specific params next study.AddTrial(FrozenTrial.CreateTrial( // inject an already-evaluated trial diff --git a/docs/website-src/docs/toc.yml b/docs/website-src/docs/toc.yml index 8430859..615cf00 100644 --- a/docs/website-src/docs/toc.yml +++ b/docs/website-src/docs/toc.yml @@ -46,6 +46,8 @@ href: logging.md - name: Exceptions href: exceptions.md + - name: Performance and Compatibility + href: performance.md - name: Recipes items: - name: Overview diff --git a/docs/website-src/integrations/cli.md b/docs/website-src/integrations/cli.md index a37c86f..9442fe3 100644 --- a/docs/website-src/integrations/cli.md +++ b/docs/website-src/integrations/cli.md @@ -95,10 +95,16 @@ through `--sampler-kwargs`. This is separate from `ask`'s distribution-based `-- Common options include `--storage`, `--storage-class`, `-v` / `--verbose`, `-q` / `--quiet`, `--log-file`, and `--debug`. Use subcommand help for accepted state names and argument cardinality. +`--log-file` behaves exactly as Optuna's: it creates the file and writes nothing to it. Optuna attaches its file +handler to Python's root logger, which the `optuna` logger does not propagate to, so the log records still go only to +stderr; OptunaSharp copies that on purpose, for byte-for-byte CLI parity. Redirect stderr to keep a log +(`optunasharp ... 2>> run.log`). + `-f value|json|table|yaml` selects a format. `study-names` defaults to `value`, listing commands to `table`, and `ask` to `json`. `--flatten` expands structured columns such as parameters, attributes, and multi-objective values. The differential tests compare `value`, `json`, and `table` output -against Python Optuna. YAML is valid but not byte-identical to PyYAML; command help and argument +against Python Optuna. YAML is byte-identical to PyYAML's `safe_dump` too (floats keep a decimal point, strings YAML 1.1 +would read as another type are quoted, keys are sorted); command help and argument validation come from System.CommandLine rather than Python's argparse. ## SQLite upgrades and cross-language use diff --git a/docs/website-src/integrations/python/index.md b/docs/website-src/integrations/python/index.md index 78ab31a..abe8acb 100644 --- a/docs/website-src/integrations/python/index.md +++ b/docs/website-src/integrations/python/index.md @@ -19,9 +19,10 @@ Start with the [runtime setup](pythonnet.md), then follow the integration's inst ## Choose a bridge Use **OptunaHub** to load a contributor package, run a benchmark with an OptunaSharp sampler, or try a -Python sampler or pruner through its supported Optuna protocol. Its shadow-study adapter has a narrower -state contract than a Python study: read the [compatibility limits](optunahub.md#compatibility-and-state) -before choosing a registry method. +Python sampler or pruner through its supported Optuna protocol. Its shadow study mirrors the C# study +trial for trial, and the tested registry methods give the same trials as when run natively. A method's +internal Python state is not persisted, so read the +[compatibility limits](optunahub.md#compatibility-and-state) before choosing a registry method. Use **BoTorch** for acquisition functions implemented by the actual PyTorch/GPyTorch stack, including multi-objective and constrained Bayesian optimization. Use **pycma** when reproducing the Python diff --git a/docs/website-src/integrations/python/optunahub.md b/docs/website-src/integrations/python/optunahub.md index 798d930..232b856 100644 --- a/docs/website-src/integrations/python/optunahub.md +++ b/docs/website-src/integrations/python/optunahub.md @@ -128,32 +128,43 @@ study.Optimize(trial => }, nTrials: 30, nJobs: 1); ``` -The pruner rebuilds a Python study for each decision, including finished trials' intermediate values -and the current trial's reports. Pruning is single-objective. +The pruner keeps its own shadow study, described below, so a stateful pruner sees what it wrote earlier: +successive halving and Hyperband record each rung a trial completes and compare it with the other +trials' records, and they prune as in Python. Pruning is single-objective. ## Compatibility and state -The sampler maintains a **shadow study** for the current trial. On the next trial it rebuilds that -in-memory Python study from prior finished trials, opens a running trial, and delegates -`infer_relative_search_space`, `sample_relative` and `sample_independent`. `ReseedRng` delegates to -Python `reseed_rng` when present. The Python sampler instance survives across these rebuilt studies. - -This is an intentionally limited adapter: - -- Use one wrapper per study and `nJobs: 1`. Concurrent running trials are not mirrored. -- The sampler mirror copies finished states, objective values, parameters and distributions. It does - not copy study/trial user attributes, system attributes, constraints or intermediate values. -- It does not forward Python sampler `before_trial` or `after_trial` hooks. Python mutations to the - shadow study are not written back to C# storage. -- The pruner includes intermediate values, but likewise does not synchronize arbitrary metadata or - Python storage writes. -- The Python sampler's internal state is not checkpointed by OptunaSharp storage. Persisting C# trials - alone does not establish an identical restarted trajectory for every registry sampler. - -Consequently, loading a module successfully is not evidence that every method in the registry is -compatible. Algorithms that depend on hooks, persistent storage attributes, concurrent trials or other -unmirrored state need additional adaptation and validation. The bridge is not a shared-database -connection between Python Optuna and OptunaSharp. +The sampler and the pruner each keep a **shadow study**: one in-memory Python study per OptunaSharp +study, kept in lockstep with it and handed to the Python object. Before every call the bridge mirrors +each OptunaSharp trial, in number order and in whatever state it is: its values, parameters, +distributions, user and system attributes and intermediate values, then the study's attributes. The +sampler forwards all five hooks, `before_trial`, `infer_relative_search_space`, `sample_relative`, +`sample_independent` and `after_trial`, with the trial objects Optuna itself passes. It clears the +shadow study's per-trial history cache as `Study.ask` does, so CMA-ES, TPE and the GA samplers read the +history as of the current trial. The shadow study carries the OptunaSharp study's name. Attributes the +Python object writes, such as a generation counter, a swarm, constraints or a pruning rung, are written +to the OptunaSharp trial or study as well. `ReseedRng` delegates to Python `reseed_rng` when present. + +Measured against the same objects run natively: PSO, MO-CMA, the NSGA-II variants +(`nsgaii_with_initial_trials`, `speaii`), the implicit natural gradient, differential evolution, +restart CMA-ES, Lévy flight, Nelder-Mead, `tpe_union_multivariate`, random search and the Optuna team's +`AutoSampler`, and the successive-halving, Hyperband, median, percentile, Wilcoxon and threshold pruners, +give the same trials bit for bit +([OptunaHubNativeParityTests](https://github.com/SciSharp/OptunaSharp/blob/main/test/OptunaSharp.Tests.Interop/OptunaHubNativeParityTests.cs)). + +Remaining limits: + +- The Python object's internal state lives in Python, not in OptunaSharp's storage. Persisting the C# + trials alone does not resume every registry sampler identically after a restart. +- Attribute values with no JSON shape, such as NumPy arrays or arbitrary objects, stay in the shadow + study and are not written to the C# storage. +- Calls are serialized on the Python thread. Trials of parallel workers are mirrored with the state the + storage holds when a call starts, as a native sampler reads them, but each Python call sees one shared + history cache where native Optuna keeps one per thread. +- A study that the C# `HyperbandPruner` filters into brackets is mirrored whole. + +The bridge is not a shared-database connection between Python Optuna and OptunaSharp: the shadow study +lives in the process and mirrors one OptunaSharp study. ## Lifetime and validation @@ -164,11 +175,15 @@ escape the callback. The existing [bridge tests](https://github.com/SciSharp/OptunaSharp/blob/main/test/OptunaSharp.Tests.Interop/OptunaHubBridgeParityTests.cs) exercise a local mixed-distribution toy benchmark, the registry's `RandomSampler`, and a median pruner -that actually prunes trials. These are behavioral integration checks, not a registry-wide parity -guarantee. They report inconclusive when Python, required packages or the pinned registry checkout -are missing. +that actually prunes trials. The +[native-parity tests](https://github.com/SciSharp/OptunaSharp/blob/main/test/OptunaSharp.Tests.Interop/OptunaHubNativeParityTests.cs) +run 12 registry samplers and 6 pruners natively and through the bridge, and compare every trial. The +registry holds more methods than they cover, so validate a method outside that list before relying on +it. The tests report inconclusive when Python, a required package or the pinned registry checkout is +missing. Source: [module factories](https://github.com/SciSharp/OptunaSharp/blob/main/src/OptunaSharp.Interop.pythonnet/OptunaHubModule.cs), [sampler](https://github.com/SciSharp/OptunaSharp/blob/main/src/OptunaSharp.Interop.pythonnet/OptunaHubSampler.cs), [pruner](https://github.com/SciSharp/OptunaSharp/blob/main/src/OptunaSharp.Interop.pythonnet/OptunaHubPruner.cs), +[shadow study](https://github.com/SciSharp/OptunaSharp/blob/main/src/OptunaSharp.Interop.pythonnet/OptunaHubShadow.cs), [problem](https://github.com/SciSharp/OptunaSharp/blob/main/src/OptunaSharp.Interop.pythonnet/OptunaHubProblem.cs). diff --git a/docs/website-src/integrations/storage/grpc/cross-language.md b/docs/website-src/integrations/storage/grpc/cross-language.md index b470bca..98a90ea 100644 --- a/docs/website-src/integrations/storage/grpc/cross-language.md +++ b/docs/website-src/integrations/storage/grpc/cross-language.md @@ -78,6 +78,12 @@ Expected storage exceptions map through gRPC statuses and back into typed except The wire format does not transfer sampler random state, executing objectives, artifact file contents, or heartbeat lifecycle operations. Matching stored history is not a claim that separately configured Python and C# workers will suggest identical future trials. +### Dictionary order (a deliberate difference) + +Optuna's Python client rebuilds every trial from protobuf maps, and Python protobuf (upb) iterates a map in its own hash-table order. So through Optuna's `GrpcStorageProxy`, `trial.params`, `trial.distributions` and the attribute dictionaries come back in that hash order, not in the order the parameters were suggested: nine floats suggested as `u0, y1, depth2, x3, lr4, z5, a, b, c` read back as `depth2, u0, x3, b, y1, z5, lr4, c, a` (Optuna 5.0.0, grpcio 1.78.0, protobuf 6.33.5), whichever server answers. The C# client keeps the order the server sends. From a C# server that is the backing storage's own order, which is Optuna's order for that storage: insertion order in memory and in a journal, parameters in suggestion order everywhere, and attributes in key order on SQLite and MySQL, where Optuna's unordered queries come back through the `(…, key)` unique index. + +Two samplers read that order. `QMCSampler` assigns Sobol dimensions in the order of the first trial's distributions, and `BruteForceSampler` builds its tree from it. So a seeded QMC or BruteForce study run through Optuna's proxy can differ from the same study run in memory, in Optuna itself; the same study through the C# client equals its in-memory run. Reproducing upb's internal layout was considered and declined (2026-11-12): it is an implementation detail of Python protobuf that can change with its version. The other samplers are unaffected. + ## Transport and verification scope The default constructors on both sides use cleartext HTTP/2. HTTPS is available through the .NET [channel](client.md) and [host](server.md) configuration paths, but it must match the other endpoint's transport and trust configuration. An HTTPS C# client cannot communicate with an unchanged insecure Python endpoint. The default examples do not configure authentication. diff --git a/examples/0_BuildingEnergyForestSearchCV.cs b/examples/0_BuildingEnergyForestSearchCV.cs new file mode 100644 index 0000000..22bd177 --- /dev/null +++ b/examples/0_BuildingEnergyForestSearchCV.cs @@ -0,0 +1,104 @@ +#:project ../src/OptunaSharp.Core/OptunaSharp.Core.csproj +#:property PublishAot=false + +// Building energy model with OptunaSearchCV — the scikit-learn-style integration: OptunaSearchCV +// cross-validates a random-forest regressor (OptunaSharp's managed, byte-exact port of scikit-learn's +// RandomForestRegressor) that predicts a building's heating load from its geometry and glazing, the way an +// energy consultant screens designs before running a full thermal simulation. +// +// source: https://optuna-integration.readthedocs.io/en/stable/reference/generated/optuna_integration.OptunaSearchCV.html +// (OptunaSearchCV: an estimator, `param_distributions`, `n_trials`, CV scoring, refit) +// +// Real training: a deterministic table of 768 building designs shaped like the classic energy-efficiency +// study (relative compactness, surface/wall/roof area, height, orientation, glazing area and its +// distribution) with a heating load that depends non-linearly on them; 5-fold KFold CV with R² as the score. +// The forest's depth, leaf size, feature subsampling and size are searched; the refitted best forest is then +// scored on 200 held-out designs it never saw. +// +// Run: dotnet run examples/0_BuildingEnergyForestSearchCV.cs + +using System.Globalization; +using OptunaSharp; +using OptunaSharp.Distributions; +using OptunaSharp.Integration; +using OptunaSharp.Integration.Sklearn; +using OptunaSharp.Logging; + +OptunaLogging.SetVerbosity(LogLevel.Warning); // silence the per-trial INFO lines + +var (x, y) = Buildings.Generate(rows: 968, seed: 47); +var (xTrain, yTrain) = (Slice(x, 0, 768), y[..768]); +var (xTest, yTest) = (Slice(x, 768, 968), y[768..]); + +var search = new OptunaSearchCV( + new SklearnEstimator(new RandomForestRegressor(randomState: 0), xTrain, yTrain, cv: new KFold(5, shuffle: true, randomState: 0)), + new Dictionary<string, BaseDistribution> + { + ["n_estimators"] = new IntDistribution(20, 120, step: 20), + ["max_depth"] = new IntDistribution(2, 20), + ["min_samples_leaf"] = new IntDistribution(1, 20, log: true), + ["max_features"] = new FloatDistribution(0.2, 1.0), + }, + nTrials: 25, + randomState: 0); +search.Fit(); + +Console.WriteLine(string.Format(CultureInfo.InvariantCulture, "best 5-fold CV R²: {0:F4} after {1} trials", search.BestScore, search.Study.Trials.Count)); +foreach (var kv in search.BestParams) + Console.WriteLine($" {kv.Key,-17} {kv.Value}"); +var forest = new RandomForestRegressor( + nEstimators: (int)(long)search.BestParams["n_estimators"]!, maxDepth: (int)(long)search.BestParams["max_depth"]!, + minSamplesLeaf: (int)(long)search.BestParams["min_samples_leaf"]!, maxFeatures: search.BestParams["max_features"], randomState: 0); +forest.Fit(xTrain, yTrain); +double[] pred = forest.Predict(xTest); +double mean = yTest.Average(); +double r2 = 1 - yTest.Zip(pred, (a, p) => (a - p) * (a - p)).Sum() / yTest.Sum(a => (a - mean) * (a - mean)); +double mae = yTest.Zip(pred, (a, p) => Math.Abs(a - p)).Average(); +Console.WriteLine(string.Format(CultureInfo.InvariantCulture, "held-out designs: R² {0:F4}, mean absolute error {1:F2} kWh/m²", r2, mae)); + +/// <summary>Copies a block of rows out of a matrix.</summary> +/// <param name="m">The matrix.</param> +/// <param name="from">First row (inclusive).</param> +/// <param name="to">Last row (exclusive).</param> +/// <returns>The rows as a new matrix.</returns> +static double[,] Slice(double[,] m, int from, int to) +{ + var o = new double[to - from, m.GetLength(1)]; + for (int i = from; i < to; i++) + for (int j = 0; j < m.GetLength(1); j++) + o[i - from, j] = m[i, j]; + return o; +} + +/// <summary>The synthetic building-design table.</summary> +static class Buildings +{ + /// <summary>Generates designs and heating loads; the same seed gives the same table.</summary> + /// <param name="rows">Number of designs.</param> + /// <param name="seed">Data seed.</param> + /// <returns>Eight features per design and its heating load in kWh/m².</returns> + public static (double[,] X, double[] Y) Generate(int rows, int seed) + { + var rng = new Random(seed); // data generation only — samplers never use System.Random + var x = new double[rows, 8]; + var y = new double[rows]; + for (int i = 0; i < rows; i++) + { + double compactness = 0.62 + 0.36 * rng.NextDouble(); + double surface = 515 + 300 * (1 - compactness) / 0.36 + 10 * rng.NextDouble(); + double wall = 245 + 170 * rng.NextDouble(); + double roof = Math.Max(110, (surface - wall) / 2); + double height = compactness > 0.75 ? 7.0 : 3.5; + double orientation = 2 + rng.Next(4); + double glazing = new[] { 0.0, 0.1, 0.25, 0.4 }[rng.Next(4)]; + double distribution = glazing == 0 ? 0 : 1 + rng.Next(5); + // heating load: tall compact buildings lose less per m²; glazing and roof area add losses. + y[i] = 6 + 28 * (height / 7.0) * Math.Pow(compactness, 1.5) + 0.018 * roof * (height < 5 ? 0.4 : 1.0) + + 22 * glazing + 0.6 * (distribution is 2 or 3 ? glazing * 4 : 0) + 0.2 * (orientation - 3.5) + 0.8 * (rng.NextDouble() - 0.5); + double[] r = { compactness, surface, wall, roof, height, orientation, glazing, distribution }; + for (int j = 0; j < 8; j++) + x[i, j] = r[j]; + } + return (x, y); + } +} diff --git a/examples/0_ChurnScorecardTerminator.cs b/examples/0_ChurnScorecardTerminator.cs new file mode 100644 index 0000000..6ee8a36 --- /dev/null +++ b/examples/0_ChurnScorecardTerminator.cs @@ -0,0 +1,130 @@ +#:project ../src/OptunaSharp.Core/OptunaSharp.Core.csproj +#:property PublishAot=false + +// When to stop tuning — Optuna's Terminator in its documented default form: every trial reports its +// cross-validation fold scores (`report_cross_validation_scores`), and TerminatorCallback ends the study once +// the GP-estimated room for improvement (the regret bound) falls below the noise of the CV estimate itself — +// past that point, a "better" trial is indistinguishable from a lucky fold split. +// +// source: https://optuna.readthedocs.io/en/stable/reference/generated/optuna.terminator.TerminatorCallback.html +// (TerminatorCallback with the default RegretBoundEvaluator + CrossValidationErrorEvaluator, and +// `report_cross_validation_scores`) +// +// Real objective, real training: a deterministic telecom-churn table (2,000 customers, 10 features with +// interactions) and an L2-regularized logistic regression with optional quadratic features, fitted by +// gradient descent; 5-fold CV accuracy is maximized. The trial budget is 120, but the terminator usually +// stops much earlier — the printout shows where, and how little the best score moved after that point in a +// separate run that ignores the terminator. (Optuna has deprecated `optuna.terminator` — v4.9, removal in +// v6 — so a FutureWarning prints; it is still the canonical recipe in Optuna 5.) +// +// Run: dotnet run examples/0_ChurnScorecardTerminator.cs + +using System.Globalization; +using OptunaSharp; +using OptunaSharp.Logging; +using OptunaSharp.Samplers; +using OptunaSharp.Terminator; + +OptunaLogging.SetVerbosity(LogLevel.Warning); // silence the per-trial INFO lines + +var (x, y) = Customers.Generate(rows: 2000, seed: 43); + +// the run with the terminator. +var stopped = Optuna.CreateStudy(sampler: new TPESampler(seed: 44), direction: StudyDirection.Maximize, studyName: "churn-terminated"); +stopped.Optimize(t => Objective(t, x, y), nTrials: 120, callbacks: new Action<Study, FrozenTrial>[] { new TerminatorCallback() }); + +// the same search without it, to see what the remaining budget would have bought. +var full = Optuna.CreateStudy(sampler: new TPESampler(seed: 44), direction: StudyDirection.Maximize, studyName: "churn-full"); +full.Optimize(t => Objective(t, x, y), nTrials: 120); + +int stopAt = stopped.Trials.Count; +double bestAtStop = full.Trials.Take(stopAt).Max(t => t.Value!.Value); +Console.WriteLine(string.Format(CultureInfo.InvariantCulture, "terminator stopped after {0} of 120 trials; best CV accuracy {1:P2}", stopAt, stopped.BestValue)); +Console.WriteLine(string.Format(CultureInfo.InvariantCulture, "the full 120-trial run: best {0:P2} — {1:+0.00;-0.00} percentage points for {2} more trials", + full.BestValue, 100 * (full.BestValue - bestAtStop), 120 - stopAt)); +var folds = (IEnumerable<object?>)stopped.BestTrial.SystemAttrs["terminator:cv_scores"]!; +Console.WriteLine("the best trial's fold scores (the noise the terminator compares against): " + + string.Join(", ", folds.Select(v => Convert.ToDouble(v, CultureInfo.InvariantCulture).ToString("P1", CultureInfo.InvariantCulture)))); + +/// <summary>Cross-validates one scorecard configuration and reports its fold scores to the terminator.</summary> +/// <param name="t">The trial proposing C, the feature expansion and the iteration budget.</param> +/// <param name="x">Customer features.</param> +/// <param name="y">Churn labels.</param> +/// <returns>Mean 5-fold accuracy.</returns> +static double Objective(Trial t, double[][] x, double[] y) +{ + double c = t.SuggestFloat("C", 1e-3, 1e3, log: true); + bool quadratic = t.SuggestCategorical("quadratic", new[] { false, true }); + long iterations = t.SuggestInt("iterations", 20, 300, log: true); + var rows = quadratic ? x.Select(r => r.Concat(r.Select(v => v * v)).Append(r[0] * r[2]).Append(r[1] * r[3]).ToArray()).ToArray() : x; + var scores = new List<double>(); + for (int f = 0; f < 5; f++) + scores.Add(FoldAccuracy(rows, y, f, c, (int)iterations)); + TerminatorFunctions.ReportCrossValidationScores(t, scores); // what CrossValidationErrorEvaluator reads + return scores.Average(); +} + +/// <summary>Trains on four folds by gradient descent and scores the fifth.</summary> +/// <param name="x">Rows.</param> +/// <param name="y">Labels.</param> +/// <param name="fold">The held-out fold (rows with index % 5 == fold).</param> +/// <param name="c">Inverse L2 strength.</param> +/// <param name="iterations">Gradient-descent steps.</param> +/// <returns>Held-out accuracy.</returns> +static double FoldAccuracy(double[][] x, double[] y, int fold, double c, int iterations) +{ + int d = x[0].Length, nTrain = x.Length - x.Length / 5; + var w = new double[d]; + double b = 0; + for (int it = 0; it < iterations; it++) + { + var g = new double[d]; + double gb = 0; + for (int i = 0; i < x.Length; i++) + { + if (i % 5 == fold) continue; + double err = 1 / (1 + Math.Exp(-(Dot(w, x[i]) + b))) - y[i]; + for (int j = 0; j < d; j++) g[j] += err * x[i][j]; + gb += err; + } + for (int j = 0; j < d; j++) w[j] -= 0.5 * (g[j] / nTrain + w[j] / (c * nTrain)); + b -= 0.5 * gb / nTrain; + } + int correct = 0, total = 0; + for (int i = fold; i < x.Length; i += 5) + { + correct += ((Dot(w, x[i]) + b) > 0 ? 1.0 : 0.0) == y[i] ? 1 : 0; + total++; + } + return (double)correct / total; + + static double Dot(double[] w, double[] r) + { + double s = 0; + for (int j = 0; j < w.Length; j++) s += w[j] * r[j]; + return s; + } +} + +/// <summary>The synthetic telecom customer table.</summary> +static class Customers +{ + /// <summary>Generates standardized features and churn labels; the same seed gives the same table.</summary> + /// <param name="rows">Customer count.</param> + /// <param name="seed">Data seed.</param> + /// <returns>Ten features per customer and a 0/1 churn label.</returns> + public static (double[][] X, double[] Y) Generate(int rows, int seed) + { + var rng = new Random(seed); // data generation only — samplers never use System.Random + var x = new double[rows][]; + var y = new double[rows]; + for (int i = 0; i < rows; i++) + { + var r = Enumerable.Range(0, 10).Select(_ => Math.Sqrt(-2 * Math.Log(1 - rng.NextDouble())) * Math.Cos(2 * Math.PI * rng.NextDouble())).ToArray(); + double z = -0.8 + 1.1 * r[0] - 0.9 * r[1] + 0.6 * r[0] * r[2] + 0.5 * r[3] * r[3] - 0.4 * r[4]; + y[i] = rng.NextDouble() < 1 / (1 + Math.Exp(-z)) ? 1 : 0; + x[i] = r; + } + return (x, y); + } +} diff --git a/examples/0_ConcreteMixDesignGp.cs b/examples/0_ConcreteMixDesignGp.cs new file mode 100644 index 0000000..60f2d87 --- /dev/null +++ b/examples/0_ConcreteMixDesignGp.cs @@ -0,0 +1,69 @@ +#:project ../src/OptunaSharp.Core/OptunaSharp.Core.csproj +#:property PublishAot=false + +// Concrete mix design with Bayesian optimization over a mixed space — GPSampler picks the cement content +// (5 kg steps), water–cement ratio (0.01 steps), slag and fly-ash replacement, superplasticizer dose and the +// aggregate type to maximize 28-day compressive strength, under a cost cap and a minimum-workability rule: +// each trial batch is a lab pour, so few trials matter. +// +// source: https://optuna.readthedocs.io/en/stable/reference/samplers/generated/optuna.samplers.GPSampler.html +// (GP sampling over float — including stepped — int and categorical parameters, with constraints) +// https://en.wikipedia.org/wiki/Water%E2%80%93cement_ratio (Abrams' law: strength falls with w/c) +// +// Surrogate of the lab, built on the textbook relations: Abrams' law f = A / B^(w/c) for the paste, a +// cement-content factor, slag that costs early strength but adds to it by 28 days while fly ash mostly +// dilutes it, superplasticizer that buys workability (so a lower w/c is placeable), and an aggregate factor +// (crushed granite > river gravel > recycled). Constraints, via `SetConstraint`: material cost ≤ $95/m³ and +// slump ≥ 75 mm. 12 random pours, then 28 GP-planned ones. +// +// Run: dotnet run examples/0_ConcreteMixDesignGp.cs + +using System.Globalization; +using OptunaSharp; +using OptunaSharp.Logging; +using OptunaSharp.Samplers; + +OptunaLogging.SetVerbosity(LogLevel.Warning); // silence the per-trial INFO lines + +var study = Optuna.CreateStudy(sampler: new GPSampler(seed: 50, nStartupTrials: 12), direction: StudyDirection.Maximize, studyName: "c40-mix"); +study.Optimize(Objective, nTrials: 40); + +var best = study.BestTrial; // best FEASIBLE mix +int feasible = study.Trials.Count(t => t.Constraints.Values.All(c => c <= 0)); +Console.WriteLine(string.Format(CultureInfo.InvariantCulture, "{0} pours, {1} within cost and slump; best 28-day strength {2:F1} MPa (pour #{3})", + study.Trials.Count, feasible, best.Value, best.Number)); +foreach (var kv in best.Params) + Console.WriteLine(string.Format(CultureInfo.InvariantCulture, " {0,-20} {1}", kv.Key, kv.Value)); +Console.WriteLine(string.Format(CultureInfo.InvariantCulture, " cost ${0:F1}/m³, slump {1:F0} mm", best.UserAttrs["cost"], best.UserAttrs["slump_mm"])); +var randomBest = study.Trials.Take(12).Where(t => t.Constraints.Values.All(c => c <= 0)).Select(t => t.Value ?? 0).DefaultIfEmpty(0).Max(); +Console.WriteLine(string.Format(CultureInfo.InvariantCulture, "best of the 12 random pours: {0:F1} MPa", randomBest)); + +/// <summary>"Pours" one mix: predicts its 28-day strength, cost and slump.</summary> +/// <param name="t">The trial proposing the mix.</param> +/// <returns>28-day compressive strength in MPa; cost and slump limits are recorded as constraints.</returns> +static double Objective(Trial t) +{ + double cement = t.SuggestFloat("cement_kg", 250, 500, step: 5); // binder per m³, 5 kg steps + double wc = t.SuggestFloat("water_cement", 0.30, 0.65, step: 0.01); // water–cement ratio + long slagPct = t.SuggestInt("slag_pct", 0, 50, step: 5); // GGBS replacing cement + long ashPct = t.SuggestInt("fly_ash_pct", 0, 30, step: 5); // fly ash replacing cement + double sp = t.SuggestFloat("superplasticizer_kg", 0, 8); // admixture dose + string aggregate = t.SuggestCategorical("aggregate", new[] { "crushed_granite", "river_gravel", "recycled" }); + + double clinkerShare = Math.Max(0.2, 1 - (slagPct + ashPct) / 100.0); + double abrams = 96.5 / Math.Pow(7.0, wc); // MPa, Abrams' law + double cementFactor = 0.75 + 0.25 * Math.Min(1, cement / 400); + double scm = clinkerShare + 0.85 * slagPct / 100.0 + 0.45 * ashPct / 100.0; // 28-day contribution + double aggFactor = aggregate switch { "crushed_granite" => 1.06, "river_gravel" => 1.0, _ => 0.88 }; + double strength = abrams * cementFactor * scm * aggFactor; + + double water = wc * cement; + double slump = 20 + 0.55 * (water - 140) + 22 * sp + 0.6 * ashPct - (aggregate == "crushed_granite" ? 15 : 0); + double cost = cement * clinkerShare * 0.14 + cement * slagPct / 100.0 * 0.09 + cement * ashPct / 100.0 * 0.05 + + sp * 2.8 + (aggregate switch { "crushed_granite" => 24, "river_gravel" => 20, _ => 14 }); + t.SetUserAttr("cost", cost); + t.SetUserAttr("slump_mm", slump); + t.SetConstraint("cost_cap", cost - 95.0); // ≤ $95 per m³ + t.SetConstraint("workability", 75.0 - slump); // ≥ 75 mm slump + return strength; +} diff --git a/examples/0_ContainerLoadingStopAtBound.cs b/examples/0_ContainerLoadingStopAtBound.cs new file mode 100644 index 0000000..644a139 --- /dev/null +++ b/examples/0_ContainerLoadingStopAtBound.cs @@ -0,0 +1,164 @@ +#:project ../src/OptunaSharp.Core/OptunaSharp.Core.csproj +#:property PublishAot=false + +// Container loading — tune a bin-packing heuristic that assigns a week's shipments to containers, starting +// from the load planners' rules of thumb (enqueued with `skip_if_exists`, so re-running never duplicates +// them) and stopping the study the moment a plan reaches the provable lower bound (`study.stop()` from a +// callback): there is nothing better to find, so the remaining budget is not spent. +// +// source: https://optuna.readthedocs.io/en/stable/reference/generated/optuna.study.Study.html#optuna.study.Study.enqueue_trial +// (`enqueue_trial(params, skip_if_exists=True)`) +// https://optuna.readthedocs.io/en/stable/reference/generated/optuna.study.Study.html#optuna.study.Study.stop +// https://en.wikipedia.org/wiki/Bin_packing_problem (first-fit / best-fit decreasing, the L1 bound) +// +// Real objective, a real heuristic: 120 shipments (pallet-metres) generated as Falkenauer-style triplets — +// every trailer of the known optimum holds exactly three of them — are packed into 13.6 m trailers. The heuristic orders the shipments by size^p (p tunable; +// with noise of a tunable seed to break ties differently), places each by first-, best- or worst-fit, then +// runs a tunable number of repair passes that try to empty the least-full trailer into the others. The +// score is the number of trailers plus a small term for how empty the emptiest one is (an emptier last +// trailer is easier to cancel). The lower bound ⌈Σ size / capacity⌉ is known, so reaching it ends the study. +// +// Run: dotnet run examples/0_ContainerLoadingStopAtBound.cs + +using System.Globalization; +using OptunaSharp; +using OptunaSharp.Collections; +using OptunaSharp.Logging; +using OptunaSharp.Samplers; + +OptunaLogging.SetVerbosity(LogLevel.Warning); // silence the per-trial INFO lines + +var shipments = Shipments.Week(count: 120, seed: 37); +const double Capacity = 13.6; +int lowerBound = (int)Math.Ceiling(shipments.Sum() / Capacity); +Console.WriteLine(string.Format(CultureInfo.InvariantCulture, "{0} shipments, {1:F1} pallet-metres; lower bound: {2} trailers", shipments.Length, shipments.Sum(), lowerBound)); + +var study = Optuna.CreateStudy(sampler: new TPESampler(seed: 38, nStartupTrials: 15), studyName: "trailer-loading"); +// the planners' rules of thumb: first-fit-decreasing and best-fit-decreasing, no repair. +foreach (string fit in new[] { "first", "best" }) + for (int twice = 0; twice < 2; twice++) // the second enqueue is skipped: already queued + study.EnqueueTrial(new OrderedDict<string, object?> { ["order_power"] = 1.0, ["noise_seed"] = 0L, ["fit"] = fit, ["repair_passes"] = 0L }, + skipIfExists: true); + +void StopAtBound(Study s, FrozenTrial t) +{ + if (t.Value is double v && Math.Floor(v) <= lowerBound) + s.Stop(); // provably optimal trailer count: done +} +study.Optimize(t => Objective(t, shipments, Capacity), nTrials: 300, callbacks: new Action<Study, FrozenTrial>[] { StopAtBound }); + +// note: if the study stops early, a still-queued enqueued trial stays WAITING in the storage (it would run +// first on the next optimize) — so summarize only the COMPLETE trials. +var completed = study.Trials.Where(t => t.State == TrialState.Complete).ToList(); +var rulesOfThumb = completed.Where(t => (long)t.Params["repair_passes"]! == 0 && (double)t.Params["order_power"]! == 1.0 && (long)t.Params["noise_seed"]! == 0).Take(2).Select(t => $"{t.Params["fit"]}-fit decreasing → {Math.Floor(t.Value!.Value)} trailers").ToList(); +Console.WriteLine("planners' heuristics: " + string.Join("; ", rulesOfThumb)); +var best = study.BestTrial; +Console.WriteLine(string.Format(CultureInfo.InvariantCulture, "tuned: {0} trailers after {1} trials ({2}); emptiest trailer {3:P0} full", + Math.Floor(best.Value!.Value), completed.Count, Math.Floor(best.Value.Value) <= lowerBound ? "hit the lower bound — study stopped" : "budget used up", + best.UserAttrs["emptiest_fill"])); +foreach (var kv in best.Params) + Console.WriteLine($" {kv.Key,-14} {kv.Value}"); + +/// <summary>Packs the week's shipments with the trial's heuristic settings.</summary> +/// <param name="t">The trial proposing the ordering power, tie-break seed, fit rule and repair effort.</param> +/// <param name="items">Shipment sizes in pallet-metres.</param> +/// <param name="capacity">Trailer capacity in pallet-metres.</param> +/// <returns>Trailers used plus (0.99 × the emptiest trailer's fill), so fewer and emptier-last plans win.</returns> +static double Objective(Trial t, double[] items, double capacity) +{ + double power = t.SuggestFloat("order_power", 0.25, 4.0); // sort key: size^p (p = 1: plain decreasing) + long noiseSeed = t.SuggestInt("noise_seed", 0, 50); // tie-breaking perturbation of the order + string fit = t.SuggestCategorical("fit", new[] { "first", "best", "worst" }); + long passes = t.SuggestInt("repair_passes", 0, 20); // try to empty the least-full trailer + var bins = Packer.Pack(items, capacity, power, (int)noiseSeed, fit, (int)passes); + double emptiest = bins.Min(b => b.Sum()) / capacity; + t.SetUserAttr("emptiest_fill", emptiest); + return bins.Count + 0.99 * emptiest; +} + +/// <summary>The week's shipments.</summary> +static class Shipments +{ + /// <summary> + /// Generates a "triplet" week (Falkenauer's hard class): the shipments come in groups of three that + /// exactly fill one trailer, so the lower bound is achievable — but only by packing the right triples + /// together, which decreasing-order heuristics rarely do. + /// </summary> + /// <param name="count">Number of shipments (a multiple of three).</param> + /// <param name="seed">Data seed.</param> + /// <returns>Sizes in pallet-metres, shuffled.</returns> + public static double[] Week(int count, int seed) + { + const double Capacity = 13.6; + var rng = new Random(seed); // data generation only — samplers never use System.Random + var items = new List<double>(); + for (int k = 0; k < count / 3; k++) + { + // three loads of roughly a quarter to a half trailer that sum to exactly one trailer (0.1 m grid). + int total = (int)Math.Round(Capacity * 10), a = 34 + rng.Next(34), b = 34 + rng.Next(Math.Max(1, total - a - 34 - 34)); + items.AddRange(new[] { a / 10.0, b / 10.0, (total - a - b) / 10.0 }); + } + var arr = items.ToArray(); + rng.Shuffle(arr); + return arr; + } +} + +/// <summary>A parameterized decreasing-order bin-packing heuristic with a repair step.</summary> +static class Packer +{ + /// <summary>Packs items into bins.</summary> + /// <param name="items">Item sizes.</param> + /// <param name="capacity">Bin capacity.</param> + /// <param name="power">Exponent of the ordering key.</param> + /// <param name="noiseSeed">Seed of the small multiplicative jitter applied to the key.</param> + /// <param name="fit">"first", "best" or "worst" fit.</param> + /// <param name="passes">Repair passes.</param> + /// <returns>The bins, each a list of item sizes.</returns> + public static List<List<double>> Pack(double[] items, double capacity, double power, int noiseSeed, string fit, int passes) + { + var rng = new Random(noiseSeed); + var order = items.Select(s => (Size: s, Key: Math.Pow(s, power) * (1 + 0.05 * rng.NextDouble()))).OrderByDescending(p => p.Key).Select(p => p.Size); + var bins = new List<List<double>>(); + var loads = new List<double>(); + foreach (double s in order) + Place(s); + for (int p = 0; p < passes && bins.Count > 1; p++) + { + int victim = loads.IndexOf(loads.Min()); + var moved = bins[victim]; + bins.RemoveAt(victim); + loads.RemoveAt(victim); + int before = bins.Count; + foreach (double s in moved.OrderByDescending(x => x)) + Place(s); + if (bins.Count > before) + break; // could not empty it: stop repairing + } + return bins; + + // put one item into an existing bin by the fit rule, or open a new bin. + void Place(double s) + { + int chosen = -1; + for (int b = 0; b < bins.Count; b++) + { + if (loads[b] + s > capacity + 1e-9) + continue; + // best fit = the fullest bin that still fits; worst fit = the emptiest one. + if (chosen < 0 || (fit == "best" && loads[b] > loads[chosen]) || (fit == "worst" && loads[b] < loads[chosen])) + chosen = b; + if (fit == "first") + break; // first fit: the first bin that fits wins + } + if (chosen < 0) + { + bins.Add(new List<double>()); + loads.Add(0); + chosen = bins.Count - 1; + } + bins[chosen].Add(s); + loads[chosen] += s; + } + } +} diff --git a/examples/0_DistributedJournalHyperband.cs b/examples/0_DistributedJournalHyperband.cs new file mode 100644 index 0000000..ce34906 --- /dev/null +++ b/examples/0_DistributedJournalHyperband.cs @@ -0,0 +1,167 @@ +#:project ../src/OptunaSharp.Core/OptunaSharp.Core.csproj +#:property PublishAot=false + +// Distributed tuning on a shared journal file — three worker processes, each running two trial threads +// (`n_jobs=2`), optimize one study through a single JournalFileBackend file (Optuna's recipe for clusters +// that only share a file system), and HyperbandPruner coordinates early stopping across all six workers +// because every intermediate value lands in the same journal. +// +// source: https://optuna.readthedocs.io/en/stable/reference/generated/optuna.storages.journal.JournalFileBackend.html +// (the append-only, lock-protected journal file several processes can share) +// https://optuna.readthedocs.io/en/stable/tutorial/10_key_features/004_distributed.html +// https://optuna.readthedocs.io/en/stable/reference/generated/optuna.pruners.HyperbandPruner.html +// +// Real objective, real training: a deterministic house-price regression set (8 features with interactions, +// 3,000 train / 1,000 validation rows) and a polynomial-feature ridge model fitted by mini-batch SGD; every +// epoch reports the validation RMSE, so Hyperband's brackets can compare trials from different processes at +// the same epoch. The parent creates the study, starts the workers, waits, and then audits the shared file: +// unique trial numbers, every trial finished, and how much training the pruner saved. +// +// Run: dotnet run examples/0_DistributedJournalHyperband.cs + +using System.Diagnostics; +using System.Globalization; +using OptunaSharp; +using OptunaSharp.Logging; +using OptunaSharp.Pruners; +using OptunaSharp.Samplers; +using OptunaSharp.Storages.Journal; + +const string StudyName = "house-prices-sgd"; +const int MaxEpochs = 27; +string journal = args.Length > 1 ? args[1] : Path.Combine(Path.GetTempPath(), "optunasharp-house-prices.journal"); + +if (args.Length > 0 && args[0] == "--worker") +{ + // child mode: join the study through the shared file and run 16 trials on two threads. + OptunaLogging.SetVerbosity(LogLevel.Warning); + var data = Houses.Generate(seed: 41); + var worker = Optuna.LoadStudy(StudyName, new JournalStorage(new JournalFileBackend(journal)), + sampler: new TPESampler(seed: int.Parse(args[2], CultureInfo.InvariantCulture), nStartupTrials: 8), + pruner: new HyperbandPruner(minResource: 1, maxResource: MaxEpochs, reductionFactor: 3)); + worker.Optimize(t => Objective(t, data), nTrials: 16, nJobs: 2); + return; +} + +OptunaLogging.SetVerbosity(LogLevel.Warning); +File.Delete(journal); +Optuna.CreateStudy(storage: new JournalStorage(new JournalFileBackend(journal)), studyName: StudyName, direction: StudyDirection.Minimize); + +var sw = Stopwatch.StartNew(); +string dll = typeof(Houses).Assembly.Location; +var workers = Enumerable.Range(1, 3).Select(id => +{ + var psi = new ProcessStartInfo("dotnet") { RedirectStandardError = true, RedirectStandardOutput = true }; + foreach (var a in new[] { "exec", dll, "--worker", journal, id.ToString(CultureInfo.InvariantCulture) }) + psi.ArgumentList.Add(a); + return Process.Start(psi)!; +}).ToList(); +var errors = workers.Select(w => { w.StandardOutput.ReadToEnd(); string e = w.StandardError.ReadToEnd(); w.WaitForExit(); return (w.ExitCode, e); }).ToList(); +sw.Stop(); + +var study = Optuna.LoadStudy(StudyName, new JournalStorage(new JournalFileBackend(journal))); +var trials = study.Trials; +var numbers = trials.Select(t => t.Number).OrderBy(n => n).ToList(); +int epochs = trials.Sum(t => t.IntermediateValues.Count); +Console.WriteLine($"3 processes × 2 threads finished in {sw.Elapsed.TotalSeconds:F1} s, exit codes: {string.Join(", ", errors.Select(e => e.ExitCode))}"); +foreach (var (code, err) in errors.Where(e => e.ExitCode != 0)) + Console.WriteLine("worker stderr: " + err.Trim().Split('\n').Last()); +Console.WriteLine($"trials in the journal: {trials.Count}; numbers 0..{trials.Count - 1} each exactly once: {numbers.SequenceEqual(Enumerable.Range(0, trials.Count))}"); +Console.WriteLine("states: " + string.Join(", ", trials.GroupBy(t => t.State).Select(g => $"{g.Key} {g.Count()}"))); +Console.WriteLine($"epochs trained: {epochs} of {trials.Count * MaxEpochs} without pruning ({1 - (double)epochs / (trials.Count * MaxEpochs):P0} saved)"); +Console.WriteLine(string.Format(CultureInfo.InvariantCulture, "best validation RMSE: {0:F4} (trial #{1}); predicting the mean: {2:F4}", + study.BestValue, study.BestTrial.Number, Houses.Generate(seed: 41).MeanBaselineRmse())); +foreach (var kv in study.BestParams) + Console.WriteLine($" {kv.Key,-8} {kv.Value}"); + +/// <summary>Fits one SGD ridge configuration epoch by epoch, reporting the validation RMSE.</summary> +/// <param name="t">The trial proposing the learning rate, its decay, the L2 strength, the batch size and the feature degree.</param> +/// <param name="d">The house-price data.</param> +/// <returns>The validation RMSE after the last epoch.</returns> +/// <exception cref="TrialPruned">Hyperband stopped the configuration at one of its rungs.</exception> +static double Objective(Trial t, Houses d) +{ + double lr = t.SuggestFloat("lr", 1e-4, 0.5, log: true); + double decay = t.SuggestFloat("decay", 0.85, 1.0); + double l2 = t.SuggestFloat("l2", 1e-6, 1.0, log: true); + int batch = (int)t.SuggestCategorical("batch", new[] { 8, 32, 128 }); + bool quadratic = t.SuggestCategorical("quadratic", new[] { false, true }); // add pairwise products + var xs = quadratic ? d.TrainQ : d.Train; + var vs = quadratic ? d.ValidQ : d.Valid; + var w = new double[xs[0].Length]; + double b = 0, rmse = double.NaN; + for (int epoch = 1; epoch <= MaxEpochs; epoch++) + { + var order = Enumerable.Range(0, xs.Length).ToArray(); + new Random(epoch).Shuffle(order); + for (int s = 0; s < order.Length; s += batch) + { + var g = new double[w.Length]; + double gb = 0; + int end = Math.Min(s + batch, order.Length); + for (int k = s; k < end; k++) + { + int i = order[k]; + double err = Dot(w, xs[i]) + b - d.TrainY[i]; + for (int j = 0; j < w.Length; j++) g[j] += err * xs[i][j]; + gb += err; + } + for (int j = 0; j < w.Length; j++) w[j] -= lr * (g[j] / (end - s) + l2 * w[j]); + b -= lr * gb / (end - s); + } + lr *= decay; + rmse = Math.Sqrt(Enumerable.Range(0, vs.Length).Average(i => Math.Pow(Dot(w, vs[i]) + b - d.ValidY[i], 2))); + if (!double.IsFinite(rmse)) rmse = 1e3; // diverged: a bad finite value + t.Report(rmse, epoch); + if (t.ShouldPrune()) + throw new TrialPruned(); + } + return rmse; + + static double Dot(double[] w, double[] x) + { + double s = 0; + for (int j = 0; j < w.Length; j++) s += w[j] * x[j]; + return s; + } +} + +/// <summary>A standardized house-price regression set, with an optional quadratic feature expansion.</summary> +/// <param name="Train">Training rows (8 standardized features).</param> +/// <param name="TrainQ">Training rows with all pairwise products appended.</param> +/// <param name="TrainY">Training targets (log price, centred).</param> +/// <param name="Valid">Validation rows.</param> +/// <param name="ValidQ">Validation rows with pairwise products.</param> +/// <param name="ValidY">Validation targets.</param> +sealed record Houses(double[][] Train, double[][] TrainQ, double[] TrainY, double[][] Valid, double[][] ValidQ, double[] ValidY) +{ + /// <summary>Generates the data; the same seed gives the same houses.</summary> + /// <param name="seed">Data seed.</param> + /// <returns>The data set.</returns> + public static Houses Generate(int seed) + { + var rng = new Random(seed); // data generation only — samplers never use System.Random + int n = 4000; + var x = new double[n][]; + var y = new double[n]; + for (int i = 0; i < n; i++) + { + var r = Enumerable.Range(0, 8).Select(_ => Normal(rng)).ToArray(); // area, rooms, age, distance, … + y[i] = 0.5 * r[0] + 0.2 * r[1] - 0.25 * r[2] - 0.3 * r[3] + 0.15 * r[0] * r[4] - 0.1 * r[3] * r[3] + 0.1 * Normal(rng); + x[i] = r; + } + double[] Quad(double[] r) => r.Concat(from a in Enumerable.Range(0, 8) from c in Enumerable.Range(a, 8 - a) select r[a] * r[c]).ToArray(); + double mean = y.Take(3000).Average(); + var yc = y.Select(v => v - mean).ToArray(); + return new Houses(x[..3000], x[..3000].Select(Quad).ToArray(), yc[..3000], x[3000..], x[3000..].Select(Quad).ToArray(), yc[3000..]); + } + + /// <summary>RMSE of predicting the training mean on the validation rows.</summary> + /// <returns>The baseline RMSE.</returns> + public double MeanBaselineRmse() => Math.Sqrt(ValidY.Average(v => v * v)); + + /// <summary>A standard normal draw (Box–Muller).</summary> + /// <param name="rng">The random stream.</param> + /// <returns>A N(0, 1) variate.</returns> + private static double Normal(Random rng) => Math.Sqrt(-2 * Math.Log(1 - rng.NextDouble())) * Math.Cos(2 * Math.PI * rng.NextDouble()); +} diff --git a/examples/0_PricingRemoteWorkersGrpc.cs b/examples/0_PricingRemoteWorkersGrpc.cs new file mode 100644 index 0000000..f17f2e8 --- /dev/null +++ b/examples/0_PricingRemoteWorkersGrpc.cs @@ -0,0 +1,137 @@ +#:project ../src/OptunaSharp.Core/OptunaSharp.Core.csproj +#:project ../src/OptunaSharp.Storage.Sqlite/OptunaSharp.Storage.Sqlite.csproj +#:project ../src/OptunaSharp.Storage.Grpc/OptunaSharp.Storage.Grpc.csproj +#:property PublishAot=false + +// Remote workers through Optuna's gRPC storage proxy — the database stays on one host behind +// `run_grpc_proxy_server`; four .NET workers that only know the proxy's address (GrpcStorageProxy) tune a +// retailer's promotion pricing in parallel, and — when a Python with optuna is on PATH — a Python Optuna +// worker joins the same study over the same wire protocol. +// +// source: https://optuna.readthedocs.io/en/stable/reference/generated/optuna.storages.run_grpc_proxy_server.html +// https://optuna.readthedocs.io/en/stable/reference/generated/optuna.storages.GrpcStorageProxy.html +// (the proxy pair: one process owns the RDB storage, workers talk gRPC) +// +// Analytic objective, a standard retail model: weekly demand with constant price elasticity (−2.1), a +// promotion lift that grows with discount depth but decays over a long promo (customers stock up), a +// post-promo dip, and a margin floor. The knobs: list price, discount depth, promo length and how often to +// run it per quarter; the score is the quarter's gross profit in $k (maximized). The proxy fronts a SQLite +// file, so the finished study can also be opened directly afterwards. +// +// Run: dotnet run examples/0_PricingRemoteWorkersGrpc.cs + +using System.Diagnostics; +using System.Globalization; +using System.Net; +using System.Net.Sockets; +using OptunaSharp; +using OptunaSharp.Logging; +using OptunaSharp.Samplers; +using OptunaSharp.Storages; +using OptunaSharp.Storages.Grpc; + +OptunaLogging.SetVerbosity(LogLevel.Warning); // silence the per-trial INFO lines + +// 1. the database host: SQLite behind the gRPC proxy, on a free local port. +string db = Path.Combine(Path.GetTempPath(), "optunasharp-pricing.db"); +File.Delete(db); +using var sqlite = new RDBStorage("sqlite:///" + db.Replace('\\', '/')); +int port = FreePort(); +await using var server = GrpcProxyServer.MakeServer(sqlite, host: "127.0.0.1", port: port); +await server.StartAsync(); +Console.WriteLine($"gRPC storage proxy listening on 127.0.0.1:{port}, backed by {db}"); + +// 2. the study is created through the proxy, like any remote client would. +using (var admin = new GrpcStorageProxy("127.0.0.1", port)) + Optuna.CreateStudy(storage: admin, studyName: "q3-promo-pricing", direction: StudyDirection.Maximize); + +// 3. four .NET workers, each with its own proxy connection, plus an optional Python worker. +var pythonWorker = Task.Run(() => PythonWorker(port)); +var dotnetWorkers = Enumerable.Range(1, 4).Select(id => Task.Run(() => +{ + using var proxy = new GrpcStorageProxy("127.0.0.1", port); + var study = Optuna.LoadStudy("q3-promo-pricing", proxy, sampler: new TPESampler(seed: id, nStartupTrials: 10)); + study.Optimize(t => { t.SetUserAttr("worker", $".NET #{id}"); return Promo.QuarterProfit(t); }, nTrials: 15); +})).ToArray(); +await Task.WhenAll(dotnetWorkers); +string pythonNote = await pythonWorker; + +// 4. read the result back through the proxy. +using (var reader = new GrpcStorageProxy("127.0.0.1", port)) +{ + var study = Optuna.LoadStudy("q3-promo-pricing", reader); + var byWorker = study.Trials.GroupBy(t => (string?)t.UserAttrs.GetValueOrDefault("worker") ?? "?").Select(g => $"{g.Key}: {g.Count()}"); + Console.WriteLine($"trials: {study.Trials.Count} ({string.Join(", ", byWorker)}); {pythonNote}"); + var best = study.BestTrial; + Console.WriteLine(string.Format(CultureInfo.InvariantCulture, "best quarter profit ${0:N1}k by {1} (trial #{2}): {3}", best.Value, best.UserAttrs["worker"], best.Number, + string.Join(", ", best.Params.Select(kv => string.Format(CultureInfo.InvariantCulture, "{0}={1:G4}", kv.Key, kv.Value))))); +} +await server.StopAsync(); + +/// <summary>Finds a free TCP port on the loopback interface.</summary> +/// <returns>A port number that was free a moment ago.</returns> +static int FreePort() +{ + var l = new TcpListener(IPAddress.Loopback, 0); + l.Start(); + int p = ((IPEndPoint)l.LocalEndpoint).Port; + l.Stop(); + return p; +} + +/// <summary>Runs ten trials from Python Optuna through the same proxy, when Python and optuna are available.</summary> +/// <param name="port">The proxy's port.</param> +/// <returns>A one-line note on what the Python worker did.</returns> +static string PythonWorker(int port) +{ + string code = "import optuna,sys,math; optuna.logging.set_verbosity(optuna.logging.ERROR)\n" + + "from optuna.storages import GrpcStorageProxy\n" + + "s=optuna.load_study(study_name='q3-promo-pricing', storage=GrpcStorageProxy(host='127.0.0.1', port=int(sys.argv[1])), sampler=optuna.samplers.RandomSampler(seed=9))\n" + + "def obj(t):\n" + + " p=t.suggest_float('list_price',8,30); d=t.suggest_float('discount',0.0,0.5); w=t.suggest_int('promo_weeks',1,6); n=t.suggest_int('promos_per_quarter',0,3)\n" + + " t.set_user_attr('worker','Python')\n" + + " weeks=13; promo=min(weeks, n*w); base=1200*(p/15)**-2.1; lift=1+2.5*d*math.exp(-0.25*(w-1)); dip=1-0.35*d*min(n,promo)\n" + + " unit=max(p*(1-d)-6.0,-6.0); full=max(p-6.0,-6.0)\n" + + " return (promo*base*(1-d)**-2.1*lift*unit+(weeks-promo)*base*dip*full)/1000\n" + + "s.optimize(obj, n_trials=10)\n"; + try + { + var psi = new ProcessStartInfo("python") { RedirectStandardOutput = true, RedirectStandardError = true }; + foreach (var a in new[] { "-c", code, port.ToString(CultureInfo.InvariantCulture) }) + psi.ArgumentList.Add(a); + using var p = Process.Start(psi)!; + p.StandardOutput.ReadToEnd(); + string err = p.StandardError.ReadToEnd(); + p.WaitForExit(); + return p.ExitCode == 0 ? "a Python Optuna worker added its trials over gRPC" : "python worker failed: " + err.Trim().Split('\n').Last(); + } + catch (System.ComponentModel.Win32Exception) + { + return "no python on PATH — the Python worker was skipped"; + } +} + +/// <summary>The retail promotion model.</summary> +static class Promo +{ + /// <summary>Gross profit of one quarter (13 weeks) under the trial's pricing plan.</summary> + /// <param name="t">The trial proposing list price, discount depth, promo length and promo count.</param> + /// <returns>Profit in thousands of dollars.</returns> + public static double QuarterProfit(Trial t) + { + double price = t.SuggestFloat("list_price", 8, 30); // $ per unit + double discount = t.SuggestFloat("discount", 0.0, 0.5); // promo depth + long weeksPerPromo = t.SuggestInt("promo_weeks", 1, 6); + long promos = t.SuggestInt("promos_per_quarter", 0, 3); + const int Weeks = 13; + const double UnitCost = 6.0; + double promoWeeks = Math.Min(Weeks, promos * weeksPerPromo); + double baseDemand = 1200 * Math.Pow(price / 15, -2.1); // constant elasticity around $15 + double lift = 1 + 2.5 * discount * Math.Exp(-0.25 * (weeksPerPromo - 1)); // long promos lose their pull + double dip = 1 - 0.35 * discount * Math.Min(promos, promoWeeks); // stock-up hangover + double promoUnit = Math.Max(price * (1 - discount) - UnitCost, -UnitCost); + double fullUnit = Math.Max(price - UnitCost, -UnitCost); + return (promoWeeks * baseDemand * Math.Pow(1 - discount, -2.1) * lift * promoUnit + + (Weeks - promoWeeks) * baseDemand * dip * fullUnit) / 1000; + } +} diff --git a/examples/README.md b/examples/README.md index 01eadd6..6b5593b 100644 --- a/examples/README.md +++ b/examples/README.md @@ -58,6 +58,12 @@ classes). | [`0_RateLimiterHostedService.cs`](0_RateLimiterHostedService.cs) | Generic Host + DI (`AddOptunaStudyFactory` …), cancellation | a `BackgroundService` re-tunes an API gateway's token bucket every telemetry window | | [`0_PressureVesselParetoReport.cs`](0_PressureVesselParetoReport.cs) | NSGA-II, mixed directions, constraints, Pareto + hypervolume charts | pressure-vessel cost vs. capacity under the ASME thickness rules (RE23) | | [`0_SpamFilterTimeBudget.cs`](0_SpamFilterTimeBudget.cs) | TPE with only a `timeout`, `show_progress_bar` | a naive-Bayes spam filter tuned inside a fixed ten-second slot | +| [`0_DistributedJournalHyperband.cs`](0_DistributedJournalHyperband.cs) | 3 processes × `n_jobs=2` on one `JournalFileBackend`, `HyperbandPruner` | SGD ridge house-price model; Hyperband's brackets span all six workers through the shared file | +| [`0_ConcreteMixDesignGp.cs`](0_ConcreteMixDesignGp.cs) | `GPSampler` over stepped floats, ints and a categorical + 2 constraints — discrete choices identical to Optuna | concrete mix design: 28-day strength under a cost cap and a workability floor | +| [`0_BuildingEnergyForestSearchCV.cs`](0_BuildingEnergyForestSearchCV.cs) | `OptunaSearchCV` + Core's managed `RandomForestRegressor`, `KFold` | heating-load model for screening building designs; refitted forest scored on held-out designs | +| [`0_PricingRemoteWorkersGrpc.cs`](0_PricingRemoteWorkersGrpc.cs) | gRPC storage proxy (`MakeServer` over SQLite) + `GrpcStorageProxy` workers | promotion pricing tuned by four .NET workers and, if available, a Python Optuna worker over the same wire | +| [`0_ChurnScorecardTerminator.cs`](0_ChurnScorecardTerminator.cs) | `report_cross_validation_scores` + default `TerminatorCallback` | stop tuning a churn scorecard when the GP regret bound drops below the CV noise; compared with a full run | +| [`0_ContainerLoadingStopAtBound.cs`](0_ContainerLoadingStopAtBound.cs) | `enqueue_trial(skip_if_exists=True)`, `study.stop()` from a callback | a bin-packing heuristic for trailer loading, warm-started from planners' rules, stopped at the lower bound | Notes from running them: diff --git a/refs/NumSharp b/refs/NumSharp index d523eb4..65ef305 160000 --- a/refs/NumSharp +++ b/refs/NumSharp @@ -1 +1 @@ -Subproject commit d523eb4869c45ee23b2fd78ef8188c2e745de6c6 +Subproject commit 65ef305600d2a21d759ce726e4111e98c2c2ad37 diff --git a/src/OptunaSharp.Cli/CliProgram.cs b/src/OptunaSharp.Cli/CliProgram.cs index 84fb7c3..112509f 100644 --- a/src/OptunaSharp.Cli/CliProgram.cs +++ b/src/OptunaSharp.Cli/CliProgram.cs @@ -113,15 +113,32 @@ private static void SetVerbosity(ParseResult pr) OptunaLogging.SetVerbosity(level); } - /// <summary>Attaches the optional log-file destination selected by the command line.</summary> + /// <summary> + /// Handles <c>--log-file</c> as Optuna's <c>_set_log_file</c> does: the file is created (opened for append, as + /// <c>logging.FileHandler</c>'s constructor opens it), and no OptunaSharp record is ever written to it. + /// </summary> + /// <remarks> + /// Optuna attaches its <c>FileHandler</c> to Python's root logger (and sets the root to DEBUG), but the + /// <c>optuna</c> logger is configured with <c>propagate = False</c>, so none of Optuna's records reach the file: + /// measured at 0 bytes for <c>create-study</c>, with <c>-v</c>, and with <c>--debug</c> on a failing command, + /// while stderr still shows the records. OptunaSharp's logging has no root logger above the <c>optuna</c> one, so + /// attaching nothing is the exact equivalent. Copying this Optuna defect is the owner's decision of 2026-11-12 + /// (QA-65), as QA-46's slice-plot defect was copied. Creating the file keeps Optuna's failure mode too: a path + /// whose directory does not exist fails the command before it runs, as <c>FileHandler</c>'s constructor does. + /// </remarks> /// <param name="pr">The parsed command-line options for the current invocation.</param> + /// <exception cref="IOException">The file cannot be created or opened (for example, its directory does not exist).</exception> + /// <exception cref="UnauthorizedAccessException">The process may not write the file.</exception> private static void SetLogFile(ParseResult pr) { string? logFile = pr.GetValue(LogFileOpt); if (logFile is null) return; - var writer = new StreamWriter(logFile, append: true) { AutoFlush = true }; - OptunaLogging.AddHandler(new StreamLogHandler(writer)); + + // Opened for append and closed at once: the file exists afterwards, as Optuna's leaves it, and stays as it was. + using (new FileStream(logFile, FileMode.Append, FileAccess.Write, FileShare.ReadWrite)) + { + } } // ---- root/parser assembly — Optuna's _get_parser / _add_commands --------------------------- @@ -600,7 +617,11 @@ private static Command BuildTell() int? number = pr.GetValue(trialNumber); if (number is null) throw new NumSharp.ValueError("`--trial-number` is required."); - double[]? objectiveValues = pr.GetValue(values); + // An omitted `--values` binds an empty array, not null, where Optuna's argparse option (nargs="+") defaults + // to None; Core's tell then saw values next to a PRUNED / FAIL state and refused the call, so `tell --state + // fail` exited 1 and left the trial RUNNING (QA-63). The option takes one or more arguments, so an empty + // array always means it was omitted, as `--directions` already treats it. + double[]? objectiveValues = pr.GetValue(values) is { Length: > 0 } given ? given : null; study.Tell(number.Value, objectiveValues, trialState, pr.GetValue(skipIfFinished)); Log.Info($"Told trial {number.Value} with values {ReprValues(objectiveValues)} and state {StateRepr(trialState)}."); diff --git a/src/OptunaSharp.Cli/OptunaSharp.Cli.csproj b/src/OptunaSharp.Cli/OptunaSharp.Cli.csproj index 3a23010..fae7b29 100644 --- a/src/OptunaSharp.Cli/OptunaSharp.Cli.csproj +++ b/src/OptunaSharp.Cli/OptunaSharp.Cli.csproj @@ -12,12 +12,22 @@ <PublishAot>false</PublishAot> <IsTrimmable>false</IsTrimmable> + <!-- JIT posture: tiered compilation stays ON, TieredPGO is switched OFF, an override of the repo-wide default in + ../../Directory.Build.props written into the tool's runtimeconfig.json. Every `optunasharp` command is a fresh, + short process (the shell ask/tell loop launches two per trial), so PGO's instrumented tier (one more JIT of each + hot method, plus the probes' overhead while it runs) never pays back before the process exits; tier-1 code only + loses PGO-guided layout and guarded devirtualization, and no result changes. Measured 2026-11-12, net10.0 + Release, i9-13900K running other work at 60-100 % load: `ask` + `tell` on a SQLite study driven by TPE, medians + of 10 interleaved cycles, 1,794 ms per cycle with PGO and 1,578 ms without; a five-trial TPE process, medians + of 15 interleaved runs, CPU 406 -> 375 ms and time in the JIT 337 -> 319 ms. --> + <TieredPGO>false</TieredPGO> + <!-- Ships as a .NET global tool: `dotnet tool install -g OptunaSharp.Cli` exposes `optunasharp` (NOT `optuna` — that name belongs to the Python package; this is the drop-in .NET port). --> <PackageId>OptunaSharp.Cli</PackageId> <PackAsTool>true</PackAsTool> <ToolCommandName>optunasharp</ToolCommandName> - <Description>The OptunaSharp command-line tool — the port of the `optuna` CLI (optuna/cli.py) on System.CommandLine + YamlDotNet. Create/inspect studies and ask/tell trials against journal-file, SQLite (RDBStorage) and Redis storages from the shell, with byte-identical value/json/table output. Part of the SciSharp STACK.</Description> + <Description>The OptunaSharp command-line tool — the port of the `optuna` CLI (optuna/cli.py) on System.CommandLine. Create/inspect studies and ask/tell trials against journal-file, SQLite (RDBStorage) and Redis storages from the shell, with byte-identical value/json/table/yaml output. Part of the SciSharp STACK.</Description> <PackageTags>Optuna;OptunaSharp;CLI;Tool;dotnet-tool;HyperparameterOptimization;HPO;SciSharp</PackageTags> <GenerateDocumentationFile>true</GenerateDocumentationFile> @@ -39,10 +49,9 @@ </ItemGroup> <ItemGroup> - <!-- System.CommandLine: the argparse replacement (2.0.11 GA). YamlDotNet: the `-f yaml` output - (Python's yaml.safe_dump). --> + <!-- System.CommandLine: the argparse replacement (2.0.11 GA). The `-f yaml` output is PyYamlSafeDump.cs, a port of + PyYAML's safe_dump (YamlDotNet changed value types, QA-61). --> <PackageReference Include="System.CommandLine" Version="2.0.11" /> - <PackageReference Include="YamlDotNet" Version="18.1.0" /> </ItemGroup> <ItemGroup> diff --git a/src/OptunaSharp.Cli/OutputFormat.cs b/src/OptunaSharp.Cli/OutputFormat.cs index e9fc35e..c916a50 100644 --- a/src/OptunaSharp.Cli/OutputFormat.cs +++ b/src/OptunaSharp.Cli/OutputFormat.cs @@ -7,7 +7,6 @@ using System.Text; using OptunaSharp; using OptunaSharp.Internal; -using YamlDotNet.Serialization; namespace OptunaSharp.Cli; @@ -45,8 +44,8 @@ internal sealed class PyTuple : IReadOnlyList<object?> /// <c>_convert_to_dict</c>, <c>_dump_value</c>, <c>_dump_table</c>, <c>CellValue</c> and /// <c>_format_output</c>. The <c>value</c>/<c>table</c> formats render through Core's /// <see cref="PythonRepr" /> (CPython <c>str()</c>/<c>repr()</c>), <c>json</c> through Core's -/// <see cref="PyJson" /> (<c>json.dumps</c>), so the stdout bytes match the <c>optuna</c> command. -/// <c>yaml</c> is best-effort over YamlDotNet (PyYAML's exact byte output is not a parity target). +/// <see cref="PyJson" /> (<c>json.dumps</c>), and <c>yaml</c> through <see cref="PyYamlSafeDump" /> (PyYAML's +/// <c>safe_dump</c>), so the stdout bytes match the <c>optuna</c> command. /// </summary> internal static class OutputFormat { @@ -402,43 +401,17 @@ private static string Format(List<Dictionary<Column, object?>> records, List<Col } } - // ------------------------------------------------------------------ yaml (best-effort) + // ------------------------------------------------------------------ yaml - // WithQuotingNecessaryStrings(true) quotes scalars that YAML 1.1's implicit resolver (PyYAML's - // schema) would otherwise reinterpret — timestamps, sexagesimals, bools, etc. — approximating - // yaml.safe_dump's quoting. YAML byte-parity with PyYAML is best-effort, not a hard target. - private static readonly ISerializer YamlSerializer = - new SerializerBuilder().WithQuotingNecessaryStrings(quoteYaml1_1Strings: true).Build(); - - /// <summary>Serializes a plain managed collection tree through the configured YAML serializer.</summary> - /// <param name="value">The scalar or composite value to parse, classify, or render.</param> - /// <returns>The serialized YAML text.</returns> - private static string DumpYaml(object value) => YamlSerializer.Serialize(ToPlainForYaml(value)); - - // YamlDotNet serializes generic collections; convert the OrderedDictionary/list/tuple tree to - // Dictionary/List (keys sorted, approximating PyYAML's sort_keys=True default). - /// <summary>Converts ordered dictionaries and tuple wrappers to sorted-key dictionaries and lists for YAML serialization.</summary> - /// <param name="value">The scalar or composite value to parse, classify, or render.</param> - /// <returns>A plain managed value tree suitable for YAML serialization.</returns> - private static object? ToPlainForYaml(object? value) - { - switch (value) - { - case OrderedDictionary od: - { - var dict = new Dictionary<string, object?>(); - foreach (DictionaryEntry e in od) - dict[Convert.ToString(e.Key, CultureInfo.InvariantCulture)!] = ToPlainForYaml(e.Value); - return dict.OrderBy(kv => kv.Key, StringComparer.Ordinal).ToDictionary(kv => kv.Key, kv => kv.Value); - } - case string s: - return s; - case PyTuple tup: - return tup.Select(ToPlainForYaml).ToList(); - case IEnumerable seq: - return seq.Cast<object?>().Select(ToPlainForYaml).ToList(); - default: - return value; - } - } + /// <summary> + /// <c>yaml.safe_dump(value)</c>, byte for byte (<see cref="PyYamlSafeDump" />): floats keep a decimal point + /// (<c>2.0</c>, <c>1.0e-07</c>), strings that YAML 1.1 would read as another type (the formatted datetimes, + /// <c>'no'</c>) are quoted and others stay plain, keys are sorted, and long strings fold at 80 columns. The tree + /// is passed as <c>_format_value</c> left it: tuples dump as sequences, as in PyYAML. + /// </summary> + /// <param name="value">The record or list of records to dump.</param> + /// <returns>The YAML text with PyYAML's trailing line break (the caller trims it, as Optuna strips it).</returns> + /// <exception cref="ArgumentException">A value of a type <c>safe_dump</c> cannot represent.</exception> + /// <exception cref="NumSharp.TypeError">A mapping mixes string and numeric keys, which Python's <c>sorted</c> refuses.</exception> + private static string DumpYaml(object value) => PyYamlSafeDump.Dump(value); } diff --git a/src/OptunaSharp.Cli/PyYamlSafeDump.cs b/src/OptunaSharp.Cli/PyYamlSafeDump.cs new file mode 100644 index 0000000..8bcf2e0 --- /dev/null +++ b/src/OptunaSharp.Cli/PyYamlSafeDump.cs @@ -0,0 +1,1071 @@ +using System; +using System.Collections; +using System.Collections.Generic; +using System.Collections.Specialized; +using System.Globalization; +using System.Linq; +using System.Text; +using System.Text.RegularExpressions; +using OptunaSharp.Internal; + +namespace OptunaSharp.Cli; + +/// <summary> +/// PyYAML 6's <c>yaml.safe_dump(value)</c> for the value trees the CLI prints with <c>-f yaml</c>: mappings, sequences +/// and the scalars Optuna's <c>_format_value</c> leaves (<c>None</c>, bool, int, float, str). It ports the parts of +/// PyYAML's <c>SafeRepresenter</c>, <c>Serializer</c>, <c>Resolver</c> and <c>Emitter</c> those trees reach, so the +/// output is PyYAML's byte for byte, and a YAML 1.1 reader reads every value back with its type (QA-61). +/// </summary> +/// <remarks> +/// <para> +/// <b>Why not YamlDotNet.</b> The CLI used YamlDotNet with YAML 1.1 quoting, which wrote <c>2.0</c> as <c>2</c>, +/// <c>1e-07</c> as <c>1E-07</c> (a string to PyYAML: YAML 1.1 floats need a decimal point), <c>1e16</c> as +/// <c>10000000000000000</c> and the formatted datetimes bare (datetimes to PyYAML, strings in Optuna's output), +/// and it quoted keys such as <c>y</c> that PyYAML's resolver leaves plain. Those are type changes, not only byte +/// differences, for anyone parsing the CLI's YAML. +/// </para> +/// <para> +/// <b>What is ported.</b> <c>safe_dump</c>'s defaults: block style for non-empty collections, flow <c>[]</c> / +/// <c>{}</c> for empty ones, sorted mapping keys, indent 2 with indentless sequences under mapping keys, width 80 +/// (long plain, single- and double-quoted scalars fold), <c>allow_unicode=False</c> (non-ASCII text is +/// double-quoted with <c>\x</c>, <c>\u</c>, <c>\U</c> escapes), and YAML 1.1's implicit resolvers, which decide +/// whether a string can stay plain or must be quoted to keep it a string. Tags, anchors, aliases, explicit +/// documents and the literal / folded block styles are never produced by <c>safe_dump</c> for these trees and are +/// not ported. +/// </para> +/// <para> +/// <b>Footgun.</b> A value of any other type raises, as PyYAML's <c>RepresenterError</c> does: callers format +/// datetimes and other objects to strings first, exactly as Optuna's <c>_format_value</c> does. +/// </para> +/// </remarks> +internal static class PyYamlSafeDump +{ + /// <summary> + /// Dumps <paramref name="value" /> as <c>yaml.safe_dump(value)</c> does, including the trailing line break + /// (Optuna strips it). + /// </summary> + /// <param name="value"> + /// A tree of <see cref="IDictionary" /> / <see cref="OrderedDictionary" /> mappings, non-string + /// <see cref="IEnumerable" /> sequences (lists and tuples alike, as PyYAML represents both as sequences), and + /// <c>null</c>, <see cref="bool" />, integral, <see cref="double" /> / <see cref="float" /> or <see cref="string" /> + /// scalars. + /// </param> + /// <returns>PyYAML's output text.</returns> + /// <exception cref="ArgumentException">A value of an unsupported type (PyYAML's <c>cannot represent an object</c>).</exception> + /// <exception cref="NumSharp.TypeError">A mapping mixes string and numeric keys, which Python's <c>sorted</c> refuses.</exception> + internal static string Dump(object? value) + { + var events = new List<Event>(); + Represent(value, events); + var emitter = new Emitter(events); + return emitter.Run(); + } + + // ---------------------------------------------------------------- representer + serializer + + /// <summary>The node events PyYAML's serializer hands its emitter (only the kinds safe_dump produces here).</summary> + private abstract record Event; + + /// <summary> + /// A scalar node: its text, its tag in PyYAML's short form, and PyYAML's <c>implicit</c> pair. + /// <c>PlainImplicit</c> says the text resolves to its own tag when written plain (a string that would not read + /// back as something else); <c>QuotedImplicit</c> says it needs no tag when quoted (true for strings only). + /// </summary> + /// <param name="Value">The scalar's text as PyYAML's representer writes it.</param> + /// <param name="Tag"> + /// The prepared tag (<c>!!str</c>, <c>!!int</c>, <c>!!float</c>, <c>!!bool</c>, <c>!!null</c>). It is never written + /// for these scalars, but <c>check_simple_key</c> counts its length toward the 128-character limit, so a string + /// key of 123 characters or more is already a complex <c>?</c> key. + /// </param> + /// <param name="PlainImplicit">PyYAML's <c>implicit[0]</c>.</param> + /// <param name="QuotedImplicit">PyYAML's <c>implicit[1]</c>.</param> + private sealed record ScalarEvent(string Value, string Tag, bool PlainImplicit, bool QuotedImplicit) : Event; + + /// <summary>The start of a sequence node.</summary> + private sealed record SequenceStartEvent : Event; + + /// <summary>The end of a sequence node.</summary> + private sealed record SequenceEndEvent : Event; + + /// <summary>The start of a mapping node.</summary> + private sealed record MappingStartEvent : Event; + + /// <summary>The end of a mapping node.</summary> + private sealed record MappingEndEvent : Event; + + /// <summary> + /// PyYAML's <c>SafeRepresenter</c> + <c>Serializer</c> for one value: appends the node events of + /// <paramref name="value" /> to <paramref name="events" />. + /// </summary> + /// <param name="value">The value to represent (see <see cref="Dump" />).</param> + /// <param name="events">The event list being built.</param> + /// <exception cref="ArgumentException">A value of an unsupported type.</exception> + /// <exception cref="NumSharp.TypeError">A mapping mixes string and numeric keys.</exception> + private static void Represent(object? value, List<Event> events) + { + switch (value) + { + case null: + events.Add(new ScalarEvent("null", "!!null", true, false)); + return; + case bool b: + events.Add(new ScalarEvent(b ? "true" : "false", "!!bool", true, false)); + return; + case string s: + // A string is written plain only if PyYAML's implicit resolvers would read it back as a string. + events.Add(new ScalarEvent(s, "!!str", ResolvesToString(s), true)); + return; + case double d: + events.Add(new ScalarEvent(RepresentFloat(d), "!!float", true, false)); + return; + case float f: + events.Add(new ScalarEvent(RepresentFloat(f), "!!float", true, false)); + return; + case sbyte or byte or short or ushort or int or uint or long or ulong or System.Numerics.BigInteger: + events.Add(new ScalarEvent(Convert.ToString(value, CultureInfo.InvariantCulture)!, "!!int", true, false)); + return; + case OrderedDictionary od: + RepresentMapping(od.Cast<DictionaryEntry>().Select(e => (e.Key, e.Value)), events); + return; + case IDictionary dict: + RepresentMapping(dict.Cast<DictionaryEntry>().Select(e => (e.Key, e.Value)), events); + return; + case IEnumerable seq: + events.Add(new SequenceStartEvent()); + foreach (object? item in seq) + Represent(item, events); + events.Add(new SequenceEndEvent()); + return; + default: + throw new ArgumentException($"cannot represent an object: {value}"); + } + } + + /// <summary> + /// <c>represent_mapping</c> with <c>sort_keys=True</c>: the items in Python's <c>sorted(mapping.items())</c> order, + /// strings by code point and numbers by value. + /// </summary> + /// <param name="items">The mapping's items.</param> + /// <param name="events">The event list being built.</param> + /// <exception cref="ArgumentException">A key or value of an unsupported type.</exception> + /// <exception cref="NumSharp.TypeError">String and numeric keys are mixed.</exception> + private static void RepresentMapping(IEnumerable<(object Key, object? Value)> items, List<Event> events) + { + var list = items.ToList(); + list.Sort((a, b) => ComparePythonKeys(a.Key, b.Key)); + events.Add(new MappingStartEvent()); + foreach (var (key, val) in list) + { + Represent(key, events); + Represent(val, events); + } + events.Add(new MappingEndEvent()); + } + + /// <summary> + /// Python's <c><</c> on two mapping keys: strings compare by Unicode code point (not UTF-16 unit, which orders + /// astral characters differently), numbers by value; a string against a number raises, as <c>sorted</c> does. + /// </summary> + /// <param name="a">The first key.</param> + /// <param name="b">The second key.</param> + /// <returns>Negative, zero or positive, as <see cref="IComparer{T}.Compare" />.</returns> + /// <exception cref="NumSharp.TypeError">One key is a string and the other is not.</exception> + private static int ComparePythonKeys(object a, object b) + { + if (a is string sa && b is string sb) + return CompareCodePoints(sa, sb); + if (a is string || b is string) + throw new NumSharp.TypeError( + $"'<' not supported between instances of '{PyTypeName(a)}' and '{PyTypeName(b)}'"); + return Convert.ToDouble(a, CultureInfo.InvariantCulture) + .CompareTo(Convert.ToDouble(b, CultureInfo.InvariantCulture)); + } + + /// <summary>The Python type name of a key, for <see cref="ComparePythonKeys" />'s error message.</summary> + /// <param name="v">The key.</param> + /// <returns><c>str</c>, <c>float</c>, <c>bool</c> or <c>int</c>.</returns> + private static string PyTypeName(object v) => v switch + { + string => "str", + double or float => "float", + bool => "bool", + _ => "int", + }; + + /// <summary>Compares two strings code point by code point, as Python compares <c>str</c>.</summary> + /// <param name="a">The first string.</param> + /// <param name="b">The second string.</param> + /// <returns>Negative, zero or positive.</returns> + private static int CompareCodePoints(string a, string b) + { + // Rune enumeration decodes surrogate pairs, so an astral character sorts after U+FFFF as in Python; an unpaired + // surrogate becomes U+FFFD here, which only matters for strings Python itself could not have produced from JSON. + using var ea = a.EnumerateRunes().GetEnumerator(); + using var eb = b.EnumerateRunes().GetEnumerator(); + while (true) + { + bool ha = ea.MoveNext(), hb = eb.MoveNext(); + if (!ha || !hb) + return ha.CompareTo(hb); + int c = ea.Current.Value.CompareTo(eb.Current.Value); + if (c != 0) + return c; + } + } + + /// <summary> + /// <c>SafeRepresenter.represent_float</c>: <c>.nan</c>, <c>.inf</c>, <c>-.inf</c>, otherwise + /// <c>repr(data).lower()</c> with <c>.0</c> inserted before an exponent that has no decimal point + /// (<c>1e-07</c> → <c>1.0e-07</c>), which YAML 1.1's float resolver requires. + /// </summary> + /// <param name="d">The value.</param> + /// <returns>PyYAML's text for it.</returns> + private static string RepresentFloat(double d) + { + if (double.IsNaN(d)) + return ".nan"; + if (double.IsPositiveInfinity(d)) + return ".inf"; + if (double.IsNegativeInfinity(d)) + return "-.inf"; + string value = PythonRepr.FloatRepr(d).ToLowerInvariant(); + if (!value.Contains('.') && value.Contains('e')) + { + int e = value.IndexOf('e'); + value = value[..e] + ".0" + value[e..]; + } + return value; + } + + // ---------------------------------------------------------------- resolver (YAML 1.1, PyYAML's Resolver) + + // PyYAML's implicit resolvers, keyed by the first characters they are registered for, in registration order. The + // patterns are its re.X patterns with the insignificant whitespace removed; `$` matches before a final line break in + // both Python's re and .NET, so "yes\n" resolves to bool in both. + private static readonly Regex BoolRe = new( + @"^(?:yes|Yes|YES|no|No|NO|true|True|TRUE|false|False|FALSE|on|On|ON|off|Off|OFF)$", RegexOptions.CultureInvariant); + + private static readonly Regex FloatRe = new( + @"^(?:[-+]?(?:[0-9][0-9_]*)\.[0-9_]*(?:[eE][-+][0-9]+)?|\.[0-9][0-9_]*(?:[eE][-+][0-9]+)?" + + @"|[-+]?[0-9][0-9_]*(?::[0-5]?[0-9])+\.[0-9_]*|[-+]?\.(?:inf|Inf|INF)|\.(?:nan|NaN|NAN))$", + RegexOptions.CultureInvariant); + + private static readonly Regex IntRe = new( + @"^(?:[-+]?0b[0-1_]+|[-+]?0[0-7_]+|[-+]?(?:0|[1-9][0-9_]*)|[-+]?0x[0-9a-fA-F_]+" + + @"|[-+]?[1-9][0-9_]*(?::[0-5]?[0-9])+)$", + RegexOptions.CultureInvariant); + + private static readonly Regex MergeRe = new(@"^(?:<<)$", RegexOptions.CultureInvariant); + + private static readonly Regex NullRe = new(@"^(?:~|null|Null|NULL|)$", RegexOptions.CultureInvariant); + + private static readonly Regex TimestampRe = new( + @"^(?:[0-9][0-9][0-9][0-9]-[0-9][0-9]-[0-9][0-9]" + + @"|[0-9][0-9][0-9][0-9]-[0-9][0-9]?-[0-9][0-9]?(?:[Tt]|[ \t]+)[0-9][0-9]?:[0-9][0-9]:[0-9][0-9](?:\.[0-9]*)?" + + @"(?:[ \t]*(?:Z|[-+][0-9][0-9]?(?::[0-9][0-9])?))?)$", + RegexOptions.CultureInvariant); + + private static readonly Regex ValueRe = new(@"^(?:=)$", RegexOptions.CultureInvariant); + + private static readonly Regex YamlRe = new(@"^(?:!|&|\*)$", RegexOptions.CultureInvariant); + + /// <summary> + /// Whether PyYAML's <c>Resolver.resolve(ScalarNode, value, (True, False))</c> gives the string tag: no implicit + /// resolver registered for the value's first character (or for the empty string) matches it. + /// </summary> + /// <param name="value">The string scalar.</param> + /// <returns><c>true</c> when the string may be written plain and still read back as a string.</returns> + private static bool ResolvesToString(string value) + { + if (value.Length == 0) + return !NullRe.IsMatch(value); + // .NET Regex reads UTF-16; the first character decides which resolvers apply, as in PyYAML's dictionary. + char first = value[0]; + foreach (Regex re in ResolversFor(first)) + if (re.IsMatch(value)) + return false; + return true; + } + + /// <summary>The resolvers PyYAML registered for <paramref name="first" />, in registration order.</summary> + /// <param name="first">A scalar's first character.</param> + /// <returns>The patterns to try.</returns> + private static IEnumerable<Regex> ResolversFor(char first) + { + if ("yYnNtTfFoO".Contains(first)) yield return BoolRe; + if ("-+0123456789.".Contains(first)) yield return FloatRe; + if ("-+0123456789".Contains(first)) yield return IntRe; + if (first == '<') yield return MergeRe; + if (first is '~' or 'n' or 'N') yield return NullRe; + if ("0123456789".Contains(first)) yield return TimestampRe; + if (first == '=') yield return ValueRe; + if (first is '!' or '&' or '*') yield return YamlRe; + } + + // ---------------------------------------------------------------- emitter (PyYAML's Emitter, block style) + + /// <summary>PyYAML's <c>ScalarAnalysis</c>: what a scalar's characters allow.</summary> + /// <param name="Scalar">The text.</param> + /// <param name="Empty">The text is empty.</param> + /// <param name="Multiline">The text contains a line break.</param> + /// <param name="AllowFlowPlain">Plain style is allowed inside flow collections.</param> + /// <param name="AllowBlockPlain">Plain style is allowed in block context.</param> + /// <param name="AllowSingleQuoted">Single-quoted style is allowed.</param> + /// <param name="AllowDoubleQuoted">Double-quoted style is allowed (always).</param> + /// <param name="AllowBlock">Literal / folded block style is allowed.</param> + private sealed record ScalarAnalysis( + string Scalar, bool Empty, bool Multiline, bool AllowFlowPlain, bool AllowBlockPlain, + bool AllowSingleQuoted, bool AllowDoubleQuoted, bool AllowBlock); + + /// <summary> + /// A port of PyYAML's <c>Emitter</c> state machine for the events <see cref="Represent" /> produces, with + /// <c>safe_dump</c>'s settings (indent 2, width 80, line break <c>\n</c>, <c>allow_unicode=False</c>, not + /// canonical). Method names follow PyYAML's so the two can be read side by side. + /// </summary> + private sealed class Emitter + { + private const int BestIndent = 2; + private const int BestWidth = 80; + private const string LineBreaks = "\n\u0085\u2028\u2029"; + private const string Whitespace = "\0 \t\r\n\u0085\u2028\u2029"; + + private readonly List<Event> _events; + private readonly StringBuilder _out = new(); + private readonly Stack<Action> _states = new(); + private readonly Stack<int?> _indents = new(); + private int _position; + private Event? _event; + private int? _indent; + private int _flowLevel; + private bool _rootContext, _sequenceContext, _mappingContext, _simpleKeyContext; + private int _column; + private bool _whitespace = true; + private bool _indention = true; + // PyYAML's open_ended: a plain scalar at the root leaves the document open, so the stream ends with `...`. + private bool _openEnded; + private ScalarAnalysis? _analysis; + private char? _style; + + /// <summary>Creates an emitter over a complete event list (one document).</summary> + /// <param name="events">The node events of the value, without stream or document events.</param> + internal Emitter(List<Event> events) => _events = events; + + /// <summary> + /// Emits the stream: an implicit first document (no <c>---</c>), the root node, the document end's line break, + /// and, when the root was a plain scalar, the stream end's <c>...</c> line (PyYAML's <c>open_ended</c>). + /// </summary> + /// <returns>The emitted text.</returns> + internal string Run() + { + // expect_document_start(first=True) with an implicit document writes nothing; expect_document_root pushes + // expect_document_end and emits the root node. + _states.Push(ExpectDocumentEnd); + _event = Next(); + ExpectNode(root: true); + while (_states.Count > 0) + { + Action state = _states.Pop(); + if (state == ExpectDocumentEnd) + { + ExpectDocumentEnd(); + // expect_document_start on the StreamEndEvent: an open-ended document is closed explicitly. + if (_openEnded) + { + WriteIndicator("...", true); + WriteIndent(); + } + break; + } + _event = Next(); + state(); + } + return _out.ToString(); + } + + /// <summary>Takes the next event, or <c>null</c> once the document's events are exhausted.</summary> + /// <returns>The next event.</returns> + private Event? Next() => _position < _events.Count ? _events[_position++] : null; + + /// <summary>The event after the current one, PyYAML's <c>self.events[0]</c>.</summary> + private Event? Peek => _position < _events.Count ? _events[_position] : null; + + /// <summary><c>expect_document_end</c> for a non-explicit end: a final indent (line break).</summary> + private void ExpectDocumentEnd() => WriteIndent(); + + /// <summary><c>increase_indent</c>.</summary> + /// <param name="flow">Whether a flow collection or a scalar is starting.</param> + /// <param name="indentless">Whether a block sequence sits at its mapping key's indent.</param> + private void IncreaseIndent(bool flow = false, bool indentless = false) + { + _indents.Push(_indent); + if (_indent is null) + _indent = flow ? BestIndent : 0; + else if (!indentless) + _indent += BestIndent; + } + + /// <summary><c>expect_node</c> for the current event.</summary> + /// <param name="root">The node is the document root.</param> + /// <param name="sequence">The node is a sequence item.</param> + /// <param name="mapping">The node is a mapping key or value.</param> + /// <param name="simpleKey">The node is a simple (implicit) mapping key.</param> + /// <exception cref="InvalidOperationException">The current event is not a node (an event list out of order; never produced by <see cref="Represent" />).</exception> + private void ExpectNode(bool root = false, bool sequence = false, bool mapping = false, bool simpleKey = false) + { + _rootContext = root; + _sequenceContext = sequence; + _mappingContext = mapping; + _simpleKeyContext = simpleKey; + switch (_event) + { + case ScalarEvent: + ExpectScalar(); + break; + case SequenceStartEvent: + // safe_dump's default_flow_style=False: block style, except that an empty collection is flow. + if (_flowLevel > 0 || CheckEmptySequence()) + ExpectFlowSequence(); + else + ExpectBlockSequence(); + break; + case MappingStartEvent: + if (_flowLevel > 0 || CheckEmptyMapping()) + ExpectFlowMapping(); + else + ExpectBlockMapping(); + break; + default: + throw new InvalidOperationException($"expected NodeEvent, but got {_event}"); + } + } + + /// <summary><c>expect_scalar</c>.</summary> + private void ExpectScalar() + { + IncreaseIndent(flow: true); + ProcessScalar(); + _indent = _indents.Pop(); + } + + /// <summary><c>expect_flow_sequence</c>, reached only by an empty sequence here.</summary> + private void ExpectFlowSequence() + { + WriteIndicator("[", true, whitespace: true); + _flowLevel++; + IncreaseIndent(flow: true); + _states.Push(ExpectFirstFlowSequenceItem); + } + + /// <summary><c>expect_first_flow_sequence_item</c>: the sequence's end, as it is empty.</summary> + /// <exception cref="InvalidOperationException">A flow sequence has items (never produced by <see cref="Dump" />).</exception> + private void ExpectFirstFlowSequenceItem() + { + if (_event is not SequenceEndEvent) + throw new InvalidOperationException("non-empty flow sequences are not produced by safe_dump"); + _indent = _indents.Pop(); + _flowLevel--; + WriteIndicator("]", false); + } + + /// <summary><c>expect_flow_mapping</c>, reached only by an empty mapping here.</summary> + private void ExpectFlowMapping() + { + WriteIndicator("{", true, whitespace: true); + _flowLevel++; + IncreaseIndent(flow: true); + _states.Push(ExpectFirstFlowMappingKey); + } + + /// <summary><c>expect_first_flow_mapping_key</c>: the mapping's end, as it is empty.</summary> + /// <exception cref="InvalidOperationException">A flow mapping has items (never produced by <see cref="Dump" />).</exception> + private void ExpectFirstFlowMappingKey() + { + if (_event is not MappingEndEvent) + throw new InvalidOperationException("non-empty flow mappings are not produced by safe_dump"); + _indent = _indents.Pop(); + _flowLevel--; + WriteIndicator("}", false); + } + + /// <summary><c>expect_block_sequence</c>: a sequence that is a mapping value stays at the key's indent.</summary> + private void ExpectBlockSequence() + { + bool indentless = _mappingContext && !_indention; + IncreaseIndent(flow: false, indentless: indentless); + _states.Push(ExpectFirstBlockSequenceItem); + } + + /// <summary><c>expect_first_block_sequence_item</c>.</summary> + private void ExpectFirstBlockSequenceItem() => ExpectBlockSequenceItem(first: true); + + /// <summary><c>expect_block_sequence_item</c>.</summary> + private void ExpectNextBlockSequenceItem() => ExpectBlockSequenceItem(first: false); + + /// <summary><c>expect_block_sequence_item</c>.</summary> + /// <param name="first">Whether this is the first item (a sequence end cannot come first).</param> + private void ExpectBlockSequenceItem(bool first) + { + if (!first && _event is SequenceEndEvent) + { + _indent = _indents.Pop(); + return; + } + WriteIndent(); + WriteIndicator("-", true, indention: true); + _states.Push(ExpectNextBlockSequenceItem); + ExpectNode(sequence: true); + } + + /// <summary><c>expect_block_mapping</c>.</summary> + private void ExpectBlockMapping() + { + IncreaseIndent(flow: false); + _states.Push(ExpectFirstBlockMappingKey); + } + + /// <summary><c>expect_first_block_mapping_key</c>.</summary> + private void ExpectFirstBlockMappingKey() => ExpectBlockMappingKey(first: true); + + /// <summary><c>expect_block_mapping_key</c>.</summary> + private void ExpectNextBlockMappingKey() => ExpectBlockMappingKey(first: false); + + /// <summary><c>expect_block_mapping_key</c>: a simple <c>key:</c> when possible, else <c>? key</c>.</summary> + /// <param name="first">Whether this is the first key (a mapping end cannot come first).</param> + private void ExpectBlockMappingKey(bool first) + { + if (!first && _event is MappingEndEvent) + { + _indent = _indents.Pop(); + return; + } + WriteIndent(); + if (CheckSimpleKey()) + { + _states.Push(ExpectBlockMappingSimpleValue); + ExpectNode(mapping: true, simpleKey: true); + } + else + { + WriteIndicator("?", true, indention: true); + _states.Push(ExpectBlockMappingValue); + ExpectNode(mapping: true); + } + } + + /// <summary><c>expect_block_mapping_simple_value</c>.</summary> + private void ExpectBlockMappingSimpleValue() + { + WriteIndicator(":", false); + _states.Push(ExpectNextBlockMappingKey); + ExpectNode(mapping: true); + } + + /// <summary><c>expect_block_mapping_value</c>, after a complex (<c>?</c>) key.</summary> + private void ExpectBlockMappingValue() + { + WriteIndent(); + WriteIndicator(":", true, indention: true); + _states.Push(ExpectNextBlockMappingKey); + ExpectNode(mapping: true); + } + + /// <summary><c>check_empty_sequence</c>.</summary> + /// <returns>Whether the current sequence start is followed by its end.</returns> + private bool CheckEmptySequence() => _event is SequenceStartEvent && Peek is SequenceEndEvent; + + /// <summary><c>check_empty_mapping</c>.</summary> + /// <returns>Whether the current mapping start is followed by its end.</returns> + private bool CheckEmptyMapping() => _event is MappingStartEvent && Peek is MappingEndEvent; + + /// <summary> + /// <c>check_simple_key</c>: a key can be written as <c>key:</c> when it is a scalar with no line break whose + /// prepared tag and text together are shorter than 128 characters, or an empty collection. + /// </summary> + /// <returns>Whether the current key is simple.</returns> + private bool CheckSimpleKey() + { + int length = 0; + if (_event is ScalarEvent scalar) + { + // Every represented node carries a tag, so PyYAML adds its prepared form (`!!str` and so on) even though + // the tag is never written for these scalars. + length += scalar.Tag.Length; + _analysis ??= AnalyzeScalar(scalar.Value); + // Python's len(): code points, so an astral character counts once toward the 128 limit. + length += CodePointLength(_analysis.Scalar); + } + else if (_event is SequenceStartEvent or MappingStartEvent) + { + length += "!!seq".Length; // `!!seq` and `!!map` are both five characters + } + return length < 128 + && ((_event is ScalarEvent && !_analysis!.Empty && !_analysis.Multiline) + || CheckEmptySequence() || CheckEmptyMapping()); + } + + /// <summary><c>choose_scalar_style</c> with no requested style: plain, else single-quoted, else double-quoted.</summary> + /// <returns><c>null</c> for plain, <c>'</c> or <c>"</c>.</returns> + private char? ChooseScalarStyle() + { + var scalar = (ScalarEvent)_event!; + _analysis ??= AnalyzeScalar(scalar.Value); + if (scalar.PlainImplicit + && !(_simpleKeyContext && (_analysis.Empty || _analysis.Multiline)) + && ((_flowLevel > 0 && _analysis.AllowFlowPlain) || (_flowLevel == 0 && _analysis.AllowBlockPlain))) + return null; + if (_analysis.AllowSingleQuoted && !(_simpleKeyContext && _analysis.Multiline)) + return '\''; + return '"'; + } + + /// <summary> + /// <c>process_tag</c> + <c>process_scalar</c>: safe_dump's scalars never need a tag (their style matches + /// their implicit flags), so only the scalar is written. + /// </summary> + private void ProcessScalar() + { + var scalar = (ScalarEvent)_event!; + _analysis ??= AnalyzeScalar(scalar.Value); + _style ??= ChooseScalarStyle(); + bool split = !_simpleKeyContext; + switch (_style) + { + case '"': + WriteDoubleQuoted(_analysis.Scalar, split); + break; + case '\'': + WriteSingleQuoted(_analysis.Scalar, split); + break; + default: + WritePlain(_analysis.Scalar, split); + break; + } + _analysis = null; + _style = null; + } + + /// <summary><c>analyze_scalar</c>: which styles the scalar's characters allow.</summary> + /// <param name="scalar">The text.</param> + /// <returns>The analysis.</returns> + private static ScalarAnalysis AnalyzeScalar(string scalar) + { + if (scalar.Length == 0) + return new ScalarAnalysis(scalar, Empty: true, Multiline: false, AllowFlowPlain: false, + AllowBlockPlain: true, AllowSingleQuoted: true, AllowDoubleQuoted: true, AllowBlock: false); + + bool blockIndicators = false, flowIndicators = false, lineBreaks = false, specialCharacters = false; + bool leadingSpace = false, leadingBreak = false, trailingSpace = false, trailingBreak = false; + bool breakSpace = false, spaceBreak = false; + + if (scalar.StartsWith("---", StringComparison.Ordinal) || scalar.StartsWith("...", StringComparison.Ordinal)) + { + blockIndicators = true; + flowIndicators = true; + } + + // Python iterates code points; a surrogate pair is one character there. Iterate runes so the "followed by + // whitespace" look-ahead and the unicode-range tests see the same characters. + int[] cps = scalar.EnumerateRunes().Select(r => r.Value).ToArray(); + bool precededByWhitespace = true; + bool followedByWhitespace = cps.Length == 1 || IsWhitespace(cps[1]); + bool previousSpace = false, previousBreak = false; + + for (int index = 0; index < cps.Length; index++) + { + int ch = cps[index]; + if (index == 0) + { + if ("#,[]{}&*!|>'\"%@`".Contains((char)ch) && ch < 0x10000) + { + flowIndicators = true; + blockIndicators = true; + } + if (ch is '?' or ':') + { + flowIndicators = true; + if (followedByWhitespace) + blockIndicators = true; + } + if (ch == '-' && followedByWhitespace) + { + flowIndicators = true; + blockIndicators = true; + } + } + else + { + if (ch is ',' or '?' or '[' or ']' or '{' or '}') + flowIndicators = true; + if (ch == ':') + { + flowIndicators = true; + if (followedByWhitespace) + blockIndicators = true; + } + if (ch == '#' && precededByWhitespace) + { + flowIndicators = true; + blockIndicators = true; + } + } + + if (IsLineBreak(ch)) + lineBreaks = true; + if (!(ch == '\n' || (ch >= 0x20 && ch <= 0x7E))) + { + if ((ch == 0x85 || (ch >= 0xA0 && ch <= 0xD7FF) || (ch >= 0xE000 && ch <= 0xFFFD) + || (ch >= 0x10000 && ch < 0x10FFFF)) && ch != 0xFEFF) + { + // unicode_characters: with allow_unicode=False they are special too. + specialCharacters = true; + } + else + { + specialCharacters = true; + } + } + + if (ch == ' ') + { + if (index == 0) + leadingSpace = true; + if (index == cps.Length - 1) + trailingSpace = true; + if (previousBreak) + breakSpace = true; + previousSpace = true; + previousBreak = false; + } + else if (IsLineBreak(ch)) + { + if (index == 0) + leadingBreak = true; + if (index == cps.Length - 1) + trailingBreak = true; + if (previousSpace) + spaceBreak = true; + previousSpace = false; + previousBreak = true; + } + else + { + previousSpace = false; + previousBreak = false; + } + + precededByWhitespace = IsWhitespace(ch); + followedByWhitespace = index + 2 >= cps.Length || IsWhitespace(cps[index + 2]); + } + + bool allowFlowPlain = true, allowBlockPlain = true, allowSingleQuoted = true, allowBlock = true; + if (leadingSpace || leadingBreak || trailingSpace || trailingBreak) + allowFlowPlain = allowBlockPlain = false; + if (trailingSpace) + allowBlock = false; + if (breakSpace) + allowFlowPlain = allowBlockPlain = allowSingleQuoted = false; + if (spaceBreak || specialCharacters) + allowFlowPlain = allowBlockPlain = allowSingleQuoted = allowBlock = false; + if (lineBreaks) + allowFlowPlain = allowBlockPlain = false; + if (flowIndicators) + allowFlowPlain = false; + if (blockIndicators) + allowBlockPlain = false; + + return new ScalarAnalysis(scalar, Empty: false, Multiline: lineBreaks, allowFlowPlain, allowBlockPlain, + allowSingleQuoted, AllowDoubleQuoted: true, allowBlock); + } + + /// <summary>Whether <paramref name="ch" /> is one of YAML's line breaks (<c>\n</c>, NEL, LS, PS).</summary> + /// <param name="ch">A code point.</param> + /// <returns>The test result.</returns> + private static bool IsLineBreak(int ch) => ch is '\n' or 0x85 or 0x2028 or 0x2029; + + /// <summary>Whether <paramref name="ch" /> is in PyYAML's <c>'\0 \t\r\n\x85\u2028\u2029'</c>.</summary> + /// <param name="ch">A code point.</param> + /// <returns>The test result.</returns> + private static bool IsWhitespace(int ch) => ch < 0x10000 && Whitespace.Contains((char)ch); + + // ---- writers + + /// <summary><c>write_indicator</c>.</summary> + /// <param name="indicator">The indicator text.</param> + /// <param name="needWhitespace">Whether a space must separate it from the previous text.</param> + /// <param name="whitespace">Whether the indicator ends in whitespace.</param> + /// <param name="indention">Whether the indicator counts as indentation.</param> + private void WriteIndicator(string indicator, bool needWhitespace, bool whitespace = false, bool indention = false) + { + string data = _whitespace || !needWhitespace ? indicator : " " + indicator; + _whitespace = whitespace; + _indention = _indention && indention; + _column += data.Length; + _openEnded = false; + _out.Append(data); + } + + /// <summary><c>write_indent</c>: a line break when needed, then spaces up to the current indent.</summary> + private void WriteIndent() + { + int indent = _indent ?? 0; + if (!_indention || _column > indent || (_column == indent && !_whitespace)) + WriteLineBreak(); + if (_column < indent) + { + _whitespace = true; + _out.Append(' ', indent - _column); + _column = indent; + } + } + + /// <summary><c>write_line_break</c>.</summary> + /// <param name="data">The break to write; <c>\n</c> by default.</param> + private void WriteLineBreak(string? data = null) + { + _whitespace = true; + _indention = true; + _column = 0; + _out.Append(data ?? "\n"); + } + + /// <summary>Appends text that contains no line break and advances the column by its code points.</summary> + /// <param name="data">The text.</param> + private void Append(string data) + { + // PyYAML counts columns in code points (Python string length); a surrogate pair is one. + _column += CodePointLength(data); + _out.Append(data); + } + + /// <summary>The number of code points in <paramref name="s" />.</summary> + /// <param name="s">A string.</param> + /// <returns>Its length as Python's <c>len</c> counts it.</returns> + private static int CodePointLength(string s) + { + int n = 0; + foreach (Rune _ in s.EnumerateRunes()) + n++; + return n; + } + + /// <summary><c>write_plain</c>: the text as is, folded at spaces past the width when splitting is allowed.</summary> + /// <param name="text">The scalar.</param> + /// <param name="split">Whether long lines may fold (not for simple keys).</param> + private void WritePlain(string text, bool split) + { + if (_rootContext) + _openEnded = true; + if (text.Length == 0) + return; + if (!_whitespace) + Append(" "); + _whitespace = false; + _indention = false; + string[] t = ToCodePoints(text); + bool spaces = false, breaks = false; + int start = 0, end = 0; + while (end <= t.Length) + { + string? ch = end < t.Length ? t[end] : null; + if (spaces) + { + if (ch != " ") + { + if (start + 1 == end && _column > BestWidth && split) + { + WriteIndent(); + _whitespace = false; + _indention = false; + } + else + { + Append(Slice(t, start, end)); + } + start = end; + } + } + else if (breaks) + { + if (ch is null || !IsLineBreakText(ch)) + { + if (t[start] == "\n") + WriteLineBreak(); + for (int i = start; i < end; i++) + WriteLineBreak(t[i] == "\n" ? null : t[i]); + WriteIndent(); + _whitespace = false; + _indention = false; + start = end; + } + } + else + { + if (ch is null || ch == " " || IsLineBreakText(ch)) + { + Append(Slice(t, start, end)); + start = end; + } + } + if (ch is not null) + { + spaces = ch == " "; + breaks = IsLineBreakText(ch); + } + end++; + } + } + + /// <summary><c>write_single_quoted</c>: <c>'</c> doubled, folded at spaces past the width.</summary> + /// <param name="text">The scalar.</param> + /// <param name="split">Whether long lines may fold (not for simple keys).</param> + private void WriteSingleQuoted(string text, bool split) + { + WriteIndicator("'", true); + string[] t = ToCodePoints(text); + bool spaces = false, breaks = false; + int start = 0, end = 0; + while (end <= t.Length) + { + string? ch = end < t.Length ? t[end] : null; + if (spaces) + { + if (ch is null || ch != " ") + { + if (start + 1 == end && _column > BestWidth && split && start != 0 && end != t.Length) + WriteIndent(); + else + Append(Slice(t, start, end)); + start = end; + } + } + else if (breaks) + { + if (ch is null || !IsLineBreakText(ch)) + { + if (t[start] == "\n") + WriteLineBreak(); + for (int i = start; i < end; i++) + WriteLineBreak(t[i] == "\n" ? null : t[i]); + WriteIndent(); + start = end; + } + } + else + { + if (ch is null || ch == " " || IsLineBreakText(ch) || ch == "'") + { + if (start < end) + { + Append(Slice(t, start, end)); + start = end; + } + } + } + if (ch == "'") + { + Append("''"); + start = end + 1; + } + if (ch is not null) + { + spaces = ch == " "; + breaks = IsLineBreakText(ch); + } + end++; + } + WriteIndicator("'", false); + } + + /// <summary>PyYAML's <c>ESCAPE_REPLACEMENTS</c>.</summary> + private static readonly Dictionary<int, string> EscapeReplacements = new() + { + [0x00] = "0", [0x07] = "a", [0x08] = "b", [0x09] = "t", [0x0A] = "n", [0x0B] = "v", [0x0C] = "f", + [0x0D] = "r", [0x1B] = "e", ['"'] = "\"", ['\\'] = "\\", [0x85] = "N", [0xA0] = "_", [0x2028] = "L", + [0x2029] = "P", + }; + + /// <summary> + /// <c>write_double_quoted</c>: printable ASCII as is, everything else escaped (<c>allow_unicode=False</c>), + /// folded with a trailing <c>\</c> past the width. + /// </summary> + /// <param name="text">The scalar.</param> + /// <param name="split">Whether long lines may fold (not for simple keys).</param> + private void WriteDoubleQuoted(string text, bool split) + { + WriteIndicator("\"", true); + int[] t = text.EnumerateRunes().Select(r => r.Value).ToArray(); + int start = 0, end = 0; + while (end <= t.Length) + { + int? ch = end < t.Length ? t[end] : null; + if (ch is null || ch is '"' or '\\' or 0x85 or 0x2028 or 0x2029 or 0xFEFF || !(ch >= 0x20 && ch <= 0x7E)) + { + if (start < end) + { + Append(SliceRunes(t, start, end)); + start = end; + } + if (ch is not null) + { + string data; + if (EscapeReplacements.TryGetValue(ch.Value, out string? rep)) + data = "\\" + rep; + else if (ch <= 0xFF) + data = "\\x" + ch.Value.ToString("X2", CultureInfo.InvariantCulture); + else if (ch <= 0xFFFF) + data = "\\u" + ch.Value.ToString("X4", CultureInfo.InvariantCulture); + else + data = "\\U" + ch.Value.ToString("X8", CultureInfo.InvariantCulture); + Append(data); + start = end + 1; + } + } + if (0 < end && end < t.Length - 1 && (ch == ' ' || start >= end) + && _column + (end - start) > BestWidth && split) + { + string data = SliceRunes(t, start, end) + "\\"; + if (start < end) + start = end; + Append(data); + WriteIndent(); + _whitespace = false; + _indention = false; + if (t[start] == ' ') + Append("\\"); + } + end++; + } + WriteIndicator("\"", false); + } + + /// <summary>Splits a string into its code points, each as a string (one or two UTF-16 units).</summary> + /// <param name="s">The text.</param> + /// <returns>The code points.</returns> + private static string[] ToCodePoints(string s) => s.EnumerateRunes().Select(r => r.ToString()).ToArray(); + + /// <summary>Concatenates code points <c>[start, end)</c>.</summary> + /// <param name="t">The code points.</param> + /// <param name="start">The first index.</param> + /// <param name="end">The index past the last.</param> + /// <returns>The text.</returns> + private static string Slice(string[] t, int start, int end) => string.Concat(t.Skip(start).Take(end - start)); + + /// <summary>Encodes code points <c>[start, end)</c> as a string.</summary> + /// <param name="t">The code points.</param> + /// <param name="start">The first index.</param> + /// <param name="end">The index past the last.</param> + /// <returns>The text.</returns> + private static string SliceRunes(int[] t, int start, int end) + { + var sb = new StringBuilder(); + for (int i = start; i < end; i++) + sb.Append(char.ConvertFromUtf32(t[i])); + return sb.ToString(); + } + + /// <summary>Whether a one-code-point string is a YAML line break.</summary> + /// <param name="ch">The code point as a string.</param> + /// <returns>The test result.</returns> + private static bool IsLineBreakText(string ch) => ch.Length == 1 && LineBreaks.Contains(ch[0]); + } +} diff --git a/src/OptunaSharp.Cli/README.md b/src/OptunaSharp.Cli/README.md index f79cca9..79ebbc0 100644 --- a/src/OptunaSharp.Cli/README.md +++ b/src/OptunaSharp.Cli/README.md @@ -2,12 +2,12 @@ The **`optunasharp` command-line tool** — a faithful port of the [Optuna](https://github.com/optuna/optuna) CLI (`optuna/cli.py`) for [OptunaSharp](https://github.com/SciSharp/OptunaSharp), built on -[System.CommandLine](https://learn.microsoft.com/dotnet/standard/commandline/) and -[YamlDotNet](https://github.com/aaubry/YamlDotNet). +[System.CommandLine](https://learn.microsoft.com/dotnet/standard/commandline/). Create and inspect studies and drive ask/tell trials from the shell, against **journal-file**, -**SQLite** (`RDBStorage`) and **Redis** storages — with **byte-identical `value`/`json`/`table` -output** to the `optuna` command (verified live against Optuna 5.0.0.dev). +**SQLite** (`RDBStorage`) and **Redis** storages — with **byte-identical `value`/`json`/`table`/`yaml` +output** to the `optuna` command (verified live against Optuna 5.0.0; `yaml` is a port of PyYAML's `safe_dump`, +pinned by a 763-case corpus). Part of the [SciSharp STACK](https://github.com/SciSharp). @@ -24,7 +24,9 @@ and `redis://` URLs work out of the box; journal-file storage is built in. ## Commands Every command mirrors its Optuna counterpart, including the shared options -`--storage` / `--storage-class` / `-v` / `-q` / `--log-file` / `--debug`. +`--storage` / `--storage-class` / `-v` / `-q` / `--log-file` / `--debug`. Like Optuna's, `--log-file` creates the +file but writes nothing to it (Optuna's handler sits on Python's root logger, which the `optuna` logger does not +propagate to); redirect stderr to keep a log. | Command | What it does | |---|---| diff --git a/src/OptunaSharp.Cli/Records.cs b/src/OptunaSharp.Cli/Records.cs index a51fbbe..8ce0236 100644 --- a/src/OptunaSharp.Cli/Records.cs +++ b/src/OptunaSharp.Cli/Records.cs @@ -88,7 +88,7 @@ HashSet<Column> Agg() } case "params": { - foreach (var (name, value) in trial.ParamsDict) + foreach (var (name, value) in trial.Params) { var col = new Column(dfColumn, name); record[col] = value; @@ -98,7 +98,7 @@ HashSet<Column> Agg() } case "user_attrs": { - foreach (var (name, value) in trial.UserAttrsDict) + foreach (var (name, value) in trial.UserAttrs) { var col = new Column(dfColumn, name); record[col] = value; diff --git a/src/OptunaSharp.Cli/SamplerFactory.cs b/src/OptunaSharp.Cli/SamplerFactory.cs index 66e4ee6..0e05683 100644 --- a/src/OptunaSharp.Cli/SamplerFactory.cs +++ b/src/OptunaSharp.Cli/SamplerFactory.cs @@ -1,9 +1,11 @@ using System; +using System.Collections; using System.Collections.Generic; using System.Globalization; using System.Linq; using System.Reflection; using OptunaSharp.Collections; +using OptunaSharp.Distributions; using OptunaSharp.Internal; using OptunaSharp.Samplers; @@ -13,8 +15,10 @@ namespace OptunaSharp.Cli; /// Port of the <c>ask</c> command's sampler construction: /// <c>getattr(optuna.samplers, name)(**json.loads(sampler_kwargs))</c>. Resolves /// <c>OptunaSharp.Samplers.<Name></c> by reflection and binds the JSON kwargs (snake_case keys) -/// to a constructor's parameters. Scalar kwargs (the realistic CLI case, e.g. <c>{"seed": 0}</c>) -/// are supported; anything that cannot bind raises a clear error, as Optuna's <c>TypeError</c> would. +/// to a constructor's parameters: scalars (<c>{"seed": 0}</c>) and, as Python's <c>**kwargs</c> passes them +/// unchanged, JSON objects and arrays (<c>GridSampler</c>'s <c>search_space</c>, <c>CmaEsSampler</c>'s <c>x0</c>, +/// <c>NSGAIIISampler</c>'s <c>reference_points</c>; QA-64). Anything that cannot bind raises a clear error, as +/// Optuna's <c>TypeError</c> would. /// </summary> internal static class SamplerFactory { @@ -102,13 +106,144 @@ private static object Construct(Type type, string name, Dictionary<string, objec + $"({{{string.Join(", ", kwargs.Keys)}}})."); } + /// <summary> + /// Binds a JSON object to a dictionary parameter with string keys (<c>IReadOnlyDictionary</c>, <c>IDictionary</c> + /// or <c>Dictionary</c> of <c>string</c> to some value type), converting each value with <see cref="TryCoerce" />. + /// Insertion order is kept (a <see cref="Dictionary{TKey, TValue}" /> that only receives additions enumerates in + /// insertion order). + /// </summary> + /// <param name="json">The decoded JSON object.</param> + /// <param name="target">The parameter type, nullable unwrapped.</param> + /// <param name="result">Receives the dictionary on success, or null.</param> + /// <returns>Whether the parameter takes a string-keyed dictionary and every value converted.</returns> + private static bool TryCoerceMapping(OrderedDict<string, object?> json, Type target, out object? result) + { + result = null; + Type? valueType = DictionaryValueType(target); + if (valueType is null) + return false; + + var dict = (IDictionary)Activator.CreateInstance(typeof(Dictionary<,>).MakeGenericType(typeof(string), valueType))!; + foreach (var (key, item) in json) + { + if (!TryCoerce(item, valueType, out object? converted)) + return false; + dict[key] = converted; + } + + if (!target.IsInstanceOfType(dict)) + return false; + result = dict; + return true; + } + + /// <summary> + /// The value type of a string-keyed dictionary type the binder can build: <c>IReadOnlyDictionary<string, V></c>, + /// <c>IDictionary<string, V></c> or <c>Dictionary<string, V></c>. + /// </summary> + /// <param name="target">The parameter type.</param> + /// <returns><c>V</c>, or <c>null</c> when the type is not such a dictionary.</returns> + private static Type? DictionaryValueType(Type target) + { + if (!target.IsGenericType) + return null; + Type def = target.GetGenericTypeDefinition(); + Type[] args = target.GetGenericArguments(); + bool dictionaryShaped = def == typeof(IReadOnlyDictionary<,>) || def == typeof(IDictionary<,>) + || def == typeof(Dictionary<,>); + return dictionaryShaped && args[0] == typeof(string) ? args[1] : null; + } + + /// <summary> + /// Binds a JSON array to a sequence parameter: <c>T[]</c>, a list or collection interface of <c>T</c> + /// (<see cref="List{T}" /> is built), or a rectangular <c>double[,]</c> from an array of equally long arrays + /// (NSGA-III's reference points). Each element is converted with <see cref="TryCoerce" />. + /// </summary> + /// <param name="json">The decoded JSON array.</param> + /// <param name="target">The parameter type, nullable unwrapped.</param> + /// <param name="result">Receives the sequence on success, or null.</param> + /// <returns>Whether the parameter takes such a sequence and every element converted.</returns> + private static bool TryCoerceSequence(List<object?> json, Type target, out object? result) + { + result = null; + if (target == typeof(double[,])) + { + // A ragged or non-numeric matrix does not bind, as np.asarray would not give a 2-D float array. + int rows = json.Count; + int cols = rows == 0 ? 0 : (json[0] as List<object?>)?.Count ?? -1; + if (cols < 0) + return false; + var matrix = new double[rows, cols]; + for (int r = 0; r < rows; r++) + { + if (json[r] is not List<object?> row || row.Count != cols) + return false; + for (int c = 0; c < cols; c++) + { + if (!TryCoerce(row[c], typeof(double), out object? cell)) + return false; + matrix[r, c] = (double)cell!; + } + } + result = matrix; + return true; + } + + Type? elementType = SequenceElementType(target); + if (elementType is null) + return false; + var items = (IList)Activator.CreateInstance(typeof(List<>).MakeGenericType(elementType))!; + foreach (object? item in json) + { + if (!TryCoerce(item, elementType, out object? converted)) + return false; + items.Add(converted); + } + + if (target.IsArray) + { + var array = Array.CreateInstance(elementType, items.Count); + items.CopyTo(array, 0); + result = array; + return true; + } + if (!target.IsInstanceOfType(items)) + return false; + result = items; + return true; + } + + /// <summary> + /// The element type of a one-dimensional sequence type the binder can build: <c>T[]</c>, <see cref="List{T}" />, + /// or <c>IList</c>, <c>IReadOnlyList</c>, <c>ICollection</c>, <c>IReadOnlyCollection</c>, <c>IEnumerable</c> of + /// <c>T</c>. Strings are not sequences here. + /// </summary> + /// <param name="target">The parameter type.</param> + /// <returns><c>T</c>, or <c>null</c> when the type is not such a sequence.</returns> + private static Type? SequenceElementType(Type target) + { + if (target.IsArray) + return target.GetArrayRank() == 1 ? target.GetElementType() : null; + if (!target.IsGenericType || target == typeof(string)) + return null; + Type def = target.GetGenericTypeDefinition(); + bool listShaped = def == typeof(List<>) || def == typeof(IList<>) || def == typeof(IReadOnlyList<>) + || def == typeof(ICollection<>) || def == typeof(IReadOnlyCollection<>) + || def == typeof(IEnumerable<>); + return listShaped ? target.GetGenericArguments()[0] : null; + } + /// <summary>Removes underscores and folds case to match Python keyword names to CLR parameter names.</summary> /// <param name="s">The constructor keyword or parameter name to normalize.</param> /// <returns>The lowercase name with underscores removed.</returns> private static string Normalize(string s) => s.Replace("_", "").ToLowerInvariant(); - /// <summary>Attempts a supported scalar conversion for a reflected constructor parameter.</summary> - /// <param name="value">The scalar or composite value to parse, classify, or render.</param> + /// <summary> + /// Converts a decoded JSON value for a reflected constructor parameter: scalars to the parameter's scalar type, + /// JSON objects to dictionaries and JSON arrays to lists, arrays or a rectangular <c>double[,]</c>, element by + /// element, and any value to <see cref="CategoricalChoice" /> where a grid takes one. + /// </summary> + /// <param name="value">The decoded JSON value: <c>null</c>, bool, long, double, string, <see cref="List{T}" /> of values, or <see cref="OrderedDict{TKey, TValue}" /> of string keys.</param> /// <param name="target">The requested CLR parameter type.</param> /// <param name="result">Receives the converted value on success, or null when conversion fails.</param> /// <returns>Whether conversion succeeded and produced a value acceptable to the target parameter.</returns> @@ -122,6 +257,26 @@ private static bool TryCoerce(object? value, Type target, out object? result) return !target.IsValueType || Nullable.GetUnderlyingType(target) is not null; } + // A value the parameter already accepts goes through unchanged: CmaEsSampler's x0, an + // IReadOnlyDictionary<string, object?>, receives the decoded JSON object as Optuna's receives the dict. + if (target.IsInstanceOfType(value)) + { + result = value; + return true; + } + + // Python passes JSON objects and arrays to the constructor as dicts and lists (QA-64); bind them element-wise. + if (value is OrderedDict<string, object?> jsonObject) + return TryCoerceMapping(jsonObject, t, out result); + if (value is List<object?> jsonArray) + return TryCoerceSequence(jsonArray, t, out result); + if (t == typeof(CategoricalChoice)) + { + // A grid point: Python equality semantics live in CategoricalChoice, so any JSON scalar is a valid choice. + result = CategoricalChoice.From(value); + return true; + } + try { if (t == typeof(bool)) { result = Convert.ToBoolean(value, CultureInfo.InvariantCulture); return value is bool; } diff --git a/src/OptunaSharp.Core/Artifacts/ArtifactFunctions.cs b/src/OptunaSharp.Core/Artifacts/ArtifactFunctions.cs index 80c18d4..cf9eb39 100644 --- a/src/OptunaSharp.Core/Artifacts/ArtifactFunctions.cs +++ b/src/OptunaSharp.Core/Artifacts/ArtifactFunctions.cs @@ -122,14 +122,17 @@ public static string UploadArtifact( /// <param name="artifactStore">An artifact store.</param> /// <param name="filePath">A path to save the downloaded artifact.</param> /// <param name="artifactId">The identifier of the artifact to download.</param> - /// <exception cref="System.IO.IOException">The destination already exists or file copying fails.</exception> + /// <exception cref="FileExistsError">The destination already exists, as a file or a directory: Python's <c>FileExistsError("File already exists: …")</c>, NumSharp's class since 0.81.0 (an <see cref="System.IO.IOException" />, so a <c>catch (IOException)</c> still sees it).</exception> + /// <exception cref="System.IO.IOException">File copying fails.</exception> /// <exception cref="OptunaSharp.Artifacts.ArtifactNotFound">The requested artifact does not exist.</exception> /// <exception cref="System.UnauthorizedAccessException">The destination cannot be written.</exception> /// <remarks>Both streams are disposed on failure, but a partially written destination file is retained.</remarks> public static void DownloadArtifact(IArtifactStore artifactStore, string filePath, string artifactId) { - if (File.Exists(filePath)) - throw new IOException($"File already exists: {filePath}"); + // Python's os.path.exists is true for a directory too; File.Exists alone let a directory through, and opening it + // as a file then failed with UnauthorizedAccessException instead of Optuna's FileExistsError (QA-78). + if (File.Exists(filePath) || Directory.Exists(filePath)) + throw new FileExistsError($"File already exists: {filePath}"); using var reader = artifactStore.OpenReader(artifactId); using var writer = new FileStream(filePath, FileMode.CreateNew, FileAccess.Write); diff --git a/src/OptunaSharp.Core/BaseTrial.cs b/src/OptunaSharp.Core/BaseTrial.cs index 905df50..5c7002c 100644 --- a/src/OptunaSharp.Core/BaseTrial.cs +++ b/src/OptunaSharp.Core/BaseTrial.cs @@ -231,6 +231,34 @@ public TEnum SuggestCategorical<TEnum>(string name, IEnumerable<TEnum> choices) /// <summary>Stores a user attribute by name.</summary> public abstract void SetUserAttr(string key, object? value); + /// <summary> + /// Stores several user attributes at once (Rustuna's <c>set_user_attrs</c>; Rustuna plan 13, item S8). Optuna has + /// no such call: the result is what <see cref="SetUserAttr(string, object?)" /> once per entry, in the dictionary's + /// order, leaves. + /// </summary> + /// <param name="attrs">The attributes, set in enumeration order; persistent backends require JSON-serializable values.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="Exception">Whatever <see cref="SetUserAttr(string, object?)" /> throws for an entry.</exception> + /// <remarks> + /// This default calls <see cref="SetUserAttr(string, object?)" /> per entry. <see cref="Trial" /> overrides it + /// to write the whole batch through one storage call (one lock, journal append or transaction), so an unknown or + /// finished trial gets nothing written. + /// </remarks> + public virtual void SetUserAttrs(IReadOnlyDictionary<string, object?> attrs) + { + ArgumentNullException.ThrowIfNull(attrs); + foreach (var (key, value) in attrs) + SetUserAttr(key, value); + } + + /// <summary> + /// Optuna's <c>set_user_attr</c> name for <see cref="SetUserAttrs" />: several user attributes in one call. + /// </summary> + /// <param name="attrs">The attributes, set in enumeration order.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="Exception">Whatever <see cref="SetUserAttrs" /> throws.</exception> + public void SetUserAttr(IReadOnlyDictionary<string, object?> attrs) => SetUserAttrs(attrs); + /// <summary> /// Expose this trial's observed-components vector — the per-trial residual terms /// <c>r = (r_1, …, r_m)</c> of an objective that decomposes as <c>f(x) = mean_i r_i(x)</c> — on diff --git a/src/OptunaSharp.Core/Collections/Concurrent/ConcurrentDictionary.cs b/src/OptunaSharp.Core/Collections/Concurrent/ConcurrentDictionary.cs deleted file mode 100644 index 2e6700f..0000000 --- a/src/OptunaSharp.Core/Collections/Concurrent/ConcurrentDictionary.cs +++ /dev/null @@ -1,2302 +0,0 @@ -// <auto-generated> -// Vendored, faithful clone of dotnet/runtime's thread-safe ConcurrentDictionary<TKey,TValue> -// (MIT, the same license as OptunaSharp), taken from -// src/libraries/System.Private.CoreLib/src/System/Collections/Concurrent/ConcurrentDictionary.cs @ main. -// -// It is the base for OptunaSharp's two-path ConcurrentOrderedDict (see ConcurrentOrderedDict.cs): -// the striped-lock hashtable below supplies the key path (dedup + O(1) lock-free key reads), while the -// ordered type layers an insertion-ordered value snapshot on top for the index/list path. -// -// Deviations from the upstream source, all mechanical: -// * the type is internal, not public: it is an implementation detail of ConcurrentOrderedDict, and as -// a public type it shipped a second System.Collections.Concurrent.ConcurrentDictionary in OptunaSharp's -// API, so consumers importing both namespaces got CS0104 ambiguity errors; -// * namespace System.Collections.Concurrent -> OptunaSharp.Collections.Concurrent; -// * SR / ThrowHelper / HashHelpers resolve to the vendored companions in ConcurrentDictionaryInternals.cs; -// * the string-key NonRandomizedStringEqualityComparer hash-flooding hardening is dropped (it relies on -// CoreLib-internal types); the provided/default comparer is used directly; -// * the net9+ AlternateLookup<TAlternateKey> API and the [DebuggerTypeProxy] view are dropped (not needed, -// and the former does not compile on net8.0). -// Concurrency logic, locking, growth and public key-API behavior are otherwise unchanged. -// </auto-generated> -#nullable enable - -using System; -using System.Collections; -using System.Collections.Generic; -using System.Collections.ObjectModel; -using System.Diagnostics; -using System.Diagnostics.CodeAnalysis; -using System.Runtime.CompilerServices; -using System.Threading; - -namespace OptunaSharp.Collections.Concurrent -{ - // TODO(NumSharp 0.80.0): once NumSharp 0.80.0 is released, use its - // NumSharp.Collections.Concurrent.ConcurrentDictionary<TKey,TValue> instead of this vendored copy. Bump - // $(NumSharpVersion) in Directory.Build.props, then delete this file and ConcurrentDictionaryInternals.cs. - // The only consumer is ConcurrentOrderedDict, which moves to NumSharp in the same step. - /// <summary>Represents a thread-safe collection of keys and values.</summary> - /// <typeparam name="TKey">The type of the keys in the dictionary.</typeparam> - /// <typeparam name="TValue">The type of the values in the dictionary.</typeparam> - /// <remarks> - /// All public and protected members of <see cref="ConcurrentDictionary{TKey,TValue}"/> are thread-safe and may be used - /// concurrently from multiple threads. - /// </remarks> - [DebuggerDisplay("Count = {Count}")] - internal class ConcurrentDictionary<TKey, TValue> : IDictionary<TKey, TValue>, IDictionary, IReadOnlyDictionary<TKey, TValue> where TKey : notnull - { - /// <summary>Internal tables of the dictionary.</summary> - /// <remarks> - /// When using <see cref="_tables"/>, we must read the volatile _tables field into a local variable: - /// it is set to a new table on each table resize. Volatile.Reads on array elements then ensure that - /// we have a copy of the reference to tables._buckets[bucketNo]: this protects us from reading fields - /// ('_hashcode', '_key', '_value' and '_next') of different instances. - /// </remarks> - private volatile Tables _tables; - /// <summary>The maximum number of elements per lock before a resize operation is triggered.</summary> - private int _budget; - /// <summary>Whether to dynamically increase the size of the striped lock.</summary> - private readonly bool _growLockArray; - /// <summary>Whether a non-null comparer in <see cref="Tables._comparer"/> is the default comparer.</summary> - /// <remarks> - /// This is only used for reference types. It lets us use the key's GetHashCode directly rather than going indirectly - /// through the comparer. It can't be used for Equals, as the key might implement IEquatable and employ different - /// equality semantics than the virtual Equals, however unlikely that may be. This field enables us to save an - /// interface dispatch when using the default comparer with a non-string reference type key, at the expense of an - /// extra branch when using a custom comparer with a reference type key. - /// </remarks> - private readonly bool _comparerIsDefaultForClasses; - /// <summary>The initial size of the _buckets array.</summary> - /// <remarks> - /// We store this to retain the initially specified growing behavior of the _buckets array even after clearing the collection. - /// </remarks> - private readonly int _initialCapacity; - - /// <summary>The default capacity, i.e. the initial # of buckets.</summary> - /// <remarks> - /// When choosing this value, we are making a trade-off between the size of a very small dictionary, - /// and the number of resizes when constructing a large dictionary. - /// </remarks> - private const int DefaultCapacity = 31; - - /// <summary> - /// The maximum size of the striped lock that will not be exceeded when locks are automatically - /// added as the dictionary grows. - /// </summary> - /// <remarks> - /// The user is allowed to exceed this limit by passing - /// a concurrency level larger than MaxLockNumber into the constructor. - /// </remarks> - private const int MaxLockNumber = 1024; - - /// <summary> - /// Initializes a new instance of the <see cref="ConcurrentDictionary{TKey,TValue}"/> - /// class that is empty, has the default concurrency level, has the default initial capacity, and - /// uses the default comparer for the key type. - /// </summary> - public ConcurrentDictionary() - : this(DefaultConcurrencyLevel, DefaultCapacity, growLockArray: true, null) { } - - /// <summary> - /// Initializes a new instance of the <see cref="ConcurrentDictionary{TKey,TValue}"/> - /// class that is empty, has the specified concurrency level and capacity, and uses the default - /// comparer for the key type. - /// </summary> - /// <param name="concurrencyLevel">The estimated number of threads that will update the - /// <see cref="ConcurrentDictionary{TKey,TValue}"/> concurrently, or -1 to indicate a default value.</param> - /// <param name="capacity">The initial number of elements that the <see cref="ConcurrentDictionary{TKey,TValue}"/> can contain.</param> - /// <exception cref="ArgumentOutOfRangeException"><paramref name="concurrencyLevel"/> is less than 1.</exception> - /// <exception cref="ArgumentOutOfRangeException"> <paramref name="capacity"/> is less than 0.</exception> - public ConcurrentDictionary(int concurrencyLevel, int capacity) - : this(concurrencyLevel, capacity, growLockArray: false, null) { } - - /// <summary> - /// Initializes a new instance of the <see cref="ConcurrentDictionary{TKey,TValue}"/> - /// class that contains elements copied from the specified <see cref="IEnumerable{T}"/>, has the default concurrency - /// level, has the default initial capacity, and uses the default comparer for the key type. - /// </summary> - /// <param name="collection">The <see - /// cref="IEnumerable{T}"/> whose elements are copied to the new <see cref="ConcurrentDictionary{TKey,TValue}"/>.</param> - /// <exception cref="ArgumentNullException"><paramref name="collection"/> is a null reference (Nothing in Visual Basic).</exception> - /// <exception cref="ArgumentException"><paramref name="collection"/> contains one or more duplicate keys.</exception> - public ConcurrentDictionary(IEnumerable<KeyValuePair<TKey, TValue>> collection) - : this(DefaultConcurrencyLevel, collection, null) { } - - /// <summary> - /// Initializes a new instance of the <see cref="ConcurrentDictionary{TKey,TValue}"/> - /// class that is empty, has the specified concurrency level and capacity, and uses the specified - /// <see cref="IEqualityComparer{TKey}"/>. - /// </summary> - /// <param name="comparer">The <see cref="IEqualityComparer{TKey}"/> implementation to use when comparing keys.</param> - public ConcurrentDictionary(IEqualityComparer<TKey>? comparer) - : this(DefaultConcurrencyLevel, DefaultCapacity, growLockArray: true, comparer) { } - - /// <summary> - /// Initializes a new instance of the <see cref="ConcurrentDictionary{TKey,TValue}"/> - /// class that contains elements copied from the specified <see cref="IEnumerable"/>, has the default concurrency - /// level, has the default initial capacity, and uses the specified <see cref="IEqualityComparer{TKey}"/>. - /// </summary> - /// <param name="collection">The <see cref="IEnumerable{T}"/> whose elements are copied to the new <see cref="ConcurrentDictionary{TKey,TValue}"/>.</param> - /// <param name="comparer">The <see cref="IEqualityComparer{TKey}"/> implementation to use when comparing keys.</param> - /// <exception cref="ArgumentNullException"><paramref name="collection"/> is a null reference (Nothing in Visual Basic).</exception> - public ConcurrentDictionary(IEnumerable<KeyValuePair<TKey, TValue>> collection, IEqualityComparer<TKey>? comparer) - : this(DefaultConcurrencyLevel, GetCapacityFromCollection(collection), comparer) - { - ArgumentNullException.ThrowIfNull(collection); - - InitializeFromCollection(collection); - } - - /// <summary> - /// Initializes a new instance of the <see cref="ConcurrentDictionary{TKey,TValue}"/> - /// class that contains elements copied from the specified <see cref="IEnumerable"/>, - /// has the specified concurrency level, has the specified initial capacity, and uses the specified - /// <see cref="IEqualityComparer{TKey}"/>. - /// </summary> - /// <param name="concurrencyLevel"> - /// The estimated number of threads that will update the <see cref="ConcurrentDictionary{TKey,TValue}"/> concurrently, or -1 to indicate a default value. - /// </param> - /// <param name="collection">The <see cref="IEnumerable{T}"/> whose elements are copied to the new - /// <see cref="ConcurrentDictionary{TKey,TValue}"/>.</param> - /// <param name="comparer">The <see cref="IEqualityComparer{TKey}"/> implementation to use when comparing keys.</param> - /// <exception cref="ArgumentNullException"><paramref name="collection"/> is a null reference (Nothing in Visual Basic).</exception> - /// <exception cref="ArgumentOutOfRangeException"><paramref name="concurrencyLevel"/> is less than 1.</exception> - /// <exception cref="ArgumentException"><paramref name="collection"/> contains one or more duplicate keys.</exception> - public ConcurrentDictionary(int concurrencyLevel, IEnumerable<KeyValuePair<TKey, TValue>> collection, IEqualityComparer<TKey>? comparer) - : this(concurrencyLevel, GetCapacityFromCollection(collection), growLockArray: false, comparer) - { - ArgumentNullException.ThrowIfNull(collection); - - InitializeFromCollection(collection); - } - - /// <summary> - /// Initializes a new instance of the <see cref="ConcurrentDictionary{TKey,TValue}"/> - /// class that is empty, has the specified concurrency level, has the specified initial capacity, and - /// uses the specified <see cref="IEqualityComparer{TKey}"/>. - /// </summary> - /// <param name="concurrencyLevel">The estimated number of threads that will update the <see cref="ConcurrentDictionary{TKey,TValue}"/> concurrently, or -1 to indicate a default value.</param> - /// <param name="capacity">The initial number of elements that the <see cref="ConcurrentDictionary{TKey,TValue}"/> can contain.</param> - /// <param name="comparer">The <see cref="IEqualityComparer{TKey}"/> implementation to use when comparing keys.</param> - /// <exception cref="ArgumentOutOfRangeException"><paramref name="concurrencyLevel"/> is less than 1. -or- <paramref name="capacity"/> is less than 0.</exception> - public ConcurrentDictionary(int concurrencyLevel, int capacity, IEqualityComparer<TKey>? comparer) - : this(concurrencyLevel, capacity, growLockArray: false, comparer) - { - } - - internal ConcurrentDictionary(int concurrencyLevel, int capacity, bool growLockArray, IEqualityComparer<TKey>? comparer) - { - if (concurrencyLevel <= 0) - { - if (concurrencyLevel != -1) - { - throw new ArgumentOutOfRangeException(nameof(concurrencyLevel), SR.ConcurrentDictionary_ConcurrencyLevelMustBePositiveOrNegativeOne); - } - - concurrencyLevel = DefaultConcurrencyLevel; - } - - ArgumentOutOfRangeException.ThrowIfNegative(capacity); - - // The capacity should be at least as large as the concurrency level. Otherwise, we would have locks that don't guard - // any buckets. We also want it to be a prime. - if (capacity < concurrencyLevel) - { - capacity = concurrencyLevel; - } - capacity = HashHelpers.GetPrime(capacity); - - var locks = new object[concurrencyLevel]; - locks[0] = locks; // reuse array as the first lock object just to avoid an additional allocation - for (int i = 1; i < locks.Length; i++) - { - locks[i] = new object(); - } - - var countPerLock = new int[locks.Length]; - var buckets = new VolatileNode[capacity]; - - // For reference types, we always want to store a comparer instance, either the one provided, or if - // one wasn't provided, the default (accessing EqualityComparer<TKey>.Default with shared generics - // on every dictionary access can add measurable overhead). For value types, if no comparer is provided, - // or if the default is provided, we'd prefer to use EqualityComparer<TKey>.Default.Equals/GetHashCode - // on every use, enabling the JIT to devirtualize and possibly inline the operation. - if (typeof(TKey).IsValueType) - { - if (comparer is not null && // first check for null to avoid forcing default comparer instantiation unnecessarily - ReferenceEquals(comparer, EqualityComparer<TKey>.Default)) - { - comparer = null; - } - } - else - { - comparer ??= EqualityComparer<TKey>.Default; - - // NOTE(OptunaSharp vendoring): upstream special-cases string keys with a non-randomized - // comparer that upgrades to a randomized one under hash flooding; that hardening depends on - // the CoreLib-internal NonRandomizedStringEqualityComparer and is omitted here. The provided - // or default comparer is used directly, so only the DoS-hardening heuristic differs. - if (ReferenceEquals(comparer, EqualityComparer<TKey>.Default)) - { - _comparerIsDefaultForClasses = true; - } - } - - _tables = new Tables(buckets, locks, countPerLock, comparer); - _growLockArray = growLockArray; - _initialCapacity = capacity; - _budget = buckets.Length / locks.Length; - } - - /// <summary>Computes an initial capacity to use based on an initial seed collection.</summary> - /// <param name="collection">The collection with which to initially populate this dictionary.</param> - /// <returns>The capacity to use.</returns> - /// <remarks> - /// Growing is expensive, and we don't know if the caller plans to add additional items beyond this - /// initial collection, so we use the maximum of the collection's size and the default capacity. That way, - /// the initial capacity selected isn't pessimized by seeding it with a collection that happens to be - /// smaller. - /// </remarks> - private static int GetCapacityFromCollection(IEnumerable<KeyValuePair<TKey, TValue>> collection) => - collection switch - { - ICollection<KeyValuePair<TKey, TValue>> c => Math.Max(DefaultCapacity, c.Count), - IReadOnlyCollection<KeyValuePair<TKey, TValue>> rc => Math.Max(DefaultCapacity, rc.Count), - _ => DefaultCapacity, - }; - - /// <summary>Computes the hash code for the specified key using the dictionary's comparer.</summary> - /// <param name="comparer"> - /// The comparer. It's passed in to avoid having to look it up via a volatile read on <see cref="_tables"/>; - /// such a comparer could also be incorrect if the table upgraded comparer concurrently. - /// </param> - /// <param name="key">The key for which to compute the hash code.</param> - /// <returns>The hash code of the key.</returns> - [MethodImpl(MethodImplOptions.AggressiveInlining)] - private int GetHashCode(IEqualityComparer<TKey>? comparer, TKey key) - { - if (typeof(TKey).IsValueType) - { - return comparer is null ? key.GetHashCode() : comparer.GetHashCode(key); - } - - Debug.Assert(comparer is not null); - return _comparerIsDefaultForClasses ? key.GetHashCode() : comparer.GetHashCode(key); - } - - /// <summary>Determines whether the specified key and the key stored in the specified node are equal.</summary> - /// <param name="comparer"> - /// The comparer. It's passed in to avoid having to look it up via a volatile read on <see cref="_tables"/>; - /// such a comparer could also be incorrect if the table upgraded comparer concurrently. - /// </param> - /// <param name="node">The node containing the key to compare.</param> - /// <param name="key">The other key to compare.</param> - /// <returns>true if the keys are equal; otherwise, false.</returns> - [MethodImpl(MethodImplOptions.AggressiveInlining)] - private static bool NodeEqualsKey(IEqualityComparer<TKey>? comparer, Node node, TKey key) - { - if (typeof(TKey).IsValueType) - { - return comparer is null ? - EqualityComparer<TKey>.Default.Equals(node._key, key) : - comparer.Equals(node._key, key); - } - - Debug.Assert(comparer is not null); - return comparer.Equals(node._key, key); - } - - private void InitializeFromCollection(IEnumerable<KeyValuePair<TKey, TValue>> collection) - { - foreach (KeyValuePair<TKey, TValue> pair in collection) - { - if (pair.Key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - if (!TryAddInternal(_tables, pair.Key, null, pair.Value, updateIfExists: false, acquireLock: false, out _)) - { - throw new ArgumentException(SR.ConcurrentDictionary_SourceContainsDuplicateKeys); - } - } - - if (_budget == 0) - { - Tables tables = _tables; - _budget = tables._buckets.Length / tables._locks.Length; - } - } - - /// <summary> - /// Attempts to add the specified key and value to the <see cref="ConcurrentDictionary{TKey, TValue}"/>. - /// </summary> - /// <param name="key">The key of the element to add.</param> - /// <param name="value">The value of the element to add. The value can be a null reference (Nothing - /// in Visual Basic) for reference types.</param> - /// <returns> - /// true if the key/value pair was added to the <see cref="ConcurrentDictionary{TKey, TValue}"/> successfully; otherwise, false. - /// </returns> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is null reference (Nothing in Visual Basic).</exception> - /// <exception cref="OverflowException">The <see cref="ConcurrentDictionary{TKey, TValue}"/> contains too many elements.</exception> - public bool TryAdd(TKey key, TValue value) - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - return TryAddInternal(_tables, key, null, value, updateIfExists: false, acquireLock: true, out _); - } - - /// <summary> - /// Determines whether the <see cref="ConcurrentDictionary{TKey, TValue}"/> contains the specified key. - /// </summary> - /// <param name="key">The key to locate in the <see cref="ConcurrentDictionary{TKey, TValue}"/>.</param> - /// <returns>true if the <see cref="ConcurrentDictionary{TKey, TValue}"/> contains an element with the specified key; otherwise, false.</returns> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference (Nothing in Visual Basic).</exception> - public bool ContainsKey(TKey key) => TryGetValue(key, out _); - - /// <summary> - /// Attempts to remove and return the value with the specified key from the <see cref="ConcurrentDictionary{TKey, TValue}"/>. - /// </summary> - /// <param name="key">The key of the element to remove and return.</param> - /// <param name="value"> - /// When this method returns, <paramref name="value"/> contains the object removed from the - /// <see cref="ConcurrentDictionary{TKey,TValue}"/> or the default value of <typeparamref - /// name="TValue"/> if the operation failed. - /// </param> - /// <returns>true if an object was removed successfully; otherwise, false.</returns> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference (Nothing in Visual Basic).</exception> - public bool TryRemove(TKey key, [MaybeNullWhen(false)] out TValue value) - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - return TryRemoveInternal(key, out value, matchValue: false, default); - } - - /// <summary>Removes a key and value from the dictionary.</summary> - /// <param name="item">The <see cref="KeyValuePair{TKey,TValue}"/> representing the key and value to remove.</param> - /// <returns> - /// true if the key and value represented by <paramref name="item"/> are successfully - /// found and removed; otherwise, false. - /// </returns> - /// <remarks> - /// Both the specified key and value must match the entry in the dictionary for it to be removed. - /// The key is compared using the dictionary's comparer (or the default comparer for <typeparamref name="TKey"/> - /// if no comparer was provided to the dictionary when it was constructed). The value is compared using the - /// default comparer for <typeparamref name="TValue"/>. - /// </remarks> - /// <exception cref="ArgumentNullException"> - /// The <see cref="KeyValuePair{TKey, TValue}.Key"/> property of <paramref name="item"/> is a null reference. - /// </exception> - public bool TryRemove(KeyValuePair<TKey, TValue> item) - { - if (item.Key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.item, ExceptionResource.ConcurrentDictionary_ItemKeyIsNull); - } - - return TryRemoveInternal(item.Key, out _, matchValue: true, item.Value); - } - - /// <summary> - /// Removes the specified key from the dictionary if it exists and returns its associated value. - /// If matchValue flag is set, the key will be removed only if is associated with a particular - /// value. - /// </summary> - /// <param name="key">The key to search for and remove if it exists.</param> - /// <param name="value">The variable into which the removed value, if found, is stored.</param> - /// <param name="matchValue">Whether removal of the key is conditional on its value.</param> - /// <param name="oldValue">The conditional value to compare against if <paramref name="matchValue"/> is true</param> - private bool TryRemoveInternal(TKey key, [MaybeNullWhen(false)] out TValue value, bool matchValue, TValue? oldValue) - { - Tables tables = _tables; - - IEqualityComparer<TKey>? comparer = tables._comparer; - int hashcode = GetHashCode(comparer, key); - - while (true) - { - object[] locks = tables._locks; - ref Node? bucket = ref GetBucketAndLock(tables, hashcode, out uint lockNo); - - lock (locks[lockNo]) - { - // If the table just got resized, we may not be holding the right lock, and must retry. - // This should be a rare occurrence. - if (tables != _tables) - { - tables = _tables; - if (!ReferenceEquals(comparer, tables._comparer)) - { - comparer = tables._comparer; - hashcode = GetHashCode(comparer, key); - } - continue; - } - - Node? prev = null; - for (Node? curr = bucket; curr is not null; curr = curr._next) - { - Debug.Assert((prev is null && curr == bucket) || prev!._next == curr); - - if (hashcode == curr._hashcode && NodeEqualsKey(comparer, curr, key)) - { - if (matchValue) - { - bool valuesMatch = EqualityComparer<TValue>.Default.Equals(oldValue, curr._value); - if (!valuesMatch) - { - value = default; - return false; - } - } - - if (prev is null) - { - Volatile.Write(ref bucket, curr._next); - } - else - { - prev._next = curr._next; - } - - value = curr._value; - tables._countPerLock[lockNo]--; - return true; - } - prev = curr; - } - } - - value = default; - return false; - } - } - - /// <summary> - /// Attempts to get the value associated with the specified key from the <see cref="ConcurrentDictionary{TKey,TValue}"/>. - /// </summary> - /// <param name="key">The key of the value to get.</param> - /// <param name="value"> - /// When this method returns, <paramref name="value"/> contains the object from - /// the <see cref="ConcurrentDictionary{TKey,TValue}"/> with the specified key or the default value of - /// <typeparamref name="TValue"/>, if the operation failed. - /// </param> - /// <returns>true if the key was found in the <see cref="ConcurrentDictionary{TKey,TValue}"/>; otherwise, false.</returns> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference (Nothing in Visual Basic).</exception> - public bool TryGetValue(TKey key, [MaybeNullWhen(false)] out TValue value) - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - Tables tables = _tables; - - IEqualityComparer<TKey>? comparer = tables._comparer; - if (typeof(TKey).IsValueType && // comparer can only be null for value types; enable JIT to eliminate entire if block for ref types - comparer is null) - { - int hashcode = key.GetHashCode(); - for (Node? n = GetBucket(tables, hashcode); n is not null; n = n._next) - { - if (hashcode == n._hashcode && EqualityComparer<TKey>.Default.Equals(n._key, key)) - { - value = n._value; - return true; - } - } - } - else - { - Debug.Assert(comparer is not null); - int hashcode = GetHashCode(comparer, key); - for (Node? n = GetBucket(tables, hashcode); n is not null; n = n._next) - { - if (hashcode == n._hashcode && comparer.Equals(n._key, key)) - { - value = n._value; - return true; - } - } - } - - value = default; - return false; - } - - private static bool TryGetValueInternal(Tables tables, TKey key, int hashcode, [MaybeNullWhen(false)] out TValue value) - { - IEqualityComparer<TKey>? comparer = tables._comparer; - - if (typeof(TKey).IsValueType && // comparer can only be null for value types; enable JIT to eliminate entire if block for ref types - comparer is null) - { - for (Node? n = GetBucket(tables, hashcode); n is not null; n = n._next) - { - if (hashcode == n._hashcode && EqualityComparer<TKey>.Default.Equals(n._key, key)) - { - value = n._value; - return true; - } - } - } - else - { - Debug.Assert(comparer is not null); - for (Node? n = GetBucket(tables, hashcode); n is not null; n = n._next) - { - if (hashcode == n._hashcode && comparer.Equals(n._key, key)) - { - value = n._value; - return true; - } - } - } - - value = default; - return false; - } - - /// <summary> - /// Updates the value associated with <paramref name="key"/> to <paramref name="newValue"/> if the existing value is equal - /// to <paramref name="comparisonValue"/>. - /// </summary> - /// <param name="key">The key whose value is compared with <paramref name="comparisonValue"/> and - /// possibly replaced.</param> - /// <param name="newValue">The value that replaces the value of the element with <paramref - /// name="key"/> if the comparison results in equality.</param> - /// <param name="comparisonValue">The value that is compared to the value of the element with - /// <paramref name="key"/>.</param> - /// <returns> - /// true if the value with <paramref name="key"/> was equal to <paramref name="comparisonValue"/> and - /// replaced with <paramref name="newValue"/>; otherwise, false. - /// </returns> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference.</exception> - public bool TryUpdate(TKey key, TValue newValue, TValue comparisonValue) - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - return TryUpdateInternal(_tables, key, null, newValue, comparisonValue); - } - - /// <summary> - /// Updates the value associated with <paramref name="key"/> to <paramref name="newValue"/> if the existing value is equal - /// to <paramref name="comparisonValue"/>. - /// </summary> - /// <param name="tables">The tables that were used to create the hash code.</param> - /// <param name="key">The key whose value is compared with <paramref name="comparisonValue"/> and - /// possibly replaced.</param> - /// <param name="nullableHashcode">The hashcode computed for <paramref name="key"/>.</param> - /// <param name="newValue">The value that replaces the value of the element with <paramref - /// name="key"/> if the comparison results in equality.</param> - /// <param name="comparisonValue">The value that is compared to the value of the element with - /// <paramref name="key"/>.</param> - /// <returns> - /// true if the value with <paramref name="key"/> was equal to <paramref name="comparisonValue"/> and - /// replaced with <paramref name="newValue"/>; otherwise, false. - /// </returns> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference.</exception> - private bool TryUpdateInternal(Tables tables, TKey key, int? nullableHashcode, TValue newValue, TValue comparisonValue) - { - IEqualityComparer<TKey>? comparer = tables._comparer; - - int hashcode = nullableHashcode ?? GetHashCode(comparer, key); - Debug.Assert(nullableHashcode is null || nullableHashcode == hashcode); - - EqualityComparer<TValue> valueComparer = EqualityComparer<TValue>.Default; - - while (true) - { - object[] locks = tables._locks; - ref Node? bucket = ref GetBucketAndLock(tables, hashcode, out uint lockNo); - - lock (locks[lockNo]) - { - // If the table just got resized, we may not be holding the right lock, and must retry. - // This should be a rare occurrence. - if (tables != _tables) - { - tables = _tables; - if (!ReferenceEquals(comparer, tables._comparer)) - { - comparer = tables._comparer; - hashcode = GetHashCode(comparer, key); - } - continue; - } - - // Try to find this key in the bucket - Node? prev = null; - for (Node? node = bucket; node is not null; node = node._next) - { - Debug.Assert((prev is null && node == bucket) || prev!._next == node); - if (hashcode == node._hashcode && NodeEqualsKey(comparer, node, key)) - { - if (valueComparer.Equals(node._value, comparisonValue)) - { - // Do the reference type check up front to handle many cases of shared generics. - // If TValue is a value type then the field's value here can be baked in. Otherwise, - // for the remaining shared generic cases the field access here would disqualify inlining, - // so the following check cannot be factored out of TryAddInternal/TryUpdateInternal. - if (!typeof(TValue).IsValueType || ConcurrentDictionaryTypeProps<TValue>.IsWriteAtomic) - { - node._value = newValue; - } - else - { - var newNode = new Node(node._key, newValue, hashcode, node._next); - - if (prev is null) - { - Volatile.Write(ref bucket, newNode); - } - else - { - prev._next = newNode; - } - } - - return true; - } - - return false; - } - - prev = node; - } - - // didn't find the key - return false; - } - } - } - - /// <summary> - /// Removes all keys and values from the <see cref="ConcurrentDictionary{TKey,TValue}"/>. - /// </summary> - public void Clear() - { - int locksAcquired = 0; - try - { - AcquireAllLocks(ref locksAcquired); - - // If the dictionary is already empty, then there's nothing to clear. - if (AreAllBucketsEmpty()) - { - return; - } - - Tables tables = _tables; - var newTables = new Tables(new VolatileNode[HashHelpers.GetPrime(_initialCapacity)], tables._locks, new int[tables._countPerLock.Length], tables._comparer); - _tables = newTables; - _budget = Math.Max(1, newTables._buckets.Length / newTables._locks.Length); - } - finally - { - ReleaseLocks(locksAcquired); - } - } - - /// <summary> - /// Copies the elements of the <see cref="ICollection{T}"/> to an array of type <see cref="KeyValuePair{TKey,TValue}"/>, - /// starting at the specified array index. - /// </summary> - /// <param name="array"> - /// The one-dimensional array of type <see cref="KeyValuePair{TKey,TValue}"/> that is the destination of the <see - /// cref="KeyValuePair{TKey,TValue}"/> elements copied from the <see cref="ICollection"/>. The array must have zero-based indexing. - /// </param> - /// <param name="index">The zero-based index in <paramref name="array"/> at which copying begins.</param> - /// <exception cref="ArgumentNullException"><paramref name="array"/> is a null reference (Nothing in Visual Basic).</exception> - /// <exception cref="ArgumentOutOfRangeException"><paramref name="index"/> is less than 0.</exception> - /// <exception cref="ArgumentException"> - /// <paramref name="index"/> is equal to or greater than the length of the <paramref name="array"/>. -or- The number of - /// elements in the source <see cref="ICollection"/> is greater than the available space from <paramref name="index"/> to - /// the end of the destination <paramref name="array"/>. - /// </exception> - void ICollection<KeyValuePair<TKey, TValue>>.CopyTo(KeyValuePair<TKey, TValue>[] array, int index) - { - ArgumentNullException.ThrowIfNull(array); - - ArgumentOutOfRangeException.ThrowIfNegative(index); - - int locksAcquired = 0; - try - { - AcquireAllLocks(ref locksAcquired); - - int count = GetCountNoLocks(); - if (array.Length - count < index) - { - throw new ArgumentException(SR.ConcurrentDictionary_ArrayNotLargeEnough); - } - - CopyToPairs(array, index); - } - finally - { - ReleaseLocks(locksAcquired); - } - } - - /// <summary> - /// Copies the key and value pairs stored in the <see cref="ConcurrentDictionary{TKey,TValue}"/> to a - /// new array. - /// </summary> - /// <returns>A new array containing a snapshot of key and value pairs copied from the <see cref="ConcurrentDictionary{TKey,TValue}"/>. - /// </returns> - public KeyValuePair<TKey, TValue>[] ToArray() - { - int locksAcquired = 0; - try - { - AcquireAllLocks(ref locksAcquired); - - int count = GetCountNoLocks(); - if (count == 0) - { - return []; - } - - var array = new KeyValuePair<TKey, TValue>[count]; - CopyToPairs(array, 0); - return array; - } - finally - { - ReleaseLocks(locksAcquired); - } - } - - /// <summary>Copy dictionary contents to an array - shared implementation between ToArray and CopyTo.</summary> - /// <remarks>Important: the caller must hold all locks in _locks before calling CopyToPairs.</remarks> - private void CopyToPairs(KeyValuePair<TKey, TValue>[] array, int index) - { - foreach (VolatileNode bucket in _tables._buckets) - { - for (Node? current = bucket._node; current is not null; current = current._next) - { - array[index] = new KeyValuePair<TKey, TValue>(current._key, current._value); - Debug.Assert(index < int.MaxValue, "This method should only be called when there's no overflow risk"); - index++; - } - } - } - - /// <summary>Copy dictionary contents to an array - shared implementation between ToArray and CopyTo.</summary> - /// <remarks>Important: the caller must hold all locks in _locks before calling CopyToPairs.</remarks> - private void CopyToEntries(DictionaryEntry[] array, int index) - { - foreach (VolatileNode bucket in _tables._buckets) - { - for (Node? current = bucket._node; current is not null; current = current._next) - { - array[index] = new DictionaryEntry(current._key, current._value); - Debug.Assert(index < int.MaxValue, "This method should only be called when there's no overflow risk"); - index++; - } - } - } - - /// <summary>Copy dictionary contents to an array - shared implementation between ToArray and CopyTo.</summary> - /// <remarks>Important: the caller must hold all locks in _locks before calling CopyToPairs.</remarks> - private void CopyToObjects(object[] array, int index) - { - foreach (VolatileNode bucket in _tables._buckets) - { - for (Node? current = bucket._node; current is not null; current = current._next) - { - array[index] = new KeyValuePair<TKey, TValue>(current._key, current._value); - Debug.Assert(index < int.MaxValue, "This method should only be called when there's no overflow risk"); - index++; - } - } - } - - /// <summary>Returns an enumerator that iterates through the <see - /// cref="ConcurrentDictionary{TKey,TValue}"/>.</summary> - /// <returns>An enumerator for the <see cref="ConcurrentDictionary{TKey,TValue}"/>.</returns> - /// <remarks> - /// The enumerator returned from the dictionary is safe to use concurrently with - /// reads and writes to the dictionary, however it does not represent a moment-in-time snapshot - /// of the dictionary. The contents exposed through the enumerator may contain modifications - /// made to the dictionary after <see cref="GetEnumerator"/> was called. - /// </remarks> - public IEnumerator<KeyValuePair<TKey, TValue>> GetEnumerator() => new Enumerator(this); - - /// <summary>Provides an enumerator implementation for the dictionary.</summary> - private sealed class Enumerator(ConcurrentDictionary<TKey, TValue> dictionary) : IEnumerator<KeyValuePair<TKey, TValue>> - { - // Provides a manually-implemented version of (approximately) this iterator: - // VolatileNodeWrapper[] buckets = _tables._buckets; - // for (int i = 0; i < buckets.Length; i++) - // for (Node? current = buckets[i]._node; current is not null; current = current._next) - // yield return new KeyValuePair<TKey, TValue>(current._key, current._value); - - private readonly ConcurrentDictionary<TKey, TValue> _dictionary = dictionary; - - private ConcurrentDictionary<TKey, TValue>.VolatileNode[]? _buckets; - private Node? _node; - private int _i = -1; - - public KeyValuePair<TKey, TValue> Current { get; private set; } - - object IEnumerator.Current => Current; - - public void Reset() - { - _buckets = null; - _node = null; - Current = default; - _i = -1; - } - - public void Dispose() { } - - public bool MoveNext() - { - while (true) - { - if (_node is Node node) - { - Current = new KeyValuePair<TKey, TValue>(node._key, node._value); - _node = node._next; - return true; - } - - ConcurrentDictionary<TKey, TValue>.VolatileNode[]? buckets = _buckets ??= _dictionary._tables._buckets; - Debug.Assert(buckets is not null); - - int i = _i + 1; - if ((uint)i >= (uint)buckets.Length) - { - return false; - } - - _node = buckets[i]._node; - _i = i; - } - } - } - - /// <summary> - /// Shared internal implementation for inserts and updates. - /// If key exists, we always return false; and if updateIfExists == true we force update with value; - /// If key doesn't exist, we always add value and return true; - /// </summary> - private bool TryAddInternal(Tables tables, TKey key, int? nullableHashcode, TValue value, bool updateIfExists, bool acquireLock, out TValue resultingValue) - { - IEqualityComparer<TKey>? comparer = tables._comparer; - - int hashcode = nullableHashcode ?? GetHashCode(comparer, key); - Debug.Assert(nullableHashcode is null || nullableHashcode == hashcode); - - while (true) - { - object[] locks = tables._locks; - ref Node? bucket = ref GetBucketAndLock(tables, hashcode, out uint lockNo); - - bool resizeDesired = false; - bool lockTaken = false; - try - { - if (acquireLock) - { - Monitor.Enter(locks[lockNo], ref lockTaken); - } - - // If the table just got resized, we may not be holding the right lock, and must retry. - // This should be a rare occurrence. - if (tables != _tables) - { - tables = _tables; - if (!ReferenceEquals(comparer, tables._comparer)) - { - comparer = tables._comparer; - hashcode = GetHashCode(comparer, key); - } - continue; - } - - // Try to find this key in the bucket - Node? prev = null; - for (Node? node = bucket; node is not null; node = node._next) - { - Debug.Assert((prev is null && node == bucket) || prev!._next == node); - if (hashcode == node._hashcode && NodeEqualsKey(comparer, node, key)) - { - // The key was found in the dictionary. If updates are allowed, update the value for that key. - // We need to create a new node for the update, in order to support TValue types that cannot - // be written atomically, since lock-free reads may be happening concurrently. - if (updateIfExists) - { - // Do the reference type check up front to handle many cases of shared generics. - // If TValue is a value type then the field's value here can be baked in. Otherwise, - // for the remaining shared generic cases the field access here would disqualify inlining, - // so the following check cannot be factored out of TryAddInternal/TryUpdateInternal. - if (!typeof(TValue).IsValueType || ConcurrentDictionaryTypeProps<TValue>.IsWriteAtomic) - { - node._value = value; - } - else - { - var newNode = new Node(node._key, value, hashcode, node._next); - if (prev is null) - { - Volatile.Write(ref bucket, newNode); - } - else - { - prev._next = newNode; - } - } - resultingValue = value; - } - else - { - resultingValue = node._value; - } - return false; - } - prev = node; - } - - // The key was not found in the bucket. Insert the key-value pair. - var resultNode = new Node(key, value, hashcode, bucket); - Volatile.Write(ref bucket, resultNode); - checked - { - tables._countPerLock[lockNo]++; - } - - // If the number of elements guarded by this lock has exceeded the budget, resize the bucket table. - // It is also possible that GrowTable will increase the budget but won't resize the bucket table. - // That happens if the bucket table is found to be poorly utilized due to a bad hash function. - if (tables._countPerLock[lockNo] > _budget) - { - resizeDesired = true; - } - - // NOTE(OptunaSharp vendoring): the non-randomized-string collision-rehash upgrade is - // omitted along with NonRandomizedStringEqualityComparer (see the constructor). - } - finally - { - if (lockTaken) - { - Monitor.Exit(locks[lockNo]); - } - } - - // The fact that we got here means that we just performed an insertion. If necessary, we will grow the table. - // - // Concurrency notes: - // - Notice that we are not holding any locks at when calling GrowTable. This is necessary to prevent deadlocks. - // - As a result, it is possible that GrowTable will be called unnecessarily. But, GrowTable will obtain lock 0 - // and then verify that the table we passed to it as the argument is still the current table. - if (resizeDesired) - { - GrowTable(tables, resizeDesired); - } - - resultingValue = value; - return true; - } - } - - /// <summary>Gets or sets the value associated with the specified key.</summary> - /// <param name="key">The key of the value to get or set.</param> - /// <value> - /// The value associated with the specified key. If the specified key is not found, a get operation throws a - /// <see cref="KeyNotFoundException"/>, and a set operation creates a new element with the specified key. - /// </value> - /// <exception cref="ArgumentNullException"> - /// <paramref name="key"/> is a null reference (Nothing in Visual Basic). - /// </exception> - /// <exception cref="KeyNotFoundException"> - /// The property is retrieved and <paramref name="key"/> does not exist in the collection. - /// </exception> - public TValue this[TKey key] - { - get - { - if (!TryGetValue(key, out TValue? value)) - { - ThrowKeyNotFoundException(key); - } - return value; - } - set - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - TryAddInternal(_tables, key, null, value, updateIfExists: true, acquireLock: true, out _); - } - } - - /// <summary>Throws a KeyNotFoundException.</summary> - /// <remarks>Separate from ThrowHelper to avoid boxing at call site while reusing this generic instantiation.</remarks> - [DoesNotReturn] - private static void ThrowKeyNotFoundException(TKey key) => - throw new KeyNotFoundException(SR.Format(SR.Arg_KeyNotFoundWithKey, key.ToString())); - - /// <summary> - /// Gets the <see cref="IEqualityComparer{TKey}" /> - /// that is used to determine equality of keys for the dictionary. - /// </summary> - /// <value> - /// The <see cref="IEqualityComparer{TKey}" /> generic interface implementation - /// that is used to determine equality of keys for the current - /// <see cref="ConcurrentDictionary{TKey, TValue}" /> and to provide hash values for the keys. - /// </value> - /// <remarks> - /// <see cref="ConcurrentDictionary{TKey, TValue}" /> requires an equality implementation to determine - /// whether keys are equal. You can specify an implementation of the <see cref="IEqualityComparer{TKey}" /> - /// generic interface by using a constructor that accepts a comparer parameter; - /// if you do not specify one, the default generic equality comparer <see cref="EqualityComparer{TKey}.Default" /> is used. - /// </remarks> - public IEqualityComparer<TKey> Comparer - { - get - { - IEqualityComparer<TKey>? comparer = _tables._comparer; - - // NOTE(OptunaSharp vendoring): no NonRandomizedStringEqualityComparer to unwrap (see the - // constructor); the stored comparer is returned directly. - return comparer ?? EqualityComparer<TKey>.Default; - } - } - - /// <summary> - /// Gets the number of key/value pairs contained in the <see - /// cref="ConcurrentDictionary{TKey,TValue}"/>. - /// </summary> - /// <exception cref="OverflowException">The dictionary contains too many - /// elements.</exception> - /// <value>The number of key/value pairs contained in the <see - /// cref="ConcurrentDictionary{TKey,TValue}"/>.</value> - /// <remarks>Count has snapshot semantics and represents the number of items in the <see - /// cref="ConcurrentDictionary{TKey,TValue}"/> - /// at the moment when Count was accessed.</remarks> - public int Count - { - get - { - int locksAcquired = 0; - try - { - AcquireAllLocks(ref locksAcquired); - - return GetCountNoLocks(); - } - finally - { - ReleaseLocks(locksAcquired); - } - } - } - - /// <summary>Gets the number of pairs stored in the dictionary.</summary> - /// <remarks>This assumes all of the dictionary's locks have been taken, or else the result may not be accurate.</remarks> - private int GetCountNoLocks() - { - int count = 0; - foreach (int value in _tables._countPerLock) - { - checked { count += value; } - } - - return count; - } - - /// <summary> - /// Adds a key/value pair to the <see cref="ConcurrentDictionary{TKey,TValue}"/> - /// if the key does not already exist. - /// </summary> - /// <param name="key">The key of the element to add.</param> - /// <param name="valueFactory">The function used to generate a value for the key</param> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="ArgumentNullException"><paramref name="valueFactory"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="OverflowException">The dictionary contains too many - /// elements.</exception> - /// <returns>The value for the key. This will be either the existing value for the key if the - /// key is already in the dictionary, or the new value for the key as returned by valueFactory - /// if the key was not in the dictionary.</returns> - public TValue GetOrAdd(TKey key, Func<TKey, TValue> valueFactory) - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - if (valueFactory is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.valueFactory); - } - - Tables tables = _tables; - - IEqualityComparer<TKey>? comparer = tables._comparer; - int hashcode = GetHashCode(comparer, key); - - if (!TryGetValueInternal(tables, key, hashcode, out TValue? resultingValue)) - { - TryAddInternal(tables, key, hashcode, valueFactory(key), updateIfExists: false, acquireLock: true, out resultingValue); - } - - return resultingValue; - } - - /// <summary> - /// Adds a key/value pair to the <see cref="ConcurrentDictionary{TKey,TValue}"/> - /// if the key does not already exist. - /// </summary> - /// <param name="key">The key of the element to add.</param> - /// <param name="valueFactory">The function used to generate a value for the key</param> - /// <param name="factoryArgument">An argument value to pass into <paramref name="valueFactory"/>.</param> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="ArgumentNullException"><paramref name="valueFactory"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="OverflowException">The dictionary contains too many - /// elements.</exception> - /// <returns>The value for the key. This will be either the existing value for the key if the - /// key is already in the dictionary, or the new value for the key as returned by valueFactory - /// if the key was not in the dictionary.</returns> - public TValue GetOrAdd<TArg>(TKey key, Func<TKey, TArg, TValue> valueFactory, TArg factoryArgument) - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - if (valueFactory is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.valueFactory); - } - - Tables tables = _tables; - - IEqualityComparer<TKey>? comparer = tables._comparer; - int hashcode = GetHashCode(comparer, key); - - if (!TryGetValueInternal(tables, key, hashcode, out TValue? resultingValue)) - { - TryAddInternal(tables, key, hashcode, valueFactory(key, factoryArgument), updateIfExists: false, acquireLock: true, out resultingValue); - } - - return resultingValue; - } - - /// <summary> - /// Adds a key/value pair to the <see cref="ConcurrentDictionary{TKey,TValue}"/> - /// if the key does not already exist. - /// </summary> - /// <param name="key">The key of the element to add.</param> - /// <param name="value">the value to be added, if the key does not already exist</param> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="OverflowException">The dictionary contains too many - /// elements.</exception> - /// <returns>The value for the key. This will be either the existing value for the key if the - /// key is already in the dictionary, or the new value if the key was not in the dictionary.</returns> - public TValue GetOrAdd(TKey key, TValue value) - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - Tables tables = _tables; - - IEqualityComparer<TKey>? comparer = tables._comparer; - int hashcode = GetHashCode(comparer, key); - - if (!TryGetValueInternal(tables, key, hashcode, out TValue? resultingValue)) - { - TryAddInternal(tables, key, hashcode, value, updateIfExists: false, acquireLock: true, out resultingValue); - } - - return resultingValue; - } - - /// <summary> - /// Adds a key/value pair to the <see cref="ConcurrentDictionary{TKey,TValue}"/> if the key does not already - /// exist, or updates a key/value pair in the <see cref="ConcurrentDictionary{TKey,TValue}"/> if the key - /// already exists. - /// </summary> - /// <param name="key">The key to be added or whose value should be updated</param> - /// <param name="addValueFactory">The function used to generate a value for an absent key</param> - /// <param name="updateValueFactory">The function used to generate a new value for an existing key - /// based on the key's existing value</param> - /// <param name="factoryArgument">An argument to pass into <paramref name="addValueFactory"/> and <paramref name="updateValueFactory"/>.</param> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="ArgumentNullException"><paramref name="addValueFactory"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="ArgumentNullException"><paramref name="updateValueFactory"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="OverflowException">The dictionary contains too many - /// elements.</exception> - /// <returns>The new value for the key. This will be either be the result of addValueFactory (if the key was - /// absent) or the result of updateValueFactory (if the key was present).</returns> - public TValue AddOrUpdate<TArg>( - TKey key, Func<TKey, TArg, TValue> addValueFactory, Func<TKey, TValue, TArg, TValue> updateValueFactory, TArg factoryArgument) - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - if (addValueFactory is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.addValueFactory); - } - - if (updateValueFactory is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.updateValueFactory); - } - - Tables tables = _tables; - - IEqualityComparer<TKey>? comparer = tables._comparer; - int hashcode = GetHashCode(comparer, key); - - while (true) - { - if (TryGetValueInternal(tables, key, hashcode, out TValue? oldValue)) - { - // key exists, try to update - TValue newValue = updateValueFactory(key, oldValue, factoryArgument); - if (TryUpdateInternal(tables, key, hashcode, newValue, oldValue)) - { - return newValue; - } - } - else - { - // key doesn't exist, try to add - if (TryAddInternal(tables, key, hashcode, addValueFactory(key, factoryArgument), updateIfExists: false, acquireLock: true, out TValue resultingValue)) - { - return resultingValue; - } - } - - if (tables != _tables) - { - tables = _tables; - if (!ReferenceEquals(comparer, tables._comparer)) - { - comparer = tables._comparer; - hashcode = GetHashCode(comparer, key); - } - } - } - } - - /// <summary> - /// Adds a key/value pair to the <see cref="ConcurrentDictionary{TKey,TValue}"/> if the key does not already - /// exist, or updates a key/value pair in the <see cref="ConcurrentDictionary{TKey,TValue}"/> if the key - /// already exists. - /// </summary> - /// <param name="key">The key to be added or whose value should be updated</param> - /// <param name="addValueFactory">The function used to generate a value for an absent key</param> - /// <param name="updateValueFactory">The function used to generate a new value for an existing key - /// based on the key's existing value</param> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="ArgumentNullException"><paramref name="addValueFactory"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="ArgumentNullException"><paramref name="updateValueFactory"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="OverflowException">The dictionary contains too many - /// elements.</exception> - /// <returns>The new value for the key. This will be either the result of addValueFactory (if the key was - /// absent) or the result of updateValueFactory (if the key was present).</returns> - public TValue AddOrUpdate(TKey key, Func<TKey, TValue> addValueFactory, Func<TKey, TValue, TValue> updateValueFactory) - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - if (addValueFactory is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.addValueFactory); - } - - if (updateValueFactory is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.updateValueFactory); - } - - Tables tables = _tables; - - IEqualityComparer<TKey>? comparer = tables._comparer; - int hashcode = GetHashCode(comparer, key); - - while (true) - { - if (TryGetValueInternal(tables, key, hashcode, out TValue? oldValue)) - { - // key exists, try to update - TValue newValue = updateValueFactory(key, oldValue); - if (TryUpdateInternal(tables, key, hashcode, newValue, oldValue)) - { - return newValue; - } - } - else - { - // key doesn't exist, try to add - if (TryAddInternal(tables, key, hashcode, addValueFactory(key), updateIfExists: false, acquireLock: true, out TValue resultingValue)) - { - return resultingValue; - } - } - - if (tables != _tables) - { - tables = _tables; - if (!ReferenceEquals(comparer, tables._comparer)) - { - comparer = tables._comparer; - hashcode = GetHashCode(comparer, key); - } - } - } - } - - /// <summary> - /// Adds a key/value pair to the <see cref="ConcurrentDictionary{TKey,TValue}"/> if the key does not already - /// exist, or updates a key/value pair in the <see cref="ConcurrentDictionary{TKey,TValue}"/> if the key - /// already exists. - /// </summary> - /// <param name="key">The key to be added or whose value should be updated</param> - /// <param name="addValue">The value to be added for an absent key</param> - /// <param name="updateValueFactory">The function used to generate a new value for an existing key based on - /// the key's existing value</param> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="ArgumentNullException"><paramref name="updateValueFactory"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="OverflowException">The dictionary contains too many - /// elements.</exception> - /// <returns>The new value for the key. This will be either the value of addValue (if the key was - /// absent) or the result of updateValueFactory (if the key was present).</returns> - public TValue AddOrUpdate(TKey key, TValue addValue, Func<TKey, TValue, TValue> updateValueFactory) - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - if (updateValueFactory is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.updateValueFactory); - } - - Tables tables = _tables; - - IEqualityComparer<TKey>? comparer = tables._comparer; - int hashcode = GetHashCode(comparer, key); - - while (true) - { - if (TryGetValueInternal(tables, key, hashcode, out TValue? oldValue)) - { - // key exists, try to update - TValue newValue = updateValueFactory(key, oldValue); - if (TryUpdateInternal(tables, key, hashcode, newValue, oldValue)) - { - return newValue; - } - } - else - { - // key doesn't exist, try to add - if (TryAddInternal(tables, key, hashcode, addValue, updateIfExists: false, acquireLock: true, out TValue resultingValue)) - { - return resultingValue; - } - } - - if (tables != _tables) - { - tables = _tables; - if (!ReferenceEquals(comparer, tables._comparer)) - { - comparer = tables._comparer; - hashcode = GetHashCode(comparer, key); - } - } - } - } - - /// <summary> - /// Gets a value that indicates whether the <see cref="ConcurrentDictionary{TKey,TValue}"/> is empty. - /// </summary> - /// <value>true if the <see cref="ConcurrentDictionary{TKey,TValue}"/> is empty; otherwise, - /// false.</value> - public bool IsEmpty - { - get - { - // Check if any buckets are non-empty, without acquiring any locks. - // This fast path should generally suffice as collections are usually not empty. - if (!AreAllBucketsEmpty()) - { - return false; - } - - // We didn't see any buckets containing items, however we can't be sure - // the collection was actually empty at any point in time as items may have been - // added and removed while iterating over the buckets such that we never saw an - // empty bucket, but there was always an item present in at least one bucket. - int locksAcquired = 0; - try - { - AcquireAllLocks(ref locksAcquired); - - return AreAllBucketsEmpty(); - } - finally - { - ReleaseLocks(locksAcquired); - } - } - } - - #region IDictionary<TKey,TValue> members - - /// <summary> - /// Adds the specified key and value to the <see - /// cref="IDictionary{TKey,TValue}"/>. - /// </summary> - /// <param name="key">The object to use as the key of the element to add.</param> - /// <param name="value">The object to use as the value of the element to add.</param> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="OverflowException">The dictionary contains too many - /// elements.</exception> - /// <exception cref="ArgumentException"> - /// An element with the same key already exists in the <see - /// cref="ConcurrentDictionary{TKey,TValue}"/>.</exception> - void IDictionary<TKey, TValue>.Add(TKey key, TValue value) - { - if (!TryAdd(key, value)) - { - throw new ArgumentException(SR.ConcurrentDictionary_KeyAlreadyExisted); - } - } - - /// <summary> - /// Removes the element with the specified key from the <see - /// cref="IDictionary{TKey,TValue}"/>. - /// </summary> - /// <param name="key">The key of the element to remove.</param> - /// <returns>true if the element is successfully remove; otherwise false. This method also returns - /// false if - /// <paramref name="key"/> was not found in the original <see - /// cref="IDictionary{TKey,TValue}"/>. - /// </returns> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference - /// (Nothing in Visual Basic).</exception> - bool IDictionary<TKey, TValue>.Remove(TKey key) => TryRemove(key, out _); - - /// <summary> - /// Gets a snapshot containing all the keys in the <see cref="ConcurrentDictionary{TKey,TValue}"/>. - /// </summary> - /// <remarks>The property returns a copy of all the keys. It's not kept in sync with <see cref="ConcurrentDictionary{TKey,TValue}"/>.</remarks> - public ICollection<TKey> Keys => GetKeys(); - - /// <inheritdoc cref="Keys"/> - IEnumerable<TKey> IReadOnlyDictionary<TKey, TValue>.Keys => GetKeys(); - - /// <summary> - /// Gets a snapshot containing all the values in the <see cref="ConcurrentDictionary{TKey,TValue}"/>. - /// </summary> - /// <remarks>The property returns a copy of all the values. It's not kept in sync with <see cref="ConcurrentDictionary{TKey,TValue}"/>.</remarks> - public ICollection<TValue> Values => GetValues(); - - /// <inheritdoc cref="Values"/> - IEnumerable<TValue> IReadOnlyDictionary<TKey, TValue>.Values => GetValues(); - #endregion - - #region ICollection<KeyValuePair<TKey,TValue>> Members - - /// <summary> - /// Adds the specified value to the <see cref="ICollection{TValue}"/> - /// with the specified key. - /// </summary> - /// <param name="keyValuePair">The <see cref="KeyValuePair{TKey,TValue}"/> - /// structure representing the key and value to add to the <see - /// cref="ConcurrentDictionary{TKey,TValue}"/>.</param> - /// <exception cref="ArgumentNullException">The <paramref name="keyValuePair"/> of <paramref - /// name="keyValuePair"/> is null.</exception> - /// <exception cref="OverflowException">The <see - /// cref="ConcurrentDictionary{TKey,TValue}"/> - /// contains too many elements.</exception> - /// <exception cref="ArgumentException">An element with the same key already exists in the - /// <see cref="ConcurrentDictionary{TKey,TValue}"/></exception> - void ICollection<KeyValuePair<TKey, TValue>>.Add(KeyValuePair<TKey, TValue> keyValuePair) => ((IDictionary<TKey, TValue>)this).Add(keyValuePair.Key, keyValuePair.Value); - - /// <summary> - /// Determines whether the <see cref="ICollection{T}"/> - /// contains a specific key and value. - /// </summary> - /// <param name="keyValuePair">The <see cref="KeyValuePair{TKey,TValue}"/> - /// structure to locate in the <see - /// cref="ICollection{TValue}"/>.</param> - /// <returns>true if the <paramref name="keyValuePair"/> is found in the <see - /// cref="ICollection{T}"/>; otherwise, false.</returns> - bool ICollection<KeyValuePair<TKey, TValue>>.Contains(KeyValuePair<TKey, TValue> keyValuePair) => - TryGetValue(keyValuePair.Key, out TValue? value) && - EqualityComparer<TValue>.Default.Equals(value, keyValuePair.Value); - - /// <summary> - /// Gets a value indicating whether the dictionary is read-only. - /// </summary> - /// <value>true if the <see cref="ICollection{T}"/> is - /// read-only; otherwise, false. For <see - /// cref="ConcurrentDictionary{TKey,TValue}"/>, this property always returns - /// false.</value> - bool ICollection<KeyValuePair<TKey, TValue>>.IsReadOnly => false; - - /// <summary> - /// Removes a key and value from the dictionary. - /// </summary> - /// <param name="keyValuePair">The <see - /// cref="KeyValuePair{TKey,TValue}"/> - /// structure representing the key and value to remove from the <see - /// cref="ConcurrentDictionary{TKey,TValue}"/>.</param> - /// <returns>true if the key and value represented by <paramref name="keyValuePair"/> is successfully - /// found and removed; otherwise, false.</returns> - /// <exception cref="ArgumentNullException">The Key property of <paramref - /// name="keyValuePair"/> is a null reference (Nothing in Visual Basic).</exception> - bool ICollection<KeyValuePair<TKey, TValue>>.Remove(KeyValuePair<TKey, TValue> keyValuePair) => - TryRemove(keyValuePair); - - #endregion - - #region IEnumerable Members - - /// <summary>Returns an enumerator that iterates through the <see - /// cref="ConcurrentDictionary{TKey,TValue}"/>.</summary> - /// <returns>An enumerator for the <see cref="ConcurrentDictionary{TKey,TValue}"/>.</returns> - /// <remarks> - /// The enumerator returned from the dictionary is safe to use concurrently with - /// reads and writes to the dictionary, however it does not represent a moment-in-time snapshot - /// of the dictionary. The contents exposed through the enumerator may contain modifications - /// made to the dictionary after <see cref="GetEnumerator"/> was called. - /// </remarks> - IEnumerator IEnumerable.GetEnumerator() => ((ConcurrentDictionary<TKey, TValue>)this).GetEnumerator(); - - #endregion - - #region IDictionary Members - - /// <summary> - /// Adds the specified key and value to the dictionary. - /// </summary> - /// <param name="key">The object to use as the key.</param> - /// <param name="value">The object to use as the value.</param> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="OverflowException">The dictionary contains too many - /// elements.</exception> - /// <exception cref="ArgumentException"> - /// <paramref name="key"/> is of a type that is not assignable to the key type <typeparamref - /// name="TKey"/> of the <see cref="ConcurrentDictionary{TKey,TValue}"/>. -or- - /// <paramref name="value"/> is of a type that is not assignable to <typeparamref name="TValue"/>, - /// the type of values in the <see cref="ConcurrentDictionary{TKey,TValue}"/>. - /// -or- A value with the same key already exists in the <see - /// cref="ConcurrentDictionary{TKey,TValue}"/>. - /// </exception> - void IDictionary.Add(object key, object? value) - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - if (!(key is TKey)) - { - throw new ArgumentException(SR.ConcurrentDictionary_TypeOfKeyIncorrect); - } - - ThrowIfInvalidObjectValue(value); - - ((IDictionary<TKey, TValue>)this).Add((TKey)key, (TValue)value!); - } - - /// <summary> - /// Gets whether the <see cref="IDictionary"/> contains an - /// element with the specified key. - /// </summary> - /// <param name="key">The key to locate in the <see - /// cref="IDictionary"/>.</param> - /// <returns>true if the <see cref="IDictionary"/> contains - /// an element with the specified key; otherwise, false.</returns> - /// <exception cref="ArgumentNullException"> <paramref name="key"/> is a null reference - /// (Nothing in Visual Basic).</exception> - bool IDictionary.Contains(object key) - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - return key is TKey tkey && ContainsKey(tkey); - } - - /// <summary>Provides an <see cref="IDictionaryEnumerator"/> for the - /// <see cref="IDictionary"/>.</summary> - /// <returns>An <see cref="IDictionaryEnumerator"/> for the <see - /// cref="IDictionary"/>.</returns> - IDictionaryEnumerator IDictionary.GetEnumerator() => new DictionaryEnumerator(this); - - /// <summary> - /// Gets a value indicating whether the <see - /// cref="IDictionary"/> has a fixed size. - /// </summary> - /// <value>true if the <see cref="IDictionary"/> has a - /// fixed size; otherwise, false. For <see - /// cref="ConcurrentDictionary{TKey,TValue}"/>, this property always - /// returns false.</value> - bool IDictionary.IsFixedSize => false; - - /// <summary> - /// Gets a value indicating whether the <see - /// cref="IDictionary"/> is read-only. - /// </summary> - /// <value>true if the <see cref="IDictionary"/> is - /// read-only; otherwise, false. For <see - /// cref="ConcurrentDictionary{TKey,TValue}"/>, this property always - /// returns false.</value> - bool IDictionary.IsReadOnly => false; - - /// <summary> - /// Gets an <see cref="ICollection"/> containing the keys of the <see - /// cref="IDictionary"/>. - /// </summary> - /// <value>An <see cref="ICollection"/> containing the keys of the <see - /// cref="IDictionary"/>.</value> - ICollection IDictionary.Keys => GetKeys(); - - /// <summary> - /// Removes the element with the specified key from the <see - /// cref="IDictionary"/>. - /// </summary> - /// <param name="key">The key of the element to remove.</param> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference - /// (Nothing in Visual Basic).</exception> - void IDictionary.Remove(object key) - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - if (key is TKey tkey) - { - TryRemove(tkey, out _); - } - } - - /// <summary> - /// Gets an <see cref="ICollection"/> containing the values in the <see - /// cref="IDictionary"/>. - /// </summary> - /// <value>An <see cref="ICollection"/> containing the values in the <see - /// cref="IDictionary"/>.</value> - ICollection IDictionary.Values => GetValues(); - - /// <summary> - /// Gets or sets the value associated with the specified key. - /// </summary> - /// <param name="key">The key of the value to get or set.</param> - /// <value>The value associated with the specified key, or a null reference (Nothing in Visual Basic) - /// if <paramref name="key"/> is not in the dictionary or <paramref name="key"/> is of a type that is - /// not assignable to the key type <typeparamref name="TKey"/> of the <see - /// cref="ConcurrentDictionary{TKey,TValue}"/>.</value> - /// <exception cref="ArgumentNullException"><paramref name="key"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="ArgumentException"> - /// A value is being assigned, and <paramref name="key"/> is of a type that is not assignable to the - /// key type <typeparamref name="TKey"/> of the <see - /// cref="ConcurrentDictionary{TKey,TValue}"/>. -or- A value is being - /// assigned, and <paramref name="key"/> is of a type that is not assignable to the value type - /// <typeparamref name="TValue"/> of the <see - /// cref="ConcurrentDictionary{TKey,TValue}"/> - /// </exception> - object? IDictionary.this[object key] - { - get - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - if (key is TKey tkey && TryGetValue(tkey, out TValue? value)) - { - return value; - } - - return null; - } - set - { - if (key is null) - { - ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key); - } - - if (!(key is TKey)) - { - throw new ArgumentException(SR.ConcurrentDictionary_TypeOfKeyIncorrect); - } - - ThrowIfInvalidObjectValue(value); - - ((ConcurrentDictionary<TKey, TValue>)this)[(TKey)key] = (TValue)value!; - } - } - - [MethodImpl(MethodImplOptions.AggressiveInlining)] - private static void ThrowIfInvalidObjectValue(object? value) - { - if (value is not null) - { - if (!(value is TValue)) - { - ThrowHelper.ThrowArgumentException(ExceptionResource.ConcurrentDictionary_TypeOfValueIncorrect); - } - } - else if (default(TValue) is not null) - { - ThrowHelper.ThrowArgumentException(ExceptionResource.ConcurrentDictionary_TypeOfValueIncorrect); - } - } - - #endregion - - #region ICollection Members - - /// <summary> - /// Copies the elements of the <see cref="ICollection"/> to an array, starting - /// at the specified array index. - /// </summary> - /// <param name="array">The one-dimensional array that is the destination of the elements copied from - /// the <see cref="ICollection"/>. The array must have zero-based - /// indexing.</param> - /// <param name="index">The zero-based index in <paramref name="array"/> at which copying - /// begins.</param> - /// <exception cref="ArgumentNullException"><paramref name="array"/> is a null reference - /// (Nothing in Visual Basic).</exception> - /// <exception cref="ArgumentOutOfRangeException"><paramref name="index"/> is less than - /// 0.</exception> - /// <exception cref="ArgumentException"><paramref name="index"/> is equal to or greater than - /// the length of the <paramref name="array"/>. -or- The number of elements in the source <see - /// cref="ICollection"/> - /// is greater than the available space from <paramref name="index"/> to the end of the destination - /// <paramref name="array"/>.</exception> - void ICollection.CopyTo(Array array, int index) - { - ArgumentNullException.ThrowIfNull(array); - ArgumentOutOfRangeException.ThrowIfNegative(index); - - int locksAcquired = 0; - try - { - AcquireAllLocks(ref locksAcquired); - - int count = GetCountNoLocks(); - if (array.Length - count < index) - { - throw new ArgumentException(SR.ConcurrentDictionary_ArrayNotLargeEnough); - } - - // To be consistent with the behavior of ICollection.CopyTo() in Dictionary<TKey,TValue>, - // we recognize three types of target arrays: - // - an array of KeyValuePair<TKey, TValue> structs - // - an array of DictionaryEntry structs - // - an array of objects - - if (array is KeyValuePair<TKey, TValue>[] pairs) - { - CopyToPairs(pairs, index); - return; - } - - if (array is DictionaryEntry[] entries) - { - CopyToEntries(entries, index); - return; - } - - if (array is object[] objects) - { - CopyToObjects(objects, index); - return; - } - - throw new ArgumentException(SR.ConcurrentDictionary_ArrayIncorrectType, nameof(array)); - } - finally - { - ReleaseLocks(locksAcquired); - } - } - - /// <summary> - /// Gets a value indicating whether access to the <see cref="ICollection"/> is - /// synchronized with the SyncRoot. - /// </summary> - /// <value>true if access to the <see cref="ICollection"/> is synchronized - /// (thread safe); otherwise, false. For <see - /// cref="ConcurrentDictionary{TKey,TValue}"/>, this property always - /// returns false.</value> - bool ICollection.IsSynchronized => false; - - /// <summary> - /// Gets an object that can be used to synchronize access to the <see - /// cref="ICollection"/>. This property is not supported. - /// </summary> - /// <exception cref="NotSupportedException">The SyncRoot property is not supported.</exception> - object ICollection.SyncRoot => throw new NotSupportedException(SR.ConcurrentCollection_SyncRoot_NotSupported); - - #endregion - - private bool AreAllBucketsEmpty() => - !_tables._countPerLock.AsSpan().ContainsAnyExcept(0); - - /// <summary> - /// Replaces the bucket table with a larger one. To prevent multiple threads from resizing the - /// table as a result of races, the Tables instance that holds the table of buckets deemed too - /// small is passed in as an argument to GrowTable(). GrowTable() obtains a lock, and then checks - /// the Tables instance has been replaced in the meantime or not. - /// </summary> - private void GrowTable(Tables tables, bool resizeDesired) - { - int locksAcquired = 0; - try - { - // The thread that first obtains _locks[0] will be the one doing the resize operation - AcquireFirstLock(ref locksAcquired); - - // Make sure nobody resized the table while we were waiting for lock 0: - if (tables != _tables) - { - // We assume that since the table reference is different, it was already resized (or the budget - // was adjusted). If we ever decide to do table shrinking, or replace the table for other reasons, - // we will have to revisit this logic. - return; - } - - int newLength = tables._buckets.Length; - - if (resizeDesired) - { - // Compute the (approx.) total size. Use an Int64 accumulation variable to avoid an overflow. - // If the bucket array is too empty, we have an imbalance. - // If we have a string key and we're still using a non-randomized comparer, - // take this as a sign that we need to upgrade to one. - // Otherwise, double the budget instead of resizing the table. - if (GetCountNoLocks() < tables._buckets.Length / 4) - { - _budget = 2 * _budget; - if (_budget < 0) - { - _budget = int.MaxValue; - } - return; - } - - // Compute the new table size at least twice the previous table size. - // Double the size of the buckets table and choose a prime that's at least as large. - if ((newLength = tables._buckets.Length * 2) < 0 || - (newLength = HashHelpers.GetPrime(newLength)) > Array.MaxLength) - { - newLength = Array.MaxLength; - - // We want to make sure that GrowTable will not be called again, since table is at the maximum size. - // To achieve that, we set the budget to int.MaxValue. - // - // (There is one special case that would allow GrowTable() to be called in the future: - // calling Clear() on the ConcurrentDictionary will shrink the table and lower the budget.) - _budget = int.MaxValue; - } - } - - object[] newLocks = tables._locks; - - // Add more locks - if (_growLockArray && tables._locks.Length < MaxLockNumber) - { - newLocks = new object[tables._locks.Length * 2]; - Array.Copy(tables._locks, newLocks, tables._locks.Length); - for (int i = tables._locks.Length; i < newLocks.Length; i++) - { - newLocks[i] = new object(); - } - } - - var newBuckets = new VolatileNode[newLength]; - var newCountPerLock = new int[newLocks.Length]; - var newTables = new Tables(newBuckets, newLocks, newCountPerLock, tables._comparer); - - // Now acquire all other locks for the table - AcquirePostFirstLock(tables, ref locksAcquired); - - // Copy all data into a new table, creating new nodes for all elements - foreach (VolatileNode bucket in tables._buckets) - { - Node? current = bucket._node; - while (current is not null) - { - int hashCode = current._hashcode; - - Node? next = current._next; - ref Node? newBucket = ref GetBucketAndLock(newTables, hashCode, out uint newLockNo); - - newBucket = new Node(current._key, current._value, hashCode, newBucket); - - checked - { - newCountPerLock[newLockNo]++; - } - - current = next; - } - } - - // Adjust the budget - _budget = Math.Max(1, newBuckets.Length / newLocks.Length); - - // Replace tables with the new versions - _tables = newTables; - } - finally - { - ReleaseLocks(locksAcquired); - } - } - - /// <summary>The number of concurrent writes for which to optimize by default.</summary> - private static int DefaultConcurrencyLevel => Environment.ProcessorCount; - - /// <summary> - /// Acquires all locks for this hash table, and increments locksAcquired by the number - /// of locks that were successfully acquired. The locks are acquired in an increasing - /// order. - /// </summary> - private void AcquireAllLocks(ref int locksAcquired) - { - // First, acquire lock 0, then acquire the rest. _tables won't change after acquiring lock 0. - AcquireFirstLock(ref locksAcquired); - AcquirePostFirstLock(_tables, ref locksAcquired); - Debug.Assert(locksAcquired == _tables._locks.Length); - } - - /// <summary>Acquires the first lock.</summary> - /// <param name="locksAcquired">The number of locks acquired. It should be 0 on entry and 1 on exit.</param> - /// <remarks> - /// Once the caller owns the lock on lock 0, _tables._locks will not change (i.e., grow), - /// so a caller can safely snap _tables._locks to read the remaining locks. When the locks array grows, - /// even though the array object itself changes, the locks from the previous array are kept. - /// </remarks> - private void AcquireFirstLock(ref int locksAcquired) - { - object[] locks = _tables._locks; - Debug.Assert(locksAcquired == 0); - Debug.Assert(!Monitor.IsEntered(locks[0])); - - Monitor.Enter(locks[0]); - locksAcquired = 1; - } - - /// <summary>Acquires all of the locks after the first, which must already be acquired.</summary> - /// <param name="tables">The tables snapped after the first lock was acquired.</param> - /// <param name="locksAcquired"> - /// The number of locks acquired, which should be 1 on entry. It's incremented as locks - /// are taken so that the caller can reliably release those locks in a finally in case - /// of exception. - /// </param> - private static void AcquirePostFirstLock(Tables tables, ref int locksAcquired) - { - object[] locks = tables._locks; - Debug.Assert(Monitor.IsEntered(locks[0])); - Debug.Assert(locksAcquired == 1); - - for (int i = 1; i < locks.Length; i++) - { - Monitor.Enter(locks[i]); - locksAcquired++; - } - - Debug.Assert(locksAcquired == locks.Length); - } - - /// <summary>Releases all of the locks up to the specified number acquired.</summary> - /// <param name="locksAcquired">The number of locks acquired. All lock numbers in the range [0, locksAcquired) will be released.</param> - private void ReleaseLocks(int locksAcquired) - { - Debug.Assert(locksAcquired >= 0); - - object[] locks = _tables._locks; - for (int i = 0; i < locksAcquired; i++) - { - Monitor.Exit(locks[i]); - } - } - - /// <summary> - /// Gets a collection containing the keys in the dictionary. - /// </summary> - private ReadOnlyCollection<TKey> GetKeys() - { - int locksAcquired = 0; - try - { - AcquireAllLocks(ref locksAcquired); - - int count = GetCountNoLocks(); - if (count == 0) - { - return ReadOnlyCollection<TKey>.Empty; - } - - var keys = new TKey[count]; - int i = 0; - foreach (VolatileNode bucket in _tables._buckets) - { - for (Node? node = bucket._node; node is not null; node = node._next) - { - keys[i] = node._key; - i++; - } - } - Debug.Assert(i == count); - - return new ReadOnlyCollection<TKey>(keys); - } - finally - { - ReleaseLocks(locksAcquired); - } - } - - /// <summary> - /// Gets a collection containing the values in the dictionary. - /// </summary> - private ReadOnlyCollection<TValue> GetValues() - { - int locksAcquired = 0; - try - { - AcquireAllLocks(ref locksAcquired); - - int count = GetCountNoLocks(); - if (count == 0) - { - return ReadOnlyCollection<TValue>.Empty; - } - - var keys = new TValue[count]; - int i = 0; - foreach (VolatileNode bucket in _tables._buckets) - { - for (Node? node = bucket._node; node is not null; node = node._next) - { - keys[i] = node._value; - i++; - } - } - Debug.Assert(i == count); - - return new ReadOnlyCollection<TValue>(keys); - } - finally - { - ReleaseLocks(locksAcquired); - } - } - - private struct VolatileNode - { - // Workaround for https://github.com/dotnet/runtime/issues/65789. - // If we had a Node?[] array, to safely read from the array we'd need to do Volatile.Read(ref array[i]), - // but that triggers an unnecessary ldelema, which in turn results in a call to CastHelpers.LdelemaRef. - // With this wrapper, the non-inlined call disappears. - internal volatile Node? _node; - } - - /// <summary> - /// A node in a singly-linked list representing a particular hash table bucket. - /// </summary> - private sealed class Node - { - internal readonly TKey _key; - internal TValue _value; - internal volatile Node? _next; - internal readonly int _hashcode; - - internal Node(TKey key, TValue value, int hashcode, Node? next) - { - _key = key; - _value = value; - _next = next; - _hashcode = hashcode; - } - } - - /// <summary>Computes a ref to the bucket for a particular key.</summary> - /// <remarks>This reads the bucket with a read acquire barrier.</remarks> - [MethodImpl(MethodImplOptions.AggressiveInlining)] - private static Node? GetBucket(Tables tables, int hashcode) - { - VolatileNode[] buckets = tables._buckets; - if (IntPtr.Size == 8) - { - return buckets[HashHelpers.FastMod((uint)hashcode, (uint)buckets.Length, tables._fastModBucketsMultiplier)]._node; - } - else - { - return buckets[(uint)hashcode % (uint)buckets.Length]._node; - } - } - - /// <summary>Computes the bucket and lock number for a particular key.</summary> - /// <remarks>This returns a ref to the bucket node; no barriers are employed.</remarks> - [MethodImpl(MethodImplOptions.AggressiveInlining)] - private static ref Node? GetBucketAndLock(Tables tables, int hashcode, out uint lockNo) - { - VolatileNode[] buckets = tables._buckets; - uint bucketNo; - if (IntPtr.Size == 8) - { - bucketNo = HashHelpers.FastMod((uint)hashcode, (uint)buckets.Length, tables._fastModBucketsMultiplier); - } - else - { - bucketNo = (uint)hashcode % (uint)buckets.Length; - } - lockNo = bucketNo % (uint)tables._locks.Length; // doesn't use FastMod, as it would require maintaining a different multiplier - return ref buckets[bucketNo]._node; - } - - /// <summary>Tables that hold the internal state of the ConcurrentDictionary</summary> - /// <remarks>Wrapping all of the mutable state into a single object allows us to swap in everything atomically.</remarks> - private sealed class Tables - { - /// <summary>The comparer to use for lookups in the tables.</summary> - internal readonly IEqualityComparer<TKey>? _comparer; - /// <summary>A singly-linked list for each bucket.</summary> - internal readonly VolatileNode[] _buckets; - /// <summary>Pre-computed multiplier for use on 64-bit performing faster modulo operations.</summary> - internal readonly ulong _fastModBucketsMultiplier; - /// <summary>A set of locks, each guarding a section of the table.</summary> - internal readonly object[] _locks; - /// <summary>The number of elements guarded by each lock.</summary> - internal readonly int[] _countPerLock; - - internal Tables(VolatileNode[] buckets, object[] locks, int[] countPerLock, IEqualityComparer<TKey>? comparer) - { - Debug.Assert(typeof(TKey).IsValueType || comparer is not null); - - _buckets = buckets; - _locks = locks; - _countPerLock = countPerLock; - _comparer = comparer; - if (IntPtr.Size == 8) - { - _fastModBucketsMultiplier = HashHelpers.GetFastModMultiplier((uint)buckets.Length); - } - } - } - - /// <summary> - /// A private class to represent enumeration over the dictionary that implements the - /// IDictionaryEnumerator interface. - /// </summary> - private sealed class DictionaryEnumerator : IDictionaryEnumerator - { - private readonly IEnumerator<KeyValuePair<TKey, TValue>> _enumerator; // Enumerator over the dictionary. - - internal DictionaryEnumerator(ConcurrentDictionary<TKey, TValue> dictionary) => _enumerator = dictionary.GetEnumerator(); - - public DictionaryEntry Entry => new DictionaryEntry(_enumerator.Current.Key, _enumerator.Current.Value); - - public object Key => _enumerator.Current.Key; - - public object? Value => _enumerator.Current.Value; - - public object Current => Entry; - - public bool MoveNext() => _enumerator.MoveNext(); - - public void Reset() => _enumerator.Reset(); - } - - } - - internal static class ConcurrentDictionaryTypeProps<T> - { - /// <summary>Whether T's type can be written atomically (i.e., with no danger of torn reads).</summary> - internal static readonly bool IsWriteAtomic = IsWriteAtomicPrivate(); - - private static bool IsWriteAtomicPrivate() - { - // Section 12.6.6 of ECMA CLI explains which types can be read and written atomically without - // the risk of tearing. See https://www.ecma-international.org/publications/files/ECMA-ST/ECMA-335.pdf - - if (!typeof(T).IsValueType || - typeof(T) == typeof(IntPtr) || - typeof(T) == typeof(UIntPtr)) - { - return true; - } - - switch (Type.GetTypeCode(typeof(T))) - { - case TypeCode.Boolean: - case TypeCode.Byte: - case TypeCode.Char: - case TypeCode.Int16: - case TypeCode.Int32: - case TypeCode.SByte: - case TypeCode.Single: - case TypeCode.UInt16: - case TypeCode.UInt32: - return true; - - case TypeCode.Double: - case TypeCode.Int64: - case TypeCode.UInt64: - return IntPtr.Size == 8; - - default: - return false; - } - } - } -} diff --git a/src/OptunaSharp.Core/Collections/Concurrent/ConcurrentDictionaryInternals.cs b/src/OptunaSharp.Core/Collections/Concurrent/ConcurrentDictionaryInternals.cs deleted file mode 100644 index 58ac608..0000000 --- a/src/OptunaSharp.Core/Collections/Concurrent/ConcurrentDictionaryInternals.cs +++ /dev/null @@ -1,292 +0,0 @@ -// <auto-generated> -// Support types for the vendored ConcurrentDictionary (see ConcurrentDictionary.cs). -// Minimal, faithful extracts of the BCL internals that -// System.Collections.Concurrent.ConcurrentDictionary depends on, taken from -// dotnet/runtime @ main (MIT, the same license as OptunaSharp): -// - HashHelpers : src/libraries/System.Private.CoreLib/src/System/Collections/HashHelpers.cs -// - ThrowHelper : src/libraries/System.Private.CoreLib/src/System/ThrowHelper.cs -// - SR strings : the corresponding resx entries. -// They live in the dedicated OptunaSharp.Collections.Concurrent namespace so they never -// collide with the net8-only OrderedDict support types in OptunaSharp.Collections -// (OrderedDictInternal.Net8.cs), and they compile on every target framework (unlike those, -// which are guarded to net8.0). This is why the vendored ConcurrentDictionary body can keep -// its original SR/ThrowHelper/HashHelpers references verbatim. -// </auto-generated> -#nullable enable - -using System; -using System.Diagnostics; -using System.Diagnostics.CodeAnalysis; -using System.Runtime.CompilerServices; - -namespace OptunaSharp.Collections.Concurrent -{ - /// <summary> - /// Identifies the parameter a vendored <see cref="ThrowHelper" /> overload blames, so the thrown - /// <see cref="ArgumentException" /> carries the correct <see cref="ArgumentException.ParamName" />. - /// </summary> - /// <remarks> - /// Mirrors the CoreLib enum of the same name but is trimmed to only the members the vendored - /// <see cref="ConcurrentDictionary{TKey,TValue}" /> actually references; adding a throw site that - /// names a new argument requires adding the member here and its case in <see cref="ThrowHelper" />. - /// </remarks> - internal enum ExceptionArgument - { - /// <summary>The <c>key</c> parameter.</summary> - key, - - /// <summary>The <c>item</c> parameter (a key/value pair).</summary> - item, - - /// <summary>The <c>valueFactory</c> parameter.</summary> - valueFactory, - - /// <summary>The <c>addValueFactory</c> parameter.</summary> - addValueFactory, - - /// <summary>The <c>updateValueFactory</c> parameter.</summary> - updateValueFactory, - } - - /// <summary> - /// Selects the diagnostic message a vendored <see cref="ThrowHelper" /> overload attaches to the - /// exception it raises. - /// </summary> - /// <remarks> - /// Trimmed, like <see cref="ExceptionArgument" />, to the resources the vendored dictionary uses; - /// each member maps to the correspondingly named string on <see cref="SR" />. - /// </remarks> - internal enum ExceptionResource - { - /// <summary>The value supplied to a non-generic member cannot be assigned to <c>TValue</c>.</summary> - ConcurrentDictionary_TypeOfValueIncorrect, - - /// <summary>A <see cref="System.Collections.Generic.KeyValuePair{TKey,TValue}" /> was passed with a null key.</summary> - ConcurrentDictionary_ItemKeyIsNull, - } - - /// <summary> - /// The throw helpers the vendored <see cref="ConcurrentDictionary{TKey,TValue}" /> body calls - /// instead of throwing inline, so the hot paths that guard against bad arguments stay small enough - /// to inline (the JIT does not inline methods that contain a <c>throw</c>). - /// </summary> - /// <remarks> - /// Every method is annotated <see cref="DoesNotReturnAttribute" /> so the C# flow analysis in the - /// dictionary body treats a call as terminating; do not "fix" a caller by adding a redundant - /// <c>return</c> after one of these. - /// </remarks> - internal static class ThrowHelper - { - /// <summary>Throws an <see cref="ArgumentNullException" /> naming <paramref name="argument" />.</summary> - /// <param name="argument">The parameter that was null; its name becomes <see cref="ArgumentException.ParamName" />.</param> - /// <exception cref="ArgumentNullException">Always thrown.</exception> - [DoesNotReturn] - internal static void ThrowArgumentNullException(ExceptionArgument argument) => - throw new ArgumentNullException(GetArgumentName(argument)); - - /// <summary> - /// Throws an <see cref="ArgumentNullException" /> naming <paramref name="argument" /> with the - /// message selected by <paramref name="resource" /> (used for the null-key-inside-a-pair case). - /// </summary> - /// <param name="argument">The parameter that was null; its name becomes <see cref="ArgumentException.ParamName" />.</param> - /// <param name="resource">Selects the human-readable message attached to the exception.</param> - /// <exception cref="ArgumentNullException">Always thrown.</exception> - [DoesNotReturn] - internal static void ThrowArgumentNullException(ExceptionArgument argument, ExceptionResource resource) => - throw new ArgumentNullException(GetArgumentName(argument), GetResourceString(resource)); - - /// <summary>Throws an <see cref="ArgumentException" /> with the message selected by <paramref name="resource" />.</summary> - /// <param name="resource">Selects the human-readable message attached to the exception.</param> - /// <exception cref="ArgumentException">Always thrown.</exception> - [DoesNotReturn] - internal static void ThrowArgumentException(ExceptionResource resource) => - throw new ArgumentException(GetResourceString(resource)); - - /// <summary>Maps an <see cref="ExceptionArgument" /> to the C# parameter name it stands for.</summary> - /// <param name="argument">The argument identifier to translate.</param> - /// <returns>The parameter name, or the enum's textual form if an unmapped member is ever added.</returns> - private static string GetArgumentName(ExceptionArgument argument) => - argument switch - { - ExceptionArgument.key => "key", - ExceptionArgument.item => "item", - ExceptionArgument.valueFactory => "valueFactory", - ExceptionArgument.addValueFactory => "addValueFactory", - ExceptionArgument.updateValueFactory => "updateValueFactory", - _ => argument.ToString(), - }; - - /// <summary>Maps an <see cref="ExceptionResource" /> to its diagnostic message.</summary> - /// <param name="resource">The resource identifier to translate.</param> - /// <returns>The diagnostic message text.</returns> - private static string GetResourceString(ExceptionResource resource) => - resource switch - { - ExceptionResource.ConcurrentDictionary_TypeOfValueIncorrect => SR.ConcurrentDictionary_TypeOfValueIncorrect, - ExceptionResource.ConcurrentDictionary_ItemKeyIsNull => SR.ConcurrentDictionary_ItemKeyIsNull, - _ => resource.ToString(), - }; - } - - /// <summary>The exact BCL resource strings the vendored dictionary references.</summary> - /// <remarks> - /// Kept as literals (rather than a satellite resx) so the vendored code needs no build wiring; the - /// wording matches dotnet/runtime so exceptions read identically to the framework type. - /// </remarks> - internal static class SR - { - /// <summary>Reported when <c>concurrencyLevel</c> is neither positive nor the -1 sentinel.</summary> - internal const string ConcurrentDictionary_ConcurrencyLevelMustBePositiveOrNegativeOne = - "The concurrencyLevel argument must be positive or -1 to indicate the default value."; - - /// <summary>Reported when a seed collection contains two entries with equal keys.</summary> - internal const string ConcurrentDictionary_SourceContainsDuplicateKeys = - "The source argument contains duplicate keys."; - - /// <summary>Reported when a copy destination array cannot hold the dictionary starting at the given index.</summary> - internal const string ConcurrentDictionary_ArrayNotLargeEnough = - "The index is equal to or greater than the length of the array, or the number of elements in the dictionary is greater than the available space from index to the end of the destination array."; - - /// <summary>Reported by the <see cref="System.Collections.Generic.IDictionary{TKey,TValue}.Add" /> path when the key already exists.</summary> - internal const string ConcurrentDictionary_KeyAlreadyExisted = - "The key already existed in the dictionary."; - - /// <summary>Reported by the non-generic <see cref="System.Collections.IDictionary" /> members when a key is not assignable to <c>TKey</c>.</summary> - internal const string ConcurrentDictionary_TypeOfKeyIncorrect = - "The key was of an incorrect type for this dictionary."; - - /// <summary>Reported by the non-generic members when a value is not assignable to <c>TValue</c>.</summary> - internal const string ConcurrentDictionary_TypeOfValueIncorrect = - "The value was of an incorrect type for this dictionary."; - - /// <summary>Reported when a <see cref="System.Collections.Generic.KeyValuePair{TKey,TValue}" /> is supplied with a null key.</summary> - internal const string ConcurrentDictionary_ItemKeyIsNull = - "TKey is a reference type and item.Key is null."; - - /// <summary>Reported by <see cref="System.Collections.ICollection.CopyTo" /> when the destination array element type is unsupported.</summary> - internal const string ConcurrentDictionary_ArrayIncorrectType = - "The array is multidimensional, or the type parameter for the set cannot be cast automatically to the type of the destination array."; - - /// <summary>Reported by the unsupported <see cref="System.Collections.ICollection.SyncRoot" /> property.</summary> - internal const string ConcurrentCollection_SyncRoot_NotSupported = - "The SyncRoot property may not be used for the synchronization of concurrent collections."; - - /// <summary>Composite-format message used when a requested key is absent (formatted with the key text).</summary> - internal const string Arg_KeyNotFoundWithKey = - "The given key '{0}' was not present in the dictionary."; - - /// <summary>Reported when prime-capacity growth would overflow the supported array length.</summary> - internal const string Arg_HTCapacityOverflow = - "Hashtable's capacity overflowed and went negative. Check load factor, capacity and the current size of the table."; - - /// <summary>Substitutes <paramref name="p1" /> into a composite-format resource using the current culture.</summary> - /// <param name="resourceFormat">The composite-format string (for example <see cref="Arg_KeyNotFoundWithKey" />).</param> - /// <param name="p1">The single value substituted into the format.</param> - /// <returns>The formatted diagnostic text.</returns> - internal static string Format(string resourceFormat, object? p1) => - string.Format(resourceFormat, p1); - } - - /// <summary> - /// Prime-table and fast-modulo helpers used to size the dictionary's bucket array and to reduce a - /// hash code to a bucket without a hardware division on 64-bit. - /// </summary> - /// <remarks> - /// Verbatim from the BCL <c>System.Collections.HashHelpers</c>, trimmed to the members the vendored - /// dictionary uses. <see cref="FastMod" /> and <see cref="GetFastModMultiplier" /> are only valid on - /// 64-bit; the dictionary already branches on <see cref="IntPtr.Size" /> before calling them. - /// </remarks> - internal static class HashHelpers - { - /// <summary>The largest prime that is smaller than <see cref="Array.MaxLength" />.</summary> - public const int MaxPrimeArrayLength = 0x7FFFFFC3; - - /// <summary>A prime whose successor gap is avoided when synthesizing capacities beyond the table.</summary> - public const int HashPrime = 101; - - /// <summary>The increasing prime capacities the bucket array grows through before primes are computed on the fly.</summary> - internal static ReadOnlySpan<int> Primes => - [ - 3, 7, 11, 17, 23, 29, 37, 47, 59, 71, 89, 107, 131, 163, 197, 239, 293, 353, 431, 521, 631, 761, 919, - 1103, 1327, 1597, 1931, 2333, 2801, 3371, 4049, 4861, 5839, 7013, 8419, 10103, 12143, 14591, - 17519, 21023, 25229, 30293, 36353, 43627, 52361, 62851, 75431, 90523, 108631, 130363, 156437, - 187751, 225307, 270371, 324449, 389357, 467237, 560689, 672827, 807403, 968897, 1162687, 1395263, - 1674319, 2009191, 2411033, 2893249, 3471899, 4166287, 4999559, 5999471, 7199369 - ]; - - /// <summary>Determines whether <paramref name="candidate" /> is prime.</summary> - /// <param name="candidate">A non-negative candidate; callers only pass odd numbers or two.</param> - /// <returns><see langword="true" /> when <paramref name="candidate" /> is prime.</returns> - public static bool IsPrime(int candidate) - { - if ((candidate & 1) != 0) - { - int limit = (int)Math.Sqrt(candidate); - for (int divisor = 3; divisor <= limit; divisor += 2) - { - if (candidate % divisor == 0) - { - return false; - } - } - - return true; - } - - return candidate == 2; - } - - /// <summary>Returns the smallest table prime greater than or equal to <paramref name="min" />.</summary> - /// <param name="min">The minimum acceptable capacity.</param> - /// <returns>A prime capacity at least <paramref name="min" />.</returns> - /// <exception cref="ArgumentException"><paramref name="min" /> is negative (capacity overflow).</exception> - public static int GetPrime(int min) - { - if (min < 0) - { - throw new ArgumentException(SR.Arg_HTCapacityOverflow); - } - - foreach (int prime in Primes) - { - if (prime >= min) - { - return prime; - } - } - - // Outside of our predefined table. Compute the hard way. - for (int i = min | 1; i < int.MaxValue; i += 2) - { - if (IsPrime(i) && (i - 1) % HashPrime != 0) - { - return i; - } - } - - return min; - } - - /// <summary>Computes the reciprocal multiplier <c>ceil(2**64 / <paramref name="divisor" />)</c> for <see cref="FastMod" />.</summary> - /// <param name="divisor">The bucket count used as the modulus; must be positive.</param> - /// <returns>The precomputed multiplier for the divisor.</returns> - /// <remarks>64-bit only; the dictionary computes this once per <c>Tables</c> instance.</remarks> - public static ulong GetFastModMultiplier(uint divisor) => - ulong.MaxValue / divisor + 1; - - /// <summary>Reduces <paramref name="value" /> modulo <paramref name="divisor" /> using a multiply/shift instead of a division.</summary> - /// <param name="value">The unsigned hash to reduce.</param> - /// <param name="divisor">The bucket count; must equal the divisor passed to <see cref="GetFastModMultiplier" />.</param> - /// <param name="multiplier">The multiplier returned by <see cref="GetFastModMultiplier" /> for <paramref name="divisor" />.</param> - /// <returns>The remainder <c><paramref name="value" /> % <paramref name="divisor" /></c>.</returns> - /// <remarks>64-bit only. The debug assertion cross-checks the fast path against the true remainder.</remarks> - [MethodImpl(MethodImplOptions.AggressiveInlining)] - public static uint FastMod(uint value, uint divisor, ulong multiplier) - { - Debug.Assert(divisor <= int.MaxValue); - uint highbits = (uint)(((((multiplier * value) >> 32) + 1) * divisor) >> 32); - Debug.Assert(highbits == value % divisor); - return highbits; - } - } -} diff --git a/src/OptunaSharp.Core/Collections/Concurrent/ConcurrentOrderedDict.cs b/src/OptunaSharp.Core/Collections/Concurrent/ConcurrentOrderedDict.cs deleted file mode 100644 index c58fd4e..0000000 --- a/src/OptunaSharp.Core/Collections/Concurrent/ConcurrentOrderedDict.cs +++ /dev/null @@ -1,956 +0,0 @@ -#nullable enable - -using System; -using System.Collections; -using System.Collections.Generic; -using OptunaSharp.Collections.Concurrent; - -namespace OptunaSharp.Collections; - -// TODO(NumSharp 0.80.0): once NumSharp 0.80.0 is released, use its -// NumSharp.Collections.ConcurrentOrderedDictionary<TKey,TValue> instead of this type, which differs in name -// (…Dictionary, not …Dict). Bump $(NumSharpVersion) in Directory.Build.props, then delete this file. -// ConcurrentOrderedDictTests pins this copy's contract: point the tests that still apply at the NumSharp type -// and drop the rest. -/// <summary> -/// A thread-safe collection with <b>two access paths over one set of entries</b>: a dictionary path keyed -/// by <typeparamref name="TKey" /> (uniqueness, dedup and O(1) lookup) and a list path addressed by -/// insertion-order <c>int</c> index. Enumeration, <see cref="ToArray" /> and <see cref="Values" /> yield the -/// <typeparamref name="TValue" />s in index order, so the type reads like a <see cref="List{T}" /> of values -/// that also happens to be keyed. It is the concurrent counterpart of <see cref="OrderedDict{TKey,TValue}" />. -/// </summary> -/// <remarks> -/// <para> -/// <b>Why this exists.</b> OptunaSharp needs a concurrent, insertion-ordered, index-addressable map: -/// a <see cref="System.Collections.Concurrent.ConcurrentDictionary{TKey,TValue}" /> gives thread-safe -/// key access but no order and no positional access, while <see cref="OrderedDict{TKey,TValue}" /> gives -/// order but is not thread-safe. This type composes the two: the key path is a vendored clone of dotnet's -/// <see cref="Concurrent.ConcurrentDictionary{TKey,TValue}" /> (striped locks, lock-free reads); the list -/// path is an immutable, <b>contiguous</b> value/key snapshot published through a single volatile field. -/// </para> -/// <para> -/// <b>How the two paths are wired.</b> The key path maps each key to a stable <see cref="Entry" /> handle -/// that holds the value — so a key lookup is a single lock-free hop and never depends on the entry's -/// current position. The list path is a pair of contiguous arrays (values and keys, in order); enumeration, -/// <see cref="ToArray" />, <see cref="this[int]" /> and <see cref="CopyTo" /> scan them directly, which is -/// what keeps them close to <see cref="List{T}" />. A write updates both representations, so both paths -/// observe the same value. -/// </para> -/// <para> -/// <b>The <c>int</c>-key footgun.</b> Both <see cref="this[TKey]" /> and <see cref="this[int]" /> exist. -/// When <typeparamref name="TKey" /> is <c>int</c> they collide: the C# compiler binds <c>d[5]</c> to the -/// <i>index</i> indexer (the concrete <c>int</c> overload wins over the generic one), so the key path for -/// <c>int</c> keys must go through methods (<see cref="TryGetValue" />, <see cref="GetByKey" />, -/// <see cref="SetByKey" />). For every other key type the two brackets disambiguate by argument type. -/// </para> -/// <para> -/// <b>Performance.</b> Reads are lock-free: lookup by key, membership, <see cref="IndexOf" />, positional -/// get, <see cref="Count" />, enumeration and <see cref="ToArray" /> take no lock. Key lookups match or -/// beat <see cref="System.Collections.Concurrent.ConcurrentDictionary{TKey,TValue}" />; enumeration, -/// <see cref="ToArray" /> and index get scan a contiguous array and stay close to <see cref="List{T}" />. -/// Insertion is amortized O(1). <b>Writes are serialized</b> by a single lock (unlike the striped write -/// locks of the plain concurrent dictionary) because a global insertion order and the contiguous cache -/// cannot be maintained per-stripe; that is the deliberate cost of the ordering. The lock is held only -/// for the structural mutation and value swap itself — never while a user <c>valueFactory</c> or -/// <c>updateValueFactory</c> runs (those execute outside it, as in the framework dictionary). <b>Order-preserving -/// removal is O(n)</b> (like <see cref="List{T}.RemoveAt" />): it shifts the trailing values down to keep -/// indices contiguous. <b>Replacing the value of an existing key is O(1) when <typeparamref name="TValue" /> -/// is written atomically</b> (reference types and small primitives) and O(n) otherwise (a non-atomically -/// writable value type forces a fresh value array so lock-free readers never see a torn value). -/// </para> -/// <para> -/// <b>Memory.</b> Each value is held twice — once in its <see cref="Entry" /> (for the lock-free key path) -/// and once in the contiguous cache (for the List-like list path) — plus one small <see cref="Entry" /> -/// object per key. This denormalization is what buys both a consistent O(1) key path and contiguous -/// enumeration at once. -/// </para> -/// <para> -/// <b>Consistency.</b> A lock-free reader always sees valid, untorn values and never corrupts state. In the -/// absence of concurrent <i>writers</i> the key and list paths are exactly consistent. While a writer runs, -/// a reader may briefly observe a just-added element through one path a hair before the other, an -/// <see cref="IndexOf" /> off by concurrent removals, or (for atomically-written values) a value update in -/// one path before the other — snapshot semantics, in the spirit of the plain concurrent dictionary. An -/// enumerator captures the value array as it was when enumeration began. -/// </para> -/// <para> -/// <b>Internal, not public API.</b> No public OptunaSharp member takes or returns this type, and it is -/// built on the vendored, equally internal <see cref="Concurrent.ConcurrentDictionary{TKey,TValue}" />. -/// Exporting it would have frozen about 3,200 lines of collection code into the first release's -/// public API. Its contract stays pinned by <c>ConcurrentOrderedDictTests</c> through -/// <c>InternalsVisibleTo</c>. -/// </para> -/// </remarks> -/// <typeparam name="TKey">The non-null key type; uniqueness and lookups use the configured comparer.</typeparam> -/// <typeparam name="TValue">The value type stored per key and yielded, in index order, by enumeration.</typeparam> -internal sealed class ConcurrentOrderedDict<TKey, TValue> : IReadOnlyList<TValue> - where TKey : notnull -{ - /// <summary>The initial ordered-array capacity, and the size the arrays first grow to from empty.</summary> - /// <remarks>Deliberately small (unlike the key hashtable's prime capacity) because many ordered maps stay tiny.</remarks> - private const int DefaultCapacity = 4; - - /// <summary> - /// The stable, authoritative handle for the key path: it holds the value and the entry's current - /// insertion-order position, and its identity never changes while the key is present, so a key lookup - /// returns a consistent value without depending on where the entry currently sits. - /// </summary> - /// <remarks> - /// A reference type on purpose: swapping the whole <see cref="Entry" /> (an atomic reference write) is how a - /// value is replaced tear-free on the key path when <typeparamref name="TValue" /> cannot be written - /// atomically. <see cref="_value" /> is the source of truth for the key path; the list path keeps its own - /// contiguous copy (see <see cref="Store" />) that a write keeps in sync. - /// </remarks> - private sealed class Entry - { - /// <summary>The key this entry was added under; immutable for the entry's lifetime.</summary> - internal readonly TKey _key; - - /// <summary>The value on the key path. Mutated in place for atomically-writable value types; otherwise the whole entry is swapped.</summary> - internal TValue _value; - - /// <summary>The entry's current position in insertion order; rewritten under the write lock when removals shift it.</summary> - internal int _index; - - /// <summary>Creates an entry binding a key to a value at a position.</summary> - /// <param name="key">The entry's immutable key.</param> - /// <param name="value">The initial value.</param> - /// <param name="index">The entry's initial insertion-order position.</param> - internal Entry(TKey key, TValue value, int index) - { - _key = key; - _value = value; - _index = index; - } - } - - /// <summary> - /// An immutable snapshot of the list path: contiguous keys and values in insertion order plus the live - /// count. Published atomically through the single volatile <see cref="_store" /> field so a lock-free - /// reader gets a consistent (arrays, count) triple from one read, and can scan the values like a - /// <see cref="List{T}" />. - /// </summary> - /// <remarks> - /// Only <c>[0, <see cref="_count" />)</c> of each array is valid; the tail may hold spare capacity or stale - /// data and must never be read. The fields are <c>readonly</c> and set before the instance is published, so - /// the publication is safe without further barriers. - /// </remarks> - private sealed class Store - { - /// <summary>Keys in insertion order, occupying <c>[0, <see cref="_count" />)</c>. Parallel to <see cref="_values" />.</summary> - internal readonly TKey[] _keys; - - /// <summary>Values in insertion order, occupying <c>[0, <see cref="_count" />)</c>. The contiguous store that makes the list path fast.</summary> - internal readonly TValue[] _values; - - /// <summary>The number of live entries — the collection's <see cref="Count" /> when this snapshot was published.</summary> - internal readonly int _count; - - /// <summary>Wraps parallel key/value arrays and their live count into a publishable snapshot.</summary> - /// <param name="keys">The ordered keys (only the first <paramref name="count" /> slots are meaningful).</param> - /// <param name="values">The ordered values (only the first <paramref name="count" /> slots are meaningful).</param> - /// <param name="count">The number of live entries.</param> - internal Store(TKey[] keys, TValue[] values, int count) - { - _keys = keys; - _values = values; - _count = count; - } - - /// <summary>The shared empty snapshot used before the first insertion and after <see cref="Clear" />.</summary> - internal static readonly Store Empty = new(Array.Empty<TKey>(), Array.Empty<TValue>(), 0); - } - - /// <summary> - /// The key path: maps each key to its stable <see cref="Entry" />. A vendored clone of dotnet's thread-safe - /// dictionary, giving lock-free O(1) key reads and enforcing key uniqueness/dedup. - /// </summary> - private readonly ConcurrentDictionary<TKey, Entry> _byKey; - - /// <summary>The list path: the current contiguous ordered snapshot. Volatile so structural writes publish atomically to lock-free readers.</summary> - private volatile Store _store; - - /// <summary> - /// Serializes every mutation so the global insertion order, the contiguous cache and the key map stay - /// consistent. Reads never acquire it. - /// </summary> - private readonly object _writeLock = new(); - - /// <summary>Creates an empty collection using the default comparer for <typeparamref name="TKey" />.</summary> - public ConcurrentOrderedDict() : this((IEqualityComparer<TKey>?)null) - { - } - - /// <summary>Creates an empty collection using the supplied key comparer.</summary> - /// <param name="comparer">The comparer used for key uniqueness and lookups, or <see langword="null" /> for the default.</param> - public ConcurrentOrderedDict(IEqualityComparer<TKey>? comparer) - { - _byKey = new ConcurrentDictionary<TKey, Entry>(comparer); - _store = Store.Empty; - } - - /// <summary>Creates an empty collection with room reserved for <paramref name="capacity" /> entries.</summary> - /// <param name="capacity">The number of entries to pre-size both paths for; must be non-negative.</param> - /// <param name="comparer">The comparer used for key uniqueness and lookups, or <see langword="null" /> for the default.</param> - /// <exception cref="ArgumentOutOfRangeException"><paramref name="capacity" /> is negative.</exception> - public ConcurrentOrderedDict(int capacity, IEqualityComparer<TKey>? comparer = null) - { - if (capacity < 0) - { - throw new ArgumentOutOfRangeException(nameof(capacity)); - } - - // Match the key hashtable's initial capacity to the request, and pre-size the ordered arrays so the first - // several inserts don't reallocate. - _byKey = new ConcurrentDictionary<TKey, Entry>(Environment.ProcessorCount, capacity, comparer); - _store = capacity == 0 ? Store.Empty : new Store(new TKey[capacity], new TValue[capacity], 0); - } - - /// <summary> - /// Creates a collection populated from <paramref name="source" /> in enumeration order, with Python - /// <c>dict(pairs)</c> duplicate semantics (last value wins, first-occurrence position) — matching - /// <see cref="OrderedDict{TKey,TValue}" />, not the throw-on-duplicate behavior of the framework dictionary. - /// </summary> - /// <param name="source">The key/value pairs to copy; repeated keys replace the value without moving the key.</param> - /// <param name="comparer">The comparer used for key uniqueness and lookups, or <see langword="null" /> for the default.</param> - /// <exception cref="ArgumentNullException"><paramref name="source" /> is <see langword="null" />.</exception> - public ConcurrentOrderedDict(IEnumerable<KeyValuePair<TKey, TValue>> source, IEqualityComparer<TKey>? comparer = null) - : this(comparer) - { - if (source is null) - { - throw new ArgumentNullException(nameof(source)); - } - - foreach (var kv in source) - { - SetByKey(kv.Key, kv.Value); - } - } - - /// <summary>Gets the number of entries — a moment-in-time snapshot, consistent with lock-free enumeration.</summary> - public int Count => _store._count; - - /// <summary>Gets whether the collection currently has no entries.</summary> - public bool IsEmpty => _store._count == 0; - - /// <summary>Gets the comparer used to determine key equality and hashing.</summary> - public IEqualityComparer<TKey> Comparer => _byKey.Comparer; - - // --------------------------------------------------------------------------------------------------------- - // Key path (dictionary semantics). For int keys, reach these through the named methods, not the indexer. - // --------------------------------------------------------------------------------------------------------- - - /// <summary> - /// Gets or sets the value for <paramref name="key" />. Get throws if the key is absent; set updates the - /// value in place when the key exists, otherwise appends a new entry at the end of insertion order. - /// </summary> - /// <param name="key">The key to read or write.</param> - /// <value>The value associated with <paramref name="key" />.</value> - /// <returns>The value associated with <paramref name="key" /> (get accessor).</returns> - /// <remarks>When <typeparamref name="TKey" /> is <c>int</c> this indexer is shadowed by <see cref="this[int]" />; use <see cref="GetByKey" />/<see cref="SetByKey" /> instead.</remarks> - /// <exception cref="ArgumentNullException"><paramref name="key" /> is <see langword="null" />.</exception> - /// <exception cref="KeyNotFoundException">The get accessor is used and <paramref name="key" /> is absent.</exception> - public TValue this[TKey key] - { - get => GetByKey(key); - set => SetByKey(key, value); - } - - /// <summary>Reads the value for <paramref name="key" />, throwing if absent — the method form of the key getter (use this for <c>int</c> keys). Lock-free and O(1).</summary> - /// <param name="key">The key to look up.</param> - /// <returns>The value associated with <paramref name="key" />.</returns> - /// <exception cref="ArgumentNullException"><paramref name="key" /> is <see langword="null" />.</exception> - /// <exception cref="KeyNotFoundException"><paramref name="key" /> is absent.</exception> - public TValue GetByKey(TKey key) - { - if (!TryGetValue(key, out var value)) - { - throw new KeyNotFoundException(Concurrent.SR.Format(Concurrent.SR.Arg_KeyNotFoundWithKey, key.ToString())); - } - - return value; - } - - /// <summary> - /// Upserts <paramref name="key" />: updates its value if present (keeping its position), otherwise appends - /// a new entry — the method form of the key setter (use this for <c>int</c> keys). Serialized with other writes. - /// </summary> - /// <param name="key">The key to write.</param> - /// <param name="value">The value to store.</param> - /// <exception cref="ArgumentNullException"><paramref name="key" /> is <see langword="null" />.</exception> - public void SetByKey(TKey key, TValue value) - { - NullCheck(key); - - lock (_writeLock) - { - if (_byKey.TryGetValue(key, out var e)) - { - ReplaceExistingUnderLock(e, value); - } - else - { - AppendUnderLock(key, value); - } - } - } - - /// <summary>Determines whether <paramref name="key" /> is present. Lock-free and O(1).</summary> - /// <param name="key">The key to test.</param> - /// <returns><see langword="true" /> if the key exists; otherwise <see langword="false" />.</returns> - /// <exception cref="ArgumentNullException"><paramref name="key" /> is <see langword="null" />.</exception> - public bool ContainsKey(TKey key) => _byKey.ContainsKey(key); - - /// <summary>Attempts to read the value for <paramref name="key" /> without throwing. Lock-free and O(1).</summary> - /// <param name="key">The key to look up.</param> - /// <param name="value">On success, the associated value; otherwise the default of <typeparamref name="TValue" />.</param> - /// <returns><see langword="true" /> if the key was found; otherwise <see langword="false" />.</returns> - /// <exception cref="ArgumentNullException"><paramref name="key" /> is <see langword="null" />.</exception> - public bool TryGetValue(TKey key, out TValue value) - { - if (_byKey.TryGetValue(key, out var e)) - { - value = e._value; - return true; - } - - value = default!; - return false; - } - - /// <summary>Adds <paramref name="key" />/<paramref name="value" /> only if the key is absent, appending it at the end of order.</summary> - /// <param name="key">The key to add.</param> - /// <param name="value">The value to add.</param> - /// <returns><see langword="true" /> if the entry was added; <see langword="false" /> if the key already existed.</returns> - /// <exception cref="ArgumentNullException"><paramref name="key" /> is <see langword="null" />.</exception> - public bool TryAdd(TKey key, TValue value) - { - NullCheck(key); - - if (_byKey.ContainsKey(key)) - { - return false; // lock-free fast negative - } - - lock (_writeLock) - { - if (_byKey.ContainsKey(key)) - { - return false; // another thread won the race while we waited for the lock - } - - AppendUnderLock(key, value); - return true; - } - } - - /// <summary>Adds <paramref name="key" />/<paramref name="value" />, throwing if the key already exists.</summary> - /// <param name="key">The key to add.</param> - /// <param name="value">The value to add.</param> - /// <exception cref="ArgumentNullException"><paramref name="key" /> is <see langword="null" />.</exception> - /// <exception cref="ArgumentException">An entry with the same key already exists.</exception> - public void Add(TKey key, TValue value) - { - if (!TryAdd(key, value)) - { - throw new ArgumentException(Concurrent.SR.ConcurrentDictionary_KeyAlreadyExisted, nameof(key)); - } - } - - /// <summary>Returns the existing value for <paramref name="key" />, or appends and returns <paramref name="value" /> if absent.</summary> - /// <param name="key">The key to read or add.</param> - /// <param name="value">The value to append if the key is absent.</param> - /// <returns>The existing value, or the newly added <paramref name="value" />.</returns> - /// <exception cref="ArgumentNullException"><paramref name="key" /> is <see langword="null" />.</exception> - public TValue GetOrAdd(TKey key, TValue value) - { - NullCheck(key); - - if (_byKey.TryGetValue(key, out var e)) - { - return e._value; - } - - lock (_writeLock) - { - if (_byKey.TryGetValue(key, out e)) - { - return e._value; - } - - AppendUnderLock(key, value); - return value; - } - } - - /// <summary>Returns the existing value for <paramref name="key" />, or appends the result of <paramref name="valueFactory" /> if absent.</summary> - /// <param name="key">The key to read or add.</param> - /// <param name="valueFactory">Invoked with the key to produce the value when the key is absent. Runs <b>outside</b> the write lock (writers are never blocked on it); under contention it may be called on more than one thread, like the framework concurrent dictionary, with the losing result discarded.</param> - /// <returns>The existing value, or the newly produced and added value.</returns> - /// <exception cref="ArgumentNullException"><paramref name="key" /> or <paramref name="valueFactory" /> is <see langword="null" />.</exception> - public TValue GetOrAdd(TKey key, Func<TKey, TValue> valueFactory) - { - NullCheck(key); - if (valueFactory is null) - { - throw new ArgumentNullException(nameof(valueFactory)); - } - - if (_byKey.TryGetValue(key, out var e)) - { - return e._value; - } - - // Run the factory OUTSIDE the lock so writers are never blocked on user code. As in the framework - // dictionary, under contention the factory may run on several threads; only one result is kept. - TValue value = valueFactory(key); - - lock (_writeLock) - { - if (_byKey.TryGetValue(key, out e)) - { - return e._value; // lost the race for this key; discard the value we computed - } - - AppendUnderLock(key, value); - return value; - } - } - - /// <summary>Appends <paramref name="addValue" /> if the key is absent, otherwise replaces the value via <paramref name="updateValueFactory" />.</summary> - /// <param name="key">The key to add or update.</param> - /// <param name="addValue">The value to append if the key is absent.</param> - /// <param name="updateValueFactory">Invoked with the key and current value to produce the replacement. Runs <b>outside</b> the write lock (writers are never blocked on it); the result is applied with a compare-and-swap and, like the framework concurrent dictionary, the factory may run more than once under contention.</param> - /// <returns>The value now stored for the key (the added or the updated value).</returns> - /// <exception cref="ArgumentNullException"><paramref name="key" /> or <paramref name="updateValueFactory" /> is <see langword="null" />.</exception> - public TValue AddOrUpdate(TKey key, TValue addValue, Func<TKey, TValue, TValue> updateValueFactory) - { - NullCheck(key); - if (updateValueFactory is null) - { - throw new ArgumentNullException(nameof(updateValueFactory)); - } - - // Match the framework dictionary: the factory runs OUTSIDE the lock (writers are never blocked on user - // code), and the update is applied with a compare-and-swap, retried if the value moved under us. The - // lock is entered only to append an absent key or (via TryUpdate) to perform the swap itself. - while (true) - { - if (_byKey.TryGetValue(key, out var e)) - { - TValue old = e._value; - TValue updated = updateValueFactory(key, old); - if (TryUpdate(key, updated, old)) - { - return updated; - } - - continue; // the value changed, or the key was removed, before our swap; recompute and retry - } - - lock (_writeLock) - { - if (!_byKey.ContainsKey(key)) - { - AppendUnderLock(key, addValue); - return addValue; - } - } - - // The key was added concurrently; loop back and take the update path. - } - } - - /// <summary>Replaces the value for <paramref name="key" /> only if its current value equals <paramref name="comparisonValue" />.</summary> - /// <param name="key">The key whose value is conditionally replaced.</param> - /// <param name="newValue">The replacement value.</param> - /// <param name="comparisonValue">The value the current value must equal (by the default value comparer) for the update to occur.</param> - /// <returns><see langword="true" /> if the value was replaced; otherwise <see langword="false" />.</returns> - /// <exception cref="ArgumentNullException"><paramref name="key" /> is <see langword="null" />.</exception> - public bool TryUpdate(TKey key, TValue newValue, TValue comparisonValue) - { - NullCheck(key); - - lock (_writeLock) - { - if (_byKey.TryGetValue(key, out var e) && - EqualityComparer<TValue>.Default.Equals(e._value, comparisonValue)) - { - ReplaceExistingUnderLock(e, newValue); - return true; - } - - return false; - } - } - - /// <summary> - /// Removes <paramref name="key" /> and its value, shifting later entries down to keep indices contiguous. - /// <b>O(n)</b> in the number of entries after the removed one. - /// </summary> - /// <param name="key">The key to remove.</param> - /// <param name="value">On success, the removed value; otherwise the default of <typeparamref name="TValue" />.</param> - /// <returns><see langword="true" /> if an entry was removed; otherwise <see langword="false" />.</returns> - /// <exception cref="ArgumentNullException"><paramref name="key" /> is <see langword="null" />.</exception> - public bool TryRemove(TKey key, out TValue value) - { - NullCheck(key); - - if (!_byKey.ContainsKey(key)) - { - value = default!; - return false; // lock-free fast negative - } - - lock (_writeLock) - { - if (!_byKey.TryGetValue(key, out var e)) - { - value = default!; - return false; - } - - value = e._value; - RemoveCoreUnderLock(e); - return true; - } - } - - /// <summary>Removes <paramref name="key" /> if present. Convenience wrapper over <see cref="TryRemove" />; O(n) like it.</summary> - /// <param name="key">The key to remove.</param> - /// <returns><see langword="true" /> if an entry was removed; otherwise <see langword="false" />.</returns> - /// <exception cref="ArgumentNullException"><paramref name="key" /> is <see langword="null" />.</exception> - public bool Remove(TKey key) => TryRemove(key, out _); - - // --------------------------------------------------------------------------------------------------------- - // List path (index semantics). Enumeration and ToArray are here too, yielding values in index order. - // --------------------------------------------------------------------------------------------------------- - - /// <summary> - /// Gets or sets the value at insertion-order position <paramref name="index" />. The setter takes a - /// <typeparamref name="TValue" /> and replaces the value at that position, leaving its key and position - /// unchanged (it never inserts). This indexer wins over <see cref="this[TKey]" /> when <typeparamref name="TKey" /> is <c>int</c>. - /// </summary> - /// <param name="index">The zero-based position in insertion order.</param> - /// <value>The value at <paramref name="index" />.</value> - /// <returns>The value stored at insertion-order position <paramref name="index" /> (get accessor).</returns> - /// <exception cref="ArgumentOutOfRangeException"><paramref name="index" /> is negative or not less than <see cref="Count" />.</exception> - public TValue this[int index] - { - get - { - Store s = _store; - if ((uint)index >= (uint)s._count) - { - throw new ArgumentOutOfRangeException(nameof(index)); - } - - return s._values[index]; - } - set => SetAt(index, value); - } - - /// <summary>Replaces the value at position <paramref name="index" /> without changing its key or position. Serialized with other writes.</summary> - /// <param name="index">The zero-based position in insertion order.</param> - /// <param name="value">The replacement value.</param> - /// <exception cref="ArgumentOutOfRangeException"><paramref name="index" /> is negative or not less than <see cref="Count" />.</exception> - public void SetAt(int index, TValue value) - { - lock (_writeLock) - { - Store s = _store; - if ((uint)index >= (uint)s._count) - { - throw new ArgumentOutOfRangeException(nameof(index)); - } - - TKey key = s._keys[index]; - _byKey.TryGetValue(key, out var e); // e is non-null under the lock; the key path holds this position - - if (ConcurrentDictionaryTypeProps<TValue>.IsWriteAtomic) - { - // In-place atomic writes; lock-free readers see the old or new value, never a torn one. - s._values[index] = value; - if (e is not null) - { - e._value = value; - } - } - else - { - // Non-atomic value: swap the key-path entry and publish a fresh value array so no reader tears. - if (e is not null) - { - _byKey[key] = new Entry(key, value, index); - } - - var values = (TValue[])s._values.Clone(); - values[index] = value; - _store = new Store(s._keys, values, s._count); - } - } - } - - /// <summary>Attempts to read the value at position <paramref name="index" /> without throwing. Lock-free and O(1).</summary> - /// <param name="index">The zero-based position in insertion order.</param> - /// <param name="value">On success, the value at the position; otherwise the default of <typeparamref name="TValue" />.</param> - /// <returns><see langword="true" /> if <paramref name="index" /> is in range; otherwise <see langword="false" />.</returns> - public bool TryGetAt(int index, out TValue value) - { - Store s = _store; - if ((uint)index >= (uint)s._count) - { - value = default!; - return false; - } - - value = s._values[index]; - return true; - } - - /// <summary>Returns the key at position <paramref name="index" /> in insertion order. Lock-free and O(1).</summary> - /// <param name="index">The zero-based position in insertion order.</param> - /// <returns>The key stored at that position.</returns> - /// <exception cref="ArgumentOutOfRangeException"><paramref name="index" /> is negative or not less than <see cref="Count" />.</exception> - public TKey GetKeyAt(int index) - { - Store s = _store; - if ((uint)index >= (uint)s._count) - { - throw new ArgumentOutOfRangeException(nameof(index)); - } - - return s._keys[index]; - } - - /// <summary> - /// Returns the insertion-order position of <paramref name="key" />, or -1 if absent — the "TKey to index" - /// mapping. Lock-free and O(1). - /// </summary> - /// <param name="key">The key to locate.</param> - /// <returns>The zero-based index of the key, or -1 if it is not present.</returns> - /// <remarks>Under a concurrent structural writer the returned index is a snapshot and may be stale by the number of concurrent removals.</remarks> - /// <exception cref="ArgumentNullException"><paramref name="key" /> is <see langword="null" />.</exception> - public int IndexOf(TKey key) => _byKey.TryGetValue(key, out var e) ? e._index : -1; - - /// <summary>Attempts to map <paramref name="key" /> to its insertion-order position without allocating a sentinel.</summary> - /// <param name="key">The key to locate.</param> - /// <param name="index">On success, the key's index; otherwise -1.</param> - /// <returns><see langword="true" /> if the key was found; otherwise <see langword="false" />.</returns> - /// <exception cref="ArgumentNullException"><paramref name="key" /> is <see langword="null" />.</exception> - public bool TryGetIndex(TKey key, out int index) - { - if (_byKey.TryGetValue(key, out var e)) - { - index = e._index; - return true; - } - - index = -1; - return false; - } - - /// <summary>Removes the entry at position <paramref name="index" />, shifting later entries down. <b>O(n).</b></summary> - /// <param name="index">The zero-based position in insertion order to remove.</param> - /// <exception cref="ArgumentOutOfRangeException"><paramref name="index" /> is negative or not less than <see cref="Count" />.</exception> - public void RemoveAt(int index) - { - lock (_writeLock) - { - Store s = _store; - if ((uint)index >= (uint)s._count) - { - throw new ArgumentOutOfRangeException(nameof(index)); - } - - if (_byKey.TryGetValue(s._keys[index], out var e)) - { - RemoveCoreUnderLock(e); - } - } - } - - /// <summary>Removes all entries and resets both paths to empty.</summary> - public void Clear() - { - lock (_writeLock) - { - _byKey.Clear(); - _store = Store.Empty; - } - } - - /// <summary> - /// Copies the values, in index order, into a new array — the same content and order as enumeration, close - /// to <see cref="List{T}.ToArray" /> in cost (a contiguous block copy). - /// </summary> - /// <returns>A new array of the values in insertion order (a point-in-time snapshot).</returns> - public TValue[] ToArray() - { - Store s = _store; - int n = s._count; - if (n == 0) - { - return Array.Empty<TValue>(); - } - - var array = new TValue[n]; - Array.Copy(s._values, array, n); - return array; - } - - /// <summary>Copies the values, in index order, into <paramref name="array" /> starting at <paramref name="arrayIndex" /> (a contiguous block copy).</summary> - /// <param name="array">The destination array.</param> - /// <param name="arrayIndex">The zero-based position in <paramref name="array" /> at which to start writing.</param> - /// <exception cref="ArgumentNullException"><paramref name="array" /> is <see langword="null" />.</exception> - /// <exception cref="ArgumentOutOfRangeException"><paramref name="arrayIndex" /> is negative.</exception> - /// <exception cref="ArgumentException"><paramref name="array" /> has too little room from <paramref name="arrayIndex" />.</exception> - public void CopyTo(TValue[] array, int arrayIndex) - { - if (array is null) - { - throw new ArgumentNullException(nameof(array)); - } - - if (arrayIndex < 0) - { - throw new ArgumentOutOfRangeException(nameof(arrayIndex)); - } - - Store s = _store; - int n = s._count; - if (array.Length - arrayIndex < n) - { - throw new ArgumentException(Concurrent.SR.ConcurrentDictionary_ArrayNotLargeEnough, nameof(array)); - } - - Array.Copy(s._values, 0, array, arrayIndex, n); - } - - /// <summary> - /// Gets a point-in-time array of the keys in insertion order (a contiguous block copy). A fresh array each - /// call (snapshot semantics), parallel to <see cref="Values" />. - /// </summary> - public TKey[] Keys - { - get - { - Store s = _store; - int n = s._count; - if (n == 0) - { - return Array.Empty<TKey>(); - } - - var keys = new TKey[n]; - Array.Copy(s._keys, keys, n); - return keys; - } - } - - /// <summary>Gets a point-in-time array of the values in insertion order (equivalent to <see cref="ToArray" />).</summary> - public TValue[] Values => ToArray(); - - /// <summary> - /// Enumerates the entries as key/value pairs in insertion order — the dictionary-shaped view, for when the - /// value-only default enumeration is not enough. A snapshot is taken when enumeration begins. - /// </summary> - public IEnumerable<KeyValuePair<TKey, TValue>> Pairs - { - get - { - Store s = _store; - TKey[] keys = s._keys; - TValue[] values = s._values; - int n = s._count; - for (int i = 0; i < n; i++) - { - yield return new KeyValuePair<TKey, TValue>(keys[i], values[i]); - } - } - } - - /// <summary>Returns an allocation-free enumerator over the values in insertion order (snapshotted at this call).</summary> - /// <returns>A struct enumerator; each iteration yields the next value in index order.</returns> - public Enumerator GetEnumerator() => new(this); - - /// <inheritdoc /> - IEnumerator<TValue> IEnumerable<TValue>.GetEnumerator() => GetEnumerator(); - - /// <inheritdoc /> - IEnumerator IEnumerable.GetEnumerator() => GetEnumerator(); - - /// <summary> - /// A forward, value-order enumerator bound to the contiguous value array captured when it was created; it - /// scans that array like a <see cref="List{T}" /> enumerator, observes a stable count, and never throws for - /// concurrent modification. - /// </summary> - public struct Enumerator : IEnumerator<TValue> - { - private readonly TValue[] _values; - private readonly int _count; - private int _i; - private TValue _current; - - /// <summary>Binds the enumerator to a snapshot of the owner's current ordered store.</summary> - /// <param name="owner">The collection to snapshot and enumerate.</param> - internal Enumerator(ConcurrentOrderedDict<TKey, TValue> owner) - { - Store store = owner._store; - _values = store._values; - _count = store._count; - _i = -1; - _current = default!; - } - - /// <summary>Gets the value at the enumerator's current position.</summary> - public TValue Current => _current; - - /// <inheritdoc /> - object? IEnumerator.Current => _current; - - /// <summary>Advances to the next value in index order.</summary> - /// <returns><see langword="true" /> if a value is now current; <see langword="false" /> once the snapshot is exhausted.</returns> - public bool MoveNext() - { - int next = _i + 1; - if (next < _count) - { - _current = _values[next]; - _i = next; - return true; - } - - _current = default!; - return false; - } - - /// <summary>Resets the enumerator to before the first value of its snapshot.</summary> - public void Reset() - { - _i = -1; - _current = default!; - } - - /// <summary>No-op; the enumerator holds no unmanaged resources.</summary> - public void Dispose() - { - } - } - - // --------------------------------------------------------------------------------------------------------- - // Private write helpers. All callers hold _writeLock. - // --------------------------------------------------------------------------------------------------------- - - /// <summary> - /// Appends a brand-new entry (caller has verified the key is absent) at the end of insertion order, growing - /// the ordered arrays by doubling when full, then publishing the new snapshot. Amortized O(1). - /// </summary> - /// <param name="key">The absent key to add.</param> - /// <param name="value">The value to store.</param> - /// <remarks>The caller must hold <see cref="_writeLock" />.</remarks> - private void AppendUnderLock(TKey key, TValue value) - { - Store s = _store; - int idx = s._count; - TKey[] keys = s._keys; - TValue[] values = s._values; - - if (idx == values.Length) - { - // Grow by doubling. Old readers keep the old arrays; only new readers (after publication) see the new ones. - int newCap = values.Length == 0 ? DefaultCapacity : values.Length * 2; - var grownKeys = new TKey[newCap]; - var grownValues = new TValue[newCap]; - Array.Copy(keys, grownKeys, idx); - Array.Copy(values, grownValues, idx); - keys = grownKeys; - values = grownValues; - } - - keys[idx] = key; - values[idx] = value; // written before publication; old snapshots never read slot idx (their count is idx) - - // Make the key findable (its value is already valid via the entry), then publish the ordered snapshot. - _byKey[key] = new Entry(key, value, idx); - _store = new Store(keys, values, idx + 1); - } - - /// <summary> - /// Replaces the value of an entry that is already present, on both paths. Writes in place for - /// atomically-writable values (O(1)); otherwise swaps the key-path entry and publishes a fresh value array - /// so lock-free readers never see a torn value (O(n)). - /// </summary> - /// <param name="e">The existing entry to update.</param> - /// <param name="value">The replacement value.</param> - /// <remarks>The caller must hold <see cref="_writeLock" />.</remarks> - private void ReplaceExistingUnderLock(Entry e, TValue value) - { - Store s = _store; - int idx = e._index; - - if (ConcurrentDictionaryTypeProps<TValue>.IsWriteAtomic) - { - e._value = value; - if ((uint)idx < (uint)s._count) - { - s._values[idx] = value; - } - - return; - } - - _byKey[e._key] = new Entry(e._key, value, idx); - if ((uint)idx < (uint)s._count) - { - var values = (TValue[])s._values.Clone(); - values[idx] = value; - _store = new Store(s._keys, values, s._count); - } - } - - /// <summary> - /// Removes <paramref name="e" /> from both paths, shifting the entries after it down by one (and fixing the - /// recorded positions of the shifted entries) into fresh arrays, then publishing the new snapshot. O(n) in - /// the tail length. - /// </summary> - /// <param name="e">The entry to remove (located via key or index by the caller).</param> - /// <remarks>The caller must hold <see cref="_writeLock" />.</remarks> - private void RemoveCoreUnderLock(Entry e) - { - Store s = _store; - int n = s._count; - int idx = e._index; - - // Fresh arrays so concurrent readers of the old snapshot are undisturbed by the shift. - var keys = new TKey[s._keys.Length]; - var values = new TValue[s._values.Length]; - Array.Copy(s._keys, keys, idx); // keep [0, idx) - Array.Copy(s._keys, idx + 1, keys, idx, n - idx - 1); // shift (idx, n) down - Array.Copy(s._values, values, idx); - Array.Copy(s._values, idx + 1, values, idx, n - idx - 1); - - // Repair the recorded positions of the shifted entries so IndexOf stays correct. - for (int i = idx; i < n - 1; i++) - { - if (_byKey.TryGetValue(keys[i], out var shifted)) - { - shifted._index = i; - } - } - - _byKey.TryRemove(e._key, out _); - _store = new Store(keys, values, n - 1); - } - - /// <summary>Throws <see cref="ArgumentNullException" /> if <paramref name="key" /> is null (guards the reference-key case).</summary> - /// <param name="key">The key to validate.</param> - /// <exception cref="ArgumentNullException"><paramref name="key" /> is <see langword="null" />.</exception> - private static void NullCheck(TKey key) - { - if (key is null) - { - throw new ArgumentNullException(nameof(key)); - } - } -} diff --git a/src/OptunaSharp.Core/ComponentLosses.cs b/src/OptunaSharp.Core/ComponentLosses.cs index 3d996c7..fc73287 100644 --- a/src/OptunaSharp.Core/ComponentLosses.cs +++ b/src/OptunaSharp.Core/ComponentLosses.cs @@ -91,7 +91,7 @@ public static bool TryRead(IReadOnlyDictionary<string, object?> userAttrs, out d /// <summary> /// Validate a to-be-written component vector against the channel contract and return an owned - /// copy suitable for <see cref="BaseTrial.SetUserAttr" />. Rejects an empty vector and any + /// copy suitable for <see cref="BaseTrial.SetUserAttr(string, object?)" />. Rejects an empty vector and any /// non-finite entry (so a stored vector always reads back — a non-finite one never silently /// becomes "absent"). Negative entries are accepted (read at their zero clamp downstream). /// </summary> diff --git a/src/OptunaSharp.Core/Distributions/Distribution.cs b/src/OptunaSharp.Core/Distributions/Distribution.cs index 7c465c6..c71f9e9 100644 --- a/src/OptunaSharp.Core/Distributions/Distribution.cs +++ b/src/OptunaSharp.Core/Distributions/Distribution.cs @@ -161,6 +161,46 @@ public static void CheckDistributionCompatibility(BaseDistribution distOld, Base throw new ValueError(nameof(CategoricalDistribution) + " does not support dynamic value space."); } + /// <summary> + /// Whether two distributions are interchangeable to the bit: the same runtime type and every field identical, + /// doubles compared by their bits. Stricter than <see cref="BaseDistribution.Equals(object?)" /> on purpose, so a + /// storage may keep one shared instance for both without any observable difference (Rustuna plan 13, item S7). + /// </summary> + /// <param name="a">One distribution.</param> + /// <param name="b">The other.</param> + /// <returns> + /// True for the same instance, or for float or integer distributions of the same type whose bounds, step and log + /// flag match exactly. False otherwise, including every categorical pair: equal categoricals may hold different + /// choice objects (Python equality makes 1 and 1.0 equal), and swapping one for the other would change the + /// values a trial reports. + /// </returns> + /// <remarks> + /// Why bitwise: <c>Equals</c> treats -0.0 and 0.0 as one bound, and the repr of a distribution prints them + /// differently. The runtime-type check keeps the deprecated <c>UniformDistribution</c> family, which derives from + /// <see cref="FloatDistribution" />, from being swapped for a plain one. + /// </remarks> + internal static bool IsBitwiseIdentical(BaseDistribution a, BaseDistribution b) + { + if (ReferenceEquals(a, b)) + return true; + if (a.GetType() != b.GetType()) + return false; + return (a, b) switch + { + (FloatDistribution fa, FloatDistribution fb) => + BitConverter.DoubleToInt64Bits(fa.Low) == BitConverter.DoubleToInt64Bits(fb.Low) + && BitConverter.DoubleToInt64Bits(fa.High) == BitConverter.DoubleToInt64Bits(fb.High) + && fa.Log == fb.Log + && (fa.Step is null + ? fb.Step is null + : fb.Step is not null + && BitConverter.DoubleToInt64Bits(fa.Step.Value) == BitConverter.DoubleToInt64Bits(fb.Step.Value)), + (IntDistribution ia, IntDistribution ib) => + ia.Low == ib.Low && ia.High == ib.High && ia.Step == ib.Step && ia.Log == ib.Log, + _ => false, + }; + } + /// <summary>Python <c>_get_single_value(distribution)</c>.</summary> /// <param name="distribution">Distribution defining the parameter representation and allowed values.</param> /// <returns>The numeric lower endpoint or the sole categorical value.</returns> diff --git a/src/OptunaSharp.Core/Distributions/FloatDistribution.cs b/src/OptunaSharp.Core/Distributions/FloatDistribution.cs index 289c9ff..206a5cc 100644 --- a/src/OptunaSharp.Core/Distributions/FloatDistribution.cs +++ b/src/OptunaSharp.Core/Distributions/FloatDistribution.cs @@ -13,9 +13,29 @@ namespace OptunaSharp.Distributions; /// passed to samplers in general. /// </summary> /// <remarks> -/// When <c>step</c> is not <c>null</c>, if the range <c>[low, high]</c> is not divisible by -/// <c>step</c>, <c>high</c> will be replaced with the maximum of -/// <c>k * step + low < high</c>, where <c>k</c> is an integer. +/// <para> +/// When <c>step</c> is not <c>null</c>, if the range <c>[low, high]</c> is not divisible by +/// <c>step</c>, <c>high</c> will be replaced with the maximum of +/// <c>k * step + low < high</c>, where <c>k</c> is an integer. +/// </para> +/// <para> +/// <b>Tiny magnitudes round differently from Optuna (a kept difference).</b> Optuna does this arithmetic with +/// Python's <c>Decimal</c> (28 <i>significant</i> digits, unbounded exponent); OptunaSharp uses .NET +/// <c>decimal</c>, which keeps 28 digits <i>after the point</i> and reads anything below <c>1e-28</c> as zero. +/// The owner chose on 2026-11-12 to keep it (QA-3 / QA-62 of the parity QA journals). Ordinary ranges are +/// unaffected; three kinds of input differ: +/// </para> +/// <list type="bullet"> +/// <item>a bound or step whose shortest repr needs more than 28 decimal places (a 17-digit value below about +/// <c>1e-11</c>) can leave <c>high</c> one ULP from Optuna's, and BruteForce's grid one point longer +/// (<c>FloatDistribution(4.1271208719049127e-14, 4.085121318968367e-13, step: 1e-15)</c>: +/// <c>4.082712087190491e-13</c>, Optuna <c>4.0827120871904913e-13</c>);</item> +/// <item>a bound below <c>1e-28</c> counts as zero, so <c>(5e-324, 0.30000000000000004, step: 1.0)</c> ends at +/// <c>0.0</c>, below its <c>low</c> (Optuna: <c>5e-324</c>);</item> +/// <item>a range whose step count needs more than 28 digits (<c>(0, 1e20, step: 1e-09)</c>) is accepted, where +/// Optuna raises <c>decimal.InvalidOperation</c>; a NaN or infinite bound or step throws +/// <see cref="FormatException" />, where Optuna gives <c>high=nan</c> or <c>InvalidOperation</c>.</item> +/// </list> /// </remarks> public class FloatDistribution : BaseDistribution { @@ -151,7 +171,11 @@ public override bool Equals(BaseDistribution? other) /// <returns>Hash code consistent with distribution equality.</returns> public override int GetHashCode() => HashCode.Combine(GetType(), Step, Low, High, Log); - /// <summary>Python <c>_adjust_discrete_uniform_high</c> (exact Decimal arithmetic on the shortest reprs).</summary> + /// <summary> + /// Python <c>_adjust_discrete_uniform_high</c> on the shortest reprs, in .NET <c>decimal</c> where Python uses + /// <c>Decimal</c>: identical for ordinary ranges, different for the tiny magnitudes the class remarks list (a + /// kept difference, QA-3 / QA-62). + /// </summary> /// <param name="low">Inclusive lower endpoint of the parameter range.</param> /// <param name="high">Inclusive upper endpoint; a stepped range may lower it to the last reachable grid point.</param> /// <param name="step">Positive grid spacing used to align the upper endpoint.</param> diff --git a/src/OptunaSharp.Core/Exceptions.cs b/src/OptunaSharp.Core/Exceptions.cs index c6750b9..ef80cf9 100644 --- a/src/OptunaSharp.Core/Exceptions.cs +++ b/src/OptunaSharp.Core/Exceptions.cs @@ -89,6 +89,15 @@ public StorageInternalError() { } /// <summary>Creates a StorageInternalError carrying the supplied failure details, if any.</summary> /// <param name="message">Error message explaining the failure.</param> public StorageInternalError(string message) : base(message) { } + + /// <summary> + /// Creates a StorageInternalError that wraps the database error behind it, as Optuna's + /// <c>raise StorageInternalError(message) from e</c> chains the SQLAlchemy error: the message is Optuna's, the + /// provider's detail stays reachable through <see cref="Exception.InnerException" />. + /// </summary> + /// <param name="message">Error message explaining the failure.</param> + /// <param name="innerException">The database error that caused it.</param> + public StorageInternalError(string message, Exception innerException) : base(message, innerException) { } } /// <summary> diff --git a/src/OptunaSharp.Core/FrozenStudy.cs b/src/OptunaSharp.Core/FrozenStudy.cs index c65acc1..f7e02f0 100644 --- a/src/OptunaSharp.Core/FrozenStudy.cs +++ b/src/OptunaSharp.Core/FrozenStudy.cs @@ -51,7 +51,7 @@ public FrozenStudy( /// <summary> /// Dictionary that contains the attributes of the <see cref="Study" /> set with - /// <see cref="Study.SetUserAttr" />. + /// <see cref="Study.SetUserAttr(string, object?)" />. /// </summary> public OrderedDict<string, object?> UserAttrs { get; internal set; } diff --git a/src/OptunaSharp.Core/FrozenTrial.cs b/src/OptunaSharp.Core/FrozenTrial.cs index 939eb1f..8f53d48 100644 --- a/src/OptunaSharp.Core/FrozenTrial.cs +++ b/src/OptunaSharp.Core/FrozenTrial.cs @@ -1,6 +1,8 @@ using System; +using System.Collections; using System.Collections.Generic; using System.Linq; +using System.Threading; using NumSharp; using OptunaSharp.Collections; using OptunaSharp.Distributions; @@ -25,13 +27,47 @@ public class FrozenTrial : BaseTrial private int _number; private List<double>? _values; private DateTime? _datetimeStart; - private OrderedDict<string, object?> _params; - private OrderedDict<string, object?> _userAttrs; - private OrderedDict<string, object?> _systemAttrs; - private OrderedDict<string, BaseDistribution> _distributions; + + // Each dictionary field holds the OrderedDict the trial was built with, or, once a storage built with + // compactFinishedTrials compacted the finished record (Rustuna plan 13, item S12), an immutable compact form + // (ICompactDictionary). The read-only accessors return either as is; the mutable …Dict accessors swap a compact form + // for a real dictionary first (Decompact*), so a write through them is never lost. + private IReadOnlyDictionary<string, object?> _params; + private IReadOnlyDictionary<string, object?> _userAttrs; + private IReadOnlyDictionary<string, object?> _systemAttrs; + private IReadOnlyDictionary<string, BaseDistribution> _distributions; + private OrderedDict<long, double> _intermediateValues; + + /// <summary> + /// What a compact record holds in place of an empty <see cref="IntermediateValues" /> dictionary (plan 13, item + /// S12): shared by every such record and never handed out, because the public getter returns a mutable dictionary. + /// Internal reads may use it as the empty dictionary it is; <see cref="IntermediateValues" /> replaces it with a + /// record's own dictionary before returning. + /// </summary> + private static readonly OrderedDict<long, double> CompactEmptyIntermediateValues = new(); /// <summary>Storage identifier for this trial, separate from its per-study number.</summary> internal int TrialId; + /// <summary> + /// Read and written only by <see cref="Storages.InMemoryStorage" />, under its lock: true while that storage + /// holds the only reference to this record and the record owns every one of its dictionaries, so a write may + /// change it in place instead of copying it (Rustuna plan 13, item S4). + /// </summary> + /// <remarks> + /// <para> + /// False for every record created any other way, which is the safe default: a write then copies, as + /// Optuna's copy-on-write storage always does. The storage clears it the moment a reference leaves (any + /// read that returns this object), so a caller that holds a record never sees it change. That is the + /// invariant Optuna's copying protected, kept at a fraction of the cost: a trial's suggestions write its + /// record repeatedly while nobody reads it, which made every suggestion copy both parameter dictionaries. + /// </para> + /// <para> + /// Not copied by <see cref="ShallowCopy" /> or <see cref="DeepCopy" />: a shallow copy shares the + /// dictionaries, and only the storage knows when it alone holds a record. + /// </para> + /// </remarks> + internal bool StorageExclusive; + // Lazy system-attrs loading used by Trial._get_latest_trial (Python: _LazyTrialSystemAttrs). private Func<OrderedDict<string, object?>>? _systemAttrsLoader; @@ -80,7 +116,7 @@ public FrozenTrial( _params = @params; _userAttrs = userAttrs; _systemAttrs = systemAttrs; - IntermediateValues = intermediateValues; + _intermediateValues = intermediateValues; _distributions = distributions; TrialId = trialId; } @@ -95,7 +131,31 @@ public FrozenTrial( /// Intermediate objective values set with <see cref="Trial.Report" />, keyed by step. Steps are 64-bit, like /// Python's unbounded <c>int</c> steps in journal, SQLite and in-memory storages. /// </summary> - public OrderedDict<long, double> IntermediateValues { get; set; } + /// <remarks> + /// On a record an <see cref="Storages.InMemoryStorage" /> built with <c>compactFinishedTrials: true</c> compacted + /// while it had no intermediate values, the first read gives the record its own empty dictionary and keeps it, so + /// the dictionary returned here is always the record's and a change to it stays (plan 13, item S12). + /// </remarks> + public OrderedDict<long, double> IntermediateValues + { + get + { + OrderedDict<long, double> current = _intermediateValues; + if (!ReferenceEquals(current, CompactEmptyIntermediateValues)) + return current; + // Only one dictionary may become the record's: a reader that loses the race returns the winner's. + var own = new OrderedDict<long, double>(); + OrderedDict<long, double> witnessed = Interlocked.CompareExchange(ref _intermediateValues, own, current); + return ReferenceEquals(witnessed, current) ? own : witnessed; + } + set => _intermediateValues = value; + } + + /// <summary> + /// The intermediate values for internal reads that change nothing: the record's dictionary, or the shared empty + /// one of a compact record, which <see cref="IntermediateValues" /> would replace with a dictionary of its own. + /// </summary> + internal OrderedDict<long, double> IntermediateValuesForRead => _intermediateValues; // ------------------------------------------------------------------ suggest API @@ -172,7 +232,8 @@ public override void Report(double value, long step) /// <param name="key">Attribute name; an existing attribute is overwritten.</param> /// <param name="value">Value retained in this replay record's local attribute dictionary.</param> /// <summary>Updates the local user attribute by name.</summary> - public override void SetUserAttr(string key, object? value) => _userAttrs[key] = value; + /// <remarks>Writes through <see cref="UserAttrsDict" />, so a compact record gets a dictionary of its own first.</remarks> + public override void SetUserAttr(string key, object? value) => UserAttrsDict[key] = value; /// <summary> /// Read this trial's observed-components vector (the residual terms written with @@ -262,7 +323,8 @@ internal void Validate() if (_distributions.TryGetValue(name, out var existing)) Distribution.CheckDistributionCompatibility(existing, distribution); - _distributions[name] = distribution; + // Through the mutable accessor: a compact record gets a dictionary of its own before the write. + DistributionsDict[name] = distribution; return value; } @@ -321,32 +383,53 @@ public List<double>? Values public void SetDatetimeStart(DateTime? value) => _datetimeStart = value; /// <summary>Dictionary that contains suggested parameters (external representations).</summary> + /// <remarks> + /// On a finished record of an <see cref="Storages.InMemoryStorage" /> built with <c>compactFinishedTrials: true</c> + /// this is a read-only view over the trial's internal values (plan 13, item S12): the same entries in the same + /// order, each numeric value a new box with the stored bits on every read, and not an + /// <see cref="OrderedDict{TKey,TValue}" />. <see cref="ParamsDict" /> returns a real dictionary in every case. + /// </remarks> public override IReadOnlyDictionary<string, object?> Params => _params; /// <summary>The mutable parameter dictionary (Python's <c>params</c> setter).</summary> + /// <remarks> + /// A compact record (see <see cref="Params" />) gets a dictionary of its own on the first read, which it keeps: + /// every later read returns that dictionary, and a change to it is the trial's change. It costs the memory the + /// compact form saved, so internal readers that only read use <see cref="Params" />. + /// </remarks> public OrderedDict<string, object?> ParamsDict { - get => _params; + get => _params as OrderedDict<string, object?> ?? Decompact(ref _params); set => _params = value; } /// <summary>Dictionary that contains the distributions of <see cref="Params" />.</summary> + /// <remarks> + /// On a compact record (see <see cref="Params" />), a read-only view that every trial of the same parameter + /// schema shares; <see cref="DistributionsDict" /> returns a real dictionary in every case. + /// </remarks> public override IReadOnlyDictionary<string, BaseDistribution> Distributions => _distributions; /// <summary>Gets or replaces the mutable distribution dictionary; entries are shared distribution objects.</summary> + /// <remarks>A compact record gets a dictionary of its own on the first read, as <see cref="ParamsDict" /> does.</remarks> public OrderedDict<string, BaseDistribution> DistributionsDict { - get => _distributions; + get => _distributions as OrderedDict<string, BaseDistribution> ?? Decompact(ref _distributions); set => _distributions = value; } /// <summary>Dictionary that contains the user attributes.</summary> + /// <remarks> + /// On a compact record (see <see cref="Params" />), a read-only view: long ASCII strings come back as new string + /// instances with the stored characters, every other value as the stored object. + /// </remarks> public override IReadOnlyDictionary<string, object?> UserAttrs => _userAttrs; /// <summary>Gets or replaces the mutable user-attribute dictionary.</summary> + /// <remarks>A compact record gets a dictionary of its own on the first read, as <see cref="ParamsDict" /> does.</remarks> public OrderedDict<string, object?> UserAttrsDict { - get => _userAttrs; + get => _userAttrs as OrderedDict<string, object?> ?? Decompact(ref _userAttrs); set => _userAttrs = value; } @@ -355,22 +438,26 @@ public OrderedDict<string, BaseDistribution> DistributionsDict /// <c>FrozenTrial</c> (only <c>BaseTrial</c>/<c>Trial</c>/<c>Study</c> lost theirs in #6834), so samplers /// read system attributes of finished trials through it. /// </summary> - public IReadOnlyDictionary<string, object?> SystemAttrs => SystemAttrsDict; + /// <remarks>On a compact record, a read-only view as <see cref="UserAttrs" /> describes.</remarks> + /// <exception cref="System.Exception">The deferred storage loader fails; the loader remains available for a later attempt.</exception> + public IReadOnlyDictionary<string, object?> SystemAttrs + { + get + { + ResolveLazySystemAttrs(); + return _systemAttrs; + } + } /// <summary>Gets or replaces internal attributes, resolving any deferred storage lookup once.</summary> + /// <remarks>A compact record gets a dictionary of its own on the first read, as <see cref="ParamsDict" /> does.</remarks> /// <exception cref="System.Exception">The deferred storage loader fails; the loader remains available for a later attempt.</exception> public OrderedDict<string, object?> SystemAttrsDict { get { - if (_systemAttrsLoader is not null) - { - // Clear the loader only after success, allowing a transient backend failure to be - // retried instead of permanently exposing an obsolete attribute snapshot. - _systemAttrs = _systemAttrsLoader(); - _systemAttrsLoader = null; - } - return _systemAttrs; + ResolveLazySystemAttrs(); + return _systemAttrs as OrderedDict<string, object?> ?? Decompact(ref _systemAttrs); } set { @@ -379,18 +466,135 @@ public OrderedDict<string, BaseDistribution> DistributionsDict } } + /// <summary>Loads deferred system attributes, if any are pending, before either accessor returns them.</summary> + /// <exception cref="System.Exception">The deferred storage loader fails; the loader remains available for a later attempt.</exception> + private void ResolveLazySystemAttrs() + { + if (_systemAttrsLoader is not null) + { + // Clear the loader only after success, allowing a transient backend failure to be + // retried instead of permanently exposing an obsolete attribute snapshot. + _systemAttrs = _systemAttrsLoader(); + _systemAttrsLoader = null; + } + } + /// <summary>Python <c>Trial._get_latest_trial</c> support: defer system-attr loading to the storage.</summary> /// <param name="loader">Deferred storage read invoked on first SystemAttrsDict access; failures are not swallowed.</param> internal void SetLazySystemAttrs(Func<OrderedDict<string, object?>> loader) => _systemAttrsLoader = loader; + // ------------------------------------------------------------------ compact records (plan 13, item S12) + + /// <summary> + /// Replaces the compact form in <paramref name="field" /> with a real dictionary of the same entries and returns + /// it, so the caller of a mutable accessor gets the dictionary the record keeps. + /// </summary> + /// <typeparam name="TValue">The dictionary's value type.</typeparam> + /// <param name="field">One of the record's dictionary fields, holding a compact form or null.</param> + /// <returns>The record's dictionary from now on; null when the field held null (a record built with a null dictionary keeps returning null).</returns> + /// <remarks> + /// Readers on other threads may call this at once on a shared finished record: the compare-exchange lets exactly + /// one materialized dictionary become the record's, and every caller returns that one, so no caller can write into + /// a dictionary the record does not keep. A reader that loaded the compact form a moment earlier keeps reading it, + /// which is safe because a compact form never changes and holds the same entries. + /// </remarks> + private static OrderedDict<string, TValue> Decompact<TValue>(ref IReadOnlyDictionary<string, TValue> field) + { + IReadOnlyDictionary<string, TValue> observed = field; + while (true) + { + switch (observed) + { + case null: + return null!; + case OrderedDict<string, TValue> dictionary: + return dictionary; + } + OrderedDict<string, TValue> own = ((ICompactDictionary<string, TValue>)observed).Materialize(); + IReadOnlyDictionary<string, TValue> witnessed = Interlocked.CompareExchange(ref field, own, observed); + if (ReferenceEquals(witnessed, observed)) + return own; + // Another thread (or a setter) replaced the form first: return whatever the record holds now. + observed = witnessed; + } + } + + /// <summary> + /// True while any of the record's dictionaries is held in compact form (plan 13, item S12); a diagnostic the tests + /// read to prove which records a storage compacted and which a mutable accessor turned back. + /// </summary> + internal bool IsCompact + => _params is ICompactDictionary<string, object?> + || _distributions is ICompactDictionary<string, BaseDistribution> + || _userAttrs is ICompactDictionary<string, object?> + || _systemAttrs is ICompactDictionary<string, object?> + || ReferenceEquals(_intermediateValues, CompactEmptyIntermediateValues); + + /// <summary> + /// Stores a finished record compactly (plan 13, item S12): parameters as internal values against a schema shared + /// by the study's trials, attributes as arrays with long ASCII strings as bytes, and nothing for empty + /// dictionaries. Every accessor returns the same entries afterwards. + /// </summary> + /// <param name="schemas">The study's schema cache; the caller (the storage) holds the lock that guards it.</param> + /// <remarks> + /// <para> + /// The caller must hold the only reference to this record object: the storage calls it on the copy it is about + /// to publish, under its lock, so no reader can see the fields change. The record's dictionaries are only + /// read, never changed, because the record it was copied from (and a reader holding that one) may share + /// them; after this call the published record no longer references them. + /// </para> + /// <para> + /// Parameters stay a dictionary when they cannot be compacted exactly: names in another order than the + /// distributions, more parameter shapes than <see cref="ParamSchemaCache.MaxSchemas" />, or a value that + /// would not read back identical (see <see cref="CompactParams.TryCreate" />). A record with deferred + /// system attributes keeps them deferred. + /// </para> + /// </remarks> + internal void CompactFinished(ParamSchemaCache schemas) + { + if (_params is OrderedDict<string, object?> @params + && _distributions is OrderedDict<string, BaseDistribution> distributions) + { + ParamSchema? schema = schemas.FindOrAdd(@params, distributions); + CompactParams? compact = schema is null ? null : CompactParams.TryCreate(schema, @params); + if (compact is not null) + { + _params = compact; + _distributions = compact.Schema.View; + } + } + + if (_userAttrs is OrderedDict<string, object?> userAttrs) + _userAttrs = CompactAttrs.Create(userAttrs); + if (_systemAttrsLoader is null && _systemAttrs is OrderedDict<string, object?> systemAttrs) + _systemAttrs = CompactAttrs.Create(systemAttrs); + + OrderedDict<long, double> intermediate = _intermediateValues; + if (intermediate is { Count: 0 }) + { + _intermediateValues = CompactEmptyIntermediateValues; + } + else if (intermediate is not null) + { + // Kept as a dictionary (the public getter returns the mutable type), but as a copy sized to its entries: + // reports grow it by prime steps, and the source may be shared with the record this one was copied from. + var trimmed = new OrderedDict<long, double>(intermediate.Count); + foreach (var (step, value) in intermediate) + trimmed.Add(step, value); + _intermediateValues = trimmed; + } + } + /// <summary>Return the maximum step of <see cref="IntermediateValues" /> in the trial (64-bit, like the steps).</summary> public long? LastStep { get { - if (IntermediateValues.Count == 0) + // The read-only view, so a compact record without reports does not get a dictionary just to say so. + OrderedDict<long, double> intermediateValues = IntermediateValuesForRead; + if (intermediateValues.Count == 0) return null; - return IntermediateValues.Keys.Max(); + return intermediateValues.Keys.Max(); } } @@ -410,7 +614,7 @@ public TimeSpan? Duration /// are zero or less. /// </summary> public override OrderedDict<string, double> Constraints - => ConstrainedOptimization.GetConstraintsFromSystemAttrs(SystemAttrsDict); + => ConstrainedOptimization.GetConstraintsFromSystemAttrs(SystemAttrs); /// <summary> /// Set a constraint value for the trial. The trial is considered feasible when all @@ -454,8 +658,9 @@ public override bool Equals(object? obj) && DictValueEquals(_params, other._params) && DistributionsEqual(_distributions, other._distributions) && DictValueEquals(_userAttrs, other._userAttrs) - && DictValueEquals(SystemAttrsDict, other.SystemAttrsDict) - && IntermediateValuesEqual(IntermediateValues, other.IntermediateValues) + // The read-only accessors: comparing must not give a compact record dictionaries of its own. + && DictValueEquals(SystemAttrs, other.SystemAttrs) + && IntermediateValuesEqual(IntermediateValuesForRead, other.IntermediateValuesForRead) && TrialId == other.TrialId; } @@ -499,10 +704,10 @@ private static bool ValuesEqual(List<double>? a, List<double>? b) } /// <summary>Compares parameter or attribute dictionaries using Python-compatible nested value equality.</summary> - /// <param name="a">First collection to compare.</param> - /// <param name="b">Second collection to compare.</param> + /// <param name="a">First collection to compare; a dictionary or a compact record's read-only view.</param> + /// <param name="b">Second collection to compare; a dictionary or a compact record's read-only view.</param> /// <returns>True when both collections contain equal corresponding values.</returns> - private static bool DictValueEquals(OrderedDict<string, object?> a, OrderedDict<string, object?> b) + private static bool DictValueEquals(IReadOnlyDictionary<string, object?> a, IReadOnlyDictionary<string, object?> b) { if (a.Count != b.Count) return false; @@ -518,11 +723,11 @@ private static bool DictValueEquals(OrderedDict<string, object?> a, OrderedDict< } /// <summary>Compares distribution dictionaries by parameter name and distribution value.</summary> - /// <param name="a">First collection to compare.</param> - /// <param name="b">Second collection to compare.</param> + /// <param name="a">First collection to compare; a dictionary or a compact record's read-only view.</param> + /// <param name="b">Second collection to compare; a dictionary or a compact record's read-only view.</param> /// <returns>True when both collections contain equal corresponding values.</returns> private static bool DistributionsEqual( - OrderedDict<string, BaseDistribution> a, OrderedDict<string, BaseDistribution> b) + IReadOnlyDictionary<string, BaseDistribution> a, IReadOnlyDictionary<string, BaseDistribution> b) { if (a.Count != b.Count) return false; @@ -552,18 +757,26 @@ private static bool IntermediateValuesEqual(OrderedDict<long, double> a, Ordered /// <summary>Python <c>copy.copy(trial)</c>: a shallow copy (dict references shared).</summary> /// <returns>A new trial wrapper sharing dictionaries, values, and the deferred loader with this instance.</returns> + /// <remarks> + /// A compact record (plan 13, item S12) first gets real dictionaries of its own, which the copy then shares: + /// sharing the compact forms instead would let each object later take a different dictionary, and a change + /// through one would no longer show in the other as it does for Python's shallow copy. The storages copy only + /// unfinished records, which are never compact, so this costs nothing on their paths. + /// </remarks> internal FrozenTrial ShallowCopy() { + // Field by field rather than through the accessors: SystemAttrsDict would run a pending deferred loader, which + // a shallow copy hands over unrun instead. var copy = new FrozenTrial( number: _number, state: State, value: null, datetimeStart: _datetimeStart, datetimeComplete: DatetimeComplete, - @params: _params, - distributions: _distributions, - userAttrs: _userAttrs, - systemAttrs: _systemAttrs, + @params: _params as OrderedDict<string, object?> ?? Decompact(ref _params), + distributions: _distributions as OrderedDict<string, BaseDistribution> ?? Decompact(ref _distributions), + userAttrs: _userAttrs as OrderedDict<string, object?> ?? Decompact(ref _userAttrs), + systemAttrs: _systemAttrs as OrderedDict<string, object?> ?? Decompact(ref _systemAttrs), intermediateValues: IntermediateValues, trialId: TrialId, values: null); @@ -574,6 +787,10 @@ internal FrozenTrial ShallowCopy() /// <summary>Python <c>copy.deepcopy(trial)</c>.</summary> /// <returns>A new trial with copied value lists and supported nested attribute containers; distribution instances remain shared.</returns> + /// <remarks> + /// The copy always holds real dictionaries, including the copy of a compact record (plan 13, item S12), which is + /// read through its views and left compact itself. + /// </remarks> public FrozenTrial DeepCopy() { // Nested JSON-compatible values need separate containers because users commonly mutate @@ -585,20 +802,29 @@ public FrozenTrial DeepCopy() datetimeStart: _datetimeStart, datetimeComplete: DatetimeComplete, @params: DeepCopyAttrs(_params), - distributions: _distributions.ShallowClone(), // Distributions are treated as immutable. + distributions: CloneDistributions(_distributions), // Distributions are treated as immutable. userAttrs: DeepCopyAttrs(_userAttrs), - systemAttrs: DeepCopyAttrs(SystemAttrsDict), - intermediateValues: IntermediateValues.ShallowClone(), + systemAttrs: DeepCopyAttrs(SystemAttrs), + intermediateValues: IntermediateValuesForRead.ShallowClone(), trialId: TrialId, values: null); copy._values = _values is null ? null : new List<double>(_values); return copy; } + /// <summary>A new distributions dictionary sharing the distribution instances, as <c>ShallowClone</c> builds one.</summary> + /// <param name="distributions">The record's dictionary, or a compact record's shared view.</param> + /// <returns>A dictionary the copy owns, in the same order.</returns> + private static OrderedDict<string, BaseDistribution> CloneDistributions( + IReadOnlyDictionary<string, BaseDistribution> distributions) + => distributions is OrderedDict<string, BaseDistribution> dictionary + ? dictionary.ShallowClone() + : new OrderedDict<string, BaseDistribution>(distributions); + /// <summary>Copies an attribute dictionary through the Python-compatible nested-value copier.</summary> - /// <param name="attrs">Attribute dictionary to copy.</param> + /// <param name="attrs">Attribute dictionary to copy; a dictionary or a compact record's read-only view.</param> /// <returns>A new dictionary with supported nested containers copied.</returns> - private static OrderedDict<string, object?> DeepCopyAttrs(OrderedDict<string, object?> attrs) + private static OrderedDict<string, object?> DeepCopyAttrs(IReadOnlyDictionary<string, object?> attrs) { var copy = new OrderedDict<string, object?>(attrs.Count); foreach (var (key, value) in attrs) @@ -617,11 +843,12 @@ public override string ToString() $"values={(_values is null ? "None" : PythonRepr.ListRepr(_values))}", $"datetime_start={PythonRepr.Repr(_datetimeStart?.ToString("yyyy-MM-dd HH:mm:ss.ffffff"))}", $"datetime_complete={PythonRepr.Repr(DatetimeComplete?.ToString("yyyy-MM-dd HH:mm:ss.ffffff"))}", - $"params={PythonRepr.DictRepr(_params)}", - $"user_attrs={PythonRepr.DictRepr(_userAttrs)}", - $"system_attrs={PythonRepr.DictRepr(_systemAttrs)}", - $"intermediate_values={PythonRepr.DictRepr(IntermediateValues)}", - $"distributions={PythonRepr.DictRepr(_distributions)}", + // Every field is an IDictionary: an OrderedDict, or a compact record's view, which prints the same entries. + $"params={PythonRepr.DictRepr((IDictionary)_params)}", + $"user_attrs={PythonRepr.DictRepr((IDictionary)_userAttrs)}", + $"system_attrs={PythonRepr.DictRepr((IDictionary)_systemAttrs)}", + $"intermediate_values={PythonRepr.DictRepr(IntermediateValuesForRead)}", + $"distributions={PythonRepr.DictRepr((IDictionary)_distributions)}", $"trial_id={TrialId}", "value=None", }; diff --git a/src/OptunaSharp.Core/Gp/GPRegressor.cs b/src/OptunaSharp.Core/Gp/GPRegressor.cs index 74928b7..ff54b58 100644 --- a/src/OptunaSharp.Core/Gp/GPRegressor.cs +++ b/src/OptunaSharp.Core/Gp/GPRegressor.cs @@ -151,10 +151,18 @@ private static (double Value, double Deriv) Matern52(double t) /// <summary>The squared distance <c>S[i,j] = Σ_d squared_X_diff[i,j,d] · w[d]</c>.</summary> /// <returns>The pairwise length-scale-weighted squared distances between input rows.</returns> - private double[,] SquaredDistance() + private double[,] SquaredDistance() => SquaredDistance(new double[_n, _n]); + + /// <summary> + /// <see cref="SquaredDistance()" /> into a caller's n × n buffer, every element overwritten: the same sums in the + /// same order, for <see cref="LossAndGrad" />, which reuses one buffer across the fit's evaluations (plan 15). + /// </summary> + /// <param name="s">The n × n buffer to fill; its previous contents are irrelevant.</param> + /// <returns><paramref name="s" />, holding the weighted squared distances between the training rows.</returns> + /// <exception cref="IndexOutOfRangeException"><paramref name="s" /> is smaller than n × n.</exception> + private double[,] SquaredDistance(double[,] s) { double[] w = InverseSquaredLengthscales; - var s = new double[_n, _n]; for (int i = 0; i < _n; i++) for (int j = 0; j < _n; j++) { @@ -241,10 +249,9 @@ private static (double Value, double Deriv) Matern52(double t) mean[i] = s; } - // V = cov_fx_fX @ C⁻¹ = solve( X (L Lᵀ) = cov_fx_fX ) via two right-side triangular solves. - double[,] lt = Transpose(_covYYChol); - double[,] tmp = LinAlg.SolveTriangular(lt, covFxFX, upper: true, left: false); // X Lᵀ = cov_fx_fX - double[,] v = LinAlg.SolveTriangular(_covYYChol, tmp, upper: false, left: false); // X L = tmp + // V = cov_fx_fX @ C⁻¹ = solve( X (L Lᵀ) = cov_fx_fX ) via two right-side triangular solves (X Lᵀ = cov_fx_fX, + // then X L = that), fused on one block (plan 15). + double[,] v = LinAlg.CholeskySolve(_covYYChol, covFxFX, left: false); var variance = new double[b]; for (int i = 0; i < b; i++) @@ -344,10 +351,10 @@ private static (double Value, double Deriv) Matern52(double t) for (int j = 0; j < _nAll; j++) mean += k[j] * _covYYInvY[j]; - // V = C⁻¹ kᵀ via inv(Lᵀ)·inv(L)·k. + // V = C⁻¹ kᵀ via inv(Lᵀ)·inv(L)·k. The Lᵀ solve reads L transposed in place, the same operations as solving with + // a materialized Lᵀ, without an n × n allocation per point (plan 15). double[] invLk = LinAlg.SolveTriangular(_covYYChol, k, upper: false); - double[,] lt = Transpose(_covYYChol); - double[] v = LinAlg.SolveTriangular(lt, invLk, upper: true); + double[] v = LinAlg.SolveTriangular(_covYYChol, invLk, upper: false, transposeA: true); double rawVar = scale; for (int j = 0; j < _nAll; j++) @@ -429,10 +436,13 @@ internal double MarginalLogLikelihood() NoiseVar = nv; // ---- forward: S, M(S), M'(S), K, C = K + ν·I, Cholesky ---- - double[,] sq = SquaredDistance(); - var k0 = new double[_n, _n]; // M(S) - var mp = new double[_n, _n]; // M'(S) - var c = new double[_n, _n]; // C = s·M(S) + ν·I + // The n × n scratch below lives on the regressor across the fit's evaluations (plan 15): every element is + // rewritten before it is read on each call, so a reused buffer holds what a fresh one would. + _fitScratch ??= new FitScratch(_n); + double[,] sq = SquaredDistance(_fitScratch.Distance); + double[,] k0 = _fitScratch.K0; // M(S) + double[,] mp = _fitScratch.Mp; // M'(S) + double[,] c = _fitScratch.C; // C = s·M(S) + ν·I for (int i = 0; i < _n; i++) for (int j = 0; j < _n; j++) { @@ -455,12 +465,10 @@ internal double MarginalLogLikelihood() double loss = -mll - logPrior; // ---- backward: C⁻¹ = L⁻ᵀL⁻¹, α = C⁻¹y, G = ½(ααᵀ - C⁻¹) ---- - var identity = new double[_n, _n]; - for (int i = 0; i < _n; i++) - identity[i, i] = 1.0; - double[,] invL = LinAlg.SolveTriangular(l, identity, upper: false); // L⁻¹ - double[,] lt = Transpose(l); - double[,] cInv = LinAlg.SolveTriangular(lt, invL, upper: true); // L⁻ᵀL⁻¹ = C⁻¹ + // The identity is built once per regressor; the solve only reads it. C⁻¹ = L⁻ᵀL⁻¹ is the solve with L, then Lᵀ, + // of the identity, the two triangular solves this used to spell out, fused on one block (plan 15). + double[,] identity = _fitScratch.Identity; + double[,] cInv = LinAlg.CholeskySolve(l, identity, left: true); // L⁻ᵀL⁻¹ = C⁻¹ double[] alpha = LinAlg.Dot(cInv, _yTrain); // ∂MLL/∂ν = ½(α·α - tr(C⁻¹)) @@ -474,9 +482,9 @@ internal double MarginalLogLikelihood() double dmllDNoise = 0.5 * (MathUtil.PairwiseSum(alphaSq) - traceCInv); // G = ½(ααᵀ - C⁻¹); ∂MLL/∂s = Σ G⊙M(S); P = G⊙M'(S); ∂MLL/∂w[d] = s·Σ P⊙D[:,:,d] - var g = new double[_n, _n]; - var gK0 = new double[_n * _n]; - var p = new double[_n, _n]; + double[,] g = _fitScratch.G; + double[] gK0 = _fitScratch.GK0; + double[,] p = _fitScratch.P; int flat = 0; for (int i = 0; i < _n; i++) for (int j = 0; j < _n; j++) @@ -489,7 +497,7 @@ internal double MarginalLogLikelihood() double dmllDScale = MathUtil.PairwiseSum(gK0); var dmllDW = new double[n]; - var pd = new double[_n * _n]; + double[] pd = _fitScratch.Pd; for (int d = 0; d < n; d++) { flat = 0; @@ -514,6 +522,73 @@ internal double MarginalLogLikelihood() return (loss, grad); } + /// <summary> + /// <see cref="LossAndGrad" />'s n × n scratch, created on its first call and reused by every later one (plan 15). + /// </summary> + /// <remarks> + /// A fit evaluates the loss dozens of times, and each evaluation used to allocate nine n × n arrays: from 104 + /// training points on, each is a large-object-heap allocation, which is collected only with generation 2, so a + /// 150-trial GP study ran hundreds of full collections. Reuse is safe because one regressor's fit evaluates its + /// loss on one thread, one call at a time (the fit runs inside the sampler's lock on a regressor of its own), and + /// every call rewrites each buffer before reading it. + /// </remarks> + private FitScratch? _fitScratch; + + /// <summary> + /// Drops <see cref="LossAndGrad" />'s n × n scratch once a fit has finished evaluating the loss, so a regressor + /// kept for its posterior (or as the next fit's warm start) does not keep nine n × n arrays alive with it. + /// </summary> + /// <remarks>A later <see cref="LossAndGrad" /> call simply allocates the scratch again.</remarks> + internal void ReleaseFitScratch() => _fitScratch = null; + + /// <summary>The n × n buffers <see cref="LossAndGrad" /> reuses across one fit's evaluations.</summary> + private sealed class FitScratch + { + /// <summary>The weighted squared distances S.</summary> + internal readonly double[,] Distance; + + /// <summary>The Matérn 5/2 values M(S).</summary> + internal readonly double[,] K0; + + /// <summary>The Matérn 5/2 derivatives M'(S).</summary> + internal readonly double[,] Mp; + + /// <summary>The covariance C = s·M(S) + ν·I.</summary> + internal readonly double[,] C; + + /// <summary>The identity, the right-hand side whose solve gives L⁻¹; never written after construction.</summary> + internal readonly double[,] Identity; + + /// <summary>G = ½(ααᵀ - C⁻¹).</summary> + internal readonly double[,] G; + + /// <summary>G ⊙ M(S), flattened row-major for the pairwise sum.</summary> + internal readonly double[] GK0; + + /// <summary>P = G ⊙ M'(S).</summary> + internal readonly double[,] P; + + /// <summary>P ⊙ D[:, :, d] for one dimension d at a time, flattened row-major for the pairwise sum.</summary> + internal readonly double[] Pd; + + /// <summary>Allocates the buffers for <paramref name="n" /> training points.</summary> + /// <param name="n">The number of training points.</param> + internal FitScratch(int n) + { + Distance = new double[n, n]; + K0 = new double[n, n]; + Mp = new double[n, n]; + C = new double[n, n]; + Identity = new double[n, n]; + for (int i = 0; i < n; i++) + Identity[i, i] = 1.0; + G = new double[n, n]; + GK0 = new double[n * n]; + P = new double[n, n]; + Pd = new double[n * n]; + } + } + private double[,]? _covYYChol; private double[] _covYYInvY = Array.Empty<double>(); @@ -528,10 +603,9 @@ internal void CacheMatrix() for (int i = 0; i < _n; i++) c[i, i] += NoiseVar; _covYYChol = LinAlg.Cholesky(c); - // C⁻¹y = L⁻ᵀ(L⁻¹y). + // C⁻¹y = L⁻ᵀ(L⁻¹y); the Lᵀ solve reads L transposed in place (plan 15), the same operations as before. double[] invLy = LinAlg.SolveTriangular(_covYYChol, _yTrain, upper: false); - double[,] lt = Transpose(_covYYChol); - _covYYInvY = LinAlg.SolveTriangular(lt, invLy, upper: true); + _covYYInvY = LinAlg.SolveTriangular(_covYYChol, invLy, upper: false, transposeA: true); } /// <summary> @@ -638,11 +712,11 @@ internal void AppendRunningData(double[,] xRunning, double[] yRunning) { if (left) { - double[,] tmp = LinAlg.SolveTriangular(l, b, upper: false, left: true); // L (Lᵀ X) = B - return LinAlg.SolveTriangular(Transpose(l), tmp, upper: true, left: true); // Lᵀ X = tmp + // L (Lᵀ X) = B, then Lᵀ X = tmp: both triangular solves fused on one block (plan 15). + return LinAlg.CholeskySolve(l, b, left: true); } - double[,] rt = LinAlg.SolveTriangular(Transpose(l), b, upper: true, left: false); // (X L) Lᵀ = B - return LinAlg.SolveTriangular(l, rt, upper: false, left: false); // X L = rt + // (X L) Lᵀ = B, then X L = rt: both triangular solves fused on one block (plan 15). + return LinAlg.CholeskySolve(l, b, left: false); } /// <summary><c>_solve_cholesky(L, b)</c> for a vector right-hand side (<c>left=True</c>): <c>C⁻¹b = L⁻ᵀ(L⁻¹b)</c>.</summary> @@ -652,7 +726,8 @@ internal void AppendRunningData(double[,] xRunning, double[] yRunning) internal static double[] SolveCholesky(double[,] l, double[] b) { double[] invLb = LinAlg.SolveTriangular(l, b, upper: false); - return LinAlg.SolveTriangular(Transpose(l), invLb, upper: true); + // Lᵀ read in place (plan 15): the operations of solving with a materialized Lᵀ, without the n × n copy. + return LinAlg.SolveTriangular(l, invLb, upper: false, transposeA: true); } /// <summary> @@ -715,9 +790,20 @@ private GPRegressor FitInner(double minimumNoise, bool deterministicObjective, d // 0.99 * minimum_noise is subtracted to keep the initial noise strictly above the floor. initial[nParams + 1] = Math.Log(NoiseVar - 0.99 * minimumNoise); - LBfgsB.Result res = LBfgsB.Minimize( - rawParams => LossAndGrad(rawParams, minimumNoise, deterministicObjective), - initial, bounds: null, m: 10, factr: 1e7, pgtol: gtol, maxfun: 15000, maxiter: 15000, maxls: 20); + LBfgsB.Result res; + try + { + res = LBfgsB.Minimize( + rawParams => LossAndGrad(rawParams, minimumNoise, deterministicObjective), + initial, bounds: null, m: 10, factr: 1e7, pgtol: gtol, maxfun: 15000, maxiter: 15000, maxls: 20); + } + finally + { + // The fitted regressor outlives its fit (posterior queries, the next trial's warm start), and nothing + // after the fit evaluates the loss again: drop the n × n scratch now instead of keeping it alive with it. + // On a failed fit the regressor is discarded, so this only frees the buffers earlier. + ReleaseFitScratch(); + } if (res.WarnFlag != 0) throw new InvalidOperationException("Optimization failed"); diff --git a/src/OptunaSharp.Core/Gp/OptimMixed.cs b/src/OptunaSharp.Core/Gp/OptimMixed.cs index f6f77d9..fbd2106 100644 --- a/src/OptunaSharp.Core/Gp/OptimMixed.cs +++ b/src/OptunaSharp.Core/Gp/OptimMixed.cs @@ -485,16 +485,23 @@ internal static int[] ChoiceNoReplaceWeighted(NumPyRandom rng, int n, int size, return found; } - /// <summary>Returns the index of the first largest value.</summary> - /// <param name="a">The first numerical operand; its dimensions must agree with the operation described in the summary.</param> - /// <returns>The index of the first largest value.</returns> + /// <summary> + /// NumPy <c>np.argmax</c> through NumSharp — the optimizer's <c>np.argmax(f_vals)</c>, <c>np.argmax(best_fvals)</c> + /// and <c>np.argmax(fvals)</c>: the first index of the maximum, or of the first NaN when one is NaN. + /// </summary> + /// <param name="a">The acquisition values of the evaluated points; at least one.</param> + /// <returns>The index of the first NaN if any value is NaN, else the first index holding the largest value.</returns> + /// <remarks> + /// NumPy treats a NaN as maximal; NaN acquisition values come from a NaN threshold (QA-53) or overflowing + /// posteriors. The former strict <c>></c> loop skipped NaNs where they were not first. Each call follows an + /// acquisition evaluation over all the points, which costs far more than the NumSharp call. + /// </remarks> + /// <exception cref="NumSharp.ValueError"><paramref name="a" /> is empty (NumPy's <c>attempt to get argmax of an empty sequence</c>).</exception> private static int Argmax(double[] a) { - int best = 0; - for (int i = 1; i < a.Length; i++) - if (a[i] > a[best]) - best = i; - return best; + using NDArray values = np.array(a, copy: false); + using NDArray index = np.argmax(values); + return (int)(long)index; } /// <summary><c>np.min(np.diff(choices), initial=np.inf)</c> — smallest consecutive gap, +∞ if < 2 points.</summary> diff --git a/src/OptunaSharp.Core/Gp/OptimSample.cs b/src/OptunaSharp.Core/Gp/OptimSample.cs index c59162a..fc63a41 100644 --- a/src/OptunaSharp.Core/Gp/OptimSample.cs +++ b/src/OptunaSharp.Core/Gp/OptimSample.cs @@ -20,21 +20,23 @@ internal static class OptimSample /// <param name="acqf">The acquisition function to maximize over its normalized search space.</param> /// <param name="nSamples">The number of observations or generated sample rows.</param> /// <param name="rng">The random generator whose state is advanced when drawing samples.</param> - /// <returns>The best sampled normalized point and its acquisition value.</returns> + /// <returns> + /// The best sampled normalized point and its acquisition value; when an acquisition value is NaN, the first NaN + /// point and NaN, as NumPy's <c>np.argmax</c> picks it. + /// </returns> + /// <exception cref="NumSharp.ValueError"><paramref name="nSamples" /> is 0 (NumPy's <c>attempt to get argmax of an empty sequence</c>).</exception> internal static (double[] X, double Value) OptimizeAcqfSample( IAcquisitionFunc acqf, int nSamples, NumPyRandom rng) { double[,] xs = acqf.SearchSpace.SampleNormalizedParams(nSamples, rng); double[] res = acqf.EvalAcqfNoGrad(xs); - int bestI = 0; - double best = res[0]; - for (int i = 1; i < res.Length; i++) - if (res[i] > best) // np.argmax — first maximum - { - best = res[i]; - bestI = i; - } + // best_i = np.argmax(res), through NumSharp: the first maximum, or the first NaN when one is NaN (NumPy treats a + // NaN as maximal; a strict > loop would skip it). One call per optimization, after nSamples acqf evaluations. + int bestI; + using (NDArray values = np.array(res, copy: false)) + using (NDArray index = np.argmax(values)) + bestI = (int)(long)index; int dim = xs.GetLength(1); var x = new double[dim]; diff --git a/src/OptunaSharp.Core/Gp/SearchSpace.cs b/src/OptunaSharp.Core/Gp/SearchSpace.cs index 25cec3c..eb8ed3b 100644 --- a/src/OptunaSharp.Core/Gp/SearchSpace.cs +++ b/src/OptunaSharp.Core/Gp/SearchSpace.cs @@ -2,6 +2,7 @@ using System.Collections.Generic; using System.Linq; using NumSharp; +using NumSharp.Utilities; using OptunaSharp.Distributions; using OptunaSharp.Internal; @@ -13,7 +14,8 @@ namespace OptunaSharp.Gp; /// Gaussian process works in: continuous parameters are affine- (or log-affine-) scaled, /// discrete ones round to their grid, and categoricals carry their integer code. Every transform /// is pure numpy in Optuna and reproduced bit-for-bit here (no <c>erf</c>, no LAPACK — <c>log</c>/ -/// <c>exp</c>/<c>floor</c> match Python bit-for-bit). +/// <c>exp</c>/<c>floor</c> match Python bit-for-bit; the discrete grids are NumSharp's <c>np.arange</c> +/// and the rounding's <c>//</c> is NumSharp's port of NumPy's <c>floor_divide</c>, since 2026-11-11). /// /// <para><see cref="SampleNormalizedParams" /> draws the preliminary points from <b>scrambled</b> /// Sobol' (<see cref="ScrambledSobol" />, a bit-exact port of <c>scipy.stats.qmc.Sobol(scramble=True)</c>) @@ -192,7 +194,7 @@ internal List<double[]> GetChoicesOfDiscreteParams() /// <returns>A matrix of sampled normalized points rounded onto each coordinate's support.</returns> internal double[,] SampleNormalizedParams(int n, NumPyRandom rng) { - int seed = (int)rng.randint(0, 2147483647); // rng.randint(np.iinfo(np.int32).max) + int seed = (int)NumPyDraws.RandInt(rng, 0, 2147483647); // rng.randint(np.iinfo(np.int32).max) double[,] values = ScrambledSobol.Random(Dim, n, seed); for (int i = 0; i < Dim; i++) { @@ -265,38 +267,64 @@ internal static double UnnormalizeOneParam(double value, ScaleType scaleType, (d /// <param name="bounds">The coordinate bounds used by this numerical operation.</param> /// <param name="step">The distribution's grid spacing; zero denotes a continuous coordinate.</param> /// <returns>The nearest admissible discrete coordinate in normalized space.</returns> + /// <remarks> + /// Optuna's <c>(param_value - low + 0.5 * step) // step</c> is NumPy's <c>floor_divide</c>, which floors the + /// exact quotient (<c>npy_divmod</c>: <c>fmod</c>, then <c>(a - mod) / b</c> snapped to an integer), not the + /// rounded one: <c>0.9 // 0.05</c> is <c>17</c> where <c>Math.Floor(0.9 / 0.05)</c> is <c>18</c>, because the + /// double <c>0.05</c> is a little above 1/20 and the quotient rounds up to 18. NumSharp's + /// <see cref="NDDivision.FloorDivDouble(double, double)" /> is that routine, allocation-free. The former + /// <c>Math.Floor(a / b)</c> picked the next grid point in about 1 of 800 roundings of random and dyadic + /// (Sobol'-like) points (measured 2026-11-11 over 508,000 against NumPy 2.4.2). + /// </remarks> internal static double RoundOneNormalizedParam(double value, ScaleType scaleType, (double Low, double High) bounds, double step) { if (step == 0.0) return value; double unnormalized = UnnormalizeOneParam(value, scaleType, bounds, step); double rounded = MathUtilClip( - Math.Floor((unnormalized - bounds.Low + 0.5 * step) / step) * step + bounds.Low, + NDDivision.FloorDivDouble(unnormalized - bounds.Low + 0.5 * step, step) * step + bounds.Low, bounds.Low, bounds.High); return NormalizeOneParam(rounded, scaleType, bounds, step); } - /// <summary>NumPy <c>np.arange(start, stop, step)</c> — length <c>ceil((stop - start) / step)</c>, value <c>start + i·step</c>.</summary> + /// <summary> + /// NumPy <c>np.arange(start, stop, step)</c>, computed by NumSharp's <c>np.arange</c>: length + /// <c>ceil((stop - start) / step)</c>, elements <c>start</c>, <c>start + step</c>, then + /// <c>start + i * delta</c> with <c>delta = (start + step) - start</c>. + /// </summary> /// <param name="start">The inclusive start of the interval or slice.</param> /// <param name="stop">The final value of the generated numerical interval.</param> /// <param name="step">The nonzero increment between successive grid values.</param> - /// <returns>The generated arithmetic progression, excluding its stop value.</returns> + /// <returns>The generated arithmetic progression, excluding its stop value; empty when <paramref name="stop" /> is not past <paramref name="start" />.</returns> + /// <remarks> + /// NumPy fills the ramp with the step as it was stored, <c>(start + step) - start</c>, not with <c>step</c> + /// (<c>PyArray_ArangeObj</c> and the dtype's <c>fill</c>), so a stepped float whose step does not survive that + /// round trip gets other grid points: <c>FloatDistribution(0.1, 1.0, step=0.3)</c> ends its grid at + /// <c>1.0</c> in Optuna, where the former <c>start + i * step</c> gave <c>0.9999999999999998</c> (QA-49; about + /// half of random ranges differ somewhere). The grid is built once per discrete dimension per + /// <c>GetChoicesOfDiscreteParams</c> call, so the NumSharp call's microseconds do not matter. + /// </remarks> + /// <exception cref="ZeroDivisionError"><paramref name="step" /> is zero: NumPy's <c>ZeroDivisionError</c>, which NumSharp's <c>np.arange</c> raises as Python's class since 0.81.0 (it was .NET's <see cref="DivideByZeroException" /> before); the callers only pass discrete steps, which are positive.</exception> private static double[] Arange(double start, double stop, double step) { - int count = (int)Math.Ceiling((stop - start) / step); - if (count < 0) - count = 0; - var a = new double[count]; - for (int i = 0; i < count; i++) - a[i] = start + i * step; - return a; + using NDArray grid = np.arange(start, stop, step); + return grid.ToArray<double>(); } - /// <summary>Returns the value bounded by the supplied interval endpoints.</summary> - /// <param name="value">The value to convert, format, or compare using the operation's stated convention.</param> + /// <summary> + /// NumPy <c>np.clip</c> against scalar bounds, through <see cref="MathUtil.Clip" />: Optuna's two clips here + /// (<c>_get_unnormalized_param</c> on a 0-d value, <c>_round_one_normalized_param</c> on an array against + /// <c>bounds[0]</c> / <c>bounds[1]</c>) both run NumPy's const loop, where a value equal to a bound keeps its own + /// zero sign. + /// </summary> + /// <param name="value">The value to clip; a NaN stays NaN.</param> /// <param name="low">The lower endpoint of the allowed range.</param> /// <param name="high">The upper endpoint of the allowed range.</param> - /// <returns>The value bounded by the supplied interval endpoints.</returns> + /// <returns>The value when inside the range or on its edge, else the bound it crossed.</returns> + /// <remarks> + /// The former <c>Math.Min(Math.Max(value, low), high)</c> turned <c>-0.0</c> on a <c>+0.0</c> bound into + /// <c>+0.0</c> and back (QA-30's class). + /// </remarks> private static double MathUtilClip(double value, double low, double high) - => Math.Min(Math.Max(value, low), high); + => MathUtil.Clip(value, low, high); } diff --git a/src/OptunaSharp.Core/Importance/BaseImportanceEvaluator.cs b/src/OptunaSharp.Core/Importance/BaseImportanceEvaluator.cs index bb8c8e4..881e047 100644 --- a/src/OptunaSharp.Core/Importance/BaseImportanceEvaluator.cs +++ b/src/OptunaSharp.Core/Importance/BaseImportanceEvaluator.cs @@ -89,7 +89,7 @@ internal static OrderedDict<string, BaseDistribution> GetDistributions( OrderedDict<string, BaseDistribution>? distributions = null; foreach (var trial in completedTrials) { - var trialDistributions = trial.DistributionsDict; + var trialDistributions = trial.Distributions; if (!@params.All(name => trialDistributions.ContainsKey(name))) continue; @@ -131,7 +131,7 @@ internal static void CheckEvaluateArgs( if (@params is not null && @params.Count > 0) { bool atLeastOneTrial = completedTrials.Any( - trial => @params.All(p => trial.DistributionsDict.ContainsKey(p))); + trial => @params.All(p => trial.Distributions.ContainsKey(p))); if (!atLeastOneTrial) throw new ValueError( "Study must contain completed trials with all specified parameters. " + diff --git a/src/OptunaSharp.Core/Importance/Forests/FanovaTree.cs b/src/OptunaSharp.Core/Importance/Forests/FanovaTree.cs index c2a85d4..3619e5b 100644 --- a/src/OptunaSharp.Core/Importance/Forests/FanovaTree.cs +++ b/src/OptunaSharp.Core/Importance/Forests/FanovaTree.cs @@ -411,7 +411,11 @@ private double[][] ComputeFeaturesSplitValues() internal double[,] GetNodeRightChildSubspaces(int nodeIndex, double[,] searchSpaces) => GetSubspaces(searchSpaces, searchSpacesColumn: 0, nodeIndex); - /// <summary>Port of <c>_get_cardinality(search_spaces) = np.prod(hi - lo)</c>.</summary> + /// <summary> + /// Port of <c>_get_cardinality(search_spaces) = np.prod(hi - lo)</c>: NumPy's sequential <c>multiply.reduce</c>, + /// which NumSharp 0.81.0's float <c>np.prod</c> also follows (pinned by <c>SequentialProductTests</c>); a loop because + /// it runs once per tree node. + /// </summary> /// <param name="searchSpaces">The lower and upper bound of each encoded feature, with shape (features, 2).</param> /// <returns>The product of interval widths, representing the subspace volume.</returns> private static double GetCardinality(double[,] searchSpaces) diff --git a/src/OptunaSharp.Core/Importance/PedAnova/PedAnovaImportanceEvaluator.cs b/src/OptunaSharp.Core/Importance/PedAnova/PedAnovaImportanceEvaluator.cs index 8f3517a..8cd890b 100644 --- a/src/OptunaSharp.Core/Importance/PedAnova/PedAnovaImportanceEvaluator.cs +++ b/src/OptunaSharp.Core/Importance/PedAnova/PedAnovaImportanceEvaluator.cs @@ -139,6 +139,12 @@ private List<FrozenTrial> GetTopQuantileTrials( /// <param name="targetTrials">The trials defining the better-performing region whose density is compared.</param> /// <param name="regionTrials">The trials defining the reference region for density estimation.</param> /// <returns>The Pearson divergence between the better-performing and reference parameter densities.</returns> + /// <remarks> + /// The final product and the Scott's-rule moments of <see cref="ScottParzenEstimatorFunctions" /> take NumPy's + /// BLAS order through <see cref="LinAlg.Dot(double[], double[])" />; they used to be left-to-right sums, which + /// agreed with Optuna end to end on the studies checked but not operation by operation. The densities themselves + /// run through the truncated normal's erf, so the divergence stays within the documented erf tolerance of Optuna's. + /// </remarks> private double ComputePearsonDivergence( string paramName, BaseDistribution dist, IReadOnlyList<FrozenTrial> targetTrials, IReadOnlyList<FrozenTrial> regionTrials) @@ -170,14 +176,16 @@ private double ComputePearsonDivergence( pdfLocal[g] = 1.0 / gridSize; } - // float(pdf_local @ ((pdf_top / pdf_local - 1) ** 2)), sequential dot (bit-exact vs @). - double sum = 0.0; + // float(pdf_local @ ((pdf_top / pdf_local - 1) ** 2)): the elementwise part is exact as NumPy's (an array ** 2 + // is a multiplication), and the 1-D @ is BLAS ddot, so it goes through NumSharp's np.dot to accumulate in + // Optuna's order; a left-to-right sum rounds differently once the grid has more than a few points. + var squaredRatio = new double[gridSize]; for (int g = 0; g < gridSize; g++) { double r = pdfTop[g] / pdfLocal[g] - 1.0; - sum += pdfLocal[g] * (r * r); + squaredRatio[g] = r * r; } - return sum; + return LinAlg.Dot(pdfLocal, squaredRatio); } /// <inheritdoc /> @@ -272,7 +280,7 @@ private static OrderedDict<string, double> ZeroImportances(IReadOnlyList<string> var regimeTrials = new List<(BaseDistribution? Dist, List<FrozenTrial> Trials)>(); foreach (var trial in trials) { - BaseDistribution? key = trial.DistributionsDict.TryGetValue(paramName, out var d) ? d : null; + BaseDistribution? key = trial.Distributions.TryGetValue(paramName, out var d) ? d : null; int found = -1; for (int i = 0; i < regimeTrials.Count; i++) { @@ -325,7 +333,7 @@ private static List<string> ResolveParams(Study study, IReadOnlyList<string>? @p var allParams = new List<string>(); foreach (var trial in trials) { - foreach (var name in trial.DistributionsDict.Keys) + foreach (var name in trial.Distributions.Keys) { if (seen.Add(name)) allParams.Add(name); diff --git a/src/OptunaSharp.Core/Importance/PedAnova/ScottParzenEstimator.cs b/src/OptunaSharp.Core/Importance/PedAnova/ScottParzenEstimator.cs index 1c7ffa6..6bba5d6 100644 --- a/src/OptunaSharp.Core/Importance/PedAnova/ScottParzenEstimator.cs +++ b/src/OptunaSharp.Core/Importance/PedAnova/ScottParzenEstimator.cs @@ -126,11 +126,14 @@ private static BatchedDistributions CalculateNumericalDistributions( high = Math.Log(high); } - double meanEst = SeqDot(obs, weights) / weightsSum; + // observations @ weights and (observations - mean_est) ** 2 @ weights are NumPy 1-D products (BLAS ddot once + // either side is float64), so they go through NumSharp's np.dot to round as Optuna's do. With integer-valued + // observations (no log) Optuna's first product is int64 @ int64, exact; so is ddot on those doubles below 2^53. + double meanEst = LinAlg.Dot(obs, weights) / weightsSum; var dev = new double[obs.Length]; for (int i = 0; i < obs.Length; i++) dev[i] = (obs[i] - meanEst) * (obs[i] - meanEst); - double sigmaEst = Math.Sqrt(SeqDot(dev, weights) / Math.Max(1, weightsSum - 1)); + double sigmaEst = Math.Sqrt(LinAlg.Dot(dev, weights) / Math.Max(1, weightsSum - 1)); int q1Idx = BisectLeft(weightsCum, Math.Floor(weightsSum / 4.0)); int q3Idx = BisectRight(weightsCum, Math.Floor(weightsSum * 3.0 / 4.0)); @@ -167,18 +170,6 @@ internal double[] Pdf(double[] samples) return result; } - /// <summary>Sequential (left-to-right) dot product — bit-exact vs NumPy's <c>@</c> for PED-ANOVA.</summary> - /// <param name="a">The first numerical operand; its dimensions must agree with the operation described in the summary.</param> - /// <param name="b">The second numerical operand; its dimensions must agree with the first operand.</param> - /// <returns>The scalar dot product accumulated sequentially in input order.</returns> - private static double SeqDot(double[] a, double[] b) - { - double sum = 0.0; - for (int i = 0; i < a.Length; i++) - sum += a[i] * b[i]; - return sum; - } - /// <summary>NumPy <c>searchsorted(a, v, side="left")</c> for an ascending array (bisect left).</summary> /// <param name="a">The first numerical operand; its dimensions must agree with the operation described in the summary.</param> /// <param name="v">The values used by the numerical reduction or transformation.</param> @@ -274,7 +265,7 @@ internal static long[] CountNumericalParamInGrid( var paramValues = new double[trials.Count]; for (int t = 0; t < trials.Count; t++) { - PyFloat.TryConvert(trials[t].ParamsDict[paramName], out double v); + PyFloat.TryConvert(trials[t].Params[paramName], out double v); paramValues[t] = log ? Math.Log(v) : v; } @@ -320,7 +311,7 @@ internal static long[] CountCategoricalParamInGrid( var counts = new long[dist.Choices.Count]; foreach (var trial in trials) { - int index = (int)dist.ToInternalRepr(trial.ParamsDict[paramName]); + int index = (int)dist.ToInternalRepr(trial.Params[paramName]); counts[index] += 1; } return counts; diff --git a/src/OptunaSharp.Core/Integration/OptunaSearchCV.cs b/src/OptunaSharp.Core/Integration/OptunaSearchCV.cs index d3d393e..77f958c 100644 --- a/src/OptunaSharp.Core/Integration/OptunaSearchCV.cs +++ b/src/OptunaSharp.Core/Integration/OptunaSearchCV.cs @@ -83,7 +83,8 @@ public class OptunaSearchCV /// Time limit in seconds for the search. If <c>null</c>, the search runs without a time limit. /// </param> /// <param name="nJobs"> - /// Number of parallel jobs. <c>null</c> means <c>1</c>; <c>-1</c> means the CPU count. + /// Number of parallel jobs. <c>null</c> and <c>0</c> mean <c>1</c> (optuna-integration's + /// <c>n_jobs if n_jobs else 1</c>: 0 is falsy); <c>-1</c> means the CPU count. /// </param> /// <param name="randomState"> /// Seed for the pseudo-random number generator used to derive the default sampler's seed. If @@ -127,7 +128,9 @@ public OptunaSearchCV( _paramDistributions = paramDistributions ?? throw new ArgumentNullException(nameof(paramDistributions)); _nTrials = nTrials; _timeout = timeout; - _nJobs = nJobs ?? 1; + // optuna-integration stores `n_jobs if n_jobs else 1`, so 0 (falsy) runs sequentially like None; mapping only + // null let 0 reach Study.Optimize, which refuses it ("max_workers must be greater than 0", QA-81). + _nJobs = nJobs is null or 0 ? 1 : nJobs.Value; _randomState = randomState; _refit = refit; _returnTrainScore = returnTrainScore; diff --git a/src/OptunaSharp.Core/Internal/CompactTrialParts.cs b/src/OptunaSharp.Core/Internal/CompactTrialParts.cs new file mode 100644 index 0000000..cc9c22b --- /dev/null +++ b/src/OptunaSharp.Core/Internal/CompactTrialParts.cs @@ -0,0 +1,963 @@ +using System; +using System.Collections; +using System.Collections.Generic; +using System.Collections.ObjectModel; +using System.Runtime.CompilerServices; +using System.Text; +using System.Threading; +using OptunaSharp.Collections; +using OptunaSharp.Distributions; + +namespace OptunaSharp.Internal; + +/// <summary> +/// A finished trial's dictionary held in a compact form (Rustuna plan 13, item S12): readable in place through +/// <see cref="IReadOnlyDictionary{TKey,TValue}" />, and turned back into the <see cref="OrderedDict{TKey,TValue}" /> +/// it was built from when a caller asks a <see cref="FrozenTrial" /> for its mutable dictionary. +/// </summary> +/// <typeparam name="TKey">The dictionary's key type.</typeparam> +/// <typeparam name="TValue">The dictionary's value type.</typeparam> +/// <remarks> +/// Only <see cref="Storages.InMemoryStorage" /> built with <c>compactFinishedTrials: true</c> produces these. Every +/// implementation is immutable after construction, so any number of threads may read one, and a trial may share one +/// with its <see cref="FrozenTrial.ShallowCopy" /> or with every other trial of the same parameter schema. +/// </remarks> +internal interface ICompactDictionary<TKey, TValue> : IReadOnlyDictionary<TKey, TValue> + where TKey : notnull +{ + /// <summary>A new dictionary holding the same entries in the same order, owned by the caller.</summary> + /// <returns>A fresh <see cref="OrderedDict{TKey,TValue}" /> sized to the entry count.</returns> + /// <remarks> + /// Values are rebuilt the way a read rebuilds them: a parameter's external value is a new box with the stored + /// bits, a compacted string a new string with the stored characters. Equal to the original entries, not the same + /// objects; nested containers in attributes are the same objects. + /// </remarks> + OrderedDict<TKey, TValue> Materialize(); +} + +/// <summary> +/// The read-only dictionary surface every compact form shares: lookups, ordered enumeration, and the non-generic +/// <see cref="IDictionary" /> that <see cref="PythonRepr" /> and <see cref="PyJson" /> recognize as a Python dict. +/// </summary> +/// <typeparam name="TKey">The dictionary's key type.</typeparam> +/// <typeparam name="TValue">The dictionary's value type.</typeparam> +/// <remarks> +/// <para> +/// Mutation through <see cref="IDictionary" /> throws <see cref="NotSupportedException" />, which is the point: +/// a caller that wants to change a compact trial must go through the trial's <c>…Dict</c> accessor, which +/// replaces the compact form with a real dictionary first, so the change is kept. A cast to +/// <see cref="OrderedDict{TKey,TValue}" /> fails instead of writing into a copy that would be thrown away. +/// </para> +/// <para> +/// Entries enumerate in the order the source dictionary held them, which is what Optuna's insertion-ordered +/// dicts promise. +/// </para> +/// </remarks> +internal abstract class CompactDictionaryView<TKey, TValue> : ICompactDictionary<TKey, TValue>, IDictionary + where TKey : notnull +{ + /// <summary>Number of entries.</summary> + public abstract int Count { get; } + + /// <summary>The key at an enumeration position.</summary> + /// <param name="index">Position in <c>[0, Count)</c>.</param> + /// <returns>The key stored at that position.</returns> + protected abstract TKey KeyAt(int index); + + /// <summary>The value at an enumeration position, rebuilt from the compact form if it is stored compactly.</summary> + /// <param name="index">Position in <c>[0, Count)</c>.</param> + /// <returns>The value a reader of the original dictionary would have seen, possibly as a new object.</returns> + protected abstract TValue ValueAt(int index); + + /// <summary>The position of a key, or -1 when the dictionary does not hold it.</summary> + /// <param name="key">Key to find, compared ordinally like the source dictionary's default comparer.</param> + /// <returns>The position in <c>[0, Count)</c>, or -1.</returns> + protected abstract int IndexOf(TKey key); + + /// <summary>The value stored under <paramref name="key" />.</summary> + /// <param name="key">Key to look up.</param> + /// <returns>The value a reader of the original dictionary would get, rebuilt if it is stored compactly.</returns> + /// <exception cref="ArgumentNullException"><paramref name="key" /> is null.</exception> + /// <exception cref="KeyNotFoundException">The dictionary does not hold <paramref name="key" />; the message is the BCL dictionaries' own.</exception> + public TValue this[TKey key] + { + get + { + ArgumentNullException.ThrowIfNull(key); + int index = IndexOf(key); + if (index < 0) + throw new KeyNotFoundException($"The given key '{key}' was not present in the dictionary."); + return ValueAt(index); + } + } + + /// <summary>The keys in enumeration order.</summary> + public virtual IEnumerable<TKey> Keys + { + get + { + for (int i = 0; i < Count; i++) + yield return KeyAt(i); + } + } + + /// <summary>The values in enumeration order, each rebuilt as <see cref="ValueAt" /> rebuilds it.</summary> + public IEnumerable<TValue> Values + { + get + { + for (int i = 0; i < Count; i++) + yield return ValueAt(i); + } + } + + /// <summary>Whether the dictionary holds <paramref name="key" />.</summary> + /// <param name="key">Key to look up.</param> + /// <returns>True when the key is present.</returns> + /// <exception cref="ArgumentNullException"><paramref name="key" /> is null.</exception> + public bool ContainsKey(TKey key) + { + ArgumentNullException.ThrowIfNull(key); + return IndexOf(key) >= 0; + } + + /// <summary>Looks up <paramref name="key" /> without throwing when it is absent.</summary> + /// <param name="key">Key to look up.</param> + /// <param name="value">The value when present, otherwise the type's default.</param> + /// <returns>True when the key is present.</returns> + /// <exception cref="ArgumentNullException"><paramref name="key" /> is null.</exception> + public bool TryGetValue(TKey key, out TValue value) + { + ArgumentNullException.ThrowIfNull(key); + int index = IndexOf(key); + if (index < 0) + { + value = default!; + return false; + } + value = ValueAt(index); + return true; + } + + /// <summary>Enumerates the entries in order, rebuilding each value as it is reached.</summary> + /// <returns>An enumerator over key/value pairs.</returns> + public IEnumerator<KeyValuePair<TKey, TValue>> GetEnumerator() + { + for (int i = 0; i < Count; i++) + yield return new KeyValuePair<TKey, TValue>(KeyAt(i), ValueAt(i)); + } + + /// <summary>Enumerates the entries in order.</summary> + /// <returns>An enumerator over key/value pairs.</returns> + IEnumerator IEnumerable.GetEnumerator() => GetEnumerator(); + + /// <inheritdoc /> + public OrderedDict<TKey, TValue> Materialize() + { + var dictionary = new OrderedDict<TKey, TValue>(Count); + for (int i = 0; i < Count; i++) + dictionary.Add(KeyAt(i), ValueAt(i)); + return dictionary; + } + + // ------------------------------------------------------------------ IDictionary (read-only) + + /// <summary>Always true: no entry can be added or removed.</summary> + bool IDictionary.IsFixedSize => true; + + /// <summary>Always true: see the class remarks for how to change a compact trial.</summary> + bool IDictionary.IsReadOnly => true; + + /// <summary>A snapshot array of the keys in enumeration order.</summary> + ICollection IDictionary.Keys + { + get + { + var keys = new TKey[Count]; + for (int i = 0; i < keys.Length; i++) + keys[i] = KeyAt(i); + return keys; + } + } + + /// <summary>A snapshot array of the values in enumeration order.</summary> + ICollection IDictionary.Values + { + get + { + var values = new TValue[Count]; + for (int i = 0; i < values.Length; i++) + values[i] = ValueAt(i); + return values; + } + } + + /// <summary>The value under a key, or null when absent or of another key type (the non-generic contract).</summary> + /// <param name="key">Key to look up.</param> + /// <returns>The value, rebuilt if stored compactly, or null.</returns> + /// <exception cref="ArgumentNullException"><paramref name="key" /> is null.</exception> + /// <exception cref="NotSupportedException">On set: the dictionary is read-only.</exception> + object? IDictionary.this[object key] + { + get + { + ArgumentNullException.ThrowIfNull(key); + if (key is TKey typed) + { + int index = IndexOf(typed); + if (index >= 0) + return ValueAt(index); + } + return null; + } + set => throw ReadOnly(); + } + + /// <summary>Not supported: the dictionary is read-only.</summary> + /// <param name="key">Ignored.</param> + /// <param name="value">Ignored.</param> + /// <exception cref="NotSupportedException">Always.</exception> + void IDictionary.Add(object key, object? value) => throw ReadOnly(); + + /// <summary>Not supported: the dictionary is read-only.</summary> + /// <exception cref="NotSupportedException">Always.</exception> + void IDictionary.Clear() => throw ReadOnly(); + + /// <summary>Whether a key of the dictionary's key type is present.</summary> + /// <param name="key">Key to look up.</param> + /// <returns>True when present.</returns> + /// <exception cref="ArgumentNullException"><paramref name="key" /> is null.</exception> + bool IDictionary.Contains(object key) + { + ArgumentNullException.ThrowIfNull(key); + return key is TKey typed && IndexOf(typed) >= 0; + } + + /// <summary>A non-generic enumerator yielding <see cref="DictionaryEntry" /> values in order.</summary> + /// <returns>The enumerator.</returns> + IDictionaryEnumerator IDictionary.GetEnumerator() => new EntryEnumerator(this); + + /// <summary>Not supported: the dictionary is read-only.</summary> + /// <param name="key">Ignored.</param> + /// <exception cref="NotSupportedException">Always.</exception> + void IDictionary.Remove(object key) => throw ReadOnly(); + + /// <summary>Copies the entries, as key/value pairs or <see cref="DictionaryEntry" /> values, into an array.</summary> + /// <param name="array">A one-dimensional array of <see cref="KeyValuePair{TKey,TValue}" />, <see cref="DictionaryEntry" /> or <see cref="object" />.</param> + /// <param name="index">First position written.</param> + /// <exception cref="ArgumentNullException"><paramref name="array" /> is null.</exception> + /// <exception cref="ArgumentOutOfRangeException"><paramref name="index" /> is negative.</exception> + /// <exception cref="ArgumentException">The array is too short or of an element type that cannot hold an entry.</exception> + void ICollection.CopyTo(Array array, int index) + { + ArgumentNullException.ThrowIfNull(array); + ArgumentOutOfRangeException.ThrowIfNegative(index); + if (array.Length - index < Count) + throw new ArgumentException("Destination array is not long enough to copy all the items in the collection."); + switch (array) + { + case KeyValuePair<TKey, TValue>[] pairs: + for (int i = 0; i < Count; i++) + pairs[index + i] = new KeyValuePair<TKey, TValue>(KeyAt(i), ValueAt(i)); + return; + case DictionaryEntry[] entries: + for (int i = 0; i < Count; i++) + entries[index + i] = new DictionaryEntry(KeyAt(i), ValueAt(i)); + return; + case object?[] objects: + for (int i = 0; i < Count; i++) + objects[index + i] = new KeyValuePair<TKey, TValue>(KeyAt(i), ValueAt(i)); + return; + default: + throw new ArgumentException("Target array type is not compatible with the type of items in the collection."); + } + } + + /// <summary>The entry count.</summary> + int ICollection.Count => Count; + + /// <summary>False: reads need no synchronization because the view never changes.</summary> + bool ICollection.IsSynchronized => false; + + /// <summary>This view itself.</summary> + object ICollection.SyncRoot => this; + + /// <summary>The exception every mutation through <see cref="IDictionary" /> throws.</summary> + /// <returns>A <see cref="NotSupportedException" /> naming the way to change a compact trial.</returns> + private static NotSupportedException ReadOnly() + => new("This dictionary is a finished trial's compact form and is read-only; change the trial through its " + + "ParamsDict / DistributionsDict / UserAttrsDict / SystemAttrsDict accessor instead."); + + /// <summary>The non-generic enumerator over a view, in entry order.</summary> + private sealed class EntryEnumerator : IDictionaryEnumerator + { + private readonly CompactDictionaryView<TKey, TValue> _view; + private int _index = -1; + private DictionaryEntry _current; + + /// <summary>Starts before the first entry of <paramref name="view" />.</summary> + /// <param name="view">The view to enumerate.</param> + internal EntryEnumerator(CompactDictionaryView<TKey, TValue> view) => _view = view; + + /// <summary>The current entry.</summary> + public DictionaryEntry Entry => _current; + + /// <summary>The current key.</summary> + public object Key => _current.Key; + + /// <summary>The current value.</summary> + public object? Value => _current.Value; + + /// <summary>The current entry, boxed.</summary> + public object Current => _current; + + /// <summary>Advances to the next entry.</summary> + /// <returns>False past the last entry.</returns> + public bool MoveNext() + { + if (_index + 1 >= _view.Count) + { + _index = _view.Count; + return false; + } + _index++; + _current = new DictionaryEntry(_view.KeyAt(_index), _view.ValueAt(_index)); + return true; + } + + /// <summary>Returns to the position before the first entry.</summary> + public void Reset() + { + _index = -1; + _current = default; + } + } +} + +/// <summary> +/// The ordered parameter names and distribution instances that many finished trials of a study share (plan 13, item +/// S12): a compact trial stores only its internal values against one of these. +/// </summary> +/// <remarks> +/// Immutable, so trials and threads share it freely. Two trials share a schema only when their parameter names come +/// in the same order and their distributions are the same instances; <see cref="Storages.InMemoryStorage" /> already +/// shares bitwise-identical distributions within a study (plan 13, item S7), so a static search space yields one +/// schema for the whole study. +/// </remarks> +internal sealed class ParamSchema +{ + private readonly Dictionary<string, int> _index; + + /// <summary>Builds a schema from parallel arrays, which it keeps (the caller hands over ownership).</summary> + /// <param name="names">Parameter names in the trials' order; never changed after this call.</param> + /// <param name="distributions">The distribution instance of each name, in the same order.</param> + internal ParamSchema(string[] names, BaseDistribution[] distributions) + { + Names = names; + Distributions = distributions; + _index = new Dictionary<string, int>(names.Length); + for (int i = 0; i < names.Length; i++) + _index[names[i]] = i; + ReadOnlyNames = new ReadOnlyCollection<string>(names); + View = new DistributionsView(this); + } + + /// <summary>The parameter names in order. Not to be changed: every trial of the schema reads it.</summary> + internal string[] Names { get; } + + /// <summary>The distribution of each name, in order. Not to be changed, as <see cref="Names" />.</summary> + internal BaseDistribution[] Distributions { get; } + + /// <summary>The names wrapped read-only, handed out as a view's <c>Keys</c> so no caller can change the array.</summary> + internal ReadOnlyCollection<string> ReadOnlyNames { get; } + + /// <summary>The one read-only distributions dictionary every trial of this schema returns from <c>Distributions</c>.</summary> + internal DistributionsView View { get; } + + /// <summary>The position of a parameter name, or -1.</summary> + /// <param name="name">Parameter name, compared ordinally like the trials' dictionaries.</param> + /// <returns>Its position, or -1 when the schema does not hold it.</returns> + internal int IndexOf(string name) => _index.TryGetValue(name, out int index) ? index : -1; + + /// <summary>Marks, in <see cref="PositionsFor" />, a parameter the schema does not hold.</summary> + internal const int Absent = -1; + + /// <summary> + /// Marks, in <see cref="PositionsFor" />, a parameter the schema holds under a distribution that may convert + /// values differently from the reader's, so only rebuilding the external value is exact. + /// </summary> + internal const int NotInterchangeable = -2; + + /// <summary> + /// For each parameter a reader converts with its own distribution, where a compact trial of this schema stores a + /// value that is exactly what that conversion would return (plan 13, item S12). + /// </summary> + /// <param name="names">The parameters the reader wants, in its order.</param> + /// <param name="distributions">The distribution the reader converts each one with, in the same order.</param> + /// <returns> + /// Per parameter: its position in the schema when the reader's distribution is interchangeable with the schema's + /// (<see cref="DistributionIdentity.AreInterchangeable" />), so <see cref="CompactParams.InternalAt" /> equals + /// <c>distribution.ToInternalRepr(Params[name])</c>; <see cref="Absent" /> when the schema lacks it; + /// <see cref="NotInterchangeable" /> otherwise. + /// </returns> + /// <remarks> + /// Why the stored value is exact: compaction keeps <c>internal = d.ToInternalRepr(stored)</c> only when + /// <c>d.ToExternalRepr(internal)</c> is indistinguishable from <c>stored</c>, and an interchangeable distribution + /// converts every value as <c>d</c> does, so it maps the rebuilt external value back to that same internal. + /// </remarks> + internal int[] PositionsFor(string[] names, BaseDistribution[] distributions) + { + var positions = new int[names.Length]; + for (int i = 0; i < names.Length; i++) + { + int position = IndexOf(names[i]); + positions[i] = position < 0 + ? Absent + : DistributionIdentity.AreInterchangeable(distributions[i], Distributions[position]) + ? position + : NotInterchangeable; + } + return positions; + } + + /// <summary> + /// Whether a trial's dictionaries have this schema: the same names in the same order in both, and distributions + /// interchangeable with the schema's (<see cref="DistributionIdentity.AreInterchangeable" />). + /// </summary> + /// <param name="params">The trial's parameter dictionary.</param> + /// <param name="distributions">The trial's distribution dictionary.</param> + /// <returns>True when the trial can store its values against this schema.</returns> + internal bool Matches(OrderedDict<string, object?> @params, OrderedDict<string, BaseDistribution> distributions) + { + if (@params.Count != Names.Length || distributions.Count != Names.Length) + return false; + for (int i = 0; i < Names.Length; i++) + { + KeyValuePair<string, BaseDistribution> entry = distributions.GetAt(i); + if (!string.Equals(entry.Key, Names[i], StringComparison.Ordinal) + || !string.Equals(@params.GetAt(i).Key, Names[i], StringComparison.Ordinal) + || !DistributionIdentity.AreInterchangeable(entry.Value, Distributions[i])) + return false; + } + return true; + } + + /// <summary> + /// The hash a <see cref="ParamSchemaCache" /> files a schema under: names by value and distributions by + /// <see cref="DistributionIdentity.HashOf" />, in order. + /// </summary> + /// <param name="distributions">A trial's distribution dictionary.</param> + /// <returns>A hash consistent with <see cref="Matches" />: trials that match one schema hash alike.</returns> + internal static int HashOf(OrderedDict<string, BaseDistribution> distributions) + { + var hash = new HashCode(); + hash.Add(distributions.Count); + for (int i = 0; i < distributions.Count; i++) + { + KeyValuePair<string, BaseDistribution> entry = distributions.GetAt(i); + hash.Add(entry.Key, StringComparer.Ordinal); + hash.Add(DistributionIdentity.HashOf(entry.Value)); + } + return hash.ToHashCode(); + } +} + +/// <summary> +/// When two distribution objects can stand for each other in a compact trial (plan 13, item S12): no read can tell +/// them apart except by asking whether they are the same object. +/// </summary> +/// <remarks> +/// <para> +/// Float and integer distributions follow <see cref="Distribution.IsBitwiseIdentical" />, the rule the storage +/// already shares instances by (plan 13, item S7). A plain <see cref="CategoricalDistribution" /> qualifies when +/// its choices are identical one by one (<see cref="IsSameValue" />): every <c>SuggestCategorical</c> call builds +/// a new distribution, so without this a categorical parameter would give every trial a schema of its own. Python-equal choices that +/// print differently (<c>1</c> and <c>1.0</c>) are not identical. +/// </para> +/// <para> +/// Anything else (a subclass of the categorical distribution, a custom distribution) must be the same instance. +/// </para> +/// </remarks> +internal static class DistributionIdentity +{ + /// <summary>Whether <paramref name="a" /> can be returned where a trial stored <paramref name="b" />, and the other way round.</summary> + /// <param name="a">One distribution.</param> + /// <param name="b">The other.</param> + /// <returns>True for the same instance or indistinguishable ones (see the class remarks).</returns> + internal static bool AreInterchangeable(BaseDistribution a, BaseDistribution b) + { + if (ReferenceEquals(a, b) || Distribution.IsBitwiseIdentical(a, b)) + return true; + if (a.GetType() != typeof(CategoricalDistribution) || b.GetType() != typeof(CategoricalDistribution)) + return false; + IReadOnlyList<CategoricalChoice> choicesA = ((CategoricalDistribution)a).Choices; + IReadOnlyList<CategoricalChoice> choicesB = ((CategoricalDistribution)b).Choices; + if (choicesA.Count != choicesB.Count) + return false; + for (int i = 0; i < choicesA.Count; i++) + if (!IsSameValue(choicesA[i].Value, choicesB[i].Value)) + return false; + return true; + } + + /// <summary>A hash consistent with <see cref="AreInterchangeable" />: interchangeable distributions hash alike.</summary> + /// <param name="distribution">The distribution to hash.</param> + /// <returns>Its field-wise hash for the kinds compared by content, its identity hash otherwise.</returns> + internal static int HashOf(BaseDistribution distribution) + { + switch (distribution) + { + case FloatDistribution f: + return HashCode.Combine(f.GetType(), BitConverter.DoubleToInt64Bits(f.Low), + BitConverter.DoubleToInt64Bits(f.High), f.Step is null ? 0L : BitConverter.DoubleToInt64Bits(f.Step.Value), + f.Log); + case IntDistribution i: + return HashCode.Combine(i.GetType(), i.Low, i.High, i.Step, i.Log); + case CategoricalDistribution c when c.GetType() == typeof(CategoricalDistribution): + var hash = new HashCode(); + hash.Add(c.Choices.Count); + foreach (CategoricalChoice choice in c.Choices) + hash.Add(ValueHash(choice.Value)); + return hash.ToHashCode(); + default: + return RuntimeHelpers.GetHashCode(distribution); + } + } + + /// <summary> + /// Whether two values are indistinguishable except by object identity: the same object, or values of the same + /// type with the same bits (floating point), the same number (integers), the same truth value, or the same + /// characters (strings). + /// </summary> + /// <param name="a">One value.</param> + /// <param name="b">The other.</param> + /// <returns>True when a reader comparing anything but references sees one value.</returns> + /// <remarks> + /// Bits, not <c>==</c>, for floating point: -0.0 and 0.0 are equal but print differently. Any other kind of + /// object (a decimal, whose <c>1.0m</c> and <c>1.00m</c> are equal but print differently, a list, a user type) + /// must be the same instance. + /// </remarks> + internal static bool IsSameValue(object? a, object? b) + { + if (ReferenceEquals(a, b)) + return true; + if (a is null || b is null || a.GetType() != b.GetType()) + return false; + return a switch + { + double x => BitConverter.DoubleToInt64Bits(x) == BitConverter.DoubleToInt64Bits((double)b), + float x => BitConverter.SingleToInt32Bits(x) == BitConverter.SingleToInt32Bits((float)b), + string x => string.Equals(x, (string)b, StringComparison.Ordinal), + long or int or short or sbyte or byte or ulong or uint or ushort or bool or char => a.Equals(b), + _ => false, + }; + } + + /// <summary>A hash consistent with <see cref="IsSameValue" />.</summary> + /// <param name="value">The value to hash.</param> + /// <returns>A content hash for the kinds compared by content, an identity hash otherwise.</returns> + private static int ValueHash(object? value) => value switch + { + null => 0, + double x => HashCode.Combine(typeof(double), BitConverter.DoubleToInt64Bits(x)), + float x => HashCode.Combine(typeof(float), BitConverter.SingleToInt32Bits(x)), + string x => HashCode.Combine(typeof(string), StringComparer.Ordinal.GetHashCode(x)), + long or int or short or sbyte or byte or ulong or uint or ushort or bool or char + => HashCode.Combine(value.GetType(), value.GetHashCode()), + _ => RuntimeHelpers.GetHashCode(value), + }; +} + +/// <summary> +/// A study's parameter schemas (plan 13, item S12), found or created as its trials finish. Not thread-safe: +/// <see cref="Storages.InMemoryStorage" /> uses it under its lock. +/// </summary> +/// <remarks> +/// A static search space hits <see cref="FindOrAdd" />'s last-schema check every time, which costs one pass over the +/// names. A dynamic one keeps one schema per distinct shape up to <see cref="MaxSchemas" />; trials of further +/// shapes keep their dictionaries, which only forgoes the memory saving. +/// </remarks> +internal sealed class ParamSchemaCache +{ + /// <summary>The most schemas one study keeps; enough for conditional spaces, bounded for pathological ones.</summary> + internal const int MaxSchemas = 256; + + private readonly Dictionary<int, List<ParamSchema>> _byHash = new(); + private ParamSchema? _last; + + /// <summary>How many schemas the study has; a diagnostic for tests.</summary> + internal int Count { get; private set; } + + /// <summary> + /// The schema a finished trial's dictionaries have, created on first sight, or null when the trial cannot use + /// one. + /// </summary> + /// <param name="params">The trial's parameter dictionary.</param> + /// <param name="distributions">The trial's distribution dictionary.</param> + /// <returns> + /// The matching schema, or null when the two dictionaries do not hold the same names in the same order (a trial + /// added from a template may list them differently) or the study already has <see cref="MaxSchemas" />. + /// </returns> + internal ParamSchema? FindOrAdd(OrderedDict<string, object?> @params, OrderedDict<string, BaseDistribution> distributions) + { + if (_last is not null && _last.Matches(@params, distributions)) + return _last; + if (@params.Count != distributions.Count) + return null; + + int hash = ParamSchema.HashOf(distributions); + if (_byHash.TryGetValue(hash, out List<ParamSchema>? candidates)) + { + foreach (ParamSchema candidate in candidates) + { + if (candidate.Matches(@params, distributions)) + return _last = candidate; + } + } + + // A new shape: the parameter names must come in the distributions' order, or one schema cannot rebuild both. + int n = distributions.Count; + var names = new string[n]; + var instances = new BaseDistribution[n]; + for (int i = 0; i < n; i++) + { + KeyValuePair<string, BaseDistribution> entry = distributions.GetAt(i); + if (!string.Equals(@params.GetAt(i).Key, entry.Key, StringComparison.Ordinal)) + return null; + names[i] = entry.Key; + instances[i] = entry.Value; + } + if (Count >= MaxSchemas) + return null; + + var schema = new ParamSchema(names, instances); + if (candidates is null) + _byHash[hash] = candidates = new List<ParamSchema>(1); + candidates.Add(schema); + Count++; + return _last = schema; + } +} + +/// <summary> +/// A compact trial's parameters (plan 13, item S12): one internal-representation value per name of a shared +/// <see cref="ParamSchema" />, read back through each distribution's <c>ToExternalRepr</c>. +/// </summary> +/// <remarks> +/// <see cref="TryCreate" /> accepts a trial only when every stored value comes back indistinguishable from its +/// internal form (<see cref="DistributionIdentity.IsSameValue" />: same type and bits for numbers, same characters for +/// strings, the same object otherwise), so a read returns what the trial stored; anything else keeps its dictionary. +/// A read of a numeric value allocates a new box each time. +/// </remarks> +internal sealed class CompactParams : CompactDictionaryView<string, object?> +{ + private readonly double[] _internals; + + /// <summary>Wraps values already verified by <see cref="TryCreate" />.</summary> + /// <param name="schema">The shared names and distributions.</param> + /// <param name="internals">One internal value per schema entry; owned by this object from now on.</param> + private CompactParams(ParamSchema schema, double[] internals) + { + Schema = schema; + _internals = internals; + } + + /// <summary>The shared names and distributions the values are stored against.</summary> + internal ParamSchema Schema { get; } + + /// <inheritdoc /> + public override int Count => _internals.Length; + + /// <summary>The schema's names, read-only.</summary> + public override IEnumerable<string> Keys => Schema.ReadOnlyNames; + + /// <inheritdoc /> + protected override string KeyAt(int index) => Schema.Names[index]; + + /// <inheritdoc /> + protected override object? ValueAt(int index) => Schema.Distributions[index].ToExternalRepr(_internals[index]); + + /// <inheritdoc /> + protected override int IndexOf(string key) => Schema.IndexOf(key); + + /// <summary> + /// The stored internal value at a schema position, without rebuilding the external value: what + /// <c>d.ToInternalRepr(Params[name])</c> returns for the schema's distribution <c>d</c> or any distribution + /// interchangeable with it (see <see cref="ParamSchema.PositionsFor" />). + /// </summary> + /// <param name="position">A position <see cref="ParamSchema.PositionsFor" /> returned for this trial's schema.</param> + /// <returns>The internal value stored at that position.</returns> + /// <exception cref="IndexOutOfRangeException"><paramref name="position" /> is not a position of the schema.</exception> + internal double InternalAt(int position) => _internals[position]; + + /// <summary> + /// The stored internal value of a parameter without rebuilding its external value: what + /// <c>Distributions[name].ToInternalRepr(Params[name])</c> returns, since <see cref="TryCreate" /> stored exactly + /// that. + /// </summary> + /// <param name="name">Parameter name.</param> + /// <param name="value">The internal value, or 0 when absent.</param> + /// <returns>True when the trial has the parameter.</returns> + internal bool TryGetInternal(string name, out double value) + { + int index = Schema.IndexOf(name); + if (index < 0) + { + value = 0; + return false; + } + value = _internals[index]; + return true; + } + + /// <summary> + /// The compact form of a finished trial's parameters, or null when any value would not read back identical. + /// </summary> + /// <param name="schema">The schema <see cref="ParamSchemaCache.FindOrAdd" /> matched to the trial.</param> + /// <param name="params">The trial's parameter dictionary, in the schema's order.</param> + /// <returns>The compact parameters, or null to keep the dictionary.</returns> + /// <remarks> + /// A value a trial got from <c>SetTrialParam</c> is the distribution's own <c>ToExternalRepr</c> of its internal + /// value and always qualifies. A value from a template trial may not: an <c>int</c> under a float distribution + /// (Optuna keeps it an <c>int</c>), a 64-bit integer beyond 2^53, or a categorical choice equal to an earlier one + /// (<c>1</c> and <c>1.0</c>), whose first index is the one <c>ToInternalRepr</c> finds. + /// </remarks> + internal static CompactParams? TryCreate(ParamSchema schema, OrderedDict<string, object?> @params) + { + var internals = new double[schema.Names.Length]; + for (int i = 0; i < internals.Length; i++) + { + object? stored = @params.GetAt(i).Value; + BaseDistribution distribution = schema.Distributions[i]; + double internalRepr; + try + { + internalRepr = distribution.ToInternalRepr(stored); + } + catch (Exception) + { + // A value its own distribution cannot convert (only a hand-built template can hold one) keeps the + // dictionary as it is; compaction must never fail the finish that triggered it. + return null; + } + // The rebuilt value must be indistinguishable from the stored one; the schema's distribution may be an + // interchangeable copy of the trial's own, whose choice objects then differ only by identity. + if (!DistributionIdentity.IsSameValue(stored, distribution.ToExternalRepr(internalRepr))) + return null; + internals[i] = internalRepr; + } + return new CompactParams(schema, internals); + } +} + +/// <summary> +/// The read-only distributions dictionary of every compact trial of one <see cref="ParamSchema" /> (plan 13, item +/// S12): one instance per schema, not per trial. +/// </summary> +internal sealed class DistributionsView : CompactDictionaryView<string, BaseDistribution> +{ + private readonly ParamSchema _schema; + + /// <summary>Wraps a schema; created once by the schema itself.</summary> + /// <param name="schema">The schema whose names and distributions this view exposes.</param> + internal DistributionsView(ParamSchema schema) => _schema = schema; + + /// <inheritdoc /> + public override int Count => _schema.Names.Length; + + /// <summary>The schema's names, read-only.</summary> + public override IEnumerable<string> Keys => _schema.ReadOnlyNames; + + /// <inheritdoc /> + protected override string KeyAt(int index) => _schema.Names[index]; + + /// <inheritdoc /> + protected override BaseDistribution ValueAt(int index) => _schema.Distributions[index]; + + /// <inheritdoc /> + protected override int IndexOf(string key) => _schema.IndexOf(key); +} + +/// <summary> +/// A compact trial's user or system attributes (plan 13, item S12): two arrays instead of a dictionary, with long +/// ASCII strings held as bytes (<see cref="CompactString" />), and one shared instance for every empty one. +/// </summary> +/// <remarks> +/// Values other than long strings are kept as they are, so a nested list or dictionary is the same object the trial +/// stored. Lookups scan the keys while there are few of them and use an index built on the first lookup otherwise. +/// </remarks> +internal sealed class CompactAttrs : CompactDictionaryView<string, object?> +{ + /// <summary>Up to this many keys a lookup scans; more build an index once.</summary> + internal const int LinearScanLimit = 16; + + /// <summary>The one compact form of every empty attribute dictionary.</summary> + internal static readonly CompactAttrs Empty = new(Array.Empty<string>(), Array.Empty<object?>()); + + private readonly string[] _keys; + private readonly object?[] _values; + private Dictionary<string, int>? _index; + + /// <summary>Wraps the arrays <see cref="Create" /> built.</summary> + /// <param name="keys">Keys in order; owned by this object.</param> + /// <param name="values">Values in order, long strings as <see cref="CompactString" />; owned by this object.</param> + private CompactAttrs(string[] keys, object?[] values) + { + _keys = keys; + _values = values; + } + + /// <inheritdoc /> + public override int Count => _keys.Length; + + /// <inheritdoc /> + protected override string KeyAt(int index) => _keys[index]; + + /// <inheritdoc /> + protected override object? ValueAt(int index) + => _values[index] is CompactString compact ? compact.Materialize() : _values[index]; + + /// <summary>The value as stored, a <see cref="CompactString" /> for a compacted string; a diagnostic for tests.</summary> + /// <param name="key">An attribute name.</param> + /// <returns>The stored object, or null when the key is absent.</returns> + internal object? StoredValue(string key) + { + int index = IndexOf(key); + return index < 0 ? null : _values[index]; + } + + /// <inheritdoc /> + protected override int IndexOf(string key) + { + if (_keys.Length <= LinearScanLimit) + { + for (int i = 0; i < _keys.Length; i++) + if (string.Equals(_keys[i], key, StringComparison.Ordinal)) + return i; + return -1; + } + + // Built once per object; two readers may both build one, and either result is correct, so the race only + // costs a duplicate build. Volatile so a reader never sees a dictionary before its entries. + Dictionary<string, int>? index = Volatile.Read(ref _index); + if (index is null) + { + index = new Dictionary<string, int>(_keys.Length); + for (int i = 0; i < _keys.Length; i++) + index[_keys[i]] = i; + Volatile.Write(ref _index, index); + } + return index.TryGetValue(key, out int position) ? position : -1; + } + + /// <summary>The compact form of an attribute dictionary.</summary> + /// <param name="attrs">The dictionary; read, never changed.</param> + /// <returns><see cref="Empty" /> for an empty dictionary, otherwise a new compact copy of its entries.</returns> + internal static CompactAttrs Create(OrderedDict<string, object?> attrs) + { + int n = attrs.Count; + if (n == 0) + return Empty; + var keys = new string[n]; + var values = new object?[n]; + for (int i = 0; i < n; i++) + { + KeyValuePair<string, object?> entry = attrs.GetAt(i); + keys[i] = entry.Key; + values[i] = entry.Value is string text ? CompactString.TryCreate(text) ?? (object)text : entry.Value; + } + return new CompactAttrs(keys, values); + } +} + +/// <summary> +/// A long ASCII string held as bytes (plan 13, item S12): half the memory of the UTF-16 string, or a quarter for a +/// lowercase hexadecimal string such as the CMA-ES optimizer state Optuna stores in system attributes. +/// </summary> +/// <remarks> +/// <para> +/// <see cref="Materialize" /> returns a new string with exactly the original characters on every call; a form is +/// chosen only when that round trip is exact. Hexadecimal digits are stored two to a byte, and an odd count keeps +/// its last digit aside: CMA-ES splits its state into 2,045-character chunks, an odd length. +/// </para> +/// </remarks> +internal sealed class CompactString +{ + /// <summary>Strings shorter than this stay strings: the saving would not cover the extra object.</summary> + internal const int MinLength = 64; + + private readonly byte[] _bytes; + private readonly bool _lowerHex; + private readonly char _trailingDigit; + + /// <summary>Wraps the stored bytes.</summary> + /// <param name="bytes">ASCII characters, or the decoded digit pairs of a lowercase hexadecimal string.</param> + /// <param name="lowerHex">True when <paramref name="bytes" /> must be re-encoded as lowercase hexadecimal.</param> + /// <param name="trailingDigit">The last digit of an odd-length hexadecimal string, or <c>'\0'</c> for none.</param> + private CompactString(byte[] bytes, bool lowerHex, char trailingDigit) + { + _bytes = bytes; + _lowerHex = lowerHex; + _trailingDigit = trailingDigit; + } + + /// <summary>Whether this string is stored as hexadecimal digit pairs; a diagnostic for tests.</summary> + internal bool IsHex => _lowerHex; + + /// <summary>How many bytes the stored form holds; a diagnostic for tests.</summary> + internal int StoredBytes => _bytes.Length; + + /// <summary>The compact form of a string, or null when it is short or not ASCII.</summary> + /// <param name="text">The string to store.</param> + /// <returns>A compact string whose <see cref="Materialize" /> returns <paramref name="text" />'s characters, or null.</returns> + internal static CompactString? TryCreate(string text) + { + if (text.Length < MinLength) + return null; + if (IsLowerHex(text)) + { + int pairs = text.Length / 2; + return new CompactString( + Convert.FromHexString(text.AsSpan(0, pairs * 2)), + lowerHex: true, + trailingDigit: (text.Length & 1) != 0 ? text[^1] : '\0'); + } + if (!Ascii.IsValid(text)) + return null; + return new CompactString(Encoding.ASCII.GetBytes(text), lowerHex: false, trailingDigit: '\0'); + } + + /// <summary>A new string with the stored characters.</summary> + /// <returns>The original string's characters, as a new instance.</returns> + internal string Materialize() + { + if (!_lowerHex) + return Encoding.ASCII.GetString(_bytes); + int length = _bytes.Length * 2 + (_trailingDigit != '\0' ? 1 : 0); + return string.Create(length, this, static (chars, compact) => + { + const string digits = "0123456789abcdef"; + byte[] bytes = compact._bytes; + for (int i = 0; i < bytes.Length; i++) + { + chars[2 * i] = digits[bytes[i] >> 4]; + chars[2 * i + 1] = digits[bytes[i] & 0xF]; + } + if (compact._trailingDigit != '\0') + chars[^1] = compact._trailingDigit; + }); + } + + /// <summary>Whether every character is a lowercase hexadecimal digit, so bytes and one spare digit rebuild it exactly.</summary> + /// <param name="text">The string to test.</param> + /// <returns>True for <c>[0-9a-f]</c> only; uppercase digits would come back lowercase, so they do not qualify.</returns> + private static bool IsLowerHex(string text) + { + foreach (char c in text) + { + if (c is not ((>= '0' and <= '9') or (>= 'a' and <= 'f'))) + return false; + } + return true; + } +} diff --git a/src/OptunaSharp.Core/Internal/ConcurrentAsks.cs b/src/OptunaSharp.Core/Internal/ConcurrentAsks.cs index 92567da..970a085 100644 --- a/src/OptunaSharp.Core/Internal/ConcurrentAsks.cs +++ b/src/OptunaSharp.Core/Internal/ConcurrentAsks.cs @@ -222,6 +222,27 @@ internal static bool IsHeld(List<double[]> held, double[] point) => _byStudy.Resolve(study, static () => new Dictionary<int, (int, double[])>()); } +/// <summary> +/// An identity for the thread running now, for telling a running trial asked on this thread (a batch one caller +/// asked before telling any of it) from one asked on another (a concurrent worker): see +/// <see cref="HandedOutParams" />. +/// </summary> +/// <remarks> +/// A fresh object per thread, created on the thread's first use, rather than +/// <see cref="Environment.CurrentManagedThreadId" />: .NET reuses a managed thread id once its thread has exited, so +/// a trial asked on a thread that has since ended (a caller that handed the trial to another thread and returned) +/// would pass for the new thread's own. A record holds its token strongly, and no other thread can ever obtain an +/// equal one, since tokens compare by reference. +/// </remarks> +internal static class AskingThread +{ + // Per thread: each thread lazily creates its own token and never sees another thread's. + [ThreadStatic] private static object? t_token; + + /// <summary>This thread's token, created on first use and the same object for the rest of the thread's life.</summary> + internal static object Current => t_token ??= new object(); +} + /// <summary> /// The relative parameters a sampler handed to trials that are still running, per study, so a parameter set a /// running trial evaluates is generated again instead of handed to a second trial: <see cref="HandedOutPoints" /> @@ -236,20 +257,36 @@ internal static bool IsHeld(List<double[]> held, double[] point) /// two running trials (NSGA-II and NSGA-III: one run in 12 to 20 at 8 workers). /// </para> /// <para> -/// The rules of <see cref="HandedOutPoints" /> hold: every member is called under the sampler's monitor, a -/// sequential run never redraws (so its random stream and seeded results are unchanged), and the record steers -/// apart only the asks made through this sampler instance in this process. Parameter sets are compared with -/// Python's <c>==</c> (<see cref="PyJson.ValueEquals(object, object)" />), so a NaN never matches. +/// <b>Only children asked on another thread count</b> (owner's decision of 2026-11-12, QA-57). A caller that +/// asks a batch of trials on one thread before telling any of them (Optuna's documented batch-optimization +/// pattern) keeps several trials running without any concurrency, and Optuna generates each of their children +/// once; redrawing there left Optuna's seeded trajectory (seed 311031104, population 6, batches of 5: trial 18). +/// Concurrent workers, <c>Optimize(nJobs)</c>'s or a caller's own threads, ask on different threads, so they +/// are still steered apart. Each held child records the token of the thread that claimed it +/// (<see cref="AskingThread" />). The rule covers the samplers whose children Optuna generates (NSGA-II / III and +/// their relatives) and the other users of this class alike; <see cref="HandedOutPoints" />, whose samplers have +/// no Optuna trajectory to follow, keeps redrawing against every running trial. +/// </para> +/// <para> +/// The rules of <see cref="HandedOutPoints" /> hold otherwise: every member is called under the sampler's +/// monitor, a sequential run never redraws (so its random stream and seeded results are unchanged), and the +/// record steers apart only the asks made through this sampler instance in this process. Parameter sets are +/// compared with Python's <c>==</c> (<see cref="PyJson.ValueEquals(object, object)" />), so a NaN never matches. /// </para> /// </remarks> internal sealed class HandedOutParams { - private readonly PerStudyState<Dictionary<int, OrderedDict<string, object?>>> _byStudy = new(); + /// <summary>A running trial's child and the token of the thread that claimed it (<see cref="AskingThread" />).</summary> + /// <param name="Params">The child handed to the trial; recorded without a copy, so never changed afterwards.</param> + /// <param name="ClaimedOn">The claiming thread's token, compared by reference.</param> + private readonly record struct HeldChild(OrderedDict<string, object?> Params, object ClaimedOn); + + private readonly PerStudyState<Dictionary<int, HeldChild>> _byStudy = new(); /// <summary> /// Hands the trial the first of <paramref name="candidate" /> and up to <see cref="HandedOutPoints.MaxRedraws" /> - /// redraws that no other running trial holds, and records it as the trial's parameters for the asks made while it - /// runs. + /// redraws that no running trial asked on another thread holds, and records it, with this thread's token, as the + /// trial's parameters for the asks made while it runs. /// </summary> /// <param name="study">The trial's study, whose running trials are read from the storage.</param> /// <param name="trial">The trial being sampled.</param> @@ -259,8 +296,9 @@ internal sealed class HandedOutParams /// after handing it out. /// </param> /// <param name="redraw"> - /// Draws another candidate the same way. Called only while the previous draw is held, so a sequential run never - /// calls it and its random stream, and with it every seeded result, is unchanged. + /// Draws another candidate the same way. Called only while the previous draw is held by a trial asked on another + /// thread, so a sequential run, or a batch one caller asks on one thread, never calls it, and its random stream, + /// with it every seeded result and Optuna parity, is unchanged. /// </param> /// <returns> /// The parameters handed to the trial, or <c>null</c> when every draw was held (a population collapsed onto one @@ -275,7 +313,8 @@ internal sealed class HandedOutParams if (candidate.Count == 0) return candidate; - List<OrderedDict<string, object?>> held = HeldByOtherRunningTrials(study, trial); + object thisThread = AskingThread.Current; + List<OrderedDict<string, object?>> held = HeldByOtherThreadsRunningTrials(study, trial, thisThread); for (int redraws = 0; IsHeld(held, candidate); redraws++) { if (redraws == HandedOutPoints.MaxRedraws) @@ -285,7 +324,7 @@ internal sealed class HandedOutParams // A redraw can come back empty (the strategy found no parents); then there is nothing to hold either. if (candidate.Count > 0) - Of(study)[trial.Number] = candidate; + Of(study)[trial.Number] = new HeldChild(candidate, thisThread); return candidate; } @@ -295,17 +334,24 @@ internal sealed class HandedOutParams internal void Forget(Study study, int trialNumber) => Of(study).Remove(trialNumber); /// <summary> - /// The parameter sets other running trials are evaluating. Entries of trials no longer running are dropped on the - /// way. + /// The parameter sets that other running trials, asked on other threads, are evaluating. Entries of trials no + /// longer running are dropped on the way, whichever thread asked for them. /// </summary> /// <param name="study">The study, whose running trials are read from the storage.</param> /// <param name="current">The trial being sampled; never its own holder.</param> - /// <returns>The held parameter sets; empty without a storage read when nothing is recorded (a sequential run).</returns> + /// <param name="thisThread"> + /// The asking thread's token (<see cref="AskingThread.Current" />). Children claimed on this thread are left out: + /// their trials belong to a batch this caller asked one after another, which Optuna does not redraw (QA-57). + /// </param> + /// <returns> + /// The held parameter sets; empty without a storage read when nothing is recorded (a sequential run). + /// </returns> /// <exception cref="NumSharp.KeyError">The study no longer exists in storage.</exception> - private List<OrderedDict<string, object?>> HeldByOtherRunningTrials(Study study, FrozenTrial current) + private List<OrderedDict<string, object?>> HeldByOtherThreadsRunningTrials( + Study study, FrozenTrial current, object thisThread) { var sets = new List<OrderedDict<string, object?>>(); - Dictionary<int, OrderedDict<string, object?>> handedOut = Of(study); + Dictionary<int, HeldChild> handedOut = Of(study); if (handedOut.Count == 0) return sets; @@ -314,10 +360,16 @@ internal sealed class HandedOutParams running.Add(other.Number); foreach (int number in new List<int>(handedOut.Keys)) { - if (running.Contains(number)) - sets.Add(handedOut[number]); - else + if (!running.Contains(number)) + { handedOut.Remove(number); // finished, or told by another process: it holds nothing any more + continue; + } + + HeldChild child = handedOut[number]; + // Reference comparison: a token is unique to its thread for the record's whole life (AskingThread). + if (!ReferenceEquals(child.ClaimedOn, thisThread)) + sets.Add(child.Params); } return sets; @@ -339,8 +391,8 @@ private static bool IsHeld(List<OrderedDict<string, object?>> held, OrderedDict< /// <summary>This study's record, created on first use.</summary> /// <param name="study">The study.</param> /// <returns>The record, keyed by trial number.</returns> - private Dictionary<int, OrderedDict<string, object?>> Of(Study study) - => _byStudy.Resolve(study, static () => new Dictionary<int, OrderedDict<string, object?>>()); + private Dictionary<int, HeldChild> Of(Study study) + => _byStudy.Resolve(study, static () => new Dictionary<int, HeldChild>()); } /// <summary> diff --git a/src/OptunaSharp.Core/Internal/ConstrainedOptimization.cs b/src/OptunaSharp.Core/Internal/ConstrainedOptimization.cs index c39f32a..38310a9 100644 --- a/src/OptunaSharp.Core/Internal/ConstrainedOptimization.cs +++ b/src/OptunaSharp.Core/Internal/ConstrainedOptimization.cs @@ -31,6 +31,30 @@ internal static List<FrozenTrial> GetFeasibleTrials(IEnumerable<FrozenTrial> tri return feasibleTrials; } + /// <summary> + /// Whether <see cref="GetConstraintsFromSystemAttrs" /> would return any constraint: the old-format list key holds + /// a value, or some key carries the per-constraint prefix. Allocates nothing. + /// </summary> + /// <param name="systemAttrs">A trial's system attributes.</param> + /// <returns>False exactly when the constraints dictionary would be empty.</returns> + /// <remarks> + /// The same two tests the dictionary's construction makes before adding an entry, so a false answer means that + /// dictionary would be empty (an old-format list that is present but empty also reads as constraints here, and + /// the caller then builds the empty dictionary as before). + /// </remarks> + internal static bool HasConstraints(IReadOnlyDictionary<string, object?> systemAttrs) + { + if (systemAttrs.TryGetValue(ConstraintsKey, out var con) && con is not null) + return true; + string prefix = ConstraintsKey + ":"; + foreach (string key in systemAttrs.Keys) + { + if (key.StartsWith(prefix, System.StringComparison.Ordinal)) + return true; + } + return false; + } + /// <summary>Python <c>_get_constraints_from_system_attrs</c>.</summary> /// <param name="systemAttrs">The stored attributes carrying legacy and named constraint values.</param> /// <returns>The constraint values keyed by constraint name; named entries override legacy indexed entries.</returns> @@ -51,15 +75,18 @@ internal static OrderedDict<string, double> GetConstraintsFromSystemAttrs( } // Load constraints from new format (individual keys). + // Keys first, the value only for a match: the same entries in the same order as walking the pairs, but a + // compact finished trial (plan 13, item S12) then rebuilds no stored string it does not need. TPE reads every + // trial's constraints on every ask, and its trials carry their relative parameters as long JSON strings. string prefix = ConstraintsKey + ":"; - foreach (var (key, value) in systemAttrs) + foreach (string key in systemAttrs.Keys) { if (key.StartsWith(prefix, System.StringComparison.Ordinal)) { string constraintKey = key.Substring(prefix.Length); if (constraintsDict.ContainsKey(constraintKey)) OptunaWarnings.Warn("Overwrite an old format constraint."); - constraintsDict[constraintKey] = ToDouble(value); + constraintsDict[constraintKey] = ToDouble(systemAttrs[key]); } } return constraintsDict; diff --git a/src/OptunaSharp.Core/Internal/Erf.cs b/src/OptunaSharp.Core/Internal/Erf.cs index 8694cc7..04db0e6 100644 --- a/src/OptunaSharp.Core/Internal/Erf.cs +++ b/src/OptunaSharp.Core/Internal/Erf.cs @@ -256,11 +256,25 @@ internal static double Erfc(double x) internal static double[] ComputeArray(double[] x) { var result = new double[x.Length]; + ComputeArray(x, result); + return result; + } + + /// <summary> + /// <see cref="ComputeArray(double[])" /> into a caller's buffer, for callers that reuse scratch memory (Rustuna + /// plan 13, item S6). The path is chosen by <paramref name="x" />'s length exactly as the array overload chooses + /// it by the array's length, so a caller must pass a span of the logical length, never a larger rented buffer. + /// </summary> + /// <param name="x">The numerical input values; its length selects the exact or the vectorized path.</param> + /// <param name="result">Receives one value per element of <paramref name="x" />; at least as long, and not overlapping it.</param> + /// <exception cref="IndexOutOfRangeException"><paramref name="result" /> is shorter than <paramref name="x" />.</exception> + internal static void ComputeArray(ReadOnlySpan<double> x, Span<double> result) + { if (x.Length < 2000) { for (int i = 0; i < x.Length; i++) result[i] = Compute(x[i]); - return result; + return; } for (int i = 0; i < x.Length; i++) @@ -313,7 +327,6 @@ internal static double[] ComputeArray(double[] x) } result[i] = Math.Sign(v) * outVal; } - return result; } /// <summary> diff --git a/src/OptunaSharp.Core/Internal/Hypervolume.cs b/src/OptunaSharp.Core/Internal/Hypervolume.cs index f0a1107..e5a45e1 100644 --- a/src/OptunaSharp.Core/Internal/Hypervolume.cs +++ b/src/OptunaSharp.Core/Internal/Hypervolume.cs @@ -12,25 +12,27 @@ namespace OptunaSharp.Internal; /// Phase 3.2 part 3e). Consumed by TPE's multi-objective trial split /// (<see cref="TpeTrialSplit" />) and the GP log-EHVI acquisition function. /// -/// <para><b>Numeric strategy.</b> NumPy <c>@</c>/<c>np.dot</c> is reproduced as a sequential dot -/// and <c>.prod(axis=-1)</c> as a sequential product. <see cref="ComputeHypervolume" /> agrees -/// with Optuna to ~1 ULP (verified bit-exact-to-tolerance over 120 mixed 2–6D cases, max relative -/// error 2e-16). The HSSP greedy selection is a pure sequence of <c>np.argmax</c> (first-max) -/// choices, so the resulting subset is deterministic and order-independent: the lazy-contribution -/// skipping in <see cref="LazyContribsUpdate" /> only prunes strictly-smaller upper bounds, so -/// every candidate tied at the maximum is evaluated regardless of the <c>argsort</c> tie order.</para> +/// <para><b>Numeric strategy.</b> Optuna's NumPy <c>@</c>/<c>np.dot</c> products (the two- and +/// three-objective volumes) run through NumSharp's <c>np.dot</c> via <see cref="LinAlg.Dot(double[], double[])" /> +/// and <see cref="LinAlg.Dot(double[,], double[])" />, i.e. the same OpenBLAS <c>ddot</c>/<c>dgemv</c> binary NumPy +/// calls, so their sums round exactly as Optuna's do. <c>.prod(axis=-1)</c> stays a sequential loop: NumPy +/// multiplies along that axis in order, and so does NumSharp's float <c>np.prod</c> since 0.81.0 (0.80.0's SIMD +/// lanes did not), bit for bit (<c>SequentialProductTests</c>); the loop runs once per point inside the HSSP and +/// box-decomposition loops, where a NumSharp call (about 2 µs) would cost more than the multiplications. Measured live against Optuna 5.0.0 (<c>HypervolumeParityTests</c>, 240 random 2- to 5-objective +/// fronts): every <see cref="ComputeHypervolume" /> result is bit-identical (the former sequential dot differed in 37 +/// of them, by an ulp or two).</para> /// -/// <para><b>[Misaligned] HSSP ≥3-objective zero-contribution ties.</b> The two-objective solver -/// (<see cref="SolveHssp2d" />) is dot-free and matches Optuna exactly. For three or more -/// objectives, once the greedily-selected points dominate the rest, every remaining candidate has -/// a true marginal hypervolume of 0, computed as <c>H(S ∪ {i}) − H(S)</c>. Optuna's <c>np.dot</c> -/// (BLAS) leaves a sub-ULP residual there (e.g. <c>-1.8e-15</c>) that the sequential dot cancels -/// to an exact <c>0</c>, so <c>np.argmax</c> can pick a different — but hypervolume-equivalent — -/// zero-contribution point. The selected subset is equally optimal (identical total hypervolume, -/// same 1−1/e guarantee); only the tie resolution differs, and only in this degenerate case. It -/// does not surface in realistic multi-objective TPE studies (2- and 3-objective trajectories -/// match live Optuna to the erf tolerance in full lock-step). Same class as the TPE argsort and -/// erf/ucrt notes.</para> +/// <para><b>Subset selection.</b> The HSSP greedy selection is a pure sequence of <c>np.argmax</c> (first-max) +/// choices, so the subset is deterministic, and the lazy-contribution skipping in +/// <see cref="LazyContribsUpdate" /> only prunes strictly-smaller upper bounds, so every candidate tied at the +/// maximum is evaluated whatever the <c>argsort</c> tie order. With three or more objectives a candidate's true +/// marginal hypervolume can be exactly 0 (a box of zero volume, or one the selected points cover), computed as +/// <c>H(S ∪ {i}) − H(S)</c>; Optuna's BLAS products leave a sub-ulp residual there (e.g. <c>-1.8e-15</c>) and +/// <c>np.argmax</c> picks by it. The former sequential dot cancelled those residuals to an exact 0 and could pick a +/// different, hypervolume-equivalent point (a documented [Misaligned] case); with NumPy's own products the +/// residuals, and so the picks, are Optuna's (240 of 240 selections identical in <c>HypervolumeParityTests</c>, +/// zero-volume ties included, against 237 before). The two-objective solver (<see cref="SolveHssp2d" />) is +/// dot-free.</para> /// </summary> internal static class Hypervolume { @@ -96,48 +98,66 @@ internal static double ComputeHypervolume(double[][] lossVals, double[] referenc return double.IsFinite(hv) ? hv : double.PositiveInfinity; } - /// <summary>Python <c>wfg._compute_2d</c>.</summary> + /// <summary> + /// Python <c>wfg._compute_2d</c>: the staircase area as one inner product, <c>edge_x @ edge_y</c>, taken through + /// NumSharp's <c>np.dot</c> (BLAS <c>ddot</c>) so the sum rounds exactly as Optuna's does. + /// </summary> /// <param name="sortedParetoSols">Unique nondominated minimization rows in lexicographic order.</param> /// <param name="referencePoint">The reference objective vector, in the same coordinate system and order as the supplied objective rows.</param> - /// <returns>The dominated area between the Pareto front and the reference point.</returns> + /// <returns>The dominated area between the Pareto front and the reference point, Optuna's bits.</returns> + /// <remarks> + /// The edges are single subtractions, exact as NumPy's elementwise ones. Their products were once summed left to + /// right; BLAS's <c>ddot</c> accumulates in several registers, so that loop differed from Optuna in the last bits on + /// fronts of more than a handful of points (measured live: 37 of 240 random 2- to 5-objective volumes before the + /// switch, 0 after). + /// </remarks> private static double Compute2d(double[][] sortedParetoSols, double[] referencePoint) { // rect_diag_y = concat([ref[1:], sols[:-1, 1]]); edge_x = ref[0]-sols[:,0]; // edge_y = rect_diag_y - sols[:,1]; return edge_x @ edge_y. int n = sortedParetoSols.Length; - double dot = 0.0; + var edgeX = new double[n]; + var edgeY = new double[n]; for (int i = 0; i < n; i++) { double rectDiagY = i == 0 ? referencePoint[1] : sortedParetoSols[i - 1][1]; - double edgeX = referencePoint[0] - sortedParetoSols[i][0]; - double edgeY = rectDiagY - sortedParetoSols[i][1]; - dot += edgeX * edgeY; + edgeX[i] = referencePoint[0] - sortedParetoSols[i][0]; + edgeY[i] = rectDiagY - sortedParetoSols[i][1]; } - return dot; + return LinAlg.Dot(edgeX, edgeY); } - /// <summary>Python <c>wfg._compute_3d</c> (O(N^2) cumulative-max voxel count).</summary> + /// <summary> + /// Python <c>wfg._compute_3d</c> (O(N^2) cumulative-max voxel count): the two products + /// <c>np.dot(np.dot(z_delta, y_delta), x_delta)</c> go through NumSharp's <c>np.dot</c> (BLAS <c>dgemv</c>, then + /// <c>ddot</c>) so the volume rounds exactly as Optuna's does. + /// </summary> /// <param name="sortedParetoSols">Unique nondominated minimization rows in lexicographic order.</param> /// <param name="referencePoint">The reference objective vector, in the same coordinate system and order as the supplied objective rows.</param> - /// <returns>The dominated three-dimensional volume relative to the reference point.</returns> + /// <returns>The dominated three-dimensional volume relative to the reference point, Optuna's bits.</returns> + /// <remarks> + /// <c>z_delta</c> is a C-contiguous <c>double[,]</c> because that is the layout NumPy hands to BLAS after its two + /// <c>np.maximum.accumulate</c> passes; a different layout would take another <c>gemv</c> route. Optuna orders the + /// columns with <c>np.argsort</c> on the y coordinates, NumPy's default (unstable, SIMD) sort, and + /// <see cref="StableArgsort" /> reproduces it only when those coordinates are distinct; tied y values can move a + /// product to another BLAS accumulator, the documented argsort tie class. + /// </remarks> private static double Compute3d(double[][] sortedParetoSols, double[] referencePoint) { int n = sortedParetoSols.Length; var yOrder = StableArgsort(sortedParetoSols.Select(s => s[1]).ToArray()); - var zDelta = new double[n][]; - for (int r = 0; r < n; r++) - zDelta[r] = new double[n]; + var zDelta = new double[n, n]; for (int k = 0; k < n; k++) - zDelta[yOrder[k]][k] = referencePoint[2] - sortedParetoSols[yOrder[k]][2]; + zDelta[yOrder[k], k] = referencePoint[2] - sortedParetoSols[yOrder[k]][2]; - // np.maximum.accumulate axis=0 then axis=1. + // np.maximum.accumulate axis=0 then axis=1 (max is exact, so only the final values matter). for (int c = 0; c < n; c++) for (int r = 1; r < n; r++) - zDelta[r][c] = Math.Max(zDelta[r][c], zDelta[r - 1][c]); + zDelta[r, c] = Math.Max(zDelta[r, c], zDelta[r - 1, c]); for (int r = 0; r < n; r++) for (int c = 1; c < n; c++) - zDelta[r][c] = Math.Max(zDelta[r][c], zDelta[r][c - 1]); + zDelta[r, c] = Math.Max(zDelta[r, c], zDelta[r, c - 1]); var xVals = sortedParetoSols.Select(s => s[0]).ToArray(); var yVals = yOrder.Select(idx => sortedParetoSols[idx][1]).ToArray(); @@ -149,16 +169,8 @@ private static double Compute3d(double[][] sortedParetoSols, double[] referenceP yDelta[i] = (i < n - 1 ? yVals[i + 1] : referencePoint[1]) - yVals[i]; } - // np.dot(np.dot(z_delta, y_delta), x_delta). - double result = 0.0; - for (int r = 0; r < n; r++) - { - double inner = 0.0; - for (int c = 0; c < n; c++) - inner += zDelta[r][c] * yDelta[c]; - result += inner * xDelta[r]; - } - return result; + // np.dot(np.dot(z_delta, y_delta), x_delta): a matrix-vector product, then an inner product. + return LinAlg.Dot(LinAlg.Dot(zDelta, yDelta), xDelta); } /// <summary>Python <c>wfg._compute_hv</c> — the WFG recursion for any dimension.</summary> @@ -438,7 +450,10 @@ private static double[] LazyContribsUpdate( // helpers // =========================================================================================== - /// <summary>Sequential <c>np.prod(reference_point - row)</c>.</summary> + /// <summary> + /// Sequential <c>np.prod(reference_point - row)</c>: NumPy's <c>multiply.reduce</c> order, which NumSharp 0.81.0's + /// float <c>np.prod</c> also follows (pinned by <c>SequentialProductTests</c>); a loop because it runs once per point. + /// </summary> /// <param name="referencePoint">The reference objective vector, in the same coordinate system and order as the supplied objective rows.</param> /// <param name="row">The objective or feature row used by the operation.</param> /// <returns>The product of coordinate distances from the solution to the reference point.</returns> @@ -450,19 +465,37 @@ private static double ProdRefMinus(double[] referencePoint, double[] row) return p; } - /// <summary>NumPy <c>np.argmax</c>: the first index of the maximum (values here are non-negative, finite or +inf).</summary> - /// <param name="values">The ordered values to aggregate or format.</param> - /// <returns>The index of the first largest value.</returns> + /// <summary> + /// NumPy <c>np.argmax</c> over the hypervolume contributions: the first index of the maximum, or of the first NaN + /// when there is one (NumPy treats a NaN as maximal and stops at it). + /// </summary> + /// <param name="values">The remaining candidates' hypervolume contributions; at least one.</param> + /// <returns>The index of the first NaN if any contribution is NaN, else the first index holding the largest one.</returns> + /// <remarks> + /// Contributions are non-negative, finite or <c>+inf</c>, until a loss value of <c>-inf</c> makes the running + /// hypervolume infinite: <c>_lazy_contribs_update</c>'s <c>inclusive_hvs - np.prod(...)</c> is then <c>inf - inf</c> + /// and <c>np.minimum</c> carries the NaN into the contributions. Optuna's <c>np.argmax</c> selects that candidate; + /// the former strict <c>></c> loop skipped it. The statements are NumPy's argmax loop (<c>!(v <= best)</c>, + /// stop at a NaN). NumSharp's <c>np.argmax</c> gives the same index, but this runs once per greedy selection step, + /// where a NumSharp call (about 2.3 µs) would cost more than the step's own arithmetic on small fronts. + /// </remarks> private static int ArgMax(IReadOnlyList<double> values) { int best = 0; double bestVal = values[0]; + // NumPy checks the first element on its own: a leading NaN is the answer. + if (double.IsNaN(bestVal)) + return 0; for (int i = 1; i < values.Count; i++) { - if (values[i] > bestVal) + double value = values[i]; + // !(value <= best) is true for a larger value and for a NaN; a NaN ends the search, as in NumPy. + if (!(value <= bestVal)) { - bestVal = values[i]; + bestVal = value; best = i; + if (double.IsNaN(value)) + break; } } return best; diff --git a/src/OptunaSharp.Core/Internal/LinAlg.cs b/src/OptunaSharp.Core/Internal/LinAlg.cs index d3792c7..31b50e6 100644 --- a/src/OptunaSharp.Core/Internal/LinAlg.cs +++ b/src/OptunaSharp.Core/Internal/LinAlg.cs @@ -12,20 +12,29 @@ namespace OptunaSharp.Internal; /// <c>eigh</c> values+vectors, and <c>solve</c> match numpy 2.4.2 bit-for-bit). This is what /// keeps the linalg-backed samplers byte-exact rather than managed-tolerance: NSGA-III's /// hyperplane <see cref="Solve" />/<see cref="MatrixRank" /> (2.14, now byte-exact), CMA-ES's -/// <see cref="Eigh" /> (2.16), and the GP stack's <see cref="Cholesky" /> (3.2). +/// <see cref="Eigh" /> (2.16), and the GP stack's <see cref="Cholesky" /> (3.2). The vector +/// products go the same way: Optuna's 1-D <c>@</c>/<c>np.dot</c> and <c>np.linalg.norm</c> are BLAS +/// <c>ddot</c> in NumPy, so <see cref="Dot(double[], double[])" /> and <see cref="Norm" /> serve the +/// hypervolume (2-D/3-D volumes and the subset selection on them), PED-ANOVA's moments and divergence, and +/// UNDX crossover, which a left-to-right sum matched only on short vectors. /// /// <para><see cref="SolveTriangular(double[,],double[],bool)" /> is the one primitive still /// computed in managed code — a plain forward/back substitution, exact to a rounding. NumSharp /// surfaces no <em>public</em> triangular solve to route it through (no <c>np.linalg</c> entry, /// no <c>IBlasBackend.TryTrsm</c>); its OpenBLAS interop does now bind <c>cblas_dtrsm</c> at the -/// native layer (<c>OpenBlasNative.Dtrsm</c>), but that binding is <c>internal</c> and -/// unreachable from OptunaSharp — so this awaits a public NumSharp triangular-solve op. It is one +/// native layer (<c>OpenBlasNative.Dtrsm</c>, and <c>OpenBlasEngine</c>'s <c>Trsm</c> in 0.81.0), but behind +/// <c>internal</c> types, unreachable from OptunaSharp — so this awaits a public NumSharp triangular-solve op +/// (NumPy itself has none: it is SciPy's and torch's, outside a NumPy port). It is one /// of the GP fit's documented tolerance sources (alongside the hand-derived MLL gradient and the /// managed L-BFGS-B, both a different float-op sequence than torch/scipy), which is why the GP /// oracle is tolerance-exact, not bit-exact — a boundary no linalg-backend switch can remove. /// By contrast CMA-ES's <see cref="Eigh" /> and the GP's <see cref="Cholesky" /> already route /// through OpenBLAS and are byte-identical to NumPy (the "5.5 byte-exactness switch," folded into -/// Core when OpenBLAS became a Core dependency — verified bit-for-bit vs numpy 2.4.2).</para> +/// Core when OpenBLAS became a Core dependency — verified bit-for-bit vs numpy 2.4.2 on NumSharp 0.80.0, and vs +/// numpy 2.5.4 on NumSharp 0.81.0, which bundles numpy 2.5.4's scipy-openblas 0.3.34.106.0). Footgun: the match +/// holds only against the NumPy whose OpenBLAS NumSharp bundles; against numpy 2.4.2, NumSharp 0.81.0 fails 14 of +/// 57 BLAS-backed live parity cases (CMA-ES long runs, UNDX) in the last bit (2026-11-14), so the CI NumPy pin +/// moves with <c>$(NumSharpVersion)</c>.</para> /// </summary> internal static class LinAlg { @@ -73,6 +82,35 @@ internal static double[] Dot(double[,] a, double[] b) return product.ToArray<double>(); } + /// <summary> + /// Inner product of two vectors, <c>a · b</c> — <c>np.dot</c> / <c>a @ b</c> on 1-D operands, through NumSharp on + /// the OpenBLAS binary NumPy bundles, so the result is NumPy's to the last bit. Use it wherever the Python port + /// takes a 1-D <c>@</c> or <c>np.dot</c>: a sequential loop rounds differently from BLAS's unrolled + /// multi-accumulator <c>ddot</c> on all but the shortest vectors. + /// </summary> + /// <param name="a">The first vector.</param> + /// <param name="b">The second vector, as long as <paramref name="a" />.</param> + /// <returns> + /// <c>Σ a[i]·b[i]</c> in NumPy's order: <c>0.0 + cblas_ddot(...)</c> per chunk, exactly as NumPy's + /// <c>DOUBLE_dot</c> computes it (so an all-negative-zero product sums to <c>+0.0</c>), and <c>0.0</c> for empty + /// vectors. + /// </returns> + /// <exception cref="NumSharp.IncorrectShapeException">The vectors differ in length (NumPy's "shapes not aligned" error).</exception> + /// <remarks> + /// Both operands are viewed zero-copy (pinned, never written) and every transient array is disposed here, so a + /// call allocates no array left to the finalizer. NumPy's <c>DOUBLE_dot</c> is what both <c>np.dot</c> and the + /// <c>@</c> operator run for two vectors; NumSharp's OpenBLAS backend ports that routine, including its chunking. + /// The result depends on the BLAS thread count and CPU kernel exactly as NumPy's does (see + /// <see cref="BlasThreadPolicy" />). + /// </remarks> + internal static double Dot(double[] a, double[] b) + { + using NDArray na = np.array(a, copy: false); + using NDArray nb = np.array(b, copy: false); + using NDArray product = np.dot(na, nb); + return (double)product; + } + /// <summary>Outer product <c>a ⊗ b</c> — <c>np.outer</c> (an elementwise product, exact).</summary> /// <param name="a">The first numerical operand; its dimensions must agree with the operation described in the summary.</param> /// <param name="b">The second numerical operand; its dimensions must agree with the first operand.</param> @@ -195,6 +233,27 @@ internal static (double[] Eigenvalues, double[,] Eigenvectors) Eigh(double[,] a) internal static double[] SolveTriangular(double[,] a, double[] b, bool upper) => TriSolveVec(a, b, upper, transpose: false); + /// <summary> + /// Triangular solve with a vector right-hand side against <paramref name="a" />'s transpose, read in place: + /// <c>SolveTriangular(a, b, upper, transposeA: true)</c> computes exactly what + /// <c>SolveTriangular(Transpose(a), b, !upper)</c> does, without materializing the transpose. + /// </summary> + /// <param name="a">The triangular coefficient matrix as stored; with <paramref name="transposeA" />, its transpose is solved with.</param> + /// <param name="b">The right-hand side; its length is the system size.</param> + /// <param name="upper">Whether <paramref name="a" /> is upper triangular as stored.</param> + /// <param name="transposeA">Whether to solve with <paramref name="a" />'s transpose.</param> + /// <returns>The solution vector.</returns> + /// <exception cref="IndexOutOfRangeException"><paramref name="a" /> is smaller than the system <paramref name="b" /> defines.</exception> + /// <remarks> + /// Plan 15: the GP's per-point posterior and its covariance cache solved <c>Lᵀ v = w</c> by transposing the + /// Cholesky factor first, an n × n allocation per call (on the large-object heap from about a hundred training + /// points) inside the acquisition's local search. Reading <c>a[j, i]</c> for <c>op(a)[i, j]</c> yields the same + /// coefficients, and the substitution direction follows from <paramref name="upper" /> XOR + /// <paramref name="transposeA" />, so the operations and their order are unchanged. + /// </remarks> + internal static double[] SolveTriangular(double[,] a, double[] b, bool upper, bool transposeA) + => TriSolveVec(a, b, upper, transposeA); + /// <summary> /// Triangular solve with a matrix right-hand side — torch's /// <c>solve_triangular(a, b, upper, left)</c>. <paramref name="left" /> <c>true</c> solves @@ -205,40 +264,253 @@ internal static double[] SolveTriangular(double[,] a, double[] b, bool upper) /// <param name="upper">Whether the supplied coefficient matrix is upper triangular.</param> /// <param name="left">True solves with the coefficient matrix on the left; false solves with it on the right.</param> /// <returns>The solution of the requested left- or right-sided triangular system.</returns> + /// <remarks> + /// <para> + /// Every right-hand side is solved with <see cref="TriSolveVec" />'s operations in its order: for each + /// unknown, <c>s = b[i]</c>, then <c>s -= op(a)[i, j] * x[j]</c> for the solved unknowns <c>j</c> in + /// ascending order, then <c>x[i] = s / op(a)[i, i]</c>. + /// </para> + /// <para> + /// <b>All right-hand sides at once (plan 15).</b> The right-hand sides are independent, so they are swept + /// together, one unknown at a time, by <see cref="SweepTriangular" /> over a row-major block holding one + /// right-hand side per column: each update is a row of the block minus a coefficient times an earlier row, + /// contiguous and vectorized across the right-hand sides, and each element still receives its + /// right-hand side's own sequence above. A left solve's right-hand sides are already <paramref name="b" />'s + /// columns; a right solve's are <paramref name="b" />'s rows, so the block is <paramref name="b" /> + /// transposed and the solution is transposed back. Before, each right-hand side was copied out, solved + /// through a captured accessor with two-dimensional bounds checks, and copied back, with two arrays + /// allocated per right-hand side: the GP sampler spent 43% of its time here (its kernel fit inverts the + /// Cholesky factor, its posterior solves thousands of candidate rows per call). + /// </para> + /// </remarks> internal static double[,] SolveTriangular(double[,] a, double[,] b, bool upper, bool left = true) { int rows = b.GetLength(0); int cols = b.GetLength(1); - int n = a.GetLength(0); var result = new double[rows, cols]; if (left) { - var column = new double[n]; - for (int c = 0; c < cols; c++) + // a X = b: the right-hand sides are b's columns, so b itself is the block (n unknowns × cols sides). The + // system's size is a's, as TriSolveVec took it. + int n = a.GetLength(0); + double[] block = System.Buffers.ArrayPool<double>.Shared.Rent(Math.Max(n * cols, 1)); + try { + var y = new Span<double>(block, 0, n * cols); for (int i = 0; i < n; i++) - column[i] = b[i, c]; - double[] solved = TriSolveVec(a, column, upper, transpose: false); + for (int c = 0; c < cols; c++) + y[i * cols + c] = b[i, c]; + SweepTriangular(a, upper, transpose: false, y, n, cols); for (int i = 0; i < n; i++) - result[i, c] = solved[i]; + for (int c = 0; c < cols; c++) + result[i, c] = y[i * cols + c]; + } + finally + { + System.Buffers.ArrayPool<double>.Shared.Return(block); } } else { - var rowVec = new double[n]; - for (int r = 0; r < rows; r++) + // X a = b, i.e. aᵀ Xᵀ = bᵀ: the right-hand sides are b's rows, so the block is bᵀ (n unknowns × rows sides). + int n = a.GetLength(0); + double[] block = System.Buffers.ArrayPool<double>.Shared.Rent(Math.Max(n * rows, 1)); + try + { + var y = new Span<double>(block, 0, n * rows); + for (int r = 0; r < rows; r++) + for (int j = 0; j < n; j++) + y[j * rows + r] = b[r, j]; + SweepTriangular(a, upper, transpose: true, y, n, rows); + for (int r = 0; r < rows; r++) + for (int j = 0; j < n; j++) + result[r, j] = y[j * rows + r]; + } + finally { - for (int j = 0; j < n; j++) - rowVec[j] = b[r, j]; - double[] solved = TriSolveVec(a, rowVec, upper, transpose: true); - for (int j = 0; j < n; j++) - result[r, j] = solved[j]; + System.Buffers.ArrayPool<double>.Shared.Return(block); } } return result; } + /// <summary> + /// Solves with a Cholesky factorization <c>C = L Lᵀ</c>: <c>C⁻¹ B</c> when <paramref name="left" />, else + /// <c>B C⁻¹</c>; exactly the values of the two triangular solves the GP stack spelled out: + /// <c>SolveTriangular(Lᵀ, SolveTriangular(L, B, upper: false), upper: true)</c> on the left, + /// <c>SolveTriangular(L, SolveTriangular(Lᵀ, B, upper: true, left: false), upper: false, left: false)</c> on the + /// right. + /// </summary> + /// <param name="l">The lower-triangular Cholesky factor L; its upper triangle is not read.</param> + /// <param name="b">The right-hand sides: n × k on the left, k × n on the right.</param> + /// <param name="left">True for <c>C⁻¹ B</c>, false for <c>B C⁻¹</c>.</param> + /// <returns>A new matrix of <paramref name="b" />'s shape holding the solution.</returns> + /// <exception cref="IndexOutOfRangeException"><paramref name="b" />'s solved dimension is smaller than <paramref name="l" />'s.</exception> + /// <remarks> + /// <para> + /// Plan 15: both triangular solves run on one block of right-hand sides (<paramref name="b" />, or its + /// transpose on the right), back to back, through <see cref="SweepTriangular" />: no intermediate matrix, no + /// materialized <c>Lᵀ</c>, two copies instead of four. The values are the same because each step reads the + /// same coefficients in the same order: solving with <c>Lᵀ</c> stored as an upper-triangular matrix reads + /// <c>Lᵀ[i, j]</c>, which is what sweeping <c>L</c> read transposed reads, and the substitution direction is + /// the same (back substitution). On the left the steps are L (forward) then <c>Lᵀ</c> (backward); on the + /// right, the first solve <c>X Lᵀ = B</c> is a forward sweep with <c>L</c> as stored and the second + /// <c>X L = …</c> a backward sweep with <c>L</c> read transposed: the same two sweeps over the transposed + /// block. + /// </para> + /// </remarks> + internal static double[,] CholeskySolve(double[,] l, double[,] b, bool left) + { + int rows = b.GetLength(0); + int cols = b.GetLength(1); + int n = l.GetLength(0); + var result = new double[rows, cols]; + // The block holds one right-hand side per column: b's columns on the left, b's rows (b transposed) on the right. + int width = left ? cols : rows; + double[] blockBuffer = System.Buffers.ArrayPool<double>.Shared.Rent(Math.Max(n * width, 1)); + try + { + var y = new Span<double>(blockBuffer, 0, n * width); + if (left) + { + for (int i = 0; i < n; i++) + for (int c = 0; c < cols; c++) + y[i * cols + c] = b[i, c]; + } + else + { + for (int r = 0; r < rows; r++) + for (int j = 0; j < n; j++) + y[j * rows + r] = b[r, j]; + } + + SweepTriangular(l, upper: false, transpose: false, y, n, width); // L, forward + SweepTriangular(l, upper: false, transpose: true, y, n, width); // Lᵀ, backward + + if (left) + { + for (int i = 0; i < n; i++) + for (int c = 0; c < cols; c++) + result[i, c] = y[i * cols + c]; + } + else + { + for (int r = 0; r < rows; r++) + for (int j = 0; j < n; j++) + result[r, j] = y[j * rows + r]; + } + } + finally + { + System.Buffers.ArrayPool<double>.Shared.Return(blockBuffer); + } + return result; + } + + /// <summary> + /// Solves <c>op(a) Y = B</c> in place for a block of right-hand sides, one per column of the row-major block + /// <paramref name="y" />, which holds <c>B</c> on entry and <c>Y</c> on return; <c>op(a)</c> is <paramref name="a" /> + /// or, with <paramref name="transpose" />, its transpose. Forward substitution when the effective system is lower + /// triangular (<paramref name="upper" /> XOR <paramref name="transpose" /> is false), back substitution otherwise. + /// </summary> + /// <param name="a">The triangular coefficient matrix in its stored orientation; only the effective triangle is read.</param> + /// <param name="upper">Whether <paramref name="a" /> is upper triangular as stored.</param> + /// <param name="transpose">Whether to solve with <paramref name="a" />'s transpose.</param> + /// <param name="y">The block, <paramref name="n" /> rows (unknowns) of <paramref name="width" /> right-hand sides, row-major.</param> + /// <param name="n">The number of unknowns per right-hand side; <paramref name="a" /> is at least n × n.</param> + /// <param name="width">The number of right-hand sides.</param> + /// <exception cref="IndexOutOfRangeException"><paramref name="a" /> is smaller than n × n or <paramref name="y" /> is shorter than n × width.</exception> + /// <remarks> + /// Row <c>i</c> starts as <c>b[i]</c>, then for each solved row <c>j</c> in ascending order becomes + /// <c>row_i - op(a)[i, j] * row_j</c>, then <c>row_i / op(a)[i, i]</c>: per element, exactly + /// <see cref="TriSolveVec" />'s <c>s -= op(a)[i, j] * x[j]</c> sequence and final division. Elements of a row + /// never mix, so the vector path computes each with the scalar path's operations (.NET never fuses the + /// multiplication and the subtraction on its own); the elements after the last whole vector take the scalar path. + /// </remarks> + private static void SweepTriangular(double[,] a, bool upper, bool transpose, Span<double> y, int n, int width) + { + // Transposition reverses which triangle holds the dependencies; XOR picks the substitution direction without + // materializing the transposed coefficient matrix, as TriSolveVec does. + bool effectiveUpper = upper ^ transpose; + if (!effectiveUpper) + { + for (int i = 0; i < n; i++) + { + Span<double> rowI = y.Slice(i * width, width); + for (int j = 0; j < i; j++) + SubtractScaledRow(rowI, transpose ? a[j, i] : a[i, j], y.Slice(j * width, width)); + DivideRow(rowI, a[i, i]); + } + } + else + { + for (int i = n - 1; i >= 0; i--) + { + Span<double> rowI = y.Slice(i * width, width); + for (int j = i + 1; j < n; j++) + SubtractScaledRow(rowI, transpose ? a[j, i] : a[i, j], y.Slice(j * width, width)); + DivideRow(rowI, a[i, i]); + } + } + } + + /// <summary><c>row[k] = row[k] - coefficient * other[k]</c> for every element, the substitution update of one unknown.</summary> + /// <param name="row">The row being solved; updated in place.</param> + /// <param name="coefficient">The coefficient of the already-solved unknown <paramref name="other" /> holds.</param> + /// <param name="other">An already-solved row, as long as <paramref name="row" />.</param> + /// <exception cref="IndexOutOfRangeException"><paramref name="other" /> is shorter than <paramref name="row" />.</exception> + private static void SubtractScaledRow(Span<double> row, double coefficient, ReadOnlySpan<double> other) + { + int width = row.Length; + if (System.Numerics.Vector.IsHardwareAccelerated && width >= System.Numerics.Vector<double>.Count) + { + // Vector path: whole vectors here, the elements after the last one on the scalar path below. + int vectorWidth = System.Numerics.Vector<double>.Count; + var coefficients = new System.Numerics.Vector<double>(coefficient); + int k = 0; + for (; k <= width - vectorWidth; k += vectorWidth) + { + var updated = new System.Numerics.Vector<double>(row[k..]) - coefficients * new System.Numerics.Vector<double>(other[k..]); + updated.CopyTo(row[k..]); + } + for (; k < width; k++) + row[k] -= coefficient * other[k]; + } + else + { + // Scalar path: no vector hardware, or a row narrower than one vector. + for (int k = 0; k < width; k++) + row[k] -= coefficient * other[k]; + } + } + + /// <summary><c>row[k] = row[k] / divisor</c> for every element: the final division by the unknown's diagonal coefficient.</summary> + /// <param name="row">The row being solved; updated in place.</param> + /// <param name="divisor">The diagonal coefficient.</param> + /// <remarks>A division, never a multiplication by the reciprocal, which would round differently.</remarks> + private static void DivideRow(Span<double> row, double divisor) + { + int width = row.Length; + if (System.Numerics.Vector.IsHardwareAccelerated && width >= System.Numerics.Vector<double>.Count) + { + // Vector path: whole vectors here, the elements after the last one on the scalar path below. + int vectorWidth = System.Numerics.Vector<double>.Count; + var divisors = new System.Numerics.Vector<double>(divisor); + int k = 0; + for (; k <= width - vectorWidth; k += vectorWidth) + (new System.Numerics.Vector<double>(row[k..]) / divisors).CopyTo(row[k..]); + for (; k < width; k++) + row[k] /= divisor; + } + else + { + // Scalar path: no vector hardware, or a row narrower than one vector. + for (int k = 0; k < width; k++) + row[k] /= divisor; + } + } + /// <summary> /// Solve <c>op(a) x = b</c> where <c>op(a)</c> is <c>a</c> (<paramref name="transpose" /> /// <c>false</c>) or <c>aᵀ</c> (<c>true</c>), <paramref name="a" /> triangular. The effective diff --git a/src/OptunaSharp.Core/Internal/MathUtil.cs b/src/OptunaSharp.Core/Internal/MathUtil.cs index 6711fb3..c9d81e7 100644 --- a/src/OptunaSharp.Core/Internal/MathUtil.cs +++ b/src/OptunaSharp.Core/Internal/MathUtil.cs @@ -1,5 +1,7 @@ using System; using System.Globalization; +using System.Runtime.CompilerServices; +using NumSharp.Utilities; namespace OptunaSharp.Internal; @@ -30,82 +32,193 @@ internal static double NextAfter(double x, double y) return y > x ? Math.BitIncrement(x) : Math.BitDecrement(x); } - /// <summary>NumPy <c>np.clip(value, low, high)</c> for scalars (NaN propagates).</summary> - /// <param name="value">The value to convert, format, or compare using the operation's stated convention.</param> - /// <param name="low">The lower endpoint of the allowed range.</param> - /// <param name="high">The upper endpoint of the allowed range.</param> - /// <returns>The value clamped to the interval; NaN propagates.</returns> - internal static double Clip(double value, double low, double high) - => Math.Min(Math.Max(value, low), high); - /// <summary> - /// C99 / NumPy <c>np.log1p(x)</c> — <c>log(1 + x)</c> accurate for small <c>x</c>. .NET has - /// no <c>Math.Log1p</c>; this correction-term form (<c>log(u) - ((u-1) - x)/u</c>, u = 1+x) - /// is bit-identical to NumPy's <c>log1p</c> because <see cref="Math.Log(double)" /> already - /// matches NumPy's <c>np.log</c> bit-for-bit (verified over 220k points, 0 ULP). + /// NumPy's <c>np.isclose(a, b, rtol, atol, equal_nan)</c> for two Python floats, in NumPy's own statements: + /// <c>(|a - b| <= atol + rtol * |b|) & isfinite(b) | (a == b)</c>, plus "both NaN" when + /// <paramref name="equalNan" /> is set. Use it wherever Optuna calls <c>np.isclose</c> on scalars in a loop. /// </summary> - /// <param name="x">The scalar argument.</param> - /// <returns>The natural logarithm of one plus the argument, with correction near zero.</returns> - internal static double Log1p(double x) + /// <param name="a">The value tested (NumPy's <c>a</c>).</param> + /// <param name="b">The reference value the relative tolerance scales with (NumPy's <c>b</c>; the test is not symmetric).</param> + /// <param name="rtol">The relative tolerance; NumPy's default is <c>1e-5</c>.</param> + /// <param name="atol">The absolute tolerance; NumPy's default is <c>1e-8</c>.</param> + /// <param name="equalNan">Whether two NaNs compare as close.</param> + /// <returns> + /// Whether <paramref name="a" /> is within tolerance of <paramref name="b" />. Two equal infinities are close + /// (<c>a == b</c>); a finite value is never close to an infinity, and two different infinities are not close. + /// </returns> + /// <remarks> + /// The <c>isfinite(b)</c> and <c>a == b</c> terms are what a bare <c>|a - b| <= atol + rtol * |b|</c> misses: + /// with <c>b = inf</c> that inequality holds for every finite <c>a</c> (<c>inf <= inf</c>), and with + /// <c>a = b = inf</c> it fails (<c>inf - inf</c> is NaN). NumSharp's <c>np.isclose</c> computes the same answers + /// (the unit tests compare the two on the edge cases), but a scalar call through it costs about 9 µs (two 0-d + /// arrays and a result) against a few nanoseconds here, and callers such as <c>Study.ShouldSkipEnqueue</c> compare + /// every parameter of every trial. + /// </remarks> + internal static bool IsClose(double a, double b, double rtol = 1e-5, double atol = 1e-8, bool equalNan = false) { - if (double.IsNaN(x)) - return double.NaN; - double u = 1.0 + x; - if (u == 1.0) - return x; // |x| below the rounding of 1 + x (incl. x == 0): log1p(x) == x. - if (u <= 0.0) - return Math.Log(u); // x <= -1: -inf at x == -1, NaN below — same as np.log(1 + x). - if (double.IsPositiveInfinity(u)) - return Math.Log(u); - return Math.Log(u) - ((u - 1.0) - x) / u; + // numpy.isclose: less_equal(abs(x - y), atol + rtol * abs(y)) & isfinite(y) | (x == y); the comparisons are false + // for a NaN operand, as NumPy's are under errstate(invalid='ignore'). + bool close = Math.Abs(a - b) <= atol + rtol * Math.Abs(b) && double.IsFinite(b) || a == b; + // if equal_nan: result |= isnan(x) & isnan(y) + if (equalNan && double.IsNaN(a) && double.IsNaN(b)) + close = true; + return close; } - private static readonly double Loge2 = Math.Log(2.0); + /// <summary> + /// NumPy <c>np.clip(value, low, high)</c> where the bounds are scalars — NumPy's CONST loop + /// (<c>_npy_clip_const_minmax_</c>): <c>value</c> is kept unless it lies strictly outside, so a tie keeps the + /// value's own zero sign. Use it where Optuna clips a scalar, a 0-d value, or an array against scalar bounds. + /// </summary> + /// <param name="value">The value to clip; a NaN stays NaN.</param> + /// <param name="low">The lower bound; a NaN lower bound is the result.</param> + /// <param name="high">The upper bound; a NaN upper bound is the result when <paramref name="low" /> is not NaN.</param> + /// <returns> + /// <paramref name="low" /> when the value is below it, <paramref name="high" /> when above it, else the value + /// itself (<c>np.clip(-0.0, 0.0, 1.0)</c> is <c>-0.0</c>); the NaN bound when a bound is NaN. + /// </returns> + /// <remarks> + /// <para> + /// NumPy picks the loop per inner-loop call: with both bound strides 0 (scalar or 0-d bounds, a scalar value, + /// or a column against one-element bounds) it runs <c>x < lo ? lo : x; x > hi ? hi : x</c>, after + /// filling the call with a NaN bound when there is one; otherwise <see cref="ClipGeneral" />. The former + /// <c>Math.Min(Math.Max(x, low), high)</c> orders <c>-0.0</c> below <c>+0.0</c>, so a tie at a zero bound + /// took the other zero (QA-30: a stepped float with upper bound <c>-0.0</c> stored <c>-0.0</c> for its top + /// grid point where Optuna stores <c>0.0</c>). + /// </para> + /// <para> + /// NumSharp's <c>np.clip</c> makes the same decision (its port of NumPy's const-loop test) and gives the same + /// answers (the unit tests compare them); this scalar form avoids a NumSharp call per sampled value. + /// </para> + /// </remarks> + internal static double Clip(double value, double low, double high) + { + // "min_val and/or max_val are nans": the call is filled with the NaN bound, the lower one first. + if (double.IsNaN(low)) + return low; + if (double.IsNaN(high)) + return high; + // The comparisons are false for a NaN value, which therefore passes through. + if (value < low) + value = low; + if (value > high) + value = high; + return value; + } /// <summary> - /// C99 / NumPy <c>np.expm1(x)</c> — <c>exp(x) - 1</c> accurate for small <c>x</c>. .NET has - /// no <c>Math.Expm1</c>; this Kahan form (<c>(u-1)*x/log(u)</c>, u = exp(x)) is bit-identical - /// to NumPy's <c>expm1</c> because <see cref="Math.Exp(double)" />/<see cref="Math.Log(double)" /> - /// already match NumPy's <c>np.exp</c>/<c>np.log</c> bit-for-bit (verified against Python over - /// the TPE truncnorm input range). + /// NumPy <c>np.clip</c>'s GENERAL loop for one element, <c>_NPY_MIN(_NPY_MAX(x, lo), hi)</c>: what an + /// inner-loop call with array bounds (a nonzero bound stride) computes. A tie takes the bound. /// </summary> - /// <param name="x">The scalar argument.</param> - /// <returns>The exponential of the argument minus one, with correction near zero.</returns> - internal static double Expm1(double x) + /// <param name="value">The value to clip; a NaN stays NaN.</param> + /// <param name="low">The lower bound for this element.</param> + /// <param name="high">The upper bound for this element.</param> + /// <returns> + /// <c>max = isnan(x) ? x : (x > lo ? x : lo)</c>, then <c>isnan(max) ? max : (max < hi ? max : hi)</c>: a value + /// equal to a bound comes back as the bound (<c>-0.0</c> against a <c>+0.0</c> bound is <c>+0.0</c>), and a NaN + /// bound is the result unless the value is NaN. + /// </returns> + /// <remarks> + /// TPE's discrete rounding, <c>np.clip(..., low_d, high_d)</c> over an (n, k) block with per-column bounds, runs + /// this loop when k >= 2 (the inner loop walks the k columns, so the bounds have a stride); with one discrete + /// column the bounds broadcast with stride 0 and NumPy runs <see cref="Clip" />'s const loop instead (measured on + /// NumPy 2.4.2, 2026-11-11). NumSharp's <c>np.clip</c> agrees on both layouts. + /// </remarks> + internal static double ClipGeneral(double value, double low, double high) { - if (double.IsNaN(x)) - return double.NaN; - double u = Math.Exp(x); - if (u == 1.0) - return x; // |x| below the rounding of exp(x): expm1(x) == x. - double y = u - 1.0; - if (y == -1.0) - return -1.0; // exp(x) underflowed to 0 (x very negative). - if (double.IsPositiveInfinity(u)) - return u; // overflow. - return y * x / Math.Log(u); + // clip.cpp: _NPY_MAX(a, b) = npy_isnan(a) ? a : PyArray_MAX(a, b), PyArray_MAX(a, b) = a > b ? a : b. + double max = double.IsNaN(value) ? value : (value > low ? value : low); + // _NPY_MIN(a, b) = npy_isnan(a) ? a : PyArray_MIN(a, b), PyArray_MIN(a, b) = a < b ? a : b. + return double.IsNaN(max) ? max : (max < high ? max : high); } /// <summary> - /// NumPy <c>np.logaddexp(a, b) = log(exp(a) + exp(b))</c>, computed stably. Reproduces - /// NumPy's <c>npy_logaddexp</c> exactly (the <c>a == b</c> branch adds <c>log(2)</c> and - /// handles the infinities); bit-identical to Python because it rides on the bit-exact - /// <see cref="Log1p" /> and <see cref="Math.Exp(double)" />. + /// NumPy's float64 <c>np.log1p(x)</c> for one value, bit for bit and without allocating: it runs NumSharp's public + /// model of the UCRT routine NumPy calls (<see cref="NDLog1pExpm1Math.Log1p(double)" />), so a scalar call costs a + /// few flops, never a 0-d <c>NDArray</c> left to the finalizer. + /// </summary> + /// <param name="x">The argument; any double, including NaN and the infinities.</param> + /// <returns> + /// <c>log(1 + x)</c>, accurate near zero: <c>x</c> itself when <c>1 + x</c> rounds to 1, <c>-inf</c> at + /// <c>x == -1</c>, the positive quiet NaN below <c>-1</c> (as the UCRT returns it), <c>+inf</c> at <c>+inf</c>, + /// and a NaN argument passed through with its payload. + /// </returns> + /// <remarks> + /// <para> + /// The model is Goldberg's correction over the UCRT's own <c>log</c>, + /// <c>u = 1 + x; log(u) - ((u - 1) - x) / u</c>, the form this helper used to inline. Measured against NumPy + /// 2.4.2 on Windows (2026-11-11, 600,000 seeded inputs over (-1, 1), tiny magnitudes and [1, 1e6]): 100% + /// bit-identical, as was the former inline copy, so the switch to NumSharp changed no finite result. + /// </para> + /// <para> + /// The only observable difference from the former copy is a NaN's bits: a NaN argument now keeps its payload + /// instead of becoming <see cref="double.NaN" />, and <c>x < -1</c> yields the positive quiet NaN where + /// <see cref="Math.Log(double)" /> of a negative number returned the negative one. Both are NaN to every + /// comparison; only code hashing raw bits could tell them apart. + /// </para> + /// </remarks> + [MethodImpl(MethodImplOptions.AggressiveInlining)] + internal static double Log1p(double x) => NDLog1pExpm1Math.Log1p(x); + + /// <summary> + /// NumPy's float64 <c>np.expm1(x)</c> for one value, without allocating, through NumSharp's public model of the + /// UCRT routine NumPy calls (<see cref="NDLog1pExpm1Math.Expm1(double)" />): NumPy's exact bits outside + /// <c>[-ln 2, ln 1.5]</c>, within 2 ulp of them inside that band. Prefer it over any hand-written formula; none + /// reproduces the UCRT inside the band. + /// </summary> + /// <param name="x">The argument; any double, including NaN and the infinities.</param> + /// <returns> + /// <c>exp(x) - 1</c>, accurate near zero: <c>-1</c> once <c>exp(x)</c> underflows (and for <c>-inf</c>), + /// <c>+inf</c> on overflow, a zero's sign kept, and a NaN argument passed through with its payload. + /// </returns> + /// <remarks> + /// <para> + /// <b>Why NumSharp's model and not Kahan's formula.</b> Outside the band the UCRT returns exactly + /// <c>exp(x) - 1</c>, which the model reproduces. Inside it the UCRT evaluates an undocumented polynomial + /// that is not correctly rounded and that no public formula reproduces, so the model runs Sun's + /// <c>s_expm1.c</c>, the closest known. This helper used to compute Kahan's <c>(u - 1) * x / log(u)</c> + /// with <c>u = exp(x)</c>, documented as bit-identical to NumPy; measured on 2026-11-11 against NumPy 2.4.2 + /// on Windows (200,000 seeded inputs per range), it was not: + /// </para> + /// <list type="bullet"> + /// <item><description>outside the band: Kahan 82.0% equal (worst 2 ulp); the model 100%;</description></item> + /// <item><description><c>(-0.01, 0]</c>, <see cref="TruncNorm.NdtriExp" />'s flip branch: Kahan 62.4% (worst 3 ulp); the model 69.6% (worst 2);</description></item> + /// <item><description><c>[0.01, 5]</c>, its initial-guess branch: Kahan 84.3% (worst 3 ulp); the model 96.7% (worst 2);</description></item> + /// <item><description>the whole band: Kahan 50.9% (worst 4 ulp); the model 58.2% (worst 3).</description></item> + /// </list> + /// <para> + /// <b>Consequence.</b> The switch moves TPE's truncated-normal quantiles (<see cref="TruncNorm.NdtriExp" /> + /// seeds its Newton iteration with this value) closer to NumPy's; it also changes their last bits relative + /// to OptunaSharp builds before the switch, so a seeded TPE study can differ from an earlier release in the + /// low bits. TPE's live parity was already erf-tolerance parity (the documented <see cref="Erf" /> class), and + /// the residual in-band difference stays within that class. + /// </para> + /// </remarks> + [MethodImpl(MethodImplOptions.AggressiveInlining)] + internal static double Expm1(double x) => NDLog1pExpm1Math.Expm1(x); + + /// <summary> + /// NumPy's float64 <c>np.logaddexp(a, b) = log(exp(a) + exp(b))</c> for one pair, bit for bit and without + /// allocating: NumSharp's public port of NumPy's <c>npy_logaddexp</c> statements + /// (<see cref="NDLogAddExpMath.LogAddExp(double, double)" />) over the same UCRT <c>log1p</c> model as + /// <see cref="Log1p" />. Use it wherever Optuna combines log-probabilities, including the cancellation regime + /// (<c>a ≈ b</c>), where a <c>log1p</c> one ulp off is amplified into many result ulps. /// </summary> /// <param name="a">The logarithm of the first nonnegative addend.</param> /// <param name="b">The logarithm of the second nonnegative addend.</param> - /// <returns>The natural logarithm of exp(a) + exp(b), computed without unnecessary overflow.</returns> - internal static double LogAddExp(double a, double b) - { - if (a == b) - return a + Loge2; // Also covers a == b == ±inf. - double tmp = a - b; - if (tmp > 0) - return a + Log1p(Math.Exp(-tmp)); - if (tmp <= 0) - return b + Log1p(Math.Exp(tmp)); - return tmp; // NaN input. - } + /// <returns> + /// The natural logarithm of <c>exp(a) + exp(b)</c>, computed without overflow: <c>a + log(2)</c> when + /// <c>a == b</c> (same-signed infinities included), and NaN when either argument is NaN. + /// </returns> + /// <remarks> + /// The statements are the ones this helper used to inline (the <c>a == b</c> shortcut, then the larger argument + /// plus <c>log1p(exp(-|a - b|))</c>). Measured against NumPy 2.4.2 on Windows (2026-11-11, 400,000 seeded pairs, + /// near-equal and wide): 100% bit-identical, as was the former copy. NumSharp's own <c>np.logaddexp</c> ran an + /// fdlibm <c>log1p</c> one ulp off until its commit <c>16b0817a</c> (2026-11-05, release 0.80.0), which is why the + /// copy existed. + /// </remarks> + [MethodImpl(MethodImplOptions.AggressiveInlining)] + internal static double LogAddExp(double a, double b) => NDLogAddExpMath.LogAddExp(a, b); /// <summary> /// NumPy's <c>np.add.reduce</c> pairwise summation for a contiguous float64 array — the @@ -160,28 +273,32 @@ internal static double PairwiseSum(double[] a, int offset, int n) } /// <summary> - /// NumPy <c>np.linspace(start, stop, num)</c> (endpoint=True) — bit-identical to NumPy for - /// the common case: <c>y[i] = i * step + start</c> with <c>step = (stop - start) / (num - 1)</c>, - /// and the final element pinned to <paramref name="stop" /> exactly. + /// NumPy <c>np.linspace(start, stop, num)</c> (endpoint=True), computed by NumSharp's <c>np.linspace</c>, which ports + /// every branch NumPy takes, so the grid is NumPy's in every case, a step that underflows to zero included. Meant + /// for the visualization grids and ticks (a call or two per plot); hot loops keep their own copies. /// </summary> /// <param name="start">The inclusive start of the interval or slice.</param> /// <param name="stop">The final value of the generated numerical interval.</param> - /// <param name="num">The number of values in the output grid.</param> - /// <returns>An evenly spaced grid including both endpoints when at least two values are requested.</returns> + /// <param name="num">The number of values in the output grid; zero or less gives an empty grid.</param> + /// <returns> + /// An evenly spaced grid: <c>i * step + start</c>, the last element exactly <paramref name="stop" /> when there are + /// two or more, <c>(i / (num - 1)) * (stop - start) + start</c> when the step underflows to zero, and for one + /// element <c>0 * (stop - start) + start</c> (NaN when an end is infinite). + /// </returns> + /// <remarks> + /// The former inline loop always took <c>i * step + start</c>. Over a subnormal range NumPy's step + /// <c>delta / (num - 1)</c> is zero and NumPy switches to scaling <c>i / div</c> by <c>delta</c> (gh-5437), so every + /// point but the last collapsed onto <paramref name="start" /> here: an EDF over values <c>0.0</c> and <c>5e-324</c> + /// stayed at 0.5 until its last point where Optuna's reaches 1.0 at point 50 (parity QA-54). A negative + /// <paramref name="num" /> keeps returning an empty grid instead of NumPy's <c>ValueError</c>, as before, because no + /// caller passes one. + /// </remarks> internal static double[] Linspace(double start, double stop, int num) { if (num <= 0) return Array.Empty<double>(); - if (num == 1) - return new[] { start }; - - int div = num - 1; - double step = (stop - start) / div; - var y = new double[num]; - for (int i = 0; i < num; i++) - y[i] = i * step + start; // arange(num) * step + start. - y[^1] = stop; // endpoint override. - return y; + using NumSharp.NDArray grid = NumSharp.np.linspace(start, stop, num); + return grid.ToArray<double>(); } /// <summary> diff --git a/src/OptunaSharp.Core/Internal/NumPyDraws.cs b/src/OptunaSharp.Core/Internal/NumPyDraws.cs new file mode 100644 index 0000000..fd2818c --- /dev/null +++ b/src/OptunaSharp.Core/Internal/NumPyDraws.cs @@ -0,0 +1,146 @@ +using System; +using NumSharp; + +namespace OptunaSharp.Internal; + +/// <summary> +/// NumPy random draws read into managed values without leaving a NumSharp array to the finalizer (plan 14). Use these +/// on per-trial and per-parameter paths instead of casting a draw (<c>(double)rng.rand()</c>): the draws, their order, +/// their bits and the generator's next state are exactly the cast's. +/// </summary> +/// <remarks> +/// <para><b>Why it matters.</b> Every NumSharp <see cref="NDArray" /> carries a finalizer. One that is never disposed +/// survives its first garbage collection on the finalization queue and is promoted, so a hot path that drops arrays +/// turns almost every gen-0 collection into a gen-1 collection. Measured before plan 14 on 40-parameter studies: GC +/// pauses were 47 % of random search's time and 41 % of NSGA-II's, from exactly such per-parameter draws.</para> +/// <para><b>Two ways, one stream.</b> The uniform draws (<see cref="Rand(NumPyRandom)" />, <see cref="Rand(NumPyRandom, int)" />, +/// <see cref="RandomSample" />, <see cref="Uniform" />) read the generator's bit generator directly, as NumSharp's own +/// scalar and fill paths do: one <see cref="BitGenerator.NextDouble" /> per value (NumPy's <c>next_double</c>, for +/// MT19937 the 27 + 26 bits of two consecutive words), under the bit generator's <see cref="BitGenerator.@lock" />, so +/// no array is created at all. The draws whose algorithm carries more state (<see cref="RandInt" />'s masked rejection, +/// <see cref="Normal(NumPyRandom, double, double)" />'s cached polar Gaussian) call NumSharp and dispose the array it +/// returns. <c>NumPyDrawsTests</c> pins each helper against the NumSharp call it replaces, value and next +/// state, on generators seeded alike.</para> +/// <para><b>Concurrency.</b> Each call takes the bit generator's lock for its own draws, as a NumSharp call does; a +/// helper never caches the bit generator, so a reseed (<c>rng.seed(...)</c>) is seen by the next call.</para> +/// </remarks> +internal static class NumPyDraws +{ + /// <summary>NumPy <c>rng.rand()</c> (<c>random_sample()</c>): one uniform draw in [0, 1) as a <see cref="double" />.</summary> + /// <param name="rng">The generator to draw from; its state advances exactly as <c>rng.rand()</c> advances it.</param> + /// <returns>The drawn value.</returns> + internal static double Rand(NumPyRandom rng) + { + BitGenerator bitGenerator = rng.get_bit_generator(); + lock (bitGenerator.@lock) + return bitGenerator.NextDouble(); + } + + /// <summary>NumPy <c>rng.rand(n)</c>: <paramref name="n" /> uniform draws in [0, 1), in draw order.</summary> + /// <param name="rng">The generator to draw from; its state advances exactly as <c>rng.rand(n)</c> advances it.</param> + /// <param name="n">The number of draws; zero draws nothing and returns an empty array.</param> + /// <returns>A new array holding the draws in the order NumPy fills them.</returns> + /// <exception cref="ValueError"><paramref name="n" /> is negative (NumPy's negative-dimension error); nothing is drawn.</exception> + internal static double[] Rand(NumPyRandom rng, int n) => RandomSample(rng, n); + + /// <summary>NumPy <c>rng.random_sample(n)</c>: <paramref name="n" /> uniform draws in [0, 1), in draw order.</summary> + /// <param name="rng">The generator to draw from; its state advances exactly as <c>rng.random_sample(n)</c> advances it.</param> + /// <param name="n">The number of draws; zero draws nothing and returns an empty array.</param> + /// <returns>A new array holding the draws in the order NumPy fills them.</returns> + /// <exception cref="ValueError"><paramref name="n" /> is negative (NumPy's negative-dimension error); nothing is drawn.</exception> + internal static double[] RandomSample(NumPyRandom rng, long n) + { + if (n < 0) + throw new ValueError("negative dimensions are not allowed"); + var draws = new double[n]; + BitGenerator bitGenerator = rng.get_bit_generator(); + // One lock for the whole fill, as NumSharp's random_sample(n) holds it: the n values are consecutive in the stream + // even when another thread shares the generator. + lock (bitGenerator.@lock) + { + for (long i = 0; i < n; i++) + draws[i] = bitGenerator.NextDouble(); + } + return draws; + } + + /// <summary>NumPy <c>rng.randint(low, high)</c>: one integer draw in [<paramref name="low" />, <paramref name="high" />).</summary> + /// <param name="rng">The generator to draw from; its state advances exactly as <c>rng.randint(low, high)</c> advances it.</param> + /// <param name="low">The smallest value that can be drawn.</param> + /// <param name="high">One past the largest value that can be drawn.</param> + /// <returns>The drawn value, as the 64-bit integer NumPy's default <c>randint</c> dtype holds.</returns> + /// <remarks>Calls NumSharp's <c>randint</c>, whose masked rejection sampling consumes a data-dependent number of words, and disposes the 0-d array it returns.</remarks> + /// <exception cref="ValueError"><paramref name="high" /> is not greater than <paramref name="low" /> (NumPy's <c>low >= high</c> error).</exception> + internal static long RandInt(NumPyRandom rng, long low, long high) + { + using NDArray draw = rng.randint(low, high); + return (long)draw; + } + + /// <summary>NumPy <c>rng.uniform(low, high)</c> with scalar bounds: <c>low + (high - low) * U</c> for one uniform <c>U</c>.</summary> + /// <param name="rng">The generator to draw from; its state advances exactly as <c>rng.uniform(low, high)</c> advances it.</param> + /// <param name="low">The lower bound of the draw.</param> + /// <param name="high">The upper bound of the draw.</param> + /// <returns>The drawn value.</returns> + /// <remarks> + /// NumPy's <c>random_uniform</c>, <c>lower + range * next_double</c>, with the range computed first and checked for + /// finiteness before anything is drawn, as both NumPy and NumSharp do. With one-element bound arrays NumPy computes the + /// same expression from the same uniform, so drawing a bounds column one row at a time with this helper reproduces + /// <c>rng.uniform(bounds[:, 0], bounds[:, 1])</c> bit for bit, as long as no range is infinite (the array form raises + /// before its first draw, a row-by-row loop only when it reaches the bad row). + /// </remarks> + /// <exception cref="OverflowError"> + /// <c>high - low</c> is infinite or NaN: NumPy's <c>OverflowError('Range exceeds valid bounds')</c>, the class + /// NumSharp's <c>uniform</c> raises since 0.81.0; nothing is drawn. Footgun: it is not .NET's + /// <see cref="OverflowException" />, so a <c>catch (OverflowException)</c> misses it; catch <see cref="OverflowError" /> + /// or <see cref="ArithmeticException" />. + /// </exception> + internal static double Uniform(NumPyRandom rng, double low, double high) + { + double range = high - low; + // NumPy (and NumSharp) check the range before drawing, so a bad range leaves the stream where it was. + if (!double.IsFinite(range)) + throw new OverflowError("Range exceeds valid bounds"); + return low + range * Rand(rng); + } + + /// <summary>NumPy <c>rng.normal(loc, scale)</c>: one Gaussian draw as a <see cref="double" />.</summary> + /// <param name="rng">The generator to draw from; its state, including the cached second Gaussian of the polar method, advances exactly as <c>rng.normal(loc, scale)</c> advances it.</param> + /// <param name="loc">The mean of the distribution.</param> + /// <param name="scale">The standard deviation of the distribution.</param> + /// <returns>The drawn value.</returns> + /// <exception cref="ValueError"><paramref name="scale" /> is negative (NumPy's <c>scale < 0</c> error).</exception> + internal static double Normal(NumPyRandom rng, double loc, double scale) + { + using NDArray draw = rng.normal(loc, scale); + return (double)draw; + } + + /// <summary>NumPy <c>rng.normal(loc, scale, size=n)</c>: <paramref name="n" /> Gaussian draws, in draw order.</summary> + /// <param name="rng">The generator to draw from; its state advances exactly as <c>rng.normal(loc, scale, n)</c> advances it.</param> + /// <param name="loc">The mean of the distribution.</param> + /// <param name="scale">The standard deviation of the distribution.</param> + /// <param name="n">The number of draws.</param> + /// <returns>A new array holding the draws in the order NumPy fills them.</returns> + /// <exception cref="ValueError"><paramref name="scale" /> is negative, or <paramref name="n" /> is negative.</exception> + internal static double[] Normal(NumPyRandom rng, double loc, double scale, int n) + { + using NDArray draws = rng.normal(loc, scale, new Shape(n)); + return draws.ToArray<double>(); + } + + /// <summary>NumPy <c>rng.randn(n)</c>: <paramref name="n" /> standard normal draws, in draw order (plan 15).</summary> + /// <param name="rng">The generator to draw from; its state, including the cached second Gaussian of the polar method, advances exactly as <c>rng.randn(n)</c> advances it.</param> + /// <param name="n">The number of draws.</param> + /// <returns>A new array holding the draws in the order NumPy fills them.</returns> + /// <remarks> + /// The very NumSharp call the samplers made (<c>rng.randn(n).ToArray<double>()</c>), with the array it returns + /// disposed instead of left to the finalizer: CMA-ES draws one per sampled point, so each ask dropped at least one + /// finalizable array. Whatever NumSharp's <c>randn</c> throws for a bad count propagates unchanged. + /// </remarks> + internal static double[] Randn(NumPyRandom rng, int n) + { + using NDArray draws = rng.randn(n); + return draws.ToArray<double>(); + } +} diff --git a/src/OptunaSharp.Core/Internal/OptunaWarnings.cs b/src/OptunaSharp.Core/Internal/OptunaWarnings.cs index a90c921..5b30634 100644 --- a/src/OptunaSharp.Core/Internal/OptunaWarnings.cs +++ b/src/OptunaSharp.Core/Internal/OptunaWarnings.cs @@ -30,6 +30,13 @@ internal enum WarningCategory /// through. .NET has no warnings module, so warnings surface on the logging seam at /// WARNING level; tests can intercept them via <see cref="WarningRaised" />. /// </summary> +/// <remarks> +/// A deliberate difference from Optuna, kept by the owner's decision of 2026-11-12 (QA-77, pinned by +/// <c>Run2WarningParityBugTests</c>): Python's <c>warnings.warn</c> prints to stderr outside <c>optuna.logging</c>, +/// once per message, category and call site under the default filters. Here every occurrence goes through the +/// <c>optuna</c> logger, so a log handler sees warnings, <c>OptunaLogging.SetVerbosity(LogLevel.Error)</c> hides them +/// (Python still prints them), and a warning repeated by every trial is logged every time (Python shows it once). +/// </remarks> internal static class OptunaWarnings { private static readonly Logger _logger = OptunaLogging.GetLogger("optuna"); diff --git a/src/OptunaSharp.Core/Internal/PyIntSet.cs b/src/OptunaSharp.Core/Internal/PyIntSet.cs new file mode 100644 index 0000000..c67a8ea --- /dev/null +++ b/src/OptunaSharp.Core/Internal/PyIntSet.cs @@ -0,0 +1,327 @@ +using System; +using System.Collections.Generic; + +namespace OptunaSharp.Internal; + +/// <summary> +/// CPython's <c>set</c> of non-negative ints, modeled closely enough to reproduce its iteration order +/// (<c>list(s)</c>): the open-addressing hash table of CPython 3.12's <c>Objects/setobject.c</c>, where +/// <c>hash(k) == k</c>. +/// </summary> +/// <remarks> +/// <para> +/// Optuna lists some candidates in set order and then indexes the list with a random draw, so any other order +/// (ascending, or a <see cref="HashSet{T}" />'s insertion order) picks another candidate for the same draw. +/// GridSampler's <c>rng.choice(list(set(range(n)) - set(visited) - set(running)))</c> is the use this serves +/// (QA-68): <c>list(set(range(16)) - {0, 1, 2, 3, 5, 6, 7, 9, 10, 12, 13, 14, 15})</c> is <c>[8, 11, 4]</c>, +/// because the difference builds a fresh 8-slot table where 8 and 11 wrap onto slots 0 and 3. +/// </para> +/// <para> +/// Modeled: the 8-slot minimum table; the probe sequence (the home slot and up to 9 linear probes, then +/// <c>i = (i * 5 + 1 + perturb) & mask</c> with <c>perturb >>= 5</c>); growth on insert once +/// <c>fill * 5 >= mask * 3</c>, to the first power of two above <c>used * 4</c> (<c>used * 2</c> past 50,000 +/// elements); the dummy a discard leaves, which an insert reuses (the last one its probe passed) and a +/// difference update purges once dummies exceed a quarter of the table; <c>set_merge</c>'s copy; and +/// <c>set_difference</c>'s two strategies (copy, then discard, when this set is more than four times the other; +/// otherwise a fresh set filled in this set's slot order). Only what GridSampler needs is exposed, and the +/// committed corpus <c>oracle/cpython_order.json</c>, recorded with CPython 3.12, checks it. +/// </para> +/// <para> +/// Not thread-safe; each instance is built, read and dropped within one call. A table holds <c>int</c> slots, +/// 4 bytes per slot and at most about 8 slots per element, so a grid of a million points briefly costs +/// ~16 MB, as <c>set(range(n))</c> costs CPython. +/// </para> +/// </remarks> +internal sealed class PyIntSet +{ + /// <summary><c>PySet_MINSIZE</c>: the smallest table, the one every new set starts with.</summary> + private const int MinSize = 8; + + /// <summary><c>LINEAR_PROBES</c>: slots probed past the home slot before the perturbed jump.</summary> + private const int LinearProbes = 9; + + /// <summary><c>PERTURB_SHIFT</c>: how far the perturbation shifts right on every jump.</summary> + private const int PerturbShift = 5; + + /// <summary>A never-used slot (CPython's NULL key): it ends every probe sequence.</summary> + private const int Empty = -1; + + /// <summary>A discarded slot (CPython's dummy key): probes pass it, inserts may reuse it, iteration skips it.</summary> + private const int Dummy = -2; + + /// <summary>The slots: a key (>= 0), <see cref="Empty" /> or <see cref="Dummy" />; the length is a power of two.</summary> + private int[] _table = NewTable(MinSize); + + /// <summary>CPython's <c>fill</c>: active plus dummy slots, which drives growth.</summary> + private int _fill; + + /// <summary>CPython's <c>used</c>: active slots, the set's length.</summary> + private int _used; + + /// <summary>The number of elements, <c>len(s)</c>.</summary> + internal int Count => _used; + + /// <summary><c>set(range(n))</c>: the ints 0 to <paramref name="n" /> - 1, inserted one by one as CPython does.</summary> + /// <param name="n">The number of elements; 0 gives an empty set.</param> + /// <returns>The new set.</returns> + /// <exception cref="ArgumentOutOfRangeException"><paramref name="n" /> is negative.</exception> + internal static PyIntSet Range(int n) + { + ArgumentOutOfRangeException.ThrowIfNegative(n); + var set = new PyIntSet(); + for (int k = 0; k < n; k++) + set.AddEntry(k); + return set; + } + + /// <summary> + /// <c>self - other</c> where <paramref name="other" /> is a Python set: a new set whose slot order is CPython's. + /// </summary> + /// <param name="other"> + /// The elements to leave out, as a set (its <see cref="IReadOnlyCollection{T}.Count" /> is <c>len(other)</c>, + /// which picks the strategy). Elements this set does not hold, negative ones included, are ignored. + /// </param> + /// <returns>The difference; this set is unchanged.</returns> + /// <exception cref="ArgumentNullException"><paramref name="other" /> is null.</exception> + internal PyIntSet Difference(IReadOnlySet<int> other) + { + ArgumentNullException.ThrowIfNull(other); + // set_difference: when this set is much larger than the other, copying it and discarding the other's elements is + // cheaper, and leaves the copy's layout (dummies included, purged only past a quarter of the table). + if ((_used >> 2) > other.Count) + { + PyIntSet copy = Copy(); + copy.DifferenceUpdate(other); + return copy; + } + + // Otherwise a fresh set receives this set's remaining elements in slot order (set_next), each through the + // ordinary insert, so the result's layout comes from inserting them in that order into a growing table. + var result = new PyIntSet(); + foreach (int key in _table) + { + if (key >= 0 && !other.Contains(key)) + result.AddEntry(key); + } + return result; + } + + /// <summary><c>list(s)</c>: the elements in slot order, skipping empty and dummy slots.</summary> + /// <returns>A new list.</returns> + internal List<int> ToList() + { + var list = new List<int>(_used); + foreach (int key in _table) + { + if (key >= 0) + list.Add(key); + } + return list; + } + + /// <summary>A table of <paramref name="size" /> empty slots.</summary> + /// <param name="size">The slot count, a power of two.</param> + /// <returns>The new table.</returns> + private static int[] NewTable(int size) + { + var table = new int[size]; + Array.Fill(table, Empty); + return table; + } + + /// <summary> + /// <c>set_add_entry</c>: inserts <paramref name="key" /> unless present, then grows the table when an empty slot + /// was consumed and <c>fill * 5 >= mask * 3</c>. + /// </summary> + /// <param name="key">The element, >= 0.</param> + /// <exception cref="ArgumentOutOfRangeException"><paramref name="key" /> is negative (CPython hashes those differently).</exception> + private void AddEntry(int key) + { + ArgumentOutOfRangeException.ThrowIfNegative(key); + ulong mask = (ulong)(_table.Length - 1); + ulong i = (ulong)key & mask; + ulong perturb = (ulong)key; + int freeSlot = -1; + int emptySlot; + while (true) + { + // The home slot plus LinearProbes more when they fit below the mask (CPython's do { } while (probes--)). + int probes = i + LinearProbes <= mask ? LinearProbes : 0; + int j = (int)i; + while (true) + { + int slot = _table[j]; + if (slot == Empty) + { + emptySlot = j; + goto FoundUnusedOrDummy; + } + if (slot == key) + return; // found_active: already a member + if (slot == Dummy) + freeSlot = j; // CPython keeps the LAST dummy the probe passed (measured: 3.12 reuses it) + j++; + if (probes-- == 0) + break; + } + perturb >>= PerturbShift; + i = (i * 5 + 1 + perturb) & mask; + } + + FoundUnusedOrDummy: + if (freeSlot >= 0) + { + // A reused dummy does not raise fill, so it never triggers growth. + _used++; + _table[freeSlot] = key; + return; + } + _fill++; + _used++; + _table[emptySlot] = key; + if ((ulong)_fill * 5 < mask * 3) + return; + Resize(_used > 50000 ? _used * 2 : _used * 4); + } + + /// <summary> + /// <c>set_table_resize</c>: moves the active elements, in old-slot order, into a table of the first power of two + /// above <paramref name="minUsed" />, dropping dummies. + /// </summary> + /// <param name="minUsed">The size the new table must exceed.</param> + private void Resize(int minUsed) + { + long newSize = MinSize; + while (newSize <= minUsed) + newSize <<= 1; + // CPython keeps the 8-slot small table as it is when it would rebuild it with nothing to purge. + if (newSize == MinSize && _table.Length == MinSize && _fill == _used) + return; + int[] oldTable = _table; + int[] newTable = NewTable((int)newSize); + int newMask = (int)newSize - 1; + foreach (int key in oldTable) + { + if (key >= 0) + InsertClean(newTable, newMask, key); + } + _table = newTable; + _fill = _used; + } + + /// <summary><c>set_insert_clean</c>: places a key known to be absent into a table without dummies.</summary> + /// <param name="table">The table, with no dummies and at least one empty slot.</param> + /// <param name="mask">The table's length minus one.</param> + /// <param name="key">The element, >= 0.</param> + private static void InsertClean(int[] table, int mask, int key) + { + ulong umask = (ulong)mask; + ulong i = (ulong)key & umask; + ulong perturb = (ulong)key; + while (true) + { + if (table[i] == Empty) + { + table[i] = key; + return; + } + if (i + LinearProbes <= umask) + { + for (ulong j = 1; j <= LinearProbes; j++) + { + if (table[i + j] == Empty) + { + table[i + j] = key; + return; + } + } + } + perturb >>= PerturbShift; + i = (i * 5 + 1 + perturb) & umask; + } + } + + /// <summary><c>set_lookkey</c>: the slot holding <paramref name="key" />, or -1 once the probe reaches an empty slot.</summary> + /// <param name="key">The element, >= 0.</param> + /// <returns>The slot index, or -1 when absent.</returns> + private int LookKey(int key) + { + ulong mask = (ulong)(_table.Length - 1); + ulong i = (ulong)key & mask; + ulong perturb = (ulong)key; + while (true) + { + int probes = i + LinearProbes <= mask ? LinearProbes : 0; + int j = (int)i; + while (true) + { + int slot = _table[j]; + if (slot == Empty) + return -1; + if (slot == key) + return j; + j++; + if (probes-- == 0) + break; + } + perturb >>= PerturbShift; + i = (i * 5 + 1 + perturb) & mask; + } + } + + /// <summary> + /// <c>set_copy</c>: a new set merged from this one (<c>set_merge</c> into an empty table): one resize up front when + /// needed, then a slot-for-slot copy when the sizes match and this set has no dummies, else clean inserts in this + /// set's slot order. + /// </summary> + /// <returns>The copy.</returns> + private PyIntSet Copy() + { + var result = new PyIntSet(); + if (_used == 0) + return result; + ulong mask = (ulong)(result._table.Length - 1); + if ((ulong)(result._fill + _used) * 5 >= mask * 3) + result.Resize((result._used + _used) * 2); + if (result._table.Length == _table.Length && _fill == _used) + { + Array.Copy(_table, result._table, _table.Length); + result._fill = _fill; + result._used = _used; + return result; + } + int newMask = result._table.Length - 1; + result._fill = _used; + result._used = _used; + foreach (int key in _table) + { + if (key >= 0) + InsertClean(result._table, newMask, key); + } + return result; + } + + /// <summary> + /// <c>set_difference_update_internal</c> with a set argument: discards each of <paramref name="other" />'s elements + /// (leaving dummies), then rebuilds the table when dummies exceed a quarter of it. + /// </summary> + /// <param name="other">The elements to discard; the order they are discarded in does not change the result.</param> + private void DifferenceUpdate(IReadOnlySet<int> other) + { + // CPython iterates the intersection instead when the other set is more than 8 times larger; the discarded keys + // are the same either way, and a discard's effect does not depend on the order. + foreach (int key in other) + { + if (key < 0) + continue; // never a member; and -2 would otherwise match the dummy sentinel + int slot = LookKey(key); + if (slot < 0) + continue; + _table[slot] = Dummy; + _used--; + } + if ((ulong)(_fill - _used) <= (ulong)(_table.Length - 1) / 4) + return; + Resize(_used > 50000 ? _used * 2 : _used * 4); + } +} diff --git a/src/OptunaSharp.Core/Internal/PyListSort.cs b/src/OptunaSharp.Core/Internal/PyListSort.cs new file mode 100644 index 0000000..f523567 --- /dev/null +++ b/src/OptunaSharp.Core/Internal/PyListSort.cs @@ -0,0 +1,716 @@ +using System; +using System.Collections.Generic; + +namespace OptunaSharp.Internal; + +/// <summary> +/// CPython 3.12's <c>list.sort</c> (<c>Objects/listobject.c</c>): timsort with the powersort merge policy, ported +/// step for step, so that a comparison that is not a total order leaves the elements where CPython leaves them. +/// </summary> +/// <remarks> +/// <para> +/// With a strict weak order every stable sort gives the same result and <see cref="List{T}.Sort()" /> with a +/// tie-breaker would do. Optuna sorts some tuples whose first element can be NaN, which compares neither smaller +/// nor larger than anything, and then the result is whatever timsort's exact sequence of comparisons produces: +/// NSGA-III's <c>list.sort(reverse=True)</c> over <c>(distance, index)</c> pairs is the use this serves (QA-56), +/// where an all-NaN borderline front keeps its input order and <c>pop()</c> takes the last pair first. +/// </para> +/// <para> +/// Ported: <c>reverse</c> as CPython does it (reverse, stable sort, reverse again); <c>count_run</c> (an +/// ascending run, or a strictly descending one reversed in place); runs shorter than <c>minrun</c> extended by +/// binary insertion; the powersort merge policy (<c>powerloop</c>, <c>found_new_run</c>); <c>merge_at</c> with its +/// galloping trims; <c>merge_lo</c> / <c>merge_hi</c> with the adaptive <c>min_gallop</c>; and +/// <c>merge_force_collapse</c>. Every comparison is the caller's <c>lessThan</c>, CPython's <c><</c>, called +/// with the same operands in the same order. The committed corpus <c>oracle/cpython_order.json</c>, recorded +/// with CPython 3.12, checks NaN-bearing lists up to 1,000 elements. CPython 3.13 rewrote <c>count_run</c>, so +/// a 3.13 interpreter can order such lists differently; the port follows 3.12, the interop suite's interpreter. +/// </para> +/// <para> +/// <c>lessThan</c> must not throw or mutate the list (CPython's own guarantees under an exception are not +/// modeled); it may be inconsistent. Not thread-safe for a shared list. +/// </para> +/// </remarks> +internal static class PyListSort +{ + /// <summary><c>MIN_GALLOP</c>: the run of consecutive wins that switches a merge into galloping mode.</summary> + private const int MinGallopStart = 7; + + /// <summary><c>MAX_MERGE_PENDING</c>: room for the pending-run stack of any list that fits in memory.</summary> + private const int MaxMergePending = 85; + + /// <summary>Sorts <paramref name="list" /> in place exactly as CPython's <c>list.sort(reverse=...)</c> does.</summary> + /// <param name="list">The list to sort.</param> + /// <param name="lessThan">CPython's <c>a < b</c> for two elements; it may be inconsistent (NaN).</param> + /// <param name="reverse">Python's <c>reverse=True</c>: reversed, sorted stably, reversed again.</param> + /// <typeparam name="T">The element type.</typeparam> + /// <exception cref="ArgumentNullException"><paramref name="list" /> or <paramref name="lessThan" /> is null.</exception> + internal static void Sort<T>(List<T> list, Func<T, T, bool> lessThan, bool reverse = false) + { + ArgumentNullException.ThrowIfNull(list); + ArgumentNullException.ThrowIfNull(lessThan); + int count = list.Count; + // CPython returns before reversing for fewer than two elements; reversing them would change nothing anyway. + if (count < 2) + return; + + T[] keys = list.ToArray(); + if (reverse) + Array.Reverse(keys); + + var ms = new MergeState<T>(keys, lessThan); + int lo = 0; + int nRemaining = count; + int minRun = ComputeMinRun(nRemaining); + do + { + // Identify the next run, and extend a short one to min(minrun, nremaining) by binary insertion. + int n = CountRun(ms, lo, lo + nRemaining, out bool descending); + if (descending) + Array.Reverse(keys, lo, n); + if (n < minRun) + { + int force = nRemaining <= minRun ? nRemaining : minRun; + BinarySort(ms, lo, lo + force, lo + n); + n = force; + } + + // Merge pending runs per the powersort policy, then push this one. + FoundNewRun(ms, n); + ms.Base[ms.Count] = lo; + ms.Length[ms.Count] = n; + ms.Count++; + lo += n; + nRemaining -= n; + } while (nRemaining > 0); + + MergeForceCollapse(ms); + + if (reverse) + Array.Reverse(keys); + for (int i = 0; i < count; i++) + list[i] = keys[i]; + } + + /// <summary><c>merge_compute_minrun</c>: the minimum run length, in [32, 64] for lists of 64 elements or more.</summary> + /// <param name="n">The list's length.</param> + /// <returns><paramref name="n" /> itself below 64; else its top 6 bits, plus 1 if any lower bit is set.</returns> + private static int ComputeMinRun(int n) + { + int r = 0; // becomes 1 if any 1 bits are shifted off + while (n >= 64) + { + r |= n & 1; + n >>= 1; + } + return n + r; + } + + /// <summary> + /// <c>count_run</c> (3.12): the length of the run starting at <paramref name="lo" />, either ascending + /// (<c>a[0] <= a[1] <= ...</c>, i.e. no next element is less) or strictly descending. + /// </summary> + /// <param name="ms">The sort state.</param> + /// <param name="lo">The run's first index.</param> + /// <param name="hi">One past the last index the run may reach; greater than <paramref name="lo" />.</param> + /// <param name="descending">Set when the run is strictly descending, which the caller reverses.</param> + /// <returns>The run's length, at least 1.</returns> + /// <typeparam name="T">The element type.</typeparam> + private static int CountRun<T>(MergeState<T> ms, int lo, int hi, out bool descending) + { + T[] a = ms.Keys; + descending = false; + ++lo; + if (lo == hi) + return 1; + + int n = 2; + if (ms.LessThan(a[lo], a[lo - 1])) + { + descending = true; + for (lo = lo + 1; lo < hi; ++lo, ++n) + { + if (!ms.LessThan(a[lo], a[lo - 1])) + break; + } + } + else + { + for (lo = lo + 1; lo < hi; ++lo, ++n) + { + if (ms.LessThan(a[lo], a[lo - 1])) + break; + } + } + return n; + } + + /// <summary> + /// <c>binarysort</c> (3.12): extends the sorted prefix <c>[lo, start)</c> to <c>[lo, hi)</c> by binary insertion, + /// each new element placed after any it does not compare less than (which keeps the sort stable). + /// </summary> + /// <param name="ms">The sort state.</param> + /// <param name="lo">The slice's first index.</param> + /// <param name="hi">One past the slice's last index.</param> + /// <param name="start">The first index not yet in the sorted prefix.</param> + /// <typeparam name="T">The element type.</typeparam> + private static void BinarySort<T>(MergeState<T> ms, int lo, int hi, int start) + { + T[] a = ms.Keys; + if (lo == start) + ++start; + for (; start < hi; ++start) + { + // pivot >= all in [lo, l); pivot < all in [r, start). + int l = lo; + int r = start; + T pivot = a[r]; + do + { + int p = l + ((r - l) >> 1); + if (ms.LessThan(pivot, a[p])) + r = p; + else + l = p + 1; + } while (l < r); + for (int p = start; p > l; --p) + a[p] = a[p - 1]; + a[l] = pivot; + } + } + + /// <summary> + /// <c>powerloop</c>: the "power" of the run <c>[s1, s1 + n1)</c> followed by one of length <paramref name="n2" /> + /// in a list of <paramref name="n" />: its depth in the conceptual binary merge tree powersort follows. + /// </summary> + /// <param name="s1">The first run's start index.</param> + /// <param name="n1">The first run's length.</param> + /// <param name="n2">The next run's length.</param> + /// <param name="n">The list's length.</param> + /// <returns>The power, at least 1.</returns> + private static int PowerLoop(long s1, long n1, long n2, long n) + { + int result = 0; + // 2a and 2b, twice the two runs' midpoints, so the halves stay integral; the bits of 2a/n and 2b/n are those + // of a/n and b/n shifted by one, which does not change where they first differ. + long a = 2 * s1 + n1; + long b = a + n1 + n2; + while (true) + { + ++result; + if (a >= n) + { + // both quotient bits are 1 + a -= n; + b -= n; + } + else if (b >= n) + { + break; // a/n bit is 0, b/n bit is 1 + } + // else both quotient bits are 0 + a <<= 1; + b <<= 1; + } + return result; + } + + /// <summary> + /// <c>found_new_run</c>: before a new run of length <paramref name="n2" /> is pushed, merges the pending runs whose + /// power exceeds the topmost run's, and records that power. + /// </summary> + /// <param name="ms">The sort state.</param> + /// <param name="n2">The new run's length.</param> + /// <typeparam name="T">The element type.</typeparam> + private static void FoundNewRun<T>(MergeState<T> ms, int n2) + { + if (ms.Count == 0) + return; + int s1 = ms.Base[ms.Count - 1]; + int n1 = ms.Length[ms.Count - 1]; + int power = PowerLoop(s1, n1, n2, ms.Keys.Length); + while (ms.Count > 1 && ms.Power[ms.Count - 2] > power) + MergeAt(ms, ms.Count - 2); + ms.Power[ms.Count - 1] = power; + } + + /// <summary> + /// <c>merge_force_collapse</c>: merges every pending run, preferring the smaller neighbour of the second-last run. + /// </summary> + /// <param name="ms">The sort state.</param> + /// <typeparam name="T">The element type.</typeparam> + private static void MergeForceCollapse<T>(MergeState<T> ms) + { + while (ms.Count > 1) + { + int n = ms.Count - 2; + if (n > 0 && ms.Length[n - 1] < ms.Length[n + 1]) + --n; + MergeAt(ms, n); + } + } + + /// <summary> + /// <c>merge_at</c>: merges pending runs <paramref name="i" /> and <paramref name="i" /> + 1, after galloping off the + /// prefix of the first and the suffix of the second that are already in place. + /// </summary> + /// <param name="ms">The sort state.</param> + /// <param name="i">The first run's stack index: the second-last or third-last run.</param> + /// <typeparam name="T">The element type.</typeparam> + private static void MergeAt<T>(MergeState<T> ms, int i) + { + T[] a = ms.Keys; + int baseA = ms.Base[i]; + int na = ms.Length[i]; + int baseB = ms.Base[i + 1]; + int nb = ms.Length[i + 1]; + + // Record the combined length; if i is the third-last run, slide the last run over (power included). + ms.Length[i] = na + nb; + if (i == ms.Count - 3) + { + ms.Base[i + 1] = ms.Base[i + 2]; + ms.Length[i + 1] = ms.Length[i + 2]; + ms.Power[i + 1] = ms.Power[i + 2]; + } + ms.Count--; + + // Where does b start in a? Elements in a before that are already in place. + int k = GallopRight(ms, a[baseB], a, baseA, na, 0); + baseA += k; + na -= k; + if (na == 0) + return; + + // Where does a end in b? Elements in b after that are already in place. + nb = GallopLeft(ms, a[baseA + na - 1], a, baseB, nb, nb - 1); + if (nb <= 0) + return; + + if (na <= nb) + MergeLo(ms, baseA, na, baseB, nb); + else + MergeHi(ms, baseA, na, baseB, nb); + } + + /// <summary> + /// <c>gallop_left</c>: the index in <c>arr[at, at + n)</c> where <paramref name="key" /> belongs, left of any equal + /// element: <c>arr[at + k - 1] < key <= arr[at + k]</c>, found by galloping from <paramref name="hint" /> and + /// then binary search. + /// </summary> + /// <param name="ms">The sort state.</param> + /// <param name="key">The element to place.</param> + /// <param name="arr">The array holding the run (the list or the merge's temporary copy).</param> + /// <param name="at">The run's first index in <paramref name="arr" />.</param> + /// <param name="n">The run's length, at least 1.</param> + /// <param name="hint">Where to start galloping, in [0, n).</param> + /// <returns>The offset in [0, n].</returns> + /// <typeparam name="T">The element type.</typeparam> + private static int GallopLeft<T>(MergeState<T> ms, T key, T[] arr, int at, int n, int hint) + { + int a = at + hint; + int lastOfs = 0; + int ofs = 1; + if (ms.LessThan(arr[a], key)) + { + // arr[hint] < key: gallop right until arr[hint + lastOfs] < key <= arr[hint + ofs]. + int maxOfs = n - hint; + while (ofs < maxOfs) + { + if (ms.LessThan(arr[a + ofs], key)) + { + lastOfs = ofs; + ofs = (ofs << 1) + 1; + } + else + { + break; + } + } + if (ofs > maxOfs) + ofs = maxOfs; + lastOfs += hint; + ofs += hint; + } + else + { + // key <= arr[hint]: gallop left until arr[hint - ofs] < key <= arr[hint - lastOfs]. + int maxOfs = hint + 1; + while (ofs < maxOfs) + { + if (ms.LessThan(arr[a - ofs], key)) + break; + lastOfs = ofs; + ofs = (ofs << 1) + 1; + } + if (ofs > maxOfs) + ofs = maxOfs; + int k = lastOfs; + lastOfs = hint - ofs; + ofs = hint - k; + } + + // arr[lastOfs] < key <= arr[ofs]: binary search with invariant arr[lastOfs - 1] < key <= arr[ofs]. + ++lastOfs; + while (lastOfs < ofs) + { + int m = lastOfs + ((ofs - lastOfs) >> 1); + if (ms.LessThan(arr[at + m], key)) + lastOfs = m + 1; + else + ofs = m; + } + return ofs; + } + + /// <summary> + /// <c>gallop_right</c>: like <see cref="GallopLeft{T}" />, but right of any equal element: + /// <c>arr[at + k - 1] <= key < arr[at + k]</c>. + /// </summary> + /// <param name="ms">The sort state.</param> + /// <param name="key">The element to place.</param> + /// <param name="arr">The array holding the run (the list or the merge's temporary copy).</param> + /// <param name="at">The run's first index in <paramref name="arr" />.</param> + /// <param name="n">The run's length, at least 1.</param> + /// <param name="hint">Where to start galloping, in [0, n).</param> + /// <returns>The offset in [0, n].</returns> + /// <typeparam name="T">The element type.</typeparam> + private static int GallopRight<T>(MergeState<T> ms, T key, T[] arr, int at, int n, int hint) + { + int a = at + hint; + int lastOfs = 0; + int ofs = 1; + if (ms.LessThan(key, arr[a])) + { + // key < arr[hint]: gallop left until arr[hint - ofs] <= key < arr[hint - lastOfs]. + int maxOfs = hint + 1; + while (ofs < maxOfs) + { + if (ms.LessThan(key, arr[a - ofs])) + { + lastOfs = ofs; + ofs = (ofs << 1) + 1; + } + else + { + break; + } + } + if (ofs > maxOfs) + ofs = maxOfs; + int k = lastOfs; + lastOfs = hint - ofs; + ofs = hint - k; + } + else + { + // arr[hint] <= key: gallop right until arr[hint + lastOfs] <= key < arr[hint + ofs]. + int maxOfs = n - hint; + while (ofs < maxOfs) + { + if (ms.LessThan(key, arr[a + ofs])) + break; + lastOfs = ofs; + ofs = (ofs << 1) + 1; + } + if (ofs > maxOfs) + ofs = maxOfs; + lastOfs += hint; + ofs += hint; + } + + // arr[lastOfs] <= key < arr[ofs]: binary search with invariant arr[lastOfs - 1] <= key < arr[ofs]. + ++lastOfs; + while (lastOfs < ofs) + { + int m = lastOfs + ((ofs - lastOfs) >> 1); + if (ms.LessThan(key, arr[at + m])) + ofs = m; + else + lastOfs = m + 1; + } + return ofs; + } + + /// <summary> + /// <c>merge_lo</c>: merges adjacent runs <c>[pa, pa + na)</c> and <c>[pb, pb + nb)</c> left to right, the first run + /// (the shorter or equal one) copied aside, galloping once one side wins <c>min_gallop</c> times in a row. + /// </summary> + /// <param name="ms">The sort state.</param> + /// <param name="pa">The first run's start; its first element belongs after b's first.</param> + /// <param name="na">The first run's length, at least 1.</param> + /// <param name="pb">The second run's start, <c>pa + na</c>.</param> + /// <param name="nb">The second run's length, at least 1; its last element belongs after a's last.</param> + /// <typeparam name="T">The element type.</typeparam> + private static void MergeLo<T>(MergeState<T> ms, int pa, int na, int pb, int nb) + { + T[] a = ms.Keys; + T[] tmp = ms.Temp(na); + Array.Copy(a, pa, tmp, 0, na); + int dest = pa; + int ta = 0; + + a[dest++] = a[pb++]; + --nb; + if (nb == 0) + goto Succeed; + if (na == 1) + goto CopyB; + + int minGallop = ms.MinGallop; + while (true) + { + int acount = 0; // # of times A won in a row + int bcount = 0; // # of times B won in a row + + // The straightforward merge, until (if ever) one run appears to win consistently. + while (true) + { + if (ms.LessThan(a[pb], tmp[ta])) + { + a[dest++] = a[pb++]; + ++bcount; + acount = 0; + --nb; + if (nb == 0) + goto Succeed; + if (bcount >= minGallop) + break; + } + else + { + a[dest++] = tmp[ta++]; + ++acount; + bcount = 0; + --na; + if (na == 1) + goto CopyB; + if (acount >= minGallop) + break; + } + } + + // Galloping, until neither run appears to be winning consistently anymore. + ++minGallop; + do + { + minGallop -= minGallop > 1 ? 1 : 0; + ms.MinGallop = minGallop; + int k = GallopRight(ms, a[pb], tmp, ta, na, 0); + acount = k; + if (k != 0) + { + Array.Copy(tmp, ta, a, dest, k); + dest += k; + ta += k; + na -= k; + if (na == 1) + goto CopyB; + // Impossible for a consistent comparison, but NaN makes it possible. + if (na == 0) + goto Succeed; + } + a[dest++] = a[pb++]; + --nb; + if (nb == 0) + goto Succeed; + + k = GallopLeft(ms, tmp[ta], a, pb, nb, 0); + bcount = k; + if (k != 0) + { + Array.Copy(a, pb, a, dest, k); // memmove: dest < pb, Array.Copy handles the overlap + dest += k; + pb += k; + nb -= k; + if (nb == 0) + goto Succeed; + } + a[dest++] = tmp[ta++]; + --na; + if (na == 1) + goto CopyB; + } while (acount >= MinGallopStart || bcount >= MinGallopStart); + ++minGallop; // penalize it for leaving galloping mode + ms.MinGallop = minGallop; + } + + Succeed: + if (na != 0) + Array.Copy(tmp, ta, a, dest, na); + return; + + CopyB: + // na == 1 and nb > 0: the last element of a belongs at the end of the merge. + Array.Copy(a, pb, a, dest, nb); + a[dest + nb] = tmp[ta]; + } + + /// <summary> + /// <c>merge_hi</c>: merges adjacent runs <c>[pa, pa + na)</c> and <c>[pb, pb + nb)</c> right to left, the second + /// run (the shorter one) copied aside, galloping once one side wins <c>min_gallop</c> times in a row. + /// </summary> + /// <param name="ms">The sort state.</param> + /// <param name="pa">The first run's start; its first element belongs after b's first.</param> + /// <param name="na">The first run's length, at least 1.</param> + /// <param name="pb">The second run's start, <c>pa + na</c>.</param> + /// <param name="nb">The second run's length, at least 1; its last element belongs after a's last.</param> + /// <typeparam name="T">The element type.</typeparam> + private static void MergeHi<T>(MergeState<T> ms, int pa, int na, int pb, int nb) + { + T[] a = ms.Keys; + T[] tmp = ms.Temp(nb); + Array.Copy(a, pb, tmp, 0, nb); + int dest = pb + nb - 1; + int ia = pa + na - 1; // a's last remaining element, in the list + int tb = nb - 1; // b's last remaining element, in tmp + + a[dest--] = a[ia--]; + --na; + if (na == 0) + goto Succeed; + if (nb == 1) + goto CopyA; + + int minGallop = ms.MinGallop; + while (true) + { + int acount = 0; // # of times A won in a row + int bcount = 0; // # of times B won in a row + + // The straightforward merge, until (if ever) one run appears to win consistently. + while (true) + { + if (ms.LessThan(tmp[tb], a[ia])) + { + a[dest--] = a[ia--]; + ++acount; + bcount = 0; + --na; + if (na == 0) + goto Succeed; + if (acount >= minGallop) + break; + } + else + { + a[dest--] = tmp[tb--]; + ++bcount; + acount = 0; + --nb; + if (nb == 1) + goto CopyA; + if (bcount >= minGallop) + break; + } + } + + // Galloping, until neither run appears to be winning consistently anymore. + ++minGallop; + do + { + minGallop -= minGallop > 1 ? 1 : 0; + ms.MinGallop = minGallop; + int k = GallopRight(ms, tmp[tb], a, pa, na, na - 1); + k = na - k; + acount = k; + if (k != 0) + { + dest -= k; + ia -= k; + Array.Copy(a, ia + 1, a, dest + 1, k); // memmove: dest > ia, Array.Copy handles the overlap + na -= k; + if (na == 0) + goto Succeed; + } + a[dest--] = tmp[tb--]; + --nb; + if (nb == 1) + goto CopyA; + + k = GallopLeft(ms, a[ia], tmp, 0, nb, nb - 1); + k = nb - k; + bcount = k; + if (k != 0) + { + dest -= k; + tb -= k; + Array.Copy(tmp, tb + 1, a, dest + 1, k); + nb -= k; + if (nb == 1) + goto CopyA; + // Impossible for a consistent comparison, but NaN makes it possible. + if (nb == 0) + goto Succeed; + } + a[dest--] = a[ia--]; + --na; + if (na == 0) + goto Succeed; + } while (acount >= MinGallopStart || bcount >= MinGallopStart); + ++minGallop; // penalize it for leaving galloping mode + ms.MinGallop = minGallop; + } + + Succeed: + if (nb != 0) + Array.Copy(tmp, 0, a, dest - (nb - 1), nb); + return; + + CopyA: + // nb == 1 and na > 0: the first element of b belongs at the front of the merge. + Array.Copy(a, ia - na + 1, a, dest - na + 1, na); + dest -= na; + a[dest] = tmp[tb]; + } + + /// <summary> + /// CPython's <c>MergeState</c>: the list being sorted, the comparison, the adaptive gallop threshold, the merge + /// scratch space and the stack of pending runs with their powers. + /// </summary> + /// <typeparam name="T">The element type.</typeparam> + private sealed class MergeState<T> + { + /// <summary>The list's elements, sorted in place.</summary> + internal readonly T[] Keys; + + /// <summary>CPython's <c><</c> for two elements.</summary> + internal readonly Func<T, T, bool> LessThan; + + /// <summary><c>min_gallop</c>: adapts across merges, starting at 7.</summary> + internal int MinGallop = MinGallopStart; + + /// <summary>The pending runs' start indices.</summary> + internal readonly int[] Base = new int[MaxMergePending]; + + /// <summary>The pending runs' lengths.</summary> + internal readonly int[] Length = new int[MaxMergePending]; + + /// <summary>The pending runs' powers (the topmost run's is set when the next run is found).</summary> + internal readonly int[] Power = new int[MaxMergePending]; + + /// <summary>The number of pending runs.</summary> + internal int Count; + + /// <summary>The merge scratch space, grown on demand.</summary> + private T[] _temp = Array.Empty<T>(); + + /// <summary>Creates the state for one sort.</summary> + /// <param name="keys">The elements to sort in place.</param> + /// <param name="lessThan">CPython's <c><</c>.</param> + internal MergeState(T[] keys, Func<T, T, bool> lessThan) + { + Keys = keys; + LessThan = lessThan; + } + + /// <summary><c>MERGE_GETMEM</c>: scratch space for at least <paramref name="need" /> elements.</summary> + /// <param name="need">The elements a merge copies aside.</param> + /// <returns>The scratch array, possibly longer than needed.</returns> + internal T[] Temp(int need) + { + if (_temp.Length < need) + _temp = new T[need]; + return _temp; + } + } +} diff --git a/src/OptunaSharp.Core/Internal/PyStrFormat.cs b/src/OptunaSharp.Core/Internal/PyStrFormat.cs index 65a9df2..dc84f77 100644 --- a/src/OptunaSharp.Core/Internal/PyStrFormat.cs +++ b/src/OptunaSharp.Core/Internal/PyStrFormat.cs @@ -65,7 +65,7 @@ internal static class PyStrFormat /// <exception cref="AttributeError">A field reads an attribute Python's <c>int</c> does not have.</exception> /// <exception cref="TypeError">A field indexes the integer (<c>{SCHEMA_VERSION[0]}</c>).</exception> /// <exception cref="NotSupportedException">A field reads one of <c>int</c>'s methods (see the remarks).</exception> - /// <exception cref="OverflowException">A <c>c</c> format of a value outside <c>range(0x110000)</c>, or a float format of an integer too large for a double.</exception> + /// <exception cref="OverflowError">A <c>c</c> format of a value outside <c>range(0x110000)</c>, or a float format of an integer too large for a double.</exception> /// <exception cref="OutOfMemoryException"> /// A width pads a field past the longest string .NET allocates (about 2<sup>30</sup> characters). CPython /// builds such a string when the memory is there, so this is the one place the port stops short of it. @@ -87,7 +87,7 @@ internal static string FormatKeyword(string template, string name, BigInteger va /// <exception cref="AttributeError">A field reads an attribute Python's <c>int</c> does not have.</exception> /// <exception cref="TypeError">A field indexes the integer.</exception> /// <exception cref="NotSupportedException">A field reads one of <c>int</c>'s methods.</exception> - /// <exception cref="OverflowException">A <c>c</c> format out of range, or a float format of an integer too large for a double.</exception> + /// <exception cref="OverflowError">A <c>c</c> format out of range, or a float format of an integer too large for a double.</exception> /// <exception cref="OutOfMemoryException">A width beyond the longest .NET string.</exception> private static string BuildString(string s, int start, int end, string name, BigInteger value, int depth) { @@ -651,7 +651,7 @@ private static string Pad(string text, long width, char align, string fill) /// <param name="specText">The format spec.</param> /// <returns>The formatted string.</returns> /// <exception cref="ValueError">The spec does not apply to integers; CPython's messages.</exception> - /// <exception cref="OverflowException">A <c>c</c> format out of range, or a float format of an integer too large for a double.</exception> + /// <exception cref="OverflowError">A <c>c</c> format out of range, or a float format of an integer too large for a double.</exception> /// <exception cref="OutOfMemoryException">The width is beyond what a .NET string holds (see <see cref="AppendFill" />).</exception> private static string FormatInteger(BigInteger value, string specText) { @@ -674,7 +674,7 @@ private static string FormatInteger(BigInteger value, string specText) /// <param name="f">The parsed spec.</param> /// <returns>The formatted string.</returns> /// <exception cref="ValueError">Precision, <c>z</c>, or a sign/<c>#</c> with <c>c</c>; CPython's messages.</exception> - /// <exception cref="OverflowException">A <c>c</c> format of a value outside <c>range(0x110000)</c>.</exception> + /// <exception cref="OverflowError">A <c>c</c> format of a value outside <c>range(0x110000)</c>.</exception> /// <exception cref="OutOfMemoryException">The width is beyond what a .NET string holds (see <see cref="AppendFill" />).</exception> private static string FormatLong(BigInteger value, Spec f) { @@ -689,7 +689,7 @@ private static string FormatLong(BigInteger value, Spec f) if (f.Alternate) throw new ValueError("Alternate form (#) not allowed with integer format specifier 'c'"); if (value < 0 || value > 0x10ffff) - throw new OverflowException("%c arg not in range(0x110000)"); + throw new OverflowError("%c arg not in range(0x110000)"); // 'c' content counts as "remainder": it is copied, never grouped or zero-extended. return LayoutNumber(sign: '\0', prefix: "", digits: "", decimalPoint: "", remainder: char.ConvertFromUtf32((int)value), f); } @@ -713,7 +713,7 @@ private static string FormatLong(BigInteger value, Spec f) /// <param name="f">The parsed spec.</param> /// <returns>The formatted string.</returns> /// <exception cref="ValueError">The precision is above <see cref="int.MaxValue" />.</exception> - /// <exception cref="OverflowException">The integer does not fit a double (<c>int too large to convert to float</c>).</exception> + /// <exception cref="OverflowError">The integer does not fit a double (<c>int too large to convert to float</c>).</exception> /// <exception cref="OutOfMemoryException">The width is beyond what a .NET string holds (see <see cref="AppendFill" />).</exception> private static string FormatFloat(BigInteger value, Spec f) { @@ -721,7 +721,7 @@ private static string FormatFloat(BigInteger value, Spec f) throw new ValueError("precision too big"); double d = (double)value; if (double.IsInfinity(d)) - throw new OverflowException("int too large to convert to float"); + throw new OverflowError("int too large to convert to float"); int type = f.Type; bool percent = type == '%'; diff --git a/src/OptunaSharp.Core/Internal/ScrambledHalton.cs b/src/OptunaSharp.Core/Internal/ScrambledHalton.cs index a549fd9..0bb1678 100644 --- a/src/OptunaSharp.Core/Internal/ScrambledHalton.cs +++ b/src/OptunaSharp.Core/Internal/ScrambledHalton.cs @@ -17,9 +17,10 @@ namespace OptunaSharp.Internal; /// stream byte-for-byte and <c>Generator.shuffle</c> ports NumPy's exact Fisher–Yates over /// <c>random_interval</c> (mask-rejection through the buffered 32-bit words) — the primitive scipy's /// shuffle consumes — while the digit expansion is deterministic double arithmetic in scipy's order. -/// Like <see cref="ScrambledSobol" /> the engine is reconstructed per call from <c>(dim, seed)</c>, so -/// it holds no state and parallel trials need no lock (the <c>sample_id</c> counter is already -/// serialized through the study system attr).</para> +/// Like <see cref="ScrambledSobol" /> the sequence is a pure function of <c>(dim, seed)</c>: <see cref="Create" /> +/// draws the permutations once into an immutable <see cref="Engine" />, which QMCSampler keeps across trials +/// and which parallel trials can share without a lock (the <c>sample_id</c> counter is already serialized +/// through the study system attr).</para> /// </summary> internal static class ScrambledHalton { @@ -35,12 +36,28 @@ internal static class ScrambledHalton /// <param name="n">The zero-based sequence index of the scrambled Halton point.</param> /// <param name="seed">The seed controlling the reproducible random stream.</param> /// <returns>The requested reproducibly scrambled Halton point.</returns> - internal static double[] Point(int dim, ulong n, int seed) + internal static double[] Point(int dim, ulong n, int seed) => Create(dim, seed).Point(n); + + /// <summary> + /// Builds the scrambled engine of <c>Halton(dim, scramble=True, seed)</c>: every dimension's Owen digit + /// permutations, drawn from one shared <c>default_rng(seed)</c> stream in dimension order as scipy draws them. + /// </summary> + /// <param name="dim">The number of coordinates in each point.</param> + /// <param name="seed">The seed controlling the reproducible random stream.</param> + /// <returns>An immutable engine that can be shared across threads and reused for any point index.</returns> + /// <exception cref="NumSharp.ValueError">The dimension is outside the supported prime-base table.</exception> + /// <remarks> + /// Drawing the permutations is nearly all the cost of a point (<c>Σ_d count_d</c> shuffles of <c>[0, b_d)</c>, + /// each through a NumSharp array), so a caller that needs several points of one sequence — QMCSampler asks for + /// one per trial — keeps the engine. The shuffle arrays are disposed as soon as they are copied out, so none is + /// left for the finalizer. + /// </remarks> + internal static Engine Create(int dim, int seed) { int[] primes = QuasiMonteCarlo.HaltonPrimes(dim); Generator rng = np.random.default_rng(seed); - var point = new double[dim]; + var permutations = new long[dim][][]; for (int d = 0; d < dim; d++) { int b = primes[d]; @@ -50,27 +67,69 @@ internal static double[] Point(int dim, ulong n, int seed) var perms = new long[count][]; for (int j = 0; j < count; j++) { - NDArray row = np.arange((long)b); // int64 [0, b), the row `np.repeat(arange(b))` shuffles - rng.shuffle(row); // in-place Fisher–Yates (random_interval), byte-exact + using NDArray row = np.arange((long)b); // int64 [0, b), the row `np.repeat(arange(b))` shuffles + rng.shuffle(row); // in-place Fisher–Yates (random_interval), byte-exact perms[j] = row.ToArray<long>(); } + permutations[d] = perms; + } + return new Engine(primes, permutations); + } - // scipy _cy_van_der_corput_scrambled at start_index=n: EXACTLY `count` permuted digits, - // so trailing zero digits are permuted too (P[j][0] may be nonzero) — never stop at - // quotient==0. Accumulated in scipy's order (add, then advance b2r and quotient). - double r = 0.0; - double b2r = 1.0 / b; - ulong quotient = n; - for (int j = 0; j < count; j++) + /// <summary> + /// A scrambled Halton sequence for one <c>(dim, seed)</c>: the bases and every dimension's digit permutations, + /// from which any point is computed directly. + /// </summary> + /// <remarks> + /// Immutable after construction, so one instance can serve concurrent callers. The digit expansion in + /// <see cref="Point" /> is the same double arithmetic, in the same order, as the per-call form it replaces, + /// so the points are bit-identical. + /// </remarks> + internal sealed class Engine + { + private readonly int[] _bases; + private readonly long[][][] _permutations; + + /// <summary>Wraps finished permutations; the arrays are owned by the engine from here on.</summary> + /// <param name="bases">The prime base of each dimension.</param> + /// <param name="permutations">Each dimension's digit permutations, <c>[dim][count][base]</c>.</param> + internal Engine(int[] bases, long[][][] permutations) + { + _bases = bases; + _permutations = permutations; + } + + /// <summary>The number of dimensions every point of this sequence has.</summary> + internal int Dim => _bases.Length; + + /// <summary>The scrambled point at sequence index <paramref name="n" /> — <c>fast_forward(n)</c> then <c>random(1)</c>.</summary> + /// <param name="n">The zero-based sequence index of the scrambled Halton point.</param> + /// <returns>A new array of <see cref="Dim" /> coordinates the caller owns.</returns> + internal double[] Point(ulong n) + { + var point = new double[_bases.Length]; + for (int d = 0; d < _bases.Length; d++) { - int remainder = (int)(quotient % (ulong)b); - remainder = (int)perms[j][remainder]; - r += remainder * b2r; - b2r /= b; - quotient /= (ulong)b; + int b = _bases[d]; + long[][] perms = _permutations[d]; + + // scipy _cy_van_der_corput_scrambled at start_index=n: EXACTLY `count` permuted digits, + // so trailing zero digits are permuted too (P[j][0] may be nonzero) — never stop at + // quotient==0. Accumulated in scipy's order (add, then advance b2r and quotient). + double r = 0.0; + double b2r = 1.0 / b; + ulong quotient = n; + for (int j = 0; j < perms.Length; j++) + { + int remainder = (int)(quotient % (ulong)b); + remainder = (int)perms[j][remainder]; + r += remainder * b2r; + b2r /= b; + quotient /= (ulong)b; + } + point[d] = r; } - point[d] = r; + return point; } - return point; } } diff --git a/src/OptunaSharp.Core/Internal/ScrambledSobol.cs b/src/OptunaSharp.Core/Internal/ScrambledSobol.cs index 6eb54fe..9855de3 100644 --- a/src/OptunaSharp.Core/Internal/ScrambledSobol.cs +++ b/src/OptunaSharp.Core/Internal/ScrambledSobol.cs @@ -22,7 +22,23 @@ internal static class ScrambledSobol /// <param name="n">The number of elements or points to process.</param> /// <param name="seed">The seed controlling the reproducible random stream.</param> /// <returns>The scrambled Sobol sample matrix with rows for points and columns for dimensions.</returns> - internal static double[,] Random(int d, int n, int seed) + internal static double[,] Random(int d, int n, int seed) => Create(d, seed).Generate(n); + + /// <summary> + /// Builds the scrambled engine of <c>Sobol(d, scramble=True, seed)</c>: draws the digital shift and the + /// linear-matrix-scramble cube from <c>default_rng(seed)</c> in scipy's order and scrambles the direction + /// numbers. Every point of the sequence is then a pure function of this state. + /// </summary> + /// <param name="d">The number of Sobol dimensions.</param> + /// <param name="seed">The seed controlling the reproducible random stream.</param> + /// <returns>An immutable engine that can be shared across threads and reused for any point index.</returns> + /// <exception cref="NumSharp.ValueError">The dimension is outside the supported direction-number table.</exception> + /// <remarks> + /// Building is the expensive part — <c>d·bits²</c> rng draws and the <c>O(d·bits³)</c> scramble — so a caller + /// that needs several points of the same <c>(d, seed)</c> sequence (QMCSampler asks for one point per trial) + /// keeps the engine instead of rebuilding it for every point. + /// </remarks> + internal static Engine Create(int d, int seed) { int bits = QuasiMonteCarlo.SobolBits; // 30 uint[][] sv = QuasiMonteCarlo.SobolSv(d); @@ -30,7 +46,9 @@ internal static class ScrambledSobol // _scramble(): the digital shift then the lower-triangular LMS matrices, in this rng order. // shift[i] = Σ_j M[i,j]·2^j with M = integers(2, size=(d, bits)). - long[] shiftBits = rng.integers(2, null, new Shape(d, bits)).ToArray<long>(); + long[] shiftBits; + using (NDArray drawn = rng.integers(2, null, new Shape(d, bits))) + shiftBits = drawn.ToArray<long>(); var shift = new uint[d]; for (int i = 0; i < d; i++) { @@ -43,25 +61,102 @@ internal static class ScrambledSobol // ltm = tril(integers(2, size=(d, bits, bits))) — the full cube is drawn (upper entries too), // then masked to the lower triangle; _cscramble forces the diagonal to 1. - long[] ltm = rng.integers(2, null, new Shape(d, bits, bits)).ToArray<long>(); + long[] ltm; + using (NDArray drawn = rng.integers(2, null, new Shape(d, bits, bits))) + ltm = drawn.ToArray<long>(); Cscramble(d, bits, ltm, sv); + return new Engine(d, bits, shift, sv); + } + + /// <summary> + /// A scrambled Sobol' sequence for one <c>(d, seed)</c>: the digital shift and the scrambled direction + /// numbers, from which any point is computed without generating the points before it. + /// </summary> + /// <remarks> + /// Immutable after construction, so one instance can serve concurrent callers; nothing it returns aliases its + /// state. Point <c>k</c> of the Gray-code construction is <c>shift XOR</c> the direction numbers of the bits set + /// in <c>gray(k) = k ^ (k >> 1)</c>, because step <c>k</c> XORs in the direction number of the lowest set bit + /// of <c>k</c>, which is exactly the bit by which <c>gray(k)</c> differs from <c>gray(k - 1)</c>. The integer + /// state is therefore the same as after stepping, and the conversion to double is the same multiplication, so + /// <see cref="Point" /> and <see cref="Generate" /> agree bit for bit. + /// </remarks> + internal sealed class Engine + { + private readonly int _bits; + private readonly uint[] _shift; + private readonly uint[][] _sv; + private readonly double _scale; + + /// <summary>Wraps a finished scramble; the arrays are owned by the engine from here on.</summary> + /// <param name="dim">The number of Sobol dimensions.</param> + /// <param name="bits">The number of direction-number bits (scipy's 30).</param> + /// <param name="shift">The digital shift, one integer per dimension; point 0 of the sequence.</param> + /// <param name="sv">The scrambled direction numbers, <c>[dim][bits]</c>.</param> + internal Engine(int dim, int bits, uint[] shift, uint[][] sv) + { + Dim = dim; + _bits = bits; + _shift = shift; + _sv = sv; + _scale = 1.0 / Math.Pow(2.0, bits); + } + + /// <summary>The number of dimensions every point of this sequence has.</summary> + internal int Dim { get; } + + /// <summary> + /// The first <paramref name="n" /> points — <c>random(n)</c> on a fresh engine: point 0 is the shift and + /// each later point XORs one direction number into the previous one (Gray code). + /// </summary> + /// <param name="n">The number of points to produce.</param> + /// <returns>A new <c>[n, Dim]</c> matrix the caller owns.</returns> + internal double[,] Generate(int n) + { + int d = Dim; + var sample = new double[n, d]; + var quasi = (uint[])_shift.Clone(); + for (int j = 0; j < d; j++) + sample[0, j] = quasi[j] * _scale; + for (int k = 1; k < n; k++) + { + int l = LowZeroBit((uint)(k - 1)); + for (int j = 0; j < d; j++) + { + quasi[j] ^= _sv[j][l - 1]; + sample[k, j] = quasi[j] * _scale; + } + } + return sample; + } - // Generate: point 0 is the shift; each subsequent point XORs a direction number (Gray code). - double scale = 1.0 / Math.Pow(2.0, bits); - var sample = new double[n, d]; - var quasi = (uint[])shift.Clone(); - for (int j = 0; j < d; j++) - sample[0, j] = quasi[j] * scale; - for (int k = 1; k < n; k++) + /// <summary> + /// The point at <paramref name="index" /> — <c>fast_forward(index)</c> then <c>random(1)</c> — computed + /// directly from <c>gray(index)</c> in <c>O(Dim·bits)</c> instead of by generating every earlier point. + /// </summary> + /// <param name="index">The zero-based sequence index; smaller than <c>2^bits</c>.</param> + /// <returns>A new array of <see cref="Dim" /> coordinates in <c>[0, 1)</c>, bit-identical to row + /// <paramref name="index" /> of <see cref="Generate" />.</returns> + /// <exception cref="NumSharp.ValueError">The index is past the last point of a <c>bits</c>-bit sequence.</exception> + internal double[] Point(ulong index) { - int l = LowZeroBit((uint)(k - 1)); + // The stepping form would index past the direction numbers here; scipy refuses to draw past 2^bits too. + if (index >= 1UL << _bits) + throw new ValueError($"The Sobol' sequence has only 2**{_bits} points; index {index} is past its end."); + ulong gray = index ^ (index >> 1); + int d = Dim; + var point = new double[d]; for (int j = 0; j < d; j++) { - quasi[j] ^= sv[j][l - 1]; - sample[k, j] = quasi[j] * scale; + uint quasi = _shift[j]; + uint[] svj = _sv[j]; + // XOR is associative and commutative, so the order of the set bits does not matter. + for (ulong g = gray, b = 0; g != 0; g >>= 1, b++) + if ((g & 1UL) != 0) + quasi ^= svj[b]; + point[j] = quasi * _scale; } + return point; } - return sample; } /// <summary> diff --git a/src/OptunaSharp.Core/Internal/SearchSpaceTransform.cs b/src/OptunaSharp.Core/Internal/SearchSpaceTransform.cs index 43422a4..f79ab0a 100644 --- a/src/OptunaSharp.Core/Internal/SearchSpaceTransform.cs +++ b/src/OptunaSharp.Core/Internal/SearchSpaceTransform.cs @@ -85,8 +85,29 @@ public NDArray Bounds /// Transform a parameter configuration from actual values to continuous space. /// </summary> /// <param name="parameters">A parameter configuration to transform.</param> - /// <returns>A 1-dimensional float64 array holding the transformed parameters.</returns> + /// <returns>A 1-dimensional float64 array holding the transformed parameters; the caller owns it and should dispose it.</returns> + /// <remarks> + /// A caller that only needs the values should call <see cref="TransformValues" />: this overload wraps the same + /// values in a NumSharp array, which waits for the finalizer when it is not disposed (plan 14). + /// </remarks> + /// <exception cref="NumSharp.TypeError">A numerical parameter value is not a real number.</exception> + /// <exception cref="ArgumentException">A parameter of the search space is missing from <paramref name="parameters" /> (Optuna's assertion message).</exception> public NDArray Transform(IReadOnlyDictionary<string, object?> parameters) + => np.array(TransformValues(parameters)); + + /// <summary> + /// Transform a parameter configuration from actual values to continuous space, as a managed array: the values + /// <see cref="Transform" /> returns, without the NumSharp array around them. + /// </summary> + /// <param name="parameters">A parameter configuration holding every parameter of the search space.</param> + /// <returns>A new array of the transformed parameters, one entry per encoded column (one-hot columns for categoricals).</returns> + /// <exception cref="NumSharp.TypeError">A numerical parameter value is not a real number.</exception> + /// <exception cref="ArgumentException"> + /// A parameter of the search space is missing from <paramref name="parameters" />: "Parameter configuration must + /// contain all distributions.", Optuna's assertion message (its <c>AssertionError</c> maps to this type here, as + /// cmaes' assertions do). CMA-ES with an <c>x0</c> that lacks a parameter reaches it (QA-83). + /// </exception> + internal double[] TransformValues(IReadOnlyDictionary<string, object?> parameters) { int n = _rawBounds.GetLength(0); var transParams = new double[n]; @@ -94,9 +115,10 @@ public NDArray Transform(IReadOnlyDictionary<string, object?> parameters) int boundIdx = 0; foreach (var (name, distribution) in _searchSpace) { - System.Diagnostics.Debug.Assert( - parameters.ContainsKey(name), "Parameter configuration must contain all distributions."); - var param = parameters[name]; + // Optuna's `assert name in params, ...` as a real check: Debug.Assert vanished from Release builds, so a missing + // parameter escaped as KeyNotFoundException, which names the key but not the cause (QA-83). + if (!parameters.TryGetValue(name, out var param)) + throw new ArgumentException("Parameter configuration must contain all distributions."); if (distribution is CategoricalDistribution categorical) { @@ -124,21 +146,44 @@ public NDArray Transform(IReadOnlyDictionary<string, object?> parameters) } } - return np.array(transParams); + return transParams; } /// <summary> /// Untransform a parameter configuration from continuous space to actual values. /// </summary> - /// <param name="transParams">A 1-dimensional array in the transformed space.</param> + /// <param name="transParams">A 1-dimensional array in the transformed space; any numeric dtype, read as float64.</param> /// <returns>An untransformed parameter configuration keyed by parameter name.</returns> + /// <remarks> + /// Reads the values through NumPy's <c>astype(float64)</c> copy, which is disposed here, then untransforms them as + /// <see cref="UntransformValues" /> does. A caller holding a managed float64 array should call that + /// overload directly and skip the NumSharp copy. + /// </remarks> public OrderedDict<string, object?> Untransform(NDArray transParams) { - int n = _rawBounds.GetLength(0); - System.Diagnostics.Debug.Assert(transParams.shape.Length == 1 && transParams.shape[0] == n); + System.Diagnostics.Debug.Assert(transParams.shape.Length == 1 && transParams.shape[0] == _rawBounds.GetLength(0)); + + // astype copies by default, so the copy is this method's to dispose; left alone it would survive a collection on + // the finalization queue (plan 14). + double[] values; + using (NDArray asFloat64 = transParams.astype(np.float64)) + values = asFloat64.ToArray<double>(); + return UntransformValues(values); + } - var values = transParams.astype(np.float64).ToArray<double>(); + /// <summary> + /// Untransform a parameter configuration from continuous space to actual values, reading float64 values directly: + /// the result <see cref="Untransform(NDArray)" /> gives for the same values, without a NumSharp array. + /// </summary> + /// <param name="transParams">One value per encoded column, in the transformed space; not modified.</param> + /// <returns>An untransformed parameter configuration keyed by parameter name, in search-space order.</returns> + /// <exception cref="System.InvalidOperationException">A distribution of the search space is not supported (cannot happen for a transform this class built).</exception> + internal OrderedDict<string, object?> UntransformValues(ReadOnlySpan<double> transParams) + { + int n = _rawBounds.GetLength(0); + System.Diagnostics.Debug.Assert(transParams.Length == n); + ReadOnlySpan<double> values = transParams; if (_transform01) { var scaled = new double[n]; @@ -147,7 +192,9 @@ public NDArray Transform(IReadOnlyDictionary<string, object?> parameters) values = scaled; } - var parameters = new OrderedDict<string, object?>(); + // Sized for the search space up front: the result is built on every untransform (per trial and per independent + // draw), and growing an OrderedDictionary from empty reallocates several times for a few dozen parameters. + var parameters = new OrderedDict<string, object?>(_searchSpace.Count); int column = 0; foreach (var (name, distribution) in _searchSpace) @@ -160,10 +207,10 @@ public NDArray Transform(IReadOnlyDictionary<string, object?> parameters) { // Select the highest rated one-hot encoding (np.argmax: first max wins). int argmax = 0; - double best = values[encodedColumns[0]]; + double best = values[(int)encodedColumns[0]]; for (int i = 1; i < encodedColumns.Length; i++) { - double v = values[encodedColumns[i]]; + double v = values[(int)encodedColumns[i]]; if (v > best) { best = v; @@ -174,7 +221,7 @@ public NDArray Transform(IReadOnlyDictionary<string, object?> parameters) } else { - param = UntransformNumericalParam(values[encodedColumns[0]], distribution, _transformLog); + param = UntransformNumericalParam(values[(int)encodedColumns[0]], distribution, _transformLog); } parameters[name] = param; diff --git a/src/OptunaSharp.Core/Internal/TpeTrialSplit.cs b/src/OptunaSharp.Core/Internal/TpeTrialSplit.cs index bf5399f..a5d39a1 100644 --- a/src/OptunaSharp.Core/Internal/TpeTrialSplit.cs +++ b/src/OptunaSharp.Core/Internal/TpeTrialSplit.cs @@ -88,7 +88,8 @@ private static double[] Linspace(double start, double stop, int num) internal static (List<FrozenTrial> Below, List<FrozenTrial> Above) SplitTrials( Study study, IReadOnlyList<FrozenTrial> trials, int nBelow) { - var complete = new List<FrozenTrial>(); + // Sized for the common case, where nearly every trial is complete, so the list never regrows (plan 15). + var complete = new List<FrozenTrial>(trials.Count); var pruned = new List<FrozenTrial>(); var running = new List<FrozenTrial>(); var infeasible = new List<FrozenTrial>(); @@ -114,16 +115,18 @@ internal static (List<FrozenTrial> Below, List<FrozenTrial> Above) SplitTrials( nBelow = Math.Max(0, nBelow - belowPruned.Count); var (belowInfeasible, aboveInfeasible) = SplitInfeasibleTrials(infeasible, nBelow); - var below = new List<FrozenTrial>(belowComplete); + var below = new List<FrozenTrial>(belowComplete.Count + belowPruned.Count + belowInfeasible.Count); + below.AddRange(belowComplete); below.AddRange(belowPruned); below.AddRange(belowInfeasible); - var above = new List<FrozenTrial>(aboveComplete); + var above = new List<FrozenTrial>(aboveComplete.Count + abovePruned.Count + aboveInfeasible.Count + running.Count); + above.AddRange(aboveComplete); above.AddRange(abovePruned); above.AddRange(aboveInfeasible); above.AddRange(running); - below.Sort((a, b) => a.Number.CompareTo(b.Number)); - above.Sort((a, b) => a.Number.CompareTo(b.Number)); + SortByNumber(below); + SortByNumber(above); return (below, above); } @@ -149,26 +152,88 @@ private static (List<FrozenTrial> Below, List<FrozenTrial> Above) SplitCompleteT private static (List<FrozenTrial> Below, List<FrozenTrial> Above) SplitCompleteTrialsSingleObjective( IReadOnlyList<FrozenTrial> trials, Study study, int nBelow) { - // Python's `sorted` is stable; OrderBy/OrderByDescending are too (ties keep input order). - var sorted = study.Directions[0] == StudyDirection.Minimize - ? trials.OrderBy(t => t.Value!.Value).ToList() - : trials.OrderByDescending(t => t.Value!.Value).ToList(); - return (sorted.Take(nBelow).ToList(), sorted.Skip(nBelow).ToList()); + // Python's `sorted` is stable: ties keep input order. The trials are sorted by (value, position), descending + // values for a maximized objective, which is the order LINQ's stable OrderBy / OrderByDescending produced, with + // the same double.CompareTo semantics (NaN first, -0.0 equal to 0.0). Plan 15: (value, position) structs that + // compare themselves, so the generic sort calls CompareTo directly instead of a comparer through an interface, + // and the two sides built at their final sizes instead of three intermediate lists per ask. + int n = trials.Count; + bool descending = study.Directions[0] != StudyDirection.Minimize; + var keyed = new ValueThenPosition[n]; + for (int i = 0; i < n; i++) + keyed[i] = new ValueThenPosition(trials[i].Value!.Value, i, descending); + Array.Sort(keyed); + + var below = new List<FrozenTrial>(nBelow); + var above = new List<FrozenTrial>(n - nBelow); + for (int r = 0; r < n; r++) + (r < nBelow ? below : above).Add(trials[keyed[r].Position]); + return (below, above); + } + + /// <summary> + /// A trial's objective value and position, ordered by value (ascending, or descending for a maximized + /// objective), ties by position: the order of a stable sort by value. + /// </summary> + /// <remarks> + /// Values compare with <see cref="double.CompareTo(double)" />, the comparison LINQ's default comparer made, so NaN + /// sorts first and -0.0 ties with 0.0; reversing its sign for the descending order is what + /// <c>OrderByDescending</c> did. Positions are distinct, so the order is total and any correct sort yields it. + /// Every element of one sort carries the same direction. + /// </remarks> + private readonly struct ValueThenPosition : IComparable<ValueThenPosition> + { + /// <summary>The trial's objective value.</summary> + internal readonly double Value; + + /// <summary>The trial's position in the input list.</summary> + internal readonly int Position; + + private readonly bool _descending; + + /// <summary>Pairs a value with its position.</summary> + /// <param name="value">The trial's objective value.</param> + /// <param name="position">The trial's position in the input list.</param> + /// <param name="descending">Whether larger values come first; the same for every element of a sort.</param> + internal ValueThenPosition(double value, int position, bool descending) + { + Value = value; + Position = position; + _descending = descending; + } + + /// <summary>Compares by value, then by position.</summary> + /// <param name="other">The element to compare with.</param> + /// <returns>Negative when this sorts first, positive when <paramref name="other" /> does, zero only for the same position.</returns> + public int CompareTo(ValueThenPosition other) + { + int byValue = Value.CompareTo(other.Value); + if (_descending) + byValue = -byValue; + return byValue != 0 ? byValue : Position.CompareTo(other.Position); + } } /// <summary>Python <c>_get_pruned_trial_score(trial, study)</c>.</summary> /// <param name="trial">The trial whose recorded state and values are used.</param> /// <param name="study">The study supplying trial history, objective directions, and storage.</param> /// <returns>A lexicographic score prioritizing later pruning steps and then better intermediate values.</returns> + /// <exception cref="NumSharp.RuntimeError"> + /// The study is multi-objective and the trial's last intermediate value is not NaN: Optuna reads + /// <c>study.direction</c> here, which raises for a multi-objective study, so its TPE trial fails (QA-79). + /// </exception> private static (double, double) GetPrunedTrialScore(FrozenTrial trial, Study study) { - if (trial.IntermediateValues.Count > 0) + if (trial.IntermediateValuesForRead.Count > 0) { - long step = trial.IntermediateValues.Keys.Max(); // max(dict.items()) compares by key (step). - double intermediateValue = trial.IntermediateValues[step]; + long step = trial.IntermediateValuesForRead.Keys.Max(); // max(dict.items()) compares by key (step). + double intermediateValue = trial.IntermediateValuesForRead[step]; if (double.IsNaN(intermediateValue)) return (-step, double.PositiveInfinity); - if (study.Directions[0] == StudyDirection.Minimize) + // `study.direction`, not `directions[0]`: the property raises on a multi-objective study, as Optuna's does. + // Such a study reaches this only through added or foreign PRUNED trials with reports (report() refuses + // multi-objective studies on both sides). + if (study.Direction == StudyDirection.Minimize) return (-step, intermediateValue); return (-step, -intermediateValue); } @@ -193,12 +258,53 @@ private static (List<FrozenTrial> Below, List<FrozenTrial> Above) SplitPrunedTri return (sorted.Take(nBelow).ToList(), sorted.Skip(nBelow).ToList()); } + /// <summary> + /// Sorts trials by number in place, as <c>trials.sort(key=lambda trial: trial.number)</c> does in + /// <c>_split_trials</c>. + /// </summary> + /// <param name="trials">The trials to sort; their numbers are distinct.</param> + /// <remarks> + /// Trial numbers are unique within a study, so every correct sort produces the same order, and sorting the + /// numbers as primitive keys with the trials alongside gives exactly what the comparison-delegate sort gave + /// (plan 15: the delegate was called about n log n times per ask on the above list). + /// </remarks> + private static void SortByNumber(List<FrozenTrial> trials) + { + int n = trials.Count; + if (n < 2) + return; + // Already ascending (always so on the multi-objective path, which builds both sides in the history's order): + // sorting would leave every trial where it is, so it is skipped. Copying out and back regardless made that path + // 10-20% slower than the in-place delegate sort it replaced (split bench, two objectives). + bool ascending = true; + for (int i = 1; i < n && ascending; i++) + ascending = trials[i - 1].Number < trials[i].Number; + if (ascending) + return; + var numbers = new int[n]; + var items = new FrozenTrial[n]; + for (int i = 0; i < n; i++) + { + items[i] = trials[i]; + numbers[i] = items[i].Number; + } + Array.Sort(numbers, items); + for (int i = 0; i < n; i++) + trials[i] = items[i]; + } + /// <summary>Python <c>_get_infeasible_trial_score(trial) = sum(v for v in constraints.values() if v > 0)</c>.</summary> /// <param name="trial">The trial whose recorded state and values are used.</param> /// <returns>The sum of positive constraint violations, or positive infinity when feasibility information is unavailable.</returns> private static double GetInfeasibleTrialScore(FrozenTrial trial) { double sum = 0.0; + // Most trials record no constraint, and then the loop below adds nothing: return its 0.0 without building the + // empty constraints dictionary (plan 15; the split scores every trial on every ask, so that was one dictionary + // per trial per ask, two thirds of what a 1,000-trial split allocated). A trial with any constraint, in the + // old list format or the per-key one, takes the original path. + if (!ConstrainedOptimization.HasConstraints(trial.SystemAttrs)) + return sum; foreach (var v in trial.Constraints.Values) { if (v > 0) @@ -321,3 +427,130 @@ private static double[] GetReferencePoint(double[][] lossVals) return referencePoint; } } + +/// <summary> +/// The last below/above split a TPE sampler computed, reused while the same trial records are split again (Rustuna +/// plan 13, item S5). Independent TPE (the default for several objectives) splits the history once per parameter, and +/// every parameter of a trial sees the same records, so a 40-parameter trial computed the same split 40 times: about +/// a quarter of a multi-objective run, in the non-domination ranks and the hypervolume tie-break. +/// </summary> +/// <remarks> +/// <para> +/// <b>Why the records themselves are the key.</b> <see cref="TpeTrialSplit.SplitTrials" /> is a function of the +/// records it is given (their state, values, intermediate values and constraints), the study's directions and +/// <c>n_below</c>. A finished record never changes, and a record changes reference whenever its trial is written +/// after a reader got it: storages publish a new record on every state change, and <c>InMemoryStorage</c> +/// copies a handed-out record before writing it. So the same references in the same order, of the same study, +/// with the same <c>n_below</c>, split the same way, and a cached split is returned only then. Anything else +/// (a new trial, another study, a running trial written by another worker under constant liar, a storage that +/// builds new records per read) misses and splits afresh, which is what the sampler did every time before. +/// </para> +/// <para> +/// Not thread-safe: the sampler calls it under its own monitor (THREADING.md §6.3), and a +/// <see cref="SamplerConcurrency.PerWorker" /> worker instance gets a cache of its own. +/// </para> +/// </remarks> +internal sealed class TpeSplitCache +{ + private OptunaSharp.Storages.BaseStorage? _storage; + private int _studyId; + private int _nBelow; + private FrozenTrial[] _trials = Array.Empty<FrozenTrial>(); + private List<FrozenTrial> _below = new(); + private List<FrozenTrial> _above = new(); + + /// <summary>How many splits were computed rather than reused: a diagnostic the tests read.</summary> + internal int Computed { get; private set; } + + /// <summary> + /// <see cref="TpeTrialSplit.SplitTrials" /> for these records, reused when the previous call split the very same + /// records of the same study with the same <paramref name="nBelow" />. + /// </summary> + /// <param name="study">The study the records belong to; its storage and id are part of the key.</param> + /// <param name="trials">The records to split, in the order the sampler read them.</param> + /// <param name="nBelow">The number of trials the preferred group should hold.</param> + /// <returns>New lists the caller may change, holding the preferred and the remaining records by trial number.</returns> + /// <exception cref="ArgumentNullException"><paramref name="study" /> or <paramref name="trials" /> is null.</exception> + /// <exception cref="Exception">Whatever <see cref="TpeTrialSplit.SplitTrials" /> throws on a miss; nothing is cached then.</exception> + internal (List<FrozenTrial> Below, List<FrozenTrial> Above) Split(Study study, IReadOnlyList<FrozenTrial> trials, int nBelow) + { + ArgumentNullException.ThrowIfNull(study); + ArgumentNullException.ThrowIfNull(trials); + + Refresh(study, trials, nBelow); + + // Copies: the cached lists must survive a caller that changes what it was given. + return (new List<FrozenTrial>(_below), new List<FrozenTrial>(_above)); + } + + /// <summary> + /// <see cref="Split" /> without its defensive copies, for a caller that only reads the two groups: the cached lists + /// themselves (plan 15). + /// </summary> + /// <param name="study">The study the records belong to; its storage and id are part of the key.</param> + /// <param name="trials">The records to split, in the order the sampler read them.</param> + /// <param name="nBelow">The number of trials the preferred group should hold.</param> + /// <returns> + /// The preferred and the remaining records by trial number, the same groups <see cref="Split" /> returns. <b>Never + /// change them</b>: a later call that reuses this split returns these very lists. + /// </returns> + /// <exception cref="ArgumentNullException"><paramref name="study" /> or <paramref name="trials" /> is null.</exception> + /// <exception cref="Exception">Whatever <see cref="TpeTrialSplit.SplitTrials" /> throws on a miss; nothing is cached then.</exception> + /// <remarks> + /// Safe to share: a split's lists are built by <see cref="TpeTrialSplit.SplitTrials" />, stored, and never changed + /// afterwards; a miss replaces the fields with new lists, so a list already handed out keeps its contents. TPE's + /// estimator build only reads them, and copying them cost two history-sized arrays per sampled parameter in + /// independent mode. + /// </remarks> + internal (IReadOnlyList<FrozenTrial> Below, IReadOnlyList<FrozenTrial> Above) SplitShared( + Study study, IReadOnlyList<FrozenTrial> trials, int nBelow) + { + ArgumentNullException.ThrowIfNull(study); + ArgumentNullException.ThrowIfNull(trials); + + Refresh(study, trials, nBelow); + return (_below, _above); + } + + /// <summary>Makes the cached split the split of these records: computes and stores it unless it already is.</summary> + /// <param name="study">The study the records belong to; its storage and id are part of the key.</param> + /// <param name="trials">The records to split, in the order the sampler read them.</param> + /// <param name="nBelow">The number of trials the preferred group should hold.</param> + /// <exception cref="Exception">Whatever <see cref="TpeTrialSplit.SplitTrials" /> throws on a miss; nothing is cached then.</exception> + private void Refresh(Study study, IReadOnlyList<FrozenTrial> trials, int nBelow) + { + if (!Matches(study, trials, nBelow)) + { + var (below, above) = TpeTrialSplit.SplitTrials(study, trials, nBelow); + // Stored only after the split succeeded, so a throwing split leaves the previous entry consistent. + var key = new FrozenTrial[trials.Count]; + for (int i = 0; i < key.Length; i++) + key[i] = trials[i]; + _storage = study.Storage; + _studyId = study.StudyId; + _nBelow = nBelow; + _trials = key; + _below = below; + _above = above; + Computed++; + } + } + + /// <summary>Whether the cached split was computed from exactly these records of this study with this size.</summary> + /// <param name="study">The study being sampled.</param> + /// <param name="trials">The records about to be split.</param> + /// <param name="nBelow">The requested size of the preferred group.</param> + /// <returns>True when every key part matches, the records compared by reference and in order.</returns> + private bool Matches(Study study, IReadOnlyList<FrozenTrial> trials, int nBelow) + { + if (_storage is null || !ReferenceEquals(_storage, study.Storage) || _studyId != study.StudyId + || _nBelow != nBelow || _trials.Length != trials.Count) + return false; + for (int i = 0; i < _trials.Length; i++) + { + if (!ReferenceEquals(_trials[i], trials[i])) + return false; + } + return true; + } +} diff --git a/src/OptunaSharp.Core/Internal/TrialsByNumber.cs b/src/OptunaSharp.Core/Internal/TrialsByNumber.cs new file mode 100644 index 0000000..f8b0c2f --- /dev/null +++ b/src/OptunaSharp.Core/Internal/TrialsByNumber.cs @@ -0,0 +1,109 @@ +using System; +using System.Collections.Generic; +using System.Runtime.CompilerServices; +using System.Runtime.InteropServices; + +namespace OptunaSharp.Internal; + +/// <summary> +/// A trial history searchable by trial number without a dictionary rebuilt on every ask (plan 15): a binary search +/// over a list in strictly ascending number order, which is how every storage returns a study's trials, and a +/// dictionary over the list only when it is not in that order. +/// </summary> +/// <remarks> +/// <para> +/// <b>Why.</b> The steady-state samplers (SMS-EMOA, MOEA/D) resolved their population by number or id through +/// dictionaries built over every completed trial on every ask: O(n) inserts and about half of their allocations +/// per trial. A lookup here costs O(log n) after one allocation-free order check over the list. +/// </para> +/// <para> +/// <b>Same answers.</b> In a list whose numbers strictly ascend, each number occurs at most once, so the binary +/// search finds exactly the record a dictionary keyed by number would hold. A list in any other order gets that +/// dictionary itself, built as the replaced code built it (a later record replaces an earlier one with the same +/// number), so even an unexpected storage order changes nothing. +/// </para> +/// <para> +/// <b>Compiled optimized from the first call.</b> <see cref="Over" /> and <see cref="TryGetValue" /> carry +/// <see cref="MethodImplOptions.AggressiveOptimization" />: as unoptimized tier-0 code the order check made the +/// first few thousand asks of a process slower than the dictionaries it replaced (measured on MOEA/D, +/// 2,000-trial runs, until tiering caught up). They are small loops over a span, which profile-guided +/// optimization has nothing to add to. +/// </para> +/// <para>Holds the list by reference: it must not change while the lookup is in use (the samplers' lists are per-ask snapshots).</para> +/// </remarks> +internal readonly struct TrialsByNumber +{ + private readonly List<FrozenTrial> _trials; + private readonly Dictionary<int, FrozenTrial>? _outOfOrder; + + /// <summary>Wraps a list and, when it is out of order, the dictionary that answers for it instead.</summary> + /// <param name="trials">The history.</param> + /// <param name="outOfOrder">The dictionary over <paramref name="trials" /> when they are not in ascending number order; otherwise null.</param> + private TrialsByNumber(List<FrozenTrial> trials, Dictionary<int, FrozenTrial>? outOfOrder) + { + _trials = trials; + _outOfOrder = outOfOrder; + } + + /// <summary> + /// Whether the history is in strictly ascending trial-number order: then a stable sort by number would leave it as + /// it is, so a caller can skip one (MOEA/D's offspring scan). + /// </summary> + internal bool IsAscending => _outOfOrder is null; + + /// <summary>A lookup over <paramref name="trials" />: checks the order once, and builds a dictionary only if it must.</summary> + /// <param name="trials">The history, normally in ascending trial-number order; not copied, so keep it unchanged while the lookup is used.</param> + /// <returns>The lookup.</returns> + /// <exception cref="ArgumentNullException"><paramref name="trials" /> is null.</exception> + [MethodImpl(MethodImplOptions.AggressiveOptimization)] + internal static TrialsByNumber Over(List<FrozenTrial> trials) + { + ArgumentNullException.ThrowIfNull(trials); + ReadOnlySpan<FrozenTrial> span = CollectionsMarshal.AsSpan(trials); + for (int i = 1; i < span.Length; i++) + { + if (span[i - 1].Number >= span[i].Number) + { + // Out of order (or a repeated number): the binary search could miss, so answer exactly as the replaced + // code did, from a dictionary filled in list order. + var byNumber = new Dictionary<int, FrozenTrial>(trials.Count); + foreach (FrozenTrial t in trials) + byNumber[t.Number] = t; + return new TrialsByNumber(trials, byNumber); + } + } + return new TrialsByNumber(trials, null); + } + + /// <summary>Whether the history holds a trial with this number, and that trial.</summary> + /// <param name="number">The trial number to find.</param> + /// <param name="trial">The trial with that number when found; otherwise null.</param> + /// <returns>True when the history holds the number.</returns> + /// <exception cref="NullReferenceException">The lookup is a <c>default</c> value rather than one made by <see cref="Over" />.</exception> + [MethodImpl(MethodImplOptions.AggressiveOptimization)] + internal bool TryGetValue(int number, out FrozenTrial trial) + { + if (_outOfOrder is not null) + return _outOfOrder.TryGetValue(number, out trial!); + + ReadOnlySpan<FrozenTrial> span = CollectionsMarshal.AsSpan(_trials); + int lo = 0; + int hi = span.Length - 1; + while (lo <= hi) + { + int mid = lo + ((hi - lo) >> 1); + int midNumber = span[mid].Number; + if (midNumber == number) + { + trial = span[mid]; + return true; + } + if (midNumber < number) + lo = mid + 1; + else + hi = mid - 1; + } + trial = null!; + return false; + } +} diff --git a/src/OptunaSharp.Core/Internal/TrialsDataframe.cs b/src/OptunaSharp.Core/Internal/TrialsDataframe.cs index b4d93e0..57f5826 100644 --- a/src/OptunaSharp.Core/Internal/TrialsDataframe.cs +++ b/src/OptunaSharp.Core/Internal/TrialsDataframe.cs @@ -164,7 +164,7 @@ private static (List<Dictionary<(string, string), object?>> Records, List<(strin } case "params": { - foreach (var (nestedAttr, nestedValue) in trial.ParamsDict) + foreach (var (nestedAttr, nestedValue) in trial.Params) { record[(dfColumn, nestedAttr)] = nestedValue; Agg().Add((dfColumn, nestedAttr)); @@ -173,7 +173,7 @@ private static (List<Dictionary<(string, string), object?>> Records, List<(strin } case "user_attrs": { - foreach (var (nestedAttr, nestedValue) in trial.UserAttrsDict) + foreach (var (nestedAttr, nestedValue) in trial.UserAttrs) { record[(dfColumn, nestedAttr)] = nestedValue; Agg().Add((dfColumn, nestedAttr)); @@ -182,7 +182,7 @@ private static (List<Dictionary<(string, string), object?>> Records, List<(strin } case "system_attrs": { - foreach (var (nestedAttr, nestedValue) in trial.SystemAttrsDict) + foreach (var (nestedAttr, nestedValue) in trial.SystemAttrs) { record[(dfColumn, nestedAttr)] = nestedValue; Agg().Add((dfColumn, nestedAttr)); @@ -191,7 +191,7 @@ private static (List<Dictionary<(string, string), object?>> Records, List<(strin } case "intermediate_values": { - foreach (var (step, nestedValue) in trial.IntermediateValues) + foreach (var (step, nestedValue) in trial.IntermediateValuesForRead) { string nestedAttr = step.ToString(System.Globalization.CultureInfo.InvariantCulture); record[(dfColumn, nestedAttr)] = nestedValue; diff --git a/src/OptunaSharp.Core/Internal/TruncNorm.cs b/src/OptunaSharp.Core/Internal/TruncNorm.cs index 04a3c35..60cd6ce 100644 --- a/src/OptunaSharp.Core/Internal/TruncNorm.cs +++ b/src/OptunaSharp.Core/Internal/TruncNorm.cs @@ -18,7 +18,7 @@ namespace OptunaSharp.Internal; /// the plan already excuses for LAPACK-backed linear algebra; the categorical path, the trial /// selection, and everything not routed through <c>erf</c> stay bit-exact. Optuna's own ≥2000- /// element vectorized <c>erf</c> approximation IS reproduced bit-for-bit by -/// <see cref="Erf.ComputeArray" />.</para> +/// <see cref="Erf.ComputeArray(double[])" />.</para> /// </summary> internal static class TruncNorm { @@ -55,16 +55,43 @@ private static double NdtrSingle(double a) /// <returns>Elementwise standard-normal cumulative probabilities.</returns> private static double[] Ndtr(double[] a) { - var scaled = new double[a.Length]; - for (int i = 0; i < a.Length; i++) - scaled[i] = a[i] / Sqrt2; - var erf = Erf.ComputeArray(scaled); var result = new double[a.Length]; - for (int i = 0; i < a.Length; i++) - result[i] = 0.5 + 0.5 * erf[i]; + Ndtr(a, result); return result; } + /// <summary> + /// <see cref="Ndtr(double[])" /> into a caller's buffer, with its two temporaries rented from the shared pool + /// (Rustuna plan 13, item S6): the same per-element arithmetic, and the vectorized-<c>erf</c> switch still sees the + /// logical length, because the rented buffers are passed on as spans of exactly <paramref name="a" />'s length. + /// </summary> + /// <param name="a">The standardized arguments.</param> + /// <param name="result">Receives one probability per element of <paramref name="a" />; at least as long.</param> + /// <exception cref="IndexOutOfRangeException"><paramref name="result" /> is shorter than <paramref name="a" />.</exception> + private static void Ndtr(ReadOnlySpan<double> a, Span<double> result) + { + int n = a.Length; + double[] scaledBuffer = System.Buffers.ArrayPool<double>.Shared.Rent(n); + double[] erfBuffer = System.Buffers.ArrayPool<double>.Shared.Rent(n); + try + { + var scaled = new Span<double>(scaledBuffer, 0, n); + for (int i = 0; i < n; i++) + scaled[i] = a[i] / Sqrt2; + var erf = new Span<double>(erfBuffer, 0, n); + Erf.ComputeArray(scaled, erf); + for (int i = 0; i < n; i++) + result[i] = 0.5 + 0.5 * erf[i]; + } + finally + { + // Returned on every path: a rented buffer that is never returned only costs the pool, but this keeps the + // pool's buckets warm for the next call of the same size. + System.Buffers.ArrayPool<double>.Shared.Return(scaledBuffer); + System.Buffers.ArrayPool<double>.Shared.Return(erfBuffer); + } + } + /// <summary>Python <c>_log_ndtr_single(a)</c>.</summary> /// <param name="a">The first numerical operand; its dimensions must agree with the operation described in the summary.</param> /// <returns>The log standard-normal cumulative probability, evaluated stably in the tails.</returns> @@ -111,44 +138,75 @@ private static double LogNdtrSingle(double a) /// <param name="b">The standardized upper truncation bound for each interval.</param> /// <returns>The log standard-normal probability mass inside each corresponding interval.</returns> internal static double[] LogGaussMass(double[] a, double[] b) + { + var outArr = new double[a.Length]; + LogGaussMass(a, b, outArr); + return outArr; + } + + /// <summary> + /// <see cref="LogGaussMass(double[], double[])" /> into a caller's buffer, with every temporary rented from the + /// shared pool (Rustuna plan 13, item S6). TPE calls it with tens of thousands of elements per estimator, and the + /// array version's temporaries landed on the large-object heap each time. + /// </summary> + /// <param name="a">The standardized lower truncation bound for each interval.</param> + /// <param name="b">The standardized upper truncation bound for each interval; as long as <paramref name="a" />.</param> + /// <param name="result">Receives one log mass per interval; at least as long as <paramref name="a" />, every element written.</param> + /// <exception cref="IndexOutOfRangeException"><paramref name="b" /> or <paramref name="result" /> is shorter than <paramref name="a" />.</exception> + /// <remarks> + /// Same values as the array version, element by element: the central elements are gathered in index order into + /// buffers of exactly the central count, so <see cref="Erf.ComputeArray(ReadOnlySpan{double}, Span{double})" /> + /// picks its exact or vectorized path from the same count as before. + /// </remarks> + internal static void LogGaussMass(ReadOnlySpan<double> a, ReadOnlySpan<double> b, Span<double> result) { int n = a.Length; - var outArr = new double[n]; // case_left = b <= 0; case_right = a > 0; case_central = ~(left | right). NumPy assigns // left, then right (overwriting), then central — so a > 0 wins the left/right overlap. - var centralIdx = new System.Collections.Generic.List<int>(); - for (int i = 0; i < n; i++) + int[] centralBuffer = System.Buffers.ArrayPool<int>.Shared.Rent(Math.Max(n, 1)); + double[] scratch = System.Buffers.ArrayPool<double>.Shared.Rent(Math.Max(4 * n, 1)); + try { - if (!(a[i] > 0.0) && !(b[i] <= 0.0)) - centralIdx.Add(i); - } + int central = 0; + for (int i = 0; i < n; i++) + { + if (!(a[i] > 0.0) && !(b[i] <= 0.0)) + centralBuffer[central++] = i; + } - if (centralIdx.Count > 0) - { - var ac = new double[centralIdx.Count]; - var negB = new double[centralIdx.Count]; - for (int k = 0; k < centralIdx.Count; k++) + if (central > 0) { - ac[k] = a[centralIdx[k]]; - negB[k] = -b[centralIdx[k]]; + // Four views of one rented buffer, each exactly the central count long. + var ac = new Span<double>(scratch, 0, central); + var negB = new Span<double>(scratch, central, central); + var ndtrAc = new Span<double>(scratch, 2 * central, central); + var ndtrNegB = new Span<double>(scratch, 3 * central, central); + for (int k = 0; k < central; k++) + { + ac[k] = a[centralBuffer[k]]; + negB[k] = -b[centralBuffer[k]]; + } + Ndtr(ac, ndtrAc); + Ndtr(negB, ndtrNegB); + for (int k = 0; k < central; k++) + result[centralBuffer[k]] = MathUtil.Log1p(-ndtrAc[k] - ndtrNegB[k]); } - var ndtrAc = Ndtr(ac); - var ndtrNegB = Ndtr(negB); - for (int k = 0; k < centralIdx.Count; k++) - outArr[centralIdx[k]] = MathUtil.Log1p(-ndtrAc[k] - ndtrNegB[k]); - } - for (int i = 0; i < n; i++) + for (int i = 0; i < n; i++) + { + if (a[i] > 0.0) + // mass_case_right(a, b) = mass_case_left(-b, -a). + result[i] = LogDiff(LogNdtrSingle(-a[i]), LogNdtrSingle(-b[i])); + else if (b[i] <= 0.0) + result[i] = LogDiff(LogNdtrSingle(b[i]), LogNdtrSingle(a[i])); + } + } + finally { - if (a[i] > 0.0) - // mass_case_right(a, b) = mass_case_left(-b, -a). - outArr[i] = LogDiff(LogNdtrSingle(-a[i]), LogNdtrSingle(-b[i])); - else if (b[i] <= 0.0) - outArr[i] = LogDiff(LogNdtrSingle(b[i]), LogNdtrSingle(a[i])); + System.Buffers.ArrayPool<int>.Shared.Return(centralBuffer); + System.Buffers.ArrayPool<double>.Shared.Return(scratch); } - - return outArr; } // ------------------------------------------------------------------------------------------ diff --git a/src/OptunaSharp.Core/Pruners/PercentilePruner.cs b/src/OptunaSharp.Core/Pruners/PercentilePruner.cs index 88bcc3b..1124fc3 100644 --- a/src/OptunaSharp.Core/Pruners/PercentilePruner.cs +++ b/src/OptunaSharp.Core/Pruners/PercentilePruner.cs @@ -157,7 +157,7 @@ internal static double GetPercentileIntermediateResultOverTrials( var intermediateValues = new List<double>(); foreach (var t in completedTrials) { - if (t.IntermediateValues.TryGetValue(step, out double v)) + if (t.IntermediateValuesForRead.TryGetValue(step, out double v)) intermediateValues.Add(v); } @@ -171,17 +171,18 @@ internal static double GetPercentileIntermediateResultOverTrials( } /// <summary> - /// NumPy <c>np.nanpercentile(values, q)</c> with the default <c>method="linear"</c>, ported operation for - /// operation from numpy's <c>_quantile</c> (<c>_get_indexes</c>, <c>_get_gamma</c>, <c>_lerp</c>) so the - /// cutoff, and therefore every prune decision, is bit-identical to Optuna's. + /// NumPy <c>np.nanpercentile(values, q)</c> with the default <c>method="linear"</c>, computed by NumSharp's + /// <c>np.nanpercentile</c>, which ports NumPy's <c>_quantile</c> statements and its <c>introselect</c> partition, so + /// the cutoff, and therefore every prune decision, is Optuna's to the last bit (the sign of a zero result in all + /// but rare tie patterns, see remarks). /// </summary> /// <remarks> /// <para>Two numpy details decide the result, and a textbook <c>a + (b - a) * t</c> gets both wrong:</para> /// <list type="bullet"> /// <item><description><c>_lerp</c> computes <c>b - (b - a) * (1 - t)</c> when <c>t >= 0.5</c>. The two - /// formulas differ in the last bit for ordinary data: the median of 0.01 and 0.03 is 0.02 here and in - /// numpy but 0.019999999999999997 with the textbook formula, which flips the decision for a trial that - /// reported exactly 0.02 (pre-release review item H4).</description></item> + /// formulas differ in the last bit for ordinary data: the median of 0.01 and 0.03 is 0.02 in numpy but + /// 0.019999999999999997 with the textbook formula, which flips the decision for a trial that reported + /// exactly 0.02 (pre-release review item H4).</description></item> /// <item><description>The two neighbours are always combined, even when the virtual index lands exactly /// on an element (<c>t == 0</c>) or at or past the last one (numpy clamps both neighbours to the last /// element and measures <c>t</c> from index -1). An infinite neighbour therefore makes the result NaN @@ -189,66 +190,35 @@ internal static double GetPercentileIntermediateResultOverTrials( /// <c>[1, 2, inf]</c> is NaN, not 2, so the pruner keeps the trial exactly as Optuna does, while the /// median of <c>[-inf, 1]</c> is <c>-inf</c>.</description></item> /// </list> - /// <para>NaN inputs are dropped first, as <c>nanpercentile</c> does; the order of the remaining values does - /// not matter because they are sorted. Only the sign of a zero result can differ from numpy (its partition - /// may order <c>-0.0</c> and <c>0.0</c> differently), which no comparison can observe.</para> + /// <para> + /// This was a hand port of those statements over a full sort, equal to NumPy in value everywhere but not in the + /// sign of a zero result: NumPy's partition keeps a particular one of tied <c>-0.0</c>/<c>0.0</c> neighbours, + /// and a sort does not reproduce which (596 of 600 seeded cases bit-identical on 2026-11-11, the four others a + /// zero of the other sign). NumSharp's partition follows NumPy's, 600 of 600 on the same cases. The one tie + /// pattern NumSharp 0.80.0 still resolved differently (the median of <c>[0.0, -0.0, -0.0, -1.0]</c>: NumPy + /// <c>-0.0</c>, NumSharp 0.80.0 and the former port <c>+0.0</c>, QA-85) matches since NumSharp 0.81.0, whose + /// several-kth partition runs NumPy's <c>introselect_</c> statement for statement. No comparison observes a + /// zero's sign, so prune decisions matched either way. A call costs a few microseconds, once per pruning check. + /// </para> /// </remarks> /// <param name="values">Numerical observations consumed in their supplied order.</param> /// <param name="percentile">Percentage defining the retained reference cutoff, in [0, 100].</param> /// <returns> - /// The interpolated percentile of the non-NaN values, or NaN when every value is NaN or there are none. With an - /// infinite value among the two interpolated neighbours the result is NaN or infinite, exactly as numpy's - /// (see remarks). + /// The interpolated percentile of the non-NaN values, or NaN when every value is NaN or there are none (NumPy's + /// result, without its RuntimeWarning). With an infinite value among the two interpolated neighbours the result is + /// NaN or infinite, exactly as numpy's (see remarks). /// </returns> internal static double NanPercentile(IEnumerable<double> values, double percentile) { - var data = values.Where(v => !double.IsNaN(v)).ToArray(); + double[] data = values as double[] ?? values.ToArray(); + // NumPy answers an empty array through np.nanmean (NaN plus a warning); returning NaN here keeps that contract + // explicit instead of depending on the empty-input route. if (data.Length == 0) return double.NaN; - Array.Sort(data); - - int n = data.Length; - // np.true_divide(q, 100), then the 'linear' method's virtual index (n - 1) * q, both in float64. - double quantile = percentile / 100.0; - double virtualIndex = (n - 1) * quantile; - - // _get_indexes: the floor and the element after it. An index at or past the last element takes the last - // element for both neighbours (numpy stores -1); a negative one takes the first. - double previousIndex = Math.Floor(virtualIndex); - double nextIndex = previousIndex + 1; - if (virtualIndex >= n - 1) - { - previousIndex = -1; - nextIndex = -1; - } - if (virtualIndex < 0) - { - previousIndex = 0; - nextIndex = 0; - } - - double previous = data[previousIndex < 0 ? n - 1 : (int)previousIndex]; - double next = data[nextIndex < 0 ? n - 1 : (int)nextIndex]; - - // _get_gamma measures from the clamped index: a clamped -1 gives gamma = virtualIndex + 1 (>= 1), which - // sends _lerp down its `b - diff * (1 - t)` branch with diff == 0, or NaN when the last element is infinite. - double gamma = virtualIndex - previousIndex; - return Lerp(previous, next, gamma); - } - - /// <summary> - /// numpy's <c>_lerp(a, b, t)</c>: <c>a + (b - a) * t</c> below <c>t = 0.5</c> and <c>b - (b - a) * (1 - t)</c> - /// from 0.5 on. The second form returns <c>b</c> exactly at <c>t == 1</c>, and choosing between the forms the - /// way numpy does is what makes the median of two values bit-identical to numpy's. - /// </summary> - /// <param name="a">The lower neighbour (the value at the floor of the virtual index).</param> - /// <param name="b">The upper neighbour.</param> - /// <param name="t">The interpolation weight; numpy can pass values above 1 for a clamped index.</param> - /// <returns>The interpolated value; NaN or infinite when either neighbour is infinite, as in numpy.</returns> - private static double Lerp(double a, double b, double t) - { - double diff = b - a; - return t >= 0.5 ? b - diff * (1 - t) : a + diff * t; + // A zero-copy view: nanpercentile partitions a copy (overwrite_input=False), so the caller's values stay intact. + using NDArray view = np.array(data, copy: false); + using NDArray cutoff = np.nanpercentile(view, percentile); + return (double)cutoff; } /// <summary>Python <c>_is_first_in_interval_step</c>.</summary> diff --git a/src/OptunaSharp.Core/Pruners/SuccessiveHalvingPruner.cs b/src/OptunaSharp.Core/Pruners/SuccessiveHalvingPruner.cs index 7a4d66e..6cf17df 100644 --- a/src/OptunaSharp.Core/Pruners/SuccessiveHalvingPruner.cs +++ b/src/OptunaSharp.Core/Pruners/SuccessiveHalvingPruner.cs @@ -157,7 +157,7 @@ public override bool Prune(Study study, FrozenTrial trial) internal static int GetCurrentRung(FrozenTrial trial) { int rung = 0; - while (trial.SystemAttrsDict.ContainsKey(CompletedRungKey(rung))) + while (trial.SystemAttrs.ContainsKey(CompletedRungKey(rung))) rung += 1; return rung; } @@ -177,8 +177,8 @@ internal static List<double> GetCompetingValues( IReadOnlyList<FrozenTrial> trials, double value, string rungKey) { var competingValues = trials - .Where(t => t.SystemAttrsDict.ContainsKey(rungKey)) - .Select(t => Convert.ToDouble(t.SystemAttrsDict[rungKey], CultureInfo.InvariantCulture)) + .Where(t => t.SystemAttrs.ContainsKey(rungKey)) + .Select(t => Convert.ToDouble(t.SystemAttrs[rungKey], CultureInfo.InvariantCulture)) .ToList(); competingValues.Add(value); return competingValues; diff --git a/src/OptunaSharp.Core/Pruners/WilcoxonPruner.cs b/src/OptunaSharp.Core/Pruners/WilcoxonPruner.cs index dfda67f..0c46c62 100644 --- a/src/OptunaSharp.Core/Pruners/WilcoxonPruner.cs +++ b/src/OptunaSharp.Core/Pruners/WilcoxonPruner.cs @@ -86,7 +86,7 @@ public override bool Prune(Study study, FrozenTrial trial) return false; } - if (bestTrial.IntermediateValues.Count == 0) + if (bestTrial.IntermediateValuesForRead.Count == 0) { OptunaWarnings.Warn( "The best trial has no intermediate values so WilcoxonPruner cannot prune trials. " + @@ -95,8 +95,8 @@ public override bool Prune(Study study, FrozenTrial trial) return false; } - var bestSteps = bestTrial.IntermediateValues.Keys.ToArray(); - var bestStepValues = bestSteps.Select(s => bestTrial.IntermediateValues[s]).ToArray(); + var bestSteps = bestTrial.IntermediateValuesForRead.Keys.ToArray(); + var bestStepValues = bestSteps.Select(s => bestTrial.IntermediateValuesForRead[s]).ToArray(); if (bestStepValues.Any(v => !double.IsFinite(v))) { diff --git a/src/OptunaSharp.Core/README.md b/src/OptunaSharp.Core/README.md index 72dcbdd..246d6d8 100644 --- a/src/OptunaSharp.Core/README.md +++ b/src/OptunaSharp.Core/README.md @@ -9,7 +9,10 @@ hyperparameter optimization framework, built on [NumSharp](https://github.com/Sc dotnet add package OptunaSharp ``` -The package targets **.NET 8** and **.NET 10**. +The package targets **.NET 8** and **.NET 10**. It needs dynamic code: NumSharp compiles its kernels at run time, so +OptunaSharp does not run under NativeAOT. A .NET 10 file-based app turns NativeAOT on by default, so declare +`#:property PublishAot=false` next to `#:package OptunaSharp@*`; without it the first trial fails with +`PlatformNotSupportedException: Dynamic code generation is not supported on this platform.` ## Quick start diff --git a/src/OptunaSharp.Core/Samplers/AgeMoea/AgeMoeaSurvival.Score.cs b/src/OptunaSharp.Core/Samplers/AgeMoea/AgeMoeaSurvival.Score.cs index c84939c..d1e9f62 100644 --- a/src/OptunaSharp.Core/Samplers/AgeMoea/AgeMoeaSurvival.Score.cs +++ b/src/OptunaSharp.Core/Samplers/AgeMoea/AgeMoeaSurvival.Score.cs @@ -1,6 +1,7 @@ using System; using System.Collections.Generic; using System.Linq; +using NumSharp; namespace OptunaSharp.Samplers.AgeMoea; @@ -137,10 +138,8 @@ public bool[] SelectMask(Population pop, int nSurvive) double p = ComputeGeometry(front, extreme, n); - // nn = ||front||_p per row; distances = pairwise / nn[:, None] - var nn = new double[m]; - for (int i = 0; i < m; i++) - nn[i] = VectorNorm(front[i], p); + // nn = np.linalg.norm(front, p, axis=1); distances = pairwise / nn[:, None] + double[] nn = RowNorms(front, p); double[][] sym = PairwiseDistances(front, p); // distances[a][b] = sym[a][b] / nn[a] @@ -267,33 +266,41 @@ internal static double[] MinkowskiDistancesToPoint(double[][] a, double[] point, } /// <summary> - /// <c>np.linalg.norm(x, ord=p)</c> for a vector, mirroring NumPy's branches: <c>ord==1</c> is - /// the sum of absolute values (the common case, since the clamp makes <c>p==1.0</c> a mass - /// point), <c>ord==2</c> is the Euclidean norm, and the general branch is - /// <c>(Σ|x|^p)^(1/p)</c>. + /// pymoo's <c>nn = np.linalg.norm(front, p, axis=1)</c>: the p-norm of every row of the normalized front, + /// computed by NumSharp's <c>np.linalg.norm</c> with the same axis, so each row is reduced in NumPy's order. pymoo + /// calls it from <c>survival_score</c>, which is plain NumPy (not one of the numba <c>fastmath</c> kernels). /// </summary> - /// <param name="x">Input numerical coordinates or observation rows.</param> - /// <param name="p">Minkowski norm exponent describing the front geometry.</param> - /// <returns>The vector p-norm.</returns> - internal static double VectorNorm(double[] x, double p) + /// <param name="front">The normalized front, one row per individual; rows must share one length.</param> + /// <param name="p">Minkowski norm exponent describing the front geometry (1 and 20 are the clamps; any positive value).</param> + /// <returns>One norm per row, in row order.</returns> + /// <remarks> + /// <para> + /// With an axis NumPy takes its per-order branches: <c>add.reduce(abs(x))</c> for <c>ord == 1</c>, + /// <c>sqrt(add.reduce(x * x))</c> for 2, <c>add.reduce(abs(x) ** p) ** (1 / p)</c> otherwise (with + /// <c>np.power</c>'s fast exponents), each <c>add.reduce</c> over a contiguous row, i.e. NumPy's pairwise sum. + /// The former per-row <c>VectorNorm</c> summed left to right, the same for fronts of fewer than eight objectives + /// and different in the last bits from eight on, AGE-MOEA-2's many-objective regime. + /// </para> + /// <para> + /// At eight or more objectives pymoo's numba <c>fastmath</c> kernels (pairwise distances, corner search) may + /// reassociate their own sums, so exact parity there also depends on them; this removes the divergence on the + /// NumPy side. The live gate covers two and three objectives, where both forms agree. + /// </para> + /// </remarks> + internal static double[] RowNorms(double[][] front, double p) { - if (double.IsPositiveInfinity(p)) - return x.Max(Math.Abs); - if (p == 1.0) - { - double s = 0.0; - foreach (double v in x) s += Math.Abs(v); - return s; - } - if (p == 2.0) - { - double s = 0.0; - foreach (double v in x) s += v * v; - return Math.Sqrt(s); - } - double acc = 0.0; - foreach (double v in x) acc += Math.Pow(Math.Abs(v), p); - return Math.Pow(acc, 1.0 / p); + int m = front.Length; + if (m == 0) + return Array.Empty<double>(); + int n = front[0].Length; + // The jagged rows are copied into one C-contiguous (m, n) block, the layout pymoo's array has. + var block = new double[m, n]; + for (int i = 0; i < m; i++) + for (int j = 0; j < n; j++) + block[i, j] = front[i][j]; + using NDArray view = np.array(block, copy: false); + using NDArray norms = np.linalg.norm(view, p, axis: 1); + return norms.ToArray<double>(); } /// <summary> diff --git a/src/OptunaSharp.Core/Samplers/BaseGASampler.cs b/src/OptunaSharp.Core/Samplers/BaseGASampler.cs index 7a302f7..5bf03cc 100644 --- a/src/OptunaSharp.Core/Samplers/BaseGASampler.cs +++ b/src/OptunaSharp.Core/Samplers/BaseGASampler.cs @@ -81,9 +81,10 @@ private sealed class GenerationTracker /// <summary> /// The children this sampler handed to trials that are still running, so a child equal to one a running trial - /// evaluates is generated again instead of evaluated twice at once (<see cref="HandedOutParams" />). A subclass - /// claims each child through it in <c>SampleRelative</c> and forgets the trial in <c>AfterTrial</c>; a - /// sequential run never redraws, so its children, and Optuna parity, are unchanged. + /// asked on another thread evaluates is generated again instead of evaluated twice at once + /// (<see cref="HandedOutParams" />). A subclass claims each child through it in <c>SampleRelative</c> and forgets + /// the trial in <c>AfterTrial</c>; a sequential run, and a batch one caller asks on one thread before telling it, + /// never redraw, so their children, and Optuna parity, are unchanged (QA-57). /// </summary> /// <remarks>Guarded by the sampler's monitor, under which every sampler hook runs; not by <c>_trackerLock</c>.</remarks> private protected HandedOutParams HandedOutChildren { get; } = new(); @@ -191,7 +192,7 @@ private void Fold(GenerationTracker tracker, FrozenTrial trial) if (trial.State != TrialState.Complete) return; // failed/pruned trials never belonged to a population in the reference scan either tracker.NumberById[trial.TrialId] = trial.Number; - object? raw = trial.SystemAttrsDict.GetValueOrDefault(GenerationKey); + object? raw = trial.SystemAttrs.GetValueOrDefault(GenerationKey); int generation = raw is null ? -1 : Convert.ToInt32(raw, CultureInfo.InvariantCulture); if (generation < 0) return; // the scan's `raw is null ? -1` case: contributes to no maximum and no population @@ -219,7 +220,7 @@ private void Fold(GenerationTracker tracker, FrozenTrial trial) /// <exception cref="System.Exception">The configured storage provider fails; its exception propagates.</exception> public int GetTrialGeneration(Study study, FrozenTrial trial) { - var stored = trial.SystemAttrsDict.GetValueOrDefault(GenerationKey); + var stored = trial.SystemAttrs.GetValueOrDefault(GenerationKey); if (stored is not null) return Convert.ToInt32(stored, CultureInfo.InvariantCulture); diff --git a/src/OptunaSharp.Core/Samplers/BruteForceSampler.cs b/src/OptunaSharp.Core/Samplers/BruteForceSampler.cs index e01f141..70e64dc 100644 --- a/src/OptunaSharp.Core/Samplers/BruteForceSampler.cs +++ b/src/OptunaSharp.Core/Samplers/BruteForceSampler.cs @@ -139,7 +139,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S // later); sequentially every branch has one and this is Optuna's choice over all candidates. var choices = tree.ChoicesWithAFreeEnd(EnumerateCandidates(cArgs)); // numpy's choice(choices) with no size/replace/p reduces to choices[randint(0, len)]. - paramVal = choices[(int)_rng.Rng.randint(0, choices.Count)]; + paramVal = choices[(int)NumPyDraws.RandInt(_rng.Rng, 0, choices.Count)]; } object? external = paramDistribution.ToExternalRepr(paramVal); @@ -170,11 +170,11 @@ private static void WithPendingChoices( OrderedDict<string, BaseDistribution>? distributions = null; foreach (var (name, (value, distribution)) in chosen) { - if (t.ParamsDict.ContainsKey(name)) + if (t.Params.ContainsKey(name)) continue; // Copied on the first missing value only: the storage's record is shared and read-only. - @params ??= new OrderedDict<string, object?>(t.ParamsDict); - distributions ??= new OrderedDict<string, BaseDistribution>(t.DistributionsDict); + @params ??= new OrderedDict<string, object?>(t.Params); + distributions ??= new OrderedDict<string, BaseDistribution>(t.Distributions); @params[name] = value; distributions[name] = distribution; } @@ -265,9 +265,19 @@ private static void PopulateTree( nonNanParams.Add(kv); } + // One path buffer serves every trial (plan 15): AddPath walks a path once and keeps nothing of it, so each trial's + // path can overwrite the previous one. A list per trial was most of what a rebuild allocated, and a study rebuilds + // the tree once per sampled parameter and per finished trial. + var trialPath = new List<(string Name, ChoicesArgs Args, double Value)>(); + + // Each new node used to enumerate its parameter's candidates again: Python-faithful decimal arithmetic (a float + // repr, a decimal parse and a correctly rounded conversion per candidate) about a thousand times per rebuild, + // for the handful of progressions a study has. One list per exact progression serves the whole rebuild (plan 15). + var candidatesCache = new Dictionary<(long, long, bool, long, bool), List<double>>(); + List<(string Name, ChoicesArgs Args, double Value)> GetTrialPath(FrozenTrial trial) { - var trialPath = new List<(string, ChoicesArgs, double)>(); + trialPath.Clear(); var trialParams = trial.Params; foreach (var (name, dist) in trial.Distributions) { @@ -338,7 +348,7 @@ private static void PopulateTree( continue; } - var leaf = tree.AddPath(GetTrialPath(trial)); + var leaf = tree.AddPath(GetTrialPath(trial), candidatesCache); if (leaf is not null) { // The parameters are on the defined grid. @@ -393,10 +403,45 @@ private static bool IsNan(object? v) return x is double d && double.IsNaN(d) || x is float f && float.IsNaN(f); } + /// <summary> + /// <see cref="EnumerateCandidates" /> through a cache keyed by the progression's exact bits (low, high, whether a step + /// is given, the step, and whether it is an integer progression): enumerated once, then the same list returned to + /// every later caller with the same key. + /// </summary> + /// <param name="args">The progression to enumerate.</param> + /// <param name="cache">The cache, owned by one tree rebuild on one thread.</param> + /// <returns>The candidates, the very list an earlier call with an equal key returned; callers only read it.</returns> + /// <exception cref="NumSharp.ValueError">The progression has no step (nothing is cached, so every call throws alike).</exception> + /// <remarks> + /// The key compares bits, not values: <see cref="ChoicesArgs.Equals(ChoicesArgs)" /> treats -0.0 as 0.0 and + /// ignores <c>IsInt</c>, and a cache must never hand one progression's list to another that could enumerate + /// differently. <see cref="EnumerateCandidates" /> is deterministic, so a cached list holds what a fresh call + /// returns. + /// </remarks> + internal static List<double> CandidatesFor(ChoicesArgs args, Dictionary<(long, long, bool, long, bool), List<double>> cache) + { + var key = (BitConverter.DoubleToInt64Bits(args.Low), BitConverter.DoubleToInt64Bits(args.High), + args.Step.HasValue, BitConverter.DoubleToInt64Bits(args.Step ?? 0.0), args.IsInt); + if (!cache.TryGetValue(key, out var candidates)) + { + candidates = EnumerateCandidates(args); + cache[key] = candidates; + } + return candidates; + } + /// <summary> /// Port of <c>optuna/samplers/_brute_force.py: _enumerate_candidates</c>. The ordered, /// uniformly-spaced set of candidate values for one parameter (the children keys of a node). /// </summary> + /// <remarks> + /// Float progressions run in .NET <c>decimal</c> where Python uses <c>Decimal</c>. They agree for ordinary + /// ranges; a bound or step whose shortest repr needs more than 28 decimal places (a 17-digit value below about + /// <c>1e-11</c>), or lies below <c>1e-28</c>, can give one candidate more or less (QA-62: + /// <c>(2.942974008882182e-14, 5.614297400888218e-13, step 2e-15)</c> lists 267 values, Optuna 266). A kept + /// difference, the owner's decision of 2026-11-12; <see cref="Distributions.FloatDistribution" /> lists the + /// cases. + /// </remarks> /// <exception cref="ValueError">When <c>step</c> is <c>null</c> (the search space would be infinite).</exception> /// <param name="args">Finite numerical progression descriptor.</param> /// <returns>All internal numerical choices of the finite progression.</returns> @@ -676,14 +721,22 @@ private void ValidateSearchSpaceConsistency(string? paramName, ChoicesArgs? choi /// <summary>Materializes a branch with one child per finite numerical choice.</summary> /// <param name="paramName">Name of the parameter being suggested or looked up.</param> /// <param name="choicesArgs">Finite numerical progression assigned to the branch.</param> + /// <param name="candidatesCache"> + /// The rebuild's candidate lists by exact progression (see <see cref="CandidatesFor" />), or null to enumerate + /// them here. + /// </param> /// <exception cref="NumSharp.ValueError">An expanded branch has incompatible metadata, or its numerical choices are not finite.</exception> - internal void Expand(string? paramName, ChoicesArgs choicesArgs) + internal void Expand( + string? paramName, ChoicesArgs choicesArgs, + Dictionary<(long, long, bool, long, bool), List<double>>? candidatesCache = null) { // If the node is unexpanded, expand it. Otherwise, check compatibility. if (Children is null) { ParamName = paramName; - var choices = EnumerateCandidates(choicesArgs); + var choices = candidatesCache is null + ? EnumerateCandidates(choicesArgs) + : CandidatesFor(choicesArgs, candidatesCache); Children = new OrderedDict<double, TreeNodeBase>(choices.Count); foreach (var value in choices) Children[value] = UnexpandedTreeNode.Instance; @@ -786,13 +839,17 @@ internal void SetLeaf() /// <summary>Add a path (the suggested parameters of one trial) to the tree.</summary> /// <param name="trialPath">Ordered parameter names, progression descriptors, and internal values of the objective path.</param> + /// <param name="candidatesCache">The rebuild's candidate lists by exact progression, passed on to <see cref="Expand" />; or null.</param> /// <returns>The resulting path node, or null if an already-finished prefix prevents expansion.</returns> - internal TreeNode? AddPath(List<(string Name, ChoicesArgs Args, double Value)> trialPath) + /// <exception cref="NumSharp.ValueError">A node on the path has incompatible metadata, or a progression is not finite.</exception> + internal TreeNode? AddPath( + List<(string Name, ChoicesArgs Args, double Value)> trialPath, + Dictionary<(long, long, bool, long, bool), List<double>>? candidatesCache = null) { var currentNode = this; foreach (var (paramName, choicesArgs, value) in trialPath) { - currentNode.Expand(paramName, choicesArgs); + currentNode.Expand(paramName, choicesArgs, candidatesCache); var children = currentNode.Children; if (children is null || children.Count == 0) // children is empty or None. return null; diff --git a/src/OptunaSharp.Core/Samplers/CmaEs/Cma.cs b/src/OptunaSharp.Core/Samplers/CmaEs/Cma.cs index 2603adc..7e2f6e9 100644 --- a/src/OptunaSharp.Core/Samplers/CmaEs/Cma.cs +++ b/src/OptunaSharp.Core/Samplers/CmaEs/Cma.cs @@ -100,7 +100,7 @@ internal class Cma : ICmaOptimizer /// <c>sigma0 = np.min(...)</c> is numpy; a user <c>sigma0</c>, a warm start's <c>math.pow</c> and the /// <c>_EPS</c> fallback are floats. /// </param> - /// <exception cref="System.ArgumentException">The scale is nonpositive, the mean is empty or exceeds the supported magnitude, population size is nonpositive, or covariance shape differs from the decision dimension.</exception> + /// <exception cref="System.ArgumentException">The scale is nonpositive, the mean is empty or exceeds the supported magnitude, population size is nonpositive, a learning rate fails cmaes' assertions (a population of one makes them NaN), covariance shape differs from the decision dimension, or the bounds are malformed or exclude the mean ("invalid bounds").</exception> internal Cma( double[] mean, double sigma, @@ -140,6 +140,12 @@ internal Cma( double cmu = Math.Min( 1 - c1 - 1e-8, // 1e-8 is for large popsize. alphaCov * (muEff - 2 + 1 / muEff) / (Square(nDim + 2) + alphaCov * muEff / 2)); + // cmaes asserts its learning rates here (QA-80). Written as negated comparisons so that a NaN rate fails them, + // as Python's `assert c1 <= 1 - cmu` does: popsize 1 makes mu = 0 and mu_eff = 0/0, so Optuna's first CMA-ES + // trial fails with this message instead of sampling with NaN rates. AssertionError maps to ArgumentException, + // as for every other cmaes assertion in this port. + if (!(c1 <= 1 - cmu)) throw new ArgumentException("invalid learning rate for the rank-one update"); + if (!(cmu <= 1 - c1)) throw new ArgumentException("invalid learning rate for the rank-μ update"); double minAlpha = Math.Min( Math.Min( @@ -164,9 +170,11 @@ internal Cma( // learning rate for the cumulation for the step-size control (eq.55) double cSigma = (muEff + 2) / (nDim + muEff + 5); double dSigma = 1 + 2 * Math.Max(0, Math.Sqrt((muEff - 1) / (nDim + 1)) - 1) + cSigma; + if (!(cSigma < 1)) throw new ArgumentException("invalid learning rate for cumulation for the step-size control"); // learning rate for cumulation for the rank-one update (eq.56) double cc = (4 + muEff / nDim) / (nDim + 4 + 2 * muEff / nDim); + if (!(cc <= 1)) throw new ArgumentException("invalid learning rate for cumulation for the rank-one update"); _nDim = nDim; _popsize = popsize; @@ -201,6 +209,10 @@ internal Cma( _d = null; _b = null; + // cmaes' `assert bounds is None or _is_valid_bounds(bounds, mean), "invalid bounds"` (QA-80): an x0, or a + // warm-start mean from source_trials, outside the search space fails Optuna's first CMA-ES trial instead of + // sampling around an out-of-bounds mean. + if (!IsValidBounds(bounds, mean)) throw new ArgumentException("invalid bounds"); _bounds = bounds; _nMaxResampling = nMaxResampling; _g = 0; @@ -318,8 +330,12 @@ internal static Cma FromState(CmaState s) { // The JSON never recorded Python types. The sampler's default sigma0 (np.min) is numpy, and the types only // shape the pickle this optimizer is stored as next, never a value. - var cma = new Cma(new double[s.NDim], s.Sigma0, FromJagged(s.Bounds), s.NMaxResampling, + // The zero mean is a placeholder RestoreEvolvingState overwrites, so the stored box goes in after the + // constructor: its "invalid bounds" assertion must not test the placeholder (a box need not contain the origin), + // and Python restores by unpickling, which runs none of the constructor's assertions. + var cma = new Cma(new double[s.NDim], s.Sigma0, bounds: null, s.NMaxResampling, seed: null, populationSize: s.Popsize, cov: null, lrAdapt: s.LrAdapt, sigmaIsNumpyScalar: true); + cma._bounds = FromJagged(s.Bounds); cma.RestoreEvolvingState(s); return cma; } @@ -558,7 +574,7 @@ public double[] Ask() internal double[] SampleSolution() { var (b, d) = EigenDecomposition(); - double[] z = _rng.randn(_nDim).ToArray<double>(); // ~ N(0, I) + double[] z = NumPyDraws.Randn(_rng, _nDim); // ~ N(0, I) double[] y = LinAlg.Dot(LinAlg.Dot(b, Diag(d)), z); // ~ N(0, C) var x = new double[_nDim]; for (int i = 0; i < _nDim; i++) @@ -598,6 +614,7 @@ private double[] RepairInfeasibleParams(double[] param) /// <summary>Tell evaluation values.</summary> /// <param name="solutions">Evaluated proposal vectors and minimization-oriented values for one coherent generation.</param> /// <exception cref="System.ArgumentException">The solution count differs from population size or a coordinate exceeds the supported magnitude.</exception> + /// <exception cref="ValueError">The vectors have different lengths, or a length NumPy cannot broadcast against the mean (<see cref="CheckTellShapes" />, QA-60); the optimizer is left unchanged.</exception> public void Tell(List<(double[] X, double Value)> solutions) { if (solutions.Count != _popsize) @@ -607,6 +624,8 @@ public void Tell(List<(double[] X, double Value)> solutions) if (!(Math.Abs(v) < MeanMax)) throw new ArgumentException( $"Abs of all param values must be less than {MeanMax} to avoid overflow errors"); + // NumPy's shape errors before any state changes (a cached optimizer must stay as it was restored). + solutions = CheckTellShapes(solutions, _nDim); _g += 1; // Python's list.sort is stable; OrderBy is a stable sort. @@ -844,6 +863,87 @@ internal bool ShouldStop() // ---- small numpy-shaped helpers ----------------------------------------------------------- + /// <summary> + /// cmaes' <c>_is_valid_bounds(bounds, mean)</c>: no bounds, or one <c>[low, high]</c> row per coordinate with + /// every coordinate of the mean inside its row. A NaN coordinate or bound fails, as Python's comparisons do. + /// </summary> + /// <param name="bounds">The optional box, one row per coordinate and two columns (low, high).</param> + /// <param name="mean">The mean the box must contain.</param> + /// <returns><c>true</c> when cmaes' assertion would hold.</returns> + private static bool IsValidBounds(double[,]? bounds, double[] mean) + { + if (bounds is null) + return true; + if (bounds.GetLength(0) != mean.Length || bounds.GetLength(1) != 2) + return false; + for (int i = 0; i < mean.Length; i++) + if (!(bounds[i, 0] <= mean[i] && mean[i] <= bounds[i, 1])) + return false; + return true; + } + + /// <summary> + /// What <c>x_k = np.array([s[0] for s in solutions])</c> and the broadcasts after it in cmaes' <c>tell</c> make + /// of the told vectors, checked before the optimizer changes anything: NumPy's error where NumPy raises, the + /// vectors as NumPy would use them otherwise. + /// </summary> + /// <remarks> + /// <para> + /// Optuna's CMA-ES with margin tells the raw <c>x_for_tell</c> vectors its trials stored. When the search + /// space loses a dimension before the first generation is told (a conditional parameter, or a range that + /// changes), a new optimizer starts at generation 0 and that generation mixes long and short vectors (QA-60). + /// NumPy then refuses the ragged list (the inhomogeneous-shape error), or, when every vector is long, fails + /// a broadcast: against a one-dimensional mean at <c>self._mean += ...</c> (non-broadcastable output + /// operand), otherwise at <c>x_k - self._mean</c>. Optuna's trial fails with that <c>ValueError</c>; the port + /// used to read the first <c>n_dim</c> entries of each vector and carry on with coordinates that belonged to + /// other parameters. + /// </para> + /// <para> + /// cmaes raises after it has advanced the generation and the function history; Optuna discards that + /// object, but this port may cache a restored optimizer, so the check runs first and leaves it unchanged. + /// One-element vectors told to a larger optimizer broadcast in NumPy without an error (each row repeats its + /// value across the dimensions), and are expanded the same way here; Optuna's intersection search space only + /// shrinks, so that case is not reached through the sampler. + /// </para> + /// </remarks> + /// <param name="solutions">The told vectors and values, as handed to <c>Tell</c>.</param> + /// <param name="nDim">The optimizer's dimension, the length of its mean.</param> + /// <returns><paramref name="solutions" /> itself, or a copy with one-element vectors broadcast to <paramref name="nDim" />.</returns> + /// <exception cref="ValueError">The vectors have different lengths, or a common length NumPy cannot broadcast against the mean (NumPy's messages).</exception> + internal static List<(double[] X, double Value)> CheckTellShapes(List<(double[] X, double Value)> solutions, int nDim) + { + int length = solutions[0].X.Length; + foreach (var s in solutions) + if (s.X.Length != length) + throw new ValueError( + "setting an array element with a sequence. The requested array has an inhomogeneous shape after 1 " + + $"dimensions. The detected shape was ({solutions.Count},) + inhomogeneous part."); + + if (length == nDim) + return solutions; + if (length == 1) + { + // NumPy broadcasts a (popsize, 1) array against the (n_dim,) mean: every coordinate takes the one value. + var expanded = new List<(double[] X, double Value)>(solutions.Count); + foreach (var s in solutions) + { + var x = new double[nDim]; + Array.Fill(x, s.X[0]); + expanded.Add((x, s.Value)); + } + return expanded; + } + + // A one-dimensional mean broadcasts against any length in `x_k - self._mean`; the in-place update + // `self._mean += ...` then cannot write the (length,) step into the (1,) mean. + if (nDim == 1) + throw new ValueError( + $"non-broadcastable output operand with shape (1,) doesn't match the broadcast shape ({length},)"); + // NumPy's message for `x_k - self._mean`, trailing space included. + throw new ValueError( + $"operands could not be broadcast together with shapes ({solutions.Count},{length}) ({nDim},) "); + } + /// <summary>Accumulates a vector using the NumPy-compatible pairwise reduction order.</summary> /// <param name="a">First numerical array operand.</param> /// <returns>The accumulated value using the reference pairwise reduction order.</returns> diff --git a/src/OptunaSharp.Core/Samplers/CmaEs/CmaTrialHistory.cs b/src/OptunaSharp.Core/Samplers/CmaEs/CmaTrialHistory.cs new file mode 100644 index 0000000..13defa8 --- /dev/null +++ b/src/OptunaSharp.Core/Samplers/CmaEs/CmaTrialHistory.cs @@ -0,0 +1,221 @@ +using System; +using System.Collections.Generic; +using OptunaSharp.Storages; + +namespace OptunaSharp.Samplers.CmaEs; + +/// <summary> +/// The parts of a study's history <see cref="CmaEsSampler" /> reads on every ask, kept up to date incrementally: +/// how many trials Optuna's <c>_get_trials</c> would return, the latest of them holding a stored optimizer state +/// (<c>_restore_optimizer</c>'s backward scan), and the ones stamped with a given generation +/// (<c>_get_solution_trials</c>). Optuna rebuilds all three from a full copy of the history on every ask, which +/// makes a run quadratic in its trial count; this class gives the same trials in the same order at the cost of the +/// trials that changed since the last ask (Rustuna plan 13, item S2). +/// </summary> +/// <remarks> +/// <para> +/// <b>Why the results are identical.</b> A finished trial cannot change (storages refuse updates to it), so the +/// leading run of finished trials, in trial-number order, is folded in once: each completed one is counted, +/// filed under its generation stamp, and remembered when it holds an optimizer state. Every refresh classifies +/// only the trials after the first unfinished one (the "tail"), because those may still change. Folded trials +/// all precede the tail's, so "folded, then tail" is Optuna's scan order. A trial that finishes out of order +/// (another worker's) waits in the tail until every earlier trial has finished, which keeps that order. +/// </para> +/// <para> +/// <b>Not thread-safe.</b> Its single owner calls it inside <c>SampleRelative</c> / <c>SampleIndependent</c>, +/// which <c>Trial</c> runs under the sampler's lock (<c>BaseSampler.Locked</c>); a per-worker sampler instance +/// owns its own history. +/// </para> +/// <para> +/// <b>Cost of a stuck trial.</b> A trial that stays RUNNING (a dead worker without heartbeats) stops the fold, so +/// every later refresh rescans the tail from it: speed degrades toward Optuna's per-ask cost, results stay +/// the same. Failing stale trials (<c>fail_stale_trials</c>) lets the fold move on. +/// </para> +/// </remarks> +internal sealed class CmaTrialHistory +{ + /// <summary> + /// Maps a finished or running trial to the snapshot the sampler treats as completed (itself, or a pruned trial + /// rewritten with its last intermediate value), or null when the sampler ignores it. Mirrors the filter of + /// Optuna's <c>CmaEsSampler._get_trials</c>. + /// </summary> + private readonly Func<FrozenTrial, FrozenTrial?> _asSamplerTrial; + + /// <summary>The system-attribute key of the generation stamp, e.g. <c>cma:generation</c>.</summary> + private readonly string _generationKey; + + /// <summary>The prefix of the stored optimizer-state chunks, e.g. <c>cma:optimizer</c>.</summary> + private readonly string _optimizerKeyPrefix; + + /// <summary>The storage the fold describes; trial ids and positions mean nothing in another one.</summary> + private BaseStorage? _storage; + + /// <summary>The study the fold describes.</summary> + private int _studyId = -1; + + /// <summary>How many leading trials (by number) are finished and folded in.</summary> + private int _foldedCount; + + /// <summary> + /// The id of the last folded trial: a history whose trial at that position has another id is not the one + /// folded (a new study under a reused id), so the fold starts over. + /// </summary> + private int _lastFoldedTrialId = -1; + + /// <summary>How many folded trials the sampler treats as completed.</summary> + private int _foldedCompletedCount; + + /// <summary>The folded completed trials by generation stamp (-1 when unstamped), each list in trial order.</summary> + private readonly Dictionary<long, List<FrozenTrial>> _foldedByGeneration = new(); + + /// <summary>The latest folded completed trial that holds an optimizer state; null when none does.</summary> + private FrozenTrial? _foldedLatestStateHolder; + + /// <summary>The completed trials after the first unfinished one, from the last refresh, in trial order.</summary> + private readonly List<FrozenTrial> _tail = new(); + + /// <summary>Creates an empty history; the first <see cref="Refresh" /> folds the study.</summary> + /// <param name="asSamplerTrial"> + /// The sampler's completed-trial filter (see <see cref="_asSamplerTrial" />). It is called once per trial when the + /// trial is folded, and on every refresh for the trials in the tail, so it must not depend on anything but the + /// trial; the sampler's pruned-trial copies are made once and reused for the rest of the run. + /// </param> + /// <param name="generationKey">The generation stamp's system-attribute key.</param> + /// <param name="optimizerKeyPrefix">The optimizer-state chunks' key prefix.</param> + /// <exception cref="ArgumentNullException">An argument is <see langword="null" />.</exception> + internal CmaTrialHistory(Func<FrozenTrial, FrozenTrial?> asSamplerTrial, string generationKey, string optimizerKeyPrefix) + { + _asSamplerTrial = asSamplerTrial ?? throw new ArgumentNullException(nameof(asSamplerTrial)); + _generationKey = generationKey ?? throw new ArgumentNullException(nameof(generationKey)); + _optimizerKeyPrefix = optimizerKeyPrefix ?? throw new ArgumentNullException(nameof(optimizerKeyPrefix)); + } + + /// <summary>The number of trials Optuna's <c>_get_trials</c> would return at the last refresh.</summary> + internal int CompletedCount => _foldedCompletedCount + _tail.Count; + + /// <summary> + /// The latest completed trial, in trial order, that holds a stored optimizer state: the trial Optuna's + /// <c>_restore_optimizer</c> restores from. Null when no completed trial holds one. + /// </summary> + internal FrozenTrial? LatestStateHolder + { + get + { + // The tail's trials come after every folded one, so a holder there is the latest. + for (int i = _tail.Count - 1; i >= 0; i--) + if (HoldsOptimizerState(_tail[i])) + return _tail[i]; + return _foldedLatestStateHolder; + } + } + + /// <summary> + /// Whether the last <see cref="Refresh" /> started over (the first refresh, another storage or study, or a + /// history that no longer starts with the folded trials). The owner must then drop anything it keyed by trial + /// id, because ids from another storage can repeat. + /// </summary> + internal bool WasReset { get; private set; } + + /// <summary> + /// Brings the fold up to date with <paramref name="history" /> and classifies the trials after its first + /// unfinished one. + /// </summary> + /// <param name="history"> + /// Every trial of the study in trial-number order, as <c>Study.GetTrialsForSampler</c> returns it. Read once per + /// position; not kept. + /// </param> + /// <param name="storage">The storage the history came from.</param> + /// <param name="studyId">The study the history belongs to.</param> + /// <exception cref="ArgumentNullException"><paramref name="history" /> or <paramref name="storage" /> is <see langword="null" />.</exception> + internal void Refresh(IReadOnlyList<FrozenTrial> history, BaseStorage storage, int studyId) + { + ArgumentNullException.ThrowIfNull(history); + ArgumentNullException.ThrowIfNull(storage); + + // The fold is valid only for the history it was built from: same storage, same study, and the folded + // positions still hold the same trials. Anything else (a new study under a reused id, a fresh storage) starts + // over; trial ids are unique within one storage, so the last folded id identifies the history. + bool sameHistory = ReferenceEquals(_storage, storage) && _studyId == studyId + && history.Count >= _foldedCount + && (_foldedCount == 0 || history[_foldedCount - 1].TrialId == _lastFoldedTrialId); + WasReset = !sameHistory; + if (!sameHistory) + { + _storage = storage; + _studyId = studyId; + _foldedCount = 0; + _lastFoldedTrialId = -1; + _foldedCompletedCount = 0; + _foldedByGeneration.Clear(); + _foldedLatestStateHolder = null; + } + + // Fold the leading finished trials. Each history read happens once; the snapshot read is the one folded. + while (_foldedCount < history.Count) + { + FrozenTrial source = history[_foldedCount]; + if (!source.State.IsFinished()) + break; + FrozenTrial? completed = _asSamplerTrial(source); + if (completed is not null) + { + _foldedCompletedCount++; + long generation = GenerationOf(completed); + if (!_foldedByGeneration.TryGetValue(generation, out List<FrozenTrial>? sameGeneration)) + _foldedByGeneration[generation] = sameGeneration = new List<FrozenTrial>(); + sameGeneration.Add(completed); + if (HoldsOptimizerState(completed)) + _foldedLatestStateHolder = completed; + } + _lastFoldedTrialId = source.TrialId; + _foldedCount++; + } + + // The tail: trials after the first unfinished one, classified afresh each refresh because they may change. + _tail.Clear(); + for (int i = _foldedCount; i < history.Count; i++) + { + FrozenTrial? completed = _asSamplerTrial(history[i]); + if (completed is not null) + _tail.Add(completed); + } + } + + /// <summary> + /// The completed trials stamped with <paramref name="generation" />, in trial order: what Optuna's + /// <c>_get_solution_trials</c> returns from the trials of the last refresh. + /// </summary> + /// <param name="generation">The optimizer generation whose trials the next tell needs.</param> + /// <returns>A new list the caller may keep; folded trials first, then the tail's.</returns> + internal List<FrozenTrial> SolutionTrials(int generation) + { + var result = _foldedByGeneration.TryGetValue(generation, out List<FrozenTrial>? folded) + ? new List<FrozenTrial>(folded) + : new List<FrozenTrial>(); + foreach (FrozenTrial trial in _tail) + if (GenerationOf(trial) == generation) + result.Add(trial); + return result; + } + + /// <summary>The trial's generation stamp, or -1 (Optuna's default) without one.</summary> + /// <param name="trial">A trial the sampler treats as completed.</param> + /// <returns>The stamp the sampler wrote when the trial asked.</returns> + /// <exception cref="InvalidCastException">The stamp is not a number (a storage corrupted by hand).</exception> + private long GenerationOf(FrozenTrial trial) + => trial.SystemAttrs.TryGetValue(_generationKey, out object? stamp) ? Convert.ToInt64(stamp) : -1; + + /// <summary> + /// Whether the trial stores an optimizer state: any system attribute under the chunk prefix, the test of + /// Optuna's <c>_restore_optimizer</c>. + /// </summary> + /// <param name="trial">A trial the sampler treats as completed.</param> + /// <returns>True when at least one optimizer-state chunk is present.</returns> + private bool HoldsOptimizerState(FrozenTrial trial) + { + foreach (string key in trial.SystemAttrs.Keys) + if (key.StartsWith(_optimizerKeyPrefix, StringComparison.Ordinal)) + return true; + return false; + } +} diff --git a/src/OptunaSharp.Core/Samplers/CmaEs/SepCma.cs b/src/OptunaSharp.Core/Samplers/CmaEs/SepCma.cs index 1919478..740c7db 100644 --- a/src/OptunaSharp.Core/Samplers/CmaEs/SepCma.cs +++ b/src/OptunaSharp.Core/Samplers/CmaEs/SepCma.cs @@ -48,7 +48,9 @@ internal class SepCma : ICmaOptimizer private double[]? _d; private double[] _c; // diagonal covariance (1-D) - private readonly double[,]? _bounds; + // Not readonly: FromState sets it after the constructor, so the constructor's "invalid bounds" check never tests the + // placeholder mean against a stored box (as in Cma). + private double[,]? _bounds; private readonly int _nMaxResampling; private int _g; private NumPyRandom _rng; @@ -76,7 +78,8 @@ internal class SepCma : ICmaOptimizer /// Whether the Python caller would pass <paramref name="sigma" /> as a <c>numpy.float64</c>; it only decides /// the type of the pickled <c>_tolx</c> (and of the untold <c>_sigma</c>). See <see cref="Cma" />. /// </param> - /// <exception cref="System.ArgumentException">The scale is nonpositive, mean dimension is below two or exceeds the supported magnitude, or population size is nonpositive.</exception> + /// <exception cref="System.ArgumentException">The scale is nonpositive, mean dimension is below two or exceeds the supported magnitude, population size is nonpositive, a learning rate fails cmaes' assertions, or the bounds are malformed or exclude the mean ("invalid bounds").</exception> + /// <exception cref="ZeroDivisionError">The population size is 1, so <c>mu</c> is 0 and cmaes' <c>1 / sum(weights**2)</c> divides the int 0 (Python's <c>ZeroDivisionError</c>).</exception> internal SepCma( double[] mean, double sigma, @@ -109,6 +112,10 @@ internal SepCma( double wpSum = SeqSum(weightsPrime); var weights = new double[mu]; for (int i = 0; i < mu; i++) weights[i] = weightsPrime[i] / wpSum; + // popsize 1 gives mu = 0: the builtin `sum` of an empty array is the int 0, so `1 / sum(weights**2)` is a Python + // int division and raises ZeroDivisionError, which fails Optuna's first separable CMA-ES trial (QA-80). A double + // division here would give +inf and sample on. NumSharp's ZeroDivisionError (0.81.0) is Python's class. + if (mu == 0) throw new ZeroDivisionError("division by zero"); double sumWSq = 0; foreach (double w in weights) sumWSq += w * w; // sum(weights**2), sequential double muEff = 1 / sumWSq; @@ -124,7 +131,10 @@ internal SepCma( double cSigma = (muEff + 2) / (nDim + muEff + 3); double dSigma = 1 + 2 * Math.Max(0, Math.Sqrt((muEff - 1) / (nDim + 1)) - 1) + cSigma; + // cmaes' assertions, negated so that NaN fails them as in Python (QA-80). + if (!(cSigma < 1)) throw new ArgumentException("invalid learning rate for cumulation for the step-size control"); double cc = 4.0 / (nDim + 4); + if (!(cc <= 1)) throw new ArgumentException("invalid learning rate for cumulation for the rank-one update"); _nDim = nDim; _popsize = popsize; @@ -148,6 +158,9 @@ internal SepCma( _d = null; _c = Enumerable.Repeat(1.0, nDim).ToArray(); // np.ones(n_dim) + // cmaes' `assert bounds is None or _is_valid_bounds(bounds, mean), "invalid bounds"` (QA-80): an x0 or a + // warm-start mean outside the search space fails Optuna's first CMA-ES trial. + if (!IsValidBounds(bounds, mean)) throw new ArgumentException("invalid bounds"); _bounds = bounds; _nMaxResampling = nMaxResampling; _g = 0; @@ -214,8 +227,11 @@ internal SepCma( internal static SepCma FromState(SepCmaState s) { // The JSON never recorded Python types; the sampler's default sigma0 (np.min) is numpy (see Cma.FromState). - var cma = new SepCma(new double[s.NDim], s.Sigma0, FromJagged(s.Bounds), s.NMaxResampling, + // The zero mean is a placeholder overwritten below, so the stored box goes in after the constructor, untested + // against it, as an unpickled cmaes optimizer runs none of the constructor's assertions (see Cma.FromState). + var cma = new SepCma(new double[s.NDim], s.Sigma0, bounds: null, s.NMaxResampling, seed: null, populationSize: s.Popsize, sigmaIsNumpyScalar: true); + cma._bounds = FromJagged(s.Bounds); cma._g = s.G; cma._mean = (double[])s.Mean.Clone(); cma._sigma = s.Sigma; @@ -359,7 +375,7 @@ private double[] EigenDecomposition() private double[] SampleSolution() { double[] d = EigenDecomposition(); - double[] z = _rng.randn(_nDim).ToArray<double>(); // ~ N(0, I) + double[] z = NumPyDraws.Randn(_rng, _nDim); // ~ N(0, I) var x = new double[_nDim]; for (int i = 0; i < _nDim; i++) x[i] = _mean[i] + _sigma * (d[i] * z[i]); // y = D * z ; x = m + σ y @@ -398,6 +414,7 @@ private double[] RepairInfeasibleParams(double[] param) /// <summary>Updates the optimizer using evaluated candidates from one coherent generation.</summary> /// <param name="solutions">Evaluated proposal vectors and minimization-oriented values for one coherent generation.</param> /// <exception cref="System.ArgumentException">The solution count differs from population size or a coordinate exceeds the supported magnitude.</exception> + /// <exception cref="NumSharp.ValueError">The vectors have different lengths, or a length NumPy cannot broadcast against the mean (<see cref="Cma.CheckTellShapes" />); the optimizer is left unchanged.</exception> public void Tell(List<(double[] X, double Value)> solutions) { if (solutions.Count != _popsize) @@ -407,6 +424,8 @@ public void Tell(List<(double[] X, double Value)> solutions) if (!(Math.Abs(v) < MeanMax)) throw new ArgumentException( $"Abs of all param values must be less than {MeanMax} to avoid overflow errors"); + // SepCMA.tell builds x_k as CMA.tell does, so NumPy's shape errors apply alike; checked before any state changes. + solutions = Cma.CheckTellShapes(solutions, _nDim); _g += 1; var sorted = solutions.OrderBy(s => s.Value).ToList(); @@ -515,6 +534,25 @@ internal bool ShouldStop() /// <param name="a">First numerical array operand.</param> /// <returns>The left-to-right sum of the entries.</returns> private static double SeqSum(double[] a) { double s = 0; foreach (double v in a) s += v; return s; } + + /// <summary> + /// cmaes' <c>_is_valid_bounds(bounds, mean)</c> (shared by CMA and SepCMA): no bounds, or one <c>[low, high]</c> + /// row per coordinate with every coordinate of the mean inside; NaN fails, as Python's comparisons do. + /// </summary> + /// <param name="bounds">The optional box, one row per coordinate and two columns (low, high).</param> + /// <param name="mean">The mean the box must contain.</param> + /// <returns><c>true</c> when cmaes' assertion would hold.</returns> + private static bool IsValidBounds(double[,]? bounds, double[] mean) + { + if (bounds is null) + return true; + if (bounds.GetLength(0) != mean.Length || bounds.GetLength(1) != 2) + return false; + for (int i = 0; i < mean.Length; i++) + if (!(bounds[i, 0] <= mean[i] && mean[i] <= bounds[i, 1])) + return false; + return true; + } /// <summary>Computes the scalar second power used by adaptation equations.</summary> /// <param name="x">Scalar operand used in the comparison or numerical transformation.</param> /// <returns>The product of the scalar with itself.</returns> diff --git a/src/OptunaSharp.Core/Samplers/CmaEs/VkdCma.cs b/src/OptunaSharp.Core/Samplers/CmaEs/VkdCma.cs index 2e25251..5b59cfa 100644 --- a/src/OptunaSharp.Core/Samplers/CmaEs/VkdCma.cs +++ b/src/OptunaSharp.Core/Samplers/CmaEs/VkdCma.cs @@ -412,7 +412,7 @@ private double Norm(double[] x) /// <summary>Draws a vector of independent standard-normal values from the optimizer stream.</summary> /// <param name="n">Number of vector entries to produce.</param> /// <returns>The newly drawn standard-normal vector.</returns> - private double[] Randn(int n) => _rng.randn(n).ToArray<double>(); + private double[] Randn(int n) => NumPyDraws.Randn(_rng, n); // ---- Tell (GaussVkDSampler.update + the ES mean recombination) ---------------------------- diff --git a/src/OptunaSharp.Core/Samplers/CmaEsSampler.cs b/src/OptunaSharp.Core/Samplers/CmaEsSampler.cs index 57ac735..a346c9e 100644 --- a/src/OptunaSharp.Core/Samplers/CmaEsSampler.cs +++ b/src/OptunaSharp.Core/Samplers/CmaEsSampler.cs @@ -1,5 +1,6 @@ using System; using System.Collections.Generic; +using System.ComponentModel; using System.Linq; using NumSharp; using OptunaSharp.Collections; @@ -28,6 +29,13 @@ namespace OptunaSharp.Samplers; /// JSON) are still read; Python cannot read those, so a study gains Python workers once a current /// C# worker has stored the next state. With <c>with_margin=True</c> the Python workers need /// cmaes 0.13.1, whose <c>CMAwM</c> state OptunaSharp reads.</para> +/// +/// <para><b>Faster than Optuna's structure, same results.</b> Optuna restores the optimizer from its pickle +/// and rescans every trial on every ask, which makes a run quadratic in its trial count. This sampler keeps +/// the restored optimizer for the rest of its generation and folds the history incrementally +/// (<c>CmaTrialHistory</c>), reading an in-memory study through its zero-copy view; seeded trials and every +/// stored byte stay identical to Optuna's (Rustuna plan 13, phase 1; the measured gain is in +/// <c>docs/plans/13-rustuna-derived-performance.md</c>).</para> /// </summary> /// <example> /// <code> @@ -60,6 +68,49 @@ public class CmaEsSampler : BaseSampler private readonly List<FrozenTrial>? _sourceTrials; private readonly string _attrPrefix; + /// <summary> + /// The history this sampler reads on every ask (Optuna's <c>_get_trials</c>, the latest stored state, a + /// generation's trials), kept up to date incrementally instead of rebuilt from a full copy each time. Same + /// trials, same order (Rustuna plan 13, item S2). Touched only under the sampler's lock. + /// </summary> + private readonly CmaTrialHistory _history; + + /// <summary> + /// The optimizer deserialized from the latest stored state, kept for the remaining asks of its generation so + /// each ask skips the unpickling and reuses the eigendecomposition the first ask computed (plan 13, item S1). + /// Null when nothing is cached. Touched only under the sampler's lock. + /// </summary> + /// <remarks> + /// It answers only for <see cref="_cachedHolderTrialId" />'s state, and every ask that reuses it would have + /// restored an identical object: asking caches B and D and rewrites C as B·D²·Bᵀ, which a fresh restore of the + /// same stored C recomputes to the same bits, and the per-ask reseed resets the random stream and its Gaussian + /// cache. It is dropped after every tell: the told object stands neither for the state it came from (restored + /// again if the telling trial fails) nor for the state just stored, because Optuna's pickle keeps only C's + /// upper triangle and a restore mirrors it, while the told C keeps the update's floating-point asymmetry. + /// Keeping it moves seeded results (measured: from generation 3 on a 40-D sphere). + /// </remarks> + private ICmaOptimizer? _cachedOptimizer; + + /// <summary> + /// The trial whose stored state <see cref="_cachedOptimizer" /> was restored from; -1 when nothing is cached. + /// A holder is a finished trial, whose system attributes cannot change, so its id names its state; a state + /// another worker (C# or Python) stores lands on another trial and misses. + /// </summary> + private int _cachedHolderTrialId = -1; + + /// <summary> + /// How many stored optimizer states this instance deserialized. Lets the tests assert the cache's contract + /// (one restore per generation in a sequential run) without timing anything. + /// </summary> + internal int RestoreCount { get; private set; } + + /// <summary> + /// The opt-in <c>reuseToldOptimizer</c> (Rustuna plan 13, item D1; the owner chose opt-in with Optuna's path as + /// the default): after a tell, the told optimizer becomes the cache for the state it just stored instead of + /// being dropped. Faster, and no longer Optuna's samples (see <see cref="_cachedOptimizer" /> for why). + /// </summary> + private readonly bool _reuseToldOptimizer; + /// <param name="x0"> /// Initial parameter values for CMA-ES (external representation). By default the mean of the /// low and high of each distribution. <b>Deprecated in v4.9.0.</b> @@ -79,6 +130,15 @@ public class CmaEsSampler : BaseSampler /// <param name="withMargin">Use CMA-ES with margin for discrete distributions (experimental).</param> /// <param name="lrAdapt">Use CMA-ES with learning-rate adaptation (experimental).</param> /// <param name="sourceTrials">Warm Starting CMA-ES source trials (experimental).</param> + /// <param name="reuseToldOptimizer"> + /// <b>Off by default; turning it on makes seeded runs stop matching Python Optuna</b> (from about the third + /// generation; same solution quality, a different run). When on, the optimizer that just told a generation keeps + /// answering the asks that follow, as Rustuna keeps its live optimizer, instead of being restored from the state + /// it stored: about 15 % faster on a 40-D study. The state is still stored every generation exactly as Optuna + /// stores it, so resuming a study and Python workers on the same storage keep working; they just do not + /// reproduce this worker's samples. An OptunaSharp extension with no Optuna counterpart, so it comes after every + /// Optuna parameter. + /// </param> /// <summary>Configures covariance-matrix adaptation and its independent startup and unsupported-parameter fallback.</summary> /// <exception cref="NumSharp.ValueError">Source-trial initialization, explicit initial parameters, separable adaptation, margin correction, or learning-rate adaptation are combined incompatibly.</exception> public CmaEsSampler( @@ -95,7 +155,8 @@ public CmaEsSampler( bool useSeparableCma = false, bool withMargin = false, bool lrAdapt = false, - List<FrozenTrial>? sourceTrials = null) + List<FrozenTrial>? sourceTrials = null, + bool reuseToldOptimizer = false) { if (restartStrategy != null || incPopsize != -1) { @@ -125,8 +186,10 @@ public CmaEsSampler( _withMargin = withMargin; _lrAdapt = lrAdapt; _sourceTrials = sourceTrials; + _reuseToldOptimizer = reuseToldOptimizer; _attrPrefix = useSeparableCma ? "sepcma:" : withMargin ? "cmawm:" : "cma:"; + _history = new CmaTrialHistory(AsSamplerTrial, AttrKeyGeneration, AttrKeyOptimizer); // Optuna raises an ExperimentalWarning (warn_experimental_argument) for consider_pruned_trials, // use_separable_cma, source_trials, with_margin and lr_adapt. OptunaSharp targets the Optuna 5.x @@ -147,6 +210,74 @@ public CmaEsSampler( "Currently, we do not support `use_separable_cma=True` and `with_margin=True`."); } + /// <summary> + /// OptunaSharp 1.0.0's constructor signature, kept only so that assemblies compiled against 1.0.0 still find it + /// at run time. It is the public constructor with <c>reuseToldOptimizer: false</c>, Optuna's path, so a 1.0.0 + /// caller gets exactly the sampler it got before. New code never needs it. + /// </summary> + /// <param name="x0"> + /// Initial parameter values for CMA-ES (external representation); <c>null</c> for the mean of the low and high of + /// each distribution. <b>Deprecated in v4.9.0.</b> + /// </param> + /// <param name="sigma0"> + /// Initial standard deviation of CMA-ES; <c>null</c> for <c>min_range / 6</c>. <b>Deprecated in v4.9.0.</b> + /// </param> + /// <param name="nStartupTrials">Independent sampling is used until this many trials finish.</param> + /// <param name="independentSampler"> + /// Sampler for parameters outside the relative search space; <c>null</c> for a <see cref="RandomSampler" />. + /// </param> + /// <param name="warnIndependentSampling">Emit a warning when a parameter is sampled independently.</param> + /// <param name="seed">Random seed for CMA-ES; <c>null</c> for OS entropy.</param> + /// <param name="considerPrunedTrials">If <c>true</c>, PRUNED trials are considered for sampling (experimental).</param> + /// <param name="restartStrategy"><b>Deprecated in v4.4.0</b>: any value warns and falls back to <c>null</c>.</param> + /// <param name="popsize">Population size of CMA-ES; <c>null</c> for cmaes' default.</param> + /// <param name="incPopsize"><b>Deprecated in v4.4.0</b>: any value but <c>-1</c> warns and is not used.</param> + /// <param name="useSeparableCma">Constrain the covariance matrix to be diagonal (experimental).</param> + /// <param name="withMargin">Use CMA-ES with margin for discrete distributions (experimental).</param> + /// <param name="lrAdapt">Use CMA-ES with learning-rate adaptation (experimental).</param> + /// <param name="sourceTrials">Warm Starting CMA-ES source trials (experimental); <c>null</c> for none.</param> + /// <remarks> + /// <para> + /// OptunaSharp 1.1.0 appended the optional <c>reuseToldOptimizer</c> parameter to the public constructor. Source + /// code compiles against it unchanged, but the change gave that constructor a new metadata signature, and a call + /// compiled against 1.0.0 names the old one: without this overload such a call throws + /// <see cref="MissingMethodException" /> when it runs against 1.1.0 (for example, a library built on 1.0.0 that + /// an application uses together with OptunaSharp 1.1.0). + /// </para> + /// <para> + /// It declares no default values on purpose. With defaults, every call that leaves out an argument + /// (<c>new CmaEsSampler()</c>, <c>new CmaEsSampler(seed: 42)</c>) would match both constructors equally well + /// and fail to compile as ambiguous (CS0121). Without them, such calls bind to the public constructor, and only + /// a call passing all fourteen arguments binds here, with the same result. It is hidden from IntelliSense, and + /// the CLI's reflection factory, which tries the widest public constructor first, never reaches it. + /// </para> + /// </remarks> + /// <exception cref="NumSharp.ValueError"> + /// Source-trial initialization, explicit initial parameters, separable adaptation, margin correction, or + /// learning-rate adaptation are combined incompatibly (the public constructor's checks). + /// </exception> + [EditorBrowsable(EditorBrowsableState.Never)] + public CmaEsSampler( + IReadOnlyDictionary<string, object?>? x0, + double? sigma0, + int nStartupTrials, + BaseSampler? independentSampler, + bool warnIndependentSampling, + int? seed, + bool considerPrunedTrials, + string? restartStrategy, + int? popsize, + int incPopsize, + bool useSeparableCma, + bool withMargin, + bool lrAdapt, + List<FrozenTrial>? sourceTrials) + : this(x0, sigma0, nStartupTrials, independentSampler, warnIndependentSampling, seed, considerPrunedTrials, + restartStrategy, popsize, incPopsize, useSeparableCma, withMargin, lrAdapt, sourceTrials, + reuseToldOptimizer: false) + { + } + /// <summary> /// A worker instance for <see cref="SamplerConcurrency.PerWorker" />: <paramref name="prototype" />'s configuration /// with a CMA generator, a search-space cache and an independent sampler of its own. @@ -176,6 +307,9 @@ private CmaEsSampler(CmaEsSampler prototype, BaseSampler independentSampler) _lrAdapt = prototype._lrAdapt; _sourceTrials = prototype._sourceTrials; _attrPrefix = prototype._attrPrefix; + _reuseToldOptimizer = prototype._reuseToldOptimizer; + // A history and an optimizer cache of its own: each worker folds the shared study by itself. + _history = new CmaTrialHistory(AsSamplerTrial, AttrKeyGeneration, AttrKeyOptimizer); } /// <summary> @@ -233,17 +367,21 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S if (searchSpace.Count == 0) return new OrderedDict<string, object?>(); - var completedTrials = GetTrials(study); - if (completedTrials.Count < _nStartupTrials) + // Optuna's `completed_trials = self._get_trials(study)`, read incrementally: the history folds each finished + // trial once instead of copying and filtering every trial on every ask (CmaTrialHistory). + RefreshHistory(study); + if (_history.CompletedCount < _nStartupTrials) return new OrderedDict<string, object?>(); // When `with_margin=true`, bounds in discrete dimensions are handled inside `CMAwM`. var trans = new SearchSpaceTransform(searchSpace, transformStep: !_withMargin, transform01: true); - var restoredOptimizer = RestoreOptimizer(completedTrials); + var restoredOptimizer = RestoreOptimizer(); var optimizer = restoredOptimizer ?? InitOptimizer(trans, study.Direction, searchSpace); - int nDim = (int)trans.Bounds.shape[0]; + // trans.bounds has one row per encoded column; its row count is read from the raw bounds instead of building the + // NumSharp bounds array only for its shape (plan 14). + int nDim = trans.RawBounds.GetLength(0); if (optimizer.Dim != nDim) { if (_warnIndependentSampling) @@ -257,7 +395,8 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S return new OrderedDict<string, object?>(); } - var solutionTrials = GetSolutionTrials(completedTrials, optimizer.Generation); + // Optuna's `_get_solution_trials(completed_trials, optimizer.generation)`, from the generation index. + var solutionTrials = _history.SolutionTrials(optimizer.Generation); if (solutionTrials.Count >= optimizer.PopulationSize) { @@ -269,7 +408,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S double[] x = optimizer is CmaWm ? ((System.Collections.IEnumerable)t.SystemAttrs["x_for_tell"]!) .Cast<object?>().Select(v => Convert.ToDouble(v)).ToArray() - : trans.Transform(t.ParamsDict).ToArray<double>(); + : trans.TransformValues(t.Params); double y = study.Direction == StudyDirection.Minimize ? t.Value!.Value : -t.Value!.Value; solutions.Add((x, y)); } @@ -280,10 +419,28 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S string optimizerStr = SerializeOptimizer(optimizer, restored: restoredOptimizer is not null); foreach (var (key, value) in SplitOptimizerStr(optimizerStr)) study.Storage.SetTrialSystemAttr(trial.TrialId, key, value); + + if (_reuseToldOptimizer && restoredOptimizer is not null) + { + // Opt-in Rustuna path: the told object answers for the state this trial just stored, from the moment + // the trial completes and becomes the latest state holder. If it fails instead, the previous holder is + // the latest again, its id misses the cache, and that state is restored, as Optuna does. A fresh + // optimizer (no state was restored before this first tell) is not kept, so the cached object always + // carries the restored layout CmaPickle writes for every later tell. + _cachedOptimizer = optimizer; + _cachedHolderTrialId = trial.TrialId; + } + else + { + // The told object no longer equals any stored state (see _cachedOptimizer), so the next ask restores the + // state just stored, as Optuna does: one restore per generation instead of one per ask. + _cachedOptimizer = null; + _cachedHolderTrialId = -1; + } } // Caution: optimizer should update its seed value. - int seed = (int)_cmaRng.Rng.randint(1, 65536) + trial.Number; + int seed = (int)NumPyDraws.RandInt(_cmaRng.Rng, 1, 65536) + trial.Number; optimizer.ReseedRng(seed); double[] cmaParams; if (optimizer is CmaWm cmaWm) @@ -302,9 +459,8 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S study.Storage.SetTrialSystemAttr(trial.TrialId, AttrKeyGeneration, optimizer.Generation); - // View the candidate zero-copy; Untransform copies it into a managed dict, so dispose here. - using NDArray nd = np.array(cmaParams, copy: false); - return trans.Untransform(nd); + // Untransform the managed candidate as it is: Optuna's trans.untransform(params), without a NumSharp copy. + return trans.UntransformValues(cmaParams); } private string AttrKeyGeneration => _attrPrefix + "generation"; @@ -379,25 +535,57 @@ private static ICmaOptimizer DeserializeOptimizer(string optimizerStr) }; } - /// <summary>Finds the newest stored optimizer snapshot in completed trial history.</summary> - /// <param name="completedTrials">Completed trial snapshots used as historical observations.</param> - /// <returns>The newest available optimizer, or null when no stored snapshot exists.</returns> - private ICmaOptimizer? RestoreOptimizer(List<FrozenTrial> completedTrials) + /// <summary> + /// Optuna's <c>_restore_optimizer</c>: the optimizer stored on the latest completed trial that holds one, from + /// <see cref="_cachedOptimizer" /> when that trial's state is the one cached. + /// </summary> + /// <returns>The newest available optimizer, or null when no completed trial stores one.</returns> + /// <exception cref="NumSharp.ValueError">The stored state is neither a legacy JSON state nor a readable cmaes pickle.</exception> + /// <exception cref="System.Text.Json.JsonException">A legacy JSON payload is not valid JSON for its state type.</exception> + /// <exception cref="ArgumentException">A legacy JSON state contains invalid optimizer constructor settings.</exception> + /// <remarks> + /// The holder is <see cref="CmaTrialHistory.LatestStateHolder" />, the trial Optuna's backward scan over the + /// completed trials stops at. A cache hit returns the object an earlier ask of this generation restored and asked + /// with, which produces the same samples as a fresh restore (see <see cref="_cachedOptimizer" />). + /// </remarks> + private ICmaOptimizer? RestoreOptimizer() { + FrozenTrial? holder = _history.LatestStateHolder; + if (holder is null) + return null; + if (_cachedOptimizer is not null && _cachedHolderTrialId == holder.TrialId) + return _cachedOptimizer; + // Restore a previous CMA object. - for (int idx = completedTrials.Count - 1; idx >= 0; idx--) - { - var trial = completedTrials[idx]; - var optimizerAttrs = trial.SystemAttrs - .Where(kv => kv.Key.StartsWith(AttrKeyOptimizer, StringComparison.Ordinal)) - .ToDictionary(kv => kv.Key, kv => (string)kv.Value!); - if (optimizerAttrs.Count == 0) - continue; + var optimizerAttrs = holder.SystemAttrs + .Where(kv => kv.Key.StartsWith(AttrKeyOptimizer, StringComparison.Ordinal)) + .ToDictionary(kv => kv.Key, kv => (string)kv.Value!); + var restored = DeserializeOptimizer(ConcatOptimizerAttrs(optimizerAttrs)); + RestoreCount++; + _cachedOptimizer = restored; + _cachedHolderTrialId = holder.TrialId; + return restored; + } - string optimizerStr = ConcatOptimizerAttrs(optimizerAttrs); - return DeserializeOptimizer(optimizerStr); + /// <summary> + /// Brings <see cref="_history" /> up to date with the study, and forgets the optimizer cache when the history + /// started over (another study or storage, whose trial ids may repeat this one's). + /// </summary> + /// <param name="study">The study being sampled.</param> + /// <exception cref="NumSharp.KeyError">The study no longer exists in storage.</exception> + /// <remarks> + /// The read is <c>Study.GetTrialsForSampler(useCache: true)</c>: the zero-copy view on an in-memory storage, + /// otherwise the per-trial cached list Optuna's <c>_get_trials(deepcopy=False, use_cache=True)</c> reads, so a + /// database-backed storage makes no more round trips than before. + /// </remarks> + private void RefreshHistory(Study study) + { + _history.Refresh(study.GetTrialsForSampler(useCache: true), study.Storage, study.StudyId); + if (_history.WasReset) + { + _cachedOptimizer = null; + _cachedHolderTrialId = -1; } - return null; } /// <summary>Creates the initial optimizer in the transformed numerical box.</summary> @@ -467,7 +655,7 @@ private ICmaOptimizer InitOptimizer( { if (!expectedStates.Contains(t.State)) continue; if (!IsCompatibleSearchSpace(searchSpace, t.Distributions)) continue; - double[] x = trans.Transform(t.ParamsDict).ToArray<double>(); + double[] x = trans.Transform(t.Params).ToArray<double>(); sourceSolutions.Add((x, sign * t.Value!.Value)); } if (sourceSolutions.Count == 0) @@ -500,7 +688,7 @@ private ICmaOptimizer InitOptimizer( sigma: sigma0, bounds: boundsArr, nMaxResampling: 10 * nDim, - seed: (int)_cmaRng.Rng.randint(1, 2147483646), + seed: (int)NumPyDraws.RandInt(_cmaRng.Rng, 1, 2147483646), populationSize: _popsize, sigmaIsNumpyScalar: sigmaIsNumpy); } @@ -534,13 +722,13 @@ private ICmaOptimizer InitOptimizer( bounds: boundsArr, steps: steps, nMaxResampling: 10 * nDim, - seed: (int)_cmaRng.Rng.randint(1, 2147483646), + seed: (int)NumPyDraws.RandInt(_cmaRng.Rng, 1, 2147483646), populationSize: _popsize, cov: cov, sigmaIsNumpyScalar: sigmaIsNumpy); } - int seed = (int)_cmaRng.Rng.randint(1, 2147483646); + int seed = (int)NumPyDraws.RandInt(_cmaRng.Rng, 1, 2147483646); return new Cma( mean: mean, sigma: sigma0, @@ -577,8 +765,10 @@ private static bool IsCompatibleSearchSpace( if (_warnIndependentSampling) { - var completeTrials = GetTrials(study); - if (completeTrials.Count >= _nStartupTrials) + // Optuna's `len(self._get_trials(study)) >= self._n_startup_trials`, from the incremental history, so a + // categorical parameter sampled every trial no longer costs a full copy of the history each time. + RefreshHistory(study); + if (_history.CompletedCount >= _nStartupTrials) LogIndependentSampling(trial, paramName); } @@ -599,48 +789,33 @@ private void LogIndependentSampling(FrozenTrial trial, string paramName) "dynamic search space and `CategoricalDistribution` are not supported by `CmaEsSampler`")); } - /// <summary>Collects historical trials eligible for this sampler, applying its completed/pruned-trial policy.</summary> - /// <param name="study">Study supplying trial history, objective directions, and storage.</param> - /// <returns>Trial snapshots eligible for the sampler history.</returns> - private List<FrozenTrial> GetTrials(Study study) - { - var completeTrials = new List<FrozenTrial>(); - foreach (var t in study.GetTrialsInternal(deepcopy: false, states: null, useCache: true)) - { - if (t.State == TrialState.Complete) - { - completeTrials.Add(t); - } - else if (t.State == TrialState.Pruned - && t.IntermediateValues.Count > 0 - && _considerPrunedTrials) - { - // max(t.intermediate_values.items()) — the value at the largest step key. - long maxStep = t.IntermediateValues.Keys.Max(); - double value = t.IntermediateValues[maxStep]; - // We rewrite the value of the trial `t` for sampling, so we need a copy. - var copied = t.DeepCopy(); - copied.Value = value; - completeTrials.Add(copied); - } - } - return completeTrials; - } - - /// <summary>Selects trials belonging to one optimizer generation so adaptation uses a coherent population.</summary> - /// <param name="trials">Trial history available to the operation, in its existing order.</param> - /// <param name="generation">Zero-based generation whose individuals or optimizer state are requested.</param> - /// <returns>Trials from the requested optimizer generation.</returns> - private List<FrozenTrial> GetSolutionTrials(List<FrozenTrial> trials, int generation) + /// <summary> + /// The per-trial filter of Optuna's <c>_get_trials</c>: a COMPLETE trial as it is; with + /// <c>consider_pruned_trials</c>, a PRUNED trial that reported values, copied with its value rewritten to the + /// value at its largest step; anything else is ignored. + /// </summary> + /// <param name="t">A trial snapshot from the history.</param> + /// <returns>The snapshot the sampler treats as completed, or null when it ignores the trial.</returns> + /// <remarks> + /// <see cref="CmaTrialHistory" /> calls this once per trial when the trial is folded and keeps the result, so a + /// pruned trial's copy is made once per run rather than once per ask; a finished trial cannot change, so the copy + /// stays exact. + /// </remarks> + private FrozenTrial? AsSamplerTrial(FrozenTrial t) { - var result = new List<FrozenTrial>(); - foreach (var t in trials) + if (t.State == TrialState.Complete) + return t; + if (t.State == TrialState.Pruned && t.IntermediateValuesForRead.Count > 0 && _considerPrunedTrials) { - long g = t.SystemAttrs.TryGetValue(AttrKeyGeneration, out var v) ? Convert.ToInt64(v) : -1; - if (generation == g) - result.Add(t); + // max(t.intermediate_values.items()) — the value at the largest step key. + long maxStep = t.IntermediateValuesForRead.Keys.Max(); + double value = t.IntermediateValuesForRead[maxStep]; + // We rewrite the value of the trial `t` for sampling, so we need a copy. + var copied = t.DeepCopy(); + copied.Value = value; + return copied; } - return result; + return null; } /// <inheritdoc /> diff --git a/src/OptunaSharp.Core/Samplers/Differential/De.cs b/src/OptunaSharp.Core/Samplers/Differential/De.cs index b98a632..ec7b1a2 100644 --- a/src/OptunaSharp.Core/Samplers/Differential/De.cs +++ b/src/OptunaSharp.Core/Samplers/Differential/De.cs @@ -4,8 +4,10 @@ // Rainer Storn and Kenneth Price. "Differential Evolution — A Simple and Efficient Heuristic for // Global Optimization over Continuous Spaces." Journal of Global Optimization 11:341–359 (1997). // -// DE has no `cmaes`/Optuna/OptunaHub counterpart, so — like `LmCma` — this is a native, textbook-faithful -// implementation validated by convergence, with no upstream trajectory to bit-match. The RNG is +// DE has no `cmaes`/Optuna counterpart; OptunaHub's `samplers/differential_evolution` is another +// implementation this one does not follow (see `DifferentialEvolutionSampler`), so — like `LmCma` — this is +// a native, textbook-faithful implementation validated by convergence, with no upstream trajectory to +// bit-match. The RNG is // NumSharp's MT19937 `RandomState` (the project's "never System.Random" discipline). The optimizer // works in an arbitrary (unbounded) coordinate space: mutation/crossover never clamp, so a bounded // caller (both `DifferentialEvolutionSampler` and the JANUS `DePopulationHost`) clamps each candidate @@ -14,6 +16,7 @@ using System; using System.Collections.Generic; using NumSharp; +using OptunaSharp.Internal; namespace OptunaSharp.Samplers.Differential; @@ -179,7 +182,7 @@ internal double[] AskCandidate(int target) // Binomial crossover: inherit the mutant coordinate where U(0,1) < CR, else the target's; the // single j_rand coordinate is always taken from the mutant (guarantees a genuine offspring). - int jrand = (int)_rng.randint(0, _nDim); + int jrand = (int)NumPyDraws.RandInt(_rng, 0, _nDim); double[] cross = _rng.uniform(0.0, 1.0, new Shape(_nDim)).ToArray<double>(); double[] tgt = _pop[target]; var u = new double[_nDim]; @@ -248,7 +251,7 @@ private int SampleDistinct(HashSet<int> exclude) { while (true) { - int r = (int)_rng.randint(0, _popsize); + int r = (int)NumPyDraws.RandInt(_rng, 0, _popsize); if (exclude.Add(r)) return r; } } diff --git a/src/OptunaSharp.Core/Samplers/DifferentialEvolutionSampler.cs b/src/OptunaSharp.Core/Samplers/DifferentialEvolutionSampler.cs index 5ced00b..92d97cb 100644 --- a/src/OptunaSharp.Core/Samplers/DifferentialEvolutionSampler.cs +++ b/src/OptunaSharp.Core/Samplers/DifferentialEvolutionSampler.cs @@ -8,9 +8,12 @@ // protocol, following the `LmCmaSampler` idiom: the optimizer state is serialized into trial system // attrs (so a DE study resumes across process boundaries / distributed workers), each trial re-seeds // the optimizer and asks a single candidate, and every asked candidate is clamped to the transformed -// box (DE is unconstrained, so bounds are the sampler's concession). DE is NOT part of the Optuna -// ecosystem (no `cmaes` class, no Optuna sampler, no OptunaHub package), so — like `LmCmaSampler` — -// this is a native implementation validated by convergence, with no upstream trajectory to bit-match. +// box (DE is unconstrained, so bounds are the sampler's concession). Optuna itself has no DE sampler +// (and `cmaes` no DE class). OptunaHub has one (`samplers/differential_evolution`, `DESampler`, since +// 2024-12), but this port follows Storn & Price, not that package, so parameters, defaults and seeded +// trajectories differ (the map is in the class remarks; QA-70 of docs/qa/PARITY_QA_2026-11-10.md, where +// the owner chose on 2026-11-12 to keep this port). Like `LmCmaSampler` it is a native implementation +// validated by convergence, with no upstream trajectory to bit-match. using System; using System.Collections.Generic; @@ -48,6 +51,20 @@ namespace OptunaSharp.Samplers; /// /// <para>Categorical parameters and single-value distributions are handled by the independent sampler, /// as in <see cref="CmaEsSampler" />.</para> +/// +/// <para><b>Not OptunaHub's <c>DESampler</c>.</b> OptunaHub's <c>samplers/differential_evolution</c> is another +/// implementation of DE/rand/1/bin, which this class does not follow, so a study moved over from it gets other +/// defaults and other trials (registry pinned in <c>refs/optunahub-registry</c>):</para> +/// <list type="table"> +/// <listheader><term>OptunaHub <c>DESampler</c></term><description>This class</description></listheader> +/// <item><term><c>population_size="auto"</c>: <c>max(20, 10d)</c> below 5 dimensions, <c>max(30, 10d)</c> up to 30, +/// then <c>max(50, 5d)</c></term><description><c>popsize</c>: <c>max(8, 4 + ⌊3 ln d⌋)</c></description></item> +/// <item><term><c>F=0.8</c></term><description><c>f = 0.8</c></description></item> +/// <item><term><c>CR=0.7</c></term><description><c>cr = 0.9</c></description></item> +/// <item><term>DE/rand/1/bin only</term><description><c>strategy</c>: <c>"rand1bin"</c> (default) or <c>"best1bin"</c></description></item> +/// <item><term><c>search_space</c>, <c>debug</c>, <c>seed</c></term><description><c>seed</c>; the search space is +/// inferred; plus <c>nStartupTrials</c>, <c>independentSampler</c>, <c>warnIndependentSampling</c></description></item> +/// </list> /// </summary> /// <example> /// <code> @@ -87,6 +104,18 @@ public sealed class DifferentialEvolutionSampler : BaseSampler // sampler's monitor. private readonly HandedOutPoints _handedOut = new(); + /// <summary> + /// The last stored optimizer text this instance parsed, and the state parsed from it (plan 15): the text changes + /// once per generation, and every ask in between parsed the same JSON again. Guarded by the sampler's monitor, + /// like every hook; a per-worker instance has its own. + /// </summary> + /// <remarks> + /// Safe to share across asks because <see cref="De.FromState" /> never changes the state it reads: the + /// <see cref="De" /> constructor clones every population row and the values, and the rest are numbers. A parse + /// that throws stores nothing, so the next ask parses (and throws) again, as before. + /// </remarks> + private (string Text, DeState State)? _parsedState; + /// <param name="nStartupTrials">Minimum independent trials before DE begins; DE always waits for at /// least <c>populationSize</c> completed trials to seed the initial population, whichever is larger.</param> /// <param name="independentSampler">Sampler for parameters outside the relative search space (default <see cref="RandomSampler" />).</param> @@ -205,7 +234,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S var solutions = new List<(double[] X, double Value)>(optimizer.PopulationSize); foreach (var t in solutionTrials.Take(optimizer.PopulationSize)) { - double[] x = trans.Transform(t.ParamsDict).ToArray<double>(); + double[] x = trans.Transform(t.Params).ToArray<double>(); double y = study.Direction == StudyDirection.Minimize ? t.Value!.Value : -t.Value!.Value; solutions.Add((x, y)); } @@ -233,7 +262,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S } // Each trial reseeds so its single ask is reproducible and differs from its siblings' asks. - int seed = (int)_deRng.Rng.randint(1, 65536) + trial.Number; + int seed = (int)NumPyDraws.RandInt(_deRng.Rng, 1, 65536) + trial.Number; optimizer.ReseedRng(seed); double[] deParams = optimizer.AskCandidate(target); @@ -287,7 +316,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S { if (t.Value is null) continue; double[] x; - try { x = trans.Transform(t.ParamsDict).ToArray<double>(); } + try { x = trans.Transform(t.Params).ToArray<double>(); } catch (Exception) { continue; } if (x.Length != nDim) continue; pop.Add(x); @@ -343,25 +372,36 @@ private static string SerializeOptimizer(De optimizer) /// <summary>Decodes a persisted optimizer tag and reconstructs its matching state type.</summary> /// <param name="optimizerStr">Tagged serialized optimizer state, after any chunk reassembly.</param> - /// <returns>The optimizer reconstructed from the tagged state.</returns> + /// <returns>A new optimizer reconstructed from the tagged state; the caller may change it freely.</returns> /// <exception cref="System.NotSupportedException">The serialized optimizer tag is unknown.</exception> /// <exception cref="System.Text.Json.JsonException">The persisted optimizer payload is not valid JSON for its state type, or is the literal null.</exception> /// <exception cref="System.ArgumentException">The decoded state contains invalid optimizer constructor settings.</exception> /// <exception cref="System.ArgumentOutOfRangeException">The stored text has no <c><tag>\n</c> line.</exception> - private static De DeserializeOptimizer(string optimizerStr) + /// <remarks>Parses the JSON only when the text differs from the last one parsed (<see cref="_parsedState" />); a new optimizer is built from the state every time.</remarks> + private De DeserializeOptimizer(string optimizerStr) { + // The same stored text as the last parse: the same state, without parsing the JSON again (see _parsedState). + // The whole text, tag included, is the key, so a hit has passed the tag check before. + if (_parsedState is { } parsed && string.Equals(parsed.Text, optimizerStr, StringComparison.Ordinal)) + return De.FromState(parsed.State); + int nl = optimizerStr.IndexOf('\n'); string tag = optimizerStr[..nl]; string json = optimizerStr[(nl + 1)..]; if (tag != "de") throw new NotSupportedException($"Unknown optimizer state tag '{tag}'."); - return De.FromState(OptimizerStateJson.Deserialize<DeState>(json)); + DeState state = OptimizerStateJson.Deserialize<DeState>(json); + _parsedState = (optimizerStr, state); + return De.FromState(state); } /// <summary>Finds the newest stored optimizer snapshot in completed trial history.</summary> /// <param name="completedTrials">Completed trial snapshots used as historical observations.</param> /// <returns>The newest available optimizer, or null when no stored snapshot exists.</returns> - private static De? RestoreOptimizer(List<FrozenTrial> completedTrials) + /// <exception cref="System.NotSupportedException">The newest stored snapshot carries an unknown optimizer tag.</exception> + /// <exception cref="System.Text.Json.JsonException">The newest stored snapshot's payload is not valid JSON for the state type.</exception> + /// <exception cref="System.ArgumentException">The decoded state contains invalid optimizer constructor settings.</exception> + private De? RestoreOptimizer(List<FrozenTrial> completedTrials) { for (int idx = completedTrials.Count - 1; idx >= 0; idx--) { @@ -412,8 +452,10 @@ private void LogIndependentSampling(FrozenTrial trial, string paramName) /// <returns>Trial snapshots eligible for the sampler history.</returns> private List<FrozenTrial> GetTrials(Study study) { - var completeTrials = new List<FrozenTrial>(); - foreach (var t in study.GetTrialsInternal(deepcopy: false, states: null, useCache: true)) + List<FrozenTrial> all = study.GetTrialsInternal(deepcopy: false, states: null, useCache: true); + // Sized for the whole history (plan 15): nearly every trial is complete, so the list never regrows on an ask. + var completeTrials = new List<FrozenTrial>(all.Count); + foreach (var t in all) if (t.State == TrialState.Complete) completeTrials.Add(t); return completeTrials; diff --git a/src/OptunaSharp.Core/Samplers/EvolutionStrategy/EsSampling.cs b/src/OptunaSharp.Core/Samplers/EvolutionStrategy/EsSampling.cs index e9747b0..842e7fd 100644 --- a/src/OptunaSharp.Core/Samplers/EvolutionStrategy/EsSampling.cs +++ b/src/OptunaSharp.Core/Samplers/EvolutionStrategy/EsSampling.cs @@ -9,6 +9,7 @@ // optimizers agree bit-for-bit and stay byte-reproducible against a numpy `RandomState` reference. using NumSharp; +using OptunaSharp.Internal; namespace OptunaSharp.Samplers.EvolutionStrategy; @@ -56,7 +57,7 @@ internal static double[][] StandardNormalMatrix(NumPyRandom rng, int rows, int c { // One flat draw preserves numpy's C-order fill (verified byte-identical to np.random.randn); the // reshape below is a pure view split, so element order is untouched. - double[] flat = rng.randn(rows * cols).ToArray<double>(); + double[] flat = NumPyDraws.Randn(rng, rows * cols); var matrix = new double[rows][]; for (int i = 0; i < rows; i++) { diff --git a/src/OptunaSharp.Core/Samplers/EvolutionStrategy/EvolutionStrategySampler.cs b/src/OptunaSharp.Core/Samplers/EvolutionStrategy/EvolutionStrategySampler.cs index 27d0670..0908c9d 100644 --- a/src/OptunaSharp.Core/Samplers/EvolutionStrategy/EvolutionStrategySampler.cs +++ b/src/OptunaSharp.Core/Samplers/EvolutionStrategy/EvolutionStrategySampler.cs @@ -138,7 +138,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S } var optimizer = RestoreOptimizer(completedTrials) - ?? CreateOptimizer(boxCenter, nDim, (uint)(int)_esRng.Rng.randint(1, 2147483646)); + ?? CreateOptimizer(boxCenter, nDim, (uint)(int)NumPyDraws.RandInt(_esRng.Rng, 1, 2147483646)); if (optimizer.Dim != nDim) { @@ -162,7 +162,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S var solutions = new List<(double[] X, double Value)>(optimizer.PopulationSize); foreach (var t in solutionTrials.Take(optimizer.PopulationSize)) { - double[] x = trans.Transform(t.ParamsDict).ToArray<double>(); + double[] x = trans.Transform(t.Params).ToArray<double>(); double y = study.Direction == StudyDirection.Minimize ? t.Value!.Value : -t.Value!.Value; solutions.Add((x, y)); } @@ -198,8 +198,18 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S return trans.Untransform(nd); } - private string AttrKeyGeneration => AttrPrefix + "generation"; - private string AttrKeyOptimizer => AttrPrefix + "optimizer"; + // Built once per sampler (plan 15): GetSolutionTrials and CountRunningMembers read the generation key for every + // trial of the history on every ask, and concatenating it there allocated a new string per trial per scan, most of + // the sampler's per-trial allocation. AttrPrefix is a constant per sampler type, so the cached keys are the strings + // the concatenation produced; a race between two first readers only builds an equal string twice. + private string? _attrKeyGeneration; + private string? _attrKeyOptimizer; + + /// <summary>The system-attribute key that stamps a trial with the generation it was asked in.</summary> + private string AttrKeyGeneration => _attrKeyGeneration ??= AttrPrefix + "generation"; + + /// <summary>The system-attribute key prefix of the serialized optimizer state's chunks.</summary> + private string AttrKeyOptimizer => _attrKeyOptimizer ??= AttrPrefix + "optimizer"; /// <summary>Reassembles serialized optimizer chunks in numeric chunk order.</summary> /// <param name="optimizerAttrs">Stored serialized optimizer chunks keyed by chunk identifier.</param> @@ -278,8 +288,10 @@ private void LogIndependentSampling(FrozenTrial trial, string paramName) /// <returns>Completed trial snapshots.</returns> private static List<FrozenTrial> GetTrials(Study study) { - var completeTrials = new List<FrozenTrial>(); - foreach (var t in study.GetTrialsInternal(deepcopy: false, states: null, useCache: true)) + List<FrozenTrial> all = study.GetTrialsInternal(deepcopy: false, states: null, useCache: true); + // Sized for the whole history (plan 15): nearly every trial is complete, so the list never regrows on an ask. + var completeTrials = new List<FrozenTrial>(all.Count); + foreach (var t in all) if (t.State == TrialState.Complete) completeTrials.Add(t); return completeTrials; diff --git a/src/OptunaSharp.Core/Samplers/GPSampler.cs b/src/OptunaSharp.Core/Samplers/GPSampler.cs index 68b4aa4..ce92313 100644 --- a/src/OptunaSharp.Core/Samplers/GPSampler.cs +++ b/src/OptunaSharp.Core/Samplers/GPSampler.cs @@ -187,7 +187,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S { var internalSearchSpace = new GpSearchSpace(searchSpace); var completedParams = completedTrials - .Select(t => (IReadOnlyDictionary<string, object?>)t.ParamsDict) + .Select(t => t.Params) .ToList(); double[,] normalizedParams = internalSearchSpace.GetNormalizedParams(completedParams); @@ -239,7 +239,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S double threshold = ColumnMax(standardizedScoreVals, 0); if (hasRunning) { - int qmcSeed = (int)_rng.Rng.randint(0, MaxQmcSeedValue); + int qmcSeed = (int)NumPyDraws.RandInt(_rng.Rng, 0, MaxQmcSeedValue); acqf = new QLogEI( gprsList[0], internalSearchSpace, threshold, _nQmcSamplesQei, qmcSeed, normalizedParamsOfRunningTrials!); @@ -250,7 +250,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S } else { - int qmcSeed = (int)_rng.Rng.randint(0, MaxQmcSeedValue); + int qmcSeed = (int)NumPyDraws.RandInt(_rng.Rng, 0, MaxQmcSeedValue); if (hasRunning) acqf = new QLogEHVI( gprsList.ToArray(), internalSearchSpace, standardizedScoreVals, _nQmcSamplesEhvi, @@ -277,7 +277,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S double bestFeasibleY = yWithNegInf[iOpt]; if (hasRunning) { - int qmcSeed = (int)_rng.Rng.randint(0, MaxQmcSeedValue); + int qmcSeed = (int)NumPyDraws.RandInt(_rng.Rng, 0, MaxQmcSeedValue); acqf = new QLogCEI( gprsList[0], internalSearchSpace, bestFeasibleY, _nQmcSamplesQei, qmcSeed, constrGprList, constrThresholdList, normalizedParamsOfRunningTrials!); @@ -299,7 +299,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S // Optuna 5.0.0 (#6804): with running trials the MO-constrained case is the q-batch // qLogCEHVI (fantasy-conditioned); without them it stays the sequential LogCEHVI. Both // branches draw exactly one QMC seed, so the sampler's RNG stream is unchanged. - int qmcSeed = (int)_rng.Rng.randint(0, MaxQmcSeedValue); + int qmcSeed = (int)NumPyDraws.RandInt(_rng.Rng, 0, MaxQmcSeedValue); double[,]? yFeasible = isAllInfeasible ? null : FilterRows(standardizedScoreVals, isFeasible); acqf = hasRunning ? new QLogCEHVI( @@ -404,39 +404,63 @@ private static (double[,] ConstraintVals, bool[] IsFeasible) GetConstraintValsAn return (gprs, thresholds); } - /// <summary>NumPy <c>np.argmax</c>: the first index of the maximum (−inf-safe for all-infeasible masks).</summary> - /// <param name="values">Scores compared to choose the first maximum.</param> - /// <returns>The first maximum index.</returns> + /// <summary> + /// NumPy <c>np.argmax</c> through NumSharp — the constrained branch's <c>np.argmax(y_with_neginf)</c>: the first + /// index of the maximum, or of the first NaN when there is one (a NaN is maximal in NumPy's argmax). + /// </summary> + /// <param name="values">Scores compared to choose the first maximum; infeasible trials hold <c>-inf</c>.</param> + /// <returns>The first maximum index, the first NaN's index when any value is NaN, or 0 when every value is <c>-inf</c>.</returns> + /// <remarks> + /// A standardized value is NaN when the objective values overflow <c>_standardize_values</c> (values near the + /// float maximum). The former strict <c>></c> loop skipped such a NaN and returned the best finite trial + /// (QA-53's class); NumSharp's argmax keeps NumPy's rule. One call per trial, next to a GP fit, so the NumSharp + /// call's microseconds do not count. + /// </remarks> + /// <exception cref="NumSharp.ValueError"><paramref name="values" /> is empty (NumPy's <c>attempt to get argmax of an empty sequence</c>).</exception> private static int ArgMax(double[] values) { - int best = 0; - for (int i = 1; i < values.Length; i++) - if (values[i] > values[best]) best = i; - return best; + using NDArray array = np.array(values, copy: false); + using NDArray index = np.argmax(array); + return (int)(long)index; } - /// <summary>First argmax of column <paramref name="col" /> — <c>np.argmax(standardized_score_vals)</c> for a single objective.</summary> - /// <param name="mat">Matrix whose specified row participates in the operation.</param> - /// <param name="col">Zero-based column index or column-shaped matrix.</param> - /// <returns>The first row attaining the largest value in the selected column.</returns> + /// <summary> + /// First argmax of column <paramref name="col" /> through NumSharp — <c>np.argmax(standardized_score_vals)</c> + /// for a single objective, whose (n, 1) array flattens to that column. A NaN wins, as in NumPy. + /// </summary> + /// <param name="mat">The standardized score matrix, one row per completed trial.</param> + /// <param name="col">The zero-based column (objective) to search.</param> + /// <returns>The first row attaining the column's maximum, or holding its first NaN.</returns> + /// <remarks>The column is a strided NumSharp view of the copied matrix, reduced as NumPy reduces it.</remarks> + /// <exception cref="NumSharp.ValueError">The matrix has no rows (NumPy's <c>attempt to get argmax of an empty sequence</c>).</exception> private static int ArgMaxColumn(double[,] mat, int col) { - int best = 0; - for (int i = 1; i < mat.GetLength(0); i++) - if (mat[i, col] > mat[best, col]) best = i; - return best; + using NDArray matrix = np.array(mat); + using NDArray column = matrix[":", col]; + using NDArray index = np.argmax(column); + return (int)(long)index; } - /// <summary>Max of column <paramref name="col" /> — <c>standardized_score_vals[:, col].max()</c>.</summary> - /// <param name="mat">Matrix whose specified row participates in the operation.</param> - /// <param name="col">Zero-based column index or column-shaped matrix.</param> - /// <returns>The maximum selected-column value, or negative infinity for an empty column.</returns> + /// <summary> + /// Max of column <paramref name="col" /> through NumSharp — <c>standardized_score_vals[:, col].max()</c>, the + /// LogEI / qLogEI threshold. A NaN anywhere in the column makes it NaN, as in NumPy. + /// </summary> + /// <param name="mat">The standardized score matrix, one row per completed trial.</param> + /// <param name="col">The zero-based column (objective) to reduce.</param> + /// <returns>The column's maximum, NaN when the column holds a NaN.</returns> + /// <remarks> + /// QA-53: values near the float maximum overflow the standardization and leave NaNs in the column. NumPy's + /// threshold is then NaN, every acquisition value is NaN, and an integer parameter's discrete line search fails + /// in Brent's bracket check, as in Optuna; the former loop (<c>if (v > max)</c> from <c>-inf</c>) skipped the + /// NaNs and kept the acquisition finite, so the port suggested a value where Optuna raises. + /// </remarks> + /// <exception cref="NumSharp.ValueError">The matrix has no rows (NumPy's <c>zero-size array to reduction operation maximum which has no identity</c>).</exception> private static double ColumnMax(double[,] mat, int col) { - double max = double.NegativeInfinity; - for (int i = 0; i < mat.GetLength(0); i++) - if (mat[i, col] > max) max = mat[i, col]; - return max; + using NDArray matrix = np.array(mat); + using NDArray column = matrix[":", col]; + using NDArray max = np.amax(column); + return (double)max; } /// <summary><c>normalized_params[idx, np.newaxis]</c> — the single best point as a <c>(1, dim)</c> warmstart.</summary> @@ -521,32 +545,45 @@ private static double ColumnMax(double[,] mat, int col) /// <summary> /// <c>_standardize_values</c> — clip non-finite values (<c>warn_and_convert_inf</c>) then - /// per-objective standardize <c>(v − mean) / max(EPS, std)</c> (population std, matching - /// <c>np.std</c>). Returns the standardized matrix plus the per-column means/stds (the - /// constraint path needs the means/stds for its thresholds). + /// per-objective standardize <c>(v − mean) / max(EPS, std)</c>, with the column means and population stds taken + /// by NumSharp's <c>np.mean(values, axis=0)</c> / <c>np.std(values, axis=0)</c> over the whole + /// <c>(n_trials, n_objectives)</c> matrix, NumPy's reduction schedule included. Returns the standardized matrix plus + /// the per-column means/stds (the constraint path needs them for its thresholds). /// </summary> /// <param name="values">Objective observations with one trial per row and one objective per column.</param> /// <returns>Standardized objective columns, their original means, and standard deviations.</returns> + /// <remarks> + /// <para> + /// NumPy reduces axis 0 of a C-contiguous matrix by adding whole rows in order, a sequential sum per column; + /// a single column, shape <c>(n, 1)</c>, collapses to one contiguous run and is summed pairwise instead. The + /// former per-column <see cref="MathUtil.Mean" />/<see cref="MathUtil.Std" /> summed every column pairwise, so + /// a multi-objective study with eight or more trials standardized differently from Optuna in the last bits + /// (measured against NumPy 2.4.2: 17 of 45 two- and three-objective column statistics equal, all 9 + /// single-objective ones equal); NumSharp follows NumPy's schedule in both cases (54 of 54). + /// </para> + /// <para>The matrix is viewed zero-copy and every transient array is disposed before returning.</para> + /// </remarks> private static (double[,] Standardized, double[] Means, double[] Stds) StandardizeValues(double[,] values) { double[,] clipped = WarnAndConvertInf(values); int n = clipped.GetLength(0); int m = clipped.GetLength(1); + double[] means, stds; + using (NDArray view = np.array(clipped, copy: false)) + using (NDArray meanArray = np.mean(view, axis: 0)) + using (NDArray stdArray = np.std(view, axis: 0)) + { + means = meanArray.ToArray<double>(); + stds = stdArray.ToArray<double>(); + } + // (clipped_values - means) / np.maximum(EPS, stds): one subtraction and one division per element, as NumPy's + // broadcast ufuncs compute them. var result = new double[n, m]; - var means = new double[m]; - var stds = new double[m]; for (int j = 0; j < m; j++) { - var col = new double[n]; - for (int t = 0; t < n; t++) - col[t] = clipped[t, j]; - double mean = MathUtil.Mean(col); - double std = MathUtil.Std(col); - means[j] = mean; - stds[j] = std; - double denom = Math.Max(Eps, std); + double denom = Math.Max(Eps, stds[j]); for (int t = 0; t < n; t++) - result[t, j] = (col[t] - mean) / denom; + result[t, j] = (clipped[t, j] - means[j]) / denom; } return (result, means, stds); } @@ -641,8 +678,10 @@ public override void AfterTrial(Study study, FrozenTrial trial, TrialState state /// <returns>The adaptation coefficients for the current covariance rank.</returns> private static IReadOnlyDictionary<string, object?> GetParams(FrozenTrial trial) { + // Read-only throughout: a finished record may be compact (plan 13, item S12), and the mutable accessor would + // give it its dictionary back on every ask. if (trial.State.IsFinished()) - return trial.ParamsDict; + return trial.Params; var parts = new List<string>(); int i = 0; @@ -653,10 +692,10 @@ public override void AfterTrial(Study study, FrozenTrial trial, TrialState state i++; } if (parts.Count == 0) - return trial.ParamsDict; + return trial.Params; var merged = ParseJsonObject(string.Concat(parts)); - foreach (var kv in trial.ParamsDict) + foreach (var kv in trial.Params) merged[kv.Key] = kv.Value; return merged; } diff --git a/src/OptunaSharp.Core/Samplers/GridSampler.cs b/src/OptunaSharp.Core/Samplers/GridSampler.cs index 27b32af..879888e 100644 --- a/src/OptunaSharp.Core/Samplers/GridSampler.cs +++ b/src/OptunaSharp.Core/Samplers/GridSampler.cs @@ -136,6 +136,10 @@ private GridSampler(GridSampler prototype) => GetType() == typeof(GridSampler) ? new GridSampler(this) : null; /// <inheritdoc /> + /// <exception cref="NumSharp.ValueError"> + /// The grid is empty (a parameter's value list is empty) and the trial needs a grid point: NumPy's + /// <c>choice</c> error, <c>'a' cannot be empty unless no samples are taken</c>, as in Optuna. + /// </exception> public override void BeforeTrial(Study study, FrozenTrial trial) { // Instead of returning param values, GridSampler puts the target grid id as a system @@ -172,9 +176,16 @@ public override void BeforeTrial(Study study, FrozenTrial trial) } // In distributed optimization, multiple workers may simultaneously pick up the same grid. - // To make the conflict less frequent, the grid is chosen randomly. numpy's - // choice(target_grids) with no size/replace/p reduces to target_grids[randint(0, len)]. - int gridId = targetGrids[(int)_rng.Rng.randint(0, targetGrids.Count)]; + // To make the conflict less frequent, the grid is chosen randomly: + // grid_id = int(self._rng.rng.choice(target_grids)), through NumSharp's port of the legacy RandomState.choice. + // Without size, replace=False or p it draws target_grids[randint(0, len)], the stream the former shortcut used, + // and an empty list (a search space with an empty value list, whose grid is empty) raises NumPy's own + // ValueError, "'a' cannot be empty unless no samples are taken" (QA-55), where the shortcut's randint(0, 0) + // raised "low >= high". One call per trial past the grid's first pass. + int gridId; + using (NDArray candidates = np.array(targetGrids.Select(g => (long)g).ToArray())) + using (NDArray picked = _rng.Rng.choice(candidates)) + gridId = (int)(long)picked; study.Storage.SetTrialSystemAttr(trial.TrialId, "search_space", _searchSpaceAttr); study.Storage.SetTrialSystemAttr(trial.TrialId, "grid_id", gridId); @@ -215,6 +226,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S /// <inheritdoc /> /// <exception cref="NumSharp.RuntimeError">The grid is exhausted and Study.Stop is invoked outside Study.Optimize, as in manual ask-and-tell usage.</exception> + /// <exception cref="NumSharp.KeyError">One unvisited grid is left and the finished trial carries no <c>grid_id</c> (an enqueued trial), as in Optuna.</exception> public override void AfterTrial(Study study, FrozenTrial trial, TrialState state, IReadOnlyList<double>? values) { var targetGrids = GetUnvisitedGridIds(study); @@ -225,8 +237,11 @@ public override void AfterTrial(Study study, FrozenTrial trial, TrialState state } else if (targetGrids.Count == 1) { - int gridId = Convert.ToInt32( - study.Storage.GetTrialSystemAttrs(trial.TrialId)["grid_id"], CultureInfo.InvariantCulture); + // Python's `get_trial_system_attrs(...)["grid_id"]`: an enqueued trial carries no grid id, and Optuna raises + // KeyError('grid_id') here, not .NET's KeyNotFoundException (QA-66, found by the batched fuzz E61). + if (!study.Storage.GetTrialSystemAttrs(trial.TrialId).TryGetValue("grid_id", out object? stamped)) + throw new KeyError("grid_id"); + int gridId = Convert.ToInt32(stamped, CultureInfo.InvariantCulture); if (gridId == targetGrids[0]) study.Stop(); } @@ -234,7 +249,10 @@ public override void AfterTrial(Study study, FrozenTrial trial, TrialState state /// <summary>Finds unfinished grids, preferring those not currently assigned to running trials.</summary> /// <param name="study">Study supplying trial history, objective directions, and storage.</param> - /// <returns>Grid indices still requiring completion, preferring grids without running evaluations.</returns> + /// <returns> + /// Grid indices still requiring completion, preferring grids without running evaluations, in CPython's + /// set-iteration order (the order <c>rng.choice</c> indexes). + /// </returns> private List<int> GetUnvisitedGridIds(Study study) { // List up unvisited grids based on already finished ones. @@ -259,20 +277,17 @@ private List<int> GetUnvisitedGridIds(Study study) } } - // [Misaligned] Python builds `list(set(range(n)) - visited - running)`, whose order is - // CPython's set-iteration order; we return ascending order instead. This is observable - // ONLY through the concurrency `choice(target_grids)` branch of before_trial (≥2 unvisited - // grids while trial.number >= n_min_trials), which single-threaded optimize never reaches - // — each trial finishes before the next, so the grid is exhausted (and the study stopped) - // by the fast path. Under real concurrency the chosen grid is timing-dependent in Optuna - // too, so bit-exact reproduction there is not a meaningful parity target. - var unvisitedGrids = Enumerable.Range(0, _nMinTrials) - .Where(g => !visitedGrids.Contains(g) && !runningGrids.Contains(g)).ToList(); + // `list(set(range(n)) - set(visited_grids) - set(running_grids))`, in CPython's set-iteration order: before_trial + // indexes this list with `rng.choice`, so ascending order picked another grid for the same draw. That branch is + // not only concurrency's: a single-threaded optimize reaches it whenever the study's numbering is shifted + // (trials from add_trial / enqueue_trial, another sampler, a resumed study) and >= 2 grids remain, e.g. 12 added + // trials then a 16-point grid, where Optuna's 13th grid trial is x=11 and ascending order gave x=4 (QA-68). + var unvisitedGrids = PyIntSet.Range(_nMinTrials).Difference(visitedGrids).Difference(runningGrids).ToList(); // If evaluations for all grids have been started, return grids that have not yet finished // because all grids should be evaluated before stopping the optimization. if (unvisitedGrids.Count == 0) - unvisitedGrids = Enumerable.Range(0, _nMinTrials).Where(g => !visitedGrids.Contains(g)).ToList(); + unvisitedGrids = PyIntSet.Range(_nMinTrials).Difference(visitedGrids).ToList(); return unvisitedGrids; } diff --git a/src/OptunaSharp.Core/Samplers/Janus/JanusMooCmix.cs b/src/OptunaSharp.Core/Samplers/Janus/JanusMooCmix.cs index 10b43d3..200c8bc 100644 --- a/src/OptunaSharp.Core/Samplers/Janus/JanusMooCmix.cs +++ b/src/OptunaSharp.Core/Samplers/Janus/JanusMooCmix.cs @@ -157,9 +157,9 @@ internal JanusMooCmix( for (int ti = start; ti < completed.Count; ti++) { var t = completed[ti]; - if (!paramNames.All(n => t.ParamsDict.ContainsKey(n))) continue; + if (!paramNames.All(n => t.Params.ContainsKey(n))) continue; double[] row; - try { row = paramNames.Select(n => ToNorm(t.ParamsDict[n], transforms[n])).ToArray(); } + try { row = paramNames.Select(n => ToNorm(t.Params[n], transforms[n])).ToArray(); } catch (Exception) { continue; } rows.Add(row); usedTrials.Add(t); @@ -310,7 +310,7 @@ private double ScalarValue(FrozenTrial trial) /// <returns>The selected normalized center, or null when no compatible trial exists.</returns> private double[]? ChooseCenter(List<FrozenTrial> trials, List<string> paramNames, Dictionary<string, Transform> transforms) { - var complete = trials.Where(t => paramNames.All(n => t.ParamsDict.ContainsKey(n))).ToList(); + var complete = trials.Where(t => paramNames.All(n => t.Params.ContainsKey(n))).ToList(); if (complete.Count == 0) return null; var valueRows = complete.Where(t => t.Values is not null).Select(t => t.Values!.ToArray()).ToList(); @@ -348,7 +348,7 @@ private double ScalarValue(FrozenTrial trial) int d = paramNames.Count; var center = new double[d]; foreach (var t in top) - for (int j = 0; j < d; j++) center[j] += ToNorm(t.ParamsDict[paramNames[j]], transforms[paramNames[j]]); + for (int j = 0; j < d; j++) center[j] += ToNorm(t.Params[paramNames[j]], transforms[paramNames[j]]); for (int j = 0; j < d; j++) center[j] /= top.Count; return center; } diff --git a/src/OptunaSharp.Core/Samplers/Janus/JanusOptimizer.cs b/src/OptunaSharp.Core/Samplers/Janus/JanusOptimizer.cs index 1363504..01bec9c 100644 --- a/src/OptunaSharp.Core/Samplers/Janus/JanusOptimizer.cs +++ b/src/OptunaSharp.Core/Samplers/Janus/JanusOptimizer.cs @@ -196,7 +196,7 @@ private void Harvest() double[] x; try { - x = _trans.Transform(t.ParamsDict).ToArray<double>(); + x = _trans.Transform(t.Params).ToArray<double>(); } catch (Exception) { @@ -206,7 +206,7 @@ private void Harvest() if (t.Value is not null) fval = _direction == StudyDirection.Maximize ? -t.Value.Value : t.Value.Value; else if (rae is not null) - fval = rae.Average(); + fval = ComponentMean(rae); else continue; _winX.Add(x); @@ -219,6 +219,29 @@ private void Harvest() TrimWindow(window); } + /// <summary> + /// The reference's <c>float(np.mean(rae))</c>: the objective value a valueless trial gets from its component + /// losses, computed by NumSharp's <c>np.mean</c> (NumPy's pairwise sum, then one division) so it is the reference + /// implementation's to the last bit for any number of components. + /// </summary> + /// <param name="rae">The trial's component losses, in their reported order.</param> + /// <returns>Their arithmetic mean; NaN for no components (NumPy's, without its RuntimeWarning).</returns> + /// <remarks> + /// A LINQ <c>Average()</c> sums left to right, which rounds differently from NumPy's pairwise sum from eight + /// components on. The branch is reached only by a harvested trial without a value, which the single-objective + /// sampler's COMPLETE-only history does not produce today, so no current study changes; it keeps the port + /// faithful should that history ever widen. + /// </remarks> + private static double ComponentMean(double[] rae) + { + // NumPy's mean of nothing is NaN (with a warning); answer it here rather than depend on the empty route. + if (rae.Length == 0) + return double.NaN; + using NDArray view = np.array(rae, copy: false); + using NDArray mean = np.mean(view); + return (double)mean; + } + /// <summary>Discards oldest trace observations beyond the requested fitting window.</summary> /// <param name="window">Maximum number of recent observations retained for fitting.</param> private void TrimWindow(int window) @@ -590,7 +613,7 @@ private void CmixShapeC() var archived = new double[centers.Count][]; for (int k = 0; k < centers.Count; k++) { - double[] zk = _rng.randn(_d).ToArray<double>(); + double[] zk = NumPyDraws.Randn(_rng, _d); var nk = new double[_d]; for (int i = 0; i < _d; i++) nk[i] = zk[i] * sqrtEig[i] * sig; // normal · √eig · σ double[] y = MatVec(eigvecs, nk); // eigvecs @ noise @@ -615,7 +638,7 @@ private void CmixShapeC() var samples = new double[count][]; for (int k = 0; k < count; k++) { - double[] zk = _rng.randn(_d).ToArray<double>(); + double[] zk = NumPyDraws.Randn(_rng, _d); var nk = new double[_d]; for (int i = 0; i < _d; i++) nk[i] = zk[i] * sqrtEig[i]; double[] y = MatVec(eigvecs, nk); // eigvecs @ (√eigvals ⊙ z) @@ -943,7 +966,7 @@ internal void UpdateEs() for (int k = 0; k < _popsize; k++) { var t = ready[b * _popsize + k]; - double[] x = _trans.Transform(t.ParamsDict).ToArray<double>(); + double[] x = _trans.Transform(t.Params).ToArray<double>(); double y = _direction == StudyDirection.Maximize ? -t.Value!.Value : t.Value!.Value; solutions.Add((x, y)); _trialsUsed.Add(t.Number); diff --git a/src/OptunaSharp.Core/Samplers/JanusDeSampler.cs b/src/OptunaSharp.Core/Samplers/JanusDeSampler.cs index 8168b7b..af39bf5 100644 --- a/src/OptunaSharp.Core/Samplers/JanusDeSampler.cs +++ b/src/OptunaSharp.Core/Samplers/JanusDeSampler.cs @@ -288,8 +288,10 @@ public override void AfterTrial(Study study, FrozenTrial trial, TrialState state /// <returns>Trial snapshots eligible for the sampler history.</returns> private List<FrozenTrial> GetTrials(Study study) { - var result = new List<FrozenTrial>(); - foreach (var t in study.GetTrialsInternal(deepcopy: false, states: null, useCache: true)) + List<FrozenTrial> all = study.GetTrialsInternal(deepcopy: false, states: null, useCache: true); + // Sized for the whole history (plan 15): nearly every trial is complete, so the list never regrows on an ask. + var result = new List<FrozenTrial>(all.Count); + foreach (var t in all) if (t.State == TrialState.Complete) result.Add(t); return result; diff --git a/src/OptunaSharp.Core/Samplers/JanusSampler.cs b/src/OptunaSharp.Core/Samplers/JanusSampler.cs index b0a2e19..fcef8d0 100644 --- a/src/OptunaSharp.Core/Samplers/JanusSampler.cs +++ b/src/OptunaSharp.Core/Samplers/JanusSampler.cs @@ -312,8 +312,10 @@ public override void AfterTrial(Study study, FrozenTrial trial, TrialState state /// <returns>Trial snapshots eligible for the sampler history.</returns> private List<FrozenTrial> GetTrials(Study study) { - var result = new List<FrozenTrial>(); - foreach (var t in study.GetTrialsInternal(deepcopy: false, states: null, useCache: true)) + List<FrozenTrial> all = study.GetTrialsInternal(deepcopy: false, states: null, useCache: true); + // Sized for the whole history (plan 15): nearly every trial is complete, so the list never regrows on an ask. + var result = new List<FrozenTrial>(all.Count); + foreach (var t in all) if (t.State == TrialState.Complete) result.Add(t); return result; diff --git a/src/OptunaSharp.Core/Samplers/LmCmaSampler.cs b/src/OptunaSharp.Core/Samplers/LmCmaSampler.cs index b9212c0..3943d92 100644 --- a/src/OptunaSharp.Core/Samplers/LmCmaSampler.cs +++ b/src/OptunaSharp.Core/Samplers/LmCmaSampler.cs @@ -194,7 +194,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S { // Re-derive x in optimizer space from the stored (clamped) params, so the optimizer learns // from the actually-evaluated points. Flip sign for maximization. - double[] x = trans.Transform(t.ParamsDict).ToArray<double>(); + double[] x = trans.Transform(t.Params).ToArray<double>(); double y = study.Direction == StudyDirection.Minimize ? t.Value!.Value : -t.Value!.Value; solutions.Add((x, y)); } @@ -207,7 +207,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S } // Each trial reseeds so its single ask is reproducible and differs from its siblings' asks. - int seed = (int)_cmaRng.Rng.randint(1, 65536) + trial.Number; + int seed = (int)NumPyDraws.RandInt(_cmaRng.Rng, 1, 65536) + trial.Number; optimizer.ReseedRng(seed); // Non-mirrored generation: k is this candidate's 1-based position within the current generation. @@ -282,27 +282,50 @@ private static Dictionary<string, string> SplitOptimizerStr(string optimizerStr) private static string SerializeOptimizer(LmCma optimizer) => "lmcma\n" + OptimizerStateJson.Serialize(optimizer.ToState()); + /// <summary> + /// The last stored optimizer text this instance parsed, and the state parsed from it (plan 15, as + /// <c>DifferentialEvolutionSampler</c> keeps it): the text changes once per generation, and every ask in between + /// parsed the same JSON again. Guarded by the sampler's monitor, like every hook; a per-worker instance has its + /// own. + /// </summary> + /// <remarks> + /// Safe to share across asks because FromState never changes the state it reads: the <see cref="LmCma" /> rebuilt from it copies every array out of the state (Clone, Array.Copy and row copies) and reads the rest as numbers. A parse that throws + /// stores nothing, so the next ask parses (and throws) again, as before. + /// </remarks> + private (string Text, LmCmaState State)? _parsedState; + /// <summary>Decodes a persisted optimizer tag and reconstructs its matching state type.</summary> /// <param name="optimizerStr">Tagged serialized optimizer state, after any chunk reassembly.</param> - /// <returns>The optimizer reconstructed from the tagged state.</returns> + /// <returns>A new optimizer reconstructed from the tagged state; the caller may change it freely.</returns> /// <exception cref="System.NotSupportedException">The serialized optimizer tag is unknown.</exception> /// <exception cref="System.Text.Json.JsonException">The persisted optimizer payload is not valid JSON for its state type, or is the literal null.</exception> /// <exception cref="System.ArgumentException">The decoded state contains invalid optimizer constructor settings.</exception> /// <exception cref="System.ArgumentOutOfRangeException">The stored text has no <c><tag>\n</c> line.</exception> - private static LmCma DeserializeOptimizer(string optimizerStr) + /// <remarks>Parses the JSON only when the text differs from the last one parsed (<see cref="_parsedState" />); a new optimizer is built from the state every time.</remarks> + private LmCma DeserializeOptimizer(string optimizerStr) { + // The same stored text as the last parse: the same state, without parsing the JSON again (see _parsedState). + // The whole text, tag included, is the key, so a hit has passed the tag check before. + if (_parsedState is { } parsed && string.Equals(parsed.Text, optimizerStr, StringComparison.Ordinal)) + return LmCma.FromState(parsed.State); + int nl = optimizerStr.IndexOf('\n'); string tag = optimizerStr[..nl]; string json = optimizerStr[(nl + 1)..]; if (tag != "lmcma") throw new NotSupportedException($"Unknown optimizer state tag '{tag}'."); - return LmCma.FromState(OptimizerStateJson.Deserialize<LmCmaState>(json)); + LmCmaState state = OptimizerStateJson.Deserialize<LmCmaState>(json); + _parsedState = (optimizerStr, state); + return LmCma.FromState(state); } /// <summary>Finds the newest stored optimizer snapshot in completed trial history.</summary> /// <param name="completedTrials">Completed trial snapshots used as historical observations.</param> /// <returns>The newest available optimizer, or null when no stored snapshot exists.</returns> - private static LmCma? RestoreOptimizer(List<FrozenTrial> completedTrials) + /// <exception cref="System.NotSupportedException">The newest stored snapshot carries an unknown optimizer tag.</exception> + /// <exception cref="System.Text.Json.JsonException">The newest stored snapshot's payload is not valid JSON for the state type.</exception> + /// <exception cref="System.ArgumentException">The decoded state contains invalid optimizer constructor settings.</exception> + private LmCma? RestoreOptimizer(List<FrozenTrial> completedTrials) { for (int idx = completedTrials.Count - 1; idx >= 0; idx--) { @@ -330,7 +353,7 @@ private LmCma InitOptimizer(double[] lower, double[] upper) for (int i = 0; i < nDim; i++) sigma0 = Math.Min(sigma0, (upper[i] - lower[i]) / 6); sigma0 = Math.Max(sigma0, Eps); - int seed = (int)_cmaRng.Rng.randint(1, 2147483646); + int seed = (int)NumPyDraws.RandInt(_cmaRng.Rng, 1, 2147483646); return new LmCma(mean, sigma0, seed: seed, populationSize: _popsize, nVectors: _nVectors); } @@ -371,19 +394,21 @@ private void LogIndependentSampling(FrozenTrial trial, string paramName) /// <returns>Trial snapshots eligible for the sampler history.</returns> private List<FrozenTrial> GetTrials(Study study) { - var completeTrials = new List<FrozenTrial>(); - foreach (var t in study.GetTrialsInternal(deepcopy: false, states: null, useCache: true)) + List<FrozenTrial> all = study.GetTrialsInternal(deepcopy: false, states: null, useCache: true); + // Sized for the whole history (plan 15): nearly every trial is complete, so the list never regrows on an ask. + var completeTrials = new List<FrozenTrial>(all.Count); + foreach (var t in all) { if (t.State == TrialState.Complete) { completeTrials.Add(t); } else if (t.State == TrialState.Pruned - && t.IntermediateValues.Count > 0 + && t.IntermediateValuesForRead.Count > 0 && _considerPrunedTrials) { - long maxStep = t.IntermediateValues.Keys.Max(); - double value = t.IntermediateValues[maxStep]; + long maxStep = t.IntermediateValuesForRead.Keys.Max(); + double value = t.IntermediateValuesForRead[maxStep]; var copied = t.DeepCopy(); copied.Value = value; completeTrials.Add(copied); diff --git a/src/OptunaSharp.Core/Samplers/ModelBased/Gp/GPRegressor.cs b/src/OptunaSharp.Core/Samplers/ModelBased/Gp/GPRegressor.cs index d04bb15..b3cf86e 100644 --- a/src/OptunaSharp.Core/Samplers/ModelBased/Gp/GPRegressor.cs +++ b/src/OptunaSharp.Core/Samplers/ModelBased/Gp/GPRegressor.cs @@ -162,10 +162,18 @@ private static (double Value, double Deriv) Matern52(double t) /// <summary>The squared distance <c>S[i,j] = Σ_d squared_X_diff[i,j,d] · w[d]</c>.</summary> /// <returns>The pairwise length-scale-weighted squared distances between input rows.</returns> - private double[,] SquaredDistance() + private double[,] SquaredDistance() => SquaredDistance(new double[_n, _n]); + + /// <summary> + /// <see cref="SquaredDistance()" /> into a caller's n × n buffer, every element overwritten: the same sums in the + /// same order, for <see cref="LossAndGrad" />, which reuses one buffer across the fit's evaluations (plan 15). + /// </summary> + /// <param name="s">The n × n buffer to fill; its previous contents are irrelevant.</param> + /// <returns><paramref name="s" />, holding the weighted squared distances between the training rows.</returns> + /// <exception cref="IndexOutOfRangeException"><paramref name="s" /> is smaller than n × n.</exception> + private double[,] SquaredDistance(double[,] s) { double[] w = InverseSquaredLengthscales; - var s = new double[_n, _n]; for (int i = 0; i < _n; i++) for (int j = 0; j < _n; j++) { @@ -252,10 +260,9 @@ private static (double Value, double Deriv) Matern52(double t) mean[i] = s; } - // V = cov_fx_fX @ C⁻¹ = solve( X (L Lᵀ) = cov_fx_fX ) via two right-side triangular solves. - double[,] lt = Transpose(_covYYChol); - double[,] tmp = LinAlg.SolveTriangular(lt, covFxFX, upper: true, left: false); // X Lᵀ = cov_fx_fX - double[,] v = LinAlg.SolveTriangular(_covYYChol, tmp, upper: false, left: false); // X L = tmp + // V = cov_fx_fX @ C⁻¹ = solve( X (L Lᵀ) = cov_fx_fX ) via two right-side triangular solves (X Lᵀ = cov_fx_fX, + // then X L = that), fused on one block (plan 15). + double[,] v = LinAlg.CholeskySolve(_covYYChol, covFxFX, left: false); var variance = new double[b]; for (int i = 0; i < b; i++) @@ -355,10 +362,10 @@ private static (double Value, double Deriv) Matern52(double t) for (int j = 0; j < _nAll; j++) mean += k[j] * _covYYInvY[j]; - // V = C⁻¹ kᵀ via inv(Lᵀ)·inv(L)·k. + // V = C⁻¹ kᵀ via inv(Lᵀ)·inv(L)·k. The Lᵀ solve reads L transposed in place, the same operations as solving with + // a materialized Lᵀ, without an n × n allocation per point (plan 15). double[] invLk = LinAlg.SolveTriangular(_covYYChol, k, upper: false); - double[,] lt = Transpose(_covYYChol); - double[] v = LinAlg.SolveTriangular(lt, invLk, upper: true); + double[] v = LinAlg.SolveTriangular(_covYYChol, invLk, upper: false, transposeA: true); double rawVar = scale; for (int j = 0; j < _nAll; j++) @@ -440,10 +447,13 @@ internal double MarginalLogLikelihood() NoiseVar = nv; // ---- forward: S, M(S), M'(S), K, C = K + ν·I, Cholesky ---- - double[,] sq = SquaredDistance(); - var k0 = new double[_n, _n]; // M(S) - var mp = new double[_n, _n]; // M'(S) - var c = new double[_n, _n]; // C = s·M(S) + ν·I + // The n × n scratch below lives on the regressor across the fit's evaluations (plan 15): every element is + // rewritten before it is read on each call, so a reused buffer holds what a fresh one would. + _fitScratch ??= new FitScratch(_n); + double[,] sq = SquaredDistance(_fitScratch.Distance); + double[,] k0 = _fitScratch.K0; // M(S) + double[,] mp = _fitScratch.Mp; // M'(S) + double[,] c = _fitScratch.C; // C = s·M(S) + ν·I for (int i = 0; i < _n; i++) for (int j = 0; j < _n; j++) { @@ -466,12 +476,10 @@ internal double MarginalLogLikelihood() double loss = -mll - logPrior; // ---- backward: C⁻¹ = L⁻ᵀL⁻¹, α = C⁻¹y, G = ½(ααᵀ - C⁻¹) ---- - var identity = new double[_n, _n]; - for (int i = 0; i < _n; i++) - identity[i, i] = 1.0; - double[,] invL = LinAlg.SolveTriangular(l, identity, upper: false); // L⁻¹ - double[,] lt = Transpose(l); - double[,] cInv = LinAlg.SolveTriangular(lt, invL, upper: true); // L⁻ᵀL⁻¹ = C⁻¹ + // The identity is built once per regressor; the solve only reads it. C⁻¹ = L⁻ᵀL⁻¹ is the solve with L, then Lᵀ, + // of the identity, the two triangular solves this used to spell out, fused on one block (plan 15). + double[,] identity = _fitScratch.Identity; + double[,] cInv = LinAlg.CholeskySolve(l, identity, left: true); // L⁻ᵀL⁻¹ = C⁻¹ double[] alpha = LinAlg.Dot(cInv, _yTrain); // ∂MLL/∂ν = ½(α·α - tr(C⁻¹)) @@ -485,9 +493,9 @@ internal double MarginalLogLikelihood() double dmllDNoise = 0.5 * (MathUtil.PairwiseSum(alphaSq) - traceCInv); // G = ½(ααᵀ - C⁻¹); ∂MLL/∂s = Σ G⊙M(S); P = G⊙M'(S); ∂MLL/∂w[d] = s·Σ P⊙D[:,:,d] - var g = new double[_n, _n]; - var gK0 = new double[_n * _n]; - var p = new double[_n, _n]; + double[,] g = _fitScratch.G; + double[] gK0 = _fitScratch.GK0; + double[,] p = _fitScratch.P; int flat = 0; for (int i = 0; i < _n; i++) for (int j = 0; j < _n; j++) @@ -500,7 +508,7 @@ internal double MarginalLogLikelihood() double dmllDScale = MathUtil.PairwiseSum(gK0); var dmllDW = new double[n]; - var pd = new double[_n * _n]; + double[] pd = _fitScratch.Pd; for (int d = 0; d < n; d++) { flat = 0; @@ -525,6 +533,72 @@ internal double MarginalLogLikelihood() return (loss, grad); } + /// <summary> + /// <see cref="LossAndGrad" />'s n × n scratch, created on its first call and reused by every later one (plan 15). + /// </summary> + /// <remarks> + /// A fit evaluates the loss dozens of times, and each evaluation used to allocate nine n × n arrays: from 104 + /// training points on, each is a large-object-heap allocation, which is collected only with generation 2. Reuse is + /// safe because one regressor's fit evaluates its loss on one thread, one call at a time (each fit, TuRBO's + /// included, runs on a regressor of its own), and every call rewrites each buffer before reading it. + /// </remarks> + private FitScratch? _fitScratch; + + /// <summary> + /// Drops <see cref="LossAndGrad" />'s n × n scratch once a fit has finished evaluating the loss, so a regressor + /// kept for its posterior (or as the next fit's warm start) does not keep nine n × n arrays alive with it. + /// </summary> + /// <remarks>A later <see cref="LossAndGrad" /> call simply allocates the scratch again.</remarks> + internal void ReleaseFitScratch() => _fitScratch = null; + + /// <summary>The n × n buffers <see cref="LossAndGrad" /> reuses across one fit's evaluations.</summary> + private sealed class FitScratch + { + /// <summary>The weighted squared distances S.</summary> + internal readonly double[,] Distance; + + /// <summary>The Matérn 5/2 values M(S).</summary> + internal readonly double[,] K0; + + /// <summary>The Matérn 5/2 derivatives M'(S).</summary> + internal readonly double[,] Mp; + + /// <summary>The covariance C = s·M(S) + ν·I.</summary> + internal readonly double[,] C; + + /// <summary>The identity, the right-hand side whose solve gives L⁻¹; never written after construction.</summary> + internal readonly double[,] Identity; + + /// <summary>G = ½(ααᵀ - C⁻¹).</summary> + internal readonly double[,] G; + + /// <summary>G ⊙ M(S), flattened row-major for the pairwise sum.</summary> + internal readonly double[] GK0; + + /// <summary>P = G ⊙ M'(S).</summary> + internal readonly double[,] P; + + /// <summary>P ⊙ D[:, :, d] for one dimension d at a time, flattened row-major for the pairwise sum.</summary> + internal readonly double[] Pd; + + /// <summary>Allocates the buffers for <paramref name="n" /> training points.</summary> + /// <param name="n">The number of training points.</param> + internal FitScratch(int n) + { + Distance = new double[n, n]; + K0 = new double[n, n]; + Mp = new double[n, n]; + C = new double[n, n]; + Identity = new double[n, n]; + for (int i = 0; i < n; i++) + Identity[i, i] = 1.0; + G = new double[n, n]; + GK0 = new double[n * n]; + P = new double[n, n]; + Pd = new double[n * n]; + } + } + private double[,]? _covYYChol; private double[] _covYYInvY = Array.Empty<double>(); @@ -539,10 +613,9 @@ internal void CacheMatrix() for (int i = 0; i < _n; i++) c[i, i] += NoiseVar; _covYYChol = LinAlg.Cholesky(c); - // C⁻¹y = L⁻ᵀ(L⁻¹y). + // C⁻¹y = L⁻ᵀ(L⁻¹y); the Lᵀ solve reads L transposed in place (plan 15), the same operations as before. double[] invLy = LinAlg.SolveTriangular(_covYYChol, _yTrain, upper: false); - double[,] lt = Transpose(_covYYChol); - _covYYInvY = LinAlg.SolveTriangular(lt, invLy, upper: true); + _covYYInvY = LinAlg.SolveTriangular(_covYYChol, invLy, upper: false, transposeA: true); } /// <summary> @@ -649,11 +722,11 @@ internal void AppendRunningData(double[,] xRunning, double[] yRunning) { if (left) { - double[,] tmp = LinAlg.SolveTriangular(l, b, upper: false, left: true); // L (Lᵀ X) = B - return LinAlg.SolveTriangular(Transpose(l), tmp, upper: true, left: true); // Lᵀ X = tmp + // L (Lᵀ X) = B, then Lᵀ X = tmp: both triangular solves fused on one block (plan 15). + return LinAlg.CholeskySolve(l, b, left: true); } - double[,] rt = LinAlg.SolveTriangular(Transpose(l), b, upper: true, left: false); // (X L) Lᵀ = B - return LinAlg.SolveTriangular(l, rt, upper: false, left: false); // X L = rt + // (X L) Lᵀ = B, then X L = rt: both triangular solves fused on one block (plan 15). + return LinAlg.CholeskySolve(l, b, left: false); } /// <summary><c>_solve_cholesky(L, b)</c> for a vector right-hand side (<c>left=True</c>): <c>C⁻¹b = L⁻ᵀ(L⁻¹b)</c>.</summary> @@ -663,7 +736,8 @@ internal void AppendRunningData(double[,] xRunning, double[] yRunning) internal static double[] SolveCholesky(double[,] l, double[] b) { double[] invLb = LinAlg.SolveTriangular(l, b, upper: false); - return LinAlg.SolveTriangular(Transpose(l), invLb, upper: true); + // Lᵀ read in place (plan 15): the operations of solving with a materialized Lᵀ, without the n × n copy. + return LinAlg.SolveTriangular(l, invLb, upper: false, transposeA: true); } /// <summary> @@ -726,9 +800,19 @@ private GPRegressor FitInner(double minimumNoise, bool deterministicObjective, d // 0.99 * minimum_noise is subtracted to keep the initial noise strictly above the floor. initial[nParams + 1] = Math.Log(NoiseVar - 0.99 * minimumNoise); - LBfgsB.Result res = LBfgsB.Minimize( - rawParams => LossAndGrad(rawParams, minimumNoise, deterministicObjective), - initial, bounds: null, m: 10, factr: 1e7, pgtol: gtol, maxfun: 15000, maxiter: 15000, maxls: 20); + LBfgsB.Result res; + try + { + res = LBfgsB.Minimize( + rawParams => LossAndGrad(rawParams, minimumNoise, deterministicObjective), + initial, bounds: null, m: 10, factr: 1e7, pgtol: gtol, maxfun: 15000, maxiter: 15000, maxls: 20); + } + finally + { + // The fitted regressor outlives its fit (posterior queries, the next trial's warm start), and nothing + // after the fit evaluates the loss again: drop the n × n scratch now instead of keeping it alive with it. + ReleaseFitScratch(); + } if (res.WarnFlag != 0) throw new InvalidOperationException("Optimization failed"); diff --git a/src/OptunaSharp.Core/Samplers/ModelBased/Gp/SearchSpace.cs b/src/OptunaSharp.Core/Samplers/ModelBased/Gp/SearchSpace.cs index 0eef672..7ef71fd 100644 --- a/src/OptunaSharp.Core/Samplers/ModelBased/Gp/SearchSpace.cs +++ b/src/OptunaSharp.Core/Samplers/ModelBased/Gp/SearchSpace.cs @@ -8,6 +8,7 @@ using System.Collections.Generic; using System.Linq; using NumSharp; +using NumSharp.Utilities; using OptunaSharp.Distributions; using OptunaSharp.Internal; @@ -19,7 +20,8 @@ namespace OptunaSharp.Samplers.ModelBased.Gp; /// Gaussian process works in: continuous parameters are affine- (or log-affine-) scaled, /// discrete ones round to their grid, and categoricals carry their integer code. Every transform /// is pure numpy in Optuna and reproduced bit-for-bit here (no <c>erf</c>, no LAPACK — <c>log</c>/ -/// <c>exp</c>/<c>floor</c> match Python bit-for-bit). +/// <c>exp</c>/<c>floor</c> match Python bit-for-bit; the discrete grids are NumSharp's <c>np.arange</c> +/// and the rounding's <c>//</c> is NumSharp's port of NumPy's <c>floor_divide</c>, since 2026-11-11). /// /// <para><see cref="SampleNormalizedParams" /> draws the preliminary points from <b>scrambled</b> /// Sobol' (<see cref="ScrambledSobol" />, a bit-exact port of <c>scipy.stats.qmc.Sobol(scramble=True)</c>) @@ -198,7 +200,7 @@ internal List<double[]> GetChoicesOfDiscreteParams() /// <returns>A matrix of sampled normalized points rounded onto each coordinate's support.</returns> internal double[,] SampleNormalizedParams(int n, NumPyRandom rng) { - int seed = (int)rng.randint(0, 2147483647); // rng.randint(np.iinfo(np.int32).max) + int seed = (int)NumPyDraws.RandInt(rng, 0, 2147483647); // rng.randint(np.iinfo(np.int32).max) double[,] values = ScrambledSobol.Random(Dim, n, seed); for (int i = 0; i < Dim; i++) { @@ -271,38 +273,64 @@ internal static double UnnormalizeOneParam(double value, ScaleType scaleType, (d /// <param name="bounds">The coordinate bounds used by this numerical operation.</param> /// <param name="step">The distribution's grid spacing; zero denotes a continuous coordinate.</param> /// <returns>The nearest admissible discrete coordinate in normalized space.</returns> + /// <remarks> + /// Optuna's <c>(param_value - low + 0.5 * step) // step</c> is NumPy's <c>floor_divide</c>, which floors the + /// exact quotient (<c>npy_divmod</c>: <c>fmod</c>, then <c>(a - mod) / b</c> snapped to an integer), not the + /// rounded one: <c>0.9 // 0.05</c> is <c>17</c> where <c>Math.Floor(0.9 / 0.05)</c> is <c>18</c>, because the + /// double <c>0.05</c> is a little above 1/20 and the quotient rounds up to 18. NumSharp's + /// <see cref="NDDivision.FloorDivDouble(double, double)" /> is that routine, allocation-free. The former + /// <c>Math.Floor(a / b)</c> picked the next grid point in about 1 of 800 roundings of random and dyadic + /// (Sobol'-like) points (measured 2026-11-11 over 508,000 against NumPy 2.4.2). + /// </remarks> internal static double RoundOneNormalizedParam(double value, ScaleType scaleType, (double Low, double High) bounds, double step) { if (step == 0.0) return value; double unnormalized = UnnormalizeOneParam(value, scaleType, bounds, step); double rounded = MathUtilClip( - Math.Floor((unnormalized - bounds.Low + 0.5 * step) / step) * step + bounds.Low, + NDDivision.FloorDivDouble(unnormalized - bounds.Low + 0.5 * step, step) * step + bounds.Low, bounds.Low, bounds.High); return NormalizeOneParam(rounded, scaleType, bounds, step); } - /// <summary>NumPy <c>np.arange(start, stop, step)</c> — length <c>ceil((stop - start) / step)</c>, value <c>start + i·step</c>.</summary> + /// <summary> + /// NumPy <c>np.arange(start, stop, step)</c>, computed by NumSharp's <c>np.arange</c>: length + /// <c>ceil((stop - start) / step)</c>, elements <c>start</c>, <c>start + step</c>, then + /// <c>start + i * delta</c> with <c>delta = (start + step) - start</c>. + /// </summary> /// <param name="start">The inclusive start of the interval or slice.</param> /// <param name="stop">The final value of the generated numerical interval.</param> /// <param name="step">The nonzero increment between successive grid values.</param> - /// <returns>The generated arithmetic progression, excluding its stop value.</returns> + /// <returns>The generated arithmetic progression, excluding its stop value; empty when <paramref name="stop" /> is not past <paramref name="start" />.</returns> + /// <remarks> + /// NumPy fills the ramp with the step as it was stored, <c>(start + step) - start</c>, not with <c>step</c> + /// (<c>PyArray_ArangeObj</c> and the dtype's <c>fill</c>), so a stepped float whose step does not survive that + /// round trip gets other grid points: <c>FloatDistribution(0.1, 1.0, step=0.3)</c> ends its grid at + /// <c>1.0</c> in Optuna, where the former <c>start + i * step</c> gave <c>0.9999999999999998</c> (QA-49; about + /// half of random ranges differ somewhere). The grid is built once per discrete dimension per + /// <c>GetChoicesOfDiscreteParams</c> call, so the NumSharp call's microseconds do not matter. + /// </remarks> + /// <exception cref="ZeroDivisionError"><paramref name="step" /> is zero: NumPy's <c>ZeroDivisionError</c>, which NumSharp's <c>np.arange</c> raises as Python's class since 0.81.0 (it was .NET's <see cref="DivideByZeroException" /> before); the callers only pass discrete steps, which are positive.</exception> private static double[] Arange(double start, double stop, double step) { - int count = (int)Math.Ceiling((stop - start) / step); - if (count < 0) - count = 0; - var a = new double[count]; - for (int i = 0; i < count; i++) - a[i] = start + i * step; - return a; + using NDArray grid = np.arange(start, stop, step); + return grid.ToArray<double>(); } - /// <summary>Returns the value bounded by the supplied interval endpoints.</summary> - /// <param name="value">The value to convert, format, or compare using the operation's stated convention.</param> + /// <summary> + /// NumPy <c>np.clip</c> against scalar bounds, through <see cref="MathUtil.Clip" />: Optuna's two clips here + /// (<c>_get_unnormalized_param</c> on a 0-d value, <c>_round_one_normalized_param</c> on an array against + /// <c>bounds[0]</c> / <c>bounds[1]</c>) both run NumPy's const loop, where a value equal to a bound keeps its own + /// zero sign. + /// </summary> + /// <param name="value">The value to clip; a NaN stays NaN.</param> /// <param name="low">The lower endpoint of the allowed range.</param> /// <param name="high">The upper endpoint of the allowed range.</param> - /// <returns>The value bounded by the supplied interval endpoints.</returns> + /// <returns>The value when inside the range or on its edge, else the bound it crossed.</returns> + /// <remarks> + /// The former <c>Math.Min(Math.Max(value, low), high)</c> turned <c>-0.0</c> on a <c>+0.0</c> bound into + /// <c>+0.0</c> and back (QA-30's class). + /// </remarks> private static double MathUtilClip(double value, double low, double high) - => Math.Min(Math.Max(value, low), high); + => MathUtil.Clip(value, low, high); } diff --git a/src/OptunaSharp.Core/Samplers/ModelBased/Saas/NoUTurnSampler.cs b/src/OptunaSharp.Core/Samplers/ModelBased/Saas/NoUTurnSampler.cs index efc5841..767ba5a 100644 --- a/src/OptunaSharp.Core/Samplers/ModelBased/Saas/NoUTurnSampler.cs +++ b/src/OptunaSharp.Core/Samplers/ModelBased/Saas/NoUTurnSampler.cs @@ -13,6 +13,7 @@ using System; using System.Collections.Generic; using NumSharp; +using OptunaSharp.Internal; namespace OptunaSharp.Samplers.ModelBased.Saas; @@ -442,7 +443,7 @@ private bool NoUTurn(double[] thetaMinus, double[] thetaPlus, double[] rMinus, d /// <returns>A momentum vector with the metric's marginal variances.</returns> private double[] SampleMomentum(NumPyRandom rng) { - double[] z = rng.randn(_dim).ToArray<double>(); + double[] z = NumPyDraws.Randn(rng, _dim); var r = new double[_dim]; for (int d = 0; d < _dim; d++) r[d] = z[d] * _momentumStd[d]; diff --git a/src/OptunaSharp.Core/Samplers/MoeaDSampler.cs b/src/OptunaSharp.Core/Samplers/MoeaDSampler.cs index 5752395..e11ea12 100644 --- a/src/OptunaSharp.Core/Samplers/MoeaDSampler.cs +++ b/src/OptunaSharp.Core/Samplers/MoeaDSampler.cs @@ -3,9 +3,12 @@ // Reference: Qingfu Zhang & Hui Li, "MOEA/D: A Multiobjective Evolutionary Algorithm Based on // Decomposition", IEEE Transactions on Evolutionary Computation 11(6), 2007. The structure (Das-Dennis // weight vectors, neighborhood mating, ideal-point update, decomposition-based replacement) follows -// pymoo's `MOEAD` (pymoo/algorithms/moo/moead.py, Apache-2.0). MOEA/D has NO Optuna/OptunaHub -// counterpart, so — like `SmsEmoaSampler` / `LmCmaSampler` — it is a native, paper-faithful port -// validated by convergence / hypervolume, not bit-matched to an upstream trajectory. Plan 07 baseline. +// pymoo's `MOEAD` (pymoo/algorithms/moo/moead.py, Apache-2.0). Optuna itself has no MOEA/D. OptunaHub +// does (`samplers/moead`, `MOEADSampler`, since 2024-09), but this port follows pymoo, not that package, +// so names, parameters, defaults and seeded trajectories differ (the map is in the class remarks; QA-70 +// of docs/qa/PARITY_QA_2026-11-10.md, where the owner chose on 2026-11-12 to keep this port). Like +// `SmsEmoaSampler` / `LmCmaSampler` it is a native, paper-faithful port validated by convergence / +// hypervolume, not bit-matched to an upstream trajectory. Plan 07 baseline. // // Design (steady-state per-subproblem over Optuna's per-trial protocol, mirroring SmsEmoaSampler): // • N = the Das-Dennis lattice size closest to (≤) the target `populationSize`; each weight vector is @@ -43,12 +46,34 @@ namespace OptunaSharp.Samplers; /// decomposition-based replacement. The scalarizing function is Tchebycheff by default /// (<see cref="MoeadScalarization" /> also offers PBI and weighted sum). /// -/// <para><b>Beyond-core.</b> MOEA/D has no Optuna / OptunaHub counterpart; like -/// <see cref="SmsEmoaSampler" /> it is validated by convergence and achieved hypervolume, not -/// bit-matched to an upstream. The crossover/mutation are the shared NSGA operators +/// <para><b>Beyond-core.</b> Optuna has no MOEA/D. OptunaHub's <c>samplers/moead</c> +/// (<c>MOEADSampler</c>) is another implementation of the algorithm, which this class does not follow: it +/// ports pymoo's <c>MOEAD</c>, so a study moved over from the hub package gets other defaults and other +/// trials (map below). Like <see cref="SmsEmoaSampler" /> it is validated by convergence and achieved +/// hypervolume, not bit-matched to an upstream. The crossover/mutation are the shared NSGA operators /// (<see cref="SBXCrossover" /> + <see cref="PolynomialMutation" /> by default), so only the selection /// and replacement differ from the NSGA-II family.</para> /// +/// <para><b>OptunaHub's <c>MOEADSampler</c> and this class</b> (registry pinned in <c>refs/optunahub-registry</c>):</para> +/// <list type="table"> +/// <listheader><term>OptunaHub <c>MOEADSampler</c></term><description>This class</description></listheader> +/// <item><term><c>population_size=100</c></term><description><c>populationSize = 50</c>, rounded down to a +/// Das-Dennis lattice size (the hub uses the number as given)</description></item> +/// <item><term><c>n_neighbors=None</c> (then <c>population_size // 10</c>)</term><description><c>nNeighbors = 20</c></description></item> +/// <item><term><c>scalar_aggregation_func="tchebycheff"</c> (also <c>"weighted_sum"</c>, <c>"PBI"</c>)</term><description><c>scalarization</c>: +/// <see cref="MoeadScalarization.Tchebycheff" /> by default, plus PBI and weighted sum</description></item> +/// <item><term><c>crossover=None</c>, meaning <c>UniformCrossover(swapping_prob)</c></term><description><c>crossover</c>: +/// <see cref="SBXCrossover" /> by default</description></item> +/// <item><term><c>mutation=None</c>, meaning <c>UniformMutation()</c></term><description><c>mutation</c>: +/// <see cref="PolynomialMutation" /> by default</description></item> +/// <item><term><c>crossover_prob=0.9</c> (otherwise a random parent is copied)</term><description>none: every +/// offspring is crossed</description></item> +/// <item><term><c>mutation_prob=None</c> (1 / number of parameters), <c>swapping_prob=0.5</c>, <c>seed</c></term><description><c>mutationProb</c>, +/// <c>swappingProb</c>, <c>seed</c>, same defaults</description></item> +/// <item><term>(mates within the neighborhood)</term><description><c>neighborSelectionProb = 0.9</c> (pymoo's +/// <c>prob_neighbor_mating</c>) and <c>nReplacements = 2</c></description></item> +/// </list> +/// /// <para><b>In-memory state.</b> The N-solution population, its ideal point and the folded-offspring /// bookkeeping are reconstructed incrementally and held in memory for the study's process lifetime, so /// a MOEA/D study does not resume across process boundaries (same concession as @@ -97,8 +122,9 @@ public class MoeaDSampler : BaseSampler // count) into study B when the sampler was reused (pre-release review item H3). private readonly PerStudyState<StudyDecomposition> _studies = new(); - // Per study: the child each running trial received, so a child equal to one a running trial evaluates is - // generated again (HandedOutParams). Entries leave with AfterTrial. Guarded by the sampler's monitor. + // Per study: the child each running trial received, so a child equal to one a running trial asked on another + // thread evaluates is generated again (HandedOutParams; one caller's single-thread batch is not redrawn, QA-57). + // Entries leave with AfterTrial. Guarded by the sampler's monitor. private readonly HandedOutParams _handedOutChildren = new(); private bool _warnedSingleObjective; @@ -114,8 +140,15 @@ private sealed class StudyDecomposition /// <summary>Effective population size / number of subproblems.</summary> public int N; - /// <summary>Trial ids of the current per-subproblem solutions (size N); <c>null</c> until the initial population is complete.</summary> - public List<int>? PopulationIds; + /// <summary>Trial numbers of the current per-subproblem solutions (size N); <c>null</c> until the initial population is complete.</summary> + /// <remarks> + /// Numbers rather than storage ids (plan 15): within one study a number names one trial for good, as its id + /// does, so both resolve to the same records; a number is found in the number-ordered history by binary search + /// (<see cref="TrialsByNumber" />), where an id needed a dictionary over the whole history rebuilt on every + /// ask. A study recreated under the same id reuses numbers, but its decomposition is discarded first + /// (<see cref="Anchor" />). + /// </remarks> + public List<int>? PopulationNumbers; /// <summary>Running ideal point z* (minimization convention, length m).</summary> public double[]? Ideal; @@ -271,7 +304,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S // Mating pool: the subproblem's neighborhood with probability δ, else the whole population. IReadOnlyList<FrozenTrial> matingPool = - (double)_rng.Rng.rand() < _neighborSelectionProb + NumPyDraws.Rand(_rng.Rng) < _neighborSelectionProb ? neighbors.Select(j => population[j]).ToList() : population; @@ -385,13 +418,13 @@ private static int[][] ComputeNeighbors(double[][] weights, int t) private List<FrozenTrial> ReconstructPopulation( StudyDecomposition decomposition, Study study, List<FrozenTrial> completed, double[] signs) { - var byId = new Dictionary<int, FrozenTrial>(completed.Count); - foreach (var t in completed) - byId[t.TrialId] = t; + // Lookups by number: a binary search over the number-ordered history instead of a dictionary over every + // completed trial rebuilt on each ask (plan 15: over a third of the sampler's allocations, O(n) per ask). + var byNumber = TrialsByNumber.Over(completed); int m = signs.Length; - if (decomposition.PopulationIds is null) + if (decomposition.PopulationNumbers is null) { var initTrials = completed .Where(t => !t.SystemAttrs.ContainsKey(AttrKeySubproblem)) @@ -400,13 +433,13 @@ private List<FrozenTrial> ReconstructPopulation( if (initTrials.Count < decomposition.N) return new List<FrozenTrial>(); // initial population not complete yet - decomposition.PopulationIds = initTrials.Take(decomposition.N).Select(t => t.TrialId).ToList(); + decomposition.PopulationNumbers = initTrials.Take(decomposition.N).Select(t => t.Number).ToList(); decomposition.Anchor = TrialAnchor.Of(initTrials[0]); decomposition.Ideal = new double[m]; for (int j = 0; j < m; j++) decomposition.Ideal[j] = double.PositiveInfinity; - foreach (int id in decomposition.PopulationIds) + foreach (int number in decomposition.PopulationNumbers) { - double[] loss = Loss(byId[id], signs); + double[] loss = Loss(Member(byNumber, number), signs); for (int j = 0; j < m; j++) if (loss[j] < decomposition.Ideal[j]) decomposition.Ideal[j] = loss[j]; } @@ -415,10 +448,15 @@ private List<FrozenTrial> ReconstructPopulation( // Fold every offspring not yet folded, in ascending trial-number order (steady-state: each fold // sees the population and ideal point left by the previous folds). + // The filter stays LINQ: the framework ships it precompiled, where a hand-written loop here ran as unoptimized + // tier-0 code for the first few thousand asks of a process and measured slower until it tiered up (plan 15). var newOffspring = completed .Where(t => t.SystemAttrs.ContainsKey(AttrKeySubproblem) && !decomposition.FoldedNumbers!.Contains(t.Number)) - .OrderBy(t => t.Number) .ToList(); + // LINQ's stable OrderBy(t => t.Number) leaves a list already in strictly ascending number order as it is, so it + // runs only when the history came out of order (plan 15: its buffers were 13% of the allocations). + if (!byNumber.IsAscending) + newOffspring = newOffspring.OrderBy(t => t.Number).ToList(); foreach (var off in newOffspring) { @@ -436,12 +474,12 @@ private List<FrozenTrial> ReconstructPopulation( int replaced = 0; foreach (int j in decomposition.Neighbors![sc]) { - var current = byId[decomposition.PopulationIds[j]]; + var current = Member(byNumber, decomposition.PopulationNumbers[j]); double gOff = MoeadDecomposition.Scalarize(_scalarization, offLoss, decomposition.Weights![j], decomposition.Ideal!); double gCur = MoeadDecomposition.Scalarize(_scalarization, Loss(current, signs), decomposition.Weights[j], decomposition.Ideal!); if (gOff < gCur) { - decomposition.PopulationIds[j] = off.TrialId; + decomposition.PopulationNumbers[j] = off.Number; replaced++; if (replaced >= _nReplacements) break; } @@ -449,9 +487,22 @@ private List<FrozenTrial> ReconstructPopulation( decomposition.FoldedNumbers!.Add(off.Number); } - return decomposition.PopulationIds.Select(id => byId[id]).ToList(); + var members = new List<FrozenTrial>(decomposition.PopulationNumbers.Count); + foreach (int number in decomposition.PopulationNumbers) + members.Add(Member(byNumber, number)); + return members; } + /// <summary>The population member with this trial number, which the completed history always holds.</summary> + /// <param name="byNumber">The completed history, searchable by number.</param> + /// <param name="number">A population member's trial number.</param> + /// <returns>The member's record.</returns> + /// <exception cref="KeyNotFoundException">The history does not hold the number: the exception the replaced id dictionary's indexer threw.</exception> + private static FrozenTrial Member(TrialsByNumber byNumber, int number) + => byNumber.TryGetValue(number, out FrozenTrial trial) + ? trial + : throw new KeyNotFoundException($"The given key '{number}' was not present in the dictionary."); + /// <summary>Per-objective sign so every objective becomes a minimization (Optuna internal convention).</summary> /// <param name="study">Study supplying trial history, objective directions, and storage.</param> /// <returns>One multiplier per objective: plus one for minimization and minus one for maximization.</returns> diff --git a/src/OptunaSharp.Core/Samplers/Moead/MoeadOffspring.cs b/src/OptunaSharp.Core/Samplers/Moead/MoeadOffspring.cs index cf0e39f..7712780 100644 --- a/src/OptunaSharp.Core/Samplers/Moead/MoeadOffspring.cs +++ b/src/OptunaSharp.Core/Samplers/Moead/MoeadOffspring.cs @@ -65,8 +65,8 @@ internal static class MoeadOffspring if (categoricalSearchSpace.Count > 0) { var catKeys = categoricalSearchSpace.Keys.ToList(); - var parent0Cat = catKeys.Select(p => parents[0].ParamsDict[p]).ToArray(); - var parentLastCat = catKeys.Select(p => parents[^1].ParamsDict[p]).ToArray(); + var parent0Cat = catKeys.Select(p => parents[0].Params[p]).ToArray(); + var parentLastCat = catKeys.Select(p => parents[^1].Params[p]).ToArray(); var r = rng.rand(catKeys.Count).ToArray<double>(); for (int j = 0; j < catKeys.Count; j++) childParams[catKeys[j]] = r[j] >= swappingProb ? parentLastCat[j] : parent0Cat[j]; @@ -83,7 +83,7 @@ internal static class MoeadOffspring { var row = new OrderedDict<string, object?>(); foreach (var k in numKeys) - row[k] = parents[i].ParamsDict[k]; + row[k] = parents[i].Params[k]; parentsNumerical[i] = transform.Transform(row).ToArray<double>(); } @@ -101,7 +101,7 @@ internal static class MoeadOffspring double prob = mutationProb ?? 1.0 / Math.Max(1.0, nParams); foreach (var key in numericalSearchSpace.Keys) { - if ((double)rng.rand() >= prob) + if (NumPyDraws.Rand(rng) >= prob) continue; var mutated = NsgaiiMutation.PerformMutation( mutation, rng, study, searchSpace[key], childParams[key]); @@ -128,11 +128,11 @@ private static List<FrozenTrial> SelectParents(IReadOnlyList<FrozenTrial> pool, int idx; if (used.Count >= n) { - idx = (int)rng.randint(0, n); // pool exhausted: allow a repeat rather than loop forever + idx = (int)NumPyDraws.RandInt(rng, 0, n); // pool exhausted: allow a repeat rather than loop forever } else { - do { idx = (int)rng.randint(0, n); } while (!used.Add(idx)); + do { idx = (int)NumPyDraws.RandInt(rng, 0, n); } while (!used.Add(idx)); } parents.Add(pool[idx]); } diff --git a/src/OptunaSharp.Core/Samplers/NSGAIISampler.cs b/src/OptunaSharp.Core/Samplers/NSGAIISampler.cs index 5afd7f4..ff4c607 100644 --- a/src/OptunaSharp.Core/Samplers/NSGAIISampler.cs +++ b/src/OptunaSharp.Core/Samplers/NSGAIISampler.cs @@ -133,8 +133,11 @@ public override void ReseedRng() /// <inheritdoc /> public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(Study study, FrozenTrial trial) { - var searchSpace = new OrderedDict<string, BaseDistribution>(); - foreach (var (name, distribution) in _searchSpace.Calculate(study)) + var calculated = _searchSpace.Calculate(study); + // Sized for the whole calculated space: this runs on every trial, and growing the result from empty reallocated + // it several times for a few dozen parameters (plan 14). + var searchSpace = new OrderedDict<string, BaseDistribution>(calculated.Count); + foreach (var (name, distribution) in calculated) { // The untransform of _SearchSpaceTransform does not assume a single value, so single // value objects are sampled via sample_independent, not sample_relative. diff --git a/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/BLXAlphaCrossover.cs b/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/BLXAlphaCrossover.cs index d6faacf..8ba3532 100644 --- a/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/BLXAlphaCrossover.cs +++ b/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/BLXAlphaCrossover.cs @@ -1,5 +1,6 @@ using System; using NumSharp; +using OptunaSharp.Internal; namespace OptunaSharp.Samplers.Nsgaii; @@ -29,7 +30,7 @@ public override double[] Crossover( double[][] parentsParams, NumPyRandom rng, Study study, double[,] searchSpaceBounds) { int n = searchSpaceBounds.GetLength(0); - var r = rng.rand(n).ToArray<double>(); + var r = NumPyDraws.Rand(rng, n); var child = new double[n]; for (int j = 0; j < n; j++) { diff --git a/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/SBXCrossover.cs b/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/SBXCrossover.cs index 162c949..6c59048 100644 --- a/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/SBXCrossover.cs +++ b/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/SBXCrossover.cs @@ -1,5 +1,6 @@ using System; using NumSharp; +using OptunaSharp.Internal; namespace OptunaSharp.Samplers.Nsgaii; @@ -46,7 +47,7 @@ public override double[] Crossover( int n = searchSpaceBounds.GetLength(0); double eta = _eta ?? (study.IsMultiObjective() ? 20.0 : 2.0); - var us = rng.rand(n).ToArray<double>(); + var us = NumPyDraws.Rand(rng, n); var c1 = new double[n]; var c2 = new double[n]; diff --git a/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/SPXCrossover.cs b/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/SPXCrossover.cs index 652621b..91f2e2c 100644 --- a/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/SPXCrossover.cs +++ b/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/SPXCrossover.cs @@ -1,5 +1,6 @@ using System; using NumSharp; +using OptunaSharp.Internal; namespace OptunaSharp.Samplers.Nsgaii; @@ -43,7 +44,7 @@ public override double[] Crossover( } // rs = np.power(rng.rand(n), 1 / (np.arange(n) + 1)) (Equation (2)). - var rand = rng.rand(n).ToArray<double>(); + var rand = NumPyDraws.Rand(rng, n); var rs = new double[n]; for (int i = 0; i < n; i++) rs[i] = Math.Pow(rand[i], 1.0 / (i + 1)); diff --git a/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/SbxLike.cs b/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/SbxLike.cs index f61b57b..ec65c25 100644 --- a/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/SbxLike.cs +++ b/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/SbxLike.cs @@ -1,4 +1,5 @@ using NumSharp; +using OptunaSharp.Internal; namespace OptunaSharp.Samplers.Nsgaii; @@ -29,9 +30,9 @@ internal static double[] CollapseTwoChildren( var child2 = new double[n]; for (int i = 0; i < n; i++) { - if ((double)rng.rand() < useChildGeneProb) + if (NumPyDraws.Rand(rng) < useChildGeneProb) { - if ((double)rng.rand() >= uniformCrossoverProb) + if (NumPyDraws.Rand(rng) >= uniformCrossoverProb) { child1[i] = c1[i]; child2[i] = c2[i]; @@ -44,7 +45,7 @@ internal static double[] CollapseTwoChildren( } else { - if ((double)rng.rand() >= uniformCrossoverProb) + if (NumPyDraws.Rand(rng) >= uniformCrossoverProb) { child1[i] = parent0[i]; child2[i] = parent1[i]; @@ -57,6 +58,6 @@ internal static double[] CollapseTwoChildren( } } - return (double)rng.rand() < 0.5 ? child1 : child2; + return NumPyDraws.Rand(rng) < 0.5 ? child1 : child2; } } diff --git a/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/UNDXCrossover.cs b/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/UNDXCrossover.cs index 11ff05e..e79cc59 100644 --- a/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/UNDXCrossover.cs +++ b/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/UNDXCrossover.cs @@ -66,8 +66,8 @@ public override double[] Crossover( // Draw order: etas (n gaussians) then xi (1 gaussian) — Optuna passes the *variance* as the // normal `scale` argument, replicated verbatim. - var etas = rng.normal(0.0, Math.Pow(sigmaEta, 2.0), new Shape(n)).ToArray<double>(); - double xi = (double)rng.normal(0.0, Math.Pow(_sigmaXi, 2.0)); + var etas = NumPyDraws.Normal(rng, 0.0, Math.Pow(sigmaEta, 2.0), n); + double xi = NumPyDraws.Normal(rng, 0.0, Math.Pow(_sigmaXi, 2.0)); var es = OrthonormalBasisVectorToPsl(parentsParams, n); // Orthonormal basis orthogonal to psl. @@ -91,20 +91,24 @@ public override double[] Crossover( return child; } - /// <summary>Python <c>_normalized_x1_to_x2</c>: normalized vector from x1 to x2.</summary> + /// <summary> + /// Python <c>_normalized_x1_to_x2</c>: the unit vector from x1 to x2, its length taken by NumSharp's + /// <c>np.linalg.norm</c> (NumPy's <c>sqrt(x.dot(x))</c>, BLAS <c>ddot</c>) so it rounds as Optuna's does. + /// </summary> /// <param name="parentsParams">Numerical parent vectors, one parent per row and one parameter per column.</param> - /// <returns>A unit vector along the primary parent axis.</returns> + /// <returns>A unit vector along the primary parent axis (the raw difference over 1e-10 when the parents coincide).</returns> + /// <remarks> + /// The length used to be a left-to-right sum of squares, which matches <c>ddot</c> on a few parameters only: over + /// 24 the children differed from Optuna's within the first generations (live: + /// <c>UndxCrossover_ManyParameters_FullState_IsBitIdentical</c>). + /// </remarks> private static double[] NormalizedX1ToX2(double[][] parentsParams) { int n = parentsParams[0].Length; var v12 = new double[n]; - double sumSq = 0.0; for (int i = 0; i < n; i++) - { v12[i] = parentsParams[1][i] - parentsParams[0][i]; - sumSq += v12[i] * v12[i]; - } - double m12 = Math.Sqrt(sumSq); + double m12 = LinAlg.Norm(v12); // np.linalg.norm(v_12, ord=2) = sqrt(v_12.dot(v_12)). double denom = Math.Max(m12, 1e-10); // np.clip(m_12, 1e-10, None). var e12 = new double[n]; for (int i = 0; i < n; i++) @@ -112,7 +116,11 @@ private static double[] NormalizedX1ToX2(double[][] parentsParams) return e12; } - /// <summary>Python <c>_distance_from_x_to_psl</c>.</summary> + /// <summary> + /// Python <c>_distance_from_x_to_psl</c>: the distance from x3 to the line through x1 and x2, with + /// <c>np.dot(v_13, e_12)</c> and the closing <c>np.linalg.norm</c> taken through NumSharp (BLAS <c>ddot</c>, as + /// NumPy's), so the scale of every child's perpendicular step is Optuna's to the last bit. + /// </summary> /// <param name="parentsParams">Numerical parent vectors, one parent per row and one parameter per column.</param> /// <returns>The perpendicular distance to the primary parent line.</returns> private static double DistanceFromXToPsl(double[][] parentsParams) @@ -120,19 +128,14 @@ private static double DistanceFromXToPsl(double[][] parentsParams) int n = parentsParams[0].Length; var e12 = NormalizedX1ToX2(parentsParams); var v13 = new double[n]; - double dot = 0.0; for (int i = 0; i < n; i++) - { v13[i] = parentsParams[2][i] - parentsParams[0][i]; - dot += v13[i] * e12[i]; - } - double sumSq = 0.0; + double dot = LinAlg.Dot(v13, e12); + // v_12_3 = v_13 - np.dot(v_13, e_12) * e_12: NumPy scales e_12 first, then subtracts, element by element. + var v1223 = new double[n]; for (int i = 0; i < n; i++) - { - double v = v13[i] - dot * e12[i]; // orthogonal component. - sumSq += v * v; - } - return Math.Sqrt(sumSq); + v1223[i] = v13[i] - dot * e12[i]; + return LinAlg.Norm(v1223); } /// <summary>Python <c>_orthonormal_basis_vector_to_psl</c> → returns <c>Q.T[1:]</c> (n-1 rows of length n).</summary> diff --git a/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/UniformCrossover.cs b/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/UniformCrossover.cs index ecdbcdf..7aced4d 100644 --- a/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/UniformCrossover.cs +++ b/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/UniformCrossover.cs @@ -33,7 +33,7 @@ public override double[] Crossover( int nParams = searchSpaceBounds.GetLength(0); // masks = (rng.rand(n_params) >= swapping_prob).astype(int) // child_params = parents_params[masks, range(n_params)] - var r = rng.rand(nParams).ToArray<double>(); + var r = NumPyDraws.Rand(rng, nParams); var child = new double[nParams]; for (int j = 0; j < nParams; j++) { diff --git a/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/VSBXCrossover.cs b/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/VSBXCrossover.cs index aee0095..846b38b 100644 --- a/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/VSBXCrossover.cs +++ b/src/OptunaSharp.Core/Samplers/Nsgaii/Crossovers/VSBXCrossover.cs @@ -1,5 +1,6 @@ using System; using NumSharp; +using OptunaSharp.Internal; namespace OptunaSharp.Samplers.Nsgaii; @@ -46,7 +47,7 @@ public override double[] Crossover( double eta = _eta ?? (study.IsMultiObjective() ? 20.0 : 2.0); const double eps = 1e-10; - var us = rng.rand(n).ToArray<double>(); + var us = NumPyDraws.Rand(rng, n); var beta1 = new double[n]; var beta2 = new double[n]; for (int j = 0; j < n; j++) @@ -59,7 +60,7 @@ public override double[] Crossover( var p1 = parentsParams[1]; var c1 = new double[n]; - double u1 = (double)rng.rand(); + double u1 = NumPyDraws.Rand(rng); for (int j = 0; j < n; j++) { c1[j] = u1 <= 0.5 @@ -68,7 +69,7 @@ public override double[] Crossover( } var c2 = new double[n]; - double u2 = (double)rng.rand(); + double u2 = NumPyDraws.Rand(rng); for (int j = 0; j < n; j++) { c2[j] = u2 <= 0.5 diff --git a/src/OptunaSharp.Core/Samplers/Nsgaii/Mutations/PolynomialMutation.cs b/src/OptunaSharp.Core/Samplers/Nsgaii/Mutations/PolynomialMutation.cs index 67da3f6..b3dbcb0 100644 --- a/src/OptunaSharp.Core/Samplers/Nsgaii/Mutations/PolynomialMutation.cs +++ b/src/OptunaSharp.Core/Samplers/Nsgaii/Mutations/PolynomialMutation.cs @@ -1,5 +1,6 @@ using System; using NumSharp; +using OptunaSharp.Internal; namespace OptunaSharp.Samplers.Nsgaii; @@ -27,7 +28,7 @@ public PolynomialMutation(double eta = 20.0) /// <inheritdoc /> public override double Mutation(double param, NumPyRandom rng, Study study, double[] searchSpaceBounds) { - double u = (double)rng.rand(); + double u = NumPyDraws.Rand(rng); double lb = searchSpaceBounds[0]; double ub = searchSpaceBounds[1]; double width = ub - lb; diff --git a/src/OptunaSharp.Core/Samplers/Nsgaii/NSGAIIChildGenerationStrategy.cs b/src/OptunaSharp.Core/Samplers/Nsgaii/NSGAIIChildGenerationStrategy.cs index 32e0c34..3ecb689 100644 --- a/src/OptunaSharp.Core/Samplers/Nsgaii/NSGAIIChildGenerationStrategy.cs +++ b/src/OptunaSharp.Core/Samplers/Nsgaii/NSGAIIChildGenerationStrategy.cs @@ -86,7 +86,7 @@ public NSGAIIChildGenerationStrategy( // We choose a child based on the specified crossover method. OrderedDict<string, object?> childParams; - if ((double)_rng.Rng.rand() < _crossoverProb) + if (NumPyDraws.Rand(_rng.Rng) < _crossoverProb) { childParams = NsgaiiCrossover.PerformCrossover( _crossover, study, parentPopulation, searchSpace, _rng.Rng, _swappingProb, dominates); @@ -94,8 +94,8 @@ public NSGAIIChildGenerationStrategy( else { int parentPopulationSize = parentPopulation.Count; - var parentParams = parentPopulation[(int)_rng.Rng.randint(0, parentPopulationSize)].ParamsDict; - childParams = new OrderedDict<string, object?>(); + var parentParams = parentPopulation[(int)NumPyDraws.RandInt(_rng.Rng, 0, parentPopulationSize)].Params; + childParams = new OrderedDict<string, object?>(searchSpace.Count); foreach (var name in searchSpace.Keys) childParams[name] = parentParams[name]; } @@ -103,10 +103,10 @@ public NSGAIIChildGenerationStrategy( int nParams = childParams.Count; double mutationProb = _mutationProb ?? 1.0 / Math.Max(1.0, nParams); - var @params = new OrderedDict<string, object?>(); + var @params = new OrderedDict<string, object?>(childParams.Count); foreach (var paramName in childParams.Keys) { - if ((double)_rng.Rng.rand() >= mutationProb) + if (NumPyDraws.Rand(_rng.Rng) >= mutationProb) { @params[paramName] = childParams[paramName]; } diff --git a/src/OptunaSharp.Core/Samplers/Nsgaii/NsgaiiCrossover.cs b/src/OptunaSharp.Core/Samplers/Nsgaii/NsgaiiCrossover.cs index f485a18..0783e8b 100644 --- a/src/OptunaSharp.Core/Samplers/Nsgaii/NsgaiiCrossover.cs +++ b/src/OptunaSharp.Core/Samplers/Nsgaii/NsgaiiCrossover.cs @@ -81,14 +81,14 @@ internal static class NsgaiiCrossover OrderedDict<string, BaseDistribution> numericalSearchSpace, SearchSpaceTransform? numericalTransform) { - var childParams = new OrderedDict<string, object?>(); + var childParams = new OrderedDict<string, object?>(categoricalSearchSpace.Count + numericalSearchSpace.Count); if (categoricalSearchSpace.Count > 0) { var catKeys = categoricalSearchSpace.Keys.ToList(); // parents_categorical_params = [[parents[0][p]...], [parents[-1][p]...]] (2 rows). - var parent0Cat = catKeys.Select(p => parents[0].ParamsDict[p]).ToArray(); - var parentLastCat = catKeys.Select(p => parents[^1].ParamsDict[p]).ToArray(); + var parent0Cat = catKeys.Select(p => parents[0].Params[p]).ToArray(); + var parentLastCat = catKeys.Select(p => parents[^1].Params[p]).ToArray(); var childCategorical = InlinedCategoricalUniformCrossover( parent0Cat, parentLastCat, rng, swappingProb, catKeys.Count); @@ -100,21 +100,18 @@ internal static class NsgaiiCrossover return childParams; // The following is applied only for numerical parameters. - var numKeys = numericalSearchSpace.Keys.ToList(); + // Optuna transforms each parent's numerical params ({p: parent.params[p] for p in numerical_search_space}). The + // transform reads exactly those names from the parent's own params, so it is given them directly: no per-parent + // dictionary copy and no NumSharp array per parent (plan 14), the same values in the same column order. var parentsNumerical = new double[parents.Count][]; for (int i = 0; i < parents.Count; i++) - { - var row = new OrderedDict<string, object?>(); - foreach (var k in numKeys) - row[k] = parents[i].ParamsDict[k]; - parentsNumerical[i] = numericalTransform.Transform(row).ToArray<double>(); - } + parentsNumerical[i] = numericalTransform.TransformValues(parents[i].Params); var childNumericalArray = crossover.Crossover( parentsNumerical, rng, study, numericalTransform.RawBounds); - // View the crossover child zero-copy; Untransform copies it out, so dispose here. - using NDArray childNd = np.array(childNumericalArray, copy: false); - var childNumericalParams = numericalTransform.Untransform(childNd); + // Read the crossover child as it is: the untransform Optuna applies, without wrapping the managed child in a + // NumSharp array first. + var childNumericalParams = numericalTransform.UntransformValues(childNumericalArray); foreach (var (k, v) in childNumericalParams) childParams[k] = v; @@ -135,11 +132,15 @@ private static List<FrozenTrial> SelectParents( NumPyRandom rng, Func<FrozenTrial, FrozenTrial, IReadOnlyList<StudyDirection>, bool> dominates) { - var parents = new List<FrozenTrial>(); + var parents = new List<FrozenTrial>(crossover.NParents); var selectedIds = new HashSet<int>(); for (int i = 0; i < crossover.NParents; i++) { - var remaining = parentPopulation.Where(t => !selectedIds.Contains(t.TrialId)).ToList(); + // Optuna's `[t for t in parent_population if t._trial_id not in parent_ids]`. Before the first pick nothing is + // excluded, so that list is the population itself, in its order: it is used as it is instead of being copied. + IReadOnlyList<FrozenTrial> remaining = selectedIds.Count == 0 + ? parentPopulation + : parentPopulation.Where(t => !selectedIds.Contains(t.TrialId)).ToList(); var parent = SelectParent(study, remaining, rng, dominates); parents.Add(parent); selectedIds.Add(parent.TrialId); @@ -160,8 +161,8 @@ private static FrozenTrial SelectParent( Func<FrozenTrial, FrozenTrial, IReadOnlyList<StudyDirection>, bool> dominates) { int populationSize = parentPopulation.Count; - var candidate0 = parentPopulation[(int)rng.randint(0, populationSize)]; - var candidate1 = parentPopulation[(int)rng.randint(0, populationSize)]; + var candidate0 = parentPopulation[(int)NumPyDraws.RandInt(rng, 0, populationSize)]; + var candidate1 = parentPopulation[(int)NumPyDraws.RandInt(rng, 0, populationSize)]; // TODO(ohta): Consider crowding distance. return dominates(candidate0, candidate1, study.Directions) ? candidate0 : candidate1; @@ -197,7 +198,7 @@ private static bool IsContained(OrderedDict<string, object?> @params, OrderedDic object?[] parent0, object?[] parentLast, NumPyRandom rng, double swappingProb, int nCategorical) { // masks = (rng.rand(n) >= swapping_prob).astype(int); child = parent_params[masks, range(n)]. - var r = rng.rand(nCategorical).ToArray<double>(); + var r = NumPyDraws.Rand(rng, nCategorical); var child = new object?[nCategorical]; for (int j = 0; j < nCategorical; j++) child[j] = r[j] >= swappingProb ? parentLast[j] : parent0[j]; diff --git a/src/OptunaSharp.Core/Samplers/Nsgaiii/NSGAIIIElitePopulationSelectionStrategy.cs b/src/OptunaSharp.Core/Samplers/Nsgaiii/NSGAIIIElitePopulationSelectionStrategy.cs index d2fb720..5b97309 100644 --- a/src/OptunaSharp.Core/Samplers/Nsgaiii/NSGAIIIElitePopulationSelectionStrategy.cs +++ b/src/OptunaSharp.Core/Samplers/Nsgaiii/NSGAIIIElitePopulationSelectionStrategy.cs @@ -22,13 +22,18 @@ namespace OptunaSharp.Samplers.Nsgaiii; /// <para><b>Bit-exact.</b> The whole pipeline matches Optuna bit-for-bit: <c>_filter_inf</c>, /// the ideal-point subtraction, the ASF <c>einsum</c>/argmin extreme-point pick, the /// reference-point association (numpy's 4-operand <c>einsum</c> replicated term-by-term, verified -/// bit-identical over 2000 cases), the niching, and — since 2.15 — the hyperplane fit itself: the +/// bit-identical over 2000 cases; its two <c>np.linalg.norm(axis=...)</c> calls and the axis +/// <c>argmin</c>/<c>min</c> run through NumSharp, so the row sums take NumPy's pairwise order from +/// eight objectives on — before 2026-11-11 they were left-to-right sums, exact only up to seven +/// objectives), the niching, and — since 2.15 — the hyperplane fit itself: the /// degeneracy <see cref="LinAlg.MatrixRank" /> branch and the <see cref="LinAlg.Solve" /> route /// through NumSharp's <c>np.linalg.matrix_rank</c>/<c>solve</c> over the OpenBLAS LAPACK backend, /// which is byte-identical to NumPy (the earlier managed reciprocal-multiplier LU drifted ~1 ULP /// on a few percent of the extreme-point systems; the LAPACK route removes even that). Every RNG /// draw (<c>rng.shuffle</c>) stays in lock-step. Confirmed byte-for-byte over a 400-config -/// differential (5 crossovers × {2,3,4} objectives × 25 seeds + 25 constrained).</para> +/// differential (5 crossovers × {2,3,4} objectives × 25 seeds + 25 constrained); the many-objective +/// regime (8 and 10 objectives) is pinned by the live +/// <c>NsgaiiiSamplerParityTests.ManyObjectives_FullState_IsBitIdentical</c>.</para> /// </summary> public class NSGAIIIElitePopulationSelectionStrategy { @@ -298,9 +303,35 @@ private static List<int[]> CombinationsWithReplacement(int n, int r) /// Python <c>_associate_individuals_with_reference_points</c>: the closest reference point to /// each individual and that Euclidean (perpendicular) distance. /// </summary> - /// <param name="objectiveMatrix">Objective vectors with one individual per row.</param> + /// <param name="objectiveMatrix">Normalized objective vectors with one individual per row.</param> /// <param name="referencePoints">Reference vectors, one row per point and one column per objective.</param> - /// <returns>Nearest reference-point indices and perpendicular distances for each individual.</returns> + /// <returns> + /// For each individual, the index of the reference line closest to it and the distance to that line. A row + /// with a NaN distance reports the first NaN's line and NaN, as <c>np.argmin</c> / <c>np.min</c> do. + /// </returns> + /// <remarks> + /// <para> + /// Same statements as Optuna's, so the bits follow NumPy at every objective count. The two norms and the + /// axis-1 <c>argmin</c> / <c>min</c> are NumSharp's: a row norm over the last axis sums the squares in + /// NumPy's pairwise order, which from eight objectives on is not a left-to-right sum (the former loop + /// matched NumPy up to seven objectives and missed every distance from eight on, measured 2026-11-11 + /// over 54 random cases), and the axis argmin / min let a NaN distance win the row as in NumPy, where a + /// strict <c><</c> loop skipped it. A 10-objective NSGA-III run (population 20, seed 0) left + /// Optuna's trajectory at trial 100 before this. + /// </para> + /// <para> + /// The 4-operand <c>einsum("ni,pi,p,pm->npm")</c> stays a hand port: NumPy's default <c>c_einsum</c> + /// accumulates <c>((a·b)·c)·d</c> over <c>i</c> term by term, which the loop reproduces bit for bit, + /// where NumSharp's <c>np.einsum</c> folds the operands pairwise through matrix products (the + /// <c>optimize=</c> path) and matched NumPy in none of the 54 cases. Cost: one (individuals × reference + /// points × objectives) tensor per generation, as in Optuna (about 15 ms at 200 individuals, 220 + /// reference points and 10 objectives). + /// </para> + /// <para> + /// The caller (<see cref="Select" />) has already checked that the reference points have one column per + /// objective, with Optuna's <c>ValueError</c>. + /// </para> + /// </remarks> private static (int[] Closest, double[] Distance) AssociateIndividualsWithReferencePoints( double[,] objectiveMatrix, double[,] referencePoints) { @@ -308,45 +339,44 @@ private static (int[] Closest, double[] Distance) AssociateIndividualsWithRefere int m = objectiveMatrix.GetLength(1); int r = referencePoints.GetLength(0); - // 1 / (norm(reference_points, axis=1) ** 2) — note norm then square (sqrt(s)**2 != s exactly). - var inv = new double[r]; + // reference_point_norm_squared = np.linalg.norm(reference_points, axis=1) ** 2, then its reciprocal. The norm is + // rounded before it is squared (sqrt(s) ** 2 is not s in float64), as in Optuna. + double[] inverseNormSquared; + using (NDArray referenceArray = np.array(referencePoints)) + using (NDArray referenceNorms = np.linalg.norm(referenceArray, axis: 1)) + inverseNormSquared = referenceNorms.ToArray<double>(); for (int q = 0; q < r; q++) - { - double s = 0.0; - for (int j = 0; j < m; j++) s += referencePoints[q, j] * referencePoints[q, j]; - double t = Math.Sqrt(s); - inv[q] = 1.0 / (t * t); - } + inverseNormSquared[q] = 1.0 / (inverseNormSquared[q] * inverseNormSquared[q]); - var closest = new int[p]; - var distance = new double[p]; + // objective_matrix[:, np.newaxis, :] - perpendicular_vectors_to_reference_lines, where the perpendicular vectors + // are einsum("ni,pi,p,pm->npm", objective_matrix, reference_points, 1 / norm_squared, reference_points): each + // element is c_einsum's left-to-right sum over i of ((obj[n,i] * ref[q,i]) * inv[q]) * ref[q,k]. + var differences = new double[p, r, m]; for (int n = 0; n < p; n++) { - int best = 0; - double bestDist = double.NaN; - bool first = true; for (int q = 0; q < r; q++) { - // dist = norm(obj_n - perp_{n,q}); perp_{n,q,k} matches numpy's 4-operand - // einsum("ni,pi,p,pm->npm") accumulated term-by-term (bit-exact, verified). - double s = 0.0; for (int k = 0; k < m; k++) { - double perp = 0.0; + double perpendicular = 0.0; for (int i = 0; i < m; i++) - perp += objectiveMatrix[n, i] * referencePoints[q, i] * inv[q] * referencePoints[q, k]; - double diff = objectiveMatrix[n, k] - perp; - s += diff * diff; + perpendicular += objectiveMatrix[n, i] * referencePoints[q, i] * inverseNormSquared[q] * referencePoints[q, k]; + differences[n, q, k] = objectiveMatrix[n, k] - perpendicular; } - double dist = Math.Sqrt(s); - // np.argmin / np.min keep the FIRST minimum on ties (strict <). - if (first || dist < bestDist) { bestDist = dist; best = q; first = false; } } - closest[n] = best; - distance[n] = bestDist; } - return (closest, distance); + // distance_from_reference_lines = np.linalg.norm(differences, axis=2); then np.argmin and np.min along axis 1, + // which keep the first minimum on ties and let the first NaN win a row. + using NDArray differenceArray = np.array(differences); + using NDArray distances = np.linalg.norm(differenceArray, axis: 2); + using NDArray closestArray = np.argmin(distances, axis: 1); + using NDArray distanceArray = np.amin(distances, axis: 1); + long[] closestIndices = closestArray.ToArray<long>(); + var closest = new int[p]; + for (int n = 0; n < p; n++) + closest[n] = (int)closestIndices[n]; + return (closest, distanceArray.ToArray<double>()); } /// <summary> @@ -428,12 +458,12 @@ private List<FrozenTrial> PreserveNicheIndividuals( } else if (count == 0) { - // list.sort(reverse=True) on (distance, index) tuples (index is unique -> total order). - borderline.Sort((x, y) => - { - int c = y.Distance.CompareTo(x.Distance); - return c != 0 ? c : y.Index.CompareTo(x.Index); - }); + // list.sort(reverse=True) on (distance, index) tuples, through CPython's own sort: a NaN distance (a front + // with no finite value in some objective makes _filter_inf return NaN) compares neither smaller nor + // larger than anything, so only CPython's exact sequence of comparisons reproduces where such pairs end + // up; a comparer treating NaN as equal reversed an all-NaN front, and pop() then took the other pair + // (QA-56). + PyListSort.Sort(borderline, DistanceIndexLessThan, reverse: true); } var selected = borderline[^1]; @@ -446,6 +476,19 @@ private List<FrozenTrial> PreserveNicheIndividuals( return additionalElitePopulation; } + /// <summary> + /// CPython's <c><</c> on <c>(np.float64 distance, int index)</c> tuples, as <c>_preserve_niche_individuals</c> + /// sorts them: equal distances compare by index; otherwise the distances compare, and a NaN distance is never + /// less and never greater (each tuple holds its own float64 object, so two NaNs are not even identical). + /// </summary> + /// <param name="x">The left tuple.</param> + /// <param name="y">The right tuple.</param> + /// <returns>Whether <paramref name="x" /> < <paramref name="y" /> in Python.</returns> + internal static bool DistanceIndexLessThan((double Distance, int Index) x, (double Distance, int Index) y) + // Tuple comparison: the first unequal element decides. `nan == nan` is False, so a NaN distance decides, and + // `nan < v` / `v < nan` are False. + => x.Distance == y.Distance ? x.Index < y.Index : x.Distance < y.Distance; + /// <summary>Python <c>defaultdict(list)</c> access: auto-create the bucket for a missing key.</summary> /// <param name="dict">Dictionary mapping niche identifiers to mutable element lists.</param> /// <param name="key">Niche identifier whose element list is requested.</param> diff --git a/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/ConditionalParams.cs b/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/ConditionalParams.cs index 3181cbc..3479072 100644 --- a/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/ConditionalParams.cs +++ b/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/ConditionalParams.cs @@ -378,10 +378,10 @@ private sealed record LatentEntry( { foreach (var name in _rules.Keys) { - if (trial.ParamsDict.TryGetValue(name, out var active)) + if (trial.Params.TryGetValue(name, out var active)) latent[name] = active; } - if (trial.SystemAttrsDict.TryGetValue(DormantAttrKey, out var raw) && raw is not null) + if (trial.SystemAttrs.TryGetValue(DormantAttrKey, out var raw) && raw is not null) { foreach (var (name, value) in CoerceDormant(raw)) { @@ -496,8 +496,8 @@ private bool ShouldKeep( { foreach (var name in Order) { - bool present = trial.ParamsDict.ContainsKey(name); - bool active = IsActive(name, trial.ParamsDict); + bool present = trial.Params.ContainsKey(name); + bool active = IsActive(name, trial.Params); if (present == active) continue; yield return (name, present diff --git a/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/NsgaiiiCptChildGenerationStrategy.cs b/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/NsgaiiiCptChildGenerationStrategy.cs index 10c706d..52df591 100644 --- a/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/NsgaiiiCptChildGenerationStrategy.cs +++ b/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/NsgaiiiCptChildGenerationStrategy.cs @@ -110,7 +110,7 @@ public NsgaiiiCptChildGenerationStrategy( else { int parentPopulationSize = parentPopulation.Count; - var parentParams = parentPopulation[(int)_rng.Rng.randint(0, parentPopulationSize)].ParamsDict; + var parentParams = parentPopulation[(int)_rng.Rng.randint(0, parentPopulationSize)].Params; childParams = new OrderedDict<string, object?>(); if (_conditionalParams is null) { diff --git a/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/NsgaiiiCptCrossover.cs b/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/NsgaiiiCptCrossover.cs index 2b18507..5b03ad5 100644 --- a/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/NsgaiiiCptCrossover.cs +++ b/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/NsgaiiiCptCrossover.cs @@ -116,8 +116,8 @@ internal static class NsgaiiiCptCrossover if (categoricalSearchSpace.Count > 0) { - var first = parents[0].ParamsDict; - var last = parents[^1].ParamsDict; + var first = parents[0].Params; + var last = parents[^1].Params; var shared = categoricalSearchSpace.Keys.Where(k => first.ContainsKey(k) && last.ContainsKey(k)).ToList(); var crossed = shared.Count == 0 ? Array.Empty<object?>() @@ -150,7 +150,7 @@ internal static class NsgaiiiCptCrossover // so letting it consume RNG would make deactivation perturb the other parameters' math. if (conditionalParams.ResolveActive(key, childParams) == false) continue; - var carriers = parents.Where(p => p.ParamsDict.ContainsKey(key)).ToList(); + var carriers = parents.Where(p => p.Params.ContainsKey(key)).ToList(); if (carriers.Count == parents.Count) common[key] = distribution; else if (carriers.Count > 0) @@ -166,7 +166,7 @@ internal static class NsgaiiiCptCrossover { var row = new OrderedDict<string, object?>(); foreach (var key in common.Keys) - row[key] = parents[i].ParamsDict[key]; + row[key] = parents[i].Params[key]; parentsNumerical[i] = transform.Transform(row).ToArray<double>(); } @@ -185,7 +185,7 @@ internal static class NsgaiiiCptCrossover else if (partialCarriers.TryGetValue(key, out var carriers)) { var carrier = carriers.Count == 1 ? carriers[0] : carriers[(int)rng.randint(0, carriers.Count)]; - childParams[key] = carrier.ParamsDict[key]; + childParams[key] = carrier.Params[key]; } } diff --git a/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/NsgaiiiCptSearchSpace.cs b/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/NsgaiiiCptSearchSpace.cs index 47a4cdb..4fd4811 100644 --- a/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/NsgaiiiCptSearchSpace.cs +++ b/src/OptunaSharp.Core/Samplers/NsgaiiiCpt/NsgaiiiCptSearchSpace.cs @@ -182,14 +182,14 @@ internal static (OrderedDict<string, BaseDistribution>? SearchSpace, int NextCac if (searchSpace is null) { - searchSpace = new OrderedDict<string, BaseDistribution>(trial.DistributionsDict); + searchSpace = new OrderedDict<string, BaseDistribution>(trial.Distributions); continue; } var next = new OrderedDict<string, BaseDistribution>(); foreach (var (name, distribution) in searchSpace) { - if (trial.DistributionsDict.TryGetValue(name, out var trialDist)) + if (trial.Distributions.TryGetValue(name, out var trialDist)) { if (trialDist.Equals(distribution)) next[name] = distribution; @@ -201,7 +201,7 @@ internal static (OrderedDict<string, BaseDistribution>? SearchSpace, int NextCac next[name] = distribution; // Absent because inactive — the expected case. } } - foreach (var (name, distribution) in trial.DistributionsDict) + foreach (var (name, distribution) in trial.Distributions) { if (!conditionalParams.IsConditional(name) || next.ContainsKey(name) || excluded.Contains(name)) continue; diff --git a/src/OptunaSharp.Core/Samplers/OpenAiEsSampler.cs b/src/OptunaSharp.Core/Samplers/OpenAiEsSampler.cs index af11ec2..77f9ff5 100644 --- a/src/OptunaSharp.Core/Samplers/OpenAiEsSampler.cs +++ b/src/OptunaSharp.Core/Samplers/OpenAiEsSampler.cs @@ -147,12 +147,32 @@ private protected override string SerializeOptimizer(IEvolutionStrategyOptimizer /// <exception cref="System.NotSupportedException">The serialized optimizer tag is not this sampler's tag.</exception> /// <exception cref="System.Text.Json.JsonException">The persisted payload is not valid JSON for the state type, or is the literal null.</exception> /// <exception cref="System.ArgumentOutOfRangeException">The stored text has no <c><tag>\n</c> line.</exception> + /// <remarks>Parses the JSON only when the text differs from the last one parsed (<see cref="_parsedState" />); a new optimizer is built from the state every time.</remarks> private protected override IEvolutionStrategyOptimizer DeserializeOptimizer(string optimizerStr) { + // The same stored text as the last parse: the same state, without parsing the JSON again (see _parsedState). + // The whole text, tag included, is the key, so a hit has passed the tag check before. + if (_parsedState is { } parsed && string.Equals(parsed.Text, optimizerStr, System.StringComparison.Ordinal)) + return OpenEsOptimizer.FromState(parsed.State); + int nl = optimizerStr.IndexOf('\n'); string tag = optimizerStr[..nl]; if (tag != Tag) throw new System.NotSupportedException($"Unexpected optimizer state tag '{tag}' for OpenAiEsSampler."); - return OpenEsOptimizer.FromState(OptimizerStateJson.Deserialize<OpenEsState>(optimizerStr[(nl + 1)..])); + OpenEsState state = OptimizerStateJson.Deserialize<OpenEsState>(optimizerStr[(nl + 1)..]); + _parsedState = (optimizerStr, state); + return OpenEsOptimizer.FromState(state); } + + /// <summary> + /// The last stored optimizer text this instance parsed, and the state parsed from it (plan 15, as + /// <c>DifferentialEvolutionSampler</c> keeps it): the text changes once per generation, and every ask in between + /// parsed the same JSON again. Guarded by the sampler's monitor, like every hook; a per-worker instance has its + /// own. + /// </summary> + /// <remarks> + /// Safe to share across asks because FromState never changes the state it reads: the <see cref="OpenEsOptimizer" /> constructor clones the mean, FromState clones both Adam moment vectors, and the rest are numbers. A parse that throws + /// stores nothing, so the next ask parses (and throws) again, as before. + /// </remarks> + private (string Text, OpenEsState State)? _parsedState; } diff --git a/src/OptunaSharp.Core/Samplers/ParticleSwarm/Pso.cs b/src/OptunaSharp.Core/Samplers/ParticleSwarm/Pso.cs index e7fce7e..8375144 100644 --- a/src/OptunaSharp.Core/Samplers/ParticleSwarm/Pso.cs +++ b/src/OptunaSharp.Core/Samplers/ParticleSwarm/Pso.cs @@ -7,8 +7,9 @@ // Yuhui Shi and Russell Eberhart. "A Modified Particle Swarm Optimizer." Proc. IEEE Congress on // Evolutionary Computation, 1998 — the linearly-decreasing inertia weight (LDIW) used here. // -// PSO has no `cmaes`/Optuna/OptunaHub counterpart, so — like `De`/`LmCma` — this is a native, -// textbook-faithful implementation validated by convergence, with no upstream trajectory to bit-match. +// PSO has no `cmaes`/Optuna counterpart; OptunaHub's `samplers/pso` is another PSO this one does not follow +// (see `PsoSampler`), so — like `De`/`LmCma` — this is a native, textbook-faithful implementation validated by +// convergence, with no upstream trajectory to bit-match. // The RNG is NumSharp's MT19937 `RandomState` (the project's "never System.Random" discipline). The // optimizer works in the transformed unit box [0,1]^d: the velocity/position updates never clamp, so a // bounded caller (`PsoSampler`) clamps each asked candidate to the box itself, and the next `Tell` diff --git a/src/OptunaSharp.Core/Samplers/PsoSampler.cs b/src/OptunaSharp.Core/Samplers/PsoSampler.cs index 8b649af..3c19133 100644 --- a/src/OptunaSharp.Core/Samplers/PsoSampler.cs +++ b/src/OptunaSharp.Core/Samplers/PsoSampler.cs @@ -10,8 +10,11 @@ // protocol, following the `DifferentialEvolutionSampler` idiom exactly: the optimizer state is serialized // into trial system attrs (so a PSO study resumes across process boundaries / distributed workers), each // trial re-seeds the optimizer and asks a single candidate, and every asked candidate is clamped to the -// transformed unit box. PSO is NOT part of the Optuna ecosystem (no `cmaes` class, no Optuna sampler, no -// OptunaHub package), so — like `DifferentialEvolutionSampler` / `LmCmaSampler` — this is a native +// transformed unit box. Optuna itself has no PSO sampler (and `cmaes` no PSO class). OptunaHub has one +// (`samplers/pso`, `PSOSampler`, since 2025-09), but this port follows Kennedy & Eberhart with Shi & +// Eberhart's decreasing inertia, not that package, so parameters, defaults and seeded trajectories differ +// (the map is in the class remarks; QA-70 of docs/qa/PARITY_QA_2026-11-10.md, where the owner chose on +// 2026-11-12 to keep this port). Like `DifferentialEvolutionSampler` / `LmCmaSampler` it is a native // implementation validated by convergence, with no upstream trajectory to bit-match. Plan 07 baseline. using System; @@ -53,6 +56,21 @@ namespace OptunaSharp.Samplers; /// <c>wMin</c> over <c>inertiaDecayGenerations</c> generations (constant at <c>wMin</c> thereafter). /// Categorical parameters and single-value distributions are handled by the independent sampler, as in /// <see cref="CmaEsSampler" />.</para> +/// +/// <para><b>Not OptunaHub's <c>PSOSampler</c>.</b> OptunaHub's <c>samplers/pso</c> is another PSO, with a +/// constant inertia, which this class does not follow, so a study moved over from it gets other defaults and +/// other trials (registry pinned in <c>refs/optunahub-registry</c>):</para> +/// <list type="table"> +/// <listheader><term>OptunaHub <c>PSOSampler</c></term><description>This class</description></listheader> +/// <item><term><c>n_particles=10</c></term><description><c>popsize</c>: <c>max(10, 4 + ⌊3 ln d⌋)</c></description></item> +/// <item><term><c>inertia=0.5</c>, constant</term><description><c>w = 0.9</c> decreasing linearly to +/// <c>wMin = 0.4</c> over <c>inertiaDecayGenerations = 100</c></description></item> +/// <item><term><c>cognitive=1.5</c>, <c>social=1.5</c></term><description><c>c1 = c2 = 1.49445</c></description></item> +/// <item><term>velocity clamped to the full range of each parameter</term><description><c>maxVelocityRate = 0.2</c> +/// of the unit box</description></item> +/// <item><term><c>search_space</c>, <c>seed</c></term><description><c>seed</c>; the search space is inferred; plus +/// <c>nStartupTrials</c>, <c>independentSampler</c>, <c>warnIndependentSampling</c></description></item> +/// </list> /// </summary> /// <example> /// <code> @@ -213,7 +231,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S var solutions = new List<(double[] X, double Value)>(optimizer.PopulationSize); foreach (var t in solutionTrials.Take(optimizer.PopulationSize)) { - double[] x = trans.Transform(t.ParamsDict).ToArray<double>(); + double[] x = trans.Transform(t.Params).ToArray<double>(); double y = study.Direction == StudyDirection.Minimize ? t.Value!.Value : -t.Value!.Value; solutions.Add((x, y)); } @@ -295,7 +313,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S { if (t.Value is null) continue; double[] x; - try { x = trans.Transform(t.ParamsDict).ToArray<double>(); } + try { x = trans.Transform(t.Params).ToArray<double>(); } catch (Exception) { continue; } if (x.Length != nDim) continue; pop.Add(x); @@ -350,27 +368,50 @@ private static Dictionary<string, string> SplitOptimizerStr(string optimizerStr) private static string SerializeOptimizer(Pso optimizer) => "pso\n" + OptimizerStateJson.Serialize(optimizer.ToState()); + /// <summary> + /// The last stored optimizer text this instance parsed, and the state parsed from it (plan 15, as + /// <c>DifferentialEvolutionSampler</c> keeps it): the text changes once per generation, and every ask in between + /// parsed the same JSON again. Guarded by the sampler's monitor, like every hook; a per-worker instance has its + /// own. + /// </summary> + /// <remarks> + /// Safe to share across asks because FromState never changes the state it reads: the <see cref="Pso" /> constructor clones the positions and values it is given, and FromState then assigns fresh clones of every evolving array. A parse that throws + /// stores nothing, so the next ask parses (and throws) again, as before. + /// </remarks> + private (string Text, PsoState State)? _parsedState; + /// <summary>Decodes a persisted optimizer tag and reconstructs its matching state type.</summary> /// <param name="optimizerStr">Tagged serialized optimizer state, after any chunk reassembly.</param> - /// <returns>The optimizer reconstructed from the tagged state.</returns> + /// <returns>A new optimizer reconstructed from the tagged state; the caller may change it freely.</returns> /// <exception cref="System.NotSupportedException">The serialized optimizer tag is unknown.</exception> /// <exception cref="System.Text.Json.JsonException">The persisted optimizer payload is not valid JSON for its state type, or is the literal null.</exception> /// <exception cref="System.ArgumentException">The decoded state contains invalid optimizer constructor settings.</exception> /// <exception cref="System.ArgumentOutOfRangeException">The stored text has no <c><tag>\n</c> line.</exception> - private static Pso DeserializeOptimizer(string optimizerStr) + /// <remarks>Parses the JSON only when the text differs from the last one parsed (<see cref="_parsedState" />); a new optimizer is built from the state every time.</remarks> + private Pso DeserializeOptimizer(string optimizerStr) { + // The same stored text as the last parse: the same state, without parsing the JSON again (see _parsedState). + // The whole text, tag included, is the key, so a hit has passed the tag check before. + if (_parsedState is { } parsed && string.Equals(parsed.Text, optimizerStr, StringComparison.Ordinal)) + return Pso.FromState(parsed.State); + int nl = optimizerStr.IndexOf('\n'); string tag = optimizerStr[..nl]; string json = optimizerStr[(nl + 1)..]; if (tag != "pso") throw new NotSupportedException($"Unknown optimizer state tag '{tag}'."); - return Pso.FromState(OptimizerStateJson.Deserialize<PsoState>(json)); + PsoState state = OptimizerStateJson.Deserialize<PsoState>(json); + _parsedState = (optimizerStr, state); + return Pso.FromState(state); } /// <summary>Finds the newest stored optimizer snapshot in completed trial history.</summary> /// <param name="completedTrials">Completed trial snapshots used as historical observations.</param> /// <returns>The newest available optimizer, or null when no stored snapshot exists.</returns> - private static Pso? RestoreOptimizer(List<FrozenTrial> completedTrials) + /// <exception cref="System.NotSupportedException">The newest stored snapshot carries an unknown optimizer tag.</exception> + /// <exception cref="System.Text.Json.JsonException">The newest stored snapshot's payload is not valid JSON for the state type.</exception> + /// <exception cref="System.ArgumentException">The decoded state contains invalid optimizer constructor settings.</exception> + private Pso? RestoreOptimizer(List<FrozenTrial> completedTrials) { for (int idx = completedTrials.Count - 1; idx >= 0; idx--) { @@ -421,8 +462,10 @@ private void LogIndependentSampling(FrozenTrial trial, string paramName) /// <returns>Trial snapshots eligible for the sampler history.</returns> private List<FrozenTrial> GetTrials(Study study) { - var completeTrials = new List<FrozenTrial>(); - foreach (var t in study.GetTrialsInternal(deepcopy: false, states: null, useCache: true)) + List<FrozenTrial> all = study.GetTrialsInternal(deepcopy: false, states: null, useCache: true); + // Sized for the whole history (plan 15): nearly every trial is complete, so the list never regrows on an ask. + var completeTrials = new List<FrozenTrial>(all.Count); + foreach (var t in all) if (t.State == TrialState.Complete) completeTrials.Add(t); return completeTrials; diff --git a/src/OptunaSharp.Core/Samplers/QMCSampler.cs b/src/OptunaSharp.Core/Samplers/QMCSampler.cs index 22ad709..6c2304d 100644 --- a/src/OptunaSharp.Core/Samplers/QMCSampler.cs +++ b/src/OptunaSharp.Core/Samplers/QMCSampler.cs @@ -3,6 +3,7 @@ using System.Linq; using System.Security.Cryptography; using System.Text; +using System.Threading; using NumSharp; using OptunaSharp.Collections; using OptunaSharp.Distributions; @@ -36,6 +37,35 @@ public class QMCSampler : BaseSampler private readonly bool _scramble; private readonly long _seed; + + /// <summary>The names of the search space <see cref="_lastKeyQmcId" /> was computed for, in order (plan 14).</summary> + private string[]? _lastKeyNames; + + /// <summary>The distribution objects of that search space, compared by reference.</summary> + private BaseDistribution[]? _lastKeyDistributions; + + /// <summary>The last sample-id attribute key computed; <see langword="null" /> before the first relative sample.</summary> + private string? _lastKeyQmcId; + + /// <summary> + /// The scrambled Sobol' sequence of this sampler's seed for the last dimension asked for (plan 15), or + /// <see langword="null" /> before the first scrambled Sobol' sample. + /// </summary> + /// <remarks> + /// Optuna rebuilds <c>qmc.Sobol(d, seed)</c> and fast-forwards it on every trial; the port used to do the same, + /// re-drawing the scramble and generating every point up to <c>sample_id</c>, which made a study O(n²). The + /// sequence is a pure function of <c>(d, seed)</c> and the seed never changes, so the engine is built once per + /// dimension and each point is computed directly. Read and written with <see cref="Volatile" />: the engine is + /// immutable, so concurrent trials may share it, and a race only builds an equal engine twice. + /// </remarks> + private ScrambledSobol.Engine? _scrambledSobol; + + /// <summary> + /// The scrambled Halton sequence of this sampler's seed for the last dimension asked for (plan 15), or + /// <see langword="null" /> before the first scrambled Halton sample. Kept for the same reason as + /// <see cref="_scrambledSobol" />: its digit permutations were re-drawn on every trial. + /// </summary> + private ScrambledHalton.Engine? _scrambledHalton; private readonly BaseSampler _independentSampler; private readonly bool _warnIndependentSampling; private readonly string _qmcType; @@ -87,12 +117,38 @@ public QMCSampler( /// <inheritdoc /> public override void ReseedRng() => _independentSampler.ReseedRng(); + /// <summary> + /// The study's lowest-numbered COMPLETE or PRUNED trial, or null when there is none: what Optuna reads as + /// <c>sorted(past_trials, key=lambda t: t.number)[0]</c> after + /// <c>study._get_trials(deepcopy=False, states=(COMPLETE, PRUNED), use_cache=True)</c>. + /// </summary> + /// <param name="study">The study being sampled.</param> + /// <returns>The first finished-and-suggested trial in number order, or null.</returns> + /// <remarks> + /// Reads through <see cref="Study.GetTrialsForSampler" /> and stops at the first match (Rustuna plan 13, item S3): + /// the history is in number order, so the first match is the minimum. On an in-memory storage that read is the + /// zero-copy view and the first trial is usually the answer, so an ask costs O(1) instead of a copy and a sort + /// of the whole history; elsewhere it is Optuna's read, cache included. + /// </remarks> + private static FrozenTrial? FirstSuggestedTrial(Study study) + { + foreach (FrozenTrial past in study.GetTrialsForSampler(useCache: true)) + { + if (Array.IndexOf(SuggestedStates, past.State) >= 0) + return past; + } + return null; + } + /// <inheritdoc /> public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(Study study, FrozenTrial trial) { - var pastTrials = study.GetTrialsInternal(deepcopy: false, states: SuggestedStates, useCache: true); + // Optuna takes past_trials = every COMPLETE or PRUNED trial, then the first of them by number. The history is + // in number order, so that is the first such trial met, and the scan stops there (plan 13, item S3): the copied + // and sorted history made each ask of a long QMC study O(n log n) for one record. + FrozenTrial? firstTrial = FirstSuggestedTrial(study); // The initial trial is sampled by the independent sampler. - if (pastTrials.Count == 0) + if (firstTrial is null) { var pendingTrials = study.GetTrialsInternal( deepcopy: false, states: new[] { TrialState.Running }, useCache: true); @@ -103,7 +159,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S HashSet<string>? intersectionKeys = null; foreach (var t in pendingTrials) { - var space = t.DistributionsDict; + var space = t.Distributions; foreach (var (name, dist) in space) unionSearchSpace[name] = dist; if (intersectionKeys is null) @@ -120,9 +176,9 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S } // If an initial trial was already made, construct the search space from the first trial. - var firstTrial = pastTrials.OrderBy(t => t.Number).First(); - var result = new OrderedDict<string, BaseDistribution>(); - foreach (var (name, dist) in firstTrial.DistributionsDict) + var firstDistributions = firstTrial.Distributions; + var result = new OrderedDict<string, BaseDistribution>(firstDistributions.Count); + foreach (var (name, dist) in firstDistributions) result[name] = dist; return result; } @@ -131,7 +187,8 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S public override object? SampleIndependent( Study study, FrozenTrial trial, string paramName, BaseDistribution paramDistribution) { - if (study.GetTrialsInternal(deepcopy: false, states: SuggestedStates, useCache: true).Count > 0) + // Optuna asks whether any trial is COMPLETE or PRUNED; the first one found answers it (plan 13, item S3). + if (FirstSuggestedTrial(study) is not null) { if (_warnIndependentSampling) LogIndependentSampling(trial, paramName); @@ -151,7 +208,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S // [0, C), and int(value) (a floor, since the engines emit values in [0, 1)) gives a uniform // choice index in [0, C - 1]. IntDistribution would round to nearest and bias the boundaries. var categoricalSpace = new OrderedDict<string, CategoricalDistribution>(); - var combined = new OrderedDict<string, BaseDistribution>(); + var combined = new OrderedDict<string, BaseDistribution>(searchSpace.Count); foreach (var (name, dist) in searchSpace) { if (dist is CategoricalDistribution cat) @@ -167,11 +224,10 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S double[] qmcPoint = SampleQmc(study, searchSpace); var trans = new SearchSpaceTransform(combined, transform01: true); - // View the QMC point zero-copy; Untransform copies it into a managed dict, so dispose here. - using NDArray nd = np.array(qmcPoint, copy: false); - var sample = trans.Untransform(nd); + // Untransform the managed point as it is: Optuna's trans.untransform(sample), without a NumSharp copy. + var sample = trans.UntransformValues(qmcPoint); - var result = new OrderedDict<string, object?>(); + var result = new OrderedDict<string, object?>(sample.Count); foreach (var (name, value) in sample) { if (categoricalSpace.TryGetValue(name, out var cat)) @@ -204,22 +260,31 @@ private double[] SampleQmc(Study study, OrderedDict<string, BaseDistribution> se if (!_scramble) return QuasiMonteCarlo.SobolPoint(d, (ulong)sampleId); // Scrambled Sobol': `Sobol(d, seed, scramble=True).fast_forward(sample_id).random(1)` is the - // point at index sample_id of the scrambled sequence (verified bit-exact vs scipy). The - // engine is stateless here — reconstructed per call from (d, seed) — so parallel trials need - // no lock (the sample_id counter itself is already serialized through the storage attr). - double[,] pts = ScrambledSobol.Random(d, sampleId + 1, (int)_seed); - var row = new double[d]; - for (int j = 0; j < d; j++) - row[j] = pts[sampleId, j]; - return row; + // point at index sample_id of the scrambled sequence (verified bit-exact vs scipy). The engine is + // a pure function of (d, seed), so it is built once and kept (plan 15); it is immutable, so + // parallel trials need no lock (the sample_id counter itself is already serialized through the + // storage attr). + ScrambledSobol.Engine? sobol = Volatile.Read(ref _scrambledSobol); + if (sobol is null || sobol.Dim != d) + { + sobol = ScrambledSobol.Create(d, (int)_seed); + Volatile.Write(ref _scrambledSobol, sobol); + } + return sobol.Point((ulong)sampleId); } // Halton. if (!_scramble) return QuasiMonteCarlo.HaltonPoint(d, (ulong)sampleId); // Scrambled Halton: `Halton(d, seed, scramble=True).fast_forward(sample_id).random(1)` is the // Owen-permuted point at index sample_id (verified bit-exact vs scipy). Like scrambled Sobol' the - // engine is stateless — rebuilt per call from (d, seed) — and permutation init is its only rng draw. - return ScrambledHalton.Point(d, (ulong)sampleId, (int)_seed); + // engine is a pure function of (d, seed) — permutation init is its only rng draw — so it is kept. + ScrambledHalton.Engine? halton = Volatile.Read(ref _scrambledHalton); + if (halton is null || halton.Dim != d) + { + halton = ScrambledHalton.Create(d, (int)_seed); + Volatile.Write(ref _scrambledHalton, halton); + } + return halton.Point((ulong)sampleId); } /// <summary>Python <c>_find_sample_id</c>: a per-(engine, search space[, seed]) counter in the study attrs.</summary> @@ -228,8 +293,52 @@ private double[] SampleQmc(Study study, OrderedDict<string, BaseDistribution> se /// <returns>The sequence index allocated to this trial.</returns> private int FindSampleId(Study study, OrderedDict<string, BaseDistribution> searchSpace) { + string keyQmcId = QmcIdKey(searchSpace); + + var studyAttrs = study.Storage.GetStudySystemAttrs(study.StudyId); + int sampleId = (studyAttrs.TryGetValue(keyQmcId, out var v) && v is not null + ? Convert.ToInt32(v) + : -1) + 1; + study.Storage.SetStudySystemAttr(study.StudyId, keyQmcId, sampleId); + return sampleId; + } + + /// <summary> + /// The study system attribute holding this engine's last sample id for <paramref name="searchSpace" />: Optuna's + /// <c>"qmc:" + sha256(json.dumps(qmc_vars))</c>, where <c>qmc_vars</c> holds the engine kind, the search space as + /// <c>str(distribution)</c> by sorted name, and the scramble flag and seed. + /// </summary> + /// <param name="searchSpace">The relative search space being sampled.</param> + /// <returns>The attribute key, <c>qmc:</c> followed by 64 lowercase hex digits.</returns> + /// <remarks> + /// The key is a pure function of the search space and this sampler's fixed settings, and it was about a quarter of a + /// 40-parameter QMC trial (each distribution's repr, a JSON document and a hash, per trial). It is kept for the last + /// search space and reused while the next call passes the same names with the very same distribution objects (plan + /// 14), which a study's relative search space does from its first trial on. Reference identity, not value equality, + /// decides: two categoricals can be equal by Python's rules (<c>True == 1</c>) and still print differently, so + /// only the same objects are known to print the same. Runs under the sampler's lock, like all of sampling. + /// </remarks> + internal string QmcIdKey(OrderedDict<string, BaseDistribution> searchSpace) + { + if (_lastKeyQmcId is not null && _lastKeyNames!.Length == searchSpace.Count) + { + bool same = true; + int i = 0; + foreach (var (name, distribution) in searchSpace) + { + if (!ReferenceEquals(_lastKeyDistributions![i], distribution) || !string.Equals(_lastKeyNames[i], name, StringComparison.Ordinal)) + { + same = false; + break; + } + i++; + } + if (same) + return _lastKeyQmcId; + } + // Sort by keys to make the order static. - var searchSpaceStr = new OrderedDict<string, object?>(); + var searchSpaceStr = new OrderedDict<string, object?>(searchSpace.Count); foreach (var name in searchSpace.Keys.OrderBy(k => k, StringComparer.Ordinal)) searchSpaceStr[name] = searchSpace[name].ToString(); @@ -252,12 +361,20 @@ private int FindSampleId(Study study, OrderedDict<string, BaseDistribution> sear byte[] hash = SHA256.HashData(Encoding.UTF8.GetBytes(PyJson.Dumps(qmcVars))); string keyQmcId = "qmc:" + Convert.ToHexString(hash).ToLowerInvariant(); - var studyAttrs = study.Storage.GetStudySystemAttrs(study.StudyId); - int sampleId = (studyAttrs.TryGetValue(keyQmcId, out var v) && v is not null - ? Convert.ToInt32(v) - : -1) + 1; - study.Storage.SetStudySystemAttr(study.StudyId, keyQmcId, sampleId); - return sampleId; + // Remember the space this key belongs to, by its names and the distribution objects themselves. + var names = new string[searchSpace.Count]; + var distributions = new BaseDistribution[searchSpace.Count]; + int position = 0; + foreach (var (name, distribution) in searchSpace) + { + names[position] = name; + distributions[position] = distribution; + position++; + } + _lastKeyNames = names; + _lastKeyDistributions = distributions; + _lastKeyQmcId = keyQmcId; + return keyQmcId; } /// <summary>Warns that independently seeded scrambled sequences lose their shared low-discrepancy structure.</summary> diff --git a/src/OptunaSharp.Core/Samplers/RandomEmbedding/RandomEmbeddingProjection.cs b/src/OptunaSharp.Core/Samplers/RandomEmbedding/RandomEmbeddingProjection.cs index 2be1fc6..0b88047 100644 --- a/src/OptunaSharp.Core/Samplers/RandomEmbedding/RandomEmbeddingProjection.cs +++ b/src/OptunaSharp.Core/Samplers/RandomEmbedding/RandomEmbeddingProjection.cs @@ -134,7 +134,7 @@ internal double[] ProjectionRow(int run, string name) // function of its identity — independent of when or on which worker it is first requested. var rng = np.random.RandomState(); rng.seed(RowSeed(key.Run, key.Name)); - return rng.randn(_dim).ToArray<double>(); + return NumPyDraws.Randn(rng, _dim); }); /// <summary> diff --git a/src/OptunaSharp.Core/Samplers/RandomEmbeddingSampler.cs b/src/OptunaSharp.Core/Samplers/RandomEmbeddingSampler.cs index a7722cb..8a257cf 100644 --- a/src/OptunaSharp.Core/Samplers/RandomEmbeddingSampler.cs +++ b/src/OptunaSharp.Core/Samplers/RandomEmbeddingSampler.cs @@ -535,7 +535,7 @@ private double[] ReadLatent(Trial ask) private bool TryReadStoredLatent(FrozenTrial trial, out double[] y) { y = Array.Empty<double>(); - if (!trial.SystemAttrsDict.TryGetValue(LatentAttrKey, out object? raw) || raw is not IEnumerable seq) + if (!trial.SystemAttrs.TryGetValue(LatentAttrKey, out object? raw) || raw is not IEnumerable seq) return false; var values = new List<double>(_embedding.Dim); diff --git a/src/OptunaSharp.Core/Samplers/RandomSampler.cs b/src/OptunaSharp.Core/Samplers/RandomSampler.cs index c3f1339..b3b181d 100644 --- a/src/OptunaSharp.Core/Samplers/RandomSampler.cs +++ b/src/OptunaSharp.Core/Samplers/RandomSampler.cs @@ -1,5 +1,4 @@ using System; -using NumSharp; using OptunaSharp.Collections; using OptunaSharp.Distributions; using OptunaSharp.Internal; @@ -61,16 +60,29 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S => new(); /// <inheritdoc /> + /// <remarks> + /// Optuna draws <c>rng.uniform(trans.bounds[:, 0], trans.bounds[:, 1])</c> over the transform's bound rows (one row + /// for a numerical parameter, one per choice for a categorical one) and untransforms the result. This draws the + /// same rows one at a time through <see cref="NumPyDraws.Uniform" />: each row is NumPy's <c>low + (high - low) * U</c> + /// from the same uniform in the same order, so the value and the generator's next state are Optuna's bit for bit + /// (pinned live by <c>RandomSamplerParityTests</c>). The array form's only other difference, raising before any draw + /// when some range is infinite, cannot arise here: a numerical parameter has one row and every categorical row is + /// [0, 1]. + /// <para>Why not the array form (plan 14): it built five NumSharp arrays per suggestion (the bounds, two column + /// views, the draws and the untransform's float64 copy) and left them to the finalizer, which made GC pauses 47 % + /// of a 40-parameter random search.</para> + /// </remarks> public override object? SampleIndependent( Study study, FrozenTrial trial, string paramName, BaseDistribution paramDistribution) { - var searchSpace = new OrderedDict<string, BaseDistribution> { [paramName] = paramDistribution }; + var searchSpace = new OrderedDict<string, BaseDistribution>(1) { [paramName] = paramDistribution }; var trans = new SearchSpaceTransform(searchSpace); - var bounds = trans.Bounds; - // uniform(bounds[:, 0], bounds[:, 1]) — one MT19937 draw per bound row, in row order, - // exactly as NumPy broadcasts. - var transParams = _rng.Rng.uniform(bounds[":,0"], bounds[":,1"]); + // RawBounds is trans.bounds here: this transform does not rescale to the unit cube. + double[,] bounds = trans.RawBounds; + var transParams = new double[bounds.GetLength(0)]; + for (int row = 0; row < transParams.Length; row++) + transParams[row] = NumPyDraws.Uniform(_rng.Rng, bounds[row, 0], bounds[row, 1]); - return trans.Untransform(transParams)[paramName]; + return trans.UntransformValues(transParams)[paramName]; } } diff --git a/src/OptunaSharp.Core/Samplers/SaasboSampler.cs b/src/OptunaSharp.Core/Samplers/SaasboSampler.cs index 09802fc..4afa277 100644 --- a/src/OptunaSharp.Core/Samplers/SaasboSampler.cs +++ b/src/OptunaSharp.Core/Samplers/SaasboSampler.cs @@ -258,7 +258,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S // ---- Bayesian-optimization phase: fit the SAAS GP and maximize the averaged EI ---- int n = completed.Count; double[,] normalizedParams = internalSpace.GetNormalizedParams( - completed.Select(t => (IReadOnlyDictionary<string, object?>)t.ParamsDict).ToList()); + completed.Select(t => t.Params).ToList()); double sign = study.Direction == StudyDirection.Minimize ? -1.0 : 1.0; diff --git a/src/OptunaSharp.Core/Samplers/SmsEmoaSampler.cs b/src/OptunaSharp.Core/Samplers/SmsEmoaSampler.cs index f71b05d..8f978b6 100644 --- a/src/OptunaSharp.Core/Samplers/SmsEmoaSampler.cs +++ b/src/OptunaSharp.Core/Samplers/SmsEmoaSampler.cs @@ -75,15 +75,22 @@ public class SmsEmoaSampler : BaseSampler // review item H3). private readonly PerStudyState<StudyPopulation> _populations = new(); - // Per study: the child each running trial received, so a child equal to one a running trial evaluates is - // generated again (HandedOutParams). Entries leave with AfterTrial. Guarded by the sampler's monitor. + // Per study: the child each running trial received, so a child equal to one a running trial asked on another + // thread evaluates is generated again (HandedOutParams; one caller's single-thread batch is not redrawn, QA-57). + // Entries leave with AfterTrial. Guarded by the sampler's monitor. private readonly HandedOutParams _handedOutChildren = new(); /// <summary>The steady-state population of one study, advanced one completed offspring at a time.</summary> private sealed class StudyPopulation { - /// <summary>Trial ids of the current μ survivors; <c>null</c> until the initial population is complete.</summary> - public List<int>? SurvivorIds; + /// <summary>Trial numbers of the current μ survivors; <c>null</c> until the initial population is complete.</summary> + /// <remarks> + /// Numbers rather than storage ids (plan 15): within one study a number names one trial for good, as its id + /// does, so both resolve to the same records; a number is found in the number-ordered history by binary search, + /// where an id needed a dictionary over the whole history rebuilt on every ask. A study recreated under the + /// same id reuses numbers, but its population is discarded first (<see cref="Anchor" />). + /// </remarks> + public List<int>? SurvivorNumbers; /// <summary>The next trial number to fold into the population.</summary> public int NextNumber; @@ -225,53 +232,50 @@ private List<FrozenTrial> ReconstructPopulation(Study study, List<FrozenTrial> c static () => new StudyPopulation(), state => state.Anchor is not { } anchor || anchor.IsIn(completed)); - var byNumber = new Dictionary<int, FrozenTrial>(completed.Count); - var byId = new Dictionary<int, FrozenTrial>(completed.Count); - foreach (var t in completed) - { - byNumber[t.Number] = t; - byId[t.TrialId] = t; - } + // Lookups by number: a binary search over the number-ordered history instead of the two dictionaries over every + // completed trial this method rebuilt on each ask (plan 15: half of the sampler's allocations, O(n) per ask). + var byNumber = TrialsByNumber.Over(completed); - if (population.SurvivorIds is null) + if (population.SurvivorNumbers is null) { var initial = new List<int>(_populationSize); for (int number = 0; number < _populationSize; number++) { if (!byNumber.TryGetValue(number, out var t)) return new List<FrozenTrial>(); // initial population not contiguously complete yet - initial.Add(t.TrialId); + initial.Add(t.Number); } - population.SurvivorIds = initial; + population.SurvivorNumbers = initial; population.NextNumber = _populationSize; - population.Anchor = TrialAnchor.Of(byNumber[0]); + byNumber.TryGetValue(0, out var first); + population.Anchor = TrialAnchor.Of(first!); } double[] signs = DirectionSigns(study); while (byNumber.TryGetValue(population.NextNumber, out var offspring)) { - var survivorTrials = ResolveIds(population.SurvivorIds, byId); + var survivorTrials = ResolveNumbers(population.SurvivorNumbers, byNumber); var merged = new List<FrozenTrial>(survivorTrials) { offspring }; // μ + 1 var mergedLoss = merged.Select(t => Loss(t, signs)).ToArray(); var (ideal, nadir) = IdealNadir(survivorTrials, signs); int[] keep = SmsEmoaSurvival.Select(mergedLoss, _populationSize, ideal, nadir, _hvReferenceEps); - population.SurvivorIds = keep.Select(i => merged[i].TrialId).ToList(); + population.SurvivorNumbers = keep.Select(i => merged[i].Number).ToList(); population.NextNumber++; } - return ResolveIds(population.SurvivorIds, byId); + return ResolveNumbers(population.SurvivorNumbers, byNumber); } - /// <summary>Resolves stored trial identifiers against available history in the requested order.</summary> - /// <param name="ids">Stored trial identifiers in requested order.</param> - /// <param name="byId">Available trial snapshots indexed by storage identifier.</param> - /// <returns>Available trials corresponding to the identifiers, in identifier order.</returns> - private static List<FrozenTrial> ResolveIds(List<int> ids, Dictionary<int, FrozenTrial> byId) + /// <summary>Resolves stored trial numbers against the available history, in the requested order.</summary> + /// <param name="numbers">Stored trial numbers in requested order.</param> + /// <param name="byNumber">The completed history, searchable by trial number.</param> + /// <returns>Available trials corresponding to the numbers, in the numbers' order; a number not in the history is skipped.</returns> + private static List<FrozenTrial> ResolveNumbers(List<int> numbers, TrialsByNumber byNumber) { - var result = new List<FrozenTrial>(ids.Count); - foreach (int id in ids) - if (byId.TryGetValue(id, out var t)) + var result = new List<FrozenTrial>(numbers.Count); + foreach (int number in numbers) + if (byNumber.TryGetValue(number, out var t)) result.Add(t); return result; } diff --git a/src/OptunaSharp.Core/Samplers/SnesSampler.cs b/src/OptunaSharp.Core/Samplers/SnesSampler.cs index 34f12c1..8894996 100644 --- a/src/OptunaSharp.Core/Samplers/SnesSampler.cs +++ b/src/OptunaSharp.Core/Samplers/SnesSampler.cs @@ -102,12 +102,32 @@ private protected override string SerializeOptimizer(IEvolutionStrategyOptimizer /// <exception cref="System.NotSupportedException">The serialized optimizer tag is not this sampler's tag.</exception> /// <exception cref="System.Text.Json.JsonException">The persisted payload is not valid JSON for the state type, or is the literal null.</exception> /// <exception cref="System.ArgumentOutOfRangeException">The stored text has no <c><tag>\n</c> line.</exception> + /// <remarks>Parses the JSON only when the text differs from the last one parsed (<see cref="_parsedState" />); a new optimizer is built from the state every time.</remarks> private protected override IEvolutionStrategyOptimizer DeserializeOptimizer(string optimizerStr) { + // The same stored text as the last parse: the same state, without parsing the JSON again (see _parsedState). + // The whole text, tag included, is the key, so a hit has passed the tag check before. + if (_parsedState is { } parsed && string.Equals(parsed.Text, optimizerStr, System.StringComparison.Ordinal)) + return SnesOptimizer.FromState(parsed.State); + int nl = optimizerStr.IndexOf('\n'); string tag = optimizerStr[..nl]; if (tag != Tag) throw new NotSupportedException($"Unexpected optimizer state tag '{tag}' for SnesSampler."); - return SnesOptimizer.FromState(OptimizerStateJson.Deserialize<SnesState>(optimizerStr[(nl + 1)..])); + SnesState state = OptimizerStateJson.Deserialize<SnesState>(optimizerStr[(nl + 1)..]); + _parsedState = (optimizerStr, state); + return SnesOptimizer.FromState(state); } + + /// <summary> + /// The last stored optimizer text this instance parsed, and the state parsed from it (plan 15, as + /// <c>DifferentialEvolutionSampler</c> keeps it): the text changes once per generation, and every ask in between + /// parsed the same JSON again. Guarded by the sampler's monitor, like every hook; a per-worker instance has its + /// own. + /// </summary> + /// <remarks> + /// Safe to share across asks because FromState never changes the state it reads: the <see cref="SnesOptimizer" /> constructor clones the mean and the step sizes, and the generation is a number. A parse that throws + /// stores nothing, so the next ask parses (and throws) again, as before. + /// </remarks> + private (string Text, SnesState State)? _parsedState; } diff --git a/src/OptunaSharp.Core/Samplers/TPESampler.cs b/src/OptunaSharp.Core/Samplers/TPESampler.cs index 02e6bc4..63c9fb7 100644 --- a/src/OptunaSharp.Core/Samplers/TPESampler.cs +++ b/src/OptunaSharp.Core/Samplers/TPESampler.cs @@ -55,6 +55,26 @@ public class TPESampler : BaseSampler private readonly bool _constantLiar; private readonly Func<FrozenTrial, IEnumerable<double>>? _constraintsFunc; + /// <summary> + /// The last below/above split, reused while the same records are split again (plan 13, item S5). Initialized + /// here, so the public constructors and the per-worker copy constructor each give an instance its own: the cache + /// is guarded by this sampler's monitor, which a worker instance does not share. + /// </summary> + private readonly TpeSplitCache _splitCache = new(); + + /// <summary>The split cache, for the tests that count how many splits were computed rather than reused.</summary> + internal TpeSplitCache SplitCache => _splitCache; + + /// <summary> + /// Finished trials' internal parameter values, by trial number (plan 14): <see cref="GetInternalRepr" /> converts + /// each finished trial's value once instead of on every ask. Initialized here for the same reason as + /// <see cref="_splitCache" />: each instance, a per-worker copy included, owns its cache under its own monitor. + /// </summary> + private readonly TpeObservationCache _observationCache = new(); + + /// <summary>The observation cache, for the tests that check what it holds.</summary> + internal TpeObservationCache ObservationCache => _observationCache; + /// <param name="considerPrior">Deprecated (v4.3.0). Falls back to <c>true</c>.</param> /// <param name="priorWeight">Deprecated (v4.9.0). Falls back to <c>1.0</c>.</param> /// <param name="considerMagicClip">Deprecated (v4.9.0). Falls back to <c>true</c>.</param> @@ -319,7 +339,8 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S return new OrderedDict<string, object?>(); var states = new[] { TrialState.Complete, TrialState.Pruned }; - var trials = study.GetTrialsInternal(deepcopy: false, states: states, useCache: true); + // Only counted: the shared read-only list of this trial's snapshot, which Sample reads again (plan 15). + var trials = study.GetTrialsCachedReadOnly(states); // If the number of samples is insufficient, we run random trial. if (trials.Count < _nStartupTrials) return new OrderedDict<string, object?>(); @@ -332,7 +353,9 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S Study study, FrozenTrial trial, string paramName, BaseDistribution paramDistribution) { var states = new[] { TrialState.Complete, TrialState.Pruned }; - var trials = study.GetTrialsInternal(deepcopy: false, states: states, useCache: true); + // Only counted and searched: the shared read-only list, read again by Sample and by every other parameter of this + // trial (plan 15). + var trials = study.GetTrialsCachedReadOnly(states); // If the number of samples is insufficient, we run random trial. if (trials.Count < _nStartupTrials) @@ -341,7 +364,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S if (_warnIndependentSampling && IsMultivariate(study)) { // Avoid independent warning at the first sampling of `param_name`. - if (trials.Any(t => t.ParamsDict.ContainsKey(paramName))) + if (trials.Any(t => t.Params.ContainsKey(paramName))) _logger.Warning(string.Format( IndependentSamplingWarningTemplate, paramName, @@ -360,14 +383,18 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S /// <param name="trial">Trial snapshot being examined; copy its contents before modifying them.</param> /// <param name="study">Study supplying trial history, objective directions, and storage.</param> /// <returns>Recorded external parameters supplemented with readable shared relative-sampling attributes.</returns> - private OrderedDict<string, object?> GetParams(FrozenTrial trial, Study study) + /// <remarks> + /// Read-only throughout (plan 13, item S12): it runs for every trial on every ask, and a finished record of a + /// storage built with <c>compactFinishedTrials</c> would get its dictionary back from the mutable accessor. + /// </remarks> + private IReadOnlyDictionary<string, object?> GetParams(FrozenTrial trial, Study study) { if (trial.State.IsFinished() || !IsMultivariate(study)) - return trial.ParamsDict; + return trial.Params; var paramsStrs = new List<string>(); int i = 0; - while (trial.SystemAttrsDict.TryGetValue($"{RelativeParamsKey}:{i}", out var chunk) + while (trial.SystemAttrs.TryGetValue($"{RelativeParamsKey}:{i}", out var chunk) && chunk is string s && s.Length > 0) { paramsStrs.Add(s); @@ -375,7 +402,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S } if (paramsStrs.Count == 0) - return trial.ParamsDict; + return trial.Params; OrderedDict<string, object?> @params; try @@ -385,9 +412,9 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S catch { // Incomplete JSON from a concurrent write: fall back to trial.params. - return trial.ParamsDict; + return trial.Params; } - foreach (var (k, v) in trial.ParamsDict) + foreach (var (k, v) in trial.Params) @params[k] = v; return @params; } @@ -400,27 +427,161 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S private OrderedDict<string, double[]> GetInternalRepr( IReadOnlyList<FrozenTrial> trials, OrderedDict<string, BaseDistribution> searchSpace, Study study) { - var values = new Dictionary<string, List<double>>(); - foreach (var name in searchSpace.Keys) - values[name] = new List<double>(); + // One column per search-space parameter, by position, sized for every trial up front (plan 13, item S6): the + // per-trial LINQ closure, the dictionary lookup per value and the list regrowth were a fifth of a 1,000-trial + // multi-objective run, which converts the whole history once per parameter. The values and their order are the + // same: every trial in order, each column in search-space order. + int nParams = searchSpace.Count; + var names = new string[nParams]; + var distributions = new BaseDistribution[nParams]; + var columns = new double[nParams][]; + int p = 0; + foreach (var (name, distribution) in searchSpace) + { + names[p] = name; + distributions[p] = distribution; + columns[p] = new double[trials.Count]; + p++; + } + int rows = 0; + // A finished trial never changes, so its conversions are kept in the observation cache (plan 14): once each of + // this space's columns knows the trial, the row is copied from dense columns without touching the trial's + // parameters; a column that knows the trial lacks a name skips it, as the subset test below would. The cache + // first checks that every trial here is the one its row was read from, and starts over for a study recreated + // under a reused id. + TpeObservationCache.Column[] cached = _observationCache.ColumnsFor(study, trials, names, distributions); + // The current trial's external values, read once each by name before any is converted (see below). + var externals = new object?[nParams]; + // A compact finished trial (plan 13, item S12; InMemoryStorage built with compactFinishedTrials) stores each + // value's internal form, exactly what ToInternalRepr would rebuild from its external one, so a parameter whose + // search-space distribution converts as the trial's does is copied without boxing and converting it back. The + // positions depend only on the trial's schema, which a static space shares across the whole history. + ParamSchema? schema = null; + int[] positions = Array.Empty<int>(); foreach (var trial in trials) { + bool finished = trial.State.IsFinished(); + int number = trial.Number; + if (finished) + { + byte state = CachedRowState(cached, number); + if (state == TpeObservationCache.Absent) + continue; + if (state == TpeObservationCache.Present) + { + for (int i = 0; i < nParams; i++) + columns[i][rows] = cached[i].ValueOf(number); + rows++; + continue; + } + // Some column has not seen this trial yet: convert the whole row as before and remember it. + } + var @params = GetParams(trial, study); - // search_space.keys() <= params.keys(): the trial must carry every search-space param. - if (searchSpace.Keys.All(k => @params.ContainsKey(k))) + if (@params is CompactParams compact) { - foreach (var (name, distribution) in searchSpace) - values[name].Add(distribution.ToInternalRepr(@params[name])); + if (!ReferenceEquals(compact.Schema, schema)) + { + schema = compact.Schema; + positions = schema.PositionsFor(names, distributions); + } + int absent = Array.IndexOf(positions, ParamSchema.Absent); + if (absent >= 0) + { + if (finished) + { + cached[absent].SetAbsent(number); + _observationCache.RememberTrial(trial); + } + continue; + } + for (int i = 0; i < nParams; i++) + { + columns[i][rows] = positions[i] >= 0 + ? compact.InternalAt(positions[i]) + : distributions[i].ToInternalRepr(@params[names[i]]); + } + if (finished) + { + RememberRow(cached, number, columns, rows); + _observationCache.RememberTrial(trial); + } + rows++; + continue; } + + // search_space.keys() <= params.keys(): the trial must carry every search-space param. One lookup per name + // (plan 14): each value is read while checking its key, and the conversions start only once every key is + // known to be present, in search-space order, so a trial missing a name still converts nothing (and raises + // nothing), as with Optuna's subset test followed by the conversion loop. + int missing = -1; + for (int i = 0; i < nParams; i++) + { + if (!@params.TryGetValue(names[i], out externals[i])) + { + missing = i; + break; + } + } + if (missing >= 0) + { + if (finished) + { + cached[missing].SetAbsent(number); + _observationCache.RememberTrial(trial); + } + continue; + } + for (int i = 0; i < nParams; i++) + columns[i][rows] = distributions[i].ToInternalRepr(externals[i]); + if (finished) + { + RememberRow(cached, number, columns, rows); + _observationCache.RememberTrial(trial); + } + rows++; } - var result = new OrderedDict<string, double[]>(searchSpace.Count); - foreach (var name in searchSpace.Keys) - result[name] = values[name].ToArray(); + var result = new OrderedDict<string, double[]>(nParams); + for (int i = 0; i < nParams; i++) + result[names[i]] = rows == trials.Count ? columns[i] : columns[i][..rows]; + return result; + } + + /// <summary>What the observation cache knows of one finished trial's row for a search space.</summary> + /// <param name="cached">The search space's columns, in its order.</param> + /// <param name="number">The finished trial's number.</param> + /// <returns> + /// <see cref="TpeObservationCache.Absent" /> when some column knows the trial lacks its name (the row is skipped), + /// <see cref="TpeObservationCache.Present" /> when every column holds its value, otherwise + /// <see cref="TpeObservationCache.Unknown" /> (the row must be converted). + /// </returns> + private static byte CachedRowState(TpeObservationCache.Column[] cached, int number) + { + byte result = TpeObservationCache.Present; + for (int i = 0; i < cached.Length; i++) + { + byte state = cached[i].StateOf(number); + if (state == TpeObservationCache.Absent) + return TpeObservationCache.Absent; + if (state == TpeObservationCache.Unknown) + result = TpeObservationCache.Unknown; + } return result; } + /// <summary>Stores a finished trial's freshly converted row in the observation cache, one value per column.</summary> + /// <param name="cached">The search space's columns, in its order.</param> + /// <param name="number">The finished trial's number.</param> + /// <param name="columns">The observation columns being built; row <paramref name="row" /> holds the trial's values.</param> + /// <param name="row">The row just written.</param> + private static void RememberRow(TpeObservationCache.Column[] cached, int number, double[][] columns, int row) + { + for (int i = 0; i < cached.Length; i++) + cached[i].SetPresent(number, columns[i][row]); + } + /// <summary>Python <c>_sample</c>.</summary> /// <param name="study">Study supplying trial history, objective directions, and storage.</param> /// <param name="trial">Trial snapshot being examined; copy its contents before modifying them.</param> @@ -433,11 +594,31 @@ private OrderedDict<string, double[]> GetInternalRepr( ? new[] { TrialState.Complete, TrialState.Pruned, TrialState.Running } : new[] { TrialState.Complete, TrialState.Pruned }; bool useCache = !_constantLiar; - var trials = study.GetTrialsInternal(deepcopy: false, states: states, useCache: useCache); + IReadOnlyList<FrozenTrial> trials; + if (!_constantLiar) + { + // The cached read (useCache), as Optuna's _sample makes it. Only read from here on (counted, split, read by + // the estimators), so it is the shared list of this trial's snapshot rather than a copy per call (plan 15). + trials = study.GetTrialsCachedReadOnly(states); + } + else if (study.Storage.HasZeroCopyTrialsView) + { + // For constant_liar, filter out the current trial: here by never reading its record (plan 13, item S3). The + // read below returns the stored records themselves, and a running record that is read must be copied before + // its next write (InMemoryStorage, item S4); reading the current trial's record only to drop it made every + // suggestion of an independent-TPE trial copy that trial. The zero-copy view yields the same records in the + // same (trial number) order as GetAllTrials(deepcopy: false, states), minus the current trial. + trials = ReadOtherTrials(study, trial.Number, states); + } + else + { + List<FrozenTrial> read = study.GetTrialsInternal(deepcopy: false, states: states, useCache: useCache); - if (_constantLiar) - // For constant_liar, filter out the current trial. - trials = trials.Where(t => trial.Number != t.Number).ToList(); + if (_constantLiar) + // For constant_liar, filter out the current trial. + read = read.Where(t => trial.Number != t.Number).ToList(); + trials = read; + } // Divide data into below and above. if (_gamma is null) @@ -447,7 +628,10 @@ private OrderedDict<string, double[]> GetInternalRepr( int n = trials.Count(t => t.State != TrialState.Running); // Ignore running trials. - var (belowTrials, aboveTrials) = TpeTrialSplit.SplitTrials(study, trials, _gamma(n)); + // The same split as TpeTrialSplit.SplitTrials, reused while the same records are split again: every parameter + // of an independent-TPE trial splits the same history (plan 13, item S5; see TpeSplitCache). + // The groups are only read by the two estimator builds below, so the cache's own lists serve without copies. + var (belowTrials, aboveTrials) = _splitCache.SplitShared(study, trials, _gamma(n)); var mpeBelow = BuildParzenEstimator(study, searchSpace, belowTrials, handleBelow: true); var mpeAbove = BuildParzenEstimator(study, searchSpace, aboveTrials, handleBelow: false); @@ -463,6 +647,37 @@ private OrderedDict<string, double[]> GetInternalRepr( return result; } + /// <summary> + /// The constant-liar history read for a storage whose + /// <see cref="OptunaSharp.Storages.BaseStorage.GetTrialsPrefixView" /> is zero-copy: + /// every trial in <paramref name="states" /> by trial number, except trial <paramref name="currentNumber" />, whose + /// record is never read. + /// </summary> + /// <param name="study">The study being sampled; its storage has a zero-copy view.</param> + /// <param name="currentNumber">The number of the trial being sampled, which constant liar leaves out.</param> + /// <param name="states">The states to keep.</param> + /// <returns>The records <c>GetAllTrials(deepcopy: false, states)</c> returns, without the current trial's.</returns> + /// <remarks> + /// In-memory trial numbers are positions in the study's trial list, which is the view's index, so skipping a + /// position skips the trial without reading it. Each other position is read once, as the view reads it: a finished + /// record without the lock, a running one under it. Another worker's running trial is read, and so copied before + /// that worker's next write, as before: constant liar uses those records. + /// </remarks> + private static List<FrozenTrial> ReadOtherTrials(Study study, int currentNumber, TrialState[] states) + { + IReadOnlyList<FrozenTrial> view = study.Storage.GetTrialsPrefixView(study.StudyId); + var result = new List<FrozenTrial>(view.Count); + for (int i = 0; i < view.Count; i++) + { + if (i == currentNumber) + continue; + FrozenTrial other = view[i]; + if (Array.IndexOf(states, other.State) >= 0) + result.Add(other); + } + return result; + } + /// <summary>Python <c>_build_parzen_estimator</c>.</summary> /// <param name="study">Study supplying trial history, objective directions, and storage.</param> /// <param name="searchSpace">Ordered parameter distributions defining the coordinates used by this operation.</param> @@ -526,19 +741,43 @@ private static OrderedDict<string, double> Compare( return result; } - /// <summary>NumPy <c>np.argmax</c>: the first index of the maximum (NaN-max semantics excluded — acq values are finite).</summary> - /// <param name="values">Scores compared to choose the first maximum.</param> - /// <returns>The first maximum index.</returns> + /// <summary> + /// NumPy <c>np.argmax</c> for <c>_compare</c>: the first index of the maximum, or the index of the first NaN when + /// there is one — NumPy treats a NaN as maximal and stops at it. + /// </summary> + /// <param name="values">The acquisition values <c>log l(x) - log g(x)</c> of the candidates; at least one.</param> + /// <returns>The index of the first NaN if any value is NaN, else the first index holding the largest value.</returns> + /// <remarks> + /// <para> + /// An acquisition value is NaN when a candidate has no mass under either mixture (<c>-inf - -inf</c>), e.g. + /// a log int in the hundreds of trillions and up, where the bin <c>[log(x - 0.5), log(x + 0.5)]</c> can + /// collapse to one double (QA-29). Optuna then picks the first NaN candidate; the former strict <c>></c> + /// loop skipped NaNs and picked the best finite one. + /// </para> + /// <para> + /// The statements are NumPy's <c>@fname@_argmax</c> loop (<c>if (!(v <= mp))</c>, stopping at a NaN), so a + /// tie keeps the earlier index (<c>-0.0</c> and <c>0.0</c> included). NumSharp's <c>np.argmax</c> returns the + /// same index on every input, but costs about 2.3 µs against about 17 ns here (24 candidates, measured + /// 2026-11-11), and this runs once per parameter per trial in independent sampling. + /// </para> + /// </remarks> private static int ArgMax(double[] values) { int best = 0; double bestVal = values[0]; + // NumPy checks the first element on its own: a leading NaN is the answer. + if (double.IsNaN(bestVal)) + return 0; for (int i = 1; i < values.Length; i++) { - if (values[i] > bestVal) + double value = values[i]; + // !(value <= best) is true for a larger value and for a NaN; a NaN ends the search, as in NumPy. + if (!(value <= bestVal)) { - bestVal = values[i]; + bestVal = value; best = i; + if (double.IsNaN(value)) + break; } } return best; diff --git a/src/OptunaSharp.Core/Samplers/Tpe/ParzenEstimator.cs b/src/OptunaSharp.Core/Samplers/Tpe/ParzenEstimator.cs index 7a81507..842be51 100644 --- a/src/OptunaSharp.Core/Samplers/Tpe/ParzenEstimator.cs +++ b/src/OptunaSharp.Core/Samplers/Tpe/ParzenEstimator.cs @@ -265,25 +265,29 @@ private static BatchedDistributions CalculateNumericalDistributions( high += step.Value / 2.0; } - var mus = observations; + // mus = observations (or their logs), then np.append(mus, [0.5 * (low + high)]) and + // np.append(sigmas, [high - low]). Plan 15: the centers and the widths are written straight into the arrays that + // carry the prior's slot, instead of into arrays of their own copied over afterwards: the same values, two + // arrays per parameter fewer per estimator (three on the log kinds). + int n = observations.Length; + var musWithPrior = new double[n + 1]; if (log) { - mus = new double[observations.Length]; - for (int i = 0; i < observations.Length; i++) - mus[i] = Math.Log(observations[i]); + for (int i = 0; i < n; i++) + musWithPrior[i] = Math.Log(observations[i]); low = Math.Log(low); high = Math.Log(high); } + else + { + Array.Copy(observations, musWithPrior, n); + } + ReadOnlySpan<double> mus = musWithPrior.AsSpan(0, n); - var sigmas = ComputeSigmas(mus, low, high, observations.Length, parameters); + var sigmasWithPrior = new double[n + 1]; + ComputeSigmas(mus, low, high, n, parameters, sigmasWithPrior.AsSpan(0, n)); - // mus = np.append(mus, [0.5 * (low + high)]); sigmas = np.append(sigmas, [high - low]). - var musWithPrior = new double[mus.Length + 1]; - Array.Copy(mus, musWithPrior, mus.Length); musWithPrior[^1] = 0.5 * (low + high); - - var sigmasWithPrior = new double[sigmas.Length + 1]; - Array.Copy(sigmas, sigmasWithPrior, sigmas.Length); sigmasWithPrior[^1] = high - low; // The original (pre-log, pre-step-widen) low/high/step drive the batched kind. @@ -308,15 +312,97 @@ private static BatchedDistributions CalculateNumericalDistributions( /// <param name="nObservations">Number of historical observations represented by the kernels.</param> /// <param name="parameters">Kernel construction and observation-weight configuration.</param> /// <returns>Per-observation kernel widths after endpoint and clipping heuristics.</returns> - private static double[] ComputeSigmas( + /// <remarks> + /// The unclipped widths come from <see cref="BinnedRawSigmas(double[], double, double, double, int, bool)" /> when it can prove they clip to exactly what Optuna's + /// sort gives (plan 14: the sort was a quarter of a 1,000-trial, 40-parameter TPE run), otherwise from + /// <see cref="SortedRawSigmas(double[], double, double, bool)" />, Optuna's sort-based computation. Both then go through the same clip. + /// </remarks> + internal static double[] ComputeSigmas( double[] mus, double low, double high, int nObservations, ParzenEstimatorParameters parameters) + { + var sigmas = new double[mus.Length]; + ComputeSigmas(mus, low, high, nObservations, parameters, sigmas); + return sigmas; + } + + /// <summary> + /// <see cref="ComputeSigmas(double[], double, double, int, ParzenEstimatorParameters)" /> into a caller's buffer: + /// the same widths, written to <paramref name="sigmas" /> (plan 15: the estimator passes the slots of its + /// prior-extended array, so no width array is copied over afterwards). + /// </summary> + /// <param name="mus">Kernel centers in transformed numerical coordinates.</param> + /// <param name="low">Lower endpoint of the numerical domain.</param> + /// <param name="high">Upper endpoint of the numerical domain.</param> + /// <param name="nObservations">Number of historical observations represented by the kernels.</param> + /// <param name="parameters">Kernel construction and observation-weight configuration.</param> + /// <param name="sigmas">Receives one width per center; at least as long as <paramref name="mus" />, and not overlapping it.</param> + /// <exception cref="IndexOutOfRangeException"><paramref name="sigmas" /> is shorter than <paramref name="mus" />.</exception> + internal static void ComputeSigmas( + ReadOnlySpan<double> mus, double low, double high, int nObservations, ParzenEstimatorParameters parameters, + Span<double> sigmas) + { + int n = mus.Length; + double maxsigma = high - low; + double minsigma; + int nBins = 0; + if (parameters.ConsiderMagicClip) + { + int nKernels = nObservations + 1; // +1 for prior. + double divisor = Math.Min(100.0, 1.0 + nKernels); + minsigma = (high - low) / divisor; + // One bin per minsigma of the domain: (high - low) / minsigma is the divisor, a whole number from 3 to 100. + nBins = (int)divisor; + } + else + { + minsigma = Eps; + } + + // The binned path writes the widths only when it succeeds; otherwise the sort writes them. + if (!(parameters.ConsiderMagicClip + && BinnedRawSigmas(mus, low, high, minsigma, nBins, parameters.ConsiderEndpoints, sigmas))) + SortedRawSigmas(mus, low, high, parameters.ConsiderEndpoints, sigmas); + + for (int t = 0; t < n; t++) + sigmas[t] = MathUtil.Clip(sigmas[t], minsigma, maxsigma); + } + + /// <summary> + /// Optuna's unclipped kernel widths, computed as <c>compute_sigmas</c> does: sort the centers, take each one's larger + /// distance to its sorted neighbors (the domain endpoints at both ends), and with <c>consider_endpoints=False</c> and + /// at least two centers drop the endpoint distance of the smallest and the largest. + /// </summary> + /// <param name="mus">Kernel centers in transformed numerical coordinates; not modified.</param> + /// <param name="low">Lower endpoint of the numerical domain.</param> + /// <param name="high">Upper endpoint of the numerical domain.</param> + /// <param name="considerEndpoints">Whether the domain endpoints count as neighbors of the smallest and largest center.</param> + /// <returns>One unclipped width per center, in the centers' order.</returns> + internal static double[] SortedRawSigmas(double[] mus, double low, double high, bool considerEndpoints) + { + var sigmas = new double[mus.Length]; + SortedRawSigmas(mus, low, high, considerEndpoints, sigmas); + return sigmas; + } + + /// <summary> + /// <see cref="SortedRawSigmas(double[], double, double, bool)" /> into a caller's buffer: the same widths, in the + /// centers' order. + /// </summary> + /// <param name="mus">Kernel centers in transformed numerical coordinates; not modified.</param> + /// <param name="low">Lower endpoint of the numerical domain.</param> + /// <param name="high">Upper endpoint of the numerical domain.</param> + /// <param name="considerEndpoints">Whether the domain endpoints count as neighbors of the smallest and largest center.</param> + /// <param name="sigmas">Receives one unclipped width per center; at least as long as <paramref name="mus" />.</param> + /// <exception cref="IndexOutOfRangeException"><paramref name="sigmas" /> is shorter than <paramref name="mus" />.</exception> + internal static void SortedRawSigmas( + ReadOnlySpan<double> mus, double low, double high, bool considerEndpoints, Span<double> sigmas) { int n = mus.Length; // sorted_indices = np.argsort(mus). Stable — exact for distinct mus. NumPy 2.x sorts float64 // with x86-simd-sort, whose tie order is not portably reproducible; see the class remark for // the (documented) divergence this leaves on repeated numerical observations. - var sortedIndices = Enumerable.Range(0, n).OrderBy(i => mus[i]).ToArray(); + var sortedIndices = StableArgsort(mus); // sorted_mus_with_endpoints = [low, *sorted_mus, high]. var swe = new double[n + 2]; @@ -330,32 +416,193 @@ private static double[] ComputeSigmas( for (int t = 0; t < n; t++) sortedSigmas[t] = Math.Max(swe[t + 1] - swe[t], swe[t + 2] - swe[t + 1]); - if (!parameters.ConsiderEndpoints && swe.Length >= 4) + if (!considerEndpoints && swe.Length >= 4) { sortedSigmas[0] = swe[2] - swe[1]; sortedSigmas[^1] = swe[^2] - swe[^3]; } // sigmas = sorted_sigmas[np.argsort(sorted_indices)] — invert the (distinct) permutation. - var sigmas = new double[n]; for (int t = 0; t < n; t++) sigmas[sortedIndices[t]] = sortedSigmas[t]; + } - double maxsigma = high - low; - double minsigma; - if (parameters.ConsiderMagicClip) + /// <summary> + /// Unclipped kernel widths that clip to exactly what <see cref="SortedRawSigmas(double[], double, double, bool)" /> clips to, found in O(n) without + /// sorting, or <see langword="null" /> when that cannot be proven for these centers (the caller then sorts). + /// </summary> + /// <param name="mus">Kernel centers in transformed numerical coordinates; not modified.</param> + /// <param name="low">Lower endpoint of the numerical domain.</param> + /// <param name="high">Upper endpoint of the numerical domain.</param> + /// <param name="minsigma">The magic-clip floor every width is clipped up to; the bin width.</param> + /// <param name="nBins">How many bins of width <paramref name="minsigma" /> cover the domain.</param> + /// <param name="considerEndpoints">Whether the domain endpoints count as neighbors of the smallest and largest center.</param> + /// <returns>One width per center, in the centers' order, or <see langword="null" />.</returns> + /// <remarks> + /// <para>The idea is Rustuna's <c>binned_sigmas</c> (rustuna_core/src/parzen_estimator/model.rs): a width is the + /// larger distance to the two sorted neighbors, floored at <c>minsigma</c> by the clip, so a neighbor nearer than + /// <c>minsigma</c> cannot change it. Bin the centers at that width. A center that is neither the smallest nor the + /// largest of its bin has both sorted neighbors inside the bin, so its width clips to <c>minsigma</c>; only each + /// bin's extremes can have a farther neighbor, and that neighbor is the adjacent non-empty bin's extreme (or the + /// domain endpoint). Rustuna's version can differ from the sort in the last bits where rounding puts a center in + /// a neighboring bin; this one checks instead of trusting the binning.</para> + /// <para><b>Why the result is exact.</b> Bin assignment <c>floor((v - low) / minsigma)</c> is monotone in + /// <c>v</c> (IEEE subtraction, division by a positive constant and floor all are), so the bins are contiguous runs + /// of the sorted order, and equal centers share a bin. A bin's smallest center is taken at its first index and its + /// largest at its last index, which are the positions a stable sort puts first and last among equal values; the + /// neighbor distances are the same subtractions of the same operands the sort makes. Every bin is verified to span + /// at most <c>minsigma</c> (<c>max - min <= minsigma</c>, computed); since IEEE subtraction is monotone in its + /// operands, every in-bin neighbor distance is then at most <c>minsigma</c> too, so leaving those distances out + /// changes no clipped width. Any bin wider than that, a center outside the domain or NaN, fewer than two + /// centers, or a degenerate domain returns <see langword="null" />. <c>TpeBinnedSigmasTests</c> compares the two + /// paths bit for bit over random, tied, clustered and bin-edge inputs.</para> + /// </remarks> + internal static double[]? BinnedRawSigmas( + double[] mus, double low, double high, double minsigma, int nBins, bool considerEndpoints) + { + var sigmas = new double[mus.Length]; + return BinnedRawSigmas(mus, low, high, minsigma, nBins, considerEndpoints, sigmas) ? sigmas : null; + } + + /// <summary> + /// <see cref="BinnedRawSigmas(double[], double, double, double, int, bool)" /> into a caller's buffer: true with + /// the widths written to <paramref name="sigmas" />, or false with <paramref name="sigmas" /> untouched when the + /// binned widths cannot be proven exact (the caller then sorts). + /// </summary> + /// <param name="mus">Kernel centers in transformed numerical coordinates; not modified.</param> + /// <param name="low">Lower endpoint of the numerical domain.</param> + /// <param name="high">Upper endpoint of the numerical domain.</param> + /// <param name="minsigma">The magic-clip floor every width is clipped up to; the bin width.</param> + /// <param name="nBins">How many bins of width <paramref name="minsigma" /> cover the domain.</param> + /// <param name="considerEndpoints">Whether the domain endpoints count as neighbors of the smallest and largest center.</param> + /// <param name="sigmas">Receives one width per center on success; at least as long as <paramref name="mus" />.</param> + /// <returns>Whether the widths were written.</returns> + /// <exception cref="IndexOutOfRangeException"><paramref name="sigmas" /> is shorter than <paramref name="mus" />.</exception> + /// <remarks>Every check that can refuse runs before the first write, so a refusal leaves the buffer as it was.</remarks> + internal static bool BinnedRawSigmas( + ReadOnlySpan<double> mus, double low, double high, double minsigma, int nBins, bool considerEndpoints, + Span<double> sigmas) + { + int n = mus.Length; + if (n < 2 || nBins < 1 || nBins > 100 || !(high > low) || !(minsigma > 0) || !double.IsFinite(minsigma)) + return false; + + // Per bin: the smallest center and its first index, the largest and its last index (stable-sort positions). + Span<double> binMin = stackalloc double[nBins]; + Span<double> binMax = stackalloc double[nBins]; + Span<int> binMinIndex = stackalloc int[nBins]; + Span<int> binMaxIndex = stackalloc int[nBins]; + binMin.Fill(double.PositiveInfinity); + binMax.Fill(double.NegativeInfinity); + binMinIndex.Fill(-1); + binMaxIndex.Fill(-1); + for (int i = 0; i < n; i++) { - int nKernels = nObservations + 1; // +1 for prior. - minsigma = (high - low) / Math.Min(100.0, 1.0 + nKernels); + double v = mus[i]; + // Outside the domain (or NaN): the sort handles it; the bins assume every center lies in [low, high]. + if (!(v >= low && v <= high)) + return false; + int bin = (int)Math.Min(Math.Floor((v - low) / minsigma), nBins - 1); + if (v < binMin[bin]) + { + binMin[bin] = v; + binMinIndex[bin] = i; + } + if (v >= binMax[bin]) + { + binMax[bin] = v; + binMaxIndex[bin] = i; + } } - else + + // The proof's condition: every in-bin neighbor distance is at most minsigma, which holds when each bin's span is. + for (int b = 0; b < nBins; b++) { - minsigma = Eps; + if (binMinIndex[b] >= 0 && !(binMax[b] - binMin[b] <= minsigma)) + return false; } - for (int t = 0; t < n; t++) - sigmas[t] = MathUtil.Clip(sigmas[t], minsigma, maxsigma); - return sigmas; + // Every center not at its bin's extremes clips to minsigma; start everyone there and raise the extremes. + sigmas.Slice(0, n).Fill(minsigma); + + // Each bin's smallest center: its sorted predecessor is the previous non-empty bin's largest (or `low`). + bool firstBin = true; + double previousMax = 0.0; + for (int b = 0; b < nBins; b++) + { + int i = binMinIndex[b]; + if (i < 0) + continue; + if (!firstBin) + sigmas[i] = Math.Max(sigmas[i], binMin[b] - previousMax); + else if (considerEndpoints) + sigmas[i] = Math.Max(sigmas[i], binMin[b] - low); + firstBin = false; + previousMax = binMax[b]; + } + + // Each bin's largest center: its sorted successor is the next non-empty bin's smallest (or `high`). + bool lastBin = true; + double nextMin = 0.0; + for (int b = nBins - 1; b >= 0; b--) + { + int i = binMaxIndex[b]; + if (i < 0) + continue; + if (!lastBin) + sigmas[i] = Math.Max(sigmas[i], nextMin - binMax[b]); + else if (considerEndpoints) + sigmas[i] = Math.Max(sigmas[i], high - binMax[b]); + lastBin = false; + nextMin = binMin[b]; + } + return true; + } + + /// <summary> + /// The stable argsort <see cref="ComputeSigmas(double[], double, double, int, ParzenEstimatorParameters)" /> uses: the permutation + /// <c>Enumerable.Range(0, n).OrderBy(i => values[i])</c> returns, with ties in index order, computed by + /// <see cref="Array.Sort{TKey, TValue}(TKey[], TValue[])" /> and an index sort of each run of equal keys. + /// </summary> + /// <param name="values">The values to order; not modified.</param> + /// <returns>The indices of <paramref name="values" /> in ascending order of value, equal values by index.</returns> + /// <remarks> + /// Why not the LINQ sort it replaces (Rustuna plan 13, item S6): it compares through a delegate and allocated + /// its key buffers per call, about 0.8 s of a 1,000-trial, 40-parameter TPE run. The result is the same + /// permutation: <see cref="Array.Sort{TKey, TValue}(TKey[], TValue[])" /> orders doubles as + /// <see cref="double.CompareTo(double)" /> does (NaN first, -0.0 equal to 0.0), which is what the LINQ sort's + /// default comparer used, and its only freedom, the order inside a run of equal keys, is undone by sorting each + /// run's indices. + /// </remarks> + internal static int[] StableArgsort(double[] values) => StableArgsort(values.AsSpan()); + + /// <summary> + /// <see cref="StableArgsort(double[])" /> over a span (plan 15: the estimator's centers are a slice of its + /// prior-extended array): the same permutation, sorting a copy of the values as the array form sorted its clone. + /// </summary> + /// <param name="values">The values to order; not modified.</param> + /// <returns>The indices of <paramref name="values" /> in ascending order of value, equal values by index.</returns> + internal static int[] StableArgsort(ReadOnlySpan<double> values) + { + int n = values.Length; + var keys = values.ToArray(); + var indices = new int[n]; + for (int i = 0; i < n; i++) + indices[i] = i; + Array.Sort(keys, indices); + + int runStart = 0; + for (int i = 1; i <= n; i++) + { + // A run ends where the key changes by CompareTo, which groups NaNs together and -0.0 with 0.0. + if (i == n || keys[i].CompareTo(keys[runStart]) != 0) + { + if (i - runStart > 1) + Array.Sort(indices, runStart, i - runStart); + runStart = i; + } + } + return indices; } /// <summary>Python <c>_ParzenEstimator._call_weights_func</c>.</summary> @@ -370,9 +617,16 @@ private static double[] CallWeightsFunc(Func<int, double[]> weightsFunc, int n) var w = wFull.Length > n ? wFull[..n] : wFull; // NOTE: the deprecated custom `weights` function is the only way to reach these guards - // (the default `default_weights` never does); the array in the message is formatted - // approximately rather than byte-for-byte with NumPy's ndarray repr. - string ArrRepr(double[] a) => "[" + string.Join(" ", a.Select(PythonRepr.FloatRepr)) + "]"; + // (the default `default_weights` never does). Optuna's f-string prints the array with NumPy's str(ndarray): + // a common field width, a sign column when any element is negative, `0.` rather than `0.0`, scientific + // notation past NumPy's thresholds and line wrapping at 75 characters. NumSharp's NDArray.ToString() is that + // printer (np.array_str), so `[ 0.5 -0.25]` and `[0.]` come out as in Optuna (QA-48 a; a join of Python + // float reprs gave `[0.5 -0.25]` and `[0.0]`). + static string ArrRepr(double[] a) + { + using NDArray array = np.array(a); + return array.ToString(); + } if (w.Any(x => x < 0)) throw new ValueError( diff --git a/src/OptunaSharp.Core/Samplers/Tpe/ProbabilityDistributions.cs b/src/OptunaSharp.Core/Samplers/Tpe/ProbabilityDistributions.cs index d846465..5c48b80 100644 --- a/src/OptunaSharp.Core/Samplers/Tpe/ProbabilityDistributions.cs +++ b/src/OptunaSharp.Core/Samplers/Tpe/ProbabilityDistributions.cs @@ -1,6 +1,5 @@ using System; using System.Collections.Generic; -using System.Linq; using NumSharp; using OptunaSharp.Internal; @@ -166,6 +165,16 @@ internal BatchedDiscreteTruncLogNormDistributions(double[] mu, double[] sigma, d /// <summary>Python <c>_MixtureOfProductDistribution</c>.</summary> internal sealed class MixtureOfProductDistribution { + /// <summary> + /// A bound below which <c>exp</c> is exactly <c>+0.0</c>: <c>exp(-746)</c> is about 0.42 of half the smallest + /// subnormal (2^-1075, about 2.5e-324), so a correctly rounded result is zero, and NumPy's and .NET's <c>exp</c> + /// return zero for every input below the underflow point (about -745.1332; glibc, ucrt and Apple's libm alike). + /// <see cref="LogPdf" /> stores <c>0.0</c> for such terms instead of calling <see cref="Math.Exp" />, whose underflow + /// path costs about three normal calls; <c>TpeExpUnderflowTests</c> pins that <see cref="Math.Exp" /> returns + /// <c>+0.0</c> below it on the platform that runs the tests. + /// </summary> + internal const double ExpIsZeroBelow = -746.0; + /// <summary>Nonnegative mixture-component probabilities, in shared kernel order.</summary> internal double[] Weights { get; } /// <summary>Coordinate distributions sharing the same mixture-component index.</summary> @@ -207,7 +216,7 @@ internal MixtureOfProductDistribution(double[] weights, IReadOnlyList<BatchedDis if (Distributions[i] is BatchedCategoricalDistributions cat) { // active_weights = weights[active_indices, :]; rnd_quantile = rng.rand(batch_size). - var rndQuantile = rng.Rng.rand((long)batchSize).ToArray<double>(); + var rndQuantile = NumPyDraws.Rand(rng.Rng, batchSize); int nChoices = cat.Weights.GetLength(1); for (int s = 0; s < batchSize; s++) { @@ -243,7 +252,7 @@ internal MixtureOfProductDistribution(double[] weights, IReadOnlyList<BatchedDis int nNum = numericalDists.Count; int total = nNum * batchSize; // _truncnorm.rvs draws random_state.uniform(0, 1, size=(n_num, batch)) in C order. - var quantiles = rng.Rng.random_sample((long)total).ToArray<double>(); + var quantiles = NumPyDraws.RandomSample(rng.Rng, total); var aFlat = new double[total]; var bFlat = new double[total]; @@ -284,7 +293,11 @@ internal MixtureOfProductDistribution(double[] weights, IReadOnlyList<BatchedDis ret[s, col] = Math.Exp(ret[s, col]); } - // ret[:, disc_inds] = clip(low + round((v - low) / step) * step, low, high). + // ret[:, disc_inds] = clip(low + round((v - low) / step) * step, low, high). NumPy clips the (n, k) block + // against per-column bounds: with one discrete column (k == 1) the bounds broadcast with stride 0 and NumPy + // runs its const loop (a tie keeps the value); with two or more the inner loop walks the columns and runs + // the general loop (a tie takes the bound). The two differ only at a zero tie (QA-30). + bool constLoop = discInds.Count == 1; foreach (int col in discInds) { var nd = (BatchedNumericalDistributions)Distributions[col]; @@ -293,7 +306,7 @@ internal MixtureOfProductDistribution(double[] weights, IReadOnlyList<BatchedDis { double v = ret[s, col]; double rounded = low + Math.Round((v - low) / step, MidpointRounding.ToEven) * step; - ret[s, col] = MathUtil.Clip(rounded, low, high); + ret[s, col] = constLoop ? MathUtil.Clip(rounded, low, high) : MathUtil.ClipGeneral(rounded, low, high); } } } @@ -324,7 +337,7 @@ private static int[] Choice(LazyRandomState rng, double[] weights, int size) for (int i = 0; i < n; i++) cdf[i] /= last; - var u = rng.Rng.random_sample((long)size).ToArray<double>(); + var u = NumPyDraws.RandomSample(rng.Rng, size); var result = new int[size]; for (int j = 0; j < size; j++) result[j] = BisectRight(cdf, u[j]); @@ -340,182 +353,449 @@ internal double[] LogPdf(double[,] x) int nSamples = x.GetLength(0); int dim = x.GetLength(1); int nKernels = Weights.Length; - var weightedLogPdf = new double[nSamples, nKernels]; - - var contDists = new List<BatchedNumericalDistributions>(); - var contCols = new List<int>(); - - for (int i = 0; i < dim; i++) + // weighted_log_pdf, (n_samples, n_kernels) row-major in a rented buffer (plan 13, item S6): at TPE's 24 candidates + // and a thousand kernels it is 192 KB, a large-object-heap allocation per call, which kept background GCs busy + // and made the sampler wait for them. Every element is cleared, then accumulated in the same order as before. + double[] weightedLogPdf = System.Buffers.ArrayPool<double>.Shared.Rent(Math.Max(nSamples * nKernels, 1)); + try { - switch (Distributions[i]) - { - case BatchedCategoricalDistributions cat: - { - // xi = x[:, i, None, None].astype(int64); += log(take_along_axis(weights, xi))[..., 0]. - for (int s = 0; s < nSamples; s++) - { - long xi = (long)x[s, i]; - for (int k = 0; k < nKernels; k++) - weightedLogPdf[s, k] += Math.Log(cat.Weights[k, xi]); - } - break; - } + Array.Clear(weightedLogPdf, 0, nSamples * nKernels); - case BatchedNumericalDistributions num when num.Step == 0.0: - // Continuous kind: collected and processed together after the loop. - contDists.Add(num); - contCols.Add(i); - break; + var contDists = new List<BatchedNumericalDistributions>(); + var contCols = new List<int>(); - case BatchedNumericalDistributions dtn: + for (int i = 0; i < dim; i++) + { + switch (Distributions[i]) { - // Discrete kind (truncated normal or log-normal). - bool isLog = dtn.IsLog; - double step = dtn.Step; - var xcol = new double[nSamples]; - for (int s = 0; s < nSamples; s++) - xcol[s] = x[s, i]; - - var (xiUniq, xiInv) = UniqueInverse1d(xcol); - var (muUniq, sigmaUniq, msInv) = UniqueInverse2d(dtn.Mu, dtn.Sigma); - int nXi = xiUniq.Length; - int nMs = muUniq.Length; - - var a = new double[nXi * nMs]; - var b = new double[nXi * nMs]; - for (int p = 0; p < nXi; p++) + case BatchedCategoricalDistributions cat: { - double left = isLog ? Math.Log(xiUniq[p] - step / 2.0) : xiUniq[p] - step / 2.0; - double right = isLog ? Math.Log(xiUniq[p] + step / 2.0) : xiUniq[p] + step / 2.0; - for (int qi = 0; qi < nMs; qi++) + // xi = x[:, i, None, None].astype(int64); += log(take_along_axis(weights, xi))[..., 0]. + // Each candidate adds log(weights[k, xi]) for its choice xi. The log of every (kernel, choice) + // weight is taken once (plan 14; Rustuna 198e484 reduces the log calls too, with other numerics): + // one log per kernel and choice instead of one per candidate and kernel, 3,000 instead of 24,000 + // for a three-choice parameter over a thousand kernels. Math.Log is deterministic, so each + // added term, and every sum, keeps its bits; only choices some candidate drew are computed. + int nChoices = cat.Weights.GetLength(1); + var logChoiceWeights = new double[nChoices][]; + for (int s = 0; s < nSamples; s++) { - a[p * nMs + qi] = (left - muUniq[qi]) / sigmaUniq[qi]; - b[p * nMs + qi] = (right - muUniq[qi]) / sigmaUniq[qi]; + long xi = (long)x[s, i]; + double[]? column = logChoiceWeights[xi]; + if (column is null) + { + column = new double[nKernels]; + for (int k = 0; k < nKernels; k++) + column[k] = Math.Log(cat.Weights[k, xi]); + logChoiceWeights[xi] = column; + } + for (int k = 0; k < nKernels; k++) + weightedLogPdf[s * nKernels + k] += column[k]; } + break; } - var logMass = LogGaussMassUnique(a, b); // shape (nXi, nMs), row-major. - for (int s = 0; s < nSamples; s++) - { - int row = xiInv[s] * nMs; - for (int k = 0; k < nKernels; k++) - weightedLogPdf[s, k] += logMass[row + msInv[k]]; - } + case BatchedNumericalDistributions num when num.Step == 0.0: + // Continuous kind: collected and processed together after the loop. + contDists.Add(num); + contCols.Add(i); + break; - var normLow = new double[nMs]; - var normHigh = new double[nMs]; - for (int qi = 0; qi < nMs; qi++) - { - normLow[qi] = (dtn.AdaptedLow - muUniq[qi]) / sigmaUniq[qi]; - normHigh[qi] = (dtn.AdaptedHigh - muUniq[qi]) / sigmaUniq[qi]; - } - var norm = TruncNorm.LogGaussMass(normLow, normHigh); - for (int s = 0; s < nSamples; s++) - { - for (int k = 0; k < nKernels; k++) - weightedLogPdf[s, k] -= norm[msInv[k]]; - } - break; - } + case BatchedNumericalDistributions dtn: + // Discrete kind (truncated normal or log-normal). + AddDiscreteLogPdf(x, i, dtn, weightedLogPdf); + break; - default: - throw new InvalidOperationException("Unknown batched distribution kind."); + default: + throw new InvalidOperationException("Unknown batched distribution kind."); + } } - } - if (contDists.Count > 0) - AddContinuousLogPdf(x, weightedLogPdf, contDists, contCols); + if (contDists.Count > 0) + AddContinuousLogPdf(x, weightedLogPdf, contDists, contCols); - // weighted_log_pdf += np.log(self.weights[np.newaxis]). - for (int s = 0; s < nSamples; s++) - { + // weighted_log_pdf += np.log(self.weights[np.newaxis]). Each kernel's log weight is the same for every sample, + // so it is taken once per kernel (plan 13, item S6); Math.Log is deterministic, so the sums keep their bits. + var logWeights = new double[nKernels]; for (int k = 0; k < nKernels; k++) - weightedLogPdf[s, k] += Math.Log(Weights[k]); - } + logWeights[k] = Math.Log(Weights[k]); + for (int s = 0; s < nSamples; s++) + { + for (int k = 0; k < nKernels; k++) + weightedLogPdf[s * nKernels + k] += logWeights[k]; + } - // np.log(np.exp(weighted_log_pdf - max_[:, None]).sum(axis=1)) + max_, with -inf max_ -> 0. - var result = new double[nSamples]; - var expBuf = new double[nKernels]; - for (int s = 0; s < nSamples; s++) + // np.log(np.exp(weighted_log_pdf - max_[:, None]).sum(axis=1)) + max_, with -inf max_ -> 0. + var result = new double[nSamples]; + var expBuf = new double[nKernels]; + for (int s = 0; s < nSamples; s++) + { + double max = double.NegativeInfinity; + for (int k = 0; k < nKernels; k++) + max = Math.Max(max, weightedLogPdf[s * nKernels + k]); + if (double.IsNegativeInfinity(max)) + max = 0.0; + for (int k = 0; k < nKernels; k++) + { + // exp(z) is exactly +0.0 for every z below the underflow point (about -745.13: the result is under half + // the smallest subnormal), so the call is skipped well below it (plan 14): kernels far from a candidate + // are most of a long history and each exp was a few nanoseconds of the hottest loop. The zero still + // goes into the buffer, so the pairwise sum sees the same elements; NaN fails the test and still + // reaches Math.Exp, as everything at or above the bound does. + double z = weightedLogPdf[s * nKernels + k] - max; + expBuf[k] = z < ExpIsZeroBelow ? 0.0 : Math.Exp(z); + } + result[s] = Math.Log(MathUtil.PairwiseSum(expBuf)) + max; + } + return result; + } + finally { - double max = double.NegativeInfinity; - for (int k = 0; k < nKernels; k++) - max = Math.Max(max, weightedLogPdf[s, k]); - if (double.IsNegativeInfinity(max)) - max = 0.0; - for (int k = 0; k < nKernels; k++) - expBuf[k] = Math.Exp(weightedLogPdf[s, k] - max); - result[s] = Math.Log(MathUtil.PairwiseSum(expBuf)) + max; + System.Buffers.ArrayPool<double>.Shared.Return(weightedLogPdf); } - return result; } /// <summary> /// The continuous branch of <c>log_pdf</c>: <c>_truncnorm.logpdf</c> over all continuous dims, /// summed over dims and added to <paramref name="weightedLogPdf" />. The Gaussian-mass grid is - /// computed once over the <c>(n_kernels, n_cont)</c> standardized bounds, exactly as NumPy does, - /// so the <see cref="Erf" /> array-size threshold is exercised identically. + /// computed once over the <c>n_kernels × n_cont</c> standardized bounds, as NumPy does, so the + /// <see cref="Erf" /> array-size threshold is exercised identically. /// </summary> /// <param name="x">Input numerical coordinates or observation rows.</param> - /// <param name="weightedLogPdf">Log densities including each mixture component weight.</param> + /// <param name="weightedLogPdf"> + /// Log densities including each mixture component weight, (n_samples, n_kernels) row-major; at least + /// n_samples × n_kernels long (a rented buffer may be longer). + /// </param> /// <param name="contDists">Continuous numerical coordinate distributions.</param> /// <param name="contCols">Original coordinate indices of continuous numerical distributions.</param> + /// <remarks> + /// <para> + /// <b>Fused, same bits (Rustuna plan 13, item S6).</b> Everything that depends only on a (kernel, dim) + /// pair is computed once per call instead of once per candidate: the standardized bounds, their log + /// Gaussian mass and <c>log(sigma)</c>, which the per-candidate loop used to take 24 times per pair (more + /// than half of a 1,000-trial, 40-parameter TPE run). Each value is the same expression on the same + /// operands, and <c>Math.Log</c> is deterministic, so it has the same bits. + /// </para> + /// <para> + /// The grids are laid out by dimension (<c>[c * n_kernels + k]</c>) so the kernel loop is contiguous. + /// <see cref="TruncNorm.LogGaussMass(ReadOnlySpan{double}, ReadOnlySpan{double}, Span{double})" /> is elementwise, and the vectorized-<c>erf</c> switch depends only + /// on how many elements it gets (see <see cref="Erf.ComputeArray(ReadOnlySpan{double}, Span{double})" />), so evaluating the same elements in + /// another order changes no element. + /// </para> + /// <para> + /// <see cref="AddContinuousSums" /> then stores every per-dimension term as NumPy's + /// <c>(n_samples, n_kernels, n_cont)</c> array and sums it over the dimensions with NumSharp's + /// <c>np.sum(axis=-1)</c>, NumPy's pairwise order (QA-84, see there). + /// </para> + /// </remarks> private void AddContinuousLogPdf( - double[,] x, double[,] weightedLogPdf, + double[,] x, double[] weightedLogPdf, List<BatchedNumericalDistributions> contDists, List<int> contCols) { int nSamples = x.GetLength(0); int nKernels = Weights.Length; int nCont = contDists.Count; + int gridSize = nKernels * nCont; - // x_cont[c][s] = log(x[s, col]) if is_log else x[s, col]. - var xCont = new double[nCont][]; + // Every buffer below is fully written before it is read, so none is zeroed first: zeroing the grids was a tenth + // of a 1,000-trial, 40-parameter TPE run, and allocating them put four large-object-heap arrays per call on the + // GC. The grids are rented, and every use goes through a span of the logical length: LogGaussMass and the + // vectorized-erf switch depend on the length they are given, never on a rented buffer's size. + // x_cont = log(x[:, col]) where is_log else x[:, col], one row per sample ([s * nCont + c]). + var xCont = GC.AllocateUninitializedArray<double>(nSamples * nCont); for (int c = 0; c < nCont; c++) { bool isLog = contDists[c].IsLog; int col = contCols[c]; - var arr = new double[nSamples]; for (int s = 0; s < nSamples; s++) - arr[s] = isLog ? Math.Log(x[s, col]) : x[s, col]; - xCont[c] = arr; + xCont[s * nCont + c] = isLog ? Math.Log(x[s, col]) : x[s, col]; } - // Standardized bounds a, b over (n_kernels, n_cont), raveled row-major (k outer, c inner). - var aGrid = new double[nKernels * nCont]; - var bGrid = new double[nKernels * nCont]; - for (int k = 0; k < nKernels; k++) + // Standardized bounds a, b, log(sigma), the log Gaussian mass, and the kernels' mu and sigma per (kernel, dim): + // one rented buffer cut into six grids, each one row per dim over the kernels. mu and sigma are copied into rows + // of their own so the accumulation reads every operand of a (kernel block, dim) at one offset. + double[] gridBuffer = System.Buffers.ArrayPool<double>.Shared.Rent(6 * gridSize); + try { + var aGrid = new Span<double>(gridBuffer, 0, gridSize); + var bGrid = new Span<double>(gridBuffer, gridSize, gridSize); + var logSigma = new Span<double>(gridBuffer, 2 * gridSize, gridSize); + var logGaussMass = new Span<double>(gridBuffer, 3 * gridSize, gridSize); + var muGrid = new Span<double>(gridBuffer, 4 * gridSize, gridSize); + var sigmaGrid = new Span<double>(gridBuffer, 5 * gridSize, gridSize); for (int c = 0; c < nCont; c++) { var nd = contDists[c]; - double sigma = nd.Sigma[k]; - aGrid[k * nCont + c] = (nd.AdaptedLow - nd.Mu[k]) / sigma; - bGrid[k * nCont + c] = (nd.AdaptedHigh - nd.Mu[k]) / sigma; + // AdaptedLow / AdaptedHigh recompute a logarithm per access on the log kinds: the same value every time. + double adaptedLow = nd.AdaptedLow, adaptedHigh = nd.AdaptedHigh; + double[] mu = nd.Mu, sigma = nd.Sigma; + int row = c * nKernels; + for (int k = 0; k < nKernels; k++) + { + aGrid[row + k] = (adaptedLow - mu[k]) / sigma[k]; + bGrid[row + k] = (adaptedHigh - mu[k]) / sigma[k]; + logSigma[row + k] = Math.Log(sigma[k]); + } + mu.AsSpan(0, nKernels).CopyTo(muGrid.Slice(row, nKernels)); + sigma.AsSpan(0, nKernels).CopyTo(sigmaGrid.Slice(row, nKernels)); } + TruncNorm.LogGaussMass(aGrid, bGrid, logGaussMass); + + AddContinuousSums( + xCont, nSamples, nCont, muGrid, sigmaGrid, aGrid, bGrid, logGaussMass, logSigma, weightedLogPdf, nKernels); } - var logGaussMass = TruncNorm.LogGaussMass(aGrid, bGrid); + finally + { + System.Buffers.ArrayPool<double>.Shared.Return(gridBuffer); + } + } + + /// <summary> + /// Adds each candidate's continuous log density under each kernel to <paramref name="weightedLogPdf" />, as Optuna's + /// <c>weighted_log_pdf += _truncnorm.logpdf(x_cont[:, None, :], a, b, loc=mu, scale=sigma).sum(axis=-1)</c>: every + /// per-dimension term (<see cref="ContinuousLogPdfTerms" />) is stored as NumPy's C-contiguous + /// <c>(n_samples, n_kernels, n_cont)</c> array, and NumSharp's <c>np.sum(axis=-1)</c> sums each row of terms. + /// </summary> + /// <param name="xCont"> + /// The candidates' continuous coordinates, log-transformed already for the log kinds, one row of + /// <paramref name="nCont" /> per candidate (<c>[s * n_cont + c]</c>); at least n_samples × n_cont long. + /// </param> + /// <param name="nSamples">The number of candidates.</param> + /// <param name="nCont">The number of continuous dimensions.</param> + /// <param name="muGrid"> + /// The kernels' centers, one row of n_kernels per dimension (<c>[c * n_kernels + k]</c>); at least + /// n_cont × n_kernels long, like every grid. + /// </param> + /// <param name="sigmaGrid">The kernels' standard deviations, laid out as <paramref name="muGrid" />.</param> + /// <param name="aGrid">The kernels' standardized lower bounds, laid out as <paramref name="muGrid" />.</param> + /// <param name="bGrid">The kernels' standardized upper bounds, laid out as <paramref name="muGrid" />.</param> + /// <param name="logGaussMass">The log Gaussian mass between the bounds, laid out as <paramref name="muGrid" />.</param> + /// <param name="logSigma">The kernels' <c>log(sigma)</c>, laid out as <paramref name="muGrid" />.</param> + /// <param name="weightedLogPdf"> + /// (n_samples, n_kernels) row-major and at least that long; each candidate's sum per kernel is added in place. + /// </param> + /// <param name="nKernels">The number of kernels.</param> + /// <exception cref="ArgumentException"> + /// A grid, <paramref name="xCont" /> or <paramref name="weightedLogPdf" /> is shorter than the sizes imply; nothing + /// is read or written then. + /// </exception> + /// <exception cref="OverflowException"> + /// n_samples × n_kernels × n_cont exceeds the largest array (NumPy would fail to allocate its term array too). + /// </exception> + /// <remarks> + /// <para> + /// <b>Why NumSharp's sum (QA-84, owner's choice 2026-11-12).</b> NumPy sums a C-contiguous last axis pairwise: + /// below eight terms left to right, from eight on eight accumulators combined + /// <c>((r0 + r1) + (r2 + r3)) + ((r4 + r5) + (r6 + r7))</c> and then the rest, blocks over 128 split in two. The + /// port used to add the terms left to right, which made its log densities differ from Optuna's in the last bit + /// for 31–54% of (candidate, kernel) entries from eight continuous parameters on. NumSharp's + /// <c>np.sum(axis=-1)</c> equals live NumPy 2.4.2 bit for bit at every width from 1 to 300 (measured 2026-11-12), + /// so the sum is NumPy's by construction. Below eight continuous parameters the sum is the same as before. + /// </para> + /// <para> + /// <b>Cost.</b> The terms are stored where they used to stay in registers: n_samples × n_kernels × n_cont + /// doubles, 1.9 MB at 24 candidates, 1,000 kernels and 10 dimensions. Both buffers are rented, the term array and + /// the <c>out=</c> target wrap them without a copy, and NumSharp's sum allocates about 2 KB per call. NumSharp's + /// own costs on this shape (its sum runs at 0.56–0.99 of NumPy's speed, and the fresh-result form allocates + /// managed memory in proportion to its output) are pinned as OpenBugs in NumSharp + /// (<c>OpenBugs.Consumers.OptunaSharp</c>: <c>SumOverShortRows_CostsAFewLongRowSums</c>, + /// <c>SumIntoOut_CostsAboutAFreshSum</c>), still open in NumSharp 0.81.0; QA-84's 27–66% TPE cost stays until + /// they are fixed. + /// </para> + /// </remarks> + internal static void AddContinuousSums( + ReadOnlySpan<double> xCont, int nSamples, int nCont, + ReadOnlySpan<double> muGrid, ReadOnlySpan<double> sigmaGrid, + ReadOnlySpan<double> aGrid, ReadOnlySpan<double> bGrid, ReadOnlySpan<double> logGaussMass, ReadOnlySpan<double> logSigma, + Span<double> weightedLogPdf, int nKernels) + { + // Checked here as well as in ContinuousLogPdfTerms: nothing may be rented, computed or added for impossible sizes. + long gridSize = (long)nCont * nKernels; + if (nSamples < 0 || nCont < 0 || nKernels < 0 + || xCont.Length < (long)nSamples * nCont || weightedLogPdf.Length < (long)nSamples * nKernels + || muGrid.Length < gridSize || sigmaGrid.Length < gridSize || aGrid.Length < gridSize + || bGrid.Length < gridSize || logGaussMass.Length < gridSize || logSigma.Length < gridSize) + throw new ArgumentException("A continuous log-density buffer is shorter than its sizes imply."); - for (int s = 0; s < nSamples; s++) + int nRows = checked(nSamples * nKernels); + if (nRows == 0) + return; // no (candidate, kernel) entry to add to + + int termCount = checked(nRows * nCont); + double[] terms = System.Buffers.ArrayPool<double>.Shared.Rent(Math.Max(termCount, 1)); + double[] sums = System.Buffers.ArrayPool<double>.Shared.Rent(nRows); + try { - for (int k = 0; k < nKernels; k++) + ContinuousLogPdfTerms( + xCont, nSamples, nCont, muGrid, sigmaGrid, aGrid, bGrid, logGaussMass, logSigma, terms, nKernels); + + // _truncnorm.logpdf(...).sum(axis=-1). Both arrays wrap the rented buffers' first elements without a copy (NumPy's + // ndarray(shape, buffer=...) reads a prefix of a larger buffer), and the sums land straight in the second. Disposed + // at once: an undisposed NDArray is left to the finalizer and promoted past gen 0 (plan 14). + using (var termArray = new NDArray(terms, new Shape(nSamples, nKernels, nCont))) + using (var sumArray = new NDArray(sums, new Shape(nSamples, nKernels))) + np.sum(termArray, axis: -1, @out: sumArray); + + // weighted_log_pdf += ...: one IEEE addition per entry, as NumPy's elementwise add. + for (int i = 0; i < nRows; i++) + weightedLogPdf[i] += sums[i]; + } + finally + { + System.Buffers.ArrayPool<double>.Shared.Return(sums); + System.Buffers.ArrayPool<double>.Shared.Return(terms); + } + } + + /// <summary> + /// Writes every candidate's continuous log-density term under every kernel and dimension, + /// <c>(norm_logpdf((x - mu) / sigma) - log_gauss_mass) - log(sigma)</c>, with NaN where the kernel's standardized + /// interval is empty (<c>a == b</c>) and <c>-inf</c> where <c>x</c> falls outside it: the array + /// <c>np.select([a == b, (x < a) | (x > b)], [nan, -inf], default=out)</c> of <c>_truncnorm.logpdf</c>, laid + /// out C-contiguous as <c>(n_samples, n_kernels, n_cont)</c> (<c>[(s * n_kernels + k) * n_cont + c]</c>). + /// </summary> + /// <param name="xCont">The candidates' continuous coordinates, laid out as for <see cref="AddContinuousSums" />.</param> + /// <param name="nSamples">The number of candidates.</param> + /// <param name="nCont">The number of continuous dimensions.</param> + /// <param name="muGrid">The kernels' centers, one row of n_kernels per dimension.</param> + /// <param name="sigmaGrid">The kernels' standard deviations, laid out as <paramref name="muGrid" />.</param> + /// <param name="aGrid">The kernels' standardized lower bounds, laid out as <paramref name="muGrid" />.</param> + /// <param name="bGrid">The kernels' standardized upper bounds, laid out as <paramref name="muGrid" />.</param> + /// <param name="logGaussMass">The log Gaussian mass between the bounds, laid out as <paramref name="muGrid" />.</param> + /// <param name="logSigma">The kernels' <c>log(sigma)</c>, laid out as <paramref name="muGrid" />.</param> + /// <param name="terms">Receives the terms; at least n_samples × n_kernels × n_cont long.</param> + /// <param name="nKernels">The number of kernels.</param> + /// <exception cref="ArgumentException">A buffer is shorter than the sizes imply; nothing is written then.</exception> + /// <remarks> + /// <para> + /// Every term gets exactly the scalar path's operations in the same order: the same division by sigma (never a + /// multiplication by its reciprocal), the same subtraction order, the NaN and <c>-inf</c> overrides applied last. + /// The vector path's only freedom is the sign of zero in <c>-(z * z)</c>, which the subtraction of the normal's + /// log constant right after removes; .NET never contracts a multiply and an add into a fused multiply-add on its + /// own. A lane holds one kernel, so lanes never mix; the kernels after the last whole vector take the scalar path. + /// </para> + /// <para> + /// The loads go through <see cref="System.Numerics.Vector.LoadUnsafe{T}(ref readonly T, nuint)" /> at one offset + /// per (kernel block, dimension), which is why mu and sigma come as grid rows (plan 15: with span slices the bounds + /// checks were most of the loop); every length is checked once, up front, so no access leaves its buffer. A + /// kernel's terms are contiguous over the dimensions, so a vector's lanes are stored at a stride of n_cont. The + /// halving in <c>-(z * z) / 2</c> is a multiplication by 0.5, the correctly rounded value of the same real number, + /// so the bits are equal. + /// </para> + /// </remarks> + internal static void ContinuousLogPdfTerms( + ReadOnlySpan<double> xCont, int nSamples, int nCont, + ReadOnlySpan<double> muGrid, ReadOnlySpan<double> sigmaGrid, + ReadOnlySpan<double> aGrid, ReadOnlySpan<double> bGrid, ReadOnlySpan<double> logGaussMass, ReadOnlySpan<double> logSigma, + Span<double> terms, int nKernels) + { + // The unchecked accesses below rely on these sizes; checking them here keeps every access inside its buffer. + long gridSize = (long)nCont * nKernels; + if (nSamples < 0 || nCont < 0 || nKernels < 0 + || xCont.Length < (long)nSamples * nCont || terms.Length < (long)nSamples * nKernels * nCont + || muGrid.Length < gridSize || sigmaGrid.Length < gridSize || aGrid.Length < gridSize + || bGrid.Length < gridSize || logGaussMass.Length < gridSize || logSigma.Length < gridSize) + throw new ArgumentException("A continuous log-density buffer is shorter than its sizes imply."); + + if (System.Numerics.Vector.IsHardwareAccelerated && nKernels >= System.Numerics.Vector<double>.Count) + { + // Vector path: whole vector-wide kernel blocks here, then the kernels after the last whole block on the scalar + // path. + int k = 0; + int width = System.Numerics.Vector<double>.Count; + var half = new System.Numerics.Vector<double>(0.5); + var logC = new System.Numerics.Vector<double>(TruncNorm.NormPdfLogC); + var nan = new System.Numerics.Vector<double>(double.NaN); + var negativeInfinity = new System.Numerics.Vector<double>(double.NegativeInfinity); + ref double x0 = ref System.Runtime.InteropServices.MemoryMarshal.GetReference(xCont); + ref double mu0 = ref System.Runtime.InteropServices.MemoryMarshal.GetReference(muGrid); + ref double sigma0 = ref System.Runtime.InteropServices.MemoryMarshal.GetReference(sigmaGrid); + ref double a0 = ref System.Runtime.InteropServices.MemoryMarshal.GetReference(aGrid); + ref double b0 = ref System.Runtime.InteropServices.MemoryMarshal.GetReference(bGrid); + ref double logGaussMass0 = ref System.Runtime.InteropServices.MemoryMarshal.GetReference(logGaussMass); + ref double logSigma0 = ref System.Runtime.InteropServices.MemoryMarshal.GetReference(logSigma); + ref double t0 = ref System.Runtime.InteropServices.MemoryMarshal.GetReference(terms); + for (; k <= nKernels - width; k += width) { - double sum = 0.0; + for (int s = 0; s < nSamples; s++) + { + nuint xRow = (nuint)s * (nuint)nCont; + // Candidate s's first term under this block's first kernel; lane j's kernel starts j * n_cont later. + nuint tBase = ((nuint)s * (nuint)nKernels + (nuint)k) * (nuint)nCont; + // g walks this kernel block's column down the dimension rows: c * n_kernels + k. + nuint g = (nuint)k; + for (int c = 0; c < nCont; c++, g += (nuint)nKernels) + { + var aV = System.Numerics.Vector.LoadUnsafe(ref a0, g); + var bV = System.Numerics.Vector.LoadUnsafe(ref b0, g); + var xv = new System.Numerics.Vector<double>(System.Runtime.CompilerServices.Unsafe.Add(ref x0, xRow + (nuint)c)); + var xstd = (xv - System.Numerics.Vector.LoadUnsafe(ref mu0, g)) / System.Numerics.Vector.LoadUnsafe(ref sigma0, g); + var normLogPdf = -(xstd * xstd) * half - logC; + var val = (normLogPdf - System.Numerics.Vector.LoadUnsafe(ref logGaussMass0, g)) + - System.Numerics.Vector.LoadUnsafe(ref logSigma0, g); + val = System.Numerics.Vector.ConditionalSelect( + System.Numerics.Vector.LessThan(xstd, aV) | System.Numerics.Vector.GreaterThan(xstd, bV), + negativeInfinity, val); + val = System.Numerics.Vector.ConditionalSelect(System.Numerics.Vector.Equals(aV, bV), nan, val); + for (int lane = 0; lane < width; lane++) + System.Runtime.CompilerServices.Unsafe.Add(ref t0, tBase + (nuint)lane * (nuint)nCont + (nuint)c) = val[lane]; + } + } + } + ContinuousLogPdfTermsScalar( + xCont, nSamples, nCont, muGrid, sigmaGrid, aGrid, bGrid, logGaussMass, logSigma, terms, nKernels, k); + } + else + { + // Scalar path: no vector hardware, or fewer kernels than one vector holds. + ContinuousLogPdfTermsScalar( + xCont, nSamples, nCont, muGrid, sigmaGrid, aGrid, bGrid, logGaussMass, logSigma, terms, nKernels, 0); + } + } + + /// <summary> + /// The scalar path of <see cref="ContinuousLogPdfTerms" /> for the kernels from <paramref name="firstKernel" /> on: + /// every kernel when there is no vector path, and the kernels after the vector path's last whole block otherwise. + /// </summary> + /// <param name="xCont">The candidates' continuous coordinates, laid out as for <see cref="AddContinuousSums" />.</param> + /// <param name="nSamples">The number of candidates.</param> + /// <param name="nCont">The number of continuous dimensions.</param> + /// <param name="muGrid">The kernels' centers, one row of n_kernels per dimension.</param> + /// <param name="sigmaGrid">The kernels' standard deviations, laid out as <paramref name="muGrid" />.</param> + /// <param name="aGrid">The kernels' standardized lower bounds, laid out as <paramref name="muGrid" />.</param> + /// <param name="bGrid">The kernels' standardized upper bounds, laid out as <paramref name="muGrid" />.</param> + /// <param name="logGaussMass">The log Gaussian mass between the bounds, laid out as <paramref name="muGrid" />.</param> + /// <param name="logSigma">The kernels' <c>log(sigma)</c>, laid out as <paramref name="muGrid" />.</param> + /// <param name="terms">Receives the terms, laid out as for <see cref="ContinuousLogPdfTerms" />.</param> + /// <param name="nKernels">The number of kernels.</param> + /// <param name="firstKernel">The first kernel this path handles; the kernels before it are left alone.</param> + /// <exception cref="IndexOutOfRangeException">A buffer is shorter than the sizes imply (the caller checks this first).</exception> + /// <remarks> + /// The reference arithmetic the vector path reproduces lane by lane. Every access is bounds-checked; it handles at + /// most a vector's width less one kernel per call on vector hardware. + /// </remarks> + private static void ContinuousLogPdfTermsScalar( + ReadOnlySpan<double> xCont, int nSamples, int nCont, + ReadOnlySpan<double> muGrid, ReadOnlySpan<double> sigmaGrid, + ReadOnlySpan<double> aGrid, ReadOnlySpan<double> bGrid, ReadOnlySpan<double> logGaussMass, ReadOnlySpan<double> logSigma, + Span<double> terms, int nKernels, int firstKernel) + { + for (int k = firstKernel; k < nKernels; k++) + { + for (int s = 0; s < nSamples; s++) + { + int tBase = (s * nKernels + k) * nCont; for (int c = 0; c < nCont; c++) { - var nd = contDists[c]; - double mu = nd.Mu[k]; - double sigma = nd.Sigma[k]; - int gi = k * nCont + c; - double xstd = (xCont[c][s] - mu) / sigma; - double val = TruncNorm.NormLogPdf(xstd) - logGaussMass[gi] - Math.Log(sigma); - // np.select([a == b, (x < a) | (x > b)], [nan, -inf], default=out). - if (aGrid[gi] == bGrid[gi]) + int g = c * nKernels + k; + double xstd = (xCont[s * nCont + c] - muGrid[g]) / sigmaGrid[g]; + double val = TruncNorm.NormLogPdf(xstd) - logGaussMass[g] - logSigma[g]; + if (aGrid[g] == bGrid[g]) val = double.NaN; - else if (xstd < aGrid[gi] || xstd > bGrid[gi]) + else if (xstd < aGrid[g] || xstd > bGrid[g]) val = double.NegativeInfinity; - sum += val; + terms[tBase + c] = val; } - weightedLogPdf[s, k] += sum; } } } @@ -539,69 +819,246 @@ private static int BisectRight(double[] a, double v) } /// <summary> - /// Python <c>_log_gauss_mass_unique(a, b)</c>: dedup the raveled (a, b) pairs, evaluate - /// <c>_log_gauss_mass</c> once per unique pair, then scatter back. This is not merely an - /// optimization here — it fixes the array size passed to <c>erf</c>, which switches between - /// the exact and the vectorized approximation at 2000 elements (see <see cref="Erf" />). + /// The discrete branch of Python <c>_MixtureOfProductDistribution.log_pdf</c> for one stepped coordinate (a + /// discrete truncated normal or log-normal): adds the log Gaussian mass of each candidate's cell + /// <c>[x - step / 2, x + step / 2]</c> under each kernel to <paramref name="weightedLogPdf" />, then subtracts + /// each kernel's log mass over the adapted domain. /// </summary> - /// <param name="a">First numerical array operand.</param> - /// <param name="b">Second numerical array operand.</param> - /// <returns>Gaussian interval log masses expanded back to the original input order.</returns> - private static double[] LogGaussMassUnique(double[] a, double[] b) + /// <param name="x">The candidates, one row per sample and one column per coordinate.</param> + /// <param name="column">This coordinate's column in <paramref name="x" />.</param> + /// <param name="dtn">This coordinate's batched distributions; their step is positive.</param> + /// <param name="weightedLogPdf"> + /// Log densities, (n_samples, n_kernels) row-major and at least that long (a rented buffer may be longer); this + /// coordinate's terms are added in place. + /// </param> + /// <exception cref="IndexOutOfRangeException"><paramref name="weightedLogPdf" /> is shorter than n_samples × n_kernels.</exception> + /// <remarks> + /// <para> + /// Python, for each stepped coordinate <c>i</c>: + /// <code> + /// xi_uniq, xi_inv = np.unique(x[:, i], return_inverse=True) + /// mu_uniq, sigma_uniq, mu_sigma_inv = _unique_inverse_2d(d.mu, d.sigma) + /// left = np.log(xi_uniq - step / 2) if is_log else (xi_uniq - step / 2) + /// right = np.log(xi_uniq + step / 2) if is_log else (xi_uniq + step / 2) + /// weighted_log_pdf += _log_gauss_mass_unique( + /// (left[:, np.newaxis] - mu_uniq) / sigma_uniq, + /// (right[:, np.newaxis] - mu_uniq) / sigma_uniq, + /// )[np.ix_(xi_inv, mu_sigma_inv)] + /// weighted_log_pdf -= _truncnorm._log_gauss_mass( + /// (d.adapted_low - mu_uniq) / sigma_uniq, (d.adapted_high - mu_uniq) / sigma_uniq + /// )[mu_sigma_inv] + /// </code> + /// The dedup inside <c>_log_gauss_mass_unique</c> is not merely an optimization: it fixes the array size + /// passed to <c>erf</c>, which switches between the exact and the vectorized approximation at 2000 elements + /// (see <see cref="Erf" />). + /// </para> + /// <para> + /// <b>Hashed dedups, same bits (plan 15).</b> The three dedups (the candidates' values, the kernels, and the + /// candidate-by-kernel grid of standardized cell bounds) used to sort with LINQ, the grid being up to + /// n_samples × n_kernels pairs: with ten integer parameters and a thousand kernels one call took 5 ms and + /// allocated 1.9 MB. <see cref="UniqueInverse" /> finds the same groups by hashing, in order of first + /// occurrence instead of sorted, and every buffer is rented. Nothing computed depends on that order: the + /// unique set and its size are the same, + /// <see cref="TruncNorm.LogGaussMass(ReadOnlySpan{double}, ReadOnlySpan{double}, Span{double})" /> is + /// elementwise and picks its <c>erf</c> path from the number of central elements alone, and each sum still + /// receives the same terms in the same order (the cell's log mass, then minus the domain's). The members of a + /// group differ at most in the sign of a zero, which no log mass depends on (<c>ndtr(±0)</c> is 0.5 either + /// way and both zeros take the same side of every comparison), so which member represents it does not + /// matter either. + /// </para> + /// </remarks> + internal static void AddDiscreteLogPdf(double[,] x, int column, BatchedNumericalDistributions dtn, double[] weightedLogPdf) { - var (aUniq, bUniq, inv) = UniqueInverse2d(a, b); - var lgmUniq = TruncNorm.LogGaussMass(aUniq, bUniq); - var result = new double[a.Length]; - for (int j = 0; j < a.Length; j++) - result[j] = lgmUniq[inv[j]]; - return result; - } + int nSamples = x.GetLength(0); + double[] mu = dtn.Mu, sigma = dtn.Sigma; + int nKernels = mu.Length; + bool isLog = dtn.IsLog; + double step = dtn.Step; + // AdaptedLow / AdaptedHigh recompute a logarithm per access on the log kinds: the same value every time. + double adaptedLow = dtn.AdaptedLow, adaptedHigh = dtn.AdaptedHigh; - /// <summary>NumPy <c>np.unique(x, return_inverse=True)</c> for a 1-D array.</summary> - /// <param name="x">Input numerical coordinates or observation rows.</param> - /// <returns>Sorted unique values and inverse indices reconstructing the input.</returns> - private static (double[] Uniq, int[] Inv) UniqueInverse1d(double[] x) - { - int n = x.Length; - var order = Enumerable.Range(0, n).OrderBy(i => x[i]).ToArray(); - var uniq = new List<double>(); - var inv = new int[n]; - for (int k = 0; k < n; k++) + // Candidate- and kernel-sized buffers, cut from one rented array each: the column, its unique values (and the + // 1-D dedup's second component, the same values again), the unique kernels, the domain's standardized bounds + // and log mass per unique kernel; and the two inverse maps. + double[] perCall = System.Buffers.ArrayPool<double>.Shared.Rent(Math.Max(3 * nSamples + 5 * nKernels, 1)); + int[] perCallIndexes = System.Buffers.ArrayPool<int>.Shared.Rent(Math.Max(nSamples + nKernels, 1)); + try { - int idx = order[k]; - if (k == 0 || x[idx] != x[order[k - 1]]) - uniq.Add(x[idx]); - inv[idx] = uniq.Count - 1; + var xcol = new Span<double>(perCall, 0, nSamples); + var xiUniq = new Span<double>(perCall, nSamples, nSamples); + var xiUniqAgain = new Span<double>(perCall, 2 * nSamples, nSamples); + var muUniq = new Span<double>(perCall, 3 * nSamples, nKernels); + var sigmaUniq = new Span<double>(perCall, 3 * nSamples + nKernels, nKernels); + var normLow = new Span<double>(perCall, 3 * nSamples + 2 * nKernels, nKernels); + var normHigh = new Span<double>(perCall, 3 * nSamples + 3 * nKernels, nKernels); + var norm = new Span<double>(perCall, 3 * nSamples + 4 * nKernels, nKernels); + var xiInv = new Span<int>(perCallIndexes, 0, nSamples); + var msInv = new Span<int>(perCallIndexes, nSamples, nKernels); + + for (int s = 0; s < nSamples; s++) + xcol[s] = x[s, column]; + // np.unique of one array: a value paired with itself matches another pair exactly when the values compare + // equal, so the pair dedup groups the values as the 1-D one did. + int nXi = UniqueInverse(xcol, xcol, xiUniq, xiUniqAgain, xiInv); + int nMs = UniqueInverse(mu, sigma, muUniq, sigmaUniq, msInv); + + // The standardized cell bounds of every (unique candidate, unique kernel) pair, row-major by candidate, their + // dedup, and the log mass of each unique pair; sized by the dedups above, so rented only now. + int gridSize = nXi * nMs; + double[] grid = System.Buffers.ArrayPool<double>.Shared.Rent(Math.Max(5 * gridSize, 1)); + int[] gridIndexes = System.Buffers.ArrayPool<int>.Shared.Rent(Math.Max(gridSize, 1)); + try + { + var a = new Span<double>(grid, 0, gridSize); + var b = new Span<double>(grid, gridSize, gridSize); + var aUniq = new Span<double>(grid, 2 * gridSize, gridSize); + var bUniq = new Span<double>(grid, 3 * gridSize, gridSize); + var logMassUniq = new Span<double>(grid, 4 * gridSize, gridSize); + var gridInv = new Span<int>(gridIndexes, 0, gridSize); + for (int p = 0; p < nXi; p++) + { + double left = isLog ? Math.Log(xiUniq[p] - step / 2.0) : xiUniq[p] - step / 2.0; + double right = isLog ? Math.Log(xiUniq[p] + step / 2.0) : xiUniq[p] + step / 2.0; + for (int qi = 0; qi < nMs; qi++) + { + a[p * nMs + qi] = (left - muUniq[qi]) / sigmaUniq[qi]; + b[p * nMs + qi] = (right - muUniq[qi]) / sigmaUniq[qi]; + } + } + int nUnique = UniqueInverse(a, b, aUniq, bUniq, gridInv); + // Exactly the unique pairs, as _log_gauss_mass_unique passes them: their count picks the erf path. + TruncNorm.LogGaussMass(aUniq[..nUnique], bUniq[..nUnique], logMassUniq); + + for (int s = 0; s < nSamples; s++) + { + int row = xiInv[s] * nMs; + for (int k = 0; k < nKernels; k++) + weightedLogPdf[s * nKernels + k] += logMassUniq[gridInv[row + msInv[k]]]; + } + } + finally + { + System.Buffers.ArrayPool<double>.Shared.Return(grid); + System.Buffers.ArrayPool<int>.Shared.Return(gridIndexes); + } + + for (int qi = 0; qi < nMs; qi++) + { + normLow[qi] = (adaptedLow - muUniq[qi]) / sigmaUniq[qi]; + normHigh[qi] = (adaptedHigh - muUniq[qi]) / sigmaUniq[qi]; + } + // Python skips the dedup here ("very unlikely to observe duplications"), so the count is the unique kernels'. + TruncNorm.LogGaussMass(normLow[..nMs], normHigh[..nMs], norm); + for (int s = 0; s < nSamples; s++) + { + for (int k = 0; k < nKernels; k++) + weightedLogPdf[s * nKernels + k] -= norm[msInv[k]]; + } + } + finally + { + System.Buffers.ArrayPool<double>.Shared.Return(perCall); + System.Buffers.ArrayPool<int>.Shared.Return(perCallIndexes); } - return (uniq.ToArray(), inv); } /// <summary> - /// Python <c>_unique_inverse_2d(a, b)</c>: the unique (a, b) row pairs sorted - /// lexicographically, plus the inverse mapping original-index → unique-index. + /// The unique (a, b) pairs of two equally long arrays, in order of first occurrence, and for each position the + /// index of its pair among them: Python's <c>_unique_inverse_2d(a, b)</c>, and <c>np.unique(x, + /// return_inverse=True)</c> when both arrays are <c>x</c>, except that those return the pairs sorted. /// </summary> - /// <param name="a">First numerical array operand.</param> - /// <param name="b">Second numerical array operand.</param> - /// <returns>Sorted unique paired values and inverse indices reconstructing the input pairs.</returns> - private static (double[] AUniq, double[] BUniq, int[] Inv) UniqueInverse2d(double[] a, double[] b) + /// <param name="a">The pairs' first components.</param> + /// <param name="b">The pairs' second components; as long as <paramref name="a" />, and may be the same span.</param> + /// <param name="uniqueA"> + /// Receives the unique pairs' first components; at least as long as <paramref name="a" /> and overlapping neither + /// input. + /// </param> + /// <param name="uniqueB">Receives their second components; the same requirements as <paramref name="uniqueA" />.</param> + /// <param name="inverse"> + /// Receives, for each position of <paramref name="a" />, the index of its pair in <paramref name="uniqueA" /> and + /// <paramref name="uniqueB" />; at least as long as <paramref name="a" />. + /// </param> + /// <returns>The number of unique pairs, written to the front of <paramref name="uniqueA" /> and <paramref name="uniqueB" />.</returns> + /// <exception cref="IndexOutOfRangeException"><paramref name="b" /> or an output is shorter than <paramref name="a" />.</exception> + /// <remarks> + /// <para> + /// Two pairs are the same when both components compare equal with <c>==</c>, the test NumPy's version applies + /// to neighbors after sorting (<c>(a_order[1:] != a_order[:-1]) | (b_order[1:] != b_order[:-1])</c>): -0.0 + /// equals 0.0, and a NaN equals nothing, so a pair holding a NaN is always a new one. The pair kept for a group + /// is its first occurrence, as with the stable LINQ sort this replaced. Only the order of the unique pairs + /// differs from Python's, and no caller computes anything that depends on it. + /// </para> + /// <para> + /// An open-addressing table with linear probing, at most half full, holds each unique pair's index plus one + /// (zero marks an empty slot). Pairs holding a NaN are never stored, because no later pair can match them, so + /// they cannot pile up in one probe chain either. + /// </para> + /// </remarks> + internal static int UniqueInverse( + ReadOnlySpan<double> a, ReadOnlySpan<double> b, Span<double> uniqueA, Span<double> uniqueB, Span<int> inverse) { int n = a.Length; - var order = Enumerable.Range(0, n).OrderBy(i => a[i]).ThenBy(i => b[i]).ToArray(); - var aUniq = new List<double>(); - var bUniq = new List<double>(); - var inv = new int[n]; - for (int k = 0; k < n; k++) + int capacity = (int)System.Numerics.BitOperations.RoundUpToPowerOf2((uint)Math.Max(2 * n, 16)); + int mask = capacity - 1; + int[] table = System.Buffers.ArrayPool<int>.Shared.Rent(capacity); + try { - int idx = order[k]; - int prev = order[k - 1 < 0 ? 0 : k - 1]; - // NumPy's `!=` treats -0.0 == 0.0 and NaN != NaN, matching C# `!=` on double. - if (k == 0 || a[idx] != a[prev] || b[idx] != b[prev]) + // A rented array holds a previous caller's entries: every slot must read as empty first. + Array.Clear(table, 0, capacity); + int count = 0; + for (int i = 0; i < n; i++) { - aUniq.Add(a[idx]); - bUniq.Add(b[idx]); + double ai = a[i], bi = b[i]; + if (double.IsNaN(ai) || double.IsNaN(bi)) + { + uniqueA[count] = ai; + uniqueB[count] = bi; + inverse[i] = count++; + continue; + } + int slot = PairHash(ai, bi) & mask; + while (true) + { + int entry = table[slot]; + if (entry == 0) + { + uniqueA[count] = ai; + uniqueB[count] = bi; + inverse[i] = count++; + table[slot] = count; + break; + } + if (uniqueA[entry - 1] == ai && uniqueB[entry - 1] == bi) + { + inverse[i] = entry - 1; + break; + } + slot = (slot + 1) & mask; + } } - inv[idx] = aUniq.Count - 1; + return count; + } + finally + { + System.Buffers.ArrayPool<int>.Shared.Return(table); } - return (aUniq.ToArray(), bUniq.ToArray(), inv); + } + + /// <summary>A hash of a pair of doubles, equal for any two pairs whose components compare equal.</summary> + /// <param name="a">The first component; not NaN.</param> + /// <param name="b">The second component; not NaN.</param> + /// <returns>A well-mixed 32-bit value, possibly negative; callers mask it to a power-of-two table size.</returns> + private static int PairHash(double a, double b) + { + // -0.0 == 0.0, so the two zeros must hash alike: both hash as +0.0. Any other values that compare equal have + // the same bits. + ulong ka = a == 0.0 ? 0UL : (ulong)BitConverter.DoubleToInt64Bits(a); + ulong kb = b == 0.0 ? 0UL : (ulong)BitConverter.DoubleToInt64Bits(b); + // SplitMix64's finalizer over both keys: doubles of integers differ only in their high bits, which the + // multiplications and shifts spread over the low bits the mask keeps. + ulong h = (ka * 0x9E3779B97F4A7C15UL) ^ kb; + h = (h ^ (h >> 30)) * 0xBF58476D1CE4E5B9UL; + h = (h ^ (h >> 27)) * 0x94D049BB133111EBUL; + return (int)(h ^ (h >> 31)); } } diff --git a/src/OptunaSharp.Core/Samplers/Tpe/TpeObservationCache.cs b/src/OptunaSharp.Core/Samplers/Tpe/TpeObservationCache.cs new file mode 100644 index 0000000..407bf5c --- /dev/null +++ b/src/OptunaSharp.Core/Samplers/Tpe/TpeObservationCache.cs @@ -0,0 +1,235 @@ +using System; +using System.Collections.Generic; +using System.Runtime.CompilerServices; +using OptunaSharp.Distributions; +using OptunaSharp.Storages; + +namespace OptunaSharp.Samplers.Tpe; + +/// <summary> +/// The internal value of each parameter TPE has read from a finished trial, by trial number (plan 14; Rustuna's +/// "reuse completed observations across trials", ddd9c56 / e7a22d7). Every ask converts the whole history once per +/// parameter (twice in the independent mode, for the below and the above group); a finished trial never changes, so +/// its conversion is done once and later asks read a dense column instead of chasing each trial's parameter +/// dictionary and boxed value. +/// </summary> +/// <remarks> +/// <para><b>Same values.</b> A column is keyed by the parameter name and the search-space distribution the value is +/// converted with (value equality: equal distributions convert every external value alike), and holds exactly what +/// <see cref="BaseDistribution.ToInternalRepr" /> returned for that finished trial, or that the trial lacks the name. +/// Unfinished trials (constant liar's running trials, whose relative parameters still arrive) are never cached.</para> +/// <para><b>Lifetime.</b> The cache answers for one study at a time: a call for another study or storage (a sampler +/// reused across studies) starts over. Dynamic search spaces add a column per distinct distribution; past +/// <see cref="MaxColumns" /> the cache starts over rather than grow without bound. The storage is held weakly, as +/// <see cref="Internal.PerStudyState{TState}" /> holds it, so a long-lived sampler does not keep the last storage it +/// served alive.</para> +/// <para><b>Recreated studies.</b> The storage object and the study id do not identify a history on their own: SQLite +/// reuses the highest deleted study and trial ids, and a gRPC proxy or a custom storage passes them through as one +/// storage object, so a study deleted and recreated under the same id shows the cache different trials under the +/// numbers it holds. Each cached row therefore keeps its trial's identity (storage id and start time, the +/// <see cref="Internal.TrialAnchor" /> rule), and every <see cref="ColumnsFor" /> checks the finished trials it is +/// given against it before any row is read: one mismatch and the cache starts over.</para> +/// <para><b>Concurrency.</b> Not thread-safe; TPE uses it only inside sampling, which runs under the sampler's lock +/// (each <see cref="SamplerConcurrency.PerWorker" /> instance has its own cache).</para> +/// </remarks> +internal sealed class TpeObservationCache +{ + /// <summary>How many (name, distribution) columns are kept before the cache starts over.</summary> + internal const int MaxColumns = 256; + + /// <summary>The state of a column entry whose trial has not been read yet.</summary> + internal const byte Unknown = 0; + + /// <summary>The state of a column entry holding the finished trial's internal value.</summary> + internal const byte Present = 1; + + /// <summary>The state of a column entry whose finished trial lacks the parameter.</summary> + internal const byte Absent = 2; + + /// <summary>The trial id recorded for a trial number no column holds a row for (storage ids are never negative).</summary> + private const int NoRow = -1; + + /// <summary>The start time recorded for a cached trial that had none, which then matches any start time.</summary> + private const long NoStart = long.MinValue; + + private readonly Dictionary<(string Name, BaseDistribution Distribution), Column> _columns = new(); + private WeakReference<BaseStorage>? _storage; + private int _studyId; + // The identity of the trial each cached row was read from, by trial number: its storage id (NoRow where no row is + // cached) and its start time in ticks (NoStart where it had none). Shared by every column, since a row is one trial. + private int[] _rowTrialIds = Array.Empty<int>(); + private long[] _rowStartTicks = Array.Empty<long>(); + + /// <summary> + /// How many times the cache started over because a trial number it holds now carries another trial (a study + /// recreated under a reused id), for the tests that check a live study never triggers it. + /// </summary> + internal int IdentityRestarts { get; private set; } + + /// <summary>One parameter's cached values by trial number, with each entry's state.</summary> + internal sealed class Column + { + private double[] _values = Array.Empty<double>(); + private byte[] _states = Array.Empty<byte>(); + + /// <summary>The state of trial <paramref name="number" />'s entry: <see cref="Unknown" />, <see cref="Present" /> or <see cref="Absent" />.</summary> + /// <param name="number">The trial's number in its study.</param> + /// <returns>The entry's state; <see cref="Unknown" /> beyond the entries written so far.</returns> + [MethodImpl(MethodImplOptions.AggressiveInlining)] + internal byte StateOf(int number) => (uint)number < (uint)_states.Length ? _states[number] : Unknown; + + /// <summary>The internal value cached for trial <paramref name="number" />; meaningful only when its state is <see cref="Present" />.</summary> + /// <param name="number">The trial's number in its study.</param> + /// <returns>The cached internal value.</returns> + [MethodImpl(MethodImplOptions.AggressiveInlining)] + internal double ValueOf(int number) => _values[number]; + + /// <summary>Records the internal value a finished trial's parameter converts to.</summary> + /// <param name="number">The trial's number in its study.</param> + /// <param name="value">The value <see cref="BaseDistribution.ToInternalRepr" /> returned.</param> + internal void SetPresent(int number, double value) + { + EnsureCapacity(number); + _values[number] = value; + _states[number] = Present; + } + + /// <summary>Records that a finished trial lacks the parameter.</summary> + /// <param name="number">The trial's number in its study.</param> + internal void SetAbsent(int number) + { + EnsureCapacity(number); + _states[number] = Absent; + } + + /// <summary>Grows both arrays (doubling) so <paramref name="number" /> is a valid index; new entries are <see cref="Unknown" />.</summary> + /// <param name="number">The index that must become valid.</param> + private void EnsureCapacity(int number) + { + if (number < _states.Length) + return; + int size = Math.Max(Math.Max(16, number + 1), 2 * _states.Length); + Array.Resize(ref _values, size); + Array.Resize(ref _states, size); + } + } + + /// <summary>How many (name, distribution) columns the cache holds now.</summary> + internal int ColumnCount => _columns.Count; + + /// <summary> + /// Forgets everything, as a new sampler would know nothing. Sampling never needs it (a changed study resets the cache + /// on its own); tests use it to compare a warm cache with a cold one. + /// </summary> + internal void Reset() + { + ForgetRows(); + _storage = null; + _studyId = 0; + } + + /// <summary> + /// The columns for one search space, in its order, after starting over when the study changed, when a trial number + /// the cache holds now carries another trial, or when the cache grew past <see cref="MaxColumns" />. + /// </summary> + /// <param name="study">The study being sampled; its id and storage identify the history the cache answers for.</param> + /// <param name="trials"> + /// The trials the caller is about to read rows for. Each one whose number has a cached row must be the trial that + /// row was read from (same storage id and, when both are known, start time), or the cache starts over before + /// anything is read. + /// </param> + /// <param name="names">The search space's parameter names, in order.</param> + /// <param name="distributions">The search space's distributions, in the same order.</param> + /// <returns>One column per parameter, aligned with <paramref name="names" />.</returns> + internal Column[] ColumnsFor( + Study study, IReadOnlyList<FrozenTrial> trials, string[] names, BaseDistribution[] distributions) + { + BaseStorage storage = study.Storage; + if (_storage is null || !_storage.TryGetTarget(out BaseStorage? held) || !ReferenceEquals(held, storage) + || _studyId != study.StudyId) + { + ForgetRows(); + _storage = new WeakReference<BaseStorage>(storage); + _studyId = study.StudyId; + } + else if (!RowsMatch(trials)) + { + // The same storage object and study id now hold another history: the study was deleted and recreated under a + // reused id. Nothing cached for the old one may be read, so every row goes, before the caller reads any. + ForgetRows(); + IdentityRestarts++; + } + // Only the columns go: the row identities still describe this study's trials, and a row without column entries is + // never read. + if (_columns.Count + names.Length > MaxColumns) + _columns.Clear(); + + var result = new Column[names.Length]; + for (int i = 0; i < names.Length; i++) + { + var key = (names[i], distributions[i]); + if (!_columns.TryGetValue(key, out Column? column)) + { + column = new Column(); + _columns[key] = column; + } + result[i] = column; + } + return result; + } + + /// <summary> + /// Records which trial a finished trial's row was read from; called whenever a column records its value or its + /// absence, so that <see cref="ColumnsFor" /> can tell the trial from another one under the same number later. + /// </summary> + /// <param name="trial">The finished trial whose row a column now holds.</param> + internal void RememberTrial(FrozenTrial trial) + { + int number = trial.Number; + if (number >= _rowTrialIds.Length) + { + // Doubling, like the columns; the new entries hold no row until a trial is recorded there. + int oldSize = _rowTrialIds.Length; + int size = Math.Max(Math.Max(16, number + 1), 2 * oldSize); + Array.Resize(ref _rowTrialIds, size); + Array.Resize(ref _rowStartTicks, size); + Array.Fill(_rowTrialIds, NoRow, oldSize, size - oldSize); + } + _rowTrialIds[number] = trial.TrialId; + _rowStartTicks[number] = trial.DatetimeStart?.Ticks ?? NoStart; + } + + /// <summary> + /// Whether every trial in <paramref name="trials" /> whose number has a cached row is the trial that row was read + /// from: the same storage id and, when both start times are known, the same start time (the + /// <see cref="Internal.TrialAnchor" /> rule; SQLite reuses deleted trial ids too, but a recreated trial starts + /// later). + /// </summary> + /// <param name="trials">The trials about to be read; numbers without a cached row are not checked.</param> + /// <returns><c>true</c> when no cached row belongs to another trial.</returns> + private bool RowsMatch(IReadOnlyList<FrozenTrial> trials) + { + int[] ids = _rowTrialIds; + for (int i = 0; i < trials.Count; i++) + { + FrozenTrial trial = trials[i]; + int number = trial.Number; + if ((uint)number >= (uint)ids.Length || ids[number] == NoRow) + continue; + if (ids[number] != trial.TrialId) + return false; + long cachedStart = _rowStartTicks[number]; + if (cachedStart != NoStart && trial.DatetimeStart is { } start && start.Ticks != cachedStart) + return false; + } + return true; + } + + /// <summary>Drops every column and every row identity; the study and storage the cache answers for stay.</summary> + private void ForgetRows() + { + _columns.Clear(); + _rowTrialIds = Array.Empty<int>(); + _rowStartTicks = Array.Empty<long>(); + } +} diff --git a/src/OptunaSharp.Core/Samplers/Turbo/TurboGpFit.cs b/src/OptunaSharp.Core/Samplers/Turbo/TurboGpFit.cs index 8a2fb42..321436b 100644 --- a/src/OptunaSharp.Core/Samplers/Turbo/TurboGpFit.cs +++ b/src/OptunaSharp.Core/Samplers/Turbo/TurboGpFit.cs @@ -121,9 +121,18 @@ internal static GPRegressor Fit( try { - LBfgsB.Result res = LBfgsB.Minimize( - raw => gpr.LossAndGrad(raw, minimumNoise, deterministicObjective), - initial, bounds, m: 10, factr: 1e7, pgtol: gtol, maxfun: 15000, maxiter: 15000, maxls: 20); + LBfgsB.Result res; + try + { + res = LBfgsB.Minimize( + raw => gpr.LossAndGrad(raw, minimumNoise, deterministicObjective), + initial, bounds, m: 10, factr: 1e7, pgtol: gtol, maxfun: 15000, maxiter: 15000, maxls: 20); + } + finally + { + // The loss is not evaluated again; the regressor is kept for its posterior, without the fit's scratch. + gpr.ReleaseFitScratch(); + } // A non-zero warn flag is scipy/Optuna's "Optimization failed" — treat as a fit failure and // fall back, rather than trusting an unconverged point that may violate the box. if (res.WarnFlag != 0) diff --git a/src/OptunaSharp.Core/Samplers/Turbo/TurboMOptimizer.cs b/src/OptunaSharp.Core/Samplers/Turbo/TurboMOptimizer.cs index 047ac62..9136ef4 100644 --- a/src/OptunaSharp.Core/Samplers/Turbo/TurboMOptimizer.cs +++ b/src/OptunaSharp.Core/Samplers/Turbo/TurboMOptimizer.cs @@ -127,7 +127,7 @@ internal static (int RegionIndex, int Candidate) SelectAcrossTrustRegions( // Draw this region's independent Thompson realization on the shared stream, in region order, so the // outcome is a pure function of (seed, labels) regardless of how the host schedules trials. - double[] z = rng.randn(n).ToArray<double>(); + double[] z = NumPyDraws.Randn(rng, n); double[] sample = ThompsonSample(region.CandidateMean, region.CandidateCov, z); for (int i = 0; i < n; i++) diff --git a/src/OptunaSharp.Core/Samplers/Turbo/TurboOptimizer.cs b/src/OptunaSharp.Core/Samplers/Turbo/TurboOptimizer.cs index e1e63f0..03fa655 100644 --- a/src/OptunaSharp.Core/Samplers/Turbo/TurboOptimizer.cs +++ b/src/OptunaSharp.Core/Samplers/Turbo/TurboOptimizer.cs @@ -12,8 +12,9 @@ // over a Sobol perturbation set restricted to the TR; the TR expands after consecutive successes, shrinks // after consecutive failures, and restarts once it collapses below a floor. This class holds the pure TR // geometry + Thompson-sampling math (no Optuna/GP wiring); `TurboSampler` drives it. TuRBO has no `cmaes`/ -// Optuna/OptunaHub counterpart, so — like `LmCma` / `De` — this is a native implementation validated by -// convergence, not bit-matched to an upstream trajectory. RNG is NumSharp's MT19937 (never System.Random). +// Optuna counterpart; OptunaHub's `samplers/turbo` is another implementation this one does not follow (see +// `TurboSampler`), so — like `LmCma` / `De` — this is a native implementation validated by convergence, not +// bit-matched to an upstream trajectory. RNG is NumSharp's MT19937 (never System.Random). using System; using NumSharp; @@ -325,7 +326,7 @@ internal static int ThompsonArgmax(double[] mean, double[,] cov, NumPyRandom rng // z is drawn once (before the jitter loop) so the sample is identical regardless of how many jitter // levels the Cholesky needs — keeping the result reproducible from the per-trial seed. - double[] z = rng.randn(n).ToArray<double>(); + double[] z = NumPyDraws.Randn(rng, n); double[]? sample = null; foreach (double jitter in JitterLevels) diff --git a/src/OptunaSharp.Core/Samplers/TurboSampler.cs b/src/OptunaSharp.Core/Samplers/TurboSampler.cs index 95e7240..59b403c 100644 --- a/src/OptunaSharp.Core/Samplers/TurboSampler.cs +++ b/src/OptunaSharp.Core/Samplers/TurboSampler.cs @@ -40,12 +40,27 @@ namespace OptunaSharp.Samplers; /// uniformly better — it wins on multimodal/deceptive problems and can tie or slightly lose on easy ones; /// the paper accordingly reports TuRBO-1 <b>and</b> TuRBO-5/-20 by regime.</para> /// -/// <para><b>Beyond-core, convergence-validated.</b> TuRBO has no Optuna counterpart, so — like +/// <para><b>Beyond-core, convergence-validated.</b> Optuna itself has no TuRBO. OptunaHub has one, by the +/// Optuna team (<c>samplers/turbo</c>, <c>TuRBOSampler</c>, since 2025-09), which this class does not follow: +/// it ports the paper (Eriksson et al. 2019), so a study moved over from the hub package gets other defaults +/// and other trials (map below; QA-70, owner's decision of 2026-11-12 to keep this port). So — like /// <see cref="LmCmaSampler" /> and <see cref="DifferentialEvolutionSampler" /> — it is validated by /// convergence rather than parity. GP fitting + Thompson sampling ride the same native GP stack as /// <see cref="GPSampler" /> (hand-derived Matérn-5/2 marginal-likelihood gradient, managed L-BFGS-B, /// OpenBLAS Cholesky), so results are tolerance-reproducible on a platform, not bit-exact vs BoTorch.</para> /// +/// <para><b>OptunaHub's <c>TuRBOSampler</c> and this class</b> (registry pinned in <c>refs/optunahub-registry</c>):</para> +/// <list type="table"> +/// <listheader><term>OptunaHub <c>TuRBOSampler</c></term><description>This class</description></listheader> +/// <item><term><c>n_trust_region=5</c></term><description><c>numTrustRegions = 1</c> (TuRBO-1; pass 5 for TuRBO-5)</description></item> +/// <item><term><c>n_startup_trials=4</c></term><description><c>nInit</c>: <c>2·d</c> Sobol points per (re)start</description></item> +/// <item><term><c>failure_tolerance=5</c></term><description><c>failureTolerance</c>: the paper's <c>d</c></description></item> +/// <item><term><c>success_tolerance=3</c>, <c>init_length=0.8</c>, <c>max_length=1.6</c>, <c>min_length=0.5**7</c></term><description><c>successTolerance = 3</c>, +/// <c>lengthInit = 0.8</c>, <c>lengthMax = 1.6</c>, <c>lengthMin = 1/128</c>: the same values</description></item> +/// <item><term><c>seed</c>, <c>independent_sampler</c>, <c>deterministic_objective</c>, <c>warn_independent_sampling</c></term><description>the +/// same names in C# casing; plus <c>numCandidates</c>, <c>successMargin</c>, <c>minimumNoise</c></description></item> +/// </list> +/// /// <para><b>Continuous / integer only.</b> The trust-region box is a continuous construct, so the /// relative search space is Float/Int only; categorical and single-valued parameters are delegated to /// the independent sampler, exactly as in <see cref="CmaEsSampler" />. Dynamic search spaces fall back @@ -314,7 +329,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S int m = restartTrials.Count; double[,] normalizedParams = internalSpace.GetNormalizedParams( - restartTrials.Select(t => (IReadOnlyDictionary<string, object?>)t.ParamsDict).ToList()); + restartTrials.Select(t => t.Params).ToList()); // Standardize the local run's scores for the GP fit (the paper standardizes objective values before // fitting; §C). `clipped` keeps the maximization-oriented observations for the center rule. @@ -485,7 +500,7 @@ private TrustRegionSample BuildRegionSample( int mRestart = restartTrials.Count; double[,] normalizedParams = internalSpace.GetNormalizedParams( - restartTrials.Select(t => (IReadOnlyDictionary<string, object?>)t.ParamsDict).ToList()); + restartTrials.Select(t => t.Params).ToList()); // Standardize the run's maximization-oriented scores for the GP fit; keep mean/std to un-standardize the // Thompson draw for the cross-region comparison (each region standardizes by its OWN constants). diff --git a/src/OptunaSharp.Core/Samplers/VkdCmaSampler.cs b/src/OptunaSharp.Core/Samplers/VkdCmaSampler.cs index eb2a372..d09b1e6 100644 --- a/src/OptunaSharp.Core/Samplers/VkdCmaSampler.cs +++ b/src/OptunaSharp.Core/Samplers/VkdCmaSampler.cs @@ -232,7 +232,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S { // Re-derive x in optimizer space from the stored (clamped) params, so the optimizer learns // from the actually-evaluated points. Flip sign for maximization. - double[] x = trans.Transform(t.ParamsDict).ToArray<double>(); + double[] x = trans.Transform(t.Params).ToArray<double>(); double y = study.Direction == StudyDirection.Minimize ? t.Value!.Value : -t.Value!.Value; solutions.Add((x, y)); } @@ -299,27 +299,50 @@ private static Dictionary<string, string> SplitOptimizerStr(string optimizerStr) private static string SerializeOptimizer(VkdCma optimizer) => "vkdcma\n" + OptimizerStateJson.Serialize(optimizer.ToState()); + /// <summary> + /// The last stored optimizer text this instance parsed, and the state parsed from it (plan 15, as + /// <c>DifferentialEvolutionSampler</c> keeps it): the text changes once per generation, and every ask in between + /// parsed the same JSON again. Guarded by the sampler's monitor, like every hook; a per-worker instance has its + /// own. + /// </summary> + /// <remarks> + /// Safe to share across asks because FromState never changes the state it reads: the <see cref="VkdCma" /> rebuilt from it clones or copies every array of the state and reads the rest as numbers. A parse that throws + /// stores nothing, so the next ask parses (and throws) again, as before. + /// </remarks> + private (string Text, VkdCmaState State)? _parsedState; + /// <summary>Decodes a persisted optimizer tag and reconstructs its matching state type.</summary> /// <param name="optimizerStr">Tagged serialized optimizer state, after any chunk reassembly.</param> - /// <returns>The optimizer reconstructed from the tagged state.</returns> + /// <returns>A new optimizer reconstructed from the tagged state; the caller may change it freely.</returns> /// <exception cref="System.NotSupportedException">The serialized optimizer tag is unknown.</exception> /// <exception cref="System.Text.Json.JsonException">The persisted optimizer payload is not valid JSON for its state type, or is the literal null.</exception> /// <exception cref="System.ArgumentException">The decoded state contains invalid optimizer constructor settings.</exception> /// <exception cref="System.ArgumentOutOfRangeException">The stored text has no <c><tag>\n</c> line.</exception> - private static VkdCma DeserializeOptimizer(string optimizerStr) + /// <remarks>Parses the JSON only when the text differs from the last one parsed (<see cref="_parsedState" />); a new optimizer is built from the state every time.</remarks> + private VkdCma DeserializeOptimizer(string optimizerStr) { + // The same stored text as the last parse: the same state, without parsing the JSON again (see _parsedState). + // The whole text, tag included, is the key, so a hit has passed the tag check before. + if (_parsedState is { } parsed && string.Equals(parsed.Text, optimizerStr, StringComparison.Ordinal)) + return VkdCma.FromState(parsed.State); + int nl = optimizerStr.IndexOf('\n'); string tag = optimizerStr[..nl]; string json = optimizerStr[(nl + 1)..]; if (tag != "vkdcma") throw new NotSupportedException($"Unknown optimizer state tag '{tag}'."); - return VkdCma.FromState(OptimizerStateJson.Deserialize<VkdCmaState>(json)); + VkdCmaState state = OptimizerStateJson.Deserialize<VkdCmaState>(json); + _parsedState = (optimizerStr, state); + return VkdCma.FromState(state); } /// <summary>Finds the newest stored optimizer snapshot in completed trial history.</summary> /// <param name="completedTrials">Completed trial snapshots used as historical observations.</param> /// <returns>The newest available optimizer, or null when no stored snapshot exists.</returns> - private static VkdCma? RestoreOptimizer(List<FrozenTrial> completedTrials) + /// <exception cref="System.NotSupportedException">The newest stored snapshot carries an unknown optimizer tag.</exception> + /// <exception cref="System.Text.Json.JsonException">The newest stored snapshot's payload is not valid JSON for the state type.</exception> + /// <exception cref="System.ArgumentException">The decoded state contains invalid optimizer constructor settings.</exception> + private VkdCma? RestoreOptimizer(List<FrozenTrial> completedTrials) { for (int idx = completedTrials.Count - 1; idx >= 0; idx--) { @@ -387,19 +410,21 @@ private void LogIndependentSampling(FrozenTrial trial, string paramName) /// <returns>Trial snapshots eligible for the sampler history.</returns> private List<FrozenTrial> GetTrials(Study study) { - var completeTrials = new List<FrozenTrial>(); - foreach (var t in study.GetTrialsInternal(deepcopy: false, states: null, useCache: true)) + List<FrozenTrial> all = study.GetTrialsInternal(deepcopy: false, states: null, useCache: true); + // Sized for the whole history (plan 15): nearly every trial is complete, so the list never regrows on an ask. + var completeTrials = new List<FrozenTrial>(all.Count); + foreach (var t in all) { if (t.State == TrialState.Complete) { completeTrials.Add(t); } else if (t.State == TrialState.Pruned - && t.IntermediateValues.Count > 0 + && t.IntermediateValuesForRead.Count > 0 && _considerPrunedTrials) { - long maxStep = t.IntermediateValues.Keys.Max(); - double value = t.IntermediateValues[maxStep]; + long maxStep = t.IntermediateValuesForRead.Keys.Max(); + double value = t.IntermediateValuesForRead[maxStep]; var copied = t.DeepCopy(); copied.Value = value; completeTrials.Add(copied); diff --git a/src/OptunaSharp.Core/Samplers/XnesSampler.cs b/src/OptunaSharp.Core/Samplers/XnesSampler.cs index 57cc1d6..354abf3 100644 --- a/src/OptunaSharp.Core/Samplers/XnesSampler.cs +++ b/src/OptunaSharp.Core/Samplers/XnesSampler.cs @@ -108,12 +108,32 @@ private protected override string SerializeOptimizer(IEvolutionStrategyOptimizer /// <exception cref="System.NotSupportedException">The serialized optimizer tag is not this sampler's tag.</exception> /// <exception cref="System.Text.Json.JsonException">The persisted payload is not valid JSON for the state type, or is the literal null.</exception> /// <exception cref="System.ArgumentOutOfRangeException">The stored text has no <c><tag>\n</c> line.</exception> + /// <remarks>Parses the JSON only when the text differs from the last one parsed (<see cref="_parsedState" />); a new optimizer is built from the state every time.</remarks> private protected override IEvolutionStrategyOptimizer DeserializeOptimizer(string optimizerStr) { + // The same stored text as the last parse: the same state, without parsing the JSON again (see _parsedState). + // The whole text, tag included, is the key, so a hit has passed the tag check before. + if (_parsedState is { } parsed && string.Equals(parsed.Text, optimizerStr, System.StringComparison.Ordinal)) + return XnesOptimizer.FromState(parsed.State); + int nl = optimizerStr.IndexOf('\n'); string tag = optimizerStr[..nl]; if (tag != Tag) throw new NotSupportedException($"Unexpected optimizer state tag '{tag}' for XnesSampler."); - return XnesOptimizer.FromState(OptimizerStateJson.Deserialize<XnesState>(optimizerStr[(nl + 1)..])); + XnesState state = OptimizerStateJson.Deserialize<XnesState>(optimizerStr[(nl + 1)..]); + _parsedState = (optimizerStr, state); + return XnesOptimizer.FromState(state); } + + /// <summary> + /// The last stored optimizer text this instance parsed, and the state parsed from it (plan 15, as + /// <c>DifferentialEvolutionSampler</c> keeps it): the text changes once per generation, and every ask in between + /// parsed the same JSON again. Guarded by the sampler's monitor, like every hook; a per-worker instance has its + /// own. + /// </summary> + /// <remarks> + /// Safe to share across asks because FromState never changes the state it reads: the <see cref="XnesOptimizer" /> constructor clones the mean, receives the shape matrix as a fresh rectangular copy of the stored rows and clones that too, and the scale and generation are numbers. A parse that throws + /// stores nothing, so the next ask parses (and throws) again, as before. + /// </remarks> + private (string Text, XnesState State)? _parsedState; } diff --git a/src/OptunaSharp.Core/SearchSpace/GroupDecomposedSearchSpace.cs b/src/OptunaSharp.Core/SearchSpace/GroupDecomposedSearchSpace.cs index 18e6311..4d91720 100644 --- a/src/OptunaSharp.Core/SearchSpace/GroupDecomposedSearchSpace.cs +++ b/src/OptunaSharp.Core/SearchSpace/GroupDecomposedSearchSpace.cs @@ -15,8 +15,11 @@ internal sealed class SearchSpaceGroup public List<OrderedDict<string, BaseDistribution>> SearchSpaces => _searchSpaces; /// <summary>Splits existing groups so every resulting group has the same presence pattern in the incoming trial.</summary> - /// <param name="distributions">The parameter distributions being incorporated into the decomposed search space.</param> - public void AddDistributions(OrderedDict<string, BaseDistribution> distributions) + /// <param name="distributions"> + /// The parameter distributions being incorporated into the decomposed search space; only read, so a compact + /// finished trial's read-only view (plan 13, item S12) serves as well as a dictionary. + /// </param> + public void AddDistributions(IReadOnlyDictionary<string, BaseDistribution> distributions) { var distKeys = new HashSet<string>(distributions.Keys); var nextSearchSpaces = new List<OrderedDict<string, BaseDistribution>>(); @@ -99,8 +102,13 @@ public SearchSpaceGroup Calculate(Study study, bool useCache = false) ? new[] { TrialState.Complete, TrialState.Pruned } : new[] { TrialState.Complete }; - foreach (var trial in study.GetTrialsInternal(deepcopy: false, states: statesOfInterest, useCache: useCache)) - _searchSpace.AddDistributions(trial.DistributionsDict); + // The same trials in the same (number) order as study._get_trials(deepcopy=False, states, use_cache), filtered + // here instead of in a copied list: on an in-memory storage the read is the zero-copy view (plan 13, item S3). + foreach (var trial in study.GetTrialsForSampler(useCache)) + { + if (System.Array.IndexOf(statesOfInterest, trial.State) >= 0) + _searchSpace.AddDistributions(trial.Distributions); + } return _searchSpace.DeepCopy(); } diff --git a/src/OptunaSharp.Core/SearchSpace/IntersectionSearchSpace.cs b/src/OptunaSharp.Core/SearchSpace/IntersectionSearchSpace.cs index 599f491..cbf5385 100644 --- a/src/OptunaSharp.Core/SearchSpace/IntersectionSearchSpace.cs +++ b/src/OptunaSharp.Core/SearchSpace/IntersectionSearchSpace.cs @@ -58,14 +58,14 @@ internal static (OrderedDict<string, BaseDistribution>? SearchSpace, int NextCac if (searchSpace is null) { - searchSpace = new OrderedDict<string, BaseDistribution>(trial.DistributionsDict); + searchSpace = new OrderedDict<string, BaseDistribution>(trial.Distributions); continue; } var next = new OrderedDict<string, BaseDistribution>(); foreach (var (name, distribution) in searchSpace) { - if (trial.DistributionsDict.TryGetValue(name, out var trialDist) && trialDist.Equals(distribution)) + if (trial.Distributions.TryGetValue(name, out var trialDist) && trialDist.Equals(distribution)) next[name] = distribution; } searchSpace = next; @@ -150,7 +150,15 @@ public IntersectionSearchSpace(bool includePruned = false) /// parameter names. /// </returns> /// <exception cref="NumSharp.ValueError">This cache is reused with a different study identifier.</exception> - /// <remarks>The returned dictionary is a new sorted container. Distribution objects are shared with trial snapshots and are treated as immutable.</remarks> + /// <remarks> + /// <para>The returned dictionary is a new sorted container. Distribution objects are shared with trial snapshots and are treated as immutable.</para> + /// <para> + /// The trials are read through <c>Study.GetTrialsForSampler</c>: on an in-memory storage that is the + /// zero-copy view, so a call costs only the trials since the cached trial number, where Optuna copies the + /// whole history first. The walk below already stops at the cached number; the copy was the part that grew + /// with the study. Elsewhere the read is Optuna's, cache included. + /// </para> + /// </remarks> public OrderedDict<string, BaseDistribution> Calculate(Study study, bool useCache = false) { if (_studyId is null) @@ -166,7 +174,7 @@ public OrderedDict<string, BaseDistribution> Calculate(Study study, bool useCach } (_searchSpace, _cachedTrialNumber) = SearchSpaceFunctions.Calculate( - study.GetTrialsInternal(deepcopy: false, useCache: useCache), + study.GetTrialsForSampler(useCache), _includePruned, _searchSpace, _cachedTrialNumber); diff --git a/src/OptunaSharp.Core/Storages/BaseStorage.cs b/src/OptunaSharp.Core/Storages/BaseStorage.cs index 9de30ca..1baa8ca 100644 --- a/src/OptunaSharp.Core/Storages/BaseStorage.cs +++ b/src/OptunaSharp.Core/Storages/BaseStorage.cs @@ -126,6 +126,64 @@ internal T TellLocked<T>(int trialId, Func<T> body) /// <param name="value">Attribute value; persistent backends require JSON-serializable data.</param> public abstract void SetStudySystemAttr(int studyId, string key, object? value); + /// <summary> + /// Register several user-defined attributes to a study at once, overwriting existing values (Rustuna's + /// <c>set_study_user_attrs</c>; Rustuna plan 13, item S8). Optuna has no such call: the result is what calling + /// <see cref="SetStudyUserAttr(int, string, object?)" /> once per entry, in the dictionary's order, leaves. + /// </summary> + /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> + /// <param name="attrs">The attributes, written in enumeration order; persistent backends require JSON-serializable values.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="KeyError">If no study with the matching ID exists.</exception> + /// <remarks> + /// This default writes one entry per call, exactly as a caller looping over <see cref="SetStudyUserAttr(int, string, object?)" /> + /// would, so any storage supports it; it is atomic only as far as each single call is. The built-in storages + /// override it to write in one step: one lock in memory, one appended batch in a journal, one transaction in a + /// database. An empty dictionary writes nothing and checks nothing. + /// </remarks> + public virtual void SetStudyUserAttrs(int studyId, IReadOnlyDictionary<string, object?> attrs) + { + ArgumentNullException.ThrowIfNull(attrs); + foreach (var (key, value) in attrs) + SetStudyUserAttr(studyId, key, value); + } + + /// <summary> + /// Register several optuna-internal attributes to a study at once (Rustuna's <c>set_study_system_attrs</c>; + /// plan 13, item S8): the result of <see cref="SetStudySystemAttr(int, string, object?)" /> once per entry, in order. + /// </summary> + /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> + /// <param name="attrs">The attributes, written in enumeration order; persistent backends require JSON-serializable values.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="KeyError">If no study with the matching ID exists.</exception> + /// <remarks>The default writes one entry per call; see <see cref="SetStudyUserAttrs" /> for what the overrides do.</remarks> + public virtual void SetStudySystemAttrs(int studyId, IReadOnlyDictionary<string, object?> attrs) + { + ArgumentNullException.ThrowIfNull(attrs); + foreach (var (key, value) in attrs) + SetStudySystemAttr(studyId, key, value); + } + + /// <summary> + /// Optuna's <c>set_study_user_attr</c> name for <see cref="SetStudyUserAttrs" />: several user-defined attributes + /// in one call. + /// </summary> + /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="KeyError">If no study with the matching ID exists.</exception> + public void SetStudyUserAttr(int studyId, IReadOnlyDictionary<string, object?> attrs) => SetStudyUserAttrs(studyId, attrs); + + /// <summary> + /// Optuna's <c>set_study_system_attr</c> name for <see cref="SetStudySystemAttrs" />: several optuna-internal + /// attributes in one call. + /// </summary> + /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="KeyError">If no study with the matching ID exists.</exception> + public void SetStudySystemAttr(int studyId, IReadOnlyDictionary<string, object?> attrs) => SetStudySystemAttrs(studyId, attrs); + // ------------------------------------------------------------------ study access /// <summary>Read the ID of a study.</summary> @@ -216,7 +274,11 @@ public virtual int GetTrialIdFromStudyIdTrialNumber(int studyId, int trialNumber public virtual double GetTrialParam(int trialId, string paramName) { var trial = GetTrial(trialId); - return trial.Distributions[paramName].ToInternalRepr(trial.Params[paramName]); + // Python's `trial.distributions[param_name]` raises KeyError(param_name); the dictionary indexer's + // KeyNotFoundException escaped a `catch (KeyError)` written against this method's documented error (QA-66). + if (!trial.Distributions.TryGetValue(paramName, out var distribution)) + throw new KeyError(paramName); + return distribution.ToInternalRepr(trial.Params[paramName]); } /// <summary> @@ -265,6 +327,69 @@ public virtual double GetTrialParam(int trialId, string paramName) /// <param name="value">Attribute value; persistent backends require JSON-serializable data.</param> public abstract void SetTrialSystemAttr(int trialId, string key, object? value); + /// <summary> + /// Set several user-defined attributes of a trial at once, overwriting existing values (Rustuna's + /// <c>set_trial_user_attrs</c>; Rustuna plan 13, item S8). Optuna has no such call: the result is what calling + /// <see cref="SetTrialUserAttr(int, string, object?)" /> once per entry, in the dictionary's order, leaves. + /// </summary> + /// <param name="trialId">Storage identifier of the trial; distinct from its per-study trial number.</param> + /// <param name="attrs">The attributes, written in enumeration order; persistent backends require JSON-serializable values.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="KeyError">If no trial with the matching ID exists.</exception> + /// <exception cref="UpdateFinishedTrialError">If the trial is already finished.</exception> + /// <remarks> + /// This default writes one entry per call, as a caller's own loop would, so any storage supports it; a failure + /// part-way leaves the entries before it written. The built-in storages override it to write in one step and + /// check the trial once, so a finished or unknown trial gets nothing written: one lock in memory, one appended + /// batch of ordinary single-attribute records in a journal (what Python's journal reader expects), one + /// transaction in a database. An empty dictionary writes nothing and checks nothing. + /// </remarks> + public virtual void SetTrialUserAttrs(int trialId, IReadOnlyDictionary<string, object?> attrs) + { + ArgumentNullException.ThrowIfNull(attrs); + foreach (var (key, value) in attrs) + SetTrialUserAttr(trialId, key, value); + } + + /// <summary> + /// Set several optuna-internal attributes of a trial at once (Rustuna's <c>set_trial_system_attrs</c>; plan 13, + /// item S8): the result of <see cref="SetTrialSystemAttr(int, string, object?)" /> once per entry, in order. + /// </summary> + /// <param name="trialId">Storage identifier of the trial; distinct from its per-study trial number.</param> + /// <param name="attrs">The attributes, written in enumeration order; persistent backends require JSON-serializable values.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="KeyError">If no trial with the matching ID exists.</exception> + /// <exception cref="UpdateFinishedTrialError">If the trial is already finished.</exception> + /// <remarks>The default writes one entry per call; see <see cref="SetTrialUserAttrs" /> for what the overrides do.</remarks> + public virtual void SetTrialSystemAttrs(int trialId, IReadOnlyDictionary<string, object?> attrs) + { + ArgumentNullException.ThrowIfNull(attrs); + foreach (var (key, value) in attrs) + SetTrialSystemAttr(trialId, key, value); + } + + /// <summary> + /// Optuna's <c>set_trial_user_attr</c> name for <see cref="SetTrialUserAttrs" />: several user-defined attributes + /// in one call. + /// </summary> + /// <param name="trialId">Storage identifier of the trial; distinct from its per-study trial number.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="KeyError">If no trial with the matching ID exists.</exception> + /// <exception cref="UpdateFinishedTrialError">If the trial is already finished.</exception> + public void SetTrialUserAttr(int trialId, IReadOnlyDictionary<string, object?> attrs) => SetTrialUserAttrs(trialId, attrs); + + /// <summary> + /// Optuna's <c>set_trial_system_attr</c> name for <see cref="SetTrialSystemAttrs" />: several optuna-internal + /// attributes in one call. + /// </summary> + /// <param name="trialId">Storage identifier of the trial; distinct from its per-study trial number.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="KeyError">If no trial with the matching ID exists.</exception> + /// <exception cref="UpdateFinishedTrialError">If the trial is already finished.</exception> + public void SetTrialSystemAttr(int trialId, IReadOnlyDictionary<string, object?> attrs) => SetTrialSystemAttrs(trialId, attrs); + // ------------------------------------------------------------------ trial access /// <summary>Read a trial.</summary> @@ -304,6 +429,27 @@ public abstract List<FrozenTrial> GetAllTrials( public virtual IReadOnlyList<FrozenTrial> GetTrialsPrefixView(int studyId) => GetAllTrials(studyId, deepcopy: false); + /// <summary> + /// Whether <see cref="GetTrialsPrefixView" /> really is O(1) here (a window over a live list), rather than + /// the base fallback that copies every trial. Samplers that read the history on every ask switch to the view + /// only when this is <see langword="true" />. + /// </summary> + /// <remarks> + /// <para> + /// Why a flag rather than "always the view": the fallback is a fresh <c>GetAllTrials</c>, which on a + /// database-backed storage is a synchronization with the database. A sampler that used to share the + /// per-trial cached list (<c>Study.GetTrialsInternal(useCache: true)</c>) would issue one more query per + /// ask if it read the fallback view instead. So such storages keep their current read path, and only the + /// storages that override this to <see langword="true" /> get the zero-copy one. + /// </para> + /// <para> + /// Internal on purpose: a third-party storage cannot opt in, because the samplers then read its view + /// without the storage's lock, which is safe only for the in-memory list semantics documented on + /// <see cref="TrialsPrefixView" />. + /// </para> + /// </remarks> + internal virtual bool HasZeroCopyTrialsView => false; + /// <summary>Count the number of trials in a study.</summary> /// <exception cref="KeyError">If no study with the matching ID exists.</exception> /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> diff --git a/src/OptunaSharp.Core/Storages/CachedStorage.cs b/src/OptunaSharp.Core/Storages/CachedStorage.cs index 020ed64..215009c 100644 --- a/src/OptunaSharp.Core/Storages/CachedStorage.cs +++ b/src/OptunaSharp.Core/Storages/CachedStorage.cs @@ -85,6 +85,22 @@ private sealed class StudyInfo // Trial number to corresponding FrozenTrial. /// <summary>Cached trials keyed by their per-study number.</summary> internal readonly Dictionary<int, FrozenTrial> Trials = new(); + + /// <summary> + /// The same cached records indexed by trial number (Rustuna plan 13, item S10), so reads walk them in number + /// order instead of sorting the dictionary on every call. A number not cached yet holds a null placeholder, + /// counted in <see cref="MissingNumbers" />: a local create can cache trial n + 1 before a sync brings in a + /// trial n another worker created. + /// </summary> + /// <remarks> + /// Elements are only ever replaced by whole records the backend returned, never changed in place, and + /// placeholders are only appended or filled, never written over a record. That is what lets + /// <see cref="GetTrialsPrefixView" /> wrap this list without the lock. + /// </remarks> + internal readonly List<FrozenTrial> ByNumber = new(); + + /// <summary>How many null placeholders <see cref="ByNumber" /> holds; zero means it is the whole cache in order.</summary> + internal int MissingNumbers; // Trials which require storage access to read latest attributes. /// <summary>Trial identifiers that must be refreshed because their state can still change.</summary> internal readonly HashSet<int> UnfinishedTrialIds = new(); @@ -176,6 +192,20 @@ public override void SetStudyUserAttr(int studyId, string key, object? value) public override void SetStudySystemAttr(int studyId, string key, object? value) => _backendStorage.SetStudySystemAttr(studyId, key, value); + /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <inheritdoc /> + /// <remarks>Forwarded whole, so the backend writes the batch in one step (plan 13, item S8).</remarks> + public override void SetStudyUserAttrs(int studyId, IReadOnlyDictionary<string, object?> attrs) + => _backendStorage.SetStudyUserAttrs(studyId, attrs); + + /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <inheritdoc /> + /// <remarks>Forwarded whole, so the backend writes the batch in one step (plan 13, item S8).</remarks> + public override void SetStudySystemAttrs(int studyId, IReadOnlyDictionary<string, object?> attrs) + => _backendStorage.SetStudySystemAttrs(studyId, attrs); + /// <param name="studyName">Name identifying the study in the selected storage.</param> /// <inheritdoc /> public override int GetStudyIdFromName(string studyName) @@ -324,6 +354,23 @@ public override void SetTrialUserAttr(int trialId, string key, object? value) public override void SetTrialSystemAttr(int trialId, string key, object? value) => _backendStorage.SetTrialSystemAttr(trialId, key: key, value: value); + /// <param name="trialId">Storage identifier of the trial; distinct from its per-study trial number.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <inheritdoc /> + /// <remarks> + /// Forwarded whole, so the backend writes the batch in one step (plan 13, item S8); like the single-attribute + /// write, it leaves the cache alone (unfinished trials are re-read from the backend on the next sync). + /// </remarks> + public override void SetTrialUserAttrs(int trialId, IReadOnlyDictionary<string, object?> attrs) + => _backendStorage.SetTrialUserAttrs(trialId, attrs); + + /// <param name="trialId">Storage identifier of the trial; distinct from its per-study trial number.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <inheritdoc /> + /// <remarks>Forwarded whole, as <see cref="SetTrialUserAttrs" />.</remarks> + public override void SetTrialSystemAttrs(int trialId, IReadOnlyDictionary<string, object?> attrs) + => _backendStorage.SetTrialSystemAttrs(trialId, attrs); + /// <param name="trialId">Storage identifier of the trial; distinct from its per-study trial number.</param> /// <summary>Looks up a finished trial without consulting the backend.</summary> /// <returns>A cached finished trial, or null if the record is missing or unfinished.</returns> @@ -368,15 +415,58 @@ public override List<FrozenTrial> GetAllTrials( { var study = _studies[studyId]; // We need to sort trials by their number because some samplers assume this behavior. - - IEnumerable<FrozenTrial> trials = states is not null - ? study.Trials.Values.Where(t => states.Contains(t.State)) - : study.Trials.Values; - var sorted = trials.OrderBy(t => t.Number).ToList(); + List<FrozenTrial> sorted; + if (study.MissingNumbers == 0) + { + // The number-ordered mirror is the whole cache in order (plan 13, item S10): the same records in the same + // order as the sort below, without sorting on every read. + sorted = new List<FrozenTrial>(study.ByNumber.Count); + foreach (var trial in study.ByNumber) + { + if (states is null || states.Contains(trial.State)) + sorted.Add(trial); + } + } + else + { + IEnumerable<FrozenTrial> trials = states is not null + ? study.Trials.Values.Where(t => states.Contains(t.State)) + : study.Trials.Values; + sorted = trials.OrderBy(t => t.Number).ToList(); + } return deepcopy ? sorted.Select(t => t.DeepCopy()).ToList() : sorted; } } + /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> + /// <inheritdoc /> + /// <remarks> + /// <para> + /// Synchronizes with the backend exactly as <see cref="GetAllTrials" /> does, then wraps the number-ordered + /// cache in a <see cref="TrialsPrefixView" /> instead of sorting and copying it (Rustuna plan 13, item S10): + /// the genetic samplers take this view on every ask, which made each ask O(n log n) on a database storage. + /// The view holds the same records <c>GetAllTrials(deepcopy: false)</c> would return, in the same order; + /// a later synchronization can replace an unfinished trial's record with a fresher one, which a read of the + /// view then returns, as the view's contract says. + /// </para> + /// <para> + /// When a trial number is not cached yet (another worker's trial a sync has not brought in), the view could + /// not be indexed by number, so the copying read is used instead, as before. + /// </para> + /// </remarks> + public override IReadOnlyList<FrozenTrial> GetTrialsPrefixView(int studyId) + { + ReadTrialsFromRemoteStorage(studyId); + + lock (_lock) + { + var study = _studies[studyId]; + if (study.MissingNumbers == 0) + return new TrialsPrefixView(study.ByNumber, study.ByNumber.Count); + } + return GetAllTrials(studyId, deepcopy: false); + } + /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> /// <summary>Refreshes unfinished and newly created trials before advancing the completed-trial high-water mark.</summary> private void ReadTrialsFromRemoteStorage(int studyId) @@ -422,6 +512,24 @@ private void AddTrialsToCache(int studyId, List<FrozenTrial> trials) _trialIdToStudyIdAndNumber[trial.TrialId] = (studyId, trial.Number); _studyIdAndNumberToTrialId[(studyId, trial.Number)] = trial.TrialId; study.Trials[trial.Number] = trial; + + // The number-ordered mirror (item S10): placeholders for numbers not cached yet, then this record. + var byNumber = study.ByNumber; + while (byNumber.Count < trial.Number) + { + byNumber.Add(null!); + study.MissingNumbers++; + } + if (byNumber.Count == trial.Number) + { + byNumber.Add(trial); + } + else + { + if (byNumber[trial.Number] is null) + study.MissingNumbers--; + byNumber[trial.Number] = trial; + } } } diff --git a/src/OptunaSharp.Core/Storages/Callbacks.cs b/src/OptunaSharp.Core/Storages/Callbacks.cs index daca9a1..fe43834 100644 --- a/src/OptunaSharp.Core/Storages/Callbacks.cs +++ b/src/OptunaSharp.Core/Storages/Callbacks.cs @@ -52,7 +52,7 @@ public void Invoke(Study study, FrozenTrial trial) ["failed_trial"] = (long)trial.Number, ["retry_history"] = new List<object?>(), }; - foreach (var (key, value) in trial.SystemAttrsDict) + foreach (var (key, value) in trial.SystemAttrs) systemAttrs[key] = value; var retryHistory = (List<object?>)systemAttrs["retry_history"]!; @@ -85,7 +85,7 @@ public static implicit operator Action<Study, FrozenTrial>(RetryHeartbeatStaleTr /// <exception cref="System.OverflowException">The retry marker exceeds Int32.</exception> /// <exception cref="System.InvalidCastException">The retry marker is not convertible to an integer.</exception> public static int? RetriedTrialNumber(FrozenTrial trial) - => trial.SystemAttrsDict.GetValueOrDefault("failed_trial") is { } value + => trial.SystemAttrs.GetValueOrDefault("failed_trial") is { } value ? Convert.ToInt32(value, System.Globalization.CultureInfo.InvariantCulture) : null; @@ -97,7 +97,7 @@ public static implicit operator Action<Study, FrozenTrial>(RetryHeartbeatStaleTr /// <param name="trial">Trial record or active trial on which the operation acts.</param> /// <returns>A new list of ancestor trial numbers in retry order; empty when absent.</returns> public static List<int> RetryHistory(FrozenTrial trial) - => trial.SystemAttrsDict.GetValueOrDefault("retry_history") is List<object?> history + => trial.SystemAttrs.GetValueOrDefault("retry_history") is List<object?> history ? history.Select(n => Convert.ToInt32(n, System.Globalization.CultureInfo.InvariantCulture)).ToList() : new List<int>(); } diff --git a/src/OptunaSharp.Core/Storages/InMemoryStorage.cs b/src/OptunaSharp.Core/Storages/InMemoryStorage.cs index b4fa39f..c3b444f 100644 --- a/src/OptunaSharp.Core/Storages/InMemoryStorage.cs +++ b/src/OptunaSharp.Core/Storages/InMemoryStorage.cs @@ -26,13 +26,59 @@ public class InMemoryStorage : BaseStorage private readonly Dictionary<int, (int StudyId, int Number)> _trialIdToStudyIdAndNumber = new(); private readonly Dictionary<string, int> _studyNameToId = new(); - private readonly Dictionary<int, StudyInfo> _studies = new(); + + // Python's `self._studies: dict[int, _StudyInfo]` lists studies in creation order across deletions: a dict appends a + // new key after the existing ones, while a Dictionary<int, ...> reuses a deleted study's freed slot and lists the next + // study there, which reached get_all_studies and load_study's name list (QA-67). Every access holds _lock. + private readonly OrderedDict<int, StudyInfo> _studies = new(); private int _maxStudyId = -1; private int _maxTrialId = -1; private readonly object _lock = new(); private readonly Dictionary<int, int> _prevWaitingTrialNumber = new(); + private readonly bool _compactFinishedTrials; + + /// <summary>Creates an empty storage that keeps every trial's dictionaries as Optuna's in-memory storage does.</summary> + public InMemoryStorage() + : this(compactFinishedTrials: false) + { + } + + /// <summary> + /// Creates an empty storage, optionally keeping finished trials in a compact form (Rustuna plan 13, item S12). + /// </summary> + /// <param name="compactFinishedTrials"> + /// When true, each trial is compacted as it finishes: parameters become one internal value per name against a + /// parameter schema the study's trials share, distributions come from that schema, attributes become arrays + /// with long ASCII strings stored as bytes, and empty dictionaries take no memory. False (the default) keeps + /// Optuna's representation exactly. + /// </param> + /// <remarks> + /// <para> + /// What stays the same: every value any API returns, and so every sampler's results; a seeded study gives + /// the same trials either way. A finished 40-parameter random-search trial took 6.7 KB in memory and takes + /// 0.7 KB compact; a CMA-ES trial 13.5 KB and 2.7 KB, its optimizer states stored as bytes (100,000 trials: + /// 1,287 MB and 257 MB). Run times stay the same within noise. + /// </para> + /// <para> + /// What changes, which is why it is opt-in: a finished trial's <see cref="FrozenTrial.Params" />, + /// <see cref="FrozenTrial.Distributions" />, <see cref="FrozenTrial.UserAttrs" /> and + /// <see cref="FrozenTrial.SystemAttrs" /> become read-only views rather than <see cref="OrderedDict{TKey,TValue}" /> + /// objects (a cast to <c>OrderedDict</c> fails, a write through <c>IDictionary</c> throws), and numeric values + /// and long strings are rebuilt on each read, so two reads are equal but not the same object. The mutable + /// accessors (<see cref="FrozenTrial.ParamsDict" /> and the other <c>…Dict</c> properties, and + /// <see cref="FrozenTrial.IntermediateValues" />) still return real dictionaries: the first such read gives + /// the trial back a dictionary of its own, which it keeps, so changes made through them stay, at the cost of + /// that trial's saving. A finished trial no longer shares its dictionaries with the running record it was + /// copied from. A read of a numeric parameter through the views allocates a box; TPE, which reads every + /// trial on every ask, copies the stored internal values instead. + /// </para> + /// </remarks> + public InMemoryStorage(bool compactFinishedTrials) => _compactFinishedTrials = compactFinishedTrials; + + /// <summary>Whether this storage keeps finished trials in the compact form (see the constructor).</summary> + public bool CompactFinishedTrials => _compactFinishedTrials; /// <param name="directions">Objective directions in the same order as the objective values.</param> /// <param name="studyName">Name identifying the study in the selected storage.</param> @@ -46,8 +92,10 @@ public override int CreateNewStudy(IReadOnlyList<StudyDirection> directions, str if (studyName is not null) { + // Python's bare `raise DuplicatedStudyError`: str(e) is empty, where .NET's parameterless constructor + // supplies "Exception of type ... was thrown." (QA-66). create_study replaces it with its own message. if (_studyNameToId.ContainsKey(studyName)) - throw new DuplicatedStudyError(); + throw new DuplicatedStudyError(string.Empty); } else { @@ -116,6 +164,47 @@ public override void SetStudySystemAttr(int studyId, string key, object? value) } } + /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <inheritdoc /> + /// <remarks> + /// One lock and one new dictionary for the whole batch (plan 13, item S8), published only after every entry is + /// in it, so a reader sees all of them or none, and a reader holding the previous dictionary sees no change. + /// </remarks> + public override void SetStudyUserAttrs(int studyId, IReadOnlyDictionary<string, object?> attrs) + { + ArgumentNullException.ThrowIfNull(attrs); + if (attrs.Count == 0) + return; + lock (_lock) + { + CheckStudyId(studyId); + var userAttrs = _studies[studyId].UserAttrs.ShallowClone(); + foreach (var (key, value) in attrs) + userAttrs[key] = value; + _studies[studyId].UserAttrs = userAttrs; + } + } + + /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <inheritdoc /> + /// <remarks>One lock and one new dictionary for the whole batch, as <see cref="SetStudyUserAttrs" />.</remarks> + public override void SetStudySystemAttrs(int studyId, IReadOnlyDictionary<string, object?> attrs) + { + ArgumentNullException.ThrowIfNull(attrs); + if (attrs.Count == 0) + return; + lock (_lock) + { + CheckStudyId(studyId); + var systemAttrs = _studies[studyId].SystemAttrs.ShallowClone(); + foreach (var (key, value) in attrs) + systemAttrs[key] = value; + _studies[studyId].SystemAttrs = systemAttrs; + } + } + /// <param name="studyName">Name identifying the study in the selected storage.</param> /// <inheritdoc /> public override int GetStudyIdFromName(string studyName) @@ -214,6 +303,13 @@ public override int CreateNewTrial(int studyId, FrozenTrial? templateTrial = nul _maxTrialId += 1; trial.SetNumber(_studies[studyId].Trials.Count); trial.TrialId = trialId; + // Both branches built a record with dictionaries nobody else holds, so its writes may go in place until a + // reader receives it (see FrozenTrial.StorageExclusive). + trial.StorageExclusive = true; + // A trial added already finished (Study.AddTrial) is compacted as one finishing here would be; it is never + // written again, so the exclusive flag above stays unused for it. + if (_compactFinishedTrials && trial.State.IsFinished()) + trial.CompactFinished(SchemasOf(studyId)); _trialIdToStudyIdAndNumber[trialId] = (studyId, trial.Number); _studies[studyId].Trials.Add(trial); UpdateCache(trialId, studyId); @@ -250,24 +346,100 @@ public override void SetTrialParam( CheckTrialIsUpdatable(trialId, trial.State); - int studyId = _trialIdToStudyIdAndNumber[trialId].StudyId; + var study = _studies[_trialIdToStudyIdAndNumber[trialId].StudyId]; // Check param distribution compatibility with previous trial(s). - if (_studies[studyId].ParamDistribution.TryGetValue(paramName, out var existing)) + if (study.ParamDistribution.TryGetValue(paramName, out var existing)) + { Distribution.CheckDistributionCompatibility(existing, distribution); + // Share one instance per parameter across the study's trials when the new one is the same distribution + // to the bit (plan 13, item S7): memory only, the trial still holds a distribution identical in every + // field. Bitwise, so a -0.0 bound or a categorical with equal-but-different choices (1 vs 1.0, which + // Python calls equal) keeps the caller's own instance and prints as Optuna would. + if (Distribution.IsBitwiseIdentical(existing, distribution)) + distribution = existing; + } // Set param distribution. - _studies[studyId].ParamDistribution[paramName] = distribution; - - // Set param. - trial = trial.ShallowCopy(); - trial.ParamsDict = trial.ParamsDict.ShallowClone(); - trial.ParamsDict[paramName] = distribution.ToExternalRepr(paramValueInternal); - trial.DistributionsDict = trial.DistributionsDict.ShallowClone(); - trial.DistributionsDict[paramName] = distribution; - SetTrial(trialId, trial); + study.ParamDistribution[paramName] = distribution; + // One string instance per parameter name across the study (plan 13, S7): names built per call, such as + // $"x{i}", would otherwise keep a copy alive in every trial. + if (!study.ParamNames.TryGetValue(paramName, out string? name)) + study.ParamNames[paramName] = name = paramName; + + // Set param. In place while the storage alone holds the record; otherwise an own copy first, as Optuna's + // copy-on-write does (WritableTrialUnlocked). + trial = WritableTrialUnlocked(trialId); + trial.ParamsDict[name] = distribution.ToExternalRepr(paramValueInternal); + trial.DistributionsDict[name] = distribution; } } + /// <summary> + /// The record of <paramref name="trialId" /> in a form this write may change: the stored object itself while the + /// storage alone holds it, otherwise a copy that owns all of its dictionaries, stored in its place (Rustuna plan + /// 13, item S4). + /// </summary> + /// <param name="trialId">The trial being written; the caller holds the lock and has checked it is updatable.</param> + /// <returns>A record the caller may change in place; it stays the stored record.</returns> + /// <remarks> + /// <para> + /// Optuna copies the record and the dictionary it writes on every write, so a reader holding the old record + /// never sees a change. The copy here happens only when a reader may hold the record (any read clears + /// <see cref="FrozenTrial.StorageExclusive" />), and it clones all five dictionaries, because a later write + /// may touch any of them in place. A trial's suggestions, which nobody reads between, then cost one copy + /// instead of one per suggestion. + /// </para> + /// <para> + /// State changes (<see cref="SetTrialStateValues" />) keep copying: a finished record is read without the + /// lock through <see cref="GetTrialsPrefixView" />, so it must be published whole, never changed in place. + /// </para> + /// </remarks> + private FrozenTrial WritableTrialUnlocked(int trialId) + { + var trial = GetTrialUnlocked(trialId); + if (trial.StorageExclusive) + return trial; + + var own = trial.ShallowCopy(); + own.ParamsDict = trial.ParamsDict.ShallowClone(); + own.DistributionsDict = trial.DistributionsDict.ShallowClone(); + own.UserAttrsDict = trial.UserAttrsDict.ShallowClone(); + own.SystemAttrsDict = trial.SystemAttrsDict.ShallowClone(); + own.IntermediateValues = trial.IntermediateValues.ShallowClone(); + own.StorageExclusive = true; + SetTrial(trialId, own); + WriteCopyCount++; + return own; + } + + /// <summary>The study's schema cache for compact finished trials, created on first use (plan 13, item S12).</summary> + /// <param name="studyId">A study of this storage; the caller holds the lock.</param> + /// <returns>The cache the study's compact trials share schemas through.</returns> + private ParamSchemaCache SchemasOf(int studyId) + { + StudyInfo study = _studies[studyId]; + return study.Schemas ??= new ParamSchemaCache(); + } + + /// <summary> + /// How many writes had to copy a trial's record first because a reader may hold it (Rustuna plan 13, item S4): + /// a diagnostic the tests read to prove that suggestions nobody reads between are written in place. + /// </summary> + /// <remarks>Counted under the storage's lock; read it while no write is running, or the value is approximate.</remarks> + internal int WriteCopyCount { get; private set; } + + /// <summary> + /// Marks a stored record as held by a reader, so the next write copies it first: every path that returns a + /// stored record (rather than a copy) goes through here. + /// </summary> + /// <param name="trial">A record of this storage, read under the lock.</param> + /// <returns><paramref name="trial" />, for chaining at the return statement.</returns> + private static FrozenTrial HandOut(FrozenTrial trial) + { + trial.StorageExclusive = false; + return trial; + } + /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> /// <param name="trialNumber">Zero-based trial number within the study, not a storage identifier.</param> /// <inheritdoc /> @@ -317,7 +489,8 @@ public override FrozenTrial GetBestTrial(int studyId) throw new ValueError("No trials are completed yet."); if (_studies[studyId].Directions.Count > 1) throw new RuntimeError("Best trial can be obtained only for single-objective optimization."); - return GetTrialUnlocked(bestTrialId.Value); + // A completed record is never written again, but handing it out keeps the rule uniform. + return HandOut(GetTrialUnlocked(bestTrialId.Value)); } } @@ -330,7 +503,15 @@ public override double GetTrialParam(int trialId, string paramName) { var trial = GetTrialUnlocked(trialId); - var distribution = trial.Distributions[paramName]; + // A compact finished trial (plan 13, item S12) stores exactly the internal value the conversion below would + // rebuild through its own distribution, so it is returned as stored. A missing name falls through to the + // dictionary path's KeyError. + if (trial.Params is CompactParams compact && compact.TryGetInternal(paramName, out double stored)) + return stored; + + // Python's `trial.distributions[param_name]`: KeyError(param_name), not KeyNotFoundException (QA-66). + if (!trial.Distributions.TryGetValue(paramName, out var distribution)) + throw new KeyError(paramName); return distribution.ToInternalRepr(trial.Params[paramName]); } } @@ -361,8 +542,12 @@ public override bool SetTrialStateValues(int trialId, TrialState state, IReadOnl if (state.IsFinished()) { trial.DatetimeComplete = DateTime.Now; - SetTrial(trialId, trial); int studyId = _trialIdToStudyIdAndNumber[trialId].StudyId; + // Compact the new record before it is published: no reader can see this object yet, and the + // dictionaries it shares with the record it replaces are only read (FrozenTrial.CompactFinished). + if (_compactFinishedTrials) + trial.CompactFinished(SchemasOf(studyId)); + SetTrial(trialId, trial); UpdateCache(trialId, studyId); } else @@ -430,10 +615,8 @@ public override void SetTrialIntermediateValue(int trialId, long step, double in var trial = GetTrialUnlocked(trialId); CheckTrialIsUpdatable(trialId, trial.State); - trial = trial.ShallowCopy(); - trial.IntermediateValues = trial.IntermediateValues.ShallowClone(); - trial.IntermediateValues[step] = intermediateValue; - SetTrial(trialId, trial); + // In place unless a reader may hold the record (WritableTrialUnlocked). + WritableTrialUnlocked(trialId).IntermediateValues[step] = intermediateValue; } } @@ -449,10 +632,8 @@ public override void SetTrialUserAttr(int trialId, string key, object? value) var trial = GetTrialUnlocked(trialId); CheckTrialIsUpdatable(trialId, trial.State); - trial = trial.ShallowCopy(); - trial.UserAttrsDict = trial.UserAttrsDict.ShallowClone(); - trial.UserAttrsDict[key] = value; - SetTrial(trialId, trial); + // In place unless a reader may hold the record (WritableTrialUnlocked). + WritableTrialUnlocked(trialId).UserAttrsDict[key] = value; } } @@ -467,10 +648,52 @@ public override void SetTrialSystemAttr(int trialId, string key, object? value) var trial = GetTrialUnlocked(trialId); CheckTrialIsUpdatable(trialId, trial.State); - trial = trial.ShallowCopy(); - trial.SystemAttrsDict = trial.SystemAttrsDict.ShallowClone(); - trial.SystemAttrsDict[key] = value; - SetTrial(trialId, trial); + // In place unless a reader may hold the record (WritableTrialUnlocked). + WritableTrialUnlocked(trialId).SystemAttrsDict[key] = value; + } + } + + /// <param name="trialId">Storage identifier of the trial; distinct from its per-study trial number.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <inheritdoc /> + /// <remarks> + /// One lock, one updatable check and at most one copy of the record for the whole batch (plan 13, item S8): an + /// unknown or finished trial gets nothing written. + /// </remarks> + public override void SetTrialUserAttrs(int trialId, IReadOnlyDictionary<string, object?> attrs) + { + ArgumentNullException.ThrowIfNull(attrs); + if (attrs.Count == 0) + return; + lock (_lock) + { + var trial = GetTrialUnlocked(trialId); + CheckTrialIsUpdatable(trialId, trial.State); + + // One writable record for every entry: in place unless a reader may hold it (WritableTrialUnlocked). + var userAttrs = WritableTrialUnlocked(trialId).UserAttrsDict; + foreach (var (key, value) in attrs) + userAttrs[key] = value; + } + } + + /// <param name="trialId">Storage identifier of the trial; distinct from its per-study trial number.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <inheritdoc /> + /// <remarks>One lock, one check and at most one copy, as <see cref="SetTrialUserAttrs" />.</remarks> + public override void SetTrialSystemAttrs(int trialId, IReadOnlyDictionary<string, object?> attrs) + { + ArgumentNullException.ThrowIfNull(attrs); + if (attrs.Count == 0) + return; + lock (_lock) + { + var trial = GetTrialUnlocked(trialId); + CheckTrialIsUpdatable(trialId, trial.State); + + var systemAttrs = WritableTrialUnlocked(trialId).SystemAttrsDict; + foreach (var (key, value) in attrs) + systemAttrs[key] = value; } } @@ -480,7 +703,8 @@ public override FrozenTrial GetTrial(int trialId) { lock (_lock) { - return GetTrialUnlocked(trialId); + // The caller receives the stored record itself, so later writes must copy it first. + return HandOut(GetTrialUnlocked(trialId)); } } @@ -517,10 +741,23 @@ public override IReadOnlyList<FrozenTrial> GetTrialsPrefixView(int studyId) { CheckStudyId(studyId); List<FrozenTrial> trials = _studies[studyId].Trials; - return new TrialsPrefixView(trials, trials.Count); + // An unfinished record may be written in place while the storage alone holds it (WritableTrialUnlocked), + // so the view reads one under the lock and hands it out; finished records stay lock-free. + return new TrialsPrefixView(trials, trials.Count, index => + { + lock (_lock) + return HandOut(trials[index]); + }); } } + /// <inheritdoc /> + /// <remarks> + /// <see langword="true" />: <see cref="GetTrialsPrefixView" /> above wraps the live list without copying it, so + /// samplers that read the history on every ask can afford to read it through the view. + /// </remarks> + internal override bool HasZeroCopyTrialsView => true; + /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> /// <param name="deepcopy">Whether to copy trial records; treat records returned with false as read-only.</param> /// <param name="states">States to include; null includes every state.</param> @@ -561,7 +798,18 @@ public override List<FrozenTrial> GetAllTrials( } if (deepcopy) + { trials = trials.Select(t => t.DeepCopy()).ToList(); + } + else + { + // The caller receives the stored records themselves. Finished ones are never written again; an + // unfinished one must be copied before its next write (WritableTrialUnlocked). Only those are marked, + // which keeps this pass to the few running and waiting trials' fields. + foreach (var trial in trials) + if (!trial.State.IsFinished()) + HandOut(trial); + } return trials; } @@ -600,6 +848,11 @@ internal StudyInfo(string name, List<StudyDirection> directions) internal List<FrozenTrial> Trials { get; } = new(); /// <summary>Previously recorded distributions used to validate parameters across trials.</summary> internal Dictionary<string, BaseDistribution> ParamDistribution { get; } = new(); + /// <summary> + /// The study's one string instance per parameter name, used as the key in every trial's dictionaries so + /// names built per suggestion (<c>$"x{i}"</c>) do not keep a copy alive in each trial (plan 13, S7). + /// </summary> + internal Dictionary<string, string> ParamNames { get; } = new(); /// <summary>Copy-on-write user attributes for the study.</summary> internal OrderedDict<string, object?> UserAttrs { get; set; } = new(); /// <summary>Copy-on-write internal attributes for the study.</summary> @@ -610,5 +863,11 @@ internal StudyInfo(string name, List<StudyDirection> directions) internal List<StudyDirection> Directions { get; } /// <summary>Identifier of the best completed trial cached for single-objective lookup.</summary> internal int? BestTrialId { get; set; } + + /// <summary> + /// The study's parameter schemas for compact finished trials (plan 13, item S12); created by the first trial + /// that finishes in a storage built with <c>compactFinishedTrials: true</c>, so other storages never hold one. + /// </summary> + internal ParamSchemaCache? Schemas { get; set; } } } diff --git a/src/OptunaSharp.Core/Storages/Journal/JournalFileBackend.cs b/src/OptunaSharp.Core/Storages/Journal/JournalFileBackend.cs index 097666a..28995b7 100644 --- a/src/OptunaSharp.Core/Storages/Journal/JournalFileBackend.cs +++ b/src/OptunaSharp.Core/Storages/Journal/JournalFileBackend.cs @@ -29,14 +29,37 @@ public class JournalFileBackend : BaseJournalBackend private readonly string _filePath; private readonly BaseJournalFileLock _lock; - // Byte offset of every log number seen so far, so a sync can seek instead of re-reading the journal. Python's - // dict is safe to share between readers under the GIL; this Dictionary is not, and one backend instance can be - // read by several JournalStorage instances at once (a singleton backend under scoped or transient storages). - // Every access therefore takes _offsetLock, and a reader never looks up an entry another reader may still be - // writing (see ReadLogs). - private readonly Dictionary<int, long> _logNumberOffset = new() { [0] = 0 }; + /// <summary> + /// How many log lines apart the kept start offsets lie (plan 14; Rustuna 82b13d8). Python keeps one offset per line + /// (<c>_log_number_offset</c>); a 100,000-trial, 40-parameter journal has about 4.5 million lines, 120-250 MB of + /// dictionary. Here only the furthest offset reached and one offset per this many lines are kept. + /// </summary> + internal const int OffsetCheckpointInterval = 4096; + + // Where a read can start without scanning from the file's beginning. Python's dict is safe to share between + // readers under the GIL; these fields are not, and one backend instance can be read by several JournalStorage + // instances at once (a singleton backend under scoped or transient storages). Every access therefore takes + // _offsetLock, and each reader carries its own byte position (see ReadLogs). + // The furthest log number whose start offset a read has established, and that offset. A sync asks for exactly the + // next unread log, which is this one, so it seeks straight there as Python's per-line dictionary lets it. + private int _latestLogNumber; + private long _latestLogOffset; + // The start offset of log number k * OffsetCheckpointInterval at index k (log 0 starts at byte 0). A read for an + // earlier log number (a new storage over a shared backend, a replay from the start) seeks to the nearest checkpoint + // at or before it and skips forward, never more than OffsetCheckpointInterval - 1 lines. + private readonly List<long> _offsetCheckpoints = new() { 0 }; private readonly object _offsetLock = new(); + /// <summary>How many offset checkpoints are kept, for the tests that check the bookkeeping stays sparse.</summary> + internal int OffsetCheckpointCount + { + get + { + lock (_offsetLock) + return _offsetCheckpoints.Count; + } + } + /// <summary> /// The lock this backend acquires around every append: the caller's, or the /// <see cref="JournalFileDefaultLock" />. Exposed so tests can check which one a constructor chose. @@ -92,21 +115,20 @@ public JournalFileBackend(string filePath, BaseJournalFileLock? lockObj = null) using var f = new FileStream(_filePath, FileMode.Open, FileAccess.Read, FileShare.ReadWrite); // Maintain remaining_log_size to allow writing by another process while reading the log. long remainingLogSize = new FileInfo(_filePath).Length; - int logNumberStart = 0; // Byte offset of the line being read. Python reads `_log_number_offset[log_number]` for it, but that entry - // can be missing here while another reader of this backend is still inserting it, so the position is - // carried by this enumeration instead; it equals the cached offset whenever both exist. - long position = 0; - bool known; - long offset; + // can be missing here while another reader of this backend is still recording it, so the position is + // carried by this enumeration instead; it equals the recorded offset whenever both exist. + // Python seeks to `log_number_from` when it has that line's offset and reads from byte 0 otherwise; this starts + // at the nearest known line start at or before it instead (plan 14). Either way the lines before + // `log_number_from` are skipped exactly as below, so the records yielded and the size accounting are the same. + int logNumberStart; + long position; lock (_offsetLock) - known = _logNumberOffset.TryGetValue(logNumberFrom, out offset); - if (known) + (logNumberStart, position) = ReadStart(logNumberFrom); + if (position > 0) { - f.Seek(offset, SeekOrigin.Begin); - logNumberStart = logNumberFrom; - remainingLogSize -= offset; - position = offset; + f.Seek(position, SeekOrigin.Begin); + remainingLogSize -= position; } Exception? lastDecodeError = null; @@ -127,12 +149,14 @@ public JournalFileBackend(string filePath, BaseJournalFileLock? lockObj = null) logNumber++; continue; } - // First writer wins, as Python's `if log_number + 1 not in ...`; every reader computes the same value. - lock (_offsetLock) - _logNumberOffset.TryAdd(logNumber + 1, position + byteLen); - position += byteLen; + long nextOffset = position + byteLen; + position = nextOffset; if (logNumber < logNumberFrom) { + // A line before the requested range is skipped undecoded, as Python skips it, and its successor's start + // is recorded as Python records it. + lock (_offsetLock) + RecordLineStart(logNumber + 1, nextOffset); logNumber++; continue; } @@ -146,17 +170,61 @@ public JournalFileBackend(string filePath, BaseJournalFileLock? lockObj = null) } catch (ValueError err) { + // A record that does not decode must not become a seek target, or the next sync would skip it: its + // successor's start is recorded only after it decodes (Python records it first and deletes it here). lastDecodeError = err; - // A record that does not decode must not become a seek target, or the next sync would skip it. - lock (_offsetLock) - _logNumberOffset.Remove(logNumber + 1); } if (parsed is not null) + { + lock (_offsetLock) + RecordLineStart(logNumber + 1, nextOffset); yield return parsed; + } logNumber++; } } + /// <summary>The known line start a read for <paramref name="logNumberFrom" /> begins at; the caller holds <c>_offsetLock</c>.</summary> + /// <param name="logNumberFrom">The first log number the read must yield.</param> + /// <returns> + /// The log number of the line the read starts at and that line's byte offset: the furthest line start established + /// when <paramref name="logNumberFrom" /> is at or past it, otherwise the checkpoint at or before it (log 0 at byte 0 + /// when nothing nearer is known). + /// </returns> + private (int LogNumber, long Offset) ReadStart(int logNumberFrom) + { + if (logNumberFrom >= _latestLogNumber) + return (_latestLogNumber, _latestLogOffset); + int index = logNumberFrom / OffsetCheckpointInterval; + // Every checkpoint below the furthest line start has been recorded: the read that established it passed each. + return index < _offsetCheckpoints.Count + ? (index * OffsetCheckpointInterval, _offsetCheckpoints[index]) + : (0, 0L); + } + + /// <summary> + /// Records that log number <paramref name="logNumber" /> starts at byte <paramref name="offset" />, once the line + /// before it has been read whole and decoded; the caller holds <c>_offsetLock</c>. + /// </summary> + /// <param name="logNumber">The log number whose line starts at <paramref name="offset" />.</param> + /// <param name="offset">The byte offset of that line's first byte.</param> + /// <remarks> + /// Readers sharing the backend record the same offsets for the same lines (the file only grows), so the order + /// they record in does not matter: the furthest start only moves forward, and a checkpoint is appended by + /// whichever reader passes it first. A reader that starts past a checkpoint starts at a line some reader reached by + /// reading through every earlier checkpoint, so checkpoints are appended in order. + /// </remarks> + private void RecordLineStart(int logNumber, long offset) + { + if (logNumber > _latestLogNumber) + { + _latestLogNumber = logNumber; + _latestLogOffset = offset; + } + if (logNumber % OffsetCheckpointInterval == 0 && logNumber / OffsetCheckpointInterval == _offsetCheckpoints.Count) + _offsetCheckpoints.Add(offset); + } + /// <summary> /// Streams raw lines (including the <c>\n</c> terminator, like Python's binary-file line /// iteration) so byte lengths match the offsets Python would compute. @@ -458,7 +526,16 @@ public JournalFileOpenLock(string filepath, int? gracePeriod = 30) /// <summary>Acquire a lock in a blocking way by creating a lock file.</summary> /// <returns>True after acquiring exclusive ownership.</returns> /// <exception cref="System.IO.IOException">Lock creation fails for a reason other than an existing lock.</exception> - /// <exception cref="System.UnauthorizedAccessException">Lock-file or symbolic-link creation is denied.</exception> + /// <exception cref="System.UnauthorizedAccessException"> + /// Lock-file creation is denied: off Windows on the first denial, as in Optuna; on Windows once denials have + /// run unbroken for longer than <see cref="JournalFileLockProtocol.MaxDeniedStreakMilliseconds" /> (a lock file + /// being deleted in place is waited out, not reported). + /// </exception> + /// <remarks> + /// Waits out a lock path that is "delete pending" on Windows (see + /// <see cref="JournalFileLockProtocol.MaxDeniedStreakMilliseconds" />): a stale lock someone deletes by hand while + /// this waits no longer kills the waiter. This departs from Optuna, whose waiter raises <c>PermissionError</c> there. + /// </remarks> public override bool Acquire() { double sleepSecs = 0.001; @@ -466,6 +543,8 @@ public override bool Acquire() long lastUpdateTimestamp = Environment.TickCount64; long lastWarningTimestamp = Environment.TickCount64; DateTime? mtime = null; + // When the current unbroken run of access-denied failures began, or -1 when the last attempt was not denied. + long deniedSince = -1; while (true) { try @@ -474,8 +553,27 @@ public override bool Acquire() new FileStream(_lockFile, FileMode.CreateNew, FileAccess.Write, FileShare.None).Dispose(); return true; } + catch (UnauthorizedAccessException) when (OperatingSystem.IsWindows()) + { + // ERROR_ACCESS_DENIED from the exclusive create: the lock path is "delete pending" (deleted in place, its + // deleting handle not yet closed), or the path cannot be created at all. The first passes within + // milliseconds, so the waiter waits as for a held lock; a run longer than the bound is the second, and is + // reported as before. Releases never cause it (they rename the lock away), so Optuna's protocol, which + // fails here, is unchanged for every lock a worker takes and releases. + long now = Environment.TickCount64; + if (deniedSince < 0) + deniedSince = now; + else if (now - deniedSince > JournalFileLockProtocol.MaxDeniedStreakMilliseconds) + throw; + + Thread.Sleep(TimeSpan.FromSeconds(sleepSecs)); + sleepSecs = Math.Min(sleepSecs * 2, JournalFileLockProtocol.MaxRetrySleepSeconds); + } catch (IOException e) when (JournalFileLockProtocol.IsAlreadyExists(e)) { + // The path exists normally again, so any run of denials is over. + deniedSince = -1; + // EEXIST from the exclusive create itself means another holder; see JournalFileSymlinkLock.Acquire // for why the path is not re-checked. Other failures are not caught and propagate, as in Python. if ((Environment.TickCount64 - lastWarningTimestamp) / 1000.0 > warningInterval) @@ -576,6 +674,13 @@ public override void Release() /// denied path), its exception propagates, so a journal that cannot be locked at all still fails loudly. /// </para> /// <para> +/// <b>A lock deleted in place.</b> On Windows, a lock path someone deletes by hand is "delete pending" for a +/// moment, and creating the symbolic link there is denied. That counts as a symbolic-link failure, so this +/// instance switches to the open-file protocol, which waits such a window out +/// (<see cref="JournalFileLockProtocol.MaxDeniedStreakMilliseconds" />). Both protocols use the one lock path, +/// so exclusion holds across the switch. Releases never cause it: they rename the lock away first. +/// </para> +/// <para> /// <b>Footgun fixed in 2026-10.</b> Both protocols used to decide "contention or real error" by /// re-checking the path after a failed create. A holder that released in between turned contention into /// an exception, which killed 7–10 of 16 concurrent workers on one journal and made this lock switch @@ -705,6 +810,32 @@ internal static class JournalFileLockProtocol /// </remarks> internal const double MaxRetrySleepSeconds = 0.016; + /// <summary> + /// Longest unbroken run of access-denied failures, in milliseconds, that <see cref="JournalFileOpenLock.Acquire" /> + /// waits out on Windows before it treats the denial as a real permission problem and rethrows. + /// </summary> + /// <remarks> + /// <para> + /// <b>Why a denial can be transient.</b> On Windows, creating a file whose name is "delete pending" fails with + /// ERROR_ACCESS_DENIED (.NET's <see cref="UnauthorizedAccessException" />). A lock path becomes delete pending + /// only when something deletes it in place: <c>DeleteFile</c> marks the file and the name stays until the + /// deleting handle closes (until every handle closes where POSIX delete semantics are unavailable). Releases + /// never do that: C# and Python release by renaming the lock away first. A person or tool deleting a stale + /// lock by hand does, and so did a journal test (measured 2026-11-12: 5,070 denials in 40,000 contended + /// acquisitions with in-place deletes on an idle machine, 14,277 under full CPU load, 0 with rename-then-delete). + /// </para> + /// <para> + /// <b>Why bounded.</b> A directory the process may not write into, or a directory standing at the lock path, + /// denies every attempt for good; after this long the denial is rethrown, so such a journal still fails, one + /// second later than before. Off Windows a denial is always rethrown at once. + /// </para> + /// <para> + /// <b>Departure from Optuna.</b> Optuna's <c>os.open(O_CREAT | O_EXCL)</c> raises <c>PermissionError</c> in the + /// same window and catches only <c>FileExistsError</c>, so a Python waiter fails where this one waits. + /// </para> + /// </remarks> + internal const long MaxDeniedStreakMilliseconds = 1000; + /// <summary>True when a lock-acquire failure means the lock path already exists, so the caller should wait.</summary> /// <param name="e">The exception the exclusive create or the symbolic-link creation threw.</param> /// <returns> diff --git a/src/OptunaSharp.Core/Storages/Journal/JournalStorage.cs b/src/OptunaSharp.Core/Storages/Journal/JournalStorage.cs index e7761e0..2beee11 100644 --- a/src/OptunaSharp.Core/Storages/Journal/JournalStorage.cs +++ b/src/OptunaSharp.Core/Storages/Journal/JournalStorage.cs @@ -607,6 +607,152 @@ public override void SetTrialSystemAttr(int trialId, string key, object? value) } } + /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <inheritdoc /> + /// <remarks>See <see cref="WriteAttributeBatch" />: one checked, appended batch of ordinary records.</remarks> + public override void SetStudyUserAttrs(int studyId, IReadOnlyDictionary<string, object?> attrs) + => WriteAttributeBatch(JournalOperation.SetStudyUserAttr, "study_id", studyId, "user_attr", attrs, isTrial: false); + + /// <param name="studyId">Storage identifier of the study; distinct from its name.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <inheritdoc /> + /// <remarks>See <see cref="WriteAttributeBatch" />: one checked, appended batch of ordinary records.</remarks> + public override void SetStudySystemAttrs(int studyId, IReadOnlyDictionary<string, object?> attrs) + => WriteAttributeBatch(JournalOperation.SetStudySystemAttr, "study_id", studyId, "system_attr", attrs, isTrial: false); + + /// <param name="trialId">Storage identifier of the trial; distinct from its per-study trial number.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <inheritdoc /> + /// <remarks>See <see cref="WriteAttributeBatch" />: one checked, appended batch of ordinary records.</remarks> + public override void SetTrialUserAttrs(int trialId, IReadOnlyDictionary<string, object?> attrs) + => WriteAttributeBatch(JournalOperation.SetTrialUserAttr, "trial_id", trialId, "user_attr", attrs, isTrial: true); + + /// <param name="trialId">Storage identifier of the trial; distinct from its per-study trial number.</param> + /// <param name="attrs">The attributes, written in enumeration order.</param> + /// <inheritdoc /> + /// <remarks>See <see cref="WriteAttributeBatch" />: one checked, appended batch of ordinary records.</remarks> + public override void SetTrialSystemAttrs(int trialId, IReadOnlyDictionary<string, object?> attrs) + => WriteAttributeBatch(JournalOperation.SetTrialSystemAttr, "trial_id", trialId, "system_attr", attrs, isTrial: true); + + /// <summary> + /// The bulk attribute writes (plan 13, item S8): one record per entry, exactly the record the single-attribute + /// write appends, all appended in one backend call. + /// </summary> + /// <param name="opCode">The single-attribute operation each record carries.</param> + /// <param name="idField">The record's id field: <c>study_id</c> or <c>trial_id</c>.</param> + /// <param name="id">The study or trial id.</param> + /// <param name="attrField">The record's attribute field: <c>user_attr</c> or <c>system_attr</c>.</param> + /// <param name="attrs">The attributes, one record each, in enumeration order.</param> + /// <param name="isTrial">Whether <paramref name="id" /> is a trial (checked as updatable) or a study (checked as existing).</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="NumSharp.KeyError">The study or trial does not exist.</exception> + /// <exception cref="OptunaSharp.UpdateFinishedTrialError">The trial has finished.</exception> + /// <exception cref="Exception">A value cannot be serialized, or the backend cannot append; nothing is appended then.</exception> + /// <remarks> + /// <para> + /// <b>One record per entry, on purpose.</b> Python's journal replay asserts that an attribute record carries + /// exactly one key (<c>assert len(log["user_attr"]) == 1</c>), so a journal Python workers share can only hold + /// single-key records. The batch is those records, appended together: the file backend writes them under one + /// lock with one flush, where single writes pay one each. + /// </para> + /// <para> + /// <b>Checked first.</b> The replay raises for this worker's own record on an unknown or finished trial, one + /// record per synchronization. Appending a whole batch the replay then rejects would leave records that make + /// later, unrelated calls of this storage raise, so the batch is checked against the replayed state first and + /// nothing is written when the check fails. If another process finishes the trial between the check and the + /// append, <see cref="SyncAfterBatch" /> consumes the batch's rejected records before the error surfaces. + /// </para> + /// </remarks> + private void WriteAttributeBatch( + JournalOperation opCode, string idField, int id, string attrField, + IReadOnlyDictionary<string, object?> attrs, bool isTrial) + { + ArgumentNullException.ThrowIfNull(attrs); + if (attrs.Count == 0) + return; + + var logs = new List<OrderedDict<string, object?>>(attrs.Count); + foreach (var (key, value) in attrs) + { + logs.Add(new OrderedDict<string, object?> + { + ["op_code"] = (int)opCode, + ["worker_id"] = null, // filled under the lock: the worker id belongs to the replay state + [idField] = id, + [attrField] = new OrderedDict<string, object?> { [key] = value }, + }); + } + + lock (_threadLock) + { + SyncWithBackend(); + if (isTrial) + _replayResult.ThrowIfTrialNotUpdatable(id); + else + _replayResult.ThrowIfStudyMissing(id); + + string workerId = _replayResult.WorkerId; + foreach (var log in logs) + log["worker_id"] = workerId; + _backend.AppendLogs(logs); + SyncAfterBatch(logs.Count); + } + } + + /// <summary> + /// Synchronizes after appending a batch of this worker's records, consuming every record of the batch the replay + /// rejects before raising the first rejection. + /// </summary> + /// <param name="batchSize">How many records the batch appended; each rejection consumes at least one of them.</param> + /// <exception cref="Exception">The first exception the synchronization raised, rethrown with its original stack.</exception> + /// <remarks> + /// A rejection here means another process finished or deleted the target between the check and the append. The + /// replay raises once per rejected record, and only for the worker that wrote it, so without draining, each of + /// the batch's remaining records would raise in a later call of this storage that has nothing to do with it. + /// Each failed synchronization advances past at least the record that failed, so at most one attempt per record + /// is needed. + /// </remarks> + private void SyncAfterBatch(int batchSize) + { + System.Runtime.ExceptionServices.ExceptionDispatchInfo? first = null; + for (int attempt = 0; attempt < batchSize; attempt++) + { + try + { + SyncWithBackend(); + break; + } + catch (Exception exception) + { + first ??= System.Runtime.ExceptionServices.ExceptionDispatchInfo.Capture(exception); + } + } + first?.Throw(); + } + + /// <summary>Test hook for <see cref="SyncAfterBatch" />: appends records as one batch, then drains as it does.</summary> + /// <param name="logs">Complete records, worker id included.</param> + /// <exception cref="Exception">The first rejection of the batch, after the batch is consumed.</exception> + internal void AppendBatchAndSyncForTests(IReadOnlyList<OrderedDict<string, object?>> logs) + { + lock (_threadLock) + { + _backend.AppendLogs(logs); + SyncAfterBatch(logs.Count); + } + } + + /// <summary>The worker id this storage writes into records, for tests that build records of their own.</summary> + internal string WorkerIdForTests + { + get + { + lock (_threadLock) + return _replayResult.WorkerId; + } + } + /// <param name="trialId">Storage identifier of the trial; distinct from its per-study trial number.</param> /// <inheritdoc /> public override FrozenTrial GetTrial(int trialId) @@ -666,7 +812,11 @@ internal sealed partial class JournalStorageReplayResult /// <summary>Number of log records already consumed by replay.</summary> internal int LogNumberRead; private string _workerIdPrefix; - private readonly Dictionary<int, FrozenStudy> _studies = new(); + + // Python's `self._studies: dict[int, FrozenStudy]`: creation order across deletions, as a dict appends new keys, where + // a Dictionary<int, ...> lists the next study in a deleted one's freed slot (QA-67; `optuna studies` on a journal file + // printed `a, c, d` and `optunasharp studies` `a, d, c`). The snapshot codecs write and read studies in this order. + private readonly OrderedDict<int, FrozenStudy> _studies = new(); private readonly Dictionary<int, FrozenTrial> _trials = new(); private readonly Dictionary<int, List<int>> _studyIdToTrialIds = new(); @@ -856,8 +1006,9 @@ private void ApplyCreateStudy(OrderedDict<string, object?> log) if (_studies.Values.Any(s => s.StudyName == studyName)) { + // Python's bare `raise DuplicatedStudyError`: an empty message, not .NET's default text (QA-66). if (IsIssuedByThisWorker(log)) - throw new DuplicatedStudyError(); + throw new DuplicatedStudyError(string.Empty); return; } @@ -1155,6 +1306,34 @@ private void ApplySetTrialSystemAttr(OrderedDict<string, object?> log) } } + /// <summary> + /// Raises what replaying this worker's own attribute record for <paramref name="trialId" /> would raise, before + /// any record is written: the bulk attribute writes (plan 13, item S8) check once, then append their batch. + /// </summary> + /// <param name="trialId">Storage identifier of the trial about to be written.</param> + /// <exception cref="NumSharp.KeyError">The trial does not exist (<see cref="JournalStorage.NotFoundMsg" />).</exception> + /// <exception cref="OptunaSharp.UpdateFinishedTrialError">The trial has finished; the message is the replay's.</exception> + internal void ThrowIfTrialNotUpdatable(int trialId) + { + if (!_trials.TryGetValue(trialId, out FrozenTrial? trial)) + throw new KeyError(JournalStorage.NotFoundMsg); + if (trial.State.IsFinished()) + throw new UpdateFinishedTrialError( + string.Format(CultureInfo.InvariantCulture, JournalStorage.UnupdatableMsgFormat, trial.Number)); + } + + /// <summary> + /// Raises what replaying this worker's own study-attribute record would raise for a missing study, before any + /// record is written (plan 13, item S8). + /// </summary> + /// <param name="studyId">Storage identifier of the study about to be written.</param> + /// <exception cref="NumSharp.KeyError">The study does not exist (<see cref="JournalStorage.NotFoundMsg" />).</exception> + internal void ThrowIfStudyMissing(int studyId) + { + if (!_studies.ContainsKey(studyId)) + throw new KeyError(JournalStorage.NotFoundMsg); + } + /// <param name="trialId">Storage identifier of the trial; distinct from its per-study trial number.</param> /// <param name="log">Decoded journal operation, including its payload and originating worker identifier.</param> /// <summary>Checks trial existence and completion state before applying a replay mutation.</summary> diff --git a/src/OptunaSharp.Core/Storages/SqlAlchemy/SqlAlchemyUrl.cs b/src/OptunaSharp.Core/Storages/SqlAlchemy/SqlAlchemyUrl.cs index 0f57a34..a5f9994 100644 --- a/src/OptunaSharp.Core/Storages/SqlAlchemy/SqlAlchemyUrl.cs +++ b/src/OptunaSharp.Core/Storages/SqlAlchemy/SqlAlchemyUrl.cs @@ -440,7 +440,7 @@ internal static bool AsBool(object? value) ? new BigInteger(Math.Truncate(d)) : throw (Exception)(double.IsNaN(d) ? new ValueError("cannot convert float NaN to integer") - : new OverflowException("cannot convert float infinity to integer")), + : new OverflowError("cannot convert float infinity to integer")), _ => throw new TypeError( $"int() argument must be a string, a bytes-like object or a real number, not '{TypeName(value)}'"), }; @@ -698,7 +698,7 @@ internal static class StorageUrlTemplate /// <exception cref="AttributeError">A field reads an attribute an <c>int</c> lacks.</exception> /// <exception cref="TypeError">A field indexes the integer.</exception> /// <exception cref="NotSupportedException">A field reads one of <c>int</c>'s methods.</exception> - /// <exception cref="OverflowException">A format spec that CPython rejects with <c>OverflowError</c>.</exception> + /// <exception cref="OverflowError">A format spec that CPython rejects with <c>OverflowError</c>.</exception> /// <exception cref="OutOfMemoryException"> /// A field padded past the longest .NET string (a width above about 2<sup>30</sup>), which CPython would build /// when memory allows. diff --git a/src/OptunaSharp.Core/Storages/TrialsPrefixView.cs b/src/OptunaSharp.Core/Storages/TrialsPrefixView.cs index 819b3b5..42bec80 100644 --- a/src/OptunaSharp.Core/Storages/TrialsPrefixView.cs +++ b/src/OptunaSharp.Core/Storages/TrialsPrefixView.cs @@ -14,10 +14,15 @@ namespace OptunaSharp.Storages; /// <para> /// <b>Liveness.</b> The window's <em>membership</em> is frozen (indices <c>0..Count-1</c> at creation /// time — appends after creation are invisible), but each read returns the trial's <em>current</em> -/// snapshot instance: storages that copy-on-write a trial on update (as -/// <see cref="InMemoryStorage" /> does) are seen through this view at their latest state, unlike a -/// copied list whose elements go stale. Samplers want exactly that — the freshest attrs of a frozen -/// membership. +/// record: a storage that replaces a trial's record on update is seen through this view at its latest +/// state, unlike a copied list whose elements go stale. Samplers want exactly that — the freshest attrs +/// of a frozen membership. +/// </para> +/// <para> +/// <b>In-memory records.</b> <see cref="InMemoryStorage" /> writes a running trial's record in place +/// while no reader holds it (plan 13, item S4), so this view reads an <em>unfinished</em> record under the +/// storage's lock and marks it as held: the storage copies it before its next write, and the record the +/// caller got never changes. A finished record is never written again, so it is read without the lock. /// </para> /// <para> /// <b>Footgun — concurrency.</b> Reads are lock-free against a backing <see cref="List{T}" /> whose @@ -32,17 +37,58 @@ public sealed class TrialsPrefixView : IReadOnlyList<FrozenTrial> { private readonly List<FrozenTrial> _trials; + /// <summary> + /// The storage's own read for a trial that is not finished, or null to read every trial straight from the list. + /// <see cref="InMemoryStorage" /> passes one that takes its lock and marks the record as held by a reader, so the + /// storage copies it before its next write (Rustuna plan 13, item S4: a running record nobody holds is written + /// in place). Finished records are never written again, so they stay lock-free. + /// </summary> + private readonly Func<int, FrozenTrial>? _readUnfinished; + /// <summary>Wraps the first <paramref name="count" /> elements of <paramref name="trials" />.</summary> /// <param name="trials">The live storage list; borrowed, never mutated through this view.</param> /// <param name="count">The frozen membership size; must not exceed the list's length at any read.</param> /// <exception cref="ArgumentNullException"><paramref name="trials" /> is null.</exception> /// <exception cref="ArgumentOutOfRangeException"><paramref name="count" /> is negative.</exception> public TrialsPrefixView(List<FrozenTrial> trials, int count) + : this(trials, count, readUnfinished: null) + { + } + + /// <summary> + /// Wraps the first <paramref name="count" /> elements of <paramref name="trials" />, reading unfinished trials + /// through the storage instead of straight from the list. + /// </summary> + /// <param name="trials">The live storage list; borrowed, never mutated through this view.</param> + /// <param name="count">The frozen membership size; must not exceed the list's length at any read.</param> + /// <param name="readUnfinished"> + /// Called with the position of a trial whose record read from the list is not finished; returns the record to + /// hand out, read under the storage's lock. Null reads every position straight from the list. + /// </param> + /// <exception cref="ArgumentNullException"><paramref name="trials" /> is null.</exception> + /// <exception cref="ArgumentOutOfRangeException"><paramref name="count" /> is negative.</exception> + internal TrialsPrefixView(List<FrozenTrial> trials, int count, Func<int, FrozenTrial>? readUnfinished) { _trials = trials ?? throw new ArgumentNullException(nameof(trials)); if (count < 0) throw new ArgumentOutOfRangeException(nameof(count), count, "A prefix length cannot be negative."); Count = count; + _readUnfinished = readUnfinished; + } + + /// <summary>Reads one position, through <see cref="_readUnfinished" /> when the record there is not finished.</summary> + /// <param name="index">A position below <see cref="Count" />.</param> + /// <returns>The record to hand out.</returns> + /// <remarks> + /// The lock-free first read is safe: a state change publishes a new record whole, so a record that reads as + /// finished is final; one that reads as unfinished may be changing in place, so it is read again under the lock. + /// </remarks> + private FrozenTrial Read(int index) + { + FrozenTrial trial = _trials[index]; + if (_readUnfinished is not null && !trial.State.IsFinished()) + return _readUnfinished(index); + return trial; } /// <summary>The frozen membership size — appends to the backing list after construction are not visible.</summary> @@ -58,7 +104,7 @@ public FrozenTrial this[int index] { if ((uint)index >= (uint)Count) throw new ArgumentOutOfRangeException(nameof(index), index, $"The view holds {Count} trials."); - return _trials[index]; + return Read(index); } } @@ -67,7 +113,7 @@ public FrozenTrial this[int index] public IEnumerator<FrozenTrial> GetEnumerator() { for (int i = 0; i < Count; i++) - yield return _trials[i]; + yield return Read(i); } /// <inheritdoc /> diff --git a/src/OptunaSharp.Core/Study.cs b/src/OptunaSharp.Core/Study.cs index 99e2a4f..ae5bce0 100644 --- a/src/OptunaSharp.Core/Study.cs +++ b/src/OptunaSharp.Core/Study.cs @@ -1,6 +1,8 @@ using System; using System.Collections.Generic; using System.Linq; +using System.Runtime.CompilerServices; +using System.Runtime.InteropServices; using System.Threading; using NumSharp; using OptunaSharp.Collections; @@ -37,8 +39,37 @@ internal sealed class ThreadLocalStudyAttribute { /// <summary>Whether this thread is currently executing an objective or its callbacks.</summary> internal bool InOptimizeLoop; + + private List<FrozenTrial>? _cachedAllTrials; + /// <summary>Trial-history snapshot reused within one trial; cleared when the next trial is asked.</summary> - internal List<FrozenTrial>? CachedAllTrials; + /// <remarks> + /// Setting it, to a new snapshot or to null, also drops <see cref="CachedFiltered" />: that list was filtered + /// from the snapshot being replaced, and a reset site (a tell, the end of an optimize worker) must not leave a + /// reused thread holding a finished study's trials through it either. + /// </remarks> + internal List<FrozenTrial>? CachedAllTrials + { + get => _cachedAllTrials; + set + { + _cachedAllTrials = value; + CachedFiltered = null; + CachedFilteredSource = null; + } + } + + /// <summary> + /// The last list <see cref="GetTrialsCachedReadOnly" /> filtered, shared by every read-only read of the same + /// states until the snapshot changes (plan 15). + /// </summary> + internal List<FrozenTrial>? CachedFiltered; + + /// <summary>The snapshot <see cref="CachedFiltered" /> was filtered from: the memo answers only while it is still <see cref="CachedAllTrials" />.</summary> + internal List<FrozenTrial>? CachedFilteredSource; + + /// <summary>The state mask <see cref="CachedFiltered" /> was filtered with: bit <c>s</c> set for each kept state <c>s</c>.</summary> + internal int CachedFilteredMask; /// <summary> /// The worker's own sampler instance while this thread runs a trial of an <c>Optimize(nJobs)</c> call with @@ -261,7 +292,7 @@ internal List<FrozenTrial> GetTrialsInternal( ThreadLocal.CachedAllTrials ??= Storage.GetAllTrials(StudyId, deepcopy: false); var trials = ThreadLocal.CachedAllTrials; var filteredTrials = states is not null - ? trials.Where(t => states.Contains(t.State)).ToList() + ? FilterByState(trials, states) : trials; return deepcopy ? filteredTrials.Select(t => t.DeepCopy()).ToList() : filteredTrials; } @@ -269,6 +300,143 @@ internal List<FrozenTrial> GetTrialsInternal( return Storage.GetAllTrials(StudyId, deepcopy: deepcopy, states: states); } + /// <summary> + /// <c>GetTrialsInternal(deepcopy: false, states, useCache: true)</c> for a caller that only reads the result: the + /// same records in the same order, but one list shared by every such read of the same states until the trial + /// snapshot changes, instead of a new filtered copy per read. + /// </summary> + /// <param name="states">The states to keep; the list is shared only between reads of the same set of states.</param> + /// <returns> + /// Trials in ascending trial-number order. <b>Never change it</b>: a later read of the same states in the same trial + /// returns this very list, so a change would leak into every one of them (the type says read-only for that reason; + /// a caller that needs to change the history copies it, or calls <see cref="GetTrialsInternal" />). + /// </returns> + /// <exception cref="ArgumentNullException"><paramref name="states" /> is null.</exception> + /// <exception cref="NumSharp.KeyError">The study no longer exists in storage (on the read that takes the snapshot).</exception> + /// <remarks> + /// <para> + /// <b>Why.</b> TPE reads the filtered history twice for each sampled trial in multivariate mode, and twice for + /// <i>each parameter</i> in independent mode (MOTPE's default): each read copied the whole history, growing the + /// list by doubling. Measured before plan 15 those copies were 12 % of a 1,000-trial TPE study's allocations. + /// </para> + /// <para> + /// <b>Why it is the same history.</b> The memo is keyed by the snapshot list's identity and the state set, and + /// the snapshot is the one <see cref="GetTrialsInternal" /> filters too, so both filter the same records with + /// the same test. A record's state cannot change under the memo: the storages hand out records they never + /// change afterwards (the in-memory and journal storages change a shallow copy and store that, plan 13 item S4), + /// and the snapshot itself is replaced, which drops the memo, by the tell that ends the trial. + /// </para> + /// </remarks> + internal IReadOnlyList<FrozenTrial> GetTrialsCachedReadOnly(TrialState[] states) + { + ArgumentNullException.ThrowIfNull(states); + ThreadLocalStudyAttribute local = ThreadLocal; + local.CachedAllTrials ??= Storage.GetAllTrials(StudyId, deepcopy: false); + List<FrozenTrial> all = local.CachedAllTrials; + + int mask = StateMask(states); + if (mask >= 0 && local.CachedFiltered is { } memo && ReferenceEquals(local.CachedFilteredSource, all) + && local.CachedFilteredMask == mask) + return memo; + + List<FrozenTrial> filtered = FilterByState(all, states); + // A set no mask can hold (a value outside the enum's small range) is filtered every time and never memoized, so + // the memo's key always describes its list exactly. + if (mask >= 0) + { + local.CachedFiltered = filtered; + local.CachedFilteredSource = all; + local.CachedFilteredMask = mask; + } + return filtered; + } + + /// <summary> + /// The trials of <paramref name="trials" /> whose state is in <paramref name="states" />, in order: what + /// <c>trials.Where(t => states.Contains(t.State)).ToList()</c> returns, in a list allocated once at its final size. + /// </summary> + /// <param name="trials">The trials to filter; not changed.</param> + /// <param name="states">The states to keep; duplicates are harmless and an empty set keeps nothing.</param> + /// <returns>A new list the caller may change, holding the kept trials as the same references, in their order.</returns> + /// <remarks> + /// <para> + /// The membership test is a bit mask (<see cref="StateMask" />): enum equality is equality of the underlying + /// values, so for states in 0–30 testing bit <c>state</c> answers exactly what <c>Contains</c> answers. A set + /// holding any other value takes the LINQ expression itself. A trial whose own state lies outside 0–30 is never + /// in a mask, as it is never in such a set. + /// </para> + /// <para> + /// Two passes, count then fill, instead of a list grown by doubling: the doubling left about twice the final + /// array in garbage per call, while a single list sized for every trial would waste the whole history on a + /// narrow filter (QMC's read of the running trials). + /// </para> + /// <para> + /// Compiled optimized from the first call (<see cref="MethodImplOptions.AggressiveOptimization" />), over a + /// span of the list: the LINQ it replaces ships precompiled, and as tier-0 code these loops made the second + /// thousands of asks of a process measurably slower (plan 15, SMS-EMOA 2,000 trials, until tiering caught up). + /// </para> + /// </remarks> + [MethodImpl(MethodImplOptions.AggressiveOptimization)] + internal static List<FrozenTrial> FilterByState(List<FrozenTrial> trials, IReadOnlyCollection<TrialState> states) + { + int mask = StateMask(states); + if (mask < 0) + return trials.Where(t => states.Contains(t.State)).ToList(); + + // The snapshot's items as a span: two plain indexed passes, no enumerator calls (the list is this thread's own + // snapshot, so nothing changes it while it is read). + ReadOnlySpan<FrozenTrial> span = CollectionsMarshal.AsSpan(trials); + int count = 0; + for (int i = 0; i < span.Length; i++) + { + if (InStateMask(span[i].State, mask)) + count++; + } + + var result = new List<FrozenTrial>(count); + for (int i = 0; i < span.Length; i++) + { + if (InStateMask(span[i].State, mask)) + result.Add(span[i]); + } + return result; + } + + /// <summary>One bit per state of <paramref name="states" /> (bit <c>s</c> for state <c>s</c>), or -1 when a state lies outside 0–30.</summary> + /// <param name="states">The states to encode; enumerated once.</param> + /// <returns>The mask (never negative, and 0 for an empty set), or -1 when the set holds a state no mask can encode.</returns> + /// <remarks>Bit 31 would make the mask negative and collide with the -1 refusal, so state 31 is refused too: the enum's real values are 0–4.</remarks> + private static int StateMask(IReadOnlyCollection<TrialState> states) + { + int mask = 0; + if (states is TrialState[] array) + { + // An array is the common case (every sampler passes one); indexing it avoids boxing an enumerator per read. + for (int i = 0; i < array.Length; i++) + { + if ((uint)array[i] >= 31) + return -1; + mask |= 1 << (int)array[i]; + } + return mask; + } + foreach (TrialState state in states) + { + if ((uint)state >= 31) + return -1; + mask |= 1 << (int)state; + } + return mask; + } + + /// <summary>Whether <paramref name="state" /> has its bit set in <paramref name="mask" />.</summary> + /// <param name="state">The trial's state; a value outside 0–30 is in no mask.</param> + /// <param name="mask">A mask from <see cref="StateMask" />.</param> + /// <returns>True when the state is one of the mask's states.</returns> + [MethodImpl(MethodImplOptions.AggressiveInlining)] + private static bool InStateMask(TrialState state, int mask) + => (uint)state < 31 && ((mask >> (int)state) & 1) != 0; + /// <summary> /// This study's trials as a zero-copy, fixed-membership window (see /// <see cref="BaseStorage.GetTrialsPrefixView" />) — the O(1) read GA samplers use on every ask where a @@ -279,6 +447,33 @@ internal List<FrozenTrial> GetTrialsInternal( /// <exception cref="NumSharp.KeyError">The study no longer exists in storage.</exception> internal IReadOnlyList<FrozenTrial> GetTrialsView() => Storage.GetTrialsPrefixView(StudyId); + /// <summary> + /// Every trial of this study, for a sampler that reads the history on every ask: the zero-copy view where the + /// storage has one, otherwise exactly the read Optuna's samplers make + /// (<c>study._get_trials(deepcopy=False, use_cache=...)</c>). + /// </summary> + /// <param name="useCache"> + /// For storages without a zero-copy view: whether to share the per-thread snapshot that lives until the next + /// ask (Optuna's <c>use_cache</c>). Ignored where the view is used, since the view costs nothing to take again. + /// </param> + /// <returns>Trials in ascending trial-number order; read-only.</returns> + /// <exception cref="NumSharp.KeyError">The study no longer exists in storage.</exception> + /// <remarks> + /// <para> + /// Same trials, same order: the two reads differ only in how fresh each snapshot is. The view returns each + /// trial's current snapshot, a copied list the one current when it was taken. In a run with one trial at + /// a time nothing changes in between, so seeded results are identical (Rustuna plan 13, phase 1). + /// </para> + /// <para> + /// The fallback keeps database-backed storages on their existing read, so switching a sampler to this + /// method never adds a database round trip (<see cref="BaseStorage.HasZeroCopyTrialsView" />). + /// </para> + /// </remarks> + internal IReadOnlyList<FrozenTrial> GetTrialsForSampler(bool useCache) + => Storage.HasZeroCopyTrialsView + ? Storage.GetTrialsPrefixView(StudyId) + : GetTrialsInternal(deepcopy: false, states: null, useCache: useCache); + /// <summary>Python <c>Study._get_best_trial(deepcopy)</c>.</summary> /// <param name="deepcopy">Whether to copy trial records; treat records returned with false as read-only.</param> /// <returns>The best feasible completed single-objective trial, copied when requested.</returns> @@ -665,6 +860,23 @@ public TrialsTable TrialsDataframe(string[]? attrs = null, bool multiIndex = fal /// <param name="value">A value of the attribute. The value should be JSON serializable.</param> public void SetUserAttr(string key, object? value) => Storage.SetStudyUserAttr(StudyId, key, value); + /// <summary> + /// Set several user attributes to the study at once (Rustuna's <c>set_user_attrs</c>; plan 13, item S8), with one + /// storage call: the stored result is what <see cref="SetUserAttr(string, object?)" /> once per entry leaves. + /// </summary> + /// <param name="attrs">The attributes, set in enumeration order. The values should be JSON serializable.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="NumSharp.KeyError">The study no longer exists in storage; nothing is set.</exception> + /// <exception cref="Exception">A configured storage fails; its exception propagates.</exception> + public void SetUserAttrs(IReadOnlyDictionary<string, object?> attrs) => Storage.SetStudyUserAttrs(StudyId, attrs); + + /// <summary>Optuna's <c>set_user_attr</c> name for <see cref="SetUserAttrs" />: several user attributes in one call.</summary> + /// <param name="attrs">The attributes, set in enumeration order. The values should be JSON serializable.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="NumSharp.KeyError">The study no longer exists in storage; nothing is set.</exception> + /// <exception cref="Exception">A configured storage fails; its exception propagates.</exception> + public void SetUserAttr(IReadOnlyDictionary<string, object?> attrs) => SetUserAttrs(attrs); + // Study.set_system_attr (deprecated 3.1.0) was removed in Optuna 5.0.0 (#6834). Optuna-internal // writers go through Storage.SetStudySystemAttr(StudyId, key, value); users keep SetUserAttr. @@ -810,9 +1022,11 @@ internal bool ShouldSkipEnqueue(OrderedDict<string, object?> @params) { foreach (var trial in GetTrials(deepcopy: false)) { + // The read-only accessors: this scans every trial, and the mutable ones would give each compact finished + // record (plan 13, item S12) its dictionaries back. IReadOnlyDictionary<string, object?> trialParams = - trial.SystemAttrsDict.GetValueOrDefault("fixed_params") as OrderedDict<string, object?> - ?? (IReadOnlyDictionary<string, object?>)trial.ParamsDict; + trial.SystemAttrs.GetValueOrDefault("fixed_params") as OrderedDict<string, object?> + ?? trial.Params; if (!new HashSet<string>(trialParams.Keys).SetEquals(@params.Keys)) { @@ -839,11 +1053,11 @@ internal bool ShouldSkipEnqueue(OrderedDict<string, object?> @params) && paramValue is not string && paramValue is not null) { PyFloat.TryConvert(existingParam, out double existingNumeric); - // np.isclose(a, b, atol=0.0, equal_nan=True): |a - b| <= atol + rtol*|b|. - // rtol is NOT passed, so it takes np.isclose's DEFAULT of 1e-5 (NOT 1e-8 — that - // is _truncnorm's explicit rtol; this call uses the numpy default). - isRepeated = double.IsNaN(newNumeric) && double.IsNaN(existingNumeric) - || Math.Abs(newNumeric - existingNumeric) <= 1e-05 * Math.Abs(existingNumeric); + // np.isclose(float(param_value), float(existing_param), atol=0.0, equal_nan=True). rtol is NOT passed, + // so it takes np.isclose's DEFAULT of 1e-5 (NOT 1e-8 — that is _truncnorm's explicit rtol). NumPy's + // isfinite(b) and a == b terms decide the infinities (QA-50): a repeated inf is skipped, and a finite + // value or -inf enqueued over an inf is not, where the bare inequality had it the other way round. + isRepeated = MathUtil.IsClose(newNumeric, existingNumeric, atol: 0.0, equalNan: true); } else { diff --git a/src/OptunaSharp.Core/StudySummary.cs b/src/OptunaSharp.Core/StudySummary.cs index e7ac268..d000e6c 100644 --- a/src/OptunaSharp.Core/StudySummary.cs +++ b/src/OptunaSharp.Core/StudySummary.cs @@ -59,7 +59,7 @@ public StudySummary( /// <summary><see cref="FrozenTrial" /> with best objective value in the <see cref="Study" />.</summary> public FrozenTrial? BestTrial { get; } - /// <summary>Dictionary that contains the attributes of the study set with <see cref="Study.SetUserAttr" />.</summary> + /// <summary>Dictionary that contains the attributes of the study set with <see cref="Study.SetUserAttr(string, object?)" />.</summary> public OrderedDict<string, object?> UserAttrs { get; } /// <summary>The number of trials ran in the <see cref="Study" />.</summary> diff --git a/src/OptunaSharp.Core/Terminator/EmmrEvaluator.cs b/src/OptunaSharp.Core/Terminator/EmmrEvaluator.cs index 3ffcf25..bbd10f8 100644 --- a/src/OptunaSharp.Core/Terminator/EmmrEvaluator.cs +++ b/src/OptunaSharp.Core/Terminator/EmmrEvaluator.cs @@ -82,7 +82,7 @@ public override double Evaluate(IReadOnlyList<FrozenTrial> trials, StudyDirectio var searchSpace = new GpSearchSpace(optunaSearchSpace); double[,] normalizedParams = searchSpace.GetNormalizedParams( - completeTrials.Select(t => (IReadOnlyDictionary<string, object?>)t.ParamsDict).ToList()); + completeTrials.Select(t => t.Params).ToList()); if (searchSpace.Dim == 0) { OptunaWarnings.Warn( @@ -217,17 +217,25 @@ private static double ComputeGpPosteriorCovTwoThetas( /// <returns>The standard-normal probability density at the supplied argument.</returns> private static double NormPdf(double x) => Math.Exp(-Math.Pow(x, 2.0) / 2.0) / NormPdfC; - /// <summary><c>np.argmax</c> over the first <paramref name="count" /> entries (first maximum).</summary> - /// <param name="a">The first numerical operand; its dimensions must agree with the operation described in the summary.</param> - /// <param name="count">The number of leading values to include in the search.</param> - /// <returns>The index of the first largest value.</returns> + /// <summary> + /// <c>np.argmax</c> over the first <paramref name="count" /> entries, through NumSharp — Optuna's + /// <c>np.argmax(standarized_score_vals)</c> and <c>np.argmax(standarized_score_vals[:-1])</c>. + /// </summary> + /// <param name="a">The standardized score values, one per completed trial.</param> + /// <param name="count">The number of leading values to search (the whole array, or all but the last).</param> + /// <returns>The first index of the maximum among the leading values, or of the first NaN when one is NaN.</returns> + /// <remarks> + /// NumPy treats a NaN as maximal: a standardized value is NaN when the objective values overflow the + /// standardization (values near the float maximum, QA-53's class), and Optuna then takes the first NaN trial as + /// the best one. The former strict <c>></c> loop skipped NaNs. Two calls per evaluation, next to two GP fits. + /// </remarks> + /// <exception cref="NumSharp.ValueError"><paramref name="count" /> is 0 (NumPy's <c>attempt to get argmax of an empty sequence</c>).</exception> private static int ArgMax(double[] a, int count) { - int best = 0; - for (int i = 1; i < count; i++) - if (a[i] > a[best]) - best = i; - return best; + using NDArray values = np.array(a, copy: false); + using NDArray head = values[$":{count}"]; + using NDArray index = np.argmax(head); + return (int)(long)index; } /// <summary>Returns a copy of the requested matrix row.</summary> diff --git a/src/OptunaSharp.Core/Terminator/ErrorEval.cs b/src/OptunaSharp.Core/Terminator/ErrorEval.cs index b1e5a34..9bf1a9e 100644 --- a/src/OptunaSharp.Core/Terminator/ErrorEval.cs +++ b/src/OptunaSharp.Core/Terminator/ErrorEval.cs @@ -86,26 +86,26 @@ public override double Evaluate(IReadOnlyList<FrozenTrial> trials, StudyDirectio } /// <summary> - /// NumPy <c>np.var(x)</c> (population variance, <c>ddof=0</c>). For the small arrays a - /// cross-validation produces (< 128 elements), NumPy sums sequentially, so this naive - /// two-pass sum is bit-identical. + /// NumPy <c>np.var(x)</c> (population variance, <c>ddof=0</c>) of the cross-validation scores, computed by + /// NumSharp's <c>np.var</c>, which runs NumPy's <c>_var</c> statements and its pairwise sums, so the error estimate + /// is Optuna's to the last bit for any number of folds. /// </summary> - /// <param name="x">The numerical input values, in the order used by the operation.</param> - /// <returns>The population variance using the port's specified accumulation order.</returns> + /// <param name="x">The cross-validation scores, as Optuna turns its list into a float64 array.</param> + /// <returns>The population variance; NaN for no scores (NumPy's, without its RuntimeWarning).</returns> + /// <remarks> + /// This used to be a two-pass left-to-right sum, documented as bit-identical because "NumPy sums sequentially + /// below 128 elements". It does not: NumPy's pairwise sum switches to eight accumulators from eight elements on. + /// Measured 2026-11-11 against NumPy 2.4.2: the old sum matched for every length below 8 and for 7 of the 13 + /// lengths 8 to 20 (85 of 305 lengths up to 4,097 overall), so a 10-fold cross-validation could round + /// differently; NumSharp's <c>np.var</c> matched all 305. + /// </remarks> private static double NumpyVar(IReadOnlyList<double> x) { - int n = x.Count; - double sum = 0.0; - for (int i = 0; i < n; i++) - sum += x[i]; - double mean = sum / n; - double squared = 0.0; - for (int i = 0; i < n; i++) - { - double d = x[i] - mean; - squared += d * d; - } - return squared / n; + // A zero-copy view of the scores; np.var reads it and returns a fresh 0-d array, disposed here. + double[] scores = x as double[] ?? x.ToArray(); + using NDArray view = np.array(scores, copy: false); + using NDArray variance = np.var(view); + return (double)variance; } /// <summary>Returns the numeric items of the supplied score sequence, or an empty list for a non-sequence value.</summary> diff --git a/src/OptunaSharp.Core/Terminator/ImprovementEvaluator.cs b/src/OptunaSharp.Core/Terminator/ImprovementEvaluator.cs index b1ef490..f394984 100644 --- a/src/OptunaSharp.Core/Terminator/ImprovementEvaluator.cs +++ b/src/OptunaSharp.Core/Terminator/ImprovementEvaluator.cs @@ -138,7 +138,7 @@ public override double Evaluate(IReadOnlyList<FrozenTrial> trials, StudyDirectio var searchSpace = new GpSearchSpace(optunaSearchSpace); double[,] normalizedParams = searchSpace.GetNormalizedParams( - completeTrials.Select(t => (IReadOnlyDictionary<string, object?>)t.ParamsDict).ToList()); + completeTrials.Select(t => t.Params).ToList()); (double[,] normalizedTopNParams, double[] topNValues) = GetTopN(normalizedParams, values); double topNValuesMean = MathUtil.Mean(topNValues); @@ -222,7 +222,9 @@ internal static double ComputeStandardizedRegretBound( // UCB over the search space. (Original: LCB over the search space.) double ucbOverTopN = Max(ucbAcqf.EvalAcqfNoGrad(normalizedTopNParams)); double sampledUcb = OptimSample.OptimizeAcqfSample(ucbAcqf, optimizeNSamples, rng!).Value; - double standardizedUcbValue = Math.Max(ucbOverTopN, sampledUcb); + // Python's builtin max(a, b) keeps a unless b > a: a NaN first argument wins, a NaN second argument loses, and + // -0.0 / 0.0 keep the first. Math.Max would return NaN for either NaN and +0.0 for the zero pair. + double standardizedUcbValue = sampledUcb > ucbOverTopN ? sampledUcb : ucbOverTopN; var lcbAcqf = new LCB(gpr, searchSpace, beta); // LCB over the top trials. (Original: UCB over the top trials.) @@ -232,16 +234,23 @@ internal static double ComputeStandardizedRegretBound( return standardizedUcbValue - standardizedLcbValue; // standardized regret bound } - /// <summary>Returns the largest value in the supplied sequence.</summary> - /// <param name="a">The first numerical operand; its dimensions must agree with the operation described in the summary.</param> - /// <returns>The largest value in the supplied sequence.</returns> + /// <summary> + /// NumPy's <c>ndarray.max()</c> / <c>np.max</c> through NumSharp — the regret bound's maxima of the UCB and LCB + /// acquisition values over the top trials. A NaN anywhere makes the maximum NaN, as in NumPy. + /// </summary> + /// <param name="a">The acquisition values, one per top trial; at least one.</param> + /// <returns>The largest value, or NaN when any value is NaN.</returns> + /// <remarks> + /// Acquisition values turn NaN when the standardized values overflow (values near the float maximum, QA-53's + /// class); NumPy then returns a NaN regret bound. The former strict <c>></c> loop skipped NaNs and returned a + /// finite bound. Two calls per evaluation, next to a GP fit and 2,048 acquisition samples. + /// </remarks> + /// <exception cref="NumSharp.ValueError"><paramref name="a" /> is empty (NumPy's <c>zero-size array to reduction operation maximum which has no identity</c>).</exception> private static double Max(double[] a) { - double m = a[0]; - for (int i = 1; i < a.Length; i++) - if (a[i] > m) - m = a[i]; - return m; + using NDArray values = np.array(a, copy: false); + using NDArray max = np.amax(values); + return (double)max; } } diff --git a/src/OptunaSharp.Core/Trial.cs b/src/OptunaSharp.Core/Trial.cs index ecdd8af..8d09e75 100644 --- a/src/OptunaSharp.Core/Trial.cs +++ b/src/OptunaSharp.Core/Trial.cs @@ -361,6 +361,40 @@ public override void SetUserAttr(string key, object? value) } } + /// <summary> + /// Set several user attributes to the trial at once (Rustuna's <c>set_user_attrs</c>; plan 13, item S8), with one + /// storage call: the stored and cached result is what <see cref="SetUserAttr(string, object?)" /> once per entry + /// leaves. + /// </summary> + /// <param name="attrs">The attributes, set in enumeration order. The values should be JSON serializable.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="OptunaSharp.UpdateFinishedTrialError">The storage record is already finished; nothing is set.</exception> + /// <exception cref="NumSharp.KeyError">The trial was removed from storage; nothing is set.</exception> + /// <exception cref="System.Exception">A configured storage fails; its exception propagates.</exception> + /// <remarks> + /// The storage writes the batch in one step (<see cref="Storages.BaseStorage.SetTrialUserAttrs" />), and the trial's + /// own copy is updated only after the storage accepted it, so a refused batch leaves both unchanged. Under the + /// trial's monitor, like <see cref="SetUserAttr(string, object?)" />, so a concurrent read of this trial's + /// attributes sees the batch whole or not at all. + /// </remarks> + public override void SetUserAttrs(IReadOnlyDictionary<string, object?> attrs) + { + ArgumentNullException.ThrowIfNull(attrs); + if (attrs.Count == 0) + return; + using (MonitorGate.Scope(_syncRoot)) + { + Storage.SetTrialUserAttrs(TrialId, attrs); + foreach (var (key, value) in attrs) + _cachedFrozenTrial.UserAttrsDict[key] = value; + MirrorIntoThreadCache(t => + { + foreach (var (key, value) in attrs) + t.UserAttrsDict[key] = value; + }); + } + } + // Trial.set_system_attr (deprecated 3.1.0) was removed in Optuna 5.0.0 (#6834). Optuna-internal // writers call Storage.SetTrialSystemAttr(TrialId, key, value) directly; users keep SetUserAttr. diff --git a/src/OptunaSharp.Core/Version.cs b/src/OptunaSharp.Core/Version.cs index f055009..688f49e 100644 --- a/src/OptunaSharp.Core/Version.cs +++ b/src/OptunaSharp.Core/Version.cs @@ -42,8 +42,16 @@ public static class OptunaSharpVersion /// </remarks> public static readonly string Version = ReadLoadedVersion(); - /// <summary>The Optuna release this port tracks as its behavioral source of truth.</summary> - public const string OptunaCompatibilityTarget = "5.0"; + /// <summary> + /// The Optuna release this port tracks as its behavioral source of truth, written as Optuna's own + /// <c>optuna.__version__</c> (<c>refs/optuna</c> is pinned at v5.0.0). + /// </summary> + /// <remarks> + /// The SQLite and EF Core storages print it where Optuna prints <c>version.__version__</c>: "The runtime optuna + /// version 5.0.0 is no longer compatible with the table schema ...". It read <c>"5.0"</c> until 2026-11-12, which + /// made that message differ from Optuna's (QA-75 of the 2026-11-10 parity QA run). + /// </remarks> + public const string OptunaCompatibilityTarget = "5.0.0"; /// <summary> /// Resolves <see cref="Version" /> from the metadata of the assembly that defines this type, diff --git a/src/OptunaSharp.Core/Visualization/HypervolumeHistory.cs b/src/OptunaSharp.Core/Visualization/HypervolumeHistory.cs index 6f73b62..ca8afa3 100644 --- a/src/OptunaSharp.Core/Visualization/HypervolumeHistory.cs +++ b/src/OptunaSharp.Core/Visualization/HypervolumeHistory.cs @@ -168,7 +168,10 @@ private static bool AnyLess(double[] a, double[] b) return false; } - /// <summary>NumPy <c>np.prod(ref - values)</c> — a sequential product (M ≤ 8, so no pairwise).</summary> + /// <summary> + /// NumPy <c>np.prod(ref - values)</c>: a sequential <c>multiply.reduce</c>, which NumSharp 0.81.0's float + /// <c>np.prod</c> also follows (pinned by <c>SequentialProductTests</c>); a loop because it runs once per trial. + /// </summary> /// <param name="reference">The hypervolume reference vector in minimization coordinates.</param> /// <param name="values">The ordered values to aggregate or format.</param> /// <returns>The product of distances between the objective vector and reference point.</returns> diff --git a/src/OptunaSharp.Core/Visualization/IntermediateValues.cs b/src/OptunaSharp.Core/Visualization/IntermediateValues.cs index af0cfae..356351f 100644 --- a/src/OptunaSharp.Core/Visualization/IntermediateValues.cs +++ b/src/OptunaSharp.Core/Visualization/IntermediateValues.cs @@ -45,10 +45,10 @@ static bool SatisfiesConstraints(FrozenTrial trial) => trial.Constraints.Values.All(x => x <= 0.0); var trialInfos = trials - .Where(trial => trial.IntermediateValues.Count > 0) + .Where(trial => trial.IntermediateValuesForRead.Count > 0) .Select(trial => new TrialInfo( trial.Number, - trial.IntermediateValues + trial.IntermediateValuesForRead .OrderBy(kv => kv.Key) .Select(kv => (kv.Key, kv.Value)) .ToList(), diff --git a/src/OptunaSharp.Core/Visualization/VisualizationUtils.cs b/src/OptunaSharp.Core/Visualization/VisualizationUtils.cs index d91d60a..0afbf78 100644 --- a/src/OptunaSharp.Core/Visualization/VisualizationUtils.cs +++ b/src/OptunaSharp.Core/Visualization/VisualizationUtils.cs @@ -173,7 +173,8 @@ internal static string MakeHovertext(FrozenTrial trial) { { "number", trial.Number }, { "values", trial.Values }, - { "params", trial.ParamsDict }, + // Read-only: a compact finished record (plan 13, item S12) serializes its view as the same JSON object. + { "params", trial.Params }, }; if (userAttrs.Count > 0) dict["user_attrs"] = userAttrs; diff --git a/src/OptunaSharp.Integration.LightGbm/Pruning/LightGBMPruningCallback.cs b/src/OptunaSharp.Integration.LightGbm/Pruning/LightGBMPruningCallback.cs index e8ce5d5..3a2a2a0 100644 --- a/src/OptunaSharp.Integration.LightGbm/Pruning/LightGBMPruningCallback.cs +++ b/src/OptunaSharp.Integration.LightGbm/Pruning/LightGBMPruningCallback.cs @@ -1,5 +1,6 @@ using System; using System.Collections.Generic; +using OptunaSharp.Internal; namespace OptunaSharp.Integration.LightGbm; @@ -159,9 +160,14 @@ public void Call( /// <returns>The formatted list of validation metric records.</returns> private static string FormatEvaluationResultList(IReadOnlyList<LightGbmEvaluationResult> list) { + // Python's str(list of tuples): every element in repr, so scores read 100.0 and 1e-05 whatever the current + // culture (C#'s default formatting gave 100, 1E-05 and, under de-DE, 0,5), and a name holding a single quote is + // double-quoted as Python's repr switches quotes (QA-76). A cross-validation result prints the four fields this + // record carries; Python's has a fifth, the standard deviation, which LightGbmEvaluationResult does not hold. var parts = new List<string>(list.Count); foreach (var r in list) - parts.Add($"('{r.ValidName}', '{r.Metric}', {r.Score}, {(r.IsHigherBetter ? "True" : "False")})"); + parts.Add($"({PythonRepr.Repr(r.ValidName)}, {PythonRepr.Repr(r.Metric)}, {PythonRepr.Repr(r.Score)}, " + + $"{PythonRepr.Repr(r.IsHigherBetter)})"); return "[" + string.Join(", ", parts) + "]"; } } diff --git a/src/OptunaSharp.Integration.LightGbm/Tuner/Alias.cs b/src/OptunaSharp.Integration.LightGbm/Tuner/Alias.cs index d59b200..040ff94 100644 --- a/src/OptunaSharp.Integration.LightGbm/Tuner/Alias.cs +++ b/src/OptunaSharp.Integration.LightGbm/Tuner/Alias.cs @@ -72,10 +72,12 @@ internal static void HandleAliasParameters(OrderedDict<string, object?> lgbmPara } } + // optuna-integration's f-string: the dict in repr, the chosen value in str (`1.0`, a bare `x`), never the + // current culture (QA-76). if (duplicatedAlias.Count > 1) OptunaWarnings.Warn( $"{paramName} in param detected multiple identical aliases " + - $"{FormatDict(duplicatedAlias)}, but we use {paramName}={lgbmParams[paramName]}.", + $"{FormatDict(duplicatedAlias)}, but we use {paramName}={PythonRepr.Str(lgbmParams[paramName])}.", WarningCategory.UserWarning); } } @@ -110,12 +112,36 @@ internal static void HandleAliasMetrics(OrderedDict<string, object?> lgbmParams) throw new ValueError( "The `metric` parameter is expected to be a string or an iterable object, but got " + - $"{metric?.GetType().Name ?? "None"}."); + $"{PythonTypeRepr(metric)}."); } - /// <summary>Formats ordered LightGBM parameters for validation diagnostics.</summary> + /// <summary> + /// Python's <c>str(dict)</c> of ordered LightGBM parameters for validation diagnostics: keys and values in repr + /// (<c>{'sub_row': 0.5, 'subsample': 1.0}</c>), independent of the current culture. + /// </summary> /// <param name="d">The ordered parameter mapping formatted for diagnostics.</param> /// <returns>The Python-style representation of the parameter mapping.</returns> private static string FormatDict(OrderedDict<string, object?> d) - => "{" + string.Join(", ", d.Select(kv => $"'{kv.Key}': {kv.Value}")) + "}"; + => "{" + string.Join(", ", d.Select(kv => $"{PythonRepr.Repr(kv.Key)}: {PythonRepr.Repr(kv.Value)}")) + "}"; + + /// <summary> + /// Python's <c>str(type(value))</c> for the values a LightGBM parameter can hold (<c><class 'int'></c>, + /// <c><class 'float'></c>, <c><class 'NoneType'></c>), as optuna-integration's metric error prints it. + /// </summary> + /// <param name="value">The offending parameter value.</param> + /// <returns>The Python type's string form; other CLR types fall back to their own name.</returns> + private static string PythonTypeRepr(object? value) + { + string name = value switch + { + null => "NoneType", + bool => "bool", + sbyte or byte or short or ushort or int or uint or long or ulong or System.Numerics.BigInteger => "int", + float or double => "float", + string => "str", + IDictionary => "dict", + _ => value.GetType().Name, + }; + return $"<class '{name}'>"; + } } diff --git a/src/OptunaSharp.Interop.BoTorch/BoTorchSampler.cs b/src/OptunaSharp.Interop.BoTorch/BoTorchSampler.cs index 78df4eb..615d574 100644 --- a/src/OptunaSharp.Interop.BoTorch/BoTorchSampler.cs +++ b/src/OptunaSharp.Interop.BoTorch/BoTorchSampler.cs @@ -186,7 +186,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S for (int i = 0; i < nCompleted; i++) { FrozenTrial t = completedTrials[i]; - double[] row = trans.Transform(t.ParamsDict).ToArray<double>(); + double[] row = trans.Transform(t.Params).ToArray<double>(); for (int d = 0; d < nBounds; d++) completedParams[i, d] = row[d]; @@ -239,7 +239,7 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S var rows = new List<double[]>(); foreach (FrozenTrial t in runningTrials) if (searchSpace.Keys.All(k => t.Params.ContainsKey(k))) - rows.Add(trans.Transform(t.ParamsDict).ToArray<double>()); + rows.Add(trans.Transform(t.Params).ToArray<double>()); if (rows.Count > 0) { runningParams = new double[rows.Count, nBounds]; diff --git a/src/OptunaSharp.Interop.Pymoo/PymooSampler.cs b/src/OptunaSharp.Interop.Pymoo/PymooSampler.cs index 84bd394..5ee022e 100644 --- a/src/OptunaSharp.Interop.Pymoo/PymooSampler.cs +++ b/src/OptunaSharp.Interop.Pymoo/PymooSampler.cs @@ -329,7 +329,7 @@ internal void Reinitialize(IReadOnlyList<FrozenTrial> complete) // so they slot straight into the (pop_size, n) initial-population matrix — no element loop. NDArray gen0 = np.zeros(new Shape(_popsize, _nBounds)); for (int k = 0; k < _popsize; k++) - gen0[k] = _trans.Transform(complete[k].ParamsDict); + gen0[k] = _trans.Transform(complete[k].Params); _algo.Dispose(); using PyObject sampling = PymooInterop.ToNumpy(gen0); diff --git a/src/OptunaSharp.Interop.pythonnet/OptunaHubPruner.cs b/src/OptunaSharp.Interop.pythonnet/OptunaHubPruner.cs index d88a362..383df43 100644 --- a/src/OptunaSharp.Interop.pythonnet/OptunaHubPruner.cs +++ b/src/OptunaSharp.Interop.pythonnet/OptunaHubPruner.cs @@ -1,7 +1,9 @@ using System; +using System.Collections.Generic; using Python.Runtime; using OptunaSharp; using OptunaSharp.Pruners; +using OptunaSharp.Storages; namespace OptunaSharp.Interop.PythonNet; @@ -10,17 +12,25 @@ namespace OptunaSharp.Interop.PythonNet; /// OptunaSharp <see cref="BasePruner" />, so an OptunaSharp study's <c>report</c> / /// <c>should_prune</c> loop can be driven by any pruner on https://hub.optuna.org/. /// -/// <para>Like the sampler bridge, each <see cref="Prune" /> rebuilds a Python <b>shadow study</b> -/// mirroring the OptunaSharp study's finished trials (with their intermediate values) and opens a -/// running trial carrying the current trial's reported intermediate values, then delegates -/// <c>prune(study, trial)</c> to the real Python pruner. Optuna pruning is single-objective; this -/// targets single-worker <c>Study.Optimize</c> (<c>nJobs=1</c>).</para> +/// <para>Like the sampler bridge, the pruner keeps one persistent Python <b>shadow study</b> per OptunaSharp study +/// (<see cref="OptunaHubShadow" />), mirrored trial for trial before every decision: states, values, parameters, +/// user and system attributes and every intermediate value, the current trial's included. <see cref="Prune" /> +/// calls <c>prune(study, trial)</c> with the trial object native <c>Trial.should_prune</c> passes (the +/// latest-trial copy), and the attributes the pruner writes reach the OptunaSharp trial too: successive halving +/// and Hyperband record each rung a trial completes (<c>completed_rung_N</c>) and compare it with the other +/// trials' records, which a shadow rebuilt per call used to lose, so they never pruned (QA-73). Optuna pruning is +/// single-objective; calls are serialized on the Python thread.</para> /// </summary> public sealed class OptunaHubPruner : BasePruner, IDisposable { private readonly string _name; private PyObject? _pruner; + // The shadow of each study this pruner decides for, by (storage, study id). Guarded by _gate; every use runs on the + // Python thread under the GIL. + private readonly object _gate = new(); + private readonly Dictionary<StudyKey, OptunaHubShadow> _shadows = new(); + /// <summary>Takes ownership of the Python algorithm instance and records its diagnostic name.</summary> /// <param name="name">The package and class name displayed in diagnostics.</param> /// <param name="pruner">The Python pruner handle owned by the wrapper, or borrowed by a low-level invocation.</param> @@ -33,6 +43,8 @@ internal OptunaHubPruner(string name, PyObject pruner) /// <inheritdoc /> public override string ToString() => _name; + /// <summary>The Python pruner, borrowed.</summary> + /// <exception cref="ObjectDisposedException">The wrapper has been disposed.</exception> private PyObject Pruner => _pruner ?? throw new ObjectDisposedException(nameof(OptunaHubPruner)); /// <inheritdoc /> @@ -41,59 +53,48 @@ internal OptunaHubPruner(string name, PyObject pruner) /// <exception cref="OptunaSharp.Interop.PythonNet.PythonInteropException">The interpreter or a required Python module cannot be initialized.</exception> public override bool Prune(Study study, FrozenTrial trial) => PythonRuntime.Run(() => { - using PyObject pystudy = BuildStudy(study, trial.Number); - using PyObject frozen = OpenRunningTrial(pystudy, trial); - using PyObject result = Python.optuna.pruners.BasePruner.prune(Pruner, pystudy, frozen); - // IsTrue() (Python truthiness) not As<bool>(): a pruner may return a numpy bool_ from its - // comparison, which As<bool>() rejects with "cannot convert object to target type". - return result.IsTrue(); - }); - - // ---- shadow study (finished trials + their intermediate values) ------------------------------ - - /// <summary>Builds an in-memory Python study containing earlier finished trials for sampler or pruner replay.</summary> - /// <param name="study">The study whose trial history is mirrored, or its borrowed Python shadow-study handle.</param> - /// <param name="currentNumber">The current trial number; only earlier finished trials are included in the shadow study.</param> - /// <returns>A new owned Python reference; dispose it while holding the GIL. Input handles remain owned by their callers.</returns> - private static PyObject BuildStudy(Study study, int currentNumber) - { - OptunaHubRuntime.EnsureQuiet(); - // Optuna pruning is single-objective — mirror the shadow study on the first direction. - StudyDirection dir = study.Directions.Count > 0 ? study.Directions[0] : StudyDirection.Minimize; - PyObject pystudy = Python.optuna.create_study(new[] { dir }); - - foreach (var ft in study.GetTrials(deepcopy: false, states: null)) + lock (_gate) { - if (ft.Number >= currentNumber || !ft.State.IsFinished()) - continue; - using var pyTrial = Python.optuna.trial.create_trial( - ft.State, ft.Values, ft.Params, ft.Distributions, ft.IntermediateValues); - Python.optuna.Study.add_trial(pystudy, pyTrial); - } - return pystudy; - } + var key = new StudyKey(study.Storage, study.StudyId); + if (!_shadows.TryGetValue(key, out OptunaHubShadow? shadow)) + { + shadow = OptunaHubShadow.Create(study); + _shadows[key] = shadow; + } + shadow.Sync(study); + OptunaHubShadow.Mirror mirror = shadow.MirrorOf(trial); - // Open a running trial and replay this trial's reported intermediate values onto it — that is what - // the pruner reads (trial.intermediate_values / last_step) to decide. - /// <summary>Adds a running trial to the Python shadow study and returns its frozen snapshot.</summary> - /// <param name="pystudy">The borrowed Python shadow study that receives a new running trial.</param> - /// <param name="trial">The trial being mirrored, sampled, or checked for optimizer compatibility.</param> - /// <returns>A new owned Python reference; dispose it while holding the GIL. Input handles remain owned by their callers.</returns> - private static PyObject OpenRunningTrial(PyObject pystudy, FrozenTrial trial) - { - using PyObject running = Python.optuna.Study.ask(pystudy); - foreach (var (step, value) in trial.IntermediateValues) - Python.optuna.Trial.report(running, value, step); - int number = Python.optuna.Trial.number_t(running); - using PyObject trials = Python.optuna.Study.get_trials(pystudy, deepcopy: false); - return trials[new PyInt(number)]; - } + // Trial.should_prune: `self.study.pruner.prune(self.study, self._get_latest_trial())`. + using PyObject latest = shadow.LatestTrial(mirror); + return shadow.Call(study, trial, mirror, () => + { + using PyObject result = Python.optuna.pruners.BasePruner.prune(Pruner, shadow.Study, latest); + // IsTrue() (Python truthiness) not As<bool>(): a pruner may return a numpy bool_ from its + // comparison, which As<bool>() rejects with "cannot convert object to target type". + return result.IsTrue(); + }); + } + }); - /// <summary>Releases owned Python references while holding the GIL.</summary> + /// <summary>Releases owned Python references (the pruner and every shadow study) while holding the GIL.</summary> public void Dispose() { var pruner = _pruner; _pruner = null; - PythonRuntime.Run(() => pruner?.Dispose()); + PythonRuntime.Run(() => + { + lock (_gate) + { + foreach (OptunaHubShadow shadow in _shadows.Values) + shadow.Dispose(); + _shadows.Clear(); + } + pruner?.Dispose(); + }); } + + /// <summary>A study's identity across <see cref="Study" /> objects: its storage instance and id.</summary> + /// <param name="Storage">The storage instance, compared by reference.</param> + /// <param name="StudyId">The study's id in that storage.</param> + private readonly record struct StudyKey(BaseStorage Storage, int StudyId); } diff --git a/src/OptunaSharp.Interop.pythonnet/OptunaHubSampler.cs b/src/OptunaSharp.Interop.pythonnet/OptunaHubSampler.cs index 53bbade..99564db 100644 --- a/src/OptunaSharp.Interop.pythonnet/OptunaHubSampler.cs +++ b/src/OptunaSharp.Interop.pythonnet/OptunaHubSampler.cs @@ -5,6 +5,7 @@ using OptunaSharp.Collections; using OptunaSharp.Distributions; using OptunaSharp.Samplers; +using OptunaSharp.Storages; namespace OptunaSharp.Interop.PythonNet; @@ -14,29 +15,33 @@ namespace OptunaSharp.Interop.PythonNet; /// <see cref="BaseSampler" />, so an OptunaSharp <see cref="Study" /> can be driven by any of the /// ~85 samplers on https://hub.optuna.org/ — without porting them. /// -/// <para><b>How it works (the shadow study).</b> A Python sampler reads a real -/// <c>optuna.Study</c> + <c>FrozenTrial</c>. On each ask, this bridge rebuilds an in-memory Python -/// study mirroring the OptunaSharp study's finished trials (via <c>optuna.trial.create_trial</c> + -/// <c>study.add_trial</c>), opens a running trial on it, and delegates -/// <c>infer_relative_search_space</c> / <c>sample_relative</c> / <c>sample_independent</c> to the -/// Python sampler against that mirror. The suggestions it returns are the real Optuna sampler's -/// output, marshaled back to CLR values.</para> +/// <para><b>How it works (the shadow study).</b> A Python sampler reads a real <c>optuna.Study</c> and +/// <c>FrozenTrial</c>s. For each OptunaSharp study it meets, this bridge keeps one in-memory Python study in +/// lockstep with it (<see cref="OptunaHubShadow" />): every trial with its state, values, parameters, user and +/// system attributes and intermediate values, and the study's attributes. It forwards all five sampler hooks with +/// the trial objects native Optuna passes: <c>before_trial</c> and <c>infer_relative_search_space</c> / +/// <c>sample_relative</c> with the trial's cached record, <c>sample_independent</c> with the latest-trial copy, +/// and <c>after_trial</c> with the stored record, before the trial is finished. The attributes the Python sampler +/// writes (a generation counter, a swarm, constraints) are written to the OptunaSharp trial or study as well, so +/// the C# storage holds what a native run stores. The suggestions are the Python sampler's own output, marshaled +/// back to CLR values.</para> /// -/// <para><b>Scope of the first cut.</b> Designed for single-worker <c>Study.Optimize</c> -/// (<c>nJobs=1</c>): the mirror is rebuilt per trial from finished trials, so trial numbers align. -/// Parallel trials (concurrent RUNNING trials) are not mirrored. Reproducibility follows the Python -/// sampler's own RNG (seed it via the constructor kwargs).</para> +/// <para><b>Limits.</b> The Python sampler's internal state lives in its Python object, not in OptunaSharp's +/// storage, so a restarted process does not resume it. Attribute values with no JSON shape (NumPy arrays, +/// arbitrary objects) stay in the shadow only. A study filtered for <c>HyperbandPruner</c>'s brackets is mirrored +/// whole. Calls are serialized on the Python thread; trials of parallel workers are mirrored with the state the +/// storage holds when a call starts, as a native sampler reads them. Reproducibility follows the Python sampler's +/// own RNG (seed it through the constructor kwargs).</para> /// </summary> public sealed class OptunaHubSampler : BaseSampler, IDisposable { private readonly string _name; private PyObject? _sampler; - // Per-trial shadow cache (guarded by _gate). Rebuilt when the C# trial number changes. + // The shadow of each study this sampler drives, by (storage, study id). Guarded by _gate; every use runs on the + // Python thread under the GIL. private readonly object _gate = new(); - private int _cachedNumber = -1; - private PyObject? _cachedStudy; - private PyObject? _cachedFrozen; + private readonly Dictionary<StudyKey, OptunaHubShadow> _shadows = new(); /// <summary>Takes ownership of the Python algorithm instance and records its diagnostic name.</summary> /// <param name="name">The package and class name displayed in diagnostics.</param> @@ -50,8 +55,37 @@ internal OptunaHubSampler(string name, PyObject sampler) /// <inheritdoc /> public override string ToString() => _name; + /// <summary>The Python sampler, borrowed.</summary> + /// <exception cref="ObjectDisposedException">The wrapper has been disposed.</exception> private PyObject Sampler => _sampler ?? throw new ObjectDisposedException(nameof(OptunaHubSampler)); + /// <inheritdoc /> + /// <remarks> + /// Optuna's <c>Study.ask</c> and <c>Trial.__init__</c>: the study's per-thread trial cache is cleared, the trial's + /// cached record is taken, then <c>before_trial</c> runs with it. + /// </remarks> + /// <exception cref="System.ObjectDisposedException">The algorithm wrapper has already been disposed.</exception> + /// <exception cref="global::Python.Runtime.PythonException">The Python algorithm or shadow-study operation fails.</exception> + /// <exception cref="OptunaSharp.Interop.PythonNet.PythonInteropException">The interpreter or a required Python module cannot be initialized.</exception> + public override void BeforeTrial(Study study, FrozenTrial trial) + => PythonRuntime.Run(() => + { + lock (_gate) + { + OptunaHubShadow shadow = SyncedShadow(study); + OptunaHubShadow.Mirror mirror = shadow.MirrorOf(trial); + shadow.BeginTrial(); + PyObject cached = shadow.CachedTrial(mirror, refresh: true); + if (!Sampler.HasAttr("before_trial")) + return; + shadow.Call(study, trial, mirror, () => + { + Python.optuna.samplers.BaseSampler.before_trial(Sampler, shadow.Study, cached); + return 0; + }); + } + }); + /// <inheritdoc /> /// <exception cref="System.ObjectDisposedException">The algorithm wrapper has already been disposed.</exception> /// <exception cref="global::Python.Runtime.PythonException">The Python algorithm or shadow-study operation fails.</exception> @@ -59,12 +93,21 @@ internal OptunaHubSampler(string name, PyObject sampler) public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(Study study, FrozenTrial trial) => PythonRuntime.Run(() => { - var (pystudy, pyfrozen) = EnsureShadow(study, trial); - if (!Sampler.HasAttr("infer_relative_search_space")) - return new OrderedDict<string, BaseDistribution>(); + lock (_gate) + { + OptunaHubShadow shadow = SyncedShadow(study); + OptunaHubShadow.Mirror mirror = shadow.MirrorOf(trial); + PyObject cached = shadow.CachedTrial(mirror); + if (!Sampler.HasAttr("infer_relative_search_space")) + return new OrderedDict<string, BaseDistribution>(); - using PyObject result = Python.optuna.samplers.BaseSampler.infer_relative_search_space(Sampler, pystudy, pyfrozen); - return ToClrDistributionDict(result); + return shadow.Call(study, trial, mirror, () => + { + using PyObject result = + Python.optuna.samplers.BaseSampler.infer_relative_search_space(Sampler, shadow.Study, cached); + return ToClrDistributionDict(result); + }); + } }); /// <inheritdoc /> @@ -75,16 +118,32 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S Study study, FrozenTrial trial, OrderedDict<string, BaseDistribution> searchSpace) => PythonRuntime.Run(() => { - var (pystudy, pyfrozen) = EnsureShadow(study, trial); - using var pySearchSpace = new PyDict(); - foreach (var (name, dist) in searchSpace) - pySearchSpace[name] = PyConvert.ToPy(dist); + lock (_gate) + { + OptunaHubShadow shadow = SyncedShadow(study); + OptunaHubShadow.Mirror mirror = shadow.MirrorOf(trial); + PyObject cached = shadow.CachedTrial(mirror); + using var pySearchSpace = new PyDict(); + foreach (var (name, dist) in searchSpace) + { + using PyObject pyDist = PyConvert.ToPy(dist); + pySearchSpace[name] = pyDist; + } - using PyObject result = Python.optuna.samplers.BaseSampler.sample_relative(Sampler, pystudy, pyfrozen, pySearchSpace); - return ToClrValueDict(result); + return shadow.Call(study, trial, mirror, () => + { + using PyObject result = + Python.optuna.samplers.BaseSampler.sample_relative(Sampler, shadow.Study, cached, pySearchSpace); + return ToClrValueDict(result); + }); + } }); /// <inheritdoc /> + /// <remarks> + /// Optuna's <c>Trial._suggest</c> passes <c>_get_latest_trial()</c>: the cached record's shallow copy whose system + /// attributes are read from the storage. + /// </remarks> /// <exception cref="System.ObjectDisposedException">The algorithm wrapper has already been disposed.</exception> /// <exception cref="global::Python.Runtime.PythonException">The Python algorithm or shadow-study operation fails.</exception> /// <exception cref="OptunaSharp.Interop.PythonNet.PythonInteropException">The interpreter or a required Python module cannot be initialized.</exception> @@ -92,11 +151,56 @@ public override OrderedDict<string, BaseDistribution> InferRelativeSearchSpace(S Study study, FrozenTrial trial, string paramName, BaseDistribution paramDistribution) => PythonRuntime.Run(() => { - var (pystudy, pyfrozen) = EnsureShadow(study, trial); - using var name = paramName.ToPython(); - using var dist = PyConvert.ToPy(paramDistribution); - using PyObject result = Python.optuna.samplers.BaseSampler.sample_independent(Sampler, pystudy, pyfrozen, name, dist); - return PyConvert.ToClr(result); + lock (_gate) + { + OptunaHubShadow shadow = SyncedShadow(study); + OptunaHubShadow.Mirror mirror = shadow.MirrorOf(trial); + using PyObject latest = shadow.LatestTrial(mirror); + using var name = paramName.ToPython(); + using PyObject dist = PyConvert.ToPy(paramDistribution); + + return shadow.Call(study, trial, mirror, () => + { + using PyObject result = + Python.optuna.samplers.BaseSampler.sample_independent(Sampler, shadow.Study, latest, name, dist); + return PyConvert.ToClr(result); + }); + } + }); + + /// <inheritdoc /> + /// <remarks> + /// Optuna's <c>_tell_with_warning</c>: <c>after_trial</c> receives the stored record, and the trial's state and + /// values are written in a <c>finally</c>, so the shadow trial finishes even when the Python sampler raises. + /// </remarks> + /// <exception cref="System.ObjectDisposedException">The algorithm wrapper has already been disposed.</exception> + /// <exception cref="global::Python.Runtime.PythonException">The Python algorithm or shadow-study operation fails.</exception> + /// <exception cref="OptunaSharp.Interop.PythonNet.PythonInteropException">The interpreter or a required Python module cannot be initialized.</exception> + public override void AfterTrial(Study study, FrozenTrial trial, TrialState state, IReadOnlyList<double>? values) + => PythonRuntime.Run(() => + { + lock (_gate) + { + OptunaHubShadow shadow = SyncedShadow(study); + OptunaHubShadow.Mirror mirror = shadow.MirrorOf(trial); + try + { + if (!Sampler.HasAttr("after_trial")) + return; + using PyObject stored = shadow.StoredTrial(mirror); + using PyObject pyState = Python.optuna.trial.TrialState(state); + using PyObject pyValues = OptunaHubShadow.ToPyValues(values); + shadow.Call(study, trial, mirror, () => + { + Python.optuna.samplers.BaseSampler.after_trial(Sampler, shadow.Study, stored, pyState, pyValues); + return 0; + }); + } + finally + { + shadow.Finish(mirror, state, values); + } + } }); /// <inheritdoc /> @@ -113,61 +217,24 @@ public override void ReseedRng() // ---- shadow study --------------------------------------------------------------------------- - /// <summary>Ensure the Python shadow study + running frozen trial mirror the C# state for this trial. Under the GIL.</summary> - /// <param name="study">The study whose trial history is mirrored, or its borrowed Python shadow-study handle.</param> - /// <param name="trial">The trial being mirrored, sampled, or checked for optimizer compatibility.</param> - /// <returns>Borrowed cached study and frozen-trial handles; the cache retains ownership and callers must not dispose them.</returns> - private (PyObject study, PyObject frozen) EnsureShadow(Study study, FrozenTrial trial) + /// <summary> + /// The shadow of <paramref name="study" />, created on first use and synchronized with it now. Under the GIL and + /// <see cref="_gate" />. + /// </summary> + /// <param name="study">The OptunaSharp study being sampled.</param> + /// <returns>The synchronized shadow, owned by this sampler.</returns> + /// <exception cref="global::Python.Runtime.PythonException">Creating or synchronizing the shadow fails.</exception> + /// <exception cref="OptunaHubInteropException">The study's trial numbers are not contiguous.</exception> + private OptunaHubShadow SyncedShadow(Study study) { - lock (_gate) + var key = new StudyKey(study.Storage, study.StudyId); + if (!_shadows.TryGetValue(key, out OptunaHubShadow? shadow)) { - if (_cachedNumber == trial.Number && _cachedStudy is not null && _cachedFrozen is not null) - return (_cachedStudy, _cachedFrozen); - - DisposeShadowNoLock(); - - var pystudy = BuildStudy(study, trial.Number); - var pyfrozen = OpenRunningTrial(pystudy, trial.Number); - - _cachedStudy = pystudy; - _cachedFrozen = pyfrozen; - _cachedNumber = trial.Number; - return (pystudy, pyfrozen); + shadow = OptunaHubShadow.Create(study); + _shadows[key] = shadow; } - } - - /// <summary>Builds an in-memory Python study containing earlier finished trials for sampler or pruner replay.</summary> - /// <param name="study">The study whose trial history is mirrored, or its borrowed Python shadow-study handle.</param> - /// <param name="currentNumber">The current trial number; only earlier finished trials are included in the shadow study.</param> - /// <returns>A new owned Python reference; dispose it while holding the GIL. Input handles remain owned by their callers.</returns> - private static PyObject BuildStudy(Study study, int currentNumber) - { - OptunaHubRuntime.EnsureQuiet(); // re-assert right before create_study (Optuna re-configures logging lazily) - PyObject pystudy = Python.optuna.create_study(study.Directions); - - foreach (var ft in study.GetTrials(deepcopy: false, states: null)) - { - if (ft.Number >= currentNumber || !ft.State.IsFinished()) - continue; - using var pyTrial = Python.optuna.trial.create_trial(ft.State, ft.Values, ft.Params, ft.Distributions); - Python.optuna.Study.add_trial(pystudy, pyTrial); - } - - return pystudy; - } - - /// <summary>Adds a running trial to the Python shadow study and returns its frozen snapshot.</summary> - /// <param name="pystudy">The borrowed Python shadow study that receives a new running trial.</param> - /// <param name="number">The managed trial number associated with the shadow; the returned Python ask number controls indexing.</param> - /// <returns>A new owned Python reference; dispose it while holding the GIL. Input handles remain owned by their callers.</returns> - private static PyObject OpenRunningTrial(PyObject pystudy, int number) - { - // ask() adds a RUNNING trial (no params sampled without fixed distributions); fetch its frozen form. - using PyObject running = Python.optuna.Study.ask(pystudy); - int askedNumber = Python.optuna.Trial.number_t(running); - using PyObject trials = Python.optuna.Study.get_trials(pystudy, deepcopy: false); - // Index by the asked number so it lines up even if numbering diverged. - return trials[new PyInt(askedNumber)]; + shadow.Sync(study); + return shadow; } // ---- result conversion ---------------------------------------------------------------------- @@ -208,17 +275,7 @@ private static OrderedDict<string, BaseDistribution> ToClrDistributionDict(PyObj return result; } - /// <summary>Releases the cached Python study and frozen-trial references while the caller holds the GIL and cache lock.</summary> - private void DisposeShadowNoLock() - { - _cachedFrozen?.Dispose(); - _cachedStudy?.Dispose(); - _cachedFrozen = null; - _cachedStudy = null; - _cachedNumber = -1; - } - - /// <summary>Releases owned Python references while holding the GIL.</summary> + /// <summary>Releases owned Python references (the sampler and every shadow study) while holding the GIL.</summary> public void Dispose() { var sampler = _sampler; @@ -226,8 +283,17 @@ public void Dispose() PythonRuntime.Run(() => { lock (_gate) - DisposeShadowNoLock(); + { + foreach (OptunaHubShadow shadow in _shadows.Values) + shadow.Dispose(); + _shadows.Clear(); + } sampler?.Dispose(); }); } + + /// <summary>A study's identity across <see cref="Study" /> objects: its storage instance and id.</summary> + /// <param name="Storage">The storage instance, compared by reference.</param> + /// <param name="StudyId">The study's id in that storage.</param> + private readonly record struct StudyKey(BaseStorage Storage, int StudyId); } diff --git a/src/OptunaSharp.Interop.pythonnet/OptunaHubShadow.cs b/src/OptunaSharp.Interop.pythonnet/OptunaHubShadow.cs new file mode 100644 index 0000000..1255c90 --- /dev/null +++ b/src/OptunaSharp.Interop.pythonnet/OptunaHubShadow.cs @@ -0,0 +1,634 @@ +using System; +using System.Collections; +using System.Collections.Generic; +using Python.Runtime; +using OptunaSharp; +using OptunaSharp.Collections; +using OptunaSharp.Distributions; +using OptunaSharp.Storages; + +namespace OptunaSharp.Interop.PythonNet; + +/// <summary> +/// The persistent Python <b>shadow study</b> the OptunaHub bridges (<see cref="OptunaHubSampler" />, +/// <see cref="OptunaHubPruner" />) hand to the Python sampler or pruner: an in-memory <c>optuna.Study</c> kept in +/// lockstep with one OptunaSharp study, trial for trial, so the Python object reads and writes what it would in a +/// native Optuna run. +/// </summary> +/// <remarks> +/// <para> +/// <b>Mirroring in.</b> Before every call into Python, <see cref="Sync" /> brings every OptunaSharp trial, in +/// number order, into the shadow: a trial it has not seen is created with its state, values, parameters, +/// distributions, user and system attributes and intermediate values; a mirrored trial that is not finished +/// receives the parameters, reports and attributes written since, then its new state. The study's user and +/// system attributes follow. Finished mirrors are skipped, as finished trials no longer change on either side. +/// The bridges used to rebuild a study per trial from <c>create_trial(state, values, params, distributions)</c>, +/// which lost every system attribute a hub object wrote and never forwarded <c>before_trial</c> / +/// <c>after_trial</c>, so PSO never built its swarm, MO-CMA failed with <c>KeyError: 'mocma:g'</c> and successive +/// halving never pruned (QA-72, QA-73). +/// </para> +/// <para> +/// <b>The trial objects Python receives</b> are the ones native Optuna passes. Each running trial keeps the +/// record its storage held when the trial was first seen (<see cref="CachedTrial" />, Optuna's +/// <c>Trial._cached_frozen_trial</c>), and the mirrored parameters, reports and user attributes update that +/// record in place, as <c>Trial._suggest</c>, <c>report</c> and <c>set_user_attr</c> do; system attributes go +/// to the storage only. <see cref="LatestTrial" /> is <c>Trial._get_latest_trial()</c> (a shallow copy whose +/// system attributes are read from the storage), what <c>sample_independent</c> and <c>prune</c> receive; +/// <see cref="StoredTrial" /> is <c>storage.get_trial</c>, what <c>after_trial</c> receives. +/// </para> +/// <para> +/// <b>Mirroring out.</b> <see cref="Call{T}" /> snapshots the study's and the trial's user and system attributes +/// around the Python call and writes every key the call set to the OptunaSharp storage, so the C# study holds +/// what a native run would store (PSO's swarm, MO-CMA's <c>mocma:g</c>, successive halving's +/// <c>completed_rung_N</c>). A value with no JSON shape (a NumPy array, an arbitrary object) stays in the shadow +/// only; native Optuna could not store it outside memory either. +/// </para> +/// <para> +/// Not thread-safe: the owning bridge serializes calls under its gate, on the Python thread +/// (<see cref="PythonRuntime" />), holding the GIL. One shadow serves one OptunaSharp study; the bridges keep one +/// per study they meet. Trials of other workers are mirrored with the state they have when a call syncs, as a +/// native sampler sees them in the storage. +/// </para> +/// </remarks> +internal sealed class OptunaHubShadow : IDisposable +{ + /// <summary>The shadow <c>optuna.Study</c> (owned).</summary> + private readonly PyObject _study; + + /// <summary>One mirror per OptunaSharp trial, indexed by trial number (the shadow numbers its trials alike).</summary> + private readonly List<Mirror> _mirrors = new(); + + /// <summary>The study user attributes as last synchronized, in OptunaSharp values, by key.</summary> + private readonly Dictionary<string, object?> _studyUserAttrs = new(); + + /// <summary>The study system attributes as last synchronized, in OptunaSharp values, by key.</summary> + private readonly Dictionary<string, object?> _studySystemAttrs = new(); + + /// <summary>Wraps a new shadow study.</summary> + /// <param name="study">The owned <c>optuna.Study</c>.</param> + private OptunaHubShadow(PyObject study) => _study = study; + + /// <summary>The shadow <c>optuna.Study</c>, borrowed: pass it to the Python object, never dispose it.</summary> + internal PyObject Study => _study; + + /// <summary> + /// Creates the shadow of <paramref name="study" />: an empty in-memory study with its directions and its name (a + /// hub object may derive state from the name: <c>HyperbandPruner</c>'s brackets do). + /// </summary> + /// <param name="study">The OptunaSharp study to shadow.</param> + /// <returns>The shadow, empty until the first <see cref="Sync" />.</returns> + /// <exception cref="PythonException">Optuna's <c>create_study</c> fails.</exception> + internal static OptunaHubShadow Create(Study study) + { + OptunaHubRuntime.EnsureQuiet(); // re-assert right before create_study (Optuna re-configures logging lazily) + return new OptunaHubShadow(Python.optuna.create_study(study.Directions, study.StudyName)); + } + + /// <summary> + /// Mirrors every trial of <paramref name="study" /> and its attributes into the shadow (see the class remarks). + /// Reads the storage afresh, so values the bridge wrote back are recognized and not echoed. + /// </summary> + /// <param name="study">The OptunaSharp study this shadow mirrors.</param> + /// <exception cref="OptunaHubInteropException">The study's trial numbers are not contiguous from 0.</exception> + /// <exception cref="PythonException">A shadow storage write fails.</exception> + internal void Sync(Study study) + { + BaseStorage storage = study.Storage; + foreach (FrozenTrial trial in storage.GetAllTrials(study.StudyId, deepcopy: false)) + { + if (trial.Number < _mirrors.Count) + { + Mirror mirror = _mirrors[trial.Number]; + if (!mirror.State.IsFinished()) + Update(mirror, trial); + continue; + } + if (trial.Number != _mirrors.Count) + throw new OptunaHubInteropException( + $"The OptunaHub shadow study expected trial number {_mirrors.Count} next but read {trial.Number}."); + _mirrors.Add(Add(trial)); + } + + foreach (var (key, value) in storage.GetStudyUserAttrs(study.StudyId)) + { + if (Unchanged(_studyUserAttrs, key, value) || !TryToPy(value, out PyObject? py)) + continue; + using (py) + using (var k = key.ToPython()) + Python.optunasharp_shadow.set_study_user_attr(_study, k, py!); + _studyUserAttrs[key] = value; + } + foreach (var (key, value) in storage.GetStudySystemAttrs(study.StudyId)) + { + if (Unchanged(_studySystemAttrs, key, value) || !TryToPy(value, out PyObject? py)) + continue; + using (py) + using (var k = key.ToPython()) + Python.optunasharp_shadow.set_study_system_attr(_study, k, py!); + _studySystemAttrs[key] = value; + } + } + + /// <summary> + /// Starts a trial the way <c>Study.ask</c> does: clears the shadow study's per-thread trial cache, so the samplers + /// that read the history through <c>study._get_trials(use_cache=True)</c> see it as of this trial. Without it the + /// shadow kept its first read for good: restart CMA-ES diverged from trial 1, TPE from its first model-based + /// trial, the NSGA-II variants from their first generation boundary. + /// </summary> + /// <exception cref="PythonException">The shadow study has no per-thread cache (an incompatible Optuna).</exception> + internal void BeginTrial() => Python.optunasharp_shadow.begin_trial(_study); + + /// <summary>The mirror of <paramref name="trial" />, which <see cref="Sync" /> has created.</summary> + /// <param name="trial">An OptunaSharp trial of the shadowed study.</param> + /// <returns>Its mirror.</returns> + /// <exception cref="OptunaHubInteropException">The trial is not mirrored (no <see cref="Sync" /> since it was created).</exception> + internal Mirror MirrorOf(FrozenTrial trial) + { + if (trial.Number < 0 || trial.Number >= _mirrors.Count) + throw new OptunaHubInteropException( + $"Trial {trial.Number} is not mirrored in the OptunaHub shadow study ({_mirrors.Count} trials)."); + return _mirrors[trial.Number]; + } + + /// <summary> + /// The running trial's cached record, Optuna's <c>Trial._cached_frozen_trial</c>: the storage record when the + /// trial is first seen (or, with <paramref name="refresh" />, now), updated in place as the trial writes. + /// </summary> + /// <param name="mirror">A running trial's mirror.</param> + /// <param name="refresh"> + /// Take the record anew, as <c>Trial.__init__</c> does: <c>before_trial</c> is the start of the trial. + /// </param> + /// <returns>The record, borrowed from the mirror: never dispose it.</returns> + /// <exception cref="PythonException">The shadow storage read fails.</exception> + internal PyObject CachedTrial(Mirror mirror, bool refresh = false) + { + if (refresh) + { + mirror.Cached?.Dispose(); + mirror.Cached = null; + } + return mirror.Cached ??= Python.optunasharp_shadow.get_trial(_study, mirror.TrialId); + } + + /// <summary> + /// Optuna's <c>Trial._get_latest_trial()</c>: a shallow copy of the cached record whose system attributes are read + /// from the storage on first use, what <c>sample_independent</c> and <c>prune</c> receive. + /// </summary> + /// <param name="mirror">A running trial's mirror.</param> + /// <returns>A new owned reference; dispose it under the GIL.</returns> + /// <exception cref="PythonException">The copy fails.</exception> + internal PyObject LatestTrial(Mirror mirror) + => Python.optunasharp_shadow.latest(_study, CachedTrial(mirror)); + + /// <summary>The trial's current storage record, <c>storage.get_trial(trial_id)</c>, what <c>after_trial</c> receives.</summary> + /// <param name="mirror">The trial's mirror.</param> + /// <returns>A new owned reference; dispose it under the GIL.</returns> + /// <exception cref="PythonException">The shadow storage read fails.</exception> + internal PyObject StoredTrial(Mirror mirror) => Python.optunasharp_shadow.get_trial(_study, mirror.TrialId); + + /// <summary> + /// Runs a call into the Python sampler or pruner and writes every study or trial attribute it set to the + /// OptunaSharp storage (see the class remarks). + /// </summary> + /// <param name="study">The OptunaSharp study the attributes are written to.</param> + /// <param name="trial">The OptunaSharp trial being sampled, told or pruned.</param> + /// <param name="mirror">Its mirror.</param> + /// <param name="call">The Python call; it runs under the GIL.</param> + /// <typeparam name="T">The call's result.</typeparam> + /// <returns>The call's result.</returns> + /// <exception cref="PythonException">The Python call, or reading the attributes back, fails.</exception> + internal T Call<T>(Study study, FrozenTrial trial, Mirror mirror, Func<T> call) + { + using PyObject before = Python.optunasharp_shadow.attrs(_study, mirror.TrialId); + T result = call(); + using PyObject after = Python.optunasharp_shadow.attrs(_study, mirror.TrialId); + + // The four dictionaries, in attrs()'s order: study user, study system, trial user, trial system. + BaseStorage storage = study.Storage; + WriteBack(before, after, 0, (key, value) => storage.SetStudyUserAttr(study.StudyId, key, value), _studyUserAttrs); + WriteBack(before, after, 1, (key, value) => storage.SetStudySystemAttr(study.StudyId, key, value), _studySystemAttrs); + WriteBack(before, after, 2, (key, value) => storage.SetTrialUserAttr(trial.TrialId, key, value), mirror.UserAttrs); + WriteBack(before, after, 3, (key, value) => storage.SetTrialSystemAttr(trial.TrialId, key, value), mirror.SystemAttrs); + return result; + } + + /// <summary> + /// Finishes the trial's mirror with the state and values OptunaSharp stores, as <c>_tell_with_warning</c> does after + /// <c>after_trial</c>, and drops its cached record. + /// </summary> + /// <param name="mirror">The trial's mirror.</param> + /// <param name="state">The finished state.</param> + /// <param name="values">The objective values, or null.</param> + /// <exception cref="PythonException">The shadow storage write fails.</exception> + internal void Finish(Mirror mirror, TrialState state, IReadOnlyList<double>? values) + { + if (mirror.State.IsFinished()) + return; + using (PyObject pyState = Python.optuna.trial.TrialState(state)) + using (PyObject pyValues = ToPyValues(values)) + Python.optunasharp_shadow.set_state(_study, mirror.TrialId, pyState, pyValues); + mirror.State = state; + mirror.Cached?.Dispose(); + mirror.Cached = null; + } + + /// <summary>Releases the shadow study and every cached record; call under the GIL.</summary> + public void Dispose() + { + foreach (Mirror mirror in _mirrors) + { + mirror.Cached?.Dispose(); + mirror.Cached = null; + } + _study.Dispose(); + } + + // ---- mirroring --------------------------------------------------------------------------------------------------- + + /// <summary>Creates the next shadow trial from an OptunaSharp trial, whatever its state.</summary> + /// <param name="trial">The OptunaSharp trial; its number is the shadow's next.</param> + /// <returns>The new mirror.</returns> + /// <exception cref="PythonException">Optuna rejects the trial or the storage write fails.</exception> + private Mirror Add(FrozenTrial trial) + { + var mirror = new Mirror { State = trial.State }; + using var pyParams = new PyDict(); + using var pyDistributions = new PyDict(); + foreach (var (name, value) in trial.Params) + { + using (PyObject v = PyConvert.ToPy(value)) + pyParams[name] = v; + using (PyObject d = PyConvert.ToPy(trial.Distributions[name])) + pyDistributions[name] = d; + mirror.Params.Add(name); + } + using PyDict pyUserAttrs = ToPyAttrs(trial.UserAttrs, mirror.UserAttrs); + using PyDict pySystemAttrs = ToPyAttrs(trial.SystemAttrs, mirror.SystemAttrs); + using var pyIntermediate = new PyDict(); + foreach (var (step, value) in trial.IntermediateValues) + { + using var s = new PyInt(step); + using var v = value.ToPython(); + pyIntermediate.SetItem(s, v); + mirror.Steps.Add(step); + } + using PyObject pyState = Python.optuna.trial.TrialState(trial.State); + using PyObject pyValues = ToPyValues(trial.Values); + mirror.TrialId = Python.optunasharp_shadow.add_trial( + _study, pyState, pyValues, pyParams, pyDistributions, pyUserAttrs, pySystemAttrs, pyIntermediate); + return mirror; + } + + /// <summary> + /// Brings an unfinished mirror up to its OptunaSharp trial: new parameters, reports and attributes in the order + /// a native trial writes them, then the trial's new state. + /// </summary> + /// <param name="mirror">The unfinished mirror.</param> + /// <param name="trial">The trial as the OptunaSharp storage holds it now.</param> + /// <exception cref="PythonException">A shadow storage write fails.</exception> + private void Update(Mirror mirror, FrozenTrial trial) + { + // WAITING -> RUNNING first: a popped enqueued trial is written to only once it runs. + if (mirror.State == TrialState.Waiting && trial.State != TrialState.Waiting && !trial.State.IsFinished()) + { + using (PyObject running = Python.optuna.trial.TrialState(TrialState.Running)) + using (PyObject none = ToPyValues(null)) + Python.optunasharp_shadow.set_state(_study, mirror.TrialId, running, none); + mirror.State = TrialState.Running; + } + + foreach (var (name, value) in trial.Params) + { + if (!mirror.Params.Add(name)) + continue; + using PyObject v = PyConvert.ToPy(value); + using PyObject d = PyConvert.ToPy(trial.Distributions[name]); + using var n = name.ToPython(); + Python.optunasharp_shadow.set_param(_study, mirror.Cached, mirror.TrialId, n, v, d); + } + foreach (var (step, value) in trial.IntermediateValues) + { + if (!mirror.Steps.Add(step)) + continue; + using var s = new PyInt(step); + using var v = value.ToPython(); + Python.optunasharp_shadow.report(_study, mirror.Cached, mirror.TrialId, s, v); + } + foreach (var (key, value) in trial.UserAttrs) + { + if (Unchanged(mirror.UserAttrs, key, value) || !TryToPy(value, out PyObject? py)) + continue; + using (py) + using (var k = key.ToPython()) + Python.optunasharp_shadow.set_user_attr(_study, mirror.Cached, mirror.TrialId, k, py!); + mirror.UserAttrs[key] = value; + } + foreach (var (key, value) in trial.SystemAttrs) + { + if (Unchanged(mirror.SystemAttrs, key, value) || !TryToPy(value, out PyObject? py)) + continue; + using (py) + using (var k = key.ToPython()) + Python.optunasharp_shadow.set_system_attr(_study, mirror.TrialId, k, py!); + mirror.SystemAttrs[key] = value; + } + + // A trial finished without the bridge's after_trial (failed as stale, told through another sampler) finishes here. + if (trial.State.IsFinished()) + Finish(mirror, trial.State, trial.Values); + } + + /// <summary> + /// Writes back the keys one of <c>attrs()</c>'s dictionaries gained or replaced during a Python call, and records + /// them as synchronized so the next <see cref="Sync" /> does not echo them. + /// </summary> + /// <param name="before">The <c>attrs()</c> tuple before the call.</param> + /// <param name="after">The <c>attrs()</c> tuple after the call.</param> + /// <param name="index">Which dictionary: 0 study user, 1 study system, 2 trial user, 3 trial system.</param> + /// <param name="write">Writes one key to the OptunaSharp storage.</param> + /// <param name="synced">The values last synchronized for this dictionary.</param> + /// <exception cref="PythonException">Reading the dictionaries fails.</exception> + private static void WriteBack( + PyObject before, PyObject after, int index, Action<string, object?> write, Dictionary<string, object?> synced) + { + using PyObject b = before[index]; + using PyObject a = after[index]; + using PyObject changed = Python.optunasharp_shadow.changed(b, a); + using PyObject items = changed.InvokeMethod("items"); + using PyIter iter = PyIter.GetIter(items); + while (iter.MoveNext()) + { + using PyObject kv = iter.Current; + using PyObject k = kv[0]; + using PyObject v = kv[1]; + // A value without a JSON shape stays in the shadow, where the Python object keeps reading it. + if (!TryToClr(v, out object? value)) + continue; + string key = k.As<string>(); + write(key, value); + synced[key] = value; + } + } + + // ---- values ------------------------------------------------------------------------------------------------------ + + /// <summary>Objective values as a Python list, or <c>None</c>, as <c>after_trial</c> and the storages take them.</summary> + /// <param name="values">The values, or null.</param> + /// <returns>A new owned reference; dispose it under the GIL.</returns> + internal static PyObject ToPyValues(IReadOnlyList<double>? values) + { + if (values is null) + return ((object?)null).ToPython(); + var list = new PyList(); + foreach (double v in values) + { + using var item = v.ToPython(); + list.Append(item); + } + return list; + } + + /// <summary>Converts an attribute dictionary for <c>create_trial</c>, recording the converted keys as synchronized.</summary> + /// <param name="attrs">The OptunaSharp attributes.</param> + /// <param name="synced">Receives every converted key's value.</param> + /// <returns>A new owned Python dict; keys whose values have no JSON shape are left out.</returns> + private static PyDict ToPyAttrs(IReadOnlyDictionary<string, object?> attrs, Dictionary<string, object?> synced) + { + var dict = new PyDict(); + foreach (var (key, value) in attrs) + { + if (!TryToPy(value, out PyObject? py)) + continue; + using (py) + dict[key] = py!; + synced[key] = value; + } + return dict; + } + + /// <summary>Whether <paramref name="key" />'s value is the one last synchronized (see <see cref="SameValue" />).</summary> + /// <param name="synced">The values last synchronized.</param> + /// <param name="key">The attribute key.</param> + /// <param name="value">The value OptunaSharp holds now.</param> + /// <returns><c>true</c> to skip the key.</returns> + private static bool Unchanged(Dictionary<string, object?> synced, string key, object? value) + => synced.TryGetValue(key, out object? last) && SameValue(last, value); + + /// <summary> + /// A JSON-shaped OptunaSharp value as a Python object: <c>None</c>, bool, int, float, str, list (any non-string + /// sequence) or dict (string keys), recursively. + /// </summary> + /// <param name="value">The value.</param> + /// <param name="result">A new owned reference when convertible.</param> + /// <returns>Whether the value has a JSON shape.</returns> + internal static bool TryToPy(object? value, out PyObject? result) + { + switch (value) + { + case null or bool or string or double or float or sbyte or byte or short or ushort or int or uint or long + or CategoricalChoice: + result = PyConvert.ToPy(value); + return true; + case IEnumerable<KeyValuePair<string, object?>> map: + { + var dict = new PyDict(); + foreach (var (k, v) in map) + { + if (!TryToPy(v, out PyObject? item)) + { + dict.Dispose(); + result = null; + return false; + } + using (item) + dict[k] = item!; + } + result = dict; + return true; + } + case IEnumerable sequence: + { + var list = new PyList(); + foreach (object? element in sequence) + { + if (!TryToPy(element, out PyObject? item)) + { + list.Dispose(); + result = null; + return false; + } + using (item) + list.Append(item!); + } + result = list; + return true; + } + default: + result = null; + return false; + } + } + + /// <summary> + /// A JSON-shaped Python value as an OptunaSharp one: <c>None</c>, bool, int (within <see cref="long" />), float + /// and str (NumPy scalars included), list or tuple as <see cref="List{T}" />, dict with str keys as + /// <see cref="OrderedDict{TKey, TValue}" />, recursively. + /// </summary> + /// <param name="value">The Python value, borrowed.</param> + /// <param name="result">The converted value.</param> + /// <returns>Whether the value has a JSON shape.</returns> + internal static bool TryToClr(PyObject value, out object? result) + { + result = null; + if (value.IsNone()) + return true; + string kind; + using (PyType type = value.GetPythonType()) + using (PyObject name = type.GetAttr("__name__")) + kind = name.As<string>() ?? ""; + switch (kind) + { + case "dict": + { + var dict = new OrderedDict<string, object?>(); + using PyObject items = value.InvokeMethod("items"); + using PyIter iter = PyIter.GetIter(items); + while (iter.MoveNext()) + { + using PyObject kv = iter.Current; + using PyObject k = kv[0]; + using PyObject v = kv[1]; + if (!PyString.IsStringType(k) || !TryToClr(v, out object? item)) + return false; + dict[k.As<string>()] = item; + } + result = dict; + return true; + } + case "list" or "tuple": + { + var list = new List<object?>(); + using PyIter iter = PyIter.GetIter(value); + while (iter.MoveNext()) + { + using PyObject element = iter.Current; + if (!TryToClr(element, out object? item)) + return false; + list.Add(item); + } + result = list; + return true; + } + case "bool" or "bool_" or "int" or "int64" or "int32" or "int16" or "int8" or "uint64" or "uint32" or "uint16" + or "uint8" or "float" or "float64" or "float32" or "float16" or "str" or "str_": + try + { + result = PyConvert.ToClr(value); + return true; + } + catch (Exception) + { + return false; // an int beyond 64 bits has no OptunaSharp value + } + default: + return false; + } + } + + /// <summary> + /// Value equality across the shapes the storages hand back: numbers by value (an int and a float that are equal + /// match, as in Python; two NaNs match, being the same stored value), strings and bools exactly, sequences and + /// string-keyed dictionaries element by element, anything else by <see cref="object.Equals(object, object)" />. + /// </summary> + /// <param name="a">One value.</param> + /// <param name="b">The other.</param> + /// <returns>Whether a storage round trip could turn one into the other.</returns> + internal static bool SameValue(object? a, object? b) + { + if (ReferenceEquals(a, b)) + return true; + if (a is null || b is null) + return false; + if (a is CategoricalChoice ca) + return SameValue(ca.Value, b); + if (b is CategoricalChoice cb) + return SameValue(a, cb.Value); + if (a is string sa) + return b is string sb && string.Equals(sa, sb, StringComparison.Ordinal); + if (a is bool ba) + return b is bool bb && ba == bb; + if (IsNumber(a) && IsNumber(b)) + { + if (IsIntegral(a) && IsIntegral(b)) + return Convert.ToDecimal(a) == Convert.ToDecimal(b); + double da = Convert.ToDouble(a), db = Convert.ToDouble(b); + return da.Equals(db); // Equals: NaN matches NaN + } + if (a is IEnumerable<KeyValuePair<string, object?>> ma && b is IEnumerable<KeyValuePair<string, object?>> mb) + { + var left = new Dictionary<string, object?>(); + foreach (var (k, v) in ma) + left[k] = v; + int count = 0; + foreach (var (k, v) in mb) + { + if (!left.TryGetValue(k, out object? lv) || !SameValue(lv, v)) + return false; + count++; + } + return count == left.Count; + } + if (a is IEnumerable ea && b is IEnumerable eb && a is not string && b is not string) + { + IEnumerator ia = ea.GetEnumerator(), ib = eb.GetEnumerator(); + while (true) + { + bool hasA = ia.MoveNext(), hasB = ib.MoveNext(); + if (hasA != hasB) + return false; + if (!hasA) + return true; + if (!SameValue(ia.Current, ib.Current)) + return false; + } + } + return Equals(a, b); + } + + /// <summary>Whether a value is a CLR number (not a bool).</summary> + /// <param name="value">The value.</param> + /// <returns><c>true</c> for the integral and floating-point types.</returns> + private static bool IsNumber(object value) + => value is sbyte or byte or short or ushort or int or uint or long or ulong or float or double or decimal; + + /// <summary>Whether a value is a CLR integer.</summary> + /// <param name="value">The value.</param> + /// <returns><c>true</c> for the integral types.</returns> + private static bool IsIntegral(object value) + => value is sbyte or byte or short or ushort or int or uint or long or ulong; + + /// <summary>One OptunaSharp trial's shadow trial and what has been mirrored of it.</summary> + internal sealed class Mirror + { + /// <summary>The shadow storage's id of the trial (<c>trial._trial_id</c>).</summary> + internal int TrialId; + + /// <summary>The state last mirrored; a finished mirror never changes again.</summary> + internal TrialState State; + + /// <summary>The running trial's cached record (<see cref="CachedTrial" />), owned; null until first needed.</summary> + internal PyObject? Cached; + + /// <summary>The parameter names mirrored (a parameter is written once).</summary> + internal readonly HashSet<string> Params = new(); + + /// <summary>The intermediate steps mirrored (a step is reported once).</summary> + internal readonly HashSet<long> Steps = new(); + + /// <summary>The trial user attributes as last synchronized, in OptunaSharp values, by key.</summary> + internal readonly Dictionary<string, object?> UserAttrs = new(); + + /// <summary>The trial system attributes as last synchronized, in OptunaSharp values, by key.</summary> + internal readonly Dictionary<string, object?> SystemAttrs = new(); + } +} diff --git a/src/OptunaSharp.Interop.pythonnet/Pythonic.cs b/src/OptunaSharp.Interop.pythonnet/Pythonic.cs index 1797b33..e5119cc 100644 --- a/src/OptunaSharp.Interop.pythonnet/Pythonic.cs +++ b/src/OptunaSharp.Interop.pythonnet/Pythonic.cs @@ -31,14 +31,24 @@ internal static class Python /// <summary><c>import optuna</c> — the fixed optuna calls the bridge makes, reached as <c>Python.optuna.*</c>.</summary> internal static class optuna { - /// <summary><c>optuna.create_study(directions=[...])</c> — the in-memory shadow study.</summary> + /// <summary><c>optuna.create_study(directions=[...], study_name=...)</c> — the in-memory shadow study.</summary> /// <param name="directions">One direction per objective, in objective-index order.</param> + /// <param name="studyName"> + /// The study name, or null for Optuna's generated one. The shadow carries the OptunaSharp study's name: some + /// hub objects derive state from it (<c>HyperbandPruner</c> assigns brackets by + /// <c>crc32(f"{study.study_name}_{trial.number}")</c>). + /// </param> /// <returns>A new owned Python reference; dispose it while holding the GIL. Input handles remain owned by their callers.</returns> /// <exception cref="global::Python.Runtime.PythonException">The Python attribute lookup, constructor, or operation fails.</exception> - internal static PyObject create_study(IReadOnlyList<StudyDirection> directions) + internal static PyObject create_study(IReadOnlyList<StudyDirection> directions, string? studyName = null) { using var createStudy = OptunaHubRuntime.Optuna.GetAttr("create_study"); using var kwargs = new PyDict(); + if (studyName is not null) + { + using var name = studyName.ToPython(); + kwargs["study_name"] = name; + } var items = new PyObject[directions.Count]; for (int i = 0; i < items.Length; i++) items[i] = (directions[i] == StudyDirection.Maximize ? "maximize" : "minimize").ToPython(); @@ -318,6 +328,30 @@ internal static PyObject sample_independent(PyObject sampler, PyObject study, Py return sampleIndependent.Invoke(new[] { study, trial, name, dist }); } + /// <summary><c>sampler.before_trial(study, trial)</c>.</summary> + /// <param name="sampler">The Python sampler handle owned by the wrapper, or borrowed by a low-level invocation.</param> + /// <param name="study">The borrowed Python shadow-study handle; use it only while holding the GIL.</param> + /// <param name="trial">The borrowed trial record (the trial's cached record, as <c>Trial.__init__</c> passes it).</param> + /// <exception cref="global::Python.Runtime.PythonException">The Python attribute lookup, constructor, or operation fails.</exception> + internal static void before_trial(PyObject sampler, PyObject study, PyObject trial) + { + using var beforeTrial = sampler.GetAttr("before_trial"); + using var _ = beforeTrial.Invoke(study, trial); + } + + /// <summary><c>sampler.after_trial(study, trial, state, values)</c>.</summary> + /// <param name="sampler">The Python sampler handle owned by the wrapper, or borrowed by a low-level invocation.</param> + /// <param name="study">The borrowed Python shadow-study handle; use it only while holding the GIL.</param> + /// <param name="trial">The borrowed trial record (the stored record, as <c>_tell_with_warning</c> passes it).</param> + /// <param name="state">The borrowed <c>optuna.trial.TrialState</c> the trial finishes with.</param> + /// <param name="values">The borrowed objective-value list, or <c>None</c>.</param> + /// <exception cref="global::Python.Runtime.PythonException">The Python attribute lookup, constructor, or operation fails.</exception> + internal static void after_trial(PyObject sampler, PyObject study, PyObject trial, PyObject state, PyObject values) + { + using var afterTrial = sampler.GetAttr("after_trial"); + using var _ = afterTrial.Invoke(new[] { study, trial, state, values }); + } + /// <summary><c>sampler.reseed_rng()</c>.</summary> /// <param name="sampler">The Python sampler handle owned by the wrapper, or borrowed by a low-level invocation.</param> /// <exception cref="global::Python.Runtime.PythonException">The Python attribute lookup, constructor, or operation fails.</exception> @@ -351,6 +385,296 @@ internal static PyObject prune(PyObject pruner, PyObject study, PyObject trial) } } + /// <summary> + /// The OptunaHub bridges' shadow-study helpers (<see cref="OptunaHubShadow" />): a small Python module defined once + /// in the embedded interpreter, whose functions make the storage-level writes a native Optuna trial makes, reached + /// as <c>Python.optunasharp_shadow.*</c>. + /// </summary> + /// <remarks> + /// Python source rather than a chain of C-API calls, so each helper reads as the Optuna code it mirrors + /// (<c>Trial._suggest</c>, <c>Trial.report</c>, <c>Trial.set_user_attr</c>, <c>Trial._get_latest_trial</c>, + /// <c>_tell_with_warning</c>'s state write) and diffs against it. The module is built on first use and kept for + /// the process, like <see cref="PythonRuntime.Import" />'s cache. + /// </remarks> + internal static class optunasharp_shadow + { + /// <summary>The module's source.</summary> + private const string Source = """ + import copy + + import optuna + from optuna.trial._trial import _LazyTrialSystemAttrs + + + def add_trial(study, state, values, params, distributions, user_attrs, system_attrs, intermediate_values): + # One OptunaSharp trial, in any state, as the shadow's next trial; returns its trial id. + template = optuna.trial.create_trial( + state=state, values=values, params=params, distributions=distributions, user_attrs=user_attrs, + system_attrs=system_attrs, intermediate_values=intermediate_values) + return study._storage.create_new_trial(study._study_id, template_trial=template) + + + def begin_trial(study): + # Study.ask: "Sync storage once every trial." Samplers read the history through + # study._get_trials(use_cache=True), which keeps the first read until this reset. + study._thread_local.cached_all_trials = None + + + def get_trial(study, trial_id): + return study._storage.get_trial(trial_id) + + + def latest(study, cached): + # Trial._get_latest_trial + trial = copy.copy(cached) + trial.system_attrs = _LazyTrialSystemAttrs(cached._trial_id, study._storage) + return trial + + + def set_param(study, cached, trial_id, name, value, distribution): + # Trial._suggest, after the value is chosen + study._storage.set_trial_param(trial_id, name, distribution.to_internal_repr(value), distribution) + if cached is not None: + cached.distributions[name] = distribution + cached.params[name] = value + + + def report(study, cached, trial_id, step, value): + # Trial.report + study._storage.set_trial_intermediate_value(trial_id, step, value) + if cached is not None: + cached.intermediate_values[step] = value + + + def set_user_attr(study, cached, trial_id, key, value): + # Trial.set_user_attr + study._storage.set_trial_user_attr(trial_id, key, value) + if cached is not None: + cached.user_attrs[key] = value + + + def set_system_attr(study, trial_id, key, value): + study._storage.set_trial_system_attr(trial_id, key, value) + + + def set_study_user_attr(study, key, value): + study._storage.set_study_user_attr(study._study_id, key, value) + + + def set_study_system_attr(study, key, value): + study._storage.set_study_system_attr(study._study_id, key, value) + + + def set_state(study, trial_id, state, values): + study._storage.set_trial_state_values(trial_id, state, values) + + + def attrs(study, trial_id): + # Shallow copies of the four dictionaries a hub object may write to. + storage = study._storage + return ( + dict(storage.get_study_user_attrs(study._study_id)), + dict(storage.get_study_system_attrs(study._study_id)), + dict(storage.get_trial_user_attrs(trial_id)), + dict(storage.get_trial_system_attrs(trial_id)), + ) + + + def changed(before, after): + # By identity: a storage write stores the new value object, and identity works for values without a + # usable `==` (a NumPy array's is element-wise). + return {key: value for key, value in after.items() if key not in before or before[key] is not value} + """; + + /// <summary>The module, built from <see cref="Source" /> on first use; process-scoped, never disposed.</summary> + private static PyModule? _module; + + /// <summary>The module, building it on first use.</summary> + /// <exception cref="global::Python.Runtime.PythonException">The source fails to run (Optuna missing or changed).</exception> + private static PyModule Module => _module ??= PyModule.FromString("optunasharp_shadow", Source); + + /// <summary>Calls one of the module's functions and returns its result, owned by the caller.</summary> + /// <param name="function">The function's name.</param> + /// <param name="args">The borrowed arguments.</param> + /// <returns>A new owned reference; dispose it under the GIL.</returns> + /// <exception cref="global::Python.Runtime.PythonException">The function raises.</exception> + private static PyObject Call(string function, params PyObject[] args) + { + using PyObject fn = Module.GetAttr(function); + return fn.Invoke(args); + } + + /// <summary>Calls one of the module's functions for its effect only.</summary> + /// <param name="function">The function's name.</param> + /// <param name="args">The borrowed arguments.</param> + /// <exception cref="global::Python.Runtime.PythonException">The function raises.</exception> + private static void Do(string function, params PyObject[] args) + { + using PyObject _ = Call(function, args); + } + + /// <summary>A borrowed reference, or <c>None</c> for null, for an optional argument.</summary> + /// <param name="value">The borrowed reference, or null.</param> + /// <param name="none">Receives the owned <c>None</c> to dispose, when <paramref name="value" /> is null.</param> + /// <returns>The argument to pass.</returns> + private static PyObject OrNone(PyObject? value, out PyObject? none) + { + none = value is null ? ((object?)null).ToPython() : null; + return value ?? none!; + } + + /// <summary><c>add_trial(study, state, values, params, distributions, user_attrs, system_attrs, intermediate_values)</c>.</summary> + /// <param name="study">The borrowed shadow study.</param> + /// <param name="state">The borrowed <c>TrialState</c>.</param> + /// <param name="values">The borrowed value list, or <c>None</c>.</param> + /// <param name="parameters">The borrowed parameter dict (external values).</param> + /// <param name="distributions">The borrowed distribution dict.</param> + /// <param name="userAttrs">The borrowed user-attribute dict.</param> + /// <param name="systemAttrs">The borrowed system-attribute dict.</param> + /// <param name="intermediateValues">The borrowed step-to-value dict.</param> + /// <returns>The new trial's shadow trial id.</returns> + /// <exception cref="global::Python.Runtime.PythonException">Optuna rejects the trial (<c>create_trial</c>'s validation) or the write fails.</exception> + internal static int add_trial(PyObject study, PyObject state, PyObject values, PyObject parameters, + PyObject distributions, PyObject userAttrs, PyObject systemAttrs, PyObject intermediateValues) + { + using PyObject id = Call("add_trial", + study, state, values, parameters, distributions, userAttrs, systemAttrs, intermediateValues); + return id.As<int>(); + } + + /// <summary> + /// <c>begin_trial(study)</c>: clears the study's per-thread trial cache, as <c>Study.ask</c> does for every trial, + /// so a sampler reading <c>study._get_trials(use_cache=True)</c> (CMA-ES, TPE, the GA samplers, QMC, GP) sees + /// the history as of this trial rather than as of its first read. + /// </summary> + /// <param name="study">The borrowed shadow study.</param> + /// <exception cref="global::Python.Runtime.PythonException">The study has no per-thread cache (an incompatible Optuna).</exception> + internal static void begin_trial(PyObject study) => Do("begin_trial", study); + + /// <summary><c>get_trial(study, trial_id)</c>: the storage's record of the trial.</summary> + /// <param name="study">The borrowed shadow study.</param> + /// <param name="trialId">The shadow trial id.</param> + /// <returns>A new owned reference; dispose it under the GIL.</returns> + /// <exception cref="global::Python.Runtime.PythonException">The read fails.</exception> + internal static PyObject get_trial(PyObject study, int trialId) + { + using var id = new PyInt(trialId); + return Call("get_trial", study, id); + } + + /// <summary><c>latest(study, cached)</c>: <c>Trial._get_latest_trial()</c> of a trial's cached record.</summary> + /// <param name="study">The borrowed shadow study.</param> + /// <param name="cached">The borrowed cached record.</param> + /// <returns>A new owned reference; dispose it under the GIL.</returns> + /// <exception cref="global::Python.Runtime.PythonException">The copy fails.</exception> + internal static PyObject latest(PyObject study, PyObject cached) => Call("latest", study, cached); + + /// <summary><c>set_param(study, cached, trial_id, name, value, distribution)</c>.</summary> + /// <param name="study">The borrowed shadow study.</param> + /// <param name="cached">The borrowed cached record to update in place, or null.</param> + /// <param name="trialId">The shadow trial id.</param> + /// <param name="name">The borrowed parameter name.</param> + /// <param name="value">The borrowed external value.</param> + /// <param name="distribution">The borrowed distribution.</param> + /// <exception cref="global::Python.Runtime.PythonException">The write fails.</exception> + internal static void set_param(PyObject study, PyObject? cached, int trialId, PyObject name, PyObject value, + PyObject distribution) + { + using var id = new PyInt(trialId); + PyObject c = OrNone(cached, out PyObject? none); + using (none) + Do("set_param", study, c, id, name, value, distribution); + } + + /// <summary><c>report(study, cached, trial_id, step, value)</c>.</summary> + /// <param name="study">The borrowed shadow study.</param> + /// <param name="cached">The borrowed cached record to update in place, or null.</param> + /// <param name="trialId">The shadow trial id.</param> + /// <param name="step">The borrowed step.</param> + /// <param name="value">The borrowed value.</param> + /// <exception cref="global::Python.Runtime.PythonException">The write fails.</exception> + internal static void report(PyObject study, PyObject? cached, int trialId, PyObject step, PyObject value) + { + using var id = new PyInt(trialId); + PyObject c = OrNone(cached, out PyObject? none); + using (none) + Do("report", study, c, id, step, value); + } + + /// <summary><c>set_user_attr(study, cached, trial_id, key, value)</c>.</summary> + /// <param name="study">The borrowed shadow study.</param> + /// <param name="cached">The borrowed cached record to update in place, or null.</param> + /// <param name="trialId">The shadow trial id.</param> + /// <param name="key">The borrowed key.</param> + /// <param name="value">The borrowed value.</param> + /// <exception cref="global::Python.Runtime.PythonException">The write fails.</exception> + internal static void set_user_attr(PyObject study, PyObject? cached, int trialId, PyObject key, PyObject value) + { + using var id = new PyInt(trialId); + PyObject c = OrNone(cached, out PyObject? none); + using (none) + Do("set_user_attr", study, c, id, key, value); + } + + /// <summary><c>set_system_attr(study, trial_id, key, value)</c>.</summary> + /// <param name="study">The borrowed shadow study.</param> + /// <param name="trialId">The shadow trial id.</param> + /// <param name="key">The borrowed key.</param> + /// <param name="value">The borrowed value.</param> + /// <exception cref="global::Python.Runtime.PythonException">The write fails.</exception> + internal static void set_system_attr(PyObject study, int trialId, PyObject key, PyObject value) + { + using var id = new PyInt(trialId); + Do("set_system_attr", study, id, key, value); + } + + /// <summary><c>set_study_user_attr(study, key, value)</c>.</summary> + /// <param name="study">The borrowed shadow study.</param> + /// <param name="key">The borrowed key.</param> + /// <param name="value">The borrowed value.</param> + /// <exception cref="global::Python.Runtime.PythonException">The write fails.</exception> + internal static void set_study_user_attr(PyObject study, PyObject key, PyObject value) + => Do("set_study_user_attr", study, key, value); + + /// <summary><c>set_study_system_attr(study, key, value)</c>.</summary> + /// <param name="study">The borrowed shadow study.</param> + /// <param name="key">The borrowed key.</param> + /// <param name="value">The borrowed value.</param> + /// <exception cref="global::Python.Runtime.PythonException">The write fails.</exception> + internal static void set_study_system_attr(PyObject study, PyObject key, PyObject value) + => Do("set_study_system_attr", study, key, value); + + /// <summary><c>set_state(study, trial_id, state, values)</c>.</summary> + /// <param name="study">The borrowed shadow study.</param> + /// <param name="trialId">The shadow trial id.</param> + /// <param name="state">The borrowed <c>TrialState</c>.</param> + /// <param name="values">The borrowed value list, or <c>None</c>.</param> + /// <exception cref="global::Python.Runtime.PythonException">The write fails (a finished trial cannot change).</exception> + internal static void set_state(PyObject study, int trialId, PyObject state, PyObject values) + { + using var id = new PyInt(trialId); + Do("set_state", study, id, state, values); + } + + /// <summary><c>attrs(study, trial_id)</c>: copies of the study's and the trial's user and system attributes.</summary> + /// <param name="study">The borrowed shadow study.</param> + /// <param name="trialId">The shadow trial id.</param> + /// <returns>A new owned 4-tuple (study user, study system, trial user, trial system); dispose it under the GIL.</returns> + /// <exception cref="global::Python.Runtime.PythonException">The reads fail.</exception> + internal static PyObject attrs(PyObject study, int trialId) + { + using var id = new PyInt(trialId); + return Call("attrs", study, id); + } + + /// <summary><c>changed(before, after)</c>: the keys <paramref name="after" /> gained or replaced.</summary> + /// <param name="before">The borrowed dict before a call.</param> + /// <param name="after">The borrowed dict after it.</param> + /// <returns>A new owned dict; dispose it under the GIL.</returns> + /// <exception cref="global::Python.Runtime.PythonException">The comparison fails.</exception> + internal static PyObject changed(PyObject before, PyObject after) => Call("changed", before, after); + } + /// <summary><c>import optunahub</c> — the fixed optunahub calls, reached as <c>Python.optunahub.*</c>.</summary> internal static class optunahub { diff --git a/src/OptunaSharp.Interop.pythonnet/README.md b/src/OptunaSharp.Interop.pythonnet/README.md index 3b411f7..88b51f7 100644 --- a/src/OptunaSharp.Interop.pythonnet/README.md +++ b/src/OptunaSharp.Interop.pythonnet/README.md @@ -49,10 +49,13 @@ study.Optimize(t => { }, nTrials: 50); ``` -The real Python sampler decides each suggestion; the bridge keeps a Python **shadow study** in sync -with the OptunaSharp study's finished trials and delegates -`infer_relative_search_space` / `sample_relative` / `sample_independent` to it. Designed for -single-worker `Study.Optimize` (`nJobs = 1`). +The real Python sampler decides each suggestion. The bridge keeps a persistent Python **shadow study** +in lockstep with the OptunaSharp study: every trial with its state, values, parameters, attributes and +intermediate values. It forwards `before_trial`, `infer_relative_search_space`, `sample_relative`, +`sample_independent` and `after_trial` with the trial objects Optuna passes, and writes the attributes +the sampler sets back to the OptunaSharp trial. The pruner bridge does the same for `prune`. Registry +samplers and pruners give the same trials as when run natively +(`test/OptunaSharp.Tests.Interop/OptunaHubNativeParityTests.cs`). ## Loading diff --git a/src/OptunaSharp.Storage.EFCore/Storages/Rdb/MySqlUrl.cs b/src/OptunaSharp.Storage.EFCore/Storages/Rdb/MySqlUrl.cs index 3d0e902..125802f 100644 --- a/src/OptunaSharp.Storage.EFCore/Storages/Rdb/MySqlUrl.cs +++ b/src/OptunaSharp.Storage.EFCore/Storages/Rdb/MySqlUrl.cs @@ -219,7 +219,7 @@ internal static MySqlConnectionStringBuilder Build(PreparedStorageUrl prepared) /// attribute 'get'</c>), an unknown <c>charset</c> (<c>'NoneType' object has no attribute 'encoding'</c>) and /// <c>?conv=</c> (<c>'str' object has no attribute 'items'</c>). /// </exception> - /// <exception cref="FileNotFoundException">The <c>ssl_ca</c> or <c>ssl_cert</c> file is missing (<c>[Errno 2] No such file or directory</c>).</exception> + /// <exception cref="FileNotFoundError">The <c>ssl_ca</c> or <c>ssl_cert</c> file is missing (<c>[Errno 2] No such file or directory</c>).</exception> /// <exception cref="NotSupportedException">An argument MySqlConnector cannot express, refused once PyMySQL's own checks have passed.</exception> /// <remarks> /// The checks run in <c>Connection.__init__</c>'s order. A refusal of what MySqlConnector cannot express waits @@ -367,7 +367,7 @@ private static MySqlConnectionStringBuilder FromPyMySql(OrderedDict<string, obje /// <param name="b">The builder to configure.</param> /// <param name="ssl">PyMySQL's SSL dictionary.</param> /// <param name="refuse">Records a refusal to raise once PyMySQL's own checks have passed.</param> - /// <exception cref="FileNotFoundException"> + /// <exception cref="FileNotFoundError"> /// The CA file (<c>create_default_context(cafile=…)</c>), the certificate or its key /// (<c>load_cert_chain</c>) is missing: <c>[Errno 2] No such file or directory</c>. Python loads them here, /// before connecting; a file that exists but is not valid PEM fails in MySqlConnector at connect time instead @@ -419,11 +419,11 @@ private static void ApplyPyMySqlSsl(MySqlConnectionStringBuilder b, OrderedDict< /// <summary>The <c>FileNotFoundError</c> Python's <c>ssl</c> module raises for a certificate file that is not there.</summary> /// <param name="path">The path, relative to the working directory as in Python.</param> - /// <exception cref="FileNotFoundException">The file does not exist: <c>[Errno 2] No such file or directory</c>.</exception> + /// <exception cref="FileNotFoundError">The file does not exist: <c>[Errno 2] No such file or directory</c> (Python's class, NumSharp's since 0.81.0; the <c>ssl</c> module names no file, so neither does this one).</exception> private static void RequireFile(string path) { if (!File.Exists(path)) - throw new FileNotFoundException("[Errno 2] No such file or directory", path); + throw new FileNotFoundError(2, "No such file or directory"); } /// <summary> @@ -530,7 +530,7 @@ private static readonly (string Name, char Format)[] MySqlDbKeywords = /// argument (<c>'…' is an invalid keyword argument for connect()</c>). /// </exception> /// <exception cref="ValueError">A NUL in a text argument (<c>embedded null character</c>), or a port outside 0–65535.</exception> - /// <exception cref="OverflowException"> + /// <exception cref="OverflowError"> /// An integer argument outside the C <c>int</c> range. The message is the platform's, as in CPython: C <c>long</c> /// is 32-bit on Windows (<c>Python int too large to convert to C long</c>) and 64-bit elsewhere /// (<c>signed integer is greater than maximum</c> until the value leaves the 64-bit range). @@ -714,7 +714,7 @@ private static MySqlConnectionStringBuilder FromMySqlDb(OrderedDict<string, obje /// </summary> /// <param name="value">The argument.</param> /// <exception cref="TypeError">Not an integer: <c>'str' object cannot be interpreted as an integer</c>.</exception> - /// <exception cref="OverflowException">Outside the C <c>long</c> range (<c>Python int too large to convert to C long</c>), or outside the C <c>int</c> range (<c>signed integer is greater than maximum</c> / <c>less than minimum</c>).</exception> + /// <exception cref="OverflowError">Outside the C <c>long</c> range (<c>Python int too large to convert to C long</c>), or outside the C <c>int</c> range (<c>signed integer is greater than maximum</c> / <c>less than minimum</c>).</exception> private static void CheckCInt(object? value) { if (value is bool) @@ -724,11 +724,11 @@ private static void CheckCInt(object? value) BigInteger longMin = OperatingSystem.IsWindows() ? int.MinValue : long.MinValue; BigInteger longMax = OperatingSystem.IsWindows() ? int.MaxValue : long.MaxValue; if (number < longMin || number > longMax) - throw new OverflowException("Python int too large to convert to C long"); + throw new OverflowError("Python int too large to convert to C long"); if (number > int.MaxValue) - throw new OverflowException("signed integer is greater than maximum"); + throw new OverflowError("signed integer is greater than maximum"); if (number < int.MinValue) - throw new OverflowException("signed integer is less than minimum"); + throw new OverflowError("signed integer is less than minimum"); } // ------------------------------------------------------------------ mysql-connector, MariaDB Connector, cymysql diff --git a/src/OptunaSharp.Storage.EFCore/Storages/Rdb/RDBStorage.cs b/src/OptunaSharp.Storage.EFCore/Storages/Rdb/RDBStorage.cs index 8eb48f3..d8e2ff0 100644 --- a/src/OptunaSharp.Storage.EFCore/Storages/Rdb/RDBStorage.cs +++ b/src/OptunaSharp.Storage.EFCore/Storages/Rdb/RDBStorage.cs @@ -17,6 +17,7 @@ using OptunaSharp.Internal; using OptunaSharp.Logging; using OptunaSharp.Storages; +using OptunaSharp.Storages.Journal; namespace OptunaSharp.Storages.EFCore; @@ -407,17 +408,73 @@ private static void MapPostgresEnums(Npgsql.EntityFrameworkCore.PostgreSQL.Infra /// change tracker is cleared before each attempt so a retry starts clean. With the default /// (non-retrying) strategy this runs the body exactly once. /// </summary> - /// <param name="body">The operation executed in the current context or scope; its exceptions propagate to the caller.</param> + /// <param name="body">The operation executed in the current context or scope; its exceptions propagate to the caller, except database errors (below).</param> /// <returns>The callback's result after the transaction commits successfully.</returns> /// <typeparam name="T">The managed result returned by the transaction callback.</typeparam> + /// <exception cref="StorageInternalError"> + /// A database error other than an integrity violation (a value longer than its column, a missing table, a lost + /// connection once any retries are spent), as Optuna's <c>_create_scoped_session</c> raises it, wrapping the + /// provider's error. + /// </exception> + /// <remarks> + /// <para> + /// Port of <c>_create_scoped_session</c>'s error handling (QA-74): an integrity error (SQLSTATE class 23 on + /// PostgreSQL, PyMySQL's IntegrityError numbers on MySQL) propagates unchanged, as Optuna re-raises + /// <c>IntegrityError</c> for its callers (a duplicated study name becomes <see cref="DuplicatedStudyError" />); + /// every other database error becomes <see cref="StorageInternalError" /> with Optuna's message. EF Core's + /// <c>DbUpdateException</c> used to escape, so a <c>catch (StorageInternalError)</c> missed it: measured on + /// MySQL 8.0 and PostgreSQL 16 with 600-character study names, parameter names and attribute keys (the columns + /// hold 512) and a 70,000-character attribute value on MySQL. + /// </para> + /// <para> + /// The translation sits outside the execution strategy, so <c>EnableRetryOnFailure()</c> still sees the + /// provider's transient errors and retries them; only an error that ends the operation is translated. + /// </para> + /// </remarks> private T Mutate<T>(Func<OptunaRdbContext, T> body) { using var ctx = NewContext(); - return ctx.Database.CreateExecutionStrategy().Execute(() => + try { - ctx.ChangeTracker.Clear(); - return body(ctx); - }); + return ctx.Database.CreateExecutionStrategy().Execute(() => + { + ctx.ChangeTracker.Clear(); + return body(ctx); + }); + } + catch (Exception e) when (e is DbUpdateException or DbException && !IsIntegrityError(e)) + { + throw new StorageInternalError(CommitErrorMessage, e); + } + } + + /// <summary> + /// The message of the <see cref="StorageInternalError" /> Optuna's <c>_create_scoped_session</c> raises for any + /// database error other than an integrity error, verbatim, trailing space included. + /// </summary> + private const string CommitErrorMessage = + "An exception is raised during the commit. This typically happens due to invalid data in the commit, " + + "e.g. exceeding max length. "; + + /// <summary> + /// Whether a database error is what SQLAlchemy reports as <c>IntegrityError</c>, which Optuna's scoped session + /// re-raises instead of wrapping: SQLSTATE class 23 on PostgreSQL (psycopg2's mapping), and on MySQL exactly the + /// seven numbers PyMySQL maps to <c>IntegrityError</c> (1048 null in a NOT NULL column, 1062 duplicate entry, 1215 + /// to 1217 and 1451 / 1452 foreign keys); PyMySQL reports every other number, a check-constraint failure + /// included, as <c>OperationalError</c>, which Optuna wraps. + /// </summary> + /// <param name="e">The error, possibly wrapping the provider's exception.</param> + /// <returns><c>true</c> for an integrity violation.</returns> + private static bool IsIntegrityError(Exception e) + { + for (Exception? inner = e; inner is not null; inner = inner.InnerException) + { + if (inner is PostgresException pg) + return pg.SqlState.StartsWith("23", StringComparison.Ordinal); + if (inner is MySqlException my) + return my.Number is 1048 or 1062 or 1215 or 1216 or 1217 or 1451 or 1452; + } + return false; } /// <summary>Runs a database mutation with the configured execution strategy and transaction ownership.</summary> @@ -609,6 +666,61 @@ public override void SetStudyUserAttr(int studyId, string key, object? value) public override void SetStudySystemAttr(int studyId, string key, object? value) => SetStudyAttr(isUser: false, studyId, key, value); + /// <inheritdoc /> + /// <remarks>One transaction and one save for the whole batch (plan 13, item S8): all entries are stored or none are.</remarks> + public override void SetStudyUserAttrs(int studyId, IReadOnlyDictionary<string, object?> attrs) + => SetStudyAttrs(isUser: true, studyId, attrs); + + /// <inheritdoc /> + /// <remarks>One transaction and one save for the whole batch (plan 13, item S8): all entries are stored or none are.</remarks> + public override void SetStudySystemAttrs(int studyId, IReadOnlyDictionary<string, object?> attrs) + => SetStudyAttrs(isUser: false, studyId, attrs); + + /// <summary> + /// Upserts several JSON-serializable study attributes in one transaction after verifying once that the study + /// exists: the rows <see cref="SetStudyAttr" /> writes per entry, saved together. + /// </summary> + /// <param name="isUser">Whether to use user-attribute records instead of system-attribute records.</param> + /// <param name="studyId">The storage-wide study identifier, not its display name.</param> + /// <param name="attrs">The attributes, upserted in enumeration order.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="KeyError">The study does not exist; nothing is written.</exception> + /// <exception cref="Exception">A value is not JSON-serializable or the database refuses the batch; nothing is written.</exception> + private void SetStudyAttrs(bool isUser, int studyId, IReadOnlyDictionary<string, object?> attrs) + { + ArgumentNullException.ThrowIfNull(attrs); + if (attrs.Count == 0) + return; + Mutate(ctx => + { + // Disposed without Commit on any exception, which rolls the whole batch back. + using var tx = ctx.Database.BeginTransaction(); + EnsureStudyExists(ctx, studyId); + foreach (var (key, value) in attrs) + { + string json = PyJson.Dumps(value); + if (isUser) + { + var row = ctx.StudyUserAttributes.FirstOrDefault(a => a.StudyId == studyId && a.Key == key); + if (row is null) + ctx.StudyUserAttributes.Add(new StudyUserAttributeEntity { StudyId = studyId, Key = key, ValueJson = json }); + else + row.ValueJson = json; + } + else + { + var row = ctx.StudySystemAttributes.FirstOrDefault(a => a.StudyId == studyId && a.Key == key); + if (row is null) + ctx.StudySystemAttributes.Add(new StudySystemAttributeEntity { StudyId = studyId, Key = key, ValueJson = json }); + else + row.ValueJson = json; + } + } + ctx.SaveChanges(); + tx.Commit(); + }); + } + /// <summary>Upserts a JSON-serializable attribute after verifying that its study exists.</summary> /// <param name="isUser">Whether to use user-attribute records instead of system-attribute records.</param> /// <param name="studyId">The storage-wide study identifier, not its display name.</param> @@ -681,8 +793,8 @@ public override List<StudyDirection> GetStudyDirections(int studyId) using var ctx = NewContext(); EnsureStudyExists(ctx, studyId); var attrs = new OrderedDict<string, object?>(); - foreach (var row in ctx.StudyUserAttributes.AsNoTracking() - .Where(a => a.StudyId == studyId).OrderBy(a => a.StudyUserAttributeId)) + var rows = ctx.StudyUserAttributes.AsNoTracking().Where(a => a.StudyId == studyId); + foreach (var row in AttributesInKeyOrder ? rows.OrderBy(a => a.Key) : rows.OrderBy(a => a.StudyUserAttributeId)) attrs[row.Key!] = PyJson.Loads(row.ValueJson!); return attrs; } @@ -693,12 +805,27 @@ public override List<StudyDirection> GetStudyDirections(int studyId) using var ctx = NewContext(); EnsureStudyExists(ctx, studyId); var attrs = new OrderedDict<string, object?>(); - foreach (var row in ctx.StudySystemAttributes.AsNoTracking() - .Where(a => a.StudyId == studyId).OrderBy(a => a.StudySystemAttributeId)) + var rows = ctx.StudySystemAttributes.AsNoTracking().Where(a => a.StudyId == studyId); + foreach (var row in AttributesInKeyOrder ? rows.OrderBy(a => a.Key) : rows.OrderBy(a => a.StudySystemAttributeId)) attrs[row.Key!] = PyJson.Loads(row.ValueJson!); return attrs; } + /// <summary> + /// Whether a study's or a trial's attributes are read in key order (MySQL) rather than insertion order. + /// </summary> + /// <remarks> + /// Optuna's attribute queries have no <c>ORDER BY</c> (<c>where_study_id</c>, a trial's <c>selectinload</c> or lazy + /// load), so each backend returns rows in the order its plan finds them. InnoDB answers <c>WHERE study_id = ?</c> + /// and <c>WHERE trial_id IN (...)</c> through the unique <c>(study_id, key)</c> / <c>(trial_id, key)</c> indexes, + /// so on MySQL 8.0 <c>study.user_attrs</c>, <c>study.trials</c> and <c>get_all_artifact_meta</c> list keys in the + /// column collation's order, which an <c>ORDER BY key</c> reproduces; the port listed them in insertion order + /// (QA-71, measured). On PostgreSQL 16 Optuna's own order is unstable (sorted on a first read, insertion order + /// after <c>load_study</c>), so the port keeps insertion order there. <c>get_all_studies</c> scans the tables + /// without a <c>WHERE</c> and keeps insertion order on every backend (<see cref="LoadAllStudyAttrs" />). + /// </remarks> + private bool AttributesInKeyOrder => _provider == RdbProvider.MySql; + /// <inheritdoc /> public override List<FrozenStudy> GetAllStudies() { @@ -1103,6 +1230,63 @@ public override void SetTrialUserAttr(int trialId, string key, object? value) public override void SetTrialSystemAttr(int trialId, string key, object? value) => SetTrialAttr(isUser: false, trialId, key, value); + /// <inheritdoc /> + /// <remarks>One transaction and one save for the whole batch (plan 13, item S8): all entries are stored or none are.</remarks> + public override void SetTrialUserAttrs(int trialId, IReadOnlyDictionary<string, object?> attrs) + => SetTrialAttrs(isUser: true, trialId, attrs); + + /// <inheritdoc /> + /// <remarks>One transaction and one save for the whole batch (plan 13, item S8): all entries are stored or none are.</remarks> + public override void SetTrialSystemAttrs(int trialId, IReadOnlyDictionary<string, object?> attrs) + => SetTrialAttrs(isUser: false, trialId, attrs); + + /// <summary> + /// Upserts several JSON-serializable trial attributes in one transaction after checking once that the trial is + /// still mutable: the rows <see cref="SetTrialAttr" /> writes per entry, saved together. + /// </summary> + /// <param name="isUser">Whether to use user-attribute records instead of system-attribute records.</param> + /// <param name="trialId">The storage-wide trial identifier, distinct from its study-local number.</param> + /// <param name="attrs">The attributes, upserted in enumeration order.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="KeyError">The trial does not exist; nothing is written.</exception> + /// <exception cref="UpdateFinishedTrialError">The trial has finished; nothing is written.</exception> + /// <exception cref="Exception">A value is not JSON-serializable or the database refuses the batch; nothing is written.</exception> + private void SetTrialAttrs(bool isUser, int trialId, IReadOnlyDictionary<string, object?> attrs) + { + ArgumentNullException.ThrowIfNull(attrs); + if (attrs.Count == 0) + return; + Mutate(ctx => + { + // Disposed without Commit on any exception, which rolls the whole batch back. + using var tx = ctx.Database.BeginTransaction(); + var trial = FindTrialForUpdate(ctx, trialId); + CheckTrialIsUpdatableOrRaise(trial); + foreach (var (key, value) in attrs) + { + string json = PyJson.Dumps(value); + if (isUser) + { + var row = ctx.TrialUserAttributes.FirstOrDefault(a => a.TrialId == trialId && a.Key == key); + if (row is null) + ctx.TrialUserAttributes.Add(new TrialUserAttributeEntity { TrialId = trialId, Key = key, ValueJson = json }); + else + row.ValueJson = json; + } + else + { + var row = ctx.TrialSystemAttributes.FirstOrDefault(a => a.TrialId == trialId && a.Key == key); + if (row is null) + ctx.TrialSystemAttributes.Add(new TrialSystemAttributeEntity { TrialId = trialId, Key = key, ValueJson = json }); + else + row.ValueJson = json; + } + } + ctx.SaveChanges(); + tx.Commit(); + }); + } + /// <summary>Upserts a JSON-serializable attribute after verifying that its trial is still mutable.</summary> /// <param name="isUser">Whether to use user-attribute records instead of system-attribute records.</param> /// <param name="trialId">The storage-wide trial identifier, distinct from its study-local number.</param> @@ -1157,7 +1341,7 @@ public override FrozenTrial GetTrial(int trialId) using var ctx = NewContext(); EnsureTrialExists(ctx, trialId); var trials = GetTrialsInternal(ctx, studyId: null, singleTrialId: trialId, states: null, - includedTrialIds: null, trialIdGreaterThan: -1); + includedTrialIds: null, trialIdGreaterThan: -1, AttributesInKeyOrder); return trials[0]; } @@ -1167,7 +1351,8 @@ public override List<FrozenTrial> GetAllTrials( { using var ctx = NewContext(); EnsureStudyExists(ctx, studyId); - return GetTrialsInternal(ctx, studyId, singleTrialId: null, states, includedTrialIds: null, trialIdGreaterThan: -1); + return GetTrialsInternal(ctx, studyId, singleTrialId: null, states, includedTrialIds: null, trialIdGreaterThan: -1, + AttributesInKeyOrder); } /// <summary>Loads explicitly included trials and trials newer than an incremental trial-id cursor.</summary> @@ -1184,7 +1369,8 @@ public List<FrozenTrial> GetTrialsPartial( { using var ctx = NewContext(); EnsureStudyExists(ctx, studyId); - return GetTrialsInternal(ctx, studyId, singleTrialId: null, states, includedTrialIds, trialIdGreaterThan); + return GetTrialsInternal(ctx, studyId, singleTrialId: null, states, includedTrialIds, trialIdGreaterThan, + AttributesInKeyOrder); } /// <summary>Materializes matching trial records and their parameters, values, and attributes.</summary> @@ -1194,6 +1380,10 @@ public List<FrozenTrial> GetTrialsPartial( /// <param name="states">The allowed trial states, or null to include every state.</param> /// <param name="includedTrialIds">Trial identifiers to include even when they are at or below the incremental cursor.</param> /// <param name="trialIdGreaterThan">The exclusive lower trial-id bound for incremental reads.</param> + /// <param name="attributesInKeyOrder"> + /// Whether each trial's attributes come back in key order, as Optuna's index scans return them on MySQL + /// (<see cref="AttributesInKeyOrder" />), instead of insertion order. + /// </param> /// <returns>Matching trial snapshots with their child records materialized.</returns> private static List<FrozenTrial> GetTrialsInternal( OptunaRdbContext ctx, @@ -1201,7 +1391,8 @@ private static List<FrozenTrial> GetTrialsInternal( int? singleTrialId, IReadOnlyCollection<TrialState>? states, IReadOnlyCollection<int>? includedTrialIds, - int trialIdGreaterThan) + int trialIdGreaterThan, + bool attributesInKeyOrder) { // Python `_get_trials`: keep only tracked ids at or below the watermark; the rest are already // covered by the `trial_id > trial_id_greater_than` clause. @@ -1259,16 +1450,26 @@ private static List<FrozenTrial> GetTrialsInternal( .Select(v => new { v.TrialId, v.Step, v.IntermediateValue, v.IntermediateValueType }) .AsEnumerable().GroupBy(v => v.TrialId).ToDictionary(g => g.Key, g => g.ToList()); - var userByTrial = ctx.TrialUserAttributes.AsNoTracking() - .Where(a => idSet.Contains(a.TrialId!.Value)).OrderBy(a => a.TrialUserAttributeId) + // GroupBy keeps each group's rows in query order, so (trial_id, key) - the unique index InnoDB reads them + // through for Optuna - gives every trial its attributes in key order (QA-71); otherwise insertion order. + var userAttrQuery = ctx.TrialUserAttributes.AsNoTracking().Where(a => idSet.Contains(a.TrialId!.Value)); + var userByTrial = (attributesInKeyOrder + ? userAttrQuery.OrderBy(a => a.TrialId).ThenBy(a => a.Key) + : userAttrQuery.OrderBy(a => a.TrialUserAttributeId)) .Select(a => new { a.TrialId, a.Key, a.ValueJson }) .AsEnumerable().GroupBy(a => a.TrialId!.Value).ToDictionary(g => g.Key, g => g.ToList()); - var systemByTrial = ctx.TrialSystemAttributes.AsNoTracking() - .Where(a => idSet.Contains(a.TrialId!.Value)).OrderBy(a => a.TrialSystemAttributeId) + var systemAttrQuery = ctx.TrialSystemAttributes.AsNoTracking().Where(a => idSet.Contains(a.TrialId!.Value)); + var systemByTrial = (attributesInKeyOrder + ? systemAttrQuery.OrderBy(a => a.TrialId).ThenBy(a => a.Key) + : systemAttrQuery.OrderBy(a => a.TrialSystemAttributeId)) .Select(a => new { a.TrialId, a.Key, a.ValueJson }) .AsEnumerable().GroupBy(a => a.TrialId!.Value).ToDictionary(g => g.Key, g => g.ToList()); + // One parse per distinct distribution text for this load (plan 13, item S9 as measured on SQLite: parsing every + // parameter row was 40 % of a 10,000-trial cold load). The journal storage's cache (plan 10, item 2.7) shares + // the parsed object, which equals a fresh parse; it is local to this call, so no thread ever shares it. + var distributionCache = new JournalDistributionCache(); var result = new List<FrozenTrial>(trialRows.Count); foreach (var row in trialRows) { @@ -1286,7 +1487,7 @@ private static List<FrozenTrial> GetTrialsInternal( { foreach (var p in paramRows) { - var distribution = Distribution.FromJson(p.DistributionJson!); + var distribution = distributionCache.FromJson(p.DistributionJson!); @params[p.ParamName!] = distribution.ToExternalRepr(p.ParamValue!.Value); distributions[p.ParamName!] = distribution; } diff --git a/src/OptunaSharp.Storage.Grpc/README.md b/src/OptunaSharp.Storage.Grpc/README.md index 3c3fe2a..8db952f 100644 --- a/src/OptunaSharp.Storage.Grpc/README.md +++ b/src/OptunaSharp.Storage.Grpc/README.md @@ -141,6 +141,10 @@ duplicate name raises `DuplicatedStudyError`, a write to a finished trial raises is byte-identical, so cross-language wire-compatibility is unchanged. - Insecure (cleartext HTTP/2) transport, matching Optuna's `grpc.insecure_channel` / `add_insecure_port`. Put it behind your own network boundary. +- Trial dictionaries keep the order the server sends (insertion order from a C# server). Optuna's Python + client returns them in Python protobuf's hash order instead, which changes seeded `QMCSampler` and + `BruteForceSampler` runs through its proxy; OptunaSharp deliberately does not copy that (see the + cross-language page). ## License diff --git a/src/OptunaSharp.Storage.NRedisStack/Storages/Journal/NRedisStackJournalRedisBackend.cs b/src/OptunaSharp.Storage.NRedisStack/Storages/Journal/NRedisStackJournalRedisBackend.cs index e0c5d04..6a2d4fe 100644 --- a/src/OptunaSharp.Storage.NRedisStack/Storages/Journal/NRedisStackJournalRedisBackend.cs +++ b/src/OptunaSharp.Storage.NRedisStack/Storages/Journal/NRedisStackJournalRedisBackend.cs @@ -91,9 +91,9 @@ public class NRedisStackJournalRedisBackend : BaseJournalBackend, IBaseJournalSn /// flag.</param> /// <exception cref="NumSharp.ValueError">A URL redis-py rejects, with redis-py's message (see <see cref="RedisUrl.Parse" />).</exception> /// <exception cref="NumSharp.TypeError">A query argument redis-py's connection class does not take, with redis-py's message.</exception> - /// <exception cref="OverflowException">A timeout or TLS version too large for Python, with Python's message.</exception> + /// <exception cref="NumSharp.OverflowError">A timeout or TLS version too large for Python, with Python's class and message.</exception> /// <exception cref="NotSupportedException">A query argument no .NET client can honor, or white-space-only credentials.</exception> - /// <exception cref="System.IO.FileNotFoundException">A TLS certificate, key or authority file that does not exist.</exception> + /// <exception cref="NumSharp.FileNotFoundError">A TLS certificate, key or authority file that does not exist (<c>[Errno 2] No such file or directory</c>).</exception> /// <exception cref="System.Security.Cryptography.CryptographicException">A malformed TLS certificate, key or authority file.</exception> /// <remarks>The backend owns the connection it opens here: <see cref="Dispose" /> closes it.</remarks> public NRedisStackJournalRedisBackend(string url, bool useCluster = false, string prefix = "", bool dedicatedThreads = true) @@ -510,7 +510,7 @@ public void SaveSnapshot(byte[] snapshot) /// redis-py sends it as it is. /// </exception> /// <exception cref="NumSharp.TypeError">An <c>ssl_keyfile</c> without an <c>ssl_certfile</c>; Python's message.</exception> - /// <exception cref="System.IO.FileNotFoundException">A certificate, key or certificate-authority file that does not exist.</exception> + /// <exception cref="NumSharp.FileNotFoundError">A certificate, key or certificate-authority file that does not exist (<c>[Errno 2] No such file or directory</c>).</exception> /// <exception cref="System.Security.Cryptography.CryptographicException">A malformed certificate, key or authority file, a key that does not match, or a wrong key password.</exception> internal static ConfigurationOptions ToConfiguration(RedisEndpoint ep) { diff --git a/src/OptunaSharp.Storage.Redis/Storages/Journal/RedisEndpoint.cs b/src/OptunaSharp.Storage.Redis/Storages/Journal/RedisEndpoint.cs index 7b0bb58..a48f0bd 100644 --- a/src/OptunaSharp.Storage.Redis/Storages/Journal/RedisEndpoint.cs +++ b/src/OptunaSharp.Storage.Redis/Storages/Journal/RedisEndpoint.cs @@ -3,7 +3,7 @@ using System.Globalization; using System.Linq; using System.Numerics; -using NumSharp; // ValueError, TypeError +using NumSharp; // ValueError, TypeError, OverflowError using OptunaSharp.Internal; using OptunaSharp.Storages.SqlAlchemy; @@ -248,7 +248,7 @@ public static class RedisUrl /// (<c>connection_class</c> on <c>redis://</c>, <c>parser_class</c>) or needs a <c>DriverInfo</c>, or an /// <c>ssl_keyfile</c> without an <c>ssl_certfile</c> (<c>certfile should be a valid filesystem path</c>). /// </exception> - /// <exception cref="OverflowException">An infinite or astronomically large timeout, or a TLS version beyond a C long; Python's messages.</exception> + /// <exception cref="OverflowError">An infinite or astronomically large timeout, or a TLS version beyond a C long; Python's messages.</exception> /// <exception cref="NotSupportedException">An argument that takes a Python object, a non-UTF-8 encoding, or a TLS setting no .NET client offers.</exception> public static RedisEndpoint Parse(string url) { @@ -415,7 +415,7 @@ private static void CheckSupported(Kwargs kwargs, bool unix, bool ssl) /// <param name="ssl">Whether the URL is <c>rediss://</c>.</param> /// <returns>The endpoint.</returns> /// <exception cref="ValueError">A port outside 1–65535 from <c>?port=</c>, a NaN or negative timeout, an unknown TLS version, both OCSP modes, a client name the server refuses, or a database index outside 0–2147483647.</exception> - /// <exception cref="OverflowException">A timeout of 2⁶³ nanoseconds or more, or a TLS version beyond a C long.</exception> + /// <exception cref="OverflowError">A timeout of 2⁶³ nanoseconds or more, or a TLS version beyond a C long.</exception> /// <exception cref="NotSupportedException">A zero timeout, which makes a Python socket non-blocking.</exception> /// <exception cref="TypeError"> /// <c>rediss://</c> with an <c>ssl_keyfile</c> but no <c>ssl_certfile</c>: redis-py calls @@ -445,7 +445,7 @@ private static RedisEndpoint Build(Kwargs kwargs, bool unix, bool ssl) if (ssl && kwargs.Get("ssl_min_version") is BigInteger version) { if (version < int.MinValue || version > int.MaxValue) - throw new OverflowException("Python int too large to convert to C long"); + throw new OverflowError("Python int too large to convert to C long"); int v = (int)version; // _ssl.c formats the rejected value with %x, i.e. as an unsigned 32-bit pattern. if (v is not (-2 or -1 or 768 or 769 or 770 or 771 or 772)) @@ -505,7 +505,7 @@ private static RedisEndpoint Build(Kwargs kwargs, bool unix, bool ssl) /// <param name="value">The parsed float, or <see langword="null" /> when the URL has none.</param> /// <returns>The timeout in seconds.</returns> /// <exception cref="ValueError">NaN or a negative value; Python's messages.</exception> - /// <exception cref="OverflowException">2⁶³ nanoseconds or more (infinity included), which Python's time type cannot hold.</exception> + /// <exception cref="OverflowError">2⁶³ nanoseconds or more (infinity included), which Python's time type cannot hold.</exception> /// <exception cref="NotSupportedException">Zero, which makes a Python socket non-blocking.</exception> private static double Timeout(string key, object? value) { @@ -516,7 +516,7 @@ private static double Timeout(string key, object? value) // Python rounds a timeout away from zero to whole nanoseconds, then requires it to fit a signed 64-bit count. double nanoseconds = seconds >= 0 ? Math.Ceiling(seconds * 1e9) : Math.Floor(seconds * 1e9); if (!(nanoseconds >= -9223372036854775808.0 && nanoseconds < 9223372036854775808.0)) - throw new OverflowException("timestamp out of range for platform time_t"); + throw new OverflowError("timestamp out of range for platform time_t"); if (nanoseconds < 0) throw new ValueError("Timeout value out of range"); if (nanoseconds == 0) diff --git a/src/OptunaSharp.Storage.Redis/Storages/Journal/RedisTls.cs b/src/OptunaSharp.Storage.Redis/Storages/Journal/RedisTls.cs index 81de398..e697480 100644 --- a/src/OptunaSharp.Storage.Redis/Storages/Journal/RedisTls.cs +++ b/src/OptunaSharp.Storage.Redis/Storages/Journal/RedisTls.cs @@ -6,7 +6,7 @@ using System.Security.Cryptography; using System.Security.Cryptography.X509Certificates; using System.Text.RegularExpressions; -using NumSharp; // TypeError +using NumSharp; // TypeError, FileNotFoundError namespace OptunaSharp.Storages.Journal; @@ -63,7 +63,7 @@ internal static bool UsesDefaultValidation(RedisEndpoint ep) /// </summary> /// <param name="ep">The endpoint.</param> /// <returns>The callback, or <see langword="null" />.</returns> - /// <exception cref="FileNotFoundException"><c>ssl_ca_certs</c> names a missing file.</exception> + /// <exception cref="FileNotFoundError"><c>ssl_ca_certs</c> names a missing file.</exception> /// <exception cref="CryptographicException"><c>ssl_ca_certs</c> or <c>ssl_ca_data</c> holds no certificate, or a malformed one.</exception> internal static RemoteCertificateValidationCallback? Validation(RedisEndpoint ep) { @@ -83,7 +83,7 @@ internal static bool UsesDefaultValidation(RedisEndpoint ep) /// <param name="ep">The endpoint.</param> /// <returns>A certificate with its private key, or <see langword="null" />.</returns> /// <exception cref="TypeError">A key file without a certificate file; Python's message.</exception> - /// <exception cref="FileNotFoundException">A missing file.</exception> + /// <exception cref="FileNotFoundError">A missing certificate or key file: <c>[Errno 2] No such file or directory</c>, Python's class (NumSharp's since 0.81.0).</exception> /// <exception cref="CryptographicException">A malformed file, a key that does not match, or an encrypted key with a wrong or missing password.</exception> internal static X509Certificate2? ClientCertificate(RedisEndpoint ep) { @@ -91,6 +91,10 @@ internal static bool UsesDefaultValidation(RedisEndpoint ep) return null; if (ep.SslCertFile is null) throw new TypeError("certfile should be a valid filesystem path"); + // Python's load_cert_chain opens the certificate, then the key, and a missing one raises FileNotFoundError + // with errno 2 and no file name; .NET's PEM loaders would throw FileNotFoundException with their own text. + if (!File.Exists(ep.SslCertFile) || (ep.SslKeyFile is { } keyFile && !File.Exists(keyFile))) + throw new FileNotFoundError(2, "No such file or directory"); X509Certificate2 loaded; if (ep.SslPassword is { } password) { @@ -134,7 +138,7 @@ internal static bool UsesDefaultValidation(RedisEndpoint ep) /// </summary> /// <param name="ep">The endpoint.</param> /// <returns>The authorities; empty when the URL adds none.</returns> - /// <exception cref="FileNotFoundException"><c>ssl_ca_certs</c> names a missing file.</exception> + /// <exception cref="FileNotFoundError"><c>ssl_ca_certs</c> names a missing file.</exception> /// <exception cref="CryptographicException"><c>ssl_ca_data</c> or <c>ssl_ca_certs</c> holds no certificate, or a malformed one.</exception> internal static X509Certificate2Collection LoadAuthorities(RedisEndpoint ep) { @@ -149,7 +153,7 @@ internal static X509Certificate2Collection LoadAuthorities(RedisEndpoint ep) if (ep.SslCaCerts is { } file) { if (!File.Exists(file)) - throw new FileNotFoundException("[Errno 2] No such file or directory", file); + throw new FileNotFoundError(2, "No such file or directory"); int before = authorities.Count; authorities.ImportFromPemFile(file); if (authorities.Count == before) diff --git a/src/OptunaSharp.Storage.ServiceStack.Redis/Storages/Journal/ServiceStackJournalRedisBackend.cs b/src/OptunaSharp.Storage.ServiceStack.Redis/Storages/Journal/ServiceStackJournalRedisBackend.cs index e69e003..dc33481 100644 --- a/src/OptunaSharp.Storage.ServiceStack.Redis/Storages/Journal/ServiceStackJournalRedisBackend.cs +++ b/src/OptunaSharp.Storage.ServiceStack.Redis/Storages/Journal/ServiceStackJournalRedisBackend.cs @@ -73,7 +73,7 @@ public class ServiceStackJournalRedisBackend : BaseJournalBackend, IBaseJournalS /// <param name="prefix">Prefix of the preserved keys.</param> /// <exception cref="ValueError">A URL redis-py rejects, with redis-py's message (see <see cref="RedisUrl.Parse" />), or a <c>unix://</c> URL.</exception> /// <exception cref="TypeError">A query argument redis-py's connection class does not take, with redis-py's message.</exception> - /// <exception cref="OverflowException">A timeout or TLS version too large for Python, with Python's message.</exception> + /// <exception cref="NumSharp.OverflowError">A timeout or TLS version too large for Python, with Python's class and message.</exception> /// <exception cref="NotSupportedException">A query argument no .NET client can honor, or one ServiceStack.Redis cannot (see the type-level remarks).</exception> /// <remarks>The backend owns the client pool it builds here: <see cref="Dispose" /> closes it.</remarks> public ServiceStackJournalRedisBackend(string url, bool useCluster = false, string prefix = "") diff --git a/src/OptunaSharp.Storage.Sqlite/Storages/Rdb/RDBStorage.cs b/src/OptunaSharp.Storage.Sqlite/Storages/Rdb/RDBStorage.cs index 17b5ffb..ef5ce5b 100644 --- a/src/OptunaSharp.Storage.Sqlite/Storages/Rdb/RDBStorage.cs +++ b/src/OptunaSharp.Storage.Sqlite/Storages/Rdb/RDBStorage.cs @@ -240,7 +240,7 @@ private void Initialize(SqliteConnection connection, bool ownsConnection, Sqlite if (!options.SkipTableCreation) CreateSchema(); - InitVersionInfo(); + InitVersionInfo(options.SkipTableCreation); InitAlembic(); if (!options.SkipCompatibilityCheck) CheckTableSchemaCompatibility(); @@ -404,24 +404,52 @@ private void ApplyPragmas(SqliteRdbOptions o, int? busyTimeoutMs) /// <param name="body">The trusted PRAGMA expression executed after the PRAGMA keyword.</param> private void ExecPragma(string body) => Exec("PRAGMA " + body, null); - // Port of `_VersionManager._init_version_info_model`. The version tables are created here (not only - // in CreateSchema) so the two version-tracking tables exist even under `skip_table_creation` — the - // mode the CLI's `storage upgrade` opens with — mirroring Python, where the ORM insert / alembic - // stamp materialize them regardless. Both are IF NOT EXISTS no-ops on the normal fresh-DB path. + // Port of `_VersionManager._init_version_info_model`, which Python runs inside + // `_create_scoped_session(scoped_session, ignore_integrity_error=True)`. Under `skip_table_creation` Python creates + // no table: on a database without Optuna's tables its read of version_info fails, and the scoped session turns that + // into StorageInternalError in the constructor, with or without skip_compatibility_check (QA-74, measured + // 2026-11-12; `optuna storage upgrade` on an empty file fails the same way). The port used to create the table here + // regardless, so it constructed the storage and failed later on its first read with "no such table: studies". + // Every one of Optuna's upgrade-test databases has version_info, so upgrades are unaffected. /// <summary>Creates the informational schema/library version record if it is absent.</summary> - private void InitVersionInfo() + /// <param name="skipTableCreation">Whether the storage was opened with <c>skip_table_creation</c>: the table is then only read, never created.</param> + /// <exception cref="StorageInternalError">A database error other than a constraint violation, such as no version_info table under <paramref name="skipTableCreation" />.</exception> + private void InitVersionInfo(bool skipTableCreation) { - Exec(RdbModels.VersionInfoTableDdl, null); - long count = ScalarLong("SELECT COUNT(*) FROM version_info", null); - if (count > 0) - return; - Exec( - "INSERT INTO version_info (version_info_id, schema_version, library_version) VALUES (1, $p0, $p1)", - null, - RdbModels.SchemaVersion, - RdbModels.LibraryVersion); + try + { + if (!skipTableCreation) + Exec(RdbModels.VersionInfoTableDdl, null); + long count = ScalarLong("SELECT COUNT(*) FROM version_info", null); + if (count > 0) + return; + Exec( + "INSERT INTO version_info (version_info_id, schema_version, library_version) VALUES (1, $p0, $p1)", + null, + RdbModels.SchemaVersion, + RdbModels.LibraryVersion); + } + catch (SqliteException e) when (e.SqliteErrorCode == SqliteConstraintError) + { + // ignore_integrity_error=True: another process inserted the row between the read and the insert. + } + catch (SqliteException e) + { + throw new StorageInternalError(CommitErrorMessage, e); + } } + /// <summary>SQLite's <c>SQLITE_CONSTRAINT</c> result code: the errors SQLAlchemy reports as <c>IntegrityError</c>.</summary> + private const int SqliteConstraintError = 19; + + /// <summary> + /// The message of the <see cref="StorageInternalError" /> Optuna's <c>_create_scoped_session</c> raises for any + /// database error other than an integrity error, verbatim, trailing space included. + /// </summary> + private const string CommitErrorMessage = + "An exception is raised during the commit. This typically happens due to invalid data in the commit, " + + "e.g. exceeding max length. "; + // Port of `_VersionManager._init_alembic`. On an empty `alembic_version`, Python stamps the head // revision when alembic is "supported" (a freshly-created DB, or one already at the current // schema_version) and the base revision otherwise — the marker that says "this is a pre-alembic @@ -569,6 +597,47 @@ private void SetStudyAttr(string table, int studyId, string key, object? value) } } + /// <inheritdoc /> + /// <remarks>One transaction for the whole batch (plan 13, item S8): all entries are stored or none are.</remarks> + public override void SetStudyUserAttrs(int studyId, IReadOnlyDictionary<string, object?> attrs) + => SetStudyAttrs("study_user_attributes", studyId, attrs); + + /// <inheritdoc /> + /// <remarks>One transaction for the whole batch (plan 13, item S8): all entries are stored or none are.</remarks> + public override void SetStudySystemAttrs(int studyId, IReadOnlyDictionary<string, object?> attrs) + => SetStudyAttrs("study_system_attributes", studyId, attrs); + + /// <summary> + /// Upserts several JSON-serializable attributes in one transaction after verifying once that the study exists: + /// the same rows <see cref="SetStudyAttr" /> writes per entry. + /// </summary> + /// <param name="table">The trusted schema table name selected by the storage implementation.</param> + /// <param name="studyId">The storage-wide study identifier, not its display name.</param> + /// <param name="attrs">The attributes, upserted in enumeration order.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="KeyError">The study does not exist; nothing is written.</exception> + /// <exception cref="Exception">A value is not JSON-serializable; the transaction rolls back and nothing is written.</exception> + private void SetStudyAttrs(string table, int studyId, IReadOnlyDictionary<string, object?> attrs) + { + ArgumentNullException.ThrowIfNull(attrs); + if (attrs.Count == 0) + return; + lock (_lock) + { + // Disposed without Commit on any exception, which rolls every upsert of the batch back. + using var tx = _conn.BeginTransaction(); + EnsureStudyExists(studyId, tx); + foreach (var (key, value) in attrs) + { + Exec( + $"INSERT INTO {table} (study_id, \"key\", value_json) VALUES ($p0, $p1, $p2) " + + "ON CONFLICT(study_id, \"key\") DO UPDATE SET value_json = excluded.value_json", + tx, studyId, key, PyJson.Dumps(value)); + } + tx.Commit(); + } + } + /// <inheritdoc /> /// <exception cref="NumSharp.KeyError">No study has the requested name.</exception> public override int GetStudyIdFromName(string studyName) @@ -613,25 +682,32 @@ public override List<StudyDirection> GetStudyDirections(int studyId) /// <inheritdoc /> public override OrderedDict<string, object?> GetStudyUserAttrs(int studyId) - => GetStudyAttrs("study_user_attributes", "study_user_attribute_id", studyId); + => GetStudyAttrs("study_user_attributes", studyId); /// <inheritdoc /> public override OrderedDict<string, object?> GetStudySystemAttrs(int studyId) - => GetStudyAttrs("study_system_attributes", "study_system_attribute_id", studyId); + => GetStudyAttrs("study_system_attributes", studyId); - /// <summary>Loads and decodes all attributes of the selected kind for a study.</summary> + /// <summary>Loads and decodes all attributes of the selected kind for a study, in key order as Optuna reads them.</summary> /// <param name="table">The trusted schema table name selected by the storage implementation.</param> - /// <param name="idColumn">The trusted identifier column used to group records.</param> /// <param name="studyId">The storage-wide study identifier, not its display name.</param> - /// <returns>Decoded attributes in their stored traversal order.</returns> - private OrderedDict<string, object?> GetStudyAttrs(string table, string idColumn, int studyId) + /// <returns>Decoded attributes in key order (SQLite's BINARY collation, byte order of the UTF-8 text).</returns> + /// <exception cref="NumSharp.KeyError">No study with <paramref name="studyId" /> exists.</exception> + /// <remarks> + /// Optuna's <c>where_study_id</c> query has no <c>ORDER BY</c>; SQLite answers <c>WHERE study_id = ?</c> through + /// the unique <c>(study_id, key)</c> autoindex, so <c>study.user_attrs</c> and <c>load_study</c> list keys + /// sorted: set <c>zz, b, m</c>, read <c>b, m, zz</c>. The port ordered by the attribute id, insertion order + /// (QA-71). <c>get_all_studies</c> scans the table instead and keeps insertion order on both sides + /// (<see cref="LoadAllStudyAttrs" />). + /// </remarks> + private OrderedDict<string, object?> GetStudyAttrs(string table, int studyId) { lock (_lock) { EnsureStudyExists(studyId, null); var attrs = new OrderedDict<string, object?>(); Query( - $"SELECT \"key\", value_json FROM {table} WHERE study_id = $p0 ORDER BY {idColumn}", + $"SELECT \"key\", value_json FROM {table} WHERE study_id = $p0 ORDER BY \"key\"", null, r => attrs[r.GetString(0)] = PyJson.Loads(r.GetString(1)), studyId); @@ -1003,6 +1079,49 @@ private void SetTrialAttr(string table, int trialId, string key, object? value) } } + /// <inheritdoc /> + /// <remarks>One transaction for the whole batch (plan 13, item S8): all entries are stored or none are.</remarks> + public override void SetTrialUserAttrs(int trialId, IReadOnlyDictionary<string, object?> attrs) + => SetTrialAttrs("trial_user_attributes", trialId, attrs); + + /// <inheritdoc /> + /// <remarks>One transaction for the whole batch (plan 13, item S8): all entries are stored or none are.</remarks> + public override void SetTrialSystemAttrs(int trialId, IReadOnlyDictionary<string, object?> attrs) + => SetTrialAttrs("trial_system_attributes", trialId, attrs); + + /// <summary> + /// Upserts several JSON-serializable trial attributes in one transaction after checking once that the trial is + /// still mutable: the same rows <see cref="SetTrialAttrNoCommit" /> writes per entry. + /// </summary> + /// <param name="table">The trusted schema table name selected by the storage implementation.</param> + /// <param name="trialId">The storage-wide trial identifier, distinct from its study-local number.</param> + /// <param name="attrs">The attributes, upserted in enumeration order.</param> + /// <exception cref="ArgumentNullException"><paramref name="attrs" /> is null.</exception> + /// <exception cref="KeyError">The trial does not exist; nothing is written.</exception> + /// <exception cref="UpdateFinishedTrialError">The trial has finished; nothing is written.</exception> + /// <exception cref="Exception">A value is not JSON-serializable; the transaction rolls back and nothing is written.</exception> + private void SetTrialAttrs(string table, int trialId, IReadOnlyDictionary<string, object?> attrs) + { + ArgumentNullException.ThrowIfNull(attrs); + if (attrs.Count == 0) + return; + lock (_lock) + { + // Disposed without Commit on any exception, which rolls every upsert of the batch back. + using var tx = _conn.BeginTransaction(); + var trial = FindTrialOrRaise(trialId, tx); + CheckTrialIsUpdatableOrRaise(trial); + foreach (var (key, value) in attrs) + { + Exec( + $"INSERT INTO {table} (trial_id, \"key\", value_json) VALUES ($p0, $p1, $p2) " + + "ON CONFLICT(trial_id, \"key\") DO UPDATE SET value_json = excluded.value_json", + tx, trialId, key, PyJson.Dumps(value)); + } + tx.Commit(); + } + } + /// <summary>Upserts a trial attribute inside the caller-owned transaction without committing it.</summary> /// <param name="tx">The current SQLite transaction, or null to execute outside an explicit transaction.</param> /// <param name="table">The trusted schema table name selected by the storage implementation.</param> @@ -1103,6 +1222,8 @@ private List<FrozenTrial> GetTrialsInternal( var sql = new StringBuilder( "SELECT trial_id, number, state, datetime_start, datetime_complete FROM trials WHERE "); var args = new List<object?>(); + string? baseSql = null; + int baseArgCount = 0; if (singleTrialId is not null) { @@ -1131,11 +1252,24 @@ private List<FrozenTrial> GetTrialsInternal( return new List<FrozenTrial>(); } + // Python's `query`, before the incremental conditions: the fallback below reads it whole. + baseSql = sql.ToString(); + baseArgCount = args.Count; + if (included.Count > 0 && trialIdGreaterThan > -1) { - sql.Append(" AND (trial_id > $p").Append(args.Count); + // Optuna asks for `trial_id > :watermark OR trial_id IN (:included)`; SQLite answers that OR by walking + // every trial of the study in ix_trials_study_id (2.6 ms at 20,000 trials), so each sync of a study with a + // trial left RUNNING below the watermark (a parallel worker's, or a crashed one's) grew with the whole + // history. Two halves joined by UNION ALL let each use the primary key (64 µs there; plan 14, Rustuna + // d46ace5). They are disjoint (every included id is at or below the watermark), and the final ORDER BY + // sorts the union, so the rows and their order are the OR's. Both halves repeat the same named + // parameters, which SQLite binds to the same values. Rustuna also adds a (study_id, number) index; that + // changes Optuna's schema, so it is not taken. + string head = sql.ToString(); + sql.Append(" AND trial_id > $p").Append(args.Count); args.Add(trialIdGreaterThan); - sql.Append(" OR trial_id IN ("); + sql.Append(" UNION ALL ").Append(head).Append(" AND trial_id IN ("); for (int i = 0; i < included.Count; i++) { if (i > 0) @@ -1143,7 +1277,7 @@ private List<FrozenTrial> GetTrialsInternal( sql.Append("$p").Append(args.Count); args.Add(included[i]); } - sql.Append("))"); + sql.Append(')'); } else if (trialIdGreaterThan > -1) { @@ -1155,12 +1289,34 @@ private List<FrozenTrial> GetTrialsInternal( sql.Append(" ORDER BY trial_id"); var trialRows = new List<(int TrialId, int Number, TrialState State, string? Start, string? Complete)>(); - Query(sql.ToString(), null, r => trialRows.Add(( + Action<SqliteDataReader> readTrialRow = r => trialRows.Add(( (int)r.GetInt64(0), (int)r.GetInt64(1), RdbModels.StateFromDb(r.GetString(2)), r.IsDBNull(3) ? null : r.GetString(3), - r.IsDBNull(4) ? null : r.GetString(4))), args.ToArray()); + r.IsDBNull(4) ? null : r.GetString(4))); + try + { + Query(sql.ToString(), null, readTrialRow, args.ToArray()); + } + catch (SqliteException e) when (baseSql is not null && IsOperationalError(e)) + { + // Python `_get_trials`: `except sqlalchemy_exc.OperationalError` - "likely exceeding the number of maximum + // allowed variables using IN". The cached refresh binds one variable per unfinished trial below the watermark, + // and past SQLite's limit (32,766 in the e_sqlite3 build Microsoft.Data.Sqlite ships) the read threw "too many + // SQL variables", so a study with that many trials left RUNNING could no longer be read (QA-59). Optuna logs + // the error, reads every trial the base query matches and keeps the included ones and those above the + // watermark, in trial-id order. Only the multi-trial read has this fallback, as only `_get_trials` does. + _logger.Warning($"Caught an error from sqlalchemy: {e.Message}. Falling back to a slower alternative."); + trialRows.Clear(); + var keep = new HashSet<int>(included); + Query(baseSql + " ORDER BY trial_id", null, r => + { + int trialId = (int)r.GetInt64(0); + if (keep.Contains(trialId) || trialId > trialIdGreaterThan) + readTrialRow(r); + }, args.Take(baseArgCount).ToArray()); + } if (trialRows.Count == 0) return new List<FrozenTrial>(); @@ -1169,9 +1325,14 @@ private List<FrozenTrial> GetTrialsInternal( var paramsByTrial = LoadTrialParams(trialIds); var valuesByTrial = LoadTrialValues(trialIds); var intermediateByTrial = LoadTrialIntermediateValues(trialIds); - var userByTrial = LoadTrialAttrs("trial_user_attributes", "trial_user_attribute_id", trialIds); - var systemByTrial = LoadTrialAttrs("trial_system_attributes", "trial_system_attribute_id", trialIds); - + var userByTrial = LoadTrialAttrs("trial_user_attributes", trialIds); + var systemByTrial = LoadTrialAttrs("trial_system_attributes", trialIds); + + // One parse per distinct distribution text for this load (plan 13, item S9 as measured): a 40-parameter study + // repeats 40 texts, and parsing every parameter row was 40 % of a 10,000-trial cold load, where the attribute + // JSON lazy decoding would have deferred was 3-4 %. The journal storage's cache (plan 10, item 2.7) shares the + // parsed object, which equals a fresh parse; it is local to this call, so no thread ever shares it. + var distributionCache = new OptunaSharp.Storages.Journal.JournalDistributionCache(); var result = new List<FrozenTrial>(trialRows.Count); foreach (var row in trialRows) { @@ -1181,7 +1342,8 @@ private List<FrozenTrial> GetTrialsInternal( valuesByTrial.GetValueOrDefault(row.TrialId), intermediateByTrial.GetValueOrDefault(row.TrialId), userByTrial.GetValueOrDefault(row.TrialId), - systemByTrial.GetValueOrDefault(row.TrialId))); + systemByTrial.GetValueOrDefault(row.TrialId), + distributionCache)); } return result; } @@ -1197,7 +1359,11 @@ private List<FrozenTrial> GetTrialsInternal( /// <param name="intermediateRows">Intermediate-report rows indexed by step, or null when absent.</param> /// <param name="userRows">Serialized user attributes for the trial, or null when absent.</param> /// <param name="systemRows">Serialized system attributes for the trial, or null when absent.</param> + /// <param name="distributionCache"> + /// Parses each distinct distribution text once for the whole load; the distributions it returns equal fresh parses. + /// </param> /// <returns>A detached snapshot carrying the supplied trial data.</returns> + /// <exception cref="ValueError">A stored distribution text is not a valid distribution.</exception> private FrozenTrial BuildFrozenTrial( int trialId, int number, @@ -1208,7 +1374,8 @@ private FrozenTrial BuildFrozenTrial( List<(int Objective, double? Value, string Type)>? valueRows, List<(long Step, double? Value, string Type)>? intermediateRows, List<(string Key, string Json)>? userRows, - List<(string Key, string Json)>? systemRows) + List<(string Key, string Json)>? systemRows, + OptunaSharp.Storages.Journal.JournalDistributionCache distributionCache) { List<double>? values = null; if (valueRows is { Count: > 0 }) @@ -1224,7 +1391,7 @@ private FrozenTrial BuildFrozenTrial( { foreach (var (_, name, value, distJson) in paramRows.OrderBy(p => p.ParamId)) { - var distribution = Distribution.FromJson(distJson); + var distribution = distributionCache.FromJson(distJson); @params[name] = distribution.ToExternalRepr(value); distributions[name] = distribution; } @@ -1319,13 +1486,19 @@ private FrozenTrial BuildFrozenTrial( return byTrial; } - /// <summary>Loads serialized trial attributes grouped by trial identifier.</summary> + /// <summary>Loads serialized trial attributes grouped by trial identifier, each trial's in key order.</summary> /// <param name="table">The trusted schema table name selected by the storage implementation.</param> - /// <param name="idColumn">The trusted identifier column used to group records.</param> /// <param name="trialIds">The storage-wide identifiers whose child records are read.</param> - /// <returns>Attribute rows grouped by storage-wide trial identifier.</returns> - private Dictionary<int, List<(string Key, string Json)>> LoadTrialAttrs( - string table, string idColumn, IReadOnlyList<int> trialIds) + /// <returns>Attribute rows grouped by storage-wide trial identifier, each group in key order.</returns> + /// <remarks> + /// Optuna loads a trial's attributes with <c>selectinload</c> (<c>WHERE trial_id IN (...)</c>, no + /// <c>ORDER BY</c>) or a lazy load (<c>WHERE trial_id = ?</c>); SQLite answers both through the unique + /// <c>(trial_id, key)</c> autoindex, so <c>study.trials</c>, <c>get_trial</c> and <c>best_trial</c> list each + /// trial's attributes sorted by key (BINARY collation), and <c>get_all_artifact_meta</c>, which walks the system + /// attributes, lists artifacts in <c>artifacts:<uuid></c> key order. The port ordered by attribute id, + /// insertion order (QA-71); <c>ORDER BY trial_id, "key"</c> is that index's order. + /// </remarks> + private Dictionary<int, List<(string Key, string Json)>> LoadTrialAttrs(string table, IReadOnlyList<int> trialIds) { var byTrial = new Dictionary<int, List<(string, string)>>(); ReadChildrenInChunks( @@ -1337,7 +1510,7 @@ private FrozenTrial BuildFrozenTrial( byTrial[tid] = list = new List<(string, string)>(); list.Add((r.GetString(1), r.GetString(2))); }, - orderBy: idColumn); + orderBy: "trial_id, \"key\""); return byTrial; } @@ -1495,6 +1668,16 @@ private static void CheckTrialIsUpdatableOrRaise((int Number, TrialState State, private static object? OrNull(DateTime? value) => value is null ? null : RdbModels.FormatDatetime(value.Value); + /// <summary> + /// Whether an SQLite error is one Python's <c>sqlite3</c> raises as <c>OperationalError</c> (which SQLAlchemy + /// wraps as its own <c>OperationalError</c>): the primary result codes ERROR (which covers "too many SQL + /// variables"), PERM, ABORT, BUSY, LOCKED, READONLY, INTERRUPT, IOERR, FULL, CANTOPEN, PROTOCOL, EMPTY and SCHEMA. + /// </summary> + /// <param name="e">The provider exception to classify.</param> + /// <returns>Whether Optuna's <c>except OperationalError</c> would catch it.</returns> + private static bool IsOperationalError(SqliteException e) + => (e.SqliteErrorCode & 0xFF) is 1 or 3 or 4 or 5 or 6 or 8 or 9 or 10 or 13 or 14 or 15 or 16 or 17; + /// <summary>Recognizes provider-specific uniqueness failures so duplicate studies can be translated consistently.</summary> /// <param name="e">The provider exception to classify or translate.</param> /// <returns>Whether the exception denotes a uniqueness-constraint violation.</returns> diff --git a/src/OptunaSharp.Storage.Sqlite/Storages/Rdb/SqliteUrl.cs b/src/OptunaSharp.Storage.Sqlite/Storages/Rdb/SqliteUrl.cs index 1993053..30e3d8a 100644 --- a/src/OptunaSharp.Storage.Sqlite/Storages/Rdb/SqliteUrl.cs +++ b/src/OptunaSharp.Storage.Sqlite/Storages/Rdb/SqliteUrl.cs @@ -86,7 +86,7 @@ private static readonly (string Key, string Type)[] PysqliteArgs = /// <exception cref="TypeError">A template index; a repeated query key <c>int</c>/<c>float</c> cannot take; <c>?uri=true</c> without a path.</exception> /// <exception cref="ArgumentException">Not a SQLAlchemy URL; an unknown dialect, driver or plugin; or a SQLite URL with a host, user, password or port.</exception> /// <exception cref="NotSupportedException">A driver with no OptunaSharp counterpart (<c>sqlite+pysqlcipher</c>).</exception> - /// <exception cref="OverflowException">A <c>detect_types</c> or <c>cached_statements</c> outside the C <c>int</c> range.</exception> + /// <exception cref="OverflowError">A <c>detect_types</c> or <c>cached_statements</c> outside the C <c>int</c> range (Python's class, NumSharp's since 0.81.0).</exception> /// <exception cref="InvalidOperationException">An asyncio driver (<c>sqlite+aiosqlite</c>); SQLAlchemy's synchronous-engine error.</exception> internal static (string Filled, SqliteConnectArgs Args) Resolve(string url, Action? validateOptions = null) { @@ -166,7 +166,7 @@ internal static (string? Filename, OrderedDict<string, object?> Opts) CreateConn /// <returns>What to open.</returns> /// <exception cref="TypeError">No filename (<c>sqlite://?uri=true</c>).</exception> /// <exception cref="ValueError">A NUL in the path, or an invalid repeated <c>isolation_level</c>.</exception> - /// <exception cref="OverflowException">A <c>detect_types</c> or <c>cached_statements</c> outside the C <c>int</c> range.</exception> + /// <exception cref="OverflowError">A <c>detect_types</c> or <c>cached_statements</c> outside the C <c>int</c> range (Python's class, NumSharp's since 0.81.0).</exception> internal static SqliteConnectArgs Connect(string? filename, OrderedDict<string, object?> opts) { // sqlite3.connect(database, timeout, detect_types, isolation_level, check_same_thread, factory, @@ -193,10 +193,10 @@ internal static SqliteConnectArgs Connect(string? filename, OrderedDict<string, /// <summary>Argument Clinic's C <c>int</c> conversion of an integer argument.</summary> /// <param name="opts">The coerced arguments.</param> /// <param name="key">The argument to check, if present.</param> - /// <exception cref="OverflowException">The value is outside the 32-bit range: <c>Python int too large to convert to C int</c>.</exception> + /// <exception cref="OverflowError">The value is outside the 32-bit range: <c>Python int too large to convert to C int</c>.</exception> private static void CheckCInt(OrderedDict<string, object?> opts, string key) { if (opts.TryGetValue(key, out object? value) && value is BigInteger i && (i < int.MinValue || i > int.MaxValue)) - throw new OverflowException("Python int too large to convert to C int"); + throw new OverflowError("Python int too large to convert to C int"); } } diff --git a/src/OptunaSharp.Storage.StackExchange.Redis/Storages/Journal/StackExchangeJournalRedisBackend.cs b/src/OptunaSharp.Storage.StackExchange.Redis/Storages/Journal/StackExchangeJournalRedisBackend.cs index 56d4078..076eeb4 100644 --- a/src/OptunaSharp.Storage.StackExchange.Redis/Storages/Journal/StackExchangeJournalRedisBackend.cs +++ b/src/OptunaSharp.Storage.StackExchange.Redis/Storages/Journal/StackExchangeJournalRedisBackend.cs @@ -95,9 +95,9 @@ public class StackExchangeJournalRedisBackend : BaseJournalBackend, IBaseJournal /// turns it off, and StackExchange.Redis 2.x (the net8.0 build's client) has no such flag.</param> /// <exception cref="ValueError">A URL redis-py rejects, with redis-py's message (see <see cref="RedisUrl.Parse" />).</exception> /// <exception cref="TypeError">A query argument redis-py's connection class does not take, with redis-py's message.</exception> - /// <exception cref="OverflowException">A timeout or TLS version too large for Python, with Python's message.</exception> + /// <exception cref="NumSharp.OverflowError">A timeout or TLS version too large for Python, with Python's class and message.</exception> /// <exception cref="NotSupportedException">A query argument no .NET client can honor, or white-space-only credentials.</exception> - /// <exception cref="System.IO.FileNotFoundException">A TLS certificate, key or authority file that does not exist.</exception> + /// <exception cref="NumSharp.FileNotFoundError">A TLS certificate, key or authority file that does not exist (<c>[Errno 2] No such file or directory</c>).</exception> /// <exception cref="System.Security.Cryptography.CryptographicException">A malformed TLS certificate, key or authority file.</exception> /// <remarks>The backend owns the connection it opens here: <see cref="Dispose" /> closes it.</remarks> public StackExchangeJournalRedisBackend(string url, bool useCluster = false, string prefix = "", bool dedicatedThreads = true) @@ -514,7 +514,7 @@ public void SaveSnapshot(byte[] snapshot) /// redis-py sends it as it is. /// </exception> /// <exception cref="TypeError">An <c>ssl_keyfile</c> without an <c>ssl_certfile</c>; Python's message.</exception> - /// <exception cref="System.IO.FileNotFoundException">A certificate, key or certificate-authority file that does not exist.</exception> + /// <exception cref="NumSharp.FileNotFoundError">A certificate, key or certificate-authority file that does not exist (<c>[Errno 2] No such file or directory</c>).</exception> /// <exception cref="System.Security.Cryptography.CryptographicException">A malformed certificate, key or authority file, a key that does not match, or a wrong key password.</exception> internal static ConfigurationOptions ToConfiguration(RedisEndpoint ep) { diff --git a/src/OptunaSharp.Visualization.Plotly/Internal/PlotlyColors.cs b/src/OptunaSharp.Visualization.Plotly/Internal/PlotlyColors.cs index a6a054f..d787268 100644 --- a/src/OptunaSharp.Visualization.Plotly/Internal/PlotlyColors.cs +++ b/src/OptunaSharp.Visualization.Plotly/Internal/PlotlyColors.cs @@ -123,18 +123,27 @@ private static int To255(double v01) return (int)Math.Round(d, MidpointRounding.ToEven); } - /// <summary>NumPy <c>np.quantile(sorted, q)</c> with the default linear interpolation.</summary> - /// <param name="sorted">Nonempty values already sorted in ascending order.</param> + /// <summary> + /// NumPy <c>np.quantile(sorted, q)</c> with the default linear method, computed by NumSharp's <c>np.quantile</c> + /// — the rank plot's colorbar tick values (<c>_get_tick_info</c>). + /// </summary> + /// <param name="sorted">Nonempty values already sorted in ascending order (NumPy sorts again; the order only saves work).</param> /// <param name="q">Quantile position from zero through one, inclusive.</param> - /// <returns>Linearly interpolated quantile matching NumPy's default method.</returns> - /// <exception cref="System.IndexOutOfRangeException">The input is empty or the quantile produces an index outside the array.</exception> + /// <returns>The linearly interpolated quantile, bit for bit NumPy's; NaN when the values hold a NaN.</returns> + /// <remarks> + /// NumPy interpolates with <c>_lerp</c>: <c>a + (b - a) * t</c> below <c>t = 0.5</c> and <c>b - (b - a) * (1 - t)</c> + /// from it on, so the 75% tick between two values is not the textbook <c>a + (b - a) * t</c> (<c>[-3.3, 0.2]</c>: + /// NumPy <c>-0.675</c>, textbook <c>-0.6749999999999998</c>); a NaN anywhere makes every quantile NaN. The former + /// hand interpolation used the textbook form and skipped the NaN rule. The label's <c>%g</c> hides most last-bit + /// differences, but the value is now NumPy's. Five calls per rank plot. + /// </remarks> + /// <exception cref="System.IndexOutOfRangeException">The input is empty (NumPy's <c>IndexError: index -1 is out of bounds for axis 0 with size 0</c>).</exception> + /// <exception cref="NumSharp.ValueError"><paramref name="q" /> is outside [0, 1] (<c>Quantiles must be in the range [0, 1]</c>).</exception> public static double QuantileSorted(double[] sorted, double q) { - double pos = q * (sorted.Length - 1); - int lo = (int)Math.Floor(pos); - int hi = (int)Math.Ceiling(pos); - double frac = pos - lo; - return sorted[lo] + frac * (sorted[hi] - sorted[lo]); + using NumSharp.NDArray values = NumSharp.np.array(sorted, copy: false); + using NumSharp.NDArray quantile = NumSharp.np.quantile(values, q); + return (double)quantile; } /// <summary> diff --git a/src/OptunaSharp.Visualization.Plotly/Renderers/ParallelCoordinatePlot.cs b/src/OptunaSharp.Visualization.Plotly/Renderers/ParallelCoordinatePlot.cs index 66a22d6..40806ee 100644 --- a/src/OptunaSharp.Visualization.Plotly/Renderers/ParallelCoordinatePlot.cs +++ b/src/OptunaSharp.Visualization.Plotly/Renderers/ParallelCoordinatePlot.cs @@ -212,20 +212,25 @@ private static object[] GetAxisAnnotations(List<DimensionInfo> dimensions) return annotations.ToArray(); } - /// <summary>NumPy <c>np.linspace(min, max, num)</c> — endpoint forced exact.</summary> + /// <summary> + /// NumPy <c>np.linspace(min, max, num)</c>, computed by NumSharp's <c>np.linspace</c> — Optuna's + /// <c>np.linspace(*dim.range, num=5)</c> tick values for an axis without tick values of its own. + /// </summary> /// <param name="min">First endpoint.</param> /// <param name="max">Last endpoint.</param> - /// <param name="num">Number of samples; must be at least two for the intended spacing.</param> - /// <returns>Equally spaced values with the final element set exactly to max.</returns> - /// <exception cref="System.IndexOutOfRangeException">No samples are allocated but the endpoint is written.</exception> + /// <param name="num">Number of samples (the renderer passes 5).</param> + /// <returns>Equally spaced values with the final element set exactly to <paramref name="max" />.</returns> + /// <remarks> + /// For ordinary ranges this is <c>i * step + min</c> with the endpoint forced, as the former hand loop computed. + /// NumSharp also keeps NumPy's zero-step branch (a range so narrow that <c>(max - min) / (num - 1)</c> underflows + /// to 0: NumPy then divides and multiplies by the span instead), which the hand loop lacked; it is the same + /// routine Core's parallel-coordinate data builder uses (QA-54's class). + /// </remarks> + /// <exception cref="NumSharp.ValueError"><paramref name="num" /> is negative (<c>Number of samples, -1, must be non-negative.</c>).</exception> private static double[] Linspace(double min, double max, int num) { - var result = new double[num]; - double step = (max - min) / (num - 1); - for (int i = 0; i < num; i++) - result[i] = min + i * step; - result[num - 1] = max; - return result; + using NumSharp.NDArray grid = NumSharp.np.linspace(min, max, num); + return grid.ToArray<double>(); } /// <summary>Compares axis values using the renderer's relative tick-matching tolerance.</summary> diff --git a/test/OptunaSharp.Tests.Cli/CliParityBugTests.cs b/test/OptunaSharp.Tests.Cli/CliParityBugTests.cs index f324562..14d105c 100644 --- a/test/OptunaSharp.Tests.Cli/CliParityBugTests.cs +++ b/test/OptunaSharp.Tests.Cli/CliParityBugTests.cs @@ -108,10 +108,10 @@ public void Tell_InfValue_AcceptedLikePythonFloat() /// The YAML format is documented as best-effort (PyYAML's exact bytes are not a target), but doubled carriage /// returns are not a YAML difference: a file written with <c>> out.yaml</c> shows a blank line after every /// line in most editors, and tools that split on <c>\n</c> keep a stray <c>\r</c>. Linux (<c>\n</c> newlines) - /// is unaffected, so this test only fails on Windows. + /// is unaffected, so this test only failed on Windows. <b>Fixed 2026-11-12</b> by QA-61 of the 2026-11-10 run: + /// <c>-f yaml</c> is now <c>PyYamlSafeDump</c>, which writes <c>\n</c> only, and the printer translates each once. /// </remarks> [TestMethod] - [TestCategory("OpenBugs")] public void TrialsYaml_LinesEndOnce() { string url = FreshDbUrl(); diff --git a/test/OptunaSharp.Tests.Cli/OptunaSharp.Tests.Cli.csproj b/test/OptunaSharp.Tests.Cli/OptunaSharp.Tests.Cli.csproj index 42add9c..919891c 100644 --- a/test/OptunaSharp.Tests.Cli/OptunaSharp.Tests.Cli.csproj +++ b/test/OptunaSharp.Tests.Cli/OptunaSharp.Tests.Cli.csproj @@ -27,4 +27,10 @@ <ProjectReference Include="..\..\src\OptunaSharp.Core\OptunaSharp.Core.csproj" /> </ItemGroup> + <ItemGroup> + <!-- Committed PyYAML oracle (yaml.safe_dump output for 763 value trees, PyYAML 6.0.3; regenerated by + oracle/gen_pyyaml_oracle.py), replayed by PyYamlSafeDumpOracleTests with no Python at test time. --> + <None Include="oracle\pyyaml_safe_dump.json" CopyToOutputDirectory="PreserveNewest" /> + </ItemGroup> + </Project> diff --git a/test/OptunaSharp.Tests.Cli/PyYamlSafeDumpOracleTests.cs b/test/OptunaSharp.Tests.Cli/PyYamlSafeDumpOracleTests.cs new file mode 100644 index 0000000..d05ef88 --- /dev/null +++ b/test/OptunaSharp.Tests.Cli/PyYamlSafeDumpOracleTests.cs @@ -0,0 +1,121 @@ +using System; +using System.Collections.Generic; +using System.Collections.Specialized; +using System.Globalization; +using System.IO; +using System.Text; +using System.Text.Json; +using AwesomeAssertions; +using OptunaSharp.Cli; + +namespace OptunaSharp.Tests.Cli; + +/// <summary> +/// The CLI's <c>-f yaml</c> writer (<see cref="PyYamlSafeDump" />) against PyYAML's <c>yaml.safe_dump</c>, byte for +/// byte, with no Python at test time: the committed corpus <c>oracle/pyyaml_safe_dump.json</c> (763 cases, PyYAML +/// 6.0.3, regenerated by <c>oracle/gen_pyyaml_oracle.py</c>) pairs value trees with PyYAML's output. +/// </summary> +/// <remarks> +/// The corpus is built to reach every style decision: YAML 1.1 look-alike strings that must be quoted to stay strings, +/// indicators in every position, quotes and doubled quotes, leading / trailing / doubled spaces, line breaks, control, +/// non-ASCII and astral characters (escaped, since <c>allow_unicode</c> is off), strings that fold at 80 columns in +/// each of the plain, single- and double-quoted styles, floats from <c>5e-324</c> to <c>.inf</c> and <c>-0.0</c>, keys +/// around the 128-character simple-key limit, empty and nested collections, and 190 CLI-shaped trial records. Found +/// with it: QA-61 of <c>docs/qa/PARITY_QA_2026-11-10.md</c> (YamlDotNet, used before, changed value types). +/// </remarks> +[TestClass] +public class PyYamlSafeDumpOracleTests +{ + /// <summary> + /// Every case of the corpus dumps to PyYAML's exact text; a failure lists the first mismatches with both texts. + /// </summary> + /// <exception cref="AssertFailedException">A case's output differs from PyYAML's.</exception> + [TestMethod] + public void SafeDump_EveryCorpusCase_MatchesPyYamlByteForByte() + { + string path = Path.Combine(AppContext.BaseDirectory, "oracle", "pyyaml_safe_dump.json"); + using JsonDocument doc = JsonDocument.Parse(File.ReadAllText(path, Encoding.UTF8)); + JsonElement cases = doc.RootElement.GetProperty("cases"); + + var failures = new List<string>(); + int index = 0, mismatches = 0; + foreach (JsonElement c in cases.EnumerateArray()) + { + object? tree = Untag(c.GetProperty("tree")); + string expected = c.GetProperty("yaml").GetString()!; + string actual = PyYamlSafeDump.Dump(tree); + if (actual != expected) + { + // Keep the first ten in full for the message; count all of them. + mismatches++; + if (failures.Count < 10) + failures.Add($"case {index}:\n--- PyYAML\n{expected}--- port\n{actual}"); + } + index++; + } + + index.Should().Be(763, "the corpus is complete"); + mismatches.Should().Be(0, string.Join("\n", failures)); + } + + /// <summary>The CLI's float forms, pinned by name: a decimal point always, <c>.0</c> before a bare exponent.</summary> + /// <param name="value">The float.</param> + /// <param name="expected">PyYAML's line for <c>{"v": value}</c>.</param> + [TestMethod] + [DataRow(2.0, "v: 2.0\n")] + [DataRow(1e-07, "v: 1.0e-07\n")] + [DataRow(1e16, "v: 1.0e+16\n")] + [DataRow(double.NaN, "v: .nan\n")] + [DataRow(double.NegativeInfinity, "v: -.inf\n")] + [DataRow(-0.0, "v: -0.0\n")] + public void SafeDump_Floats_KeepPyYamlsFloatForms(double value, string expected) + { + var tree = new OrderedDictionary { ["v"] = value }; + + PyYamlSafeDump.Dump(tree).Should().Be(expected); + } + + /// <summary> + /// Rebuilds a Python value from the corpus's tagged JSON (see the generator's docstring): dicts become + /// <see cref="OrderedDictionary" />, lists <see cref="List{T}" />, ints <see cref="long" />, floats their exact + /// bits. + /// </summary> + /// <param name="e">A tagged node.</param> + /// <returns>The value as the CLI would hand it to the dumper.</returns> + /// <exception cref="InvalidDataException">The node has an unknown tag (a corrupt corpus).</exception> + private static object? Untag(JsonElement e) + { + JsonProperty p = default; + foreach (JsonProperty only in e.EnumerateObject()) + p = only; + switch (p.Name) + { + case "n": + return null; + case "b": + return p.Value.GetBoolean(); + case "i": + return long.Parse(p.Value.GetString()!, NumberStyles.AllowLeadingSign, CultureInfo.InvariantCulture); + case "f": + return BitConverter.Int64BitsToDouble(p.Value.GetInt64()); + case "s": + return p.Value.GetString(); + case "l": + { + var list = new List<object?>(); + foreach (JsonElement item in p.Value.EnumerateArray()) + list.Add(Untag(item)); + return list; + } + case "d": + { + var dict = new OrderedDictionary(); + foreach (JsonElement pair in p.Value.EnumerateArray()) + dict[Untag(pair[0])!] = Untag(pair[1]); + return dict; + } + default: + throw new InvalidDataException($"unknown tag '{p.Name}' in the PyYAML corpus"); + } + } +} diff --git a/test/OptunaSharp.Tests.Cli/Run2CliParityBugTests.cs b/test/OptunaSharp.Tests.Cli/Run2CliParityBugTests.cs new file mode 100644 index 0000000..d137a2c --- /dev/null +++ b/test/OptunaSharp.Tests.Cli/Run2CliParityBugTests.cs @@ -0,0 +1,250 @@ +using System; +using System.Collections.Generic; +using System.IO; +using AwesomeAssertions; +using OptunaSharp; +using OptunaSharp.Cli; +using OptunaSharp.Collections; +using OptunaSharp.Distributions; +using OptunaSharp.Storages; + +namespace OptunaSharp.Tests.Cli; + +/// <summary> +/// Open parity bugs in the <c>optunasharp</c> CLI found by the 2026-11-10 parity QA run +/// (<c>docs/qa/PARITY_QA_2026-11-10.md</c>). Each test fails today and passes once fixed, at which point its +/// <c>OpenBugs</c> category should be removed. +/// </summary> +[TestClass] +public class Run2CliParityBugTests +{ + private readonly List<string> _tempFiles = new(); + + /// <summary>Deletes the SQLite files the tests created; a file still locked by a pool is left behind.</summary> + [TestCleanup] + public void Cleanup() + { + foreach (var f in _tempFiles) + { + try + { + if (File.Exists(f)) + File.Delete(f); + } + catch (IOException) + { + // SQLite's connection pool may still hold the file on Windows; the temp folder is cleaned later. + } + } + } + + /// <summary>Runs the CLI in-process and captures what it writes to standard output.</summary> + /// <param name="exitCode">The exit code <see cref="CliProgram.Run" /> returned.</param> + /// <param name="args">The command line, without the executable name.</param> + /// <returns>Everything written to <see cref="Console.Out" /> during the call, line feeds only.</returns> + private static string Run(out int exitCode, params string[] args) + { + var original = Console.Out; + var buffer = new StringWriter(); + Console.SetOut(buffer); + try + { + exitCode = CliProgram.Run(args); + } + finally + { + Console.SetOut(original); + } + // Compare lines, not line endings (QA-36 already covers the doubled carriage return). + return buffer.ToString().Replace("\r", ""); + } + + /// <summary> + /// QA-61: <c>-f yaml</c> writes floats and datetimes in forms a YAML 1.1 reader (PyYAML, which Optuna's own + /// output targets) reads back as other types. PyYAML's <c>safe_dump</c> writes every float with a decimal point + /// (<c>2.0</c>, <c>1.0e-07</c>, <c>1.0e+16</c>) and quotes the formatted datetimes; YamlDotNet writes <c>2</c>, + /// <c>1E-07</c>, <c>10000000000000000</c> and bare datetimes. + /// </summary> + /// <remarks> + /// <para> + /// Optuna 5.0.0, <c>optuna trials -f yaml</c> on a trial with <c>x=1e-07</c>, <c>y=2.0</c> and value + /// <c>1e16</c>: <c>x: 1.0e-07</c>, <c>y: 2.0</c>, <c>value: 1.0e+16</c>, + /// <c>datetime_start: '2026-11-10 22:51:17'</c>. The port: <c>x: 1E-07</c>, <c>"y": 2</c>, + /// <c>value: 10000000000000000</c>, <c>datetime_start: 2026-11-10 22:51:17</c>. + /// </para> + /// <para> + /// Read back with <c>yaml.safe_load</c>, the port's output gives the string <c>'1E-07'</c> (YAML 1.1's float + /// needs a decimal point), the int <c>2</c> and the int <c>10000000000000000</c> for the three floats, and a + /// <c>datetime</c> object where Optuna's output gives a string. <c>OutputFormat.cs</c> calls YAML byte parity + /// best-effort; these change the values' types, not only their bytes. The key quoting (<c>"y"</c>, YAML 1.1's + /// boolean <c>y</c>) and double instead of single quotes read back the same and are not asserted. + /// </para> + /// <para> + /// <b>Fixed 2026-11-12:</b> <c>-f yaml</c> goes through <c>PyYamlSafeDump</c>, a port of PyYAML's + /// <c>safe_dump</c> pinned byte for byte by <see cref="PyYamlSafeDumpOracleTests" /> (763 cases); YamlDotNet is + /// gone from the CLI. + /// </para> + /// </remarks> + [TestMethod] + public void TrialsYaml_FloatsAndDatetimes_KeepTheirTypesLikePyYaml() + { + string path = Path.Combine(Path.GetTempPath(), $"optunasharp-cli-qa61-{Guid.NewGuid():N}.db"); + _tempFiles.Add(path); + string url = "sqlite:///" + path.Replace('\\', '/'); + var study = Optuna.CreateStudy(studyName: "q", storage: new RDBStorage(url)); + study.AddTrial(FrozenTrial.CreateTrial( + value: 1e16, + @params: new OrderedDict<string, object?> { ["x"] = 1e-07, ["y"] = 2.0 }, + distributions: new OrderedDict<string, BaseDistribution> + { + ["x"] = new FloatDistribution(0, 1), + ["y"] = new FloatDistribution(0, 5), + })); + + string yaml = Run(out int exitCode, "trials", "--storage", url, "--study-name", "q", "-f", "yaml"); + + exitCode.Should().Be(0); + yaml.Should().Contain(" x: 1.0e-07\n"); + yaml.Should().Contain(" y: 2.0\n"); + yaml.Should().Contain(" value: 1.0e+16\n"); + yaml.Should().MatchRegex(@"datetime_start: '\d{4}-\d\d-\d\d \d\d:\d\d:\d\d'"); + } + + /// <summary> + /// QA-63: <c>tell --state fail</c> and <c>tell --state pruned</c> without <c>--values</c> must finish the trial in + /// that state, as Optuna's CLI does. The port's <c>--values</c> option yields an empty array (not null) when it + /// is omitted, so Core's <c>tell</c> sees values next to a PRUNED / FAIL state and refuses the call: the command + /// dies with <c>Unhandled exception: NumSharp.ValueError: Values were told. Values cannot be specified when state + /// is TrialState.PRUNED or TrialState.FAIL.</c>, exits 1, and the trial stays RUNNING. + /// </summary> + /// <remarks> + /// <para> + /// Optuna 5.0.0: <c>optuna tell --storage … --study-name s --trial-number 0 --state fail</c> logs "Told + /// trial 0 with values None and state TrialState.FAIL." and exits 0 (argparse's <c>nargs="+"</c> option + /// defaults to <c>None</c>). Marking a failed or pruned trial from a shell script is the CLI's ask-and-tell + /// workflow, so this is the one finding of the run on a common path. + /// </para> + /// <para> + /// The same empty array changes a bare <c>tell --trial-number 2</c> (no values, no state): Optuna warns + /// "The value None could not be cast to float." and logs "Told trial 1 with values None and state None."; + /// the port warns "The number of the values 0 did not match the number of the objectives 1" and logs "with + /// values []". Both fail the trial. <c>CliParityTests</c>' setup runs these two commands too, but ignores + /// their exit codes, so its fixture silently kept two RUNNING trials. + /// </para> + /// <para> + /// <b>Fixed 2026-11-12:</b> an omitted <c>--values</c> binds <c>null</c>, as <c>--directions</c> already did. + /// </para> + /// </remarks> + [TestMethod] + public void Tell_StateWithoutValues_FinishesTheTrialLikeOptuna() + { + string path = Path.Combine(Path.GetTempPath(), $"optunasharp-cli-qa63-{Guid.NewGuid():N}.db"); + _tempFiles.Add(path); + string url = "sqlite:///" + path.Replace('\\', '/'); + const string space = + "{\"x\": {\"name\": \"FloatDistribution\", \"attributes\": {\"low\": 0.0, \"high\": 1.0, \"step\": null, \"log\": false}}}"; + + Run(out _, "create-study", "--storage", url, "--study-name", "s"); + Run(out _, "ask", "--storage", url, "--study-name", "s", "--search-space", space); + Run(out _, "ask", "--storage", url, "--study-name", "s", "--search-space", space); + + Run(out int failExit, "tell", "--storage", url, "--study-name", "s", "--trial-number", "0", "--state", "fail"); + Run(out int prunedExit, "tell", "--storage", url, "--study-name", "s", "--trial-number", "1", "--state", "pruned"); + + failExit.Should().Be(0); + prunedExit.Should().Be(0); + var trials = Optuna.LoadStudy("s", new RDBStorage(url)).Trials; + trials[0].State.Should().Be(TrialState.Fail); + trials[1].State.Should().Be(TrialState.Pruned); + } + + /// <summary> + /// QA-64: <c>--sampler-kwargs</c> values that are JSON objects or arrays must reach the sampler, as Optuna's + /// <c>getattr(optuna.samplers, name)(**kwargs)</c> passes them. The port's <c>SamplerFactory.TryCoerce</c> binds + /// only scalars (bool, string, int, long, double, float, enums), so <c>GridSampler</c>'s <c>search_space</c>, + /// <c>CmaEsSampler</c>'s <c>x0</c> and <c>NSGAIIISampler</c>'s <c>reference_points</c> make the command fail with + /// <c>Could not construct sampler 'GridSampler' from the given --sampler-kwargs ({search_space}).</c>. + /// </summary> + /// <remarks> + /// Optuna 5.0.0: <c>optuna ask … --search-space '{"x": FloatDistribution(0, 1)}' --sampler GridSampler + /// --sampler-kwargs '{"search_space": {"x": [0.5]}}'</c> prints <c>{"number": 0, "params": {"x": 0.5}}</c>; + /// <c>--sampler CmaEsSampler --sampler-kwargs '{"x0": {"x": 0.25}, "sigma0": 0.1, "seed": 1}'</c> and + /// <c>--sampler NSGAIIISampler --sampler-kwargs '{"reference_points": [[1.0]], "seed": 1}'</c> ask normally + /// (exit 0). The port exits 1 for all three. GridSampler is the natural CLI sampler for a shell-driven grid sweep. + /// <b>Fixed 2026-11-12:</b> <c>SamplerFactory</c> binds JSON objects to string-keyed dictionaries, JSON arrays to + /// lists, arrays and a rectangular <c>double[,]</c>, and grid values to <c>CategoricalChoice</c>. + /// </remarks> + [TestMethod] + public void Ask_StructuredSamplerKwargs_ConstructTheSamplerLikeOptuna() + { + string path = Path.Combine(Path.GetTempPath(), $"optunasharp-cli-qa64-{Guid.NewGuid():N}.db"); + _tempFiles.Add(path); + string url = "sqlite:///" + path.Replace('\\', '/'); + const string space = + "{\"x\": {\"name\": \"FloatDistribution\", \"attributes\": {\"low\": 0.0, \"high\": 1.0, \"step\": null, \"log\": false}}}"; + Run(out _, "create-study", "--storage", url, "--study-name", "s"); + + string grid = Run(out int gridExit, "ask", "--storage", url, "--study-name", "s", "--search-space", space, + "--sampler", "GridSampler", "--sampler-kwargs", "{\"search_space\": {\"x\": [0.5]}}"); + Run(out int cmaExit, "ask", "--storage", url, "--study-name", "s", "--search-space", space, + "--sampler", "CmaEsSampler", "--sampler-kwargs", "{\"x0\": {\"x\": 0.25}, \"sigma0\": 0.1, \"seed\": 1}"); + Run(out int nsga3Exit, "ask", "--storage", url, "--study-name", "s", "--search-space", space, + "--sampler", "NSGAIIISampler", "--sampler-kwargs", "{\"reference_points\": [[1.0]], \"seed\": 1}"); + + gridExit.Should().Be(0); + grid.Should().Be("{\"number\": 0, \"params\": {\"x\": 0.5}}\n"); + cmaExit.Should().Be(0); + nsga3Exit.Should().Be(0); + } + + /// <summary> + /// QA-65: Optuna's <c>--log-file</c> attaches a <c>logging.FileHandler</c> to Python's ROOT logger, but the + /// <c>optuna</c> logger is configured with <c>propagate = False</c>, so none of Optuna's records reach it and the + /// file stays empty. The port used to attach its file handler to Optuna's own logger, so the file received every + /// log line. Fixed 2026-11-12 by copying the defect (owner's decision, as for QA-46): the port creates the file + /// and writes nothing to it. + /// </summary> + /// <remarks> + /// Measured with Optuna 5.0.0: <c>optuna --log-file f.log create-study …</c> leaves <c>f.log</c> at 0 bytes, also + /// with <c>-v</c> and with <c>--debug</c> on a failing <c>delete-study</c>; stderr still shows the log lines (the + /// <c>optuna</c> logger's own handler). <c>optunasharp --log-file f.log create-study …</c> used to write + /// <c>[I …] A new study created in RDB with name: f</c>. The CLI runs as a separate process, as a real invocation + /// does, so nothing the command attaches outlives it. + /// </remarks> + [TestMethod] + public void LogFile_ReceivesNoOptunaRecords_LikeOptuna() + { + string path = Path.Combine(Path.GetTempPath(), $"optunasharp-cli-qa65-{Guid.NewGuid():N}.db"); + string logFile = Path.Combine(Path.GetTempPath(), $"optunasharp-cli-qa65-{Guid.NewGuid():N}.log"); + _tempFiles.Add(path); + _tempFiles.Add(logFile); + string url = "sqlite:///" + path.Replace('\\', '/'); + + string host = Environment.GetEnvironmentVariable("DOTNET_HOST_PATH") is { Length: > 0 } h ? h : "dotnet"; + var psi = new System.Diagnostics.ProcessStartInfo(host) + { + UseShellExecute = false, + RedirectStandardOutput = true, + RedirectStandardError = true, + }; + foreach (string a in new[] + { + Path.Combine(AppContext.BaseDirectory, "OptunaSharp.Cli.dll"), + "--log-file", logFile, "create-study", "--storage", url, "--study-name", "f", + }) + psi.ArgumentList.Add(a); + using (var process = System.Diagnostics.Process.Start(psi)!) + { + // Drain both pipes before waiting, so the child never blocks on a full pipe. + var stdout = process.StandardOutput.ReadToEndAsync(); + var stderr = process.StandardError.ReadToEndAsync(); + process.WaitForExit(120_000).Should().BeTrue("the CLI finishes within two minutes"); + stdout.GetAwaiter().GetResult(); + stderr.GetAwaiter().GetResult(); + process.ExitCode.Should().Be(0); + } + + File.Exists(logFile).Should().BeTrue("Optuna's FileHandler creates the file"); + File.ReadAllText(logFile).Should().BeEmpty("Optuna's records never propagate to the root logger's file handler"); + } +} diff --git a/test/OptunaSharp.Tests.Cli/oracle/gen_pyyaml_oracle.py b/test/OptunaSharp.Tests.Cli/oracle/gen_pyyaml_oracle.py new file mode 100644 index 0000000..80d1f31 --- /dev/null +++ b/test/OptunaSharp.Tests.Cli/oracle/gen_pyyaml_oracle.py @@ -0,0 +1,186 @@ +"""Regenerates oracle/pyyaml_safe_dump.json: value trees and PyYAML's yaml.safe_dump output for each. + +The CLI's `-f yaml` output must be PyYAML's safe_dump byte for byte (QA-61 of docs/qa/PARITY_QA_2026-11-10.md), so +`PyYamlSafeDumpOracleTests` replays this corpus through `PyYamlSafeDump.Dump` with no Python at test time. + +Each case is {"tree": <tagged tree>, "yaml": <safe_dump output>}. The tree is tagged so C# rebuilds exact Python +types: {"d": [[key, value], ...]} a dict (items in insertion order; safe_dump sorts them), {"l": [...]} a list, +{"s": "..."} a str, {"i": "123"} an int (decimal text), {"f": <int64 bits>} a float (its IEEE-754 bits, so NaN, +infinities and -0.0 survive JSON), {"b": true} a bool, {"n": null} None. + +The cases are the CLI's shapes (a record or a list of records, nested params / user_attrs, empty collections) filled +with the scalars that decide PyYAML's style: YAML 1.1 look-alikes (bools, ints, floats, sexagesimals, timestamps, +null, merge, value), indicators in every position, quotes, leading / trailing / doubled spaces, line breaks, control +and non-ASCII characters (allow_unicode=False escapes them), astral characters, and strings long enough to fold at +80 columns, plus keys of 127 to 129 characters around the simple-key limit. Seeded, so a rerun is identical for the +same PyYAML. + +usage: python gen_pyyaml_oracle.py (writes pyyaml_safe_dump.json next to this script) +""" +import json +import math +import os +import random +import struct + +import yaml + +TRICKY = [ + "", " ", "a", "y", "n", "yes", "No", "OFF", "on", "true", "False", "null", "Null", "~", "<<", "=", "!", "&", "*", + "0", "1", "-1", "+1", "007", "0b101", "0x1F", "0o7", "1_000", "1:30", "190:20:30", "1.5", "-1.5", ".5", "1e3", + "1.0e+3", "1.e3", ".inf", "-.Inf", ".NaN", "nan", "inf", "1:30.5", "2026-11-10", "2026-11-10 22:51:17", + "2026-11-10T22:51:17Z", "2026-1-2 3:04:05.5 +09:00", "0:00:00.012345", "2001-12-14t21:59:43.10-05:00", + "- a", "-a", "-", "--", "---", "...", "--- x", "? a", "?a", ": a", ":a", "a:b", "a: b", "a :b", "a:", "a #b", "a#b", + "#a", "[a]", "a[0]", "{a}", "a,b", "a, b", "&x", "*x", "!x", "|", "|x", ">", ">x", "'", "it's", "''", '"', 'say "hi"', + "%x", "@x", "`x`", "a\tb", "\ta", "a\t", " a", "a ", "a b", "a\nb", "a\n", "\na", "a\n\nb", "a \nb", "a\n b", + "\x07", "a\x00b", "\x85", "\u2028", "\u2029", "\ufeff", "\xa0", "é", "naïve", "日本語", "😀", "a😀b", "\\", "a\\b", + "C:\\path\\to", "http://x.y/z?q=1#f", "key: value # comment", "{\"a\": [1, 2]}", + "word " * 20, "word " * 40, "x" * 100, "a " * 50 + "b", "aa bb " * 15 + "é", "é " * 60, "line one\nline two " * 6, + "it's " * 25, " two leading", "trailing two ", "a" * 79 + " b", "a" * 80 + " b c", +] + +FLOATS = [0.0, -0.0, 1.0, -1.0, 2.0, 0.1, 1e-07, 1e16, 1e17, 1.5e300, 5e-324, 1e22, 123456789.123, -2.5e-10, + float("nan"), float("inf"), float("-inf"), 3.141592653589793, 100.0, 1e100] +INTS = [0, 1, -1, 7, 42, 2 ** 31, 2 ** 53 + 1, -(2 ** 40), 10 ** 18] + + +def tag(value): + """Tags a Python value for the C# side (see the module docstring). + + Args: + value: None, a bool, int, float, str, dict, list or tuple (tuples tag as lists, as safe_dump writes them). + + Returns: + The tagged form: a one-key dict whose key names the type. + + Raises: + TypeError: The value (or something nested in it) has another type, which the corpus never produces. + """ + if value is None: + return {"n": None} + if isinstance(value, bool): + return {"b": value} + if isinstance(value, int): + return {"i": str(value)} + if isinstance(value, float): + return {"f": struct.unpack("<q", struct.pack("<d", value))[0]} + if isinstance(value, str): + return {"s": value} + if isinstance(value, dict): + return {"d": [[tag(k), tag(v)] for k, v in value.items()]} + if isinstance(value, (list, tuple)): + return {"l": [tag(v) for v in value]} + raise TypeError(type(value)) + + +def scalar(rng): + """A random scalar of any kind safe_dump represents. + + Args: + rng: The seeded random.Random driving the corpus, so a rerun is identical. + + Returns: + A tricky string (55%), a float (20%), an int (15%), or True / False / None. + """ + kind = rng.random() + if kind < 0.55: + return rng.choice(TRICKY) + if kind < 0.75: + return rng.choice(FLOATS) + if kind < 0.9: + return rng.choice(INTS) + return rng.choice([True, False, None]) + + +def key(rng): + """A random mapping key: mostly strings, sometimes long ones around the 128-character simple-key limit. + + Args: + rng: The seeded random.Random driving the corpus. + + Returns: + A string key; one in twenty is 127, 128 or 129 characters, so both sides of the limit are covered. + """ + if rng.random() < 0.05: + return "k" * rng.choice([127, 128, 129]) + return rng.choice(TRICKY + ["x", "y", "lr", "n_estimators", "max_depth", "params", "value", "values", "z9"]) + + +def tree(rng, depth): + """A random value: nested dicts and lists to `depth`, scalars at the leaves. + + Args: + rng: The seeded random.Random driving the corpus. + depth: How many more levels of nesting are allowed; 0 forces a scalar. + + Returns: + A scalar, a dict of up to four items or a list of up to four items (empty ones included). + """ + if depth == 0 or rng.random() < 0.35: + return scalar(rng) + if rng.random() < 0.55: + return {key(rng): tree(rng, depth - 1) for _ in range(rng.randint(0, 4))} + return [tree(rng, depth - 1) for _ in range(rng.randint(0, 4))] + + +def record(rng): + """A CLI-like trial record: the columns `optuna trials -f yaml` prints, with random contents. + + Args: + rng: The seeded random.Random driving the corpus. + + Returns: + A dict with number, value, the formatted datetimes and duration, params, user_attrs, state and, for about a + third, a multi-objective values list. + """ + rec = { + "number": rng.randint(0, 99), + "value": rng.choice(FLOATS + INTS + [None]), + "datetime_start": "2026-11-10 22:51:17", + "datetime_complete": rng.choice(["2026-11-10 22:51:18", None]), + "duration": rng.choice(["0:00:00.012345", "0:00:01", None]), + "params": {key(rng): scalar(rng) for _ in range(rng.randint(0, 4))}, + "user_attrs": {key(rng): tree(rng, 2) for _ in range(rng.randint(0, 3))}, + "state": rng.choice(["COMPLETE", "FAIL", "PRUNED", "RUNNING"]), + } + if rng.random() < 0.3: + rec["values"] = [rng.choice(FLOATS) for _ in range(rng.randint(1, 3))] + return rec + + +def main(): + """Builds the corpus and writes pyyaml_safe_dump.json next to this script. + + Raises: + OSError: The JSON file cannot be written. + """ + rng = random.Random(20261112) + cases = [] + # Every tricky string as a value and as a key, alone, so each one's style is pinned on its own. + for s in TRICKY: + cases.append({"v": s}) + cases.append({s: 1}) + cases.append([s]) + for f in FLOATS: + cases.append({"f": f}) + for i in INTS: + cases.append({"i": i}) + cases += [{}, [], [{}], [[]], {"a": {}}, {"a": []}, [[1, [2, [3]]]], {"a": [{"b": [1, 2]}, {"c": {}}]}, + {3: "a", 1: "b", 2.5: "c"}, {"k" * 127: 1, "k" * 128: 2, "k" * 129: [1, 2]}] + for _ in range(150): + cases.append(record(rng)) + for _ in range(40): + cases.append([record(rng) for _ in range(rng.randint(1, 3))]) + for _ in range(150): + cases.append(tree(rng, 4)) + + out = [{"tree": tag(c), "yaml": yaml.safe_dump(c)} for c in cases] + path = os.path.join(os.path.dirname(os.path.abspath(__file__)), "pyyaml_safe_dump.json") + with open(path, "w", encoding="utf-8", newline="\n") as f: + json.dump({"pyyaml": yaml.__version__, "cases": out}, f, ensure_ascii=True, indent=0) + f.write("\n") + print("wrote %d cases (PyYAML %s) to %s" % (len(out), yaml.__version__, path)) + + +if __name__ == "__main__": + main() diff --git a/test/OptunaSharp.Tests.Cli/oracle/pyyaml_safe_dump.json b/test/OptunaSharp.Tests.Cli/oracle/pyyaml_safe_dump.json new file mode 100644 index 0000000..e2b4dab --- /dev/null +++ b/test/OptunaSharp.Tests.Cli/oracle/pyyaml_safe_dump.json @@ -0,0 +1,44253 @@ +{ +"pyyaml": "6.0.3", +"cases": [ +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "" +} +] +] +}, +"yaml": "v: ''\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "? ''\n: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "" +} +] +}, +"yaml": "- ''\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": " " +} +] +] +}, +"yaml": "v: ' '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": " " +}, +{ +"i": "1" +} +] +] +}, +"yaml": "' ': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": " " +} +] +}, +"yaml": "- ' '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a" +} +] +] +}, +"yaml": "v: a\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "a: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a" +} +] +}, +"yaml": "- a\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "y" +} +] +] +}, +"yaml": "v: y\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "y" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "y: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "y" +} +] +}, +"yaml": "- y\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "n" +} +] +] +}, +"yaml": "v: n\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "n" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "n: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "n" +} +] +}, +"yaml": "- n\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "yes" +} +] +] +}, +"yaml": "v: 'yes'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "yes" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'yes': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "yes" +} +] +}, +"yaml": "- 'yes'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "No" +} +] +] +}, +"yaml": "v: 'No'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "No" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'No': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "No" +} +] +}, +"yaml": "- 'No'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "OFF" +} +] +] +}, +"yaml": "v: 'OFF'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "OFF" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'OFF': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "OFF" +} +] +}, +"yaml": "- 'OFF'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "on" +} +] +] +}, +"yaml": "v: 'on'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "on" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'on': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "on" +} +] +}, +"yaml": "- 'on'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "true" +} +] +] +}, +"yaml": "v: 'true'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "true" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'true': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "true" +} +] +}, +"yaml": "- 'true'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "False" +} +] +] +}, +"yaml": "v: 'False'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "False" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'False': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "False" +} +] +}, +"yaml": "- 'False'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "null" +} +] +] +}, +"yaml": "v: 'null'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "null" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'null': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "null" +} +] +}, +"yaml": "- 'null'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "Null" +} +] +] +}, +"yaml": "v: 'Null'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "Null" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'Null': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "Null" +} +] +}, +"yaml": "- 'Null'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "~" +} +] +] +}, +"yaml": "v: '~'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "~" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'~': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "~" +} +] +}, +"yaml": "- '~'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "<<" +} +] +] +}, +"yaml": "v: '<<'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "<<" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'<<': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "<<" +} +] +}, +"yaml": "- '<<'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "=" +} +] +] +}, +"yaml": "v: '='\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "=" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'=': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "=" +} +] +}, +"yaml": "- '='\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "!" +} +] +] +}, +"yaml": "v: '!'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "!" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'!': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "!" +} +] +}, +"yaml": "- '!'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "&" +} +] +] +}, +"yaml": "v: '&'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "&" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'&': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "&" +} +] +}, +"yaml": "- '&'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "*" +} +] +] +}, +"yaml": "v: '*'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "*" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'*': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "*" +} +] +}, +"yaml": "- '*'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "0" +} +] +] +}, +"yaml": "v: '0'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "0" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'0': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "0" +} +] +}, +"yaml": "- '0'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "1" +} +] +] +}, +"yaml": "v: '1'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "1" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'1': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "1" +} +] +}, +"yaml": "- '1'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "-1" +} +] +] +}, +"yaml": "v: '-1'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "-1" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'-1': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "-1" +} +] +}, +"yaml": "- '-1'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "+1" +} +] +] +}, +"yaml": "v: '+1'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "+1" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'+1': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "+1" +} +] +}, +"yaml": "- '+1'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "007" +} +] +] +}, +"yaml": "v: '007'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "007" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'007': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "007" +} +] +}, +"yaml": "- '007'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "0b101" +} +] +] +}, +"yaml": "v: '0b101'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "0b101" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'0b101': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "0b101" +} +] +}, +"yaml": "- '0b101'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "0x1F" +} +] +] +}, +"yaml": "v: '0x1F'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "0x1F" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'0x1F': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "0x1F" +} +] +}, +"yaml": "- '0x1F'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "0o7" +} +] +] +}, +"yaml": "v: 0o7\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "0o7" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "0o7: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "0o7" +} +] +}, +"yaml": "- 0o7\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "1_000" +} +] +] +}, +"yaml": "v: '1_000'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "1_000" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'1_000': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "1_000" +} +] +}, +"yaml": "- '1_000'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "1:30" +} +] +] +}, +"yaml": "v: '1:30'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "1:30" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'1:30': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "1:30" +} +] +}, +"yaml": "- '1:30'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "190:20:30" +} +] +] +}, +"yaml": "v: '190:20:30'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "190:20:30" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'190:20:30': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "190:20:30" +} +] +}, +"yaml": "- '190:20:30'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "1.5" +} +] +] +}, +"yaml": "v: '1.5'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "1.5" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'1.5': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "1.5" +} +] +}, +"yaml": "- '1.5'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "-1.5" +} +] +] +}, +"yaml": "v: '-1.5'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "-1.5" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'-1.5': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "-1.5" +} +] +}, +"yaml": "- '-1.5'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": ".5" +} +] +] +}, +"yaml": "v: '.5'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": ".5" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'.5': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": ".5" +} +] +}, +"yaml": "- '.5'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "1e3" +} +] +] +}, +"yaml": "v: 1e3\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "1e3" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "1e3: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "1e3" +} +] +}, +"yaml": "- 1e3\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "1.0e+3" +} +] +] +}, +"yaml": "v: '1.0e+3'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "1.0e+3" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'1.0e+3': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "1.0e+3" +} +] +}, +"yaml": "- '1.0e+3'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "1.e3" +} +] +] +}, +"yaml": "v: 1.e3\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "1.e3" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "1.e3: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "1.e3" +} +] +}, +"yaml": "- 1.e3\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": ".inf" +} +] +] +}, +"yaml": "v: '.inf'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": ".inf" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'.inf': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": ".inf" +} +] +}, +"yaml": "- '.inf'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "-.Inf" +} +] +] +}, +"yaml": "v: '-.Inf'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "-.Inf" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'-.Inf': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "-.Inf" +} +] +}, +"yaml": "- '-.Inf'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": ".NaN" +} +] +] +}, +"yaml": "v: '.NaN'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": ".NaN" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'.NaN': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": ".NaN" +} +] +}, +"yaml": "- '.NaN'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "nan" +} +] +] +}, +"yaml": "v: nan\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "nan" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "nan: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "nan" +} +] +}, +"yaml": "- nan\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "inf" +} +] +] +}, +"yaml": "v: inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "inf" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "inf: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "inf" +} +] +}, +"yaml": "- inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "1:30.5" +} +] +] +}, +"yaml": "v: '1:30.5'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "1:30.5" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'1:30.5': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "1:30.5" +} +] +}, +"yaml": "- '1:30.5'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "2026-11-10" +} +] +] +}, +"yaml": "v: '2026-11-10'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "2026-11-10" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'2026-11-10': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "2026-11-10" +} +] +}, +"yaml": "- '2026-11-10'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "2026-11-10 22:51:17" +} +] +] +}, +"yaml": "v: '2026-11-10 22:51:17'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'2026-11-10 22:51:17': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "2026-11-10 22:51:17" +} +] +}, +"yaml": "- '2026-11-10 22:51:17'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "2026-11-10T22:51:17Z" +} +] +] +}, +"yaml": "v: '2026-11-10T22:51:17Z'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "2026-11-10T22:51:17Z" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'2026-11-10T22:51:17Z': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "2026-11-10T22:51:17Z" +} +] +}, +"yaml": "- '2026-11-10T22:51:17Z'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "2026-1-2 3:04:05.5 +09:00" +} +] +] +}, +"yaml": "v: '2026-1-2 3:04:05.5 +09:00'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "2026-1-2 3:04:05.5 +09:00" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'2026-1-2 3:04:05.5 +09:00': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "2026-1-2 3:04:05.5 +09:00" +} +] +}, +"yaml": "- '2026-1-2 3:04:05.5 +09:00'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "0:00:00.012345" +} +] +] +}, +"yaml": "v: '0:00:00.012345'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "0:00:00.012345" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'0:00:00.012345': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "0:00:00.012345" +} +] +}, +"yaml": "- '0:00:00.012345'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "2001-12-14t21:59:43.10-05:00" +} +] +] +}, +"yaml": "v: '2001-12-14t21:59:43.10-05:00'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "2001-12-14t21:59:43.10-05:00" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'2001-12-14t21:59:43.10-05:00': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "2001-12-14t21:59:43.10-05:00" +} +] +}, +"yaml": "- '2001-12-14t21:59:43.10-05:00'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "- a" +} +] +] +}, +"yaml": "v: '- a'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "- a" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'- a': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "- a" +} +] +}, +"yaml": "- '- a'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "-a" +} +] +] +}, +"yaml": "v: -a\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "-a" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "-a: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "-a" +} +] +}, +"yaml": "- -a\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "-" +} +] +] +}, +"yaml": "v: '-'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "-" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'-': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "-" +} +] +}, +"yaml": "- '-'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "--" +} +] +] +}, +"yaml": "v: --\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "--" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "--: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "--" +} +] +}, +"yaml": "- --\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "---" +} +] +] +}, +"yaml": "v: '---'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "---" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'---': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "---" +} +] +}, +"yaml": "- '---'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "..." +} +] +] +}, +"yaml": "v: '...'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "..." +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'...': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "..." +} +] +}, +"yaml": "- '...'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "--- x" +} +] +] +}, +"yaml": "v: '--- x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "--- x" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'--- x': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "--- x" +} +] +}, +"yaml": "- '--- x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "? a" +} +] +] +}, +"yaml": "v: '? a'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "? a" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'? a': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "? a" +} +] +}, +"yaml": "- '? a'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "?a" +} +] +] +}, +"yaml": "v: ?a\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "?a" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "?a: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "?a" +} +] +}, +"yaml": "- ?a\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": ": a" +} +] +] +}, +"yaml": "v: ': a'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": ": a" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "': a': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": ": a" +} +] +}, +"yaml": "- ': a'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": ":a" +} +] +] +}, +"yaml": "v: :a\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": ":a" +}, +{ +"i": "1" +} +] +] +}, +"yaml": ":a: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": ":a" +} +] +}, +"yaml": "- :a\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a:b" +} +] +] +}, +"yaml": "v: a:b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a:b" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "a:b: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a:b" +} +] +}, +"yaml": "- a:b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a: b" +} +] +] +}, +"yaml": "v: 'a: b'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a: b" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'a: b': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a: b" +} +] +}, +"yaml": "- 'a: b'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a :b" +} +] +] +}, +"yaml": "v: a :b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a :b" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "a :b: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a :b" +} +] +}, +"yaml": "- a :b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a:" +} +] +] +}, +"yaml": "v: 'a:'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a:" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'a:': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a:" +} +] +}, +"yaml": "- 'a:'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a #b" +} +] +] +}, +"yaml": "v: 'a #b'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a #b" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'a #b': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a #b" +} +] +}, +"yaml": "- 'a #b'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a#b" +} +] +] +}, +"yaml": "v: a#b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a#b" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "a#b: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a#b" +} +] +}, +"yaml": "- a#b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "#a" +} +] +] +}, +"yaml": "v: '#a'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "#a" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'#a': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "#a" +} +] +}, +"yaml": "- '#a'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "[a]" +} +] +] +}, +"yaml": "v: '[a]'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "[a]" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'[a]': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "[a]" +} +] +}, +"yaml": "- '[a]'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a[0]" +} +] +] +}, +"yaml": "v: a[0]\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a[0]" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "a[0]: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a[0]" +} +] +}, +"yaml": "- a[0]\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "{a}" +} +] +] +}, +"yaml": "v: '{a}'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "{a}" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'{a}': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "{a}" +} +] +}, +"yaml": "- '{a}'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a,b" +} +] +] +}, +"yaml": "v: a,b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a,b" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "a,b: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a,b" +} +] +}, +"yaml": "- a,b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a, b" +} +] +] +}, +"yaml": "v: a, b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a, b" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "a, b: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a, b" +} +] +}, +"yaml": "- a, b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "&x" +} +] +] +}, +"yaml": "v: '&x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "&x" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'&x': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "&x" +} +] +}, +"yaml": "- '&x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "*x" +} +] +] +}, +"yaml": "v: '*x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "*x" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'*x': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "*x" +} +] +}, +"yaml": "- '*x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "!x" +} +] +] +}, +"yaml": "v: '!x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "!x" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'!x': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "!x" +} +] +}, +"yaml": "- '!x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "|" +} +] +] +}, +"yaml": "v: '|'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "|" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'|': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "|" +} +] +}, +"yaml": "- '|'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "|x" +} +] +] +}, +"yaml": "v: '|x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "|x" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'|x': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "|x" +} +] +}, +"yaml": "- '|x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": ">" +} +] +] +}, +"yaml": "v: '>'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": ">" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'>': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": ">" +} +] +}, +"yaml": "- '>'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": ">x" +} +] +] +}, +"yaml": "v: '>x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": ">x" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'>x': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": ">x" +} +] +}, +"yaml": "- '>x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "'" +} +] +] +}, +"yaml": "v: ''''\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "'" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'''': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "'" +} +] +}, +"yaml": "- ''''\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "it's" +} +] +] +}, +"yaml": "v: it's\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "it's" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "it's: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "it's" +} +] +}, +"yaml": "- it's\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "''" +} +] +] +}, +"yaml": "v: ''''''\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "''" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'''''': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "''" +} +] +}, +"yaml": "- ''''''\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "\"" +} +] +] +}, +"yaml": "v: '\"'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\"" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'\"': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\"" +} +] +}, +"yaml": "- '\"'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "say \"hi\"" +} +] +] +}, +"yaml": "v: say \"hi\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "say \"hi\"" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "say \"hi\": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "say \"hi\"" +} +] +}, +"yaml": "- say \"hi\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "%x" +} +] +] +}, +"yaml": "v: '%x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "%x" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'%x': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "%x" +} +] +}, +"yaml": "- '%x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "@x" +} +] +] +}, +"yaml": "v: '@x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "@x" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'@x': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "@x" +} +] +}, +"yaml": "- '@x'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "`x`" +} +] +] +}, +"yaml": "v: '`x`'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "`x`" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'`x`': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "`x`" +} +] +}, +"yaml": "- '`x`'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a\tb" +} +] +] +}, +"yaml": "v: \"a\\tb\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\tb" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\"a\\tb\": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a\tb" +} +] +}, +"yaml": "- \"a\\tb\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "\ta" +} +] +] +}, +"yaml": "v: \"\\ta\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\ta" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\"\\ta\": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\ta" +} +] +}, +"yaml": "- \"\\ta\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a\t" +} +] +] +}, +"yaml": "v: \"a\\t\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\t" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\"a\\t\": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a\t" +} +] +}, +"yaml": "- \"a\\t\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": " a" +} +] +] +}, +"yaml": "v: ' a'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": " a" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "' a': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": " a" +} +] +}, +"yaml": "- ' a'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a " +} +] +] +}, +"yaml": "v: 'a '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a " +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'a ': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a " +} +] +}, +"yaml": "- 'a '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a b" +} +] +] +}, +"yaml": "v: a b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a b" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "a b: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a b" +} +] +}, +"yaml": "- a b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a\nb" +} +] +] +}, +"yaml": "v: 'a\n\n b'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\nb" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "? 'a\n\n b'\n: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a\nb" +} +] +}, +"yaml": "- 'a\n\n b'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a\n" +} +] +] +}, +"yaml": "v: 'a\n\n '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\n" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "? 'a\n\n '\n: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a\n" +} +] +}, +"yaml": "- 'a\n\n '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "\na" +} +] +] +}, +"yaml": "v: '\n\n a'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\na" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "? '\n\n a'\n: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\na" +} +] +}, +"yaml": "- '\n\n a'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a\n\nb" +} +] +] +}, +"yaml": "v: 'a\n\n\n b'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\n\nb" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "? 'a\n\n\n b'\n: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a\n\nb" +} +] +}, +"yaml": "- 'a\n\n\n b'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a \nb" +} +] +] +}, +"yaml": "v: \"a \\nb\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a \nb" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "? \"a \\nb\"\n: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a \nb" +} +] +}, +"yaml": "- \"a \\nb\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a\n b" +} +] +] +}, +"yaml": "v: \"a\\n b\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\n b" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "? \"a\\n b\"\n: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a\n b" +} +] +}, +"yaml": "- \"a\\n b\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "\u0007" +} +] +] +}, +"yaml": "v: \"\\a\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\u0007" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\"\\a\": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\u0007" +} +] +}, +"yaml": "- \"\\a\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a\u0000b" +} +] +] +}, +"yaml": "v: \"a\\0b\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\u0000b" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\"a\\0b\": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a\u0000b" +} +] +}, +"yaml": "- \"a\\0b\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "\u0085" +} +] +] +}, +"yaml": "v: \"\\N\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\u0085" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "? \"\\N\"\n: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\u0085" +} +] +}, +"yaml": "- \"\\N\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "\u2028" +} +] +] +}, +"yaml": "v: \"\\L\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\u2028" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "? \"\\L\"\n: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\u2028" +} +] +}, +"yaml": "- \"\\L\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "\u2029" +} +] +] +}, +"yaml": "v: \"\\P\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\u2029" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "? \"\\P\"\n: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\u2029" +} +] +}, +"yaml": "- \"\\P\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "\ufeff" +} +] +] +}, +"yaml": "v: \"\\uFEFF\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\ufeff" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\"\\uFEFF\": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\ufeff" +} +] +}, +"yaml": "- \"\\uFEFF\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "\u00a0" +} +] +] +}, +"yaml": "v: \"\\_\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\u00a0" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\"\\_\": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\u00a0" +} +] +}, +"yaml": "- \"\\_\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "\u00e9" +} +] +] +}, +"yaml": "v: \"\\xE9\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\u00e9" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\"\\xE9\": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\u00e9" +} +] +}, +"yaml": "- \"\\xE9\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "na\u00efve" +} +] +] +}, +"yaml": "v: \"na\\xEFve\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "na\u00efve" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\"na\\xEFve\": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "na\u00efve" +} +] +}, +"yaml": "- \"na\\xEFve\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "\u65e5\u672c\u8a9e" +} +] +] +}, +"yaml": "v: \"\\u65E5\\u672C\\u8A9E\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\"\\u65E5\\u672C\\u8A9E\": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\u65e5\u672c\u8a9e" +} +] +}, +"yaml": "- \"\\u65E5\\u672C\\u8A9E\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "\ud83d\ude00" +} +] +] +}, +"yaml": "v: \"\\U0001F600\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\ud83d\ude00" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\"\\U0001F600\": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\ud83d\ude00" +} +] +}, +"yaml": "- \"\\U0001F600\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a\ud83d\ude00b" +} +] +] +}, +"yaml": "v: \"a\\U0001F600b\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\"a\\U0001F600b\": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a\ud83d\ude00b" +} +] +}, +"yaml": "- \"a\\U0001F600b\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "\\" +} +] +] +}, +"yaml": "v: \\\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\\" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\\: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\\" +} +] +}, +"yaml": "- \\\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "a\\b" +} +] +] +}, +"yaml": "v: a\\b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\\b" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "a\\b: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a\\b" +} +] +}, +"yaml": "- a\\b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "C:\\path\\to" +} +] +] +}, +"yaml": "v: C:\\path\\to\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "C:\\path\\to" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "C:\\path\\to: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "C:\\path\\to" +} +] +}, +"yaml": "- C:\\path\\to\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "http://x.y/z?q=1#f" +} +] +] +}, +"yaml": "v: http://x.y/z?q=1#f\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "http://x.y/z?q=1#f: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "http://x.y/z?q=1#f" +} +] +}, +"yaml": "- http://x.y/z?q=1#f\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "key: value # comment" +} +] +] +}, +"yaml": "v: 'key: value # comment'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "key: value # comment" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'key: value # comment': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "key: value # comment" +} +] +}, +"yaml": "- 'key: value # comment'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "{\"a\": [1, 2]}" +} +] +] +}, +"yaml": "v: '{\"a\": [1, 2]}'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'{\"a\": [1, 2]}': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "{\"a\": [1, 2]}" +} +] +}, +"yaml": "- '{\"a\": [1, 2]}'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +} +] +] +}, +"yaml": "v: 'word word word word word word word word word word word word word word word word\n word word word word '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'word word word word word word word word word word word word word word word word word word word word ': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +} +] +}, +"yaml": "- 'word word word word word word word word word word word word word word word word\n word word word word '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +} +] +] +}, +"yaml": "v: 'word word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"i": "1" +} +] +] +}, +"yaml": "? 'word word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word '\n: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +} +] +}, +"yaml": "- 'word word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +} +] +] +}, +"yaml": "v: xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +} +] +}, +"yaml": "- xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "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 b" +} +] +] +}, +"yaml": "v: 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\n a a a a a a a a a a b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "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 b" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "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 b: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "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 b" +} +] +}, +"yaml": "- 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\n a a a a a a a a a a b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +} +] +] +}, +"yaml": "v: \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb\\\n \\ aa bb aa bb \\xE9\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \\xE9\": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +} +] +}, +"yaml": "- \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa\\\n \\ bb aa bb \\xE9\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +} +] +] +}, +"yaml": "v: \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"i": "1" +} +] +] +}, +"yaml": "\"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \": 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +} +] +}, +"yaml": "- \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +} +] +] +}, +"yaml": "v: 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +}, +{ +"i": "1" +} +] +] +}, +"yaml": "? 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +} +] +}, +"yaml": "- 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +} +] +] +}, +"yaml": "v: 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"i": "1" +} +] +] +}, +"yaml": "? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +} +] +}, +"yaml": "- 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": " two leading" +} +] +] +}, +"yaml": "v: ' two leading'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": " two leading" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "' two leading': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": " two leading" +} +] +}, +"yaml": "- ' two leading'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "trailing two " +} +] +] +}, +"yaml": "v: 'trailing two '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "trailing two " +}, +{ +"i": "1" +} +] +] +}, +"yaml": "'trailing two ': 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "trailing two " +} +] +}, +"yaml": "- 'trailing two '\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +} +] +] +}, +"yaml": "v: aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +} +] +}, +"yaml": "- aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "v" +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +} +] +] +}, +"yaml": "v: aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b c\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c: 1\n" +}, +{ +"tree": { +"l": [ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +} +] +}, +"yaml": "- aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b c\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 0 +} +] +] +}, +"yaml": "f: 0.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": -9223372036854775808 +} +] +] +}, +"yaml": "f: -0.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 4607182418800017408 +} +] +] +}, +"yaml": "f: 1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": -4616189618054758400 +} +] +] +}, +"yaml": "f: -1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 4611686018427387904 +} +] +] +}, +"yaml": "f: 2.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 4591870180066957722 +} +] +] +}, +"yaml": "f: 0.1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 4502148214488346440 +} +] +] +}, +"yaml": "f: 1.0e-07\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 4846369599423283200 +} +] +] +}, +"yaml": "f: 1.0e+16\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 4861130398305394688 +} +] +] +}, +"yaml": "f: 1.0e+17\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 9097811302482466869 +} +] +] +}, +"yaml": "f: 1.5e+300\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 1 +} +] +] +}, +"yaml": "f: 5.0e-324\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 4936209963552724370 +} +] +] +}, +"yaml": "f: 1.0e+22\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 4728057454355411894 +} +] +] +}, +"yaml": "f: 123456789.123\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": -4759972702479526251 +} +] +] +}, +"yaml": "f: -2.5e-10\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 9221120237041090560 +} +] +] +}, +"yaml": "f: .nan\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 9218868437227405312 +} +] +] +}, +"yaml": "f: .inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": -4503599627370496 +} +] +] +}, +"yaml": "f: -.inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 4614256656552045848 +} +] +] +}, +"yaml": "f: 3.141592653589793\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 4636737291354636288 +} +] +] +}, +"yaml": "f: 100.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "f" +}, +{ +"f": 6103021453049119613 +} +] +] +}, +"yaml": "f: 1.0e+100\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "i" +}, +{ +"i": "0" +} +] +] +}, +"yaml": "i: 0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "i" +}, +{ +"i": "1" +} +] +] +}, +"yaml": "i: 1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "i" +}, +{ +"i": "-1" +} +] +] +}, +"yaml": "i: -1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "i" +}, +{ +"i": "7" +} +] +] +}, +"yaml": "i: 7\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "i" +}, +{ +"i": "42" +} +] +] +}, +"yaml": "i: 42\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "i" +}, +{ +"i": "2147483648" +} +] +] +}, +"yaml": "i: 2147483648\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "i" +}, +{ +"i": "9007199254740993" +} +] +] +}, +"yaml": "i: 9007199254740993\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "i" +}, +{ +"i": "-1099511627776" +} +] +] +}, +"yaml": "i: -1099511627776\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "i" +}, +{ +"i": "1000000000000000000" +} +] +] +}, +"yaml": "i: 1000000000000000000\n" +}, +{ +"tree": { +"d": [] +}, +"yaml": "{}\n" +}, +{ +"tree": { +"l": [] +}, +"yaml": "[]\n" +}, +{ +"tree": { +"l": [ +{ +"d": [] +} +] +}, +"yaml": "- {}\n" +}, +{ +"tree": { +"l": [ +{ +"l": [] +} +] +}, +"yaml": "- []\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a" +}, +{ +"d": [] +} +] +] +}, +"yaml": "a: {}\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a" +}, +{ +"l": [] +} +] +] +}, +"yaml": "a: []\n" +}, +{ +"tree": { +"l": [ +{ +"l": [ +{ +"i": "1" +}, +{ +"l": [ +{ +"i": "2" +}, +{ +"l": [ +{ +"i": "3" +} +] +} +] +} +] +} +] +}, +"yaml": "- - 1\n - - 2\n - - 3\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "b" +}, +{ +"l": [ +{ +"i": "1" +}, +{ +"i": "2" +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "c" +}, +{ +"d": [] +} +] +] +} +] +} +] +] +}, +"yaml": "a:\n- b:\n - 1\n - 2\n- c: {}\n" +}, +{ +"tree": { +"d": [ +[ +{ +"i": "3" +}, +{ +"s": "a" +} +], +[ +{ +"i": "1" +}, +{ +"s": "b" +} +], +[ +{ +"f": 4612811918334230528 +}, +{ +"s": "c" +} +] +] +}, +"yaml": "1: b\n2.5: c\n3: a\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"i": "1" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"i": "2" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [ +{ +"i": "1" +}, +{ +"i": "2" +} +] +} +] +] +}, +"yaml": "? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n: 1\n? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n: 2\n? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n: - 1\n - 2\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "26" +} +], +[ +{ +"s": "value" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "190:20:30" +}, +{ +"i": "7" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "values" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "\ta" +}, +{ +"f": 4614256656552045848 +} +] +] +}, +{ +"f": 1 +}, +{ +"d": [ +[ +{ +"s": "~" +}, +{ +"s": "&x" +} +], +[ +{ +"s": "&" +}, +{ +"s": "0" +} +], +[ +{ +"s": "\u00e9" +}, +{ +"s": "*x" +} +] +] +} +] +} +], +[ +{ +"s": "1e3" +}, +{ +"d": [ +[ +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +}, +{ +"l": [] +} +], +[ +{ +"s": ".inf" +}, +{ +"d": [] +} +], +[ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +} +], +[ +{ +"s": "values" +}, +{ +"s": "-.Inf" +} +] +] +} +], +[ +{ +"s": "a #b" +}, +{ +"s": "a " +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 26\nparams:\n '190:20:30': 7\nstate: FAIL\nuser_attrs:\n 1e3:\n '.inf': {}\n \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \\xE9\": []\n values: '-.Inf'\n \"\\u65E5\\u672C\\u8A9E\": 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n 'a #b': 'a '\n \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \":\n - \"\\ta\": 3.141592653589793\n values: 1.0e+16\n - 5.0e-324\n - '&': '0'\n '~': '&x'\n \"\\xE9\": '*x'\nvalue: 2147483648\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "63" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\ta" +}, +{ +"l": [ +{ +"l": [] +}, +{ +"l": [] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4502148214488346440 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 63\nparams: {}\nstate: RUNNING\nuser_attrs:\n \"\\ta\":\n - []\n - []\nvalue: 1.0e+16\nvalues:\n- 1.0e-07\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "33" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9218868437227405312 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": " a" +}, +{ +"s": "say \"hi\"" +} +], +[ +{ +"s": "False" +}, +{ +"f": 9218868437227405312 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1:30.5" +}, +{ +"d": [] +} +], +[ +{ +"s": "\na" +}, +{ +"s": "\u65e5\u672c\u8a9e" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 33\nparams:\n ' a': say \"hi\"\n 'False': .inf\nstate: RUNNING\nuser_attrs:\n ? '\n\n a'\n : \"\\u65E5\\u672C\\u8A9E\"\n '1:30.5': {}\nvalue: .inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "42" +} +], +[ +{ +"s": "value" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "lr" +}, +{ +"s": "2026-11-10" +} +], +[ +{ +"s": "=" +}, +{ +"s": "a b" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a :b" +}, +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +} +], +[ +{ +"s": "--" +}, +{ +"l": [ +{ +"d": [] +}, +{ +"s": "2026-11-10" +}, +{ +"d": [ +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"s": "http://x.y/z?q=1#f" +} +], +[ +{ +"s": "-1" +}, +{ +"s": "0b101" +} +] +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 42\nparams:\n '=': a b\n lr: '2026-11-10'\nstate: RUNNING\nuser_attrs:\n --:\n - {}\n - '2026-11-10'\n - '-1': '0b101'\n ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : http://x.y/z?q=1#f\n a :b: 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\nvalue: -1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "17" +} +], +[ +{ +"s": "value" +}, +{ +"f": 1 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "yes" +}, +{ +"s": "1.5" +} +], +[ +{ +"s": "nan" +}, +{ +"s": ": a" +} +], +[ +{ +"s": "a\n\nb" +}, +{ +"b": true +} +], +[ +{ +"s": "a \nb" +}, +{ +"f": 4591870180066957722 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": " two leading" +}, +{ +"i": "7" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 17\nparams:\n ? 'a\n\n\n b'\n : true\n ? \"a \\nb\"\n : 0.1\n nan: ': a'\n 'yes': '1.5'\nstate: RUNNING\nuser_attrs:\n ' two leading': 7\nvalue: 5.0e-324\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "44" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4759972702479526251 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "-1" +}, +{ +"f": -9223372036854775808 +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "a " +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [ +{ +"i": "9007199254740993" +}, +{ +"d": [ +[ +{ +"s": "1e3" +}, +{ +"s": "False" +} +], +[ +{ +"s": "&x" +}, +{ +"f": 0 +} +], +[ +{ +"s": "\ufeff" +}, +{ +"s": "say \"hi\"" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "trailing two " +}, +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "False" +}, +{ +"s": " a" +} +], +[ +{ +"s": "a\nb" +}, +{ +"s": "a\n\nb" +} +] +] +} +] +} +], +[ +{ +"s": "\u2029" +}, +{ +"f": 9221120237041090560 +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 44\nparams:\n '-1': -0.0\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 'a '\nstate: COMPLETE\nuser_attrs:\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : - 9007199254740993\n - '&x': 0.0\n 1e3: 'False'\n \"\\uFEFF\": say \"hi\"\n - ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : -1\n 'trailing two ': \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa\\\n \\ bb aa bb aa bb aa bb aa bb aa bb \\xE9\"\n - 'False': ' a'\n ? 'a\n\n b'\n : 'a\n\n\n b'\n ? \"\\P\"\n : .nan\nvalue: -2.5e-10\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "87" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "-1.5" +}, +{ +"s": "\u2028" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "n" +}, +{ +"d": [ +[ +{ +"s": "a\n b" +}, +{ +"d": [ +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"s": "a[0]" +} +], +[ +{ +"s": "a:b" +}, +{ +"s": "a\n\nb" +} +], +[ +{ +"s": "a[0]" +}, +{ +"s": " " +} +] +] +} +], +[ +{ +"s": "-1" +}, +{ +"d": [ +[ +{ +"s": "@x" +}, +{ +"s": "Null" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"i": "-1099511627776" +} +] +] +} +] +] +} +], +[ +{ +"s": "`x`" +}, +{ +"f": 1 +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 87\nparams:\n '-1.5': \"\\L\"\nstate: PRUNED\nuser_attrs:\n '`x`': 5.0e-324\n n:\n '-1':\n '@x': 'Null'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : -1099511627776\n ? \"a\\n b\"\n : a:b: 'a\n\n\n b'\n a[0]: ' '\n ? 'word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word\n word word word word word word word word word word '\n : a[0]\nvalue: 1.0e+16\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "48" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a:" +}, +{ +"d": [] +} +], +[ +{ +"s": "+1" +}, +{ +"l": [ +{ +"d": [] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -4616189618054758400 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 48\nparams: {}\nstate: FAIL\nuser_attrs:\n '+1':\n - {}\n 'a:': {}\nvalue: 1000000000000000000\nvalues:\n- -1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "83" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\u00e9" +}, +{ +"n": null +} +], +[ +{ +"s": "--- x" +}, +{ +"s": ">" +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"s": "it's" +} +], +[ +{ +"s": "true" +}, +{ +"s": "\ufeff" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [] +} +], +[ +{ +"s": "-1" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "-1" +}, +{ +"s": ".NaN" +} +], +[ +{ +"s": ">x" +}, +{ +"f": 9218868437227405312 +} +] +] +}, +{ +"d": [ +[ +{ +"s": "a #b" +}, +{ +"s": "inf" +} +], +[ +{ +"s": "\u0085" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": ".NaN" +}, +{ +"s": "a\n" +} +], +[ +{ +"s": "\u2029" +}, +{ +"s": "it's" +} +] +] +} +] +} +], +[ +{ +"s": "@x" +}, +{ +"s": "y" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 83\nparams:\n '--- x': '>'\n http://x.y/z?q=1#f: it's\n 'true': \"\\uFEFF\"\n \"\\xE9\": null\nstate: FAIL\nuser_attrs:\n '-1':\n - '-1': '.NaN'\n '>x': .inf\n - '.NaN': 'a\n\n '\n 'a #b': inf\n ? \"\\N\"\n : 1000000000000000000\n ? \"\\P\"\n : it's\n '@x': y\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : {}\nvalue: 1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "69" +} +], +[ +{ +"s": "value" +}, +{ +"f": 1 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "params" +}, +{ +"s": "2001-12-14t21:59:43.10-05:00" +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"s": "|" +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"f": 9218868437227405312 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\u2028" +}, +{ +"f": 9221120237041090560 +} +], +[ +{ +"s": "2026-11-10T22:51:17Z" +}, +{ +"s": "a#b" +} +], +[ +{ +"s": "?a" +}, +{ +"l": [ +{ +"s": "\u2029" +}, +{ +"i": "7" +}, +{ +"d": [ +[ +{ +"s": "\u00e9" +}, +{ +"b": false +} +], +[ +{ +"s": ".inf" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": ">" +}, +{ +"b": true +} +] +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 69\nparams:\n http://x.y/z?q=1#f: '|'\n params: '2001-12-14t21:59:43.10-05:00'\n ? 'word word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word '\n : .inf\nstate: FAIL\nuser_attrs:\n '2026-11-10T22:51:17Z': a#b\n ?a:\n - \"\\P\"\n - 7\n - '.inf': -1.0\n '>': true\n \"\\xE9\": false\n ? \"\\L\"\n : .nan\nvalue: 5.0e-324\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "99" +} +], +[ +{ +"s": "value" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "lr" +}, +{ +"f": 1 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "value" +}, +{ +"d": [ +[ +{ +"s": "007" +}, +{ +"s": "a\tb" +} +], +[ +{ +"s": "\\" +}, +{ +"d": [ +[ +{ +"s": "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 b" +}, +{ +"s": "yes" +} +] +] +} +], +[ +{ +"s": "\u0007" +}, +{ +"s": "nan" +} +], +[ +{ +"s": "1:30" +}, +{ +"s": "\u65e5\u672c\u8a9e" +} +] +] +} +], +[ +{ +"s": "Null" +}, +{ +"l": [] +} +], +[ +{ +"s": "say \"hi\"" +}, +{ +"d": [ +[ +{ +"s": "n_estimators" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "a " +}, +{ +"d": [ +[ +{ +"s": "a, b" +}, +{ +"s": "inf" +} +], +[ +{ +"s": "--- x" +}, +{ +"i": "7" +} +] +] +} +], +[ +{ +"s": "a #b" +}, +{ +"d": [ +[ +{ +"s": "n" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "a b" +}, +{ +"s": ":a" +} +], +[ +{ +"s": "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 b" +}, +{ +"s": "a\\b" +} +] +] +} +], +[ +{ +"s": "190:20:30" +}, +{ +"d": [ +[ +{ +"s": "?a" +}, +{ +"i": "7" +} +], +[ +{ +"s": "- a" +}, +{ +"f": 9221120237041090560 +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 99\nparams:\n lr: 5.0e-324\nstate: PRUNED\nuser_attrs:\n 'Null': []\n say \"hi\":\n '190:20:30':\n '- a': .nan\n ?a: 7\n 'a ':\n '--- x': 7\n a, b: inf\n 'a #b':\n a b: :a\n 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 b: a\\b\n n: 1.0e-07\n n_estimators: 1.0\n value:\n \"\\a\": nan\n '007': \"a\\tb\"\n '1:30': \"\\u65E5\\u672C\\u8A9E\"\n \\:\n 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 b: 'yes'\nvalue: 9007199254740993\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "46" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "2026-11-10" +}, +{ +"s": "1.5" +} +], +[ +{ +"s": "*" +}, +{ +"s": "\u00e9" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 46\nparams:\n '*': \"\\xE9\"\n '2026-11-10': '1.5'\nstate: RUNNING\nuser_attrs: {}\nvalue: 2.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "98" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"i": "1000000000000000000" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "?a" +}, +{ +"b": true +} +], +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"s": "\u2028" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 98\nparams:\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 1000000000000000000\nstate: RUNNING\nuser_attrs:\n ?a: true\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b: \"\\L\"\nvalue: 1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "73" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a" +}, +{ +"f": 1 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "OFF" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [ +[ +{ +"s": "1:30.5" +}, +{ +"d": [ +[ +{ +"s": ".inf" +}, +{ +"s": "+1" +} +], +[ +{ +"s": "\u2028" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "say \"hi\"" +}, +{ +"s": " " +} +] +] +} +], +[ +{ +"s": "1.5" +}, +{ +"l": [] +} +], +[ +{ +"s": "n" +}, +{ +"l": [ +{ +"f": -4616189618054758400 +}, +{ +"b": true +}, +{ +"s": "? a" +} +] +} +], +[ +{ +"s": "@x" +}, +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 1 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 73\nparams:\n a: 5.0e-324\nstate: RUNNING\nuser_attrs:\n 'OFF': 1.0e-07\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '1.5': []\n '1:30.5':\n '.inf': '+1'\n say \"hi\": ' '\n ? \"\\L\"\n : -1\n '@x': \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb\\\n \\ aa bb aa bb aa bb \\xE9\"\n n:\n - -1.0\n - true\n - '? a'\nvalue: -.inf\nvalues:\n- 5.0e-324\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "11" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a" +}, +{ +"s": "1:30" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": " " +}, +{ +"s": "a#b" +} +], +[ +{ +"s": "lr" +}, +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +} +] +] +}, +{ +"s": "0" +} +] +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [] +} +], +[ +{ +"s": "2001-12-14t21:59:43.10-05:00" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 11\nparams:\n a: '1:30'\nstate: PRUNED\nuser_attrs:\n '2001-12-14t21:59:43.10-05:00': {}\n \"a\\U0001F600b\":\n - ' ': a#b\n lr: \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa\\\n \\ bb aa bb aa bb \\xE9\"\n - '0'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : {}\nvalue: 1.0e-07\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "47" +} +], +[ +{ +"s": "value" +}, +{ +"i": "-1099511627776" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\u0007" +}, +{ +"d": [] +} +], +[ +{ +"s": "na\u00efve" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [] +} +], +[ +{ +"s": "a\u0000b" +}, +{ +"d": [ +[ +{ +"s": " two leading" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "\u00a0" +}, +{ +"s": "1:30" +} +], +[ +{ +"s": "0b101" +}, +{ +"f": -4503599627370496 +} +] +] +} +], +[ +{ +"s": "@x" +}, +{ +"f": 1 +} +] +] +} +], +[ +{ +"s": "params" +}, +{ +"l": [ +{ +"d": [] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 47\nparams: {}\nstate: COMPLETE\nuser_attrs:\n \"\\a\": {}\n \"na\\xEFve\":\n '@x': 5.0e-324\n \"a\\0b\":\n ' two leading': 1.0e+22\n '0b101': -.inf\n \"\\_\": '1:30'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : {}\n params:\n - {}\nvalue: -1099511627776\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "30" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9221120237041090560 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "- a" +}, +{ +"s": "\u0085" +} +], +[ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"s": "2026-11-10" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a\u0000b" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "" +}, +{ +"s": "a \nb" +} +], +[ +{ +"s": "trailing two " +}, +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +} +] +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 30\nparams:\n '- a': \"\\N\"\n \"\\u65E5\\u672C\\u8A9E\": '2026-11-10'\nstate: PRUNED\nuser_attrs:\n \"a\\0b\":\n - ? ''\n : \"a \\nb\"\n 'trailing two ': 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s '\nvalue: .nan\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "76" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "OFF" +}, +{ +"s": "a\n" +} +], +[ +{ +"s": "y" +}, +{ +"s": "a: b" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1:30" +}, +{ +"l": [] +} +], +[ +{ +"s": "z9" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "params" +}, +{ +"n": null +} +], +[ +{ +"s": "=" +}, +{ +"s": "*x" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"n": null +} +] +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 76\nparams:\n 'OFF': 'a\n\n '\n y: 'a: b'\nstate: RUNNING\nuser_attrs:\n '1:30': []\n z9:\n - '=': '*x'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : null\n params: null\nvalue: 1.0e+16\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "27" +} +], +[ +{ +"s": "value" +}, +{ +"n": null +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "say \"hi\"" +}, +{ +"f": 0 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "yes" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": " " +}, +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 27\nparams:\n say \"hi\": 0.0\nstate: RUNNING\nuser_attrs:\n ' ': 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n 'yes': 1000000000000000000\nvalue: null\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "21" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a\n b" +}, +{ +"d": [ +[ +{ +"s": "\"" +}, +{ +"s": "nan" +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"l": [ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"n": null +}, +{ +"s": "&x" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +} +] +} +], +[ +{ +"s": "--" +}, +{ +"d": [ +[ +{ +"s": "~" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "#a" +}, +{ +"s": "2026-11-10" +} +] +] +} +], +[ +{ +"s": "!" +}, +{ +"s": "-1" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 21\nparams: {}\nstate: PRUNED\nuser_attrs:\n ? \"a\\n b\"\n : '!': '-1'\n '\"': nan\n --:\n '#a': '2026-11-10'\n '{\"a\": [1, 2]}': 1.0\n '~': 9007199254740993\n ? 'word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word word '\n : - '{\"a\": [1, 2]}'\n - null\n - '&x'\n - 'word word word word word word word word word word word word word word word\n word word word word word '\nvalue: -.inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "69" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "say \"hi\"" +}, +{ +"b": false +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "=" +}, +{ +"l": [] +} +], +[ +{ +"s": "2001-12-14t21:59:43.10-05:00" +}, +{ +"d": [ +[ +{ +"s": "yes" +}, +{ +"d": [ +[ +{ +"s": "[a]" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "a\n\nb" +}, +{ +"s": "a, b" +} +], +[ +{ +"s": "\u00a0" +}, +{ +"s": "null" +} +], +[ +{ +"s": "a" +}, +{ +"f": 9221120237041090560 +} +] +] +} +], +[ +{ +"s": "1e3" +}, +{ +"d": [ +[ +{ +"s": "|x" +}, +{ +"s": "*x" +} +], +[ +{ +"s": "values" +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": ".inf" +}, +{ +"l": [ +{ +"f": -4503599627370496 +}, +{ +"s": "*x" +}, +{ +"s": "y" +} +] +} +], +[ +{ +"s": "*" +}, +{ +"l": [ +{ +"s": "? a" +}, +{ +"i": "2147483648" +}, +{ +"f": -4759972702479526251 +}, +{ +"i": "9007199254740993" +} +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 69\nparams:\n say \"hi\": false\nstate: FAIL\nuser_attrs:\n '2001-12-14t21:59:43.10-05:00':\n '*':\n - '? a'\n - 2147483648\n - -2.5e-10\n - 9007199254740993\n '.inf':\n - -.inf\n - '*x'\n - y\n 1e3:\n values: null\n '|x': '*x'\n 'yes':\n '[a]': 2.0\n a: .nan\n ? 'a\n\n\n b'\n : a, b\n \"\\_\": 'null'\n '=': []\nvalue: 1.5e+300\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "57" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 57\nparams: {}\nstate: COMPLETE\nuser_attrs: {}\nvalue: 1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "65" +} +], +[ +{ +"s": "value" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "value" +}, +{ +"s": "?a" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"b": true +} +], +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"d": [ +[ +{ +"s": "max_depth" +}, +{ +"d": [ +[ +{ +"s": "False" +}, +{ +"f": 4728057454355411894 +} +] +] +} +], +[ +{ +"s": ">x" +}, +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +} +], +[ +{ +"s": "!x" +}, +{ +"l": [ +{ +"f": 4861130398305394688 +}, +{ +"i": "1" +}, +{ +"s": " a" +} +] +} +] +] +} +], +[ +{ +"s": "a\tb" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "=" +}, +{ +"s": "<<" +} +], +[ +{ +"s": "1.0e+3" +}, +{ +"s": "a\nb" +} +] +] +}, +{ +"l": [ +{ +"b": false +}, +{ +"f": -9223372036854775808 +}, +{ +"f": 6103021453049119613 +} +] +}, +{ +"d": [] +}, +{ +"d": [ +[ +{ +"s": "on" +}, +{ +"i": "1" +} +], +[ +{ +"s": "a" +}, +{ +"s": "a: b" +} +] +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 65\nparams:\n value: ?a\nstate: COMPLETE\nuser_attrs:\n \"a\\tb\":\n - '1.0e+3': 'a\n\n b'\n '=': '<<'\n - - false\n - -0.0\n - 1.0e+100\n - {}\n - a: 'a: b'\n 'on': 1\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b:\n '!x':\n - 1.0e+17\n - 1\n - ' a'\n '>x': 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n max_depth:\n 'False': 123456789.123\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : true\nvalue: 1.0e+100\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "45" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9218868437227405312 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "2026-11-10" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": ".NaN" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "{a}" +}, +{ +"f": 4636737291354636288 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "on" +}, +{ +"d": [] +} +], +[ +{ +"s": ">x" +}, +{ +"l": [] +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "\u65e5\u672c\u8a9e" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 45\nparams:\n '.NaN': 1.5e+300\n '2026-11-10': 1000000000000000000\n '{a}': 100.0\nstate: RUNNING\nuser_attrs:\n '>x': []\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : \"\\u65E5\\u672C\\u8A9E\"\n 'on': {}\nvalue: .inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "67" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4759972702479526251 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "y" +}, +{ +"f": -4503599627370496 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 67\nparams:\n y: -.inf\nstate: PRUNED\nuser_attrs: {}\nvalue: -2.5e-10\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "88" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4759972702479526251 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "*x" +} +], +[ +{ +"s": "null" +}, +{ +"s": "@x" +} +], +[ +{ +"s": "`x`" +}, +{ +"n": null +} +], +[ +{ +"s": ":a" +}, +{ +"f": 9221120237041090560 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "0o7" +}, +{ +"d": [ +[ +{ +"s": "a:" +}, +{ +"f": 4591870180066957722 +} +], +[ +{ +"s": ".5" +}, +{ +"s": "\ta" +} +], +[ +{ +"s": "\\" +}, +{ +"b": false +} +] +] +} +], +[ +{ +"s": "-1.5" +}, +{ +"d": [ +[ +{ +"s": "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 b" +}, +{ +"l": [ +{ +"n": null +}, +{ +"i": "7" +}, +{ +"f": 9097811302482466869 +} +] +} +], +[ +{ +"s": "\ud83d\ude00" +}, +{ +"d": [ +[ +{ +"s": "true" +}, +{ +"f": -9223372036854775808 +} +], +[ +{ +"s": "&x" +}, +{ +"s": " a" +} +] +] +} +], +[ +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +}, +{ +"d": [ +[ +{ +"s": "1:30.5" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": ">x" +}, +{ +"f": 4502148214488346440 +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -4503599627370496 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 88\nparams:\n :a: .nan\n '`x`': null\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '*x'\n 'null': '@x'\nstate: FAIL\nuser_attrs:\n '-1.5':\n 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 b:\n - null\n - 7\n - 1.5e+300\n ? 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n : '1:30.5': 1000000000000000000\n '>x': 1.0e-07\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : -.inf\n \"\\U0001F600\":\n '&x': ' a'\n 'true': -0.0\n 0o7:\n '.5': \"\\ta\"\n \\: false\n 'a:': 0.1\nvalue: -2.5e-10\nvalues:\n- -.inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "6" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "=" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "{a}" +}, +{ +"s": "a \nb" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a\tb" +}, +{ +"i": "7" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4611686018427387904 +}, +{ +"f": 9097811302482466869 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 6\nparams:\n '=': 100.0\n '{a}': \"a \\nb\"\nstate: RUNNING\nuser_attrs:\n \"a\\tb\": 7\nvalue: 1.0e+22\nvalues:\n- 2.0\n- 1.5e+300\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "65" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9218868437227405312 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "on" +}, +{ +"f": 4591870180066957722 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": " two leading" +}, +{ +"d": [ +[ +{ +"s": "max_depth" +}, +{ +"l": [ +{ +"f": 4728057454355411894 +}, +{ +"i": "9007199254740993" +}, +{ +"s": "`x`" +}, +{ +"s": "y" +} +] +} +], +[ +{ +"s": " two leading" +}, +{ +"l": [ +{ +"s": "2026-11-10" +} +] +} +], +[ +{ +"s": "0" +}, +{ +"l": [ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"s": "-1.5" +}, +{ +"i": "-1099511627776" +}, +{ +"i": "0" +} +] +} +] +] +} +], +[ +{ +"s": "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 b" +}, +{ +"l": [] +} +], +[ +{ +"s": "007" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "..." +}, +{ +"s": "a\nb" +} +], +[ +{ +"s": "1:30" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "\u2029" +}, +{ +"i": "7" +} +], +[ +{ +"s": "*" +}, +{ +"s": "a\nb" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "1:30" +}, +{ +"s": "1:30.5" +} +], +[ +{ +"s": "|" +}, +{ +"b": false +} +], +[ +{ +"s": "No" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "0:00:00.012345" +}, +{ +"s": "1:30" +} +] +] +}, +{ +"s": "[a]" +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 65\nparams:\n 'on': 0.1\nstate: PRUNED\nuser_attrs:\n ' two leading':\n ' two leading':\n - '2026-11-10'\n '0':\n - 'word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word word '\n - '-1.5'\n - -1099511627776\n - 0\n max_depth:\n - 123456789.123\n - 9007199254740993\n - '`x`'\n - y\n '007':\n - '*': 'a\n\n b'\n '...': 'a\n\n b'\n '1:30': 9007199254740993\n ? \"\\P\"\n : 7\n - '0:00:00.012345': '1:30'\n '1:30': '1:30.5'\n 'No': 1.0e-07\n '|': false\n - '[a]'\n 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 b: []\nvalue: .inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "0" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": ".inf" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "1" +}, +{ +"i": "7" +} +] +}, +{ +"l": [ +{ +"n": null +}, +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"s": "Null" +} +] +} +] +} +], +[ +{ +"s": "y" +}, +{ +"d": [ +[ +{ +"s": "\ufeff" +}, +{ +"b": false +} +], +[ +{ +"s": "2026-1-2 3:04:05.5 +09:00" +}, +{ +"l": [ +{ +"s": "a:" +}, +{ +"i": "9007199254740993" +}, +{ +"s": "2026-1-2 3:04:05.5 +09:00" +} +] +} +], +[ +{ +"s": "yes" +}, +{ +"l": [ +{ +"s": "a:b" +}, +{ +"i": "1" +}, +{ +"s": "a " +} +] +} +] +] +} +], +[ +{ +"s": "\u2028" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 0\nparams: {}\nstate: FAIL\nuser_attrs:\n '.inf':\n - - '1'\n - 7\n - - null\n - http://x.y/z?q=1#f\n - 'Null'\n y:\n '2026-1-2 3:04:05.5 +09:00':\n - 'a:'\n - 9007199254740993\n - '2026-1-2 3:04:05.5 +09:00'\n 'yes':\n - a:b\n - 1\n - 'a '\n \"\\uFEFF\": false\n ? \"\\L\"\n : {}\nvalue: 1.0e+16\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "95" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9218868437227405312 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "max_depth" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4728057454355411894 +}, +{ +"f": -9223372036854775808 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 95\nparams: {}\nstate: PRUNED\nuser_attrs:\n max_depth: {}\nvalue: .inf\nvalues:\n- 123456789.123\n- -0.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "32" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "value" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "1.5" +}, +{ +"i": "-1" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": ".5" +}, +{ +"s": "yes" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 32\nparams:\n '1.5': -1\n value: 1.0e+16\nstate: RUNNING\nuser_attrs:\n '.5': 'yes'\nvalue: 1.0e+22\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "41" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9221120237041090560 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a, b" +}, +{ +"f": 4591870180066957722 +} +], +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"f": 4607182418800017408 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": ">" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [ +{ +"f": 4861130398305394688 +}, +{ +"l": [ +{ +"b": false +} +] +}, +{ +"s": "0x1F" +}, +{ +"s": "say \"hi\"" +} +] +} +], +[ +{ +"s": "0x1F" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 41\nparams:\n a, b: 0.1\n ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : 1.0\nstate: RUNNING\nuser_attrs:\n '0x1F': []\n '>': -.inf\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : - 1.0e+17\n - - false\n - '0x1F'\n - say \"hi\"\nvalue: .nan\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "20" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4614256656552045848 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "190:20:30" +}, +{ +"s": "\na" +} +], +[ +{ +"s": "..." +}, +{ +"s": "\ufeff" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "#a" +} +], +[ +{ +"s": "a\n" +}, +{ +"s": "--" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "say \"hi\"" +}, +{ +"d": [ +[ +{ +"s": "z9" +}, +{ +"l": [ +{ +"s": "-1" +}, +{ +"s": "*x" +}, +{ +"s": "1.0e+3" +}, +{ +"n": null +} +] +} +], +[ +{ +"s": "a :b" +}, +{ +"l": [ +{ +"s": "null" +}, +{ +"s": "--" +}, +{ +"f": 4936209963552724370 +} +] +} +], +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"l": [ +{ +"s": "190:20:30" +}, +{ +"b": false +}, +{ +"s": "0:00:00.012345" +} +] +} +], +[ +{ +"s": "<<" +}, +{ +"l": [ +{ +"s": "a\u0000b" +}, +{ +"s": "a :b" +}, +{ +"s": "{a}" +} +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 20\nparams:\n '...': \"\\uFEFF\"\n '190:20:30': '\n\n a'\n ? 'a\n\n '\n : --\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '#a'\nstate: COMPLETE\nuser_attrs:\n say \"hi\":\n '<<':\n - \"a\\0b\"\n - a :b\n - '{a}'\n a :b:\n - 'null'\n - --\n - 1.0e+22\n z9:\n - '-1'\n - '*x'\n - '1.0e+3'\n - null\n '{\"a\": [1, 2]}':\n - '190:20:30'\n - false\n - '0:00:00.012345'\nvalue: 3.141592653589793\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "32" +} +], +[ +{ +"s": "value" +}, +{ +"f": 0 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "--- x" +}, +{ +"s": "1" +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"i": "-1" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "z9" +}, +{ +"l": [ +{ +"d": [] +} +] +} +], +[ +{ +"s": "-.Inf" +}, +{ +"l": [ +{ +"l": [ +{ +"i": "0" +}, +{ +"b": true +}, +{ +"n": null +} +] +} +] +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [ +[ +{ +"s": "\u0085" +}, +{ +"l": [ +{ +"i": "1000000000000000000" +}, +{ +"s": "a #b" +}, +{ +"s": "C:\\path\\to" +}, +{ +"f": 6103021453049119613 +} +] +} +], +[ +{ +"s": "values" +}, +{ +"s": "*x" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "--" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 32\nparams:\n '--- x': '1'\n ? 'word word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word '\n : -1\nstate: FAIL\nuser_attrs:\n '-.Inf':\n - - 0\n - true\n - null\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : --\n values: '*x'\n ? \"\\N\"\n : - 1000000000000000000\n - 'a #b'\n - C:\\path\\to\n - 1.0e+100\n z9:\n - {}\nvalue: 0.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "9" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "[a]" +}, +{ +"s": ".inf" +} +], +[ +{ +"s": "!x" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"s": ".NaN" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "" +}, +{ +"s": ">" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "true" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -9223372036854775808 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 9\nparams:\n '!x': 1.0e+22\n '2026-11-10 22:51:17': '.NaN'\n '[a]': '.inf'\nstate: PRUNED\nuser_attrs:\n ? ''\n : '>'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 'true'\nvalue: 2.0\nvalues:\n- -0.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "48" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 48\nparams: {}\nstate: FAIL\nuser_attrs: {}\nvalue: 1.0e+22\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "72" +} +], +[ +{ +"s": "value" +}, +{ +"n": null +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": " a" +}, +{ +"s": "a,b" +} +], +[ +{ +"s": "|" +}, +{ +"d": [ +[ +{ +"s": "OFF" +}, +{ +"d": [ +[ +{ +"s": "\ta" +}, +{ +"i": "7" +} +], +[ +{ +"s": "&" +}, +{ +"s": "\u65e5\u672c\u8a9e" +} +], +[ +{ +"s": "a\t" +}, +{ +"s": "a\tb" +} +], +[ +{ +"s": "|x" +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": "=" +}, +{ +"n": null +} +], +[ +{ +"s": "inf" +}, +{ +"s": "No" +} +], +[ +{ +"s": "|x" +}, +{ +"s": "yes" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4607182418800017408 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 72\nparams: {}\nstate: RUNNING\nuser_attrs:\n ' a': a,b\n '|':\n '=': null\n 'OFF':\n \"\\ta\": 7\n '&': \"\\u65E5\\u672C\\u8A9E\"\n \"a\\t\": \"a\\tb\"\n '|x': null\n inf: 'No'\n '|x': 'yes'\nvalue: null\nvalues:\n- 1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "23" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1.5" +}, +{ +"d": [ +[ +{ +"s": "+1" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "\ta" +}, +{ +"s": "2026-11-10T22:51:17Z" +} +], +[ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"d": [ +[ +{ +"s": "- a" +}, +{ +"l": [ +{ +"s": "a\t" +}, +{ +"b": true +} +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 23\nparams: {}\nstate: COMPLETE\nuser_attrs:\n \"\\ta\": '2026-11-10T22:51:17Z'\n '1.5':\n '+1': {}\n \"\\u65E5\\u672C\\u8A9E\":\n '- a':\n - \"a\\t\"\n - true\nvalue: -.inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "62" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4759972702479526251 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "value" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "1:30.5" +}, +{ +"i": "42" +} +], +[ +{ +"s": "--" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +}, +{ +"i": "9007199254740993" +} +] +}, +{ +"d": [ +[ +{ +"s": "a\nb" +}, +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +} +] +] +}, +{ +"l": [ +{ +"b": false +}, +{ +"f": -4503599627370496 +} +] +}, +{ +"s": "a\\b" +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 62\nparams: {}\nstate: FAIL\nuser_attrs:\n --:\n - - aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b c\n - 'word word word word word word word word word word word word word word word\n word word word word word '\n - 9007199254740993\n - ? 'a\n\n b'\n : 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n - - false\n - -.inf\n - a\\b\n '1:30.5': 42\n value: -.inf\nvalue: -2.5e-10\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "2" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\u2029" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "!x" +}, +{ +"b": true +} +], +[ +{ +"s": "- a" +}, +{ +"s": "Null" +} +], +[ +{ +"s": "0:00:00.012345" +}, +{ +"s": "a: b" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "a :b" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "!x" +}, +{ +"s": "1:30.5" +} +] +] +} +] +} +], +[ +{ +"s": "a b" +}, +{ +"d": [ +[ +{ +"s": "max_depth" +}, +{ +"d": [ +[ +{ +"s": "a \nb" +}, +{ +"s": "a\\b" +} +], +[ +{ +"s": "nan" +}, +{ +"f": -9223372036854775808 +} +], +[ +{ +"s": "1e3" +}, +{ +"s": "null" +} +], +[ +{ +"s": "a" +}, +{ +"s": "2026-11-10 22:51:17" +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 2\nparams: {}\nstate: COMPLETE\nuser_attrs:\n a b:\n max_depth:\n 1e3: 'null'\n a: '2026-11-10 22:51:17'\n ? \"a \\nb\"\n : a\\b\n nan: -0.0\n ? \"\\P\"\n : - '!x': true\n '- a': 'Null'\n '0:00:00.012345': 'a: b'\n - '!x': '1:30.5'\n a :b: 2.0\nvalue: -1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "20" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1.e3" +}, +{ +"d": [] +} +], +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4591870180066957722 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 20\nparams: {}\nstate: RUNNING\nuser_attrs:\n 1.e3: {}\n \"a\\U0001F600b\": {}\nvalue: 123456789.123\nvalues:\n- 0.1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "15" +} +], +[ +{ +"s": "value" +}, +{ +"f": 0 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "007" +}, +{ +"i": "42" +} +], +[ +{ +"s": "say \"hi\"" +}, +{ +"s": "0x1F" +} +], +[ +{ +"s": "a" +}, +{ +"s": "Null" +} +], +[ +{ +"s": "1e3" +}, +{ +"f": 1 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a " +}, +{ +"d": [ +[ +{ +"s": "-.Inf" +}, +{ +"s": "OFF" +} +], +[ +{ +"s": ".NaN" +}, +{ +"l": [ +{ +"b": false +}, +{ +"s": "\"" +}, +{ +"s": "\u00a0" +}, +{ +"i": "9007199254740993" +} +] +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +}, +{ +"s": "a\\b" +} +], +[ +{ +"s": "1:30.5" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +}, +{ +"d": [ +[ +{ +"s": "\\" +}, +{ +"s": "a\nb" +} +] +] +} +], +[ +{ +"s": "*" +}, +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 15\nparams:\n '007': 42\n 1e3: 5.0e-324\n a: 'Null'\n say \"hi\": '0x1F'\nstate: PRUNED\nuser_attrs:\n '*': xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\n 'a ':\n '-.Inf': 'OFF'\n '.NaN':\n - false\n - '\"'\n - \"\\_\"\n - 9007199254740993\n '1:30.5': {}\n 'word word word word word word word word word word word word word word word word word word word word ': a\\b\n 'word word word word word word word word word word word word word word word word word word word word ':\n \\: 'a\n\n b'\nvalue: 0.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "64" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "---" +}, +{ +"i": "0" +} +], +[ +{ +"s": "a\n\nb" +}, +{ +"s": "\\" +} +], +[ +{ +"s": "!" +}, +{ +"s": "a\u0000b" +} +], +[ +{ +"s": "#a" +}, +{ +"s": "http://x.y/z?q=1#f" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [ +[ +{ +"s": "x" +}, +{ +"b": false +} +], +[ +{ +"s": "a\nb" +}, +{ +"l": [ +{ +"s": ".inf" +} +] +} +] +] +} +], +[ +{ +"s": "2026-1-2 3:04:05.5 +09:00" +}, +{ +"d": [ +[ +{ +"s": "'" +}, +{ +"d": [ +[ +{ +"s": "a, b" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "a " +}, +{ +"s": "http://x.y/z?q=1#f" +} +], +[ +{ +"s": "?a" +}, +{ +"i": "2147483648" +} +] +] +} +], +[ +{ +"s": "#a" +}, +{ +"s": "!x" +} +], +[ +{ +"s": ".inf" +}, +{ +"b": false +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4591870180066957722 +}, +{ +"f": 4611686018427387904 +}, +{ +"f": 4611686018427387904 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 64\nparams:\n '!': \"a\\0b\"\n '#a': http://x.y/z?q=1#f\n '---': 0\n ? 'a\n\n\n b'\n : \\\nstate: FAIL\nuser_attrs:\n '2026-1-2 3:04:05.5 +09:00':\n '#a': '!x'\n '''':\n ?a: 2147483648\n 'a ': http://x.y/z?q=1#f\n a, b: '0:00:00.012345'\n '.inf': false\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : ? 'a\n\n b'\n : - '.inf'\n x: false\nvalue: 1.0e-07\nvalues:\n- 0.1\n- 2.0\n- 2.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "90" +} +], +[ +{ +"s": "value" +}, +{ +"i": "7" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "n_estimators" +}, +{ +"l": [] +} +], +[ +{ +"s": "1.e3" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "%x" +}, +{ +"s": "007" +} +] +}, +{ +"d": [ +[ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"s": "1:30.5" +} +], +[ +{ +"s": "\u2028" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "False" +} +] +] +}, +{ +"b": false +}, +{ +"s": "a\u0000b" +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 90\nparams: {}\nstate: RUNNING\nuser_attrs:\n 1.e3:\n - - '%x'\n - '007'\n - ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 'False'\n ? \"\\L\"\n : -1\n \"\\u65E5\\u672C\\u8A9E\": '1:30.5'\n - false\n - \"a\\0b\"\n n_estimators: []\nvalue: 7\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "75" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "~" +} +], +[ +{ +"s": "1e3" +}, +{ +"s": "190:20:30" +} +], +[ +{ +"s": "@x" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"s": "2026-1-2 3:04:05.5 +09:00" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1e3" +}, +{ +"l": [] +} +], +[ +{ +"s": "-a" +}, +{ +"i": "1000000000000000000" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 75\nparams:\n 1e3: '190:20:30'\n '2026-11-10 22:51:17': '2026-1-2 3:04:05.5 +09:00'\n '@x': 9007199254740993\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '~'\nstate: PRUNED\nuser_attrs:\n -a: 1000000000000000000\n 1e3: []\nvalue: 100.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "40" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "a\n b" +}, +{ +"n": null +} +], +[ +{ +"s": "\ufeff" +}, +{ +"s": "-a" +} +], +[ +{ +"s": ".NaN" +}, +{ +"s": " two leading" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 40\nparams:\n '.NaN': ' two leading'\n ? \"a\\n b\"\n : null\n \"\\u65E5\\u672C\\u8A9E\": -1\n \"\\uFEFF\": -a\nstate: RUNNING\nuser_attrs: {}\nvalue: -1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "12" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4614256656552045848 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "y" +}, +{ +"s": ".NaN" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "--" +} +], +[ +{ +"s": "key: value # comment" +}, +{ +"s": " a" +} +], +[ +{ +"s": "1.e3" +}, +{ +"i": "2147483648" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 12\nparams:\n 1.e3: 2147483648\n 'key: value # comment': ' a'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : --\n y: '.NaN'\nstate: COMPLETE\nuser_attrs: {}\nvalue: 3.141592653589793\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "48" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a, b" +}, +{ +"i": "42" +} +], +[ +{ +"s": "a \nb" +}, +{ +"s": "a#b" +} +], +[ +{ +"s": "1e3" +}, +{ +"s": "?a" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "---" +}, +{ +"s": "1.e3" +} +], +[ +{ +"s": "a\tb" +}, +{ +"l": [ +{ +"i": "-1099511627776" +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 48\nparams:\n 1e3: ?a\n ? \"a \\nb\"\n : a#b\n a, b: 42\nstate: RUNNING\nuser_attrs:\n '---': 1.e3\n \"a\\tb\":\n - -1099511627776\nvalue: 1.5e+300\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "21" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "0o7" +}, +{ +"s": "it's" +} +], +[ +{ +"s": "!x" +}, +{ +"s": "a\n\nb" +} +], +[ +{ +"s": "on" +}, +{ +"s": "yes" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "on" +}, +{ +"s": "\u00a0" +} +], +[ +{ +"s": "OFF" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"i": "42" +} +], +[ +{ +"s": "|x" +}, +{ +"s": "a\n b" +} +], +[ +{ +"s": "a\nb" +}, +{ +"s": "0x1F" +} +] +] +}, +{ +"l": [] +}, +{ +"d": [ +[ +{ +"s": "Null" +}, +{ +"s": "1:30" +} +], +[ +{ +"s": "a\u0000b" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "\ta" +}, +{ +"b": false +} +], +[ +{ +"s": "1_000" +}, +{ +"s": "\"" +} +] +] +}, +{ +"f": 9221120237041090560 +} +] +} +], +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"l": [ +{ +"d": [] +}, +{ +"l": [ +{ +"s": "--" +}, +{ +"i": "7" +}, +{ +"n": null +} +] +}, +{ +"l": [ +{ +"s": "=" +} +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4936209963552724370 +}, +{ +"f": 4611686018427387904 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 21\nparams:\n '!x': 'a\n\n\n b'\n 0o7: it's\n 'on': 'yes'\nstate: RUNNING\nuser_attrs:\n '2026-11-10 22:51:17':\n - {}\n - - --\n - 7\n - null\n - - '='\n 'OFF':\n - ? 'a\n\n b'\n : '0x1F'\n \"a\\U0001F600b\": 42\n '|x': \"a\\n b\"\n - []\n - \"\\ta\": false\n '1_000': '\"'\n 'Null': '1:30'\n \"a\\0b\": 100.0\n - .nan\n 'on': \"\\_\"\nvalue: 1.0\nvalues:\n- 1.0e+22\n- 2.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "33" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": " two leading" +}, +{ +"i": "7" +} +], +[ +{ +"s": "|x" +}, +{ +"b": true +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 33\nparams:\n ' two leading': 7\n '|x': true\nstate: COMPLETE\nuser_attrs: {}\nvalue: 2.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "81" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "|x" +}, +{ +"d": [ +[ +{ +"s": "on" +}, +{ +"d": [ +[ +{ +"s": "nan" +}, +{ +"s": "inf" +} +], +[ +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +}, +{ +"b": true +} +] +] +} +], +[ +{ +"s": "\u0007" +}, +{ +"d": [ +[ +{ +"s": "%x" +}, +{ +"i": "42" +} +], +[ +{ +"s": "{a}" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": " a" +}, +{ +"s": "a,b" +} +] +] +} +], +[ +{ +"s": "\ufeff" +}, +{ +"f": -9223372036854775808 +} +], +[ +{ +"s": "n" +}, +{ +"l": [ +{ +"s": " two leading" +}, +{ +"s": "a \nb" +} +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 81\nparams: {}\nstate: RUNNING\nuser_attrs:\n '|x':\n \"\\a\":\n ' a': a,b\n '%x': 42\n '{a}': 1.0e+17\n n:\n - ' two leading'\n - \"a \\nb\"\n 'on':\n \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \\xE9\": true\n nan: inf\n \"\\uFEFF\": -0.0\nvalue: 123456789.123\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "83" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a :b" +}, +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +} +], +[ +{ +"s": "\"" +}, +{ +"i": "9007199254740993" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4614256656552045848 +}, +{ +"f": -4503599627370496 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 83\nparams:\n '\"': 9007199254740993\n a :b: \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa\\\n \\ bb aa bb aa bb \\xE9\"\nstate: FAIL\nuser_attrs: {}\nvalue: 2.0\nvalues:\n- 3.141592653589793\n- -.inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "24" +} +], +[ +{ +"s": "value" +}, +{ +"i": "7" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "*x" +}, +{ +"s": "1.e3" +} +], +[ +{ +"s": "true" +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a: b" +}, +{ +"d": [ +[ +{ +"s": "1:30.5" +}, +{ +"s": "a b" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -4759972702479526251 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 24\nparams:\n '*x': 1.e3\n 'true': null\nstate: FAIL\nuser_attrs:\n 'a: b':\n '1:30.5': a b\nvalue: 7\nvalues:\n- -2.5e-10\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "81" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "say \"hi\"" +}, +{ +"s": "<<" +} +], +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"s": ".inf" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 0 +}, +{ +"f": 4728057454355411894 +}, +{ +"f": 9221120237041090560 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 81\nparams:\n '2026-11-10 22:51:17': '.inf'\n say \"hi\": '<<'\nstate: FAIL\nuser_attrs: {}\nvalue: 1.5e+300\nvalues:\n- 0.0\n- 123456789.123\n- .nan\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "65" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4591870180066957722 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "-1" +}, +{ +"f": -9223372036854775808 +} +], +[ +{ +"s": "[a]" +}, +{ +"i": "1000000000000000000" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -9223372036854775808 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 65\nparams:\n '-1': -0.0\n '[a]': 1000000000000000000\nstate: RUNNING\nuser_attrs: {}\nvalue: 0.1\nvalues:\n- -0.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "38" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"b": false +} +], +[ +{ +"s": "params" +}, +{ +"b": false +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "*" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [] +} +], +[ +{ +"s": "na\u00efve" +}, +{ +"d": [ +[ +{ +"s": "1_000" +}, +{ +"s": "na\u00efve" +} +], +[ +{ +"s": "%x" +}, +{ +"i": "42" +} +] +] +} +], +[ +{ +"s": ".inf" +}, +{ +"l": [] +} +], +[ +{ +"s": "-" +}, +{ +"d": [ +[ +{ +"s": "2026-11-10T22:51:17Z" +}, +{ +"s": "\na" +} +], +[ +{ +"s": "0b101" +}, +{ +"i": "-1099511627776" +} +] +] +} +] +] +} +], +[ +{ +"s": "a\u0000b" +}, +{ +"d": [ +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": "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 b" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": "a\n" +}, +{ +"f": 4614256656552045848 +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4611686018427387904 +}, +{ +"f": -9223372036854775808 +}, +{ +"f": 4846369599423283200 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 38\nparams:\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : false\n params: false\nstate: PRUNED\nuser_attrs:\n '*':\n '-':\n '0b101': -1099511627776\n '2026-11-10T22:51:17Z': '\n\n a'\n '.inf': []\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : []\n \"na\\xEFve\":\n '%x': 42\n '1_000': \"na\\xEFve\"\n \"a\\0b\":\n 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 b: []\n '{\"a\": [1, 2]}': 1.0e+17\n ? 'a\n\n '\n : 3.141592653589793\nvalue: 123456789.123\nvalues:\n- 2.0\n- -0.0\n- 1.0e+16\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "43" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "%x" +}, +{ +"s": "" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "on" +}, +{ +"l": [ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"l": [ +{ +"s": "|x" +}, +{ +"s": "\u0085" +} +] +} +] +} +], +[ +{ +"s": "" +}, +{ +"s": "-" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 43\nparams:\n '%x': ''\nstate: COMPLETE\nuser_attrs:\n ? ''\n : '-'\n 'on':\n - '2026-11-10 22:51:17'\n - - '|x'\n - \"\\N\"\nvalue: 123456789.123\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "59" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"i": "1" +} +], +[ +{ +"s": "@x" +}, +{ +"f": 4936209963552724370 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"n": null +} +], +[ +{ +"s": "a\\b" +}, +{ +"s": "---" +} +], +[ +{ +"s": ">x" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4611686018427387904 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 59\nparams:\n '@x': 1.0e+22\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 1\nstate: PRUNED\nuser_attrs:\n '>x': {}\n a\\b: '---'\n \"a\\U0001F600b\": null\nvalue: -.inf\nvalues:\n- 2.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "93" +} +], +[ +{ +"s": "value" +}, +{ +"f": 0 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1:30" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 93\nparams: {}\nstate: RUNNING\nuser_attrs:\n '1:30': []\nvalue: 0.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "59" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "1.0e+3" +}, +{ +"i": "7" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "False" +}, +{ +"d": [ +[ +{ +"s": "2001-12-14t21:59:43.10-05:00" +}, +{ +"s": ".inf" +} +], +[ +{ +"s": "1.0e+3" +}, +{ +"l": [ +{ +"s": "a\n b" +} +] +} +], +[ +{ +"s": "n_estimators" +}, +{ +"d": [ +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"s": ">x" +} +], +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "- a" +}, +{ +"f": 4614256656552045848 +} +] +] +} +] +] +} +], +[ +{ +"s": "nan" +}, +{ +"d": [ +[ +{ +"s": "=" +}, +{ +"d": [ +[ +{ +"s": "\u00a0" +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": "lr" +}, +{ +"l": [ +{ +"f": 4591870180066957722 +}, +{ +"i": "7" +} +] +} +], +[ +{ +"s": "1" +}, +{ +"d": [ +[ +{ +"s": "" +}, +{ +"s": "|x" +} +], +[ +{ +"s": "\ud83d\ude00" +}, +{ +"s": "" +} +] +] +} +], +[ +{ +"s": "\ufeff" +}, +{ +"s": "=" +} +] +] +} +], +[ +{ +"s": "x" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "0" +}, +{ +"s": "0b101" +} +], +[ +{ +"s": "1.5" +}, +{ +"f": 1 +} +], +[ +{ +"s": "--- x" +}, +{ +"f": 9097811302482466869 +} +] +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 59\nparams:\n '1.0e+3': 7\nstate: FAIL\nuser_attrs:\n 'False':\n '1.0e+3':\n - \"a\\n b\"\n '2001-12-14t21:59:43.10-05:00': '.inf'\n n_estimators:\n '- a': 3.141592653589793\n \"a\\U0001F600b\": '>x'\n \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \": 1.5e+300\n nan:\n '1':\n ? ''\n : '|x'\n \"\\U0001F600\": ''\n '=':\n \"\\_\": null\n lr:\n - 0.1\n - 7\n \"\\uFEFF\": '='\n x:\n - '--- x': 1.5e+300\n '0': '0b101'\n '1.5': 5.0e-324\nvalue: 1.5e+300\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "75" +} +], +[ +{ +"s": "value" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "value" +}, +{ +"b": true +} +], +[ +{ +"s": "2026-11-10T22:51:17Z" +}, +{ +"b": false +} +], +[ +{ +"s": ">" +}, +{ +"s": ">x" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 75\nparams:\n '2026-11-10T22:51:17Z': false\n '>': '>x'\n value: true\nstate: RUNNING\nuser_attrs: {}\nvalue: 2147483648\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "25" +} +], +[ +{ +"s": "value" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 25\nparams: {}\nstate: COMPLETE\nuser_attrs: {}\nvalue: 1.0e+100\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "42" +} +], +[ +{ +"s": "value" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "params" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "a\nb" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "[a]" +}, +{ +"d": [ +[ +{ +"s": "1e3" +}, +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +} +], +[ +{ +"s": "&x" +}, +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +} +] +] +} +], +[ +{ +"s": "a#b" +}, +{ +"i": "42" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 42\nparams:\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 'a\n\n b'\n params: 1.0e-07\nstate: PRUNED\nuser_attrs:\n '[a]':\n '&x': 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n 1e3: xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\n a#b: 42\nvalue: -1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "6" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": " a" +}, +{ +"f": 9218868437227405312 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 6\nparams:\n ' a': .inf\nstate: COMPLETE\nuser_attrs: {}\nvalue: -.inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "75" +} +], +[ +{ +"s": "value" +}, +{ +"n": null +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a#b" +}, +{ +"f": 4611686018427387904 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "''" +}, +{ +"s": "?a" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -4759972702479526251 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 75\nparams:\n a#b: 2.0\nstate: FAIL\nuser_attrs:\n '''''': ?a\nvalue: null\nvalues:\n- -2.5e-10\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "33" +} +], +[ +{ +"s": "value" +}, +{ +"f": 1 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "--" +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"s": "*" +} +], +[ +{ +"s": "\u0085" +}, +{ +"s": "say \"hi\"" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 33\nparams:\n --: aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b c\nstate: COMPLETE\nuser_attrs:\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b: '*'\n ? \"\\N\"\n : say \"hi\"\nvalue: 5.0e-324\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "83" +} +], +[ +{ +"s": "value" +}, +{ +"f": -9223372036854775808 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a\nb" +}, +{ +"s": "*" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 83\nparams: {}\nstate: COMPLETE\nuser_attrs:\n ? 'a\n\n b'\n : '*'\nvalue: -0.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "69" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "z9" +}, +{ +"s": "1:30.5" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "No" +}, +{ +"d": [ +[ +{ +"s": "1.0e+3" +}, +{ +"s": "a\\b" +} +], +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"d": [ +[ +{ +"s": "1:30.5" +}, +{ +"i": "1" +} +] +] +} +], +[ +{ +"s": "\u2029" +}, +{ +"d": [ +[ +{ +"s": "a\n b" +}, +{ +"s": "1:30" +} +], +[ +{ +"s": "a#b" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "-1.5" +}, +{ +"f": 4846369599423283200 +} +] +] +} +], +[ +{ +"s": "<<" +}, +{ +"f": -4503599627370496 +} +] +] +} +], +[ +{ +"s": "nan" +}, +{ +"s": "? a" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 69\nparams:\n z9: '1:30.5'\nstate: RUNNING\nuser_attrs:\n 'No':\n '1.0e+3': a\\b\n '<<': -.inf\n '{\"a\": [1, 2]}':\n '1:30.5': 1\n ? \"\\P\"\n : '-1.5': 1.0e+16\n ? \"a\\n b\"\n : '1:30'\n a#b: 9007199254740993\n nan: '? a'\nvalue: 1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "4" +} +], +[ +{ +"s": "value" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 4\nparams: {}\nstate: RUNNING\nuser_attrs: {}\nvalue: -1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "91" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": " two leading" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +} +], +[ +{ +"s": "value" +}, +{ +"s": "\\" +} +], +[ +{ +"s": "on" +}, +{ +"f": 9221120237041090560 +} +], +[ +{ +"s": "1.5" +}, +{ +"s": "-" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"d": [] +} +], +[ +{ +"s": "1:30" +}, +{ +"b": false +} +], +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"d": [ +[ +{ +"s": "'" +}, +{ +"i": "-1099511627776" +} +], +[ +{ +"s": ">" +}, +{ +"b": true +} +], +[ +{ +"s": "*" +}, +{ +"d": [ +[ +{ +"s": "0o7" +}, +{ +"s": "a\n" +} +] +] +} +], +[ +{ +"s": "\ud83d\ude00" +}, +{ +"d": [ +[ +{ +"s": ": a" +}, +{ +"i": "-1099511627776" +} +], +[ +{ +"s": "a\nb" +}, +{ +"s": "2026-11-10T22:51:17Z" +} +], +[ +{ +"s": "0o7" +}, +{ +"s": "{a}" +} +], +[ +{ +"s": "a: b" +}, +{ +"f": 4728057454355411894 +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 91\nparams:\n ' two leading': 'word word word word word word word word word word word word word\n word word word word word word word '\n '1.5': '-'\n 'on': .nan\n value: \\\nstate: RUNNING\nuser_attrs:\n '1:30': false\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b: {}\n ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : '''': -1099511627776\n '*':\n 0o7: 'a\n\n '\n '>': true\n \"\\U0001F600\":\n 0o7: '{a}'\n ': a': -1099511627776\n ? 'a\n\n b'\n : '2026-11-10T22:51:17Z'\n 'a: b': 123456789.123\nvalue: -.inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "42" +} +], +[ +{ +"s": "value" +}, +{ +"n": null +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\\" +}, +{ +"s": "\u2029" +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"s": "@x" +} +], +[ +{ +"s": "\na" +}, +{ +"s": "a:b" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 42\nparams:\n ? '\n\n a'\n : a:b\n \\: \"\\P\"\n ? 'word word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word '\n : '@x'\nstate: FAIL\nuser_attrs: {}\nvalue: null\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "48" +} +], +[ +{ +"s": "value" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"s": "0b101" +} +], +[ +{ +"s": "-" +}, +{ +"s": "0o7" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 48\nparams:\n '-': 0o7\n '{\"a\": [1, 2]}': '0b101'\nstate: RUNNING\nuser_attrs: {}\nvalue: 9007199254740993\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "83" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"s": ": a" +} +], +[ +{ +"s": "a\n\nb" +}, +{ +"i": "1000000000000000000" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "say \"hi\"" +}, +{ +"b": false +} +], +[ +{ +"s": "a \nb" +}, +{ +"l": [ +{ +"s": "a #b" +}, +{ +"l": [] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 83\nparams:\n ? 'a\n\n\n b'\n : 1000000000000000000\n ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : ': a'\nstate: PRUNED\nuser_attrs:\n ? \"a \\nb\"\n : - 'a #b'\n - []\n say \"hi\": false\nvalue: 1.5e+300\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "36" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a \nb" +}, +{ +"s": "&x" +} +], +[ +{ +"s": "y" +}, +{ +"b": true +} +], +[ +{ +"s": ": a" +}, +{ +"b": true +} +], +[ +{ +"s": "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 b" +}, +{ +"i": "-1099511627776" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "-" +}, +{ +"d": [ +[ +{ +"s": "C:\\path\\to" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [ +{ +"s": "- a" +}, +{ +"f": 0 +}, +{ +"s": "\u0085" +} +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4861130398305394688 +}, +{ +"f": 1 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 36\nparams:\n ': a': true\n ? \"a \\nb\"\n : '&x'\n 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 b: -1099511627776\n y: true\nstate: FAIL\nuser_attrs:\n '-':\n C:\\path\\to: '2026-11-10 22:51:17'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : - '- a'\n - 0.0\n - \"\\N\"\nvalue: 100.0\nvalues:\n- 1.0e+17\n- 5.0e-324\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "89" +} +], +[ +{ +"s": "value" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "say \"hi\"" +}, +{ +"n": null +} +], +[ +{ +"s": ":a" +}, +{ +"f": 4614256656552045848 +} +], +[ +{ +"s": "a\\b" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": " two leading" +}, +{ +"s": "\ufeff" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 89\nparams:\n ' two leading': \"\\uFEFF\"\n :a: 3.141592653589793\n a\\b: 1.0e+17\n say \"hi\": null\nstate: FAIL\nuser_attrs: {}\nvalue: 1.0e+100\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "14" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4759972702479526251 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +}, +{ +"s": "\u00e9" +} +], +[ +{ +"s": "y" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "lr" +}, +{ +"f": 4636737291354636288 +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4846369599423283200 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 14\nparams:\n \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \\xE9\": \"\\xE9\"\n y: 'word word word word word word word word word word word word word word word word\n word word word word '\nstate: FAIL\nuser_attrs:\n lr: 100.0\nvalue: -2.5e-10\nvalues:\n- 1.0e+16\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "29" +} +], +[ +{ +"s": "value" +}, +{ +"f": 0 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"s": "\ta" +} +], +[ +{ +"s": "values" +}, +{ +"f": 4614256656552045848 +} +], +[ +{ +"s": "%x" +}, +{ +"i": "1000000000000000000" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"f": 1 +} +], +[ +{ +"s": "params" +}, +{ +"l": [ +{ +"i": "-1" +}, +{ +"l": [ +{ +"i": "1000000000000000000" +} +] +} +] +} +], +[ +{ +"s": "---" +}, +{ +"f": 9218868437227405312 +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -4616189618054758400 +}, +{ +"f": 9221120237041090560 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 29\nparams:\n '%x': 1000000000000000000\n http://x.y/z?q=1#f: \"\\ta\"\n values: 3.141592653589793\nstate: RUNNING\nuser_attrs:\n '---': .inf\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 5.0e-324\n params:\n - -1\n - - 1000000000000000000\nvalue: 0.0\nvalues:\n- -1.0\n- .nan\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "52" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "x" +}, +{ +"s": "..." +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "n" +}, +{ +"b": true +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": ":a" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 52\nparams:\n n: true\n ? 'word word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word '\n : -1.0\n x: '...'\nstate: FAIL\nuser_attrs:\n :a: {}\nvalue: -1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "95" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"i": "-1099511627776" +} +], +[ +{ +"s": "\ta" +}, +{ +"s": "No" +} +], +[ +{ +"s": "na\u00efve" +}, +{ +"s": "\u65e5\u672c\u8a9e" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "y" +}, +{ +"d": [ +[ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"d": [ +[ +{ +"s": "[a]" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "a\tb" +}, +{ +"s": "\u00e9" +} +] +] +} +], +[ +{ +"s": "a\u0000b" +}, +{ +"d": [ +[ +{ +"s": " " +}, +{ +"s": "\u00a0" +} +] +] +} +], +[ +{ +"s": "-" +}, +{ +"l": [ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"f": 4936209963552724370 +}, +{ +"f": 4502148214488346440 +}, +{ +"s": "..." +} +] +} +], +[ +{ +"s": "\"" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "a\nb" +}, +{ +"l": [ +{ +"l": [] +} +] +} +], +[ +{ +"s": "nan" +}, +{ +"d": [ +[ +{ +"s": "a:" +}, +{ +"l": [ +{ +"i": "9007199254740993" +} +] +} +], +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"s": "{\"a\": [1, 2]}" +} +], +[ +{ +"s": "0o7" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +} +], +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"s": "\ud83d\ude00" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 95\nparams:\n \"\\ta\": 'No'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : -1099511627776\n \"na\\xEFve\": \"\\u65E5\\u672C\\u8A9E\"\nstate: PRUNED\nuser_attrs:\n ? 'a\n\n b'\n : - []\n nan:\n 0o7: 'word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word word '\n 'a:':\n - 9007199254740993\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c: \"\\U0001F600\"\n \"a\\U0001F600b\": '{\"a\": [1, 2]}'\n y:\n '\"': {}\n '-':\n - \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \"\n - 1.0e+22\n - 1.0e-07\n - '...'\n \"a\\0b\":\n ' ': \"\\_\"\n \"\\u65E5\\u672C\\u8A9E\":\n '[a]': -.inf\n \"a\\tb\": \"\\xE9\"\nvalue: 100.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "11" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9221120237041090560 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": ".5" +}, +{ +"i": "-1099511627776" +} +], +[ +{ +"s": "- a" +}, +{ +"i": "-1099511627776" +} +], +[ +{ +"s": "1:30.5" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"s": "inf" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "a \nb" +}, +{ +"d": [ +[ +{ +"s": ">x" +}, +{ +"d": [] +} +], +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +} +], +[ +{ +"s": "-" +}, +{ +"s": "-a" +} +], +[ +{ +"s": "-.Inf" +}, +{ +"d": [ +[ +{ +"s": "a,b" +}, +{ +"s": "0b101" +} +], +[ +{ +"s": "+1" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "a \nb" +}, +{ +"s": ".5" +} +], +[ +{ +"s": "n" +}, +{ +"f": 6103021453049119613 +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 11\nparams:\n '- a': -1099511627776\n '.5': -1099511627776\n '1:30.5': -1.0\n http://x.y/z?q=1#f: inf\nstate: FAIL\nuser_attrs:\n ? \"a \\nb\"\n : '-': -a\n '-.Inf':\n '+1': -.inf\n ? \"a \\nb\"\n : '.5'\n a,b: '0b101'\n n: 1.0e+100\n '>x': {}\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b: xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\n \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \\xE9\": 1000000000000000000\nvalue: .nan\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "47" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "? a" +}, +{ +"s": "`x`" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": " a" +}, +{ +"s": "nan" +} +], +[ +{ +"s": "..." +}, +{ +"s": "\u0085" +} +], +[ +{ +"s": "%x" +}, +{ +"s": "a\ud83d\ude00b" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -4503599627370496 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 47\nparams:\n '? a': '`x`'\nstate: FAIL\nuser_attrs:\n ' a': nan\n '%x': \"a\\U0001F600b\"\n '...': \"\\N\"\nvalue: 1.5e+300\nvalues:\n- -.inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "87" +} +], +[ +{ +"s": "value" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1.5" +}, +{ +"l": [ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"l": [ +{ +"s": "a,b" +}, +{ +"s": "a :b" +} +] +} +] +} +], +[ +{ +"s": "Null" +}, +{ +"b": false +} +], +[ +{ +"s": "a :b" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 87\nparams: {}\nstate: FAIL\nuser_attrs:\n '1.5':\n - aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b c\n - - a,b\n - a :b\n 'Null': false\n a :b: {}\nvalue: -1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "76" +} +], +[ +{ +"s": "value" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\ta" +}, +{ +"d": [ +[ +{ +"s": "trailing two " +}, +{ +"s": "007" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 76\nparams: {}\nstate: FAIL\nuser_attrs:\n \"\\ta\":\n 'trailing two ': '007'\nvalue: 9007199254740993\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "98" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +} +], +[ +{ +"s": " " +}, +{ +"s": "a:" +} +], +[ +{ +"s": "n_estimators" +}, +{ +"s": "0o7" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"i": "1000000000000000000" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"d": [ +[ +{ +"s": "-" +}, +{ +"d": [ +[ +{ +"s": "---" +}, +{ +"b": true +} +] +] +} +], +[ +{ +"s": "nan" +}, +{ +"s": "\\" +} +], +[ +{ +"s": "a#b" +}, +{ +"d": [ +[ +{ +"s": "1.5" +}, +{ +"s": "a,b" +} +], +[ +{ +"s": "1" +}, +{ +"s": "&x" +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 98\nparams:\n ' ': 'a:'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 1000000000000000000\n n_estimators: 0o7\n \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \": \"\\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \"\nstate: FAIL\nuser_attrs:\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c:\n '-':\n '---': true\n a#b:\n '1': '&x'\n '1.5': a,b\n nan: \\\nvalue: 1.5e+300\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "52" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "true" +}, +{ +"s": "it's" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": ">" +}, +{ +"l": [ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"d": [] +}, +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +}, +{ +"d": [ +[ +{ +"s": "&" +}, +{ +"s": "a #b" +} +] +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 52\nparams:\n 'true': it's\nstate: RUNNING\nuser_attrs:\n '>':\n - '2026-11-10 22:51:17'\n - {}\n - 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n - '&': 'a #b'\nvalue: 100.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "49" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "+1" +}, +{ +"s": "on" +} +], +[ +{ +"s": "" +}, +{ +"s": "#a" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\\" +}, +{ +"d": [ +[ +{ +"s": "|" +}, +{ +"l": [ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"i": "42" +}, +{ +"i": "9007199254740993" +} +] +} +], +[ +{ +"s": "False" +}, +{ +"l": [ +{ +"s": "a\tb" +}, +{ +"s": "`x`" +} +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 49\nparams:\n ? ''\n : '#a'\n '+1': 'on'\nstate: PRUNED\nuser_attrs:\n \\:\n 'False':\n - \"a\\tb\"\n - '`x`'\n '|':\n - \"\\u65E5\\u672C\\u8A9E\"\n - 42\n - 9007199254740993\nvalue: -1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "87" +} +], +[ +{ +"s": "value" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "2026-1-2 3:04:05.5 +09:00" +}, +{ +"l": [ +{ +"s": "C:\\path\\to" +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 87\nparams: {}\nstate: PRUNED\nuser_attrs:\n '2026-1-2 3:04:05.5 +09:00':\n - C:\\path\\to\nvalue: 1.0e+100\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "26" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9218868437227405312 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "~" +}, +{ +"s": "a[0]" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "-.Inf" +}, +{ +"d": [ +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"l": [ +{ +"f": 4936209963552724370 +} +] +} +] +] +} +], +[ +{ +"s": "0o7" +}, +{ +"l": [ +{ +"s": "-a" +}, +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"s": "true" +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 26\nparams:\n '~': a[0]\nstate: PRUNED\nuser_attrs:\n '-.Inf':\n ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : - 1.0e+22\n 0o7:\n - -a\n - http://x.y/z?q=1#f\n - 'true'\nvalue: .inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "88" +} +], +[ +{ +"s": "value" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "~" +}, +{ +"s": "a, b" +} +], +[ +{ +"s": "&" +}, +{ +"s": "1:30" +} +], +[ +{ +"s": "1:30.5" +}, +{ +"b": true +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"s": "'" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 88\nparams:\n '&': '1:30'\n '1:30.5': true\n '~': a, b\nstate: RUNNING\nuser_attrs:\n ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : ''''\nvalue: 1.0e+100\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "24" +} +], +[ +{ +"s": "value" +}, +{ +"f": 0 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"l": [ +{ +"l": [ +{ +"s": "1:30" +}, +{ +"s": "it's" +}, +{ +"s": "#a" +} +] +} +] +} +], +[ +{ +"s": "..." +}, +{ +"i": "2147483648" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 24\nparams: {}\nstate: FAIL\nuser_attrs:\n '...': 2147483648\n \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \":\n - - '1:30'\n - it's\n - '#a'\nvalue: 0.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "90" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "it's" +}, +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +} +], +[ +{ +"s": "+1" +}, +{ +"f": 4611686018427387904 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "on" +}, +{ +"s": "Null" +} +], +[ +{ +"s": "0o7" +}, +{ +"d": [ +[ +{ +"s": "a:" +}, +{ +"d": [ +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"s": "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 b" +} +], +[ +{ +"s": "&x" +}, +{ +"s": "\u00e9" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "OFF" +} +], +[ +{ +"s": "0o7" +}, +{ +"s": "\ufeff" +} +] +] +} +], +[ +{ +"s": "---" +}, +{ +"d": [ +[ +{ +"s": "z9" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +} +], +[ +{ +"s": "'" +}, +{ +"f": 9221120237041090560 +} +] +] +} +], +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"s": "---" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 90\nparams:\n '+1': 2.0\n it's: 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\nstate: PRUNED\nuser_attrs:\n 0o7:\n '---':\n '''': .nan\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\n z9: 'word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word\n word word word word word word word word word word '\n 'a:':\n '&x': \"\\xE9\"\n 0o7: \"\\uFEFF\"\n ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : 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\n a a a a a a a a a a a a a b\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 'OFF'\n \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \": '---'\n 'on': 'Null'\nvalue: 1.5e+300\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "8" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9221120237041090560 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\u2029" +}, +{ +"s": "a\n b" +} +], +[ +{ +"s": "say \"hi\"" +}, +{ +"s": "a\n" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "-a" +}, +{ +"s": "*x" +} +], +[ +{ +"s": "? a" +}, +{ +"s": "1.0e+3" +} +], +[ +{ +"s": "&x" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 8\nparams:\n say \"hi\": 'a\n\n '\n ? \"\\P\"\n : \"a\\n b\"\nstate: RUNNING\nuser_attrs:\n '&x': []\n -a: '*x'\n '? a': '1.0e+3'\nvalue: .nan\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "36" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a" +}, +{ +"s": ":a" +} +], +[ +{ +"s": "values" +}, +{ +"s": "a b" +} +], +[ +{ +"s": "0:00:00.012345" +}, +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +} +], +[ +{ +"s": "!x" +}, +{ +"s": "`x`" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 36\nparams:\n '!x': '`x`'\n '0:00:00.012345': 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s '\n a: :a\n values: a b\nstate: COMPLETE\nuser_attrs: {}\nvalue: 1.0e-07\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "51" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "0o7" +}, +{ +"n": null +} +], +[ +{ +"s": "Null" +}, +{ +"f": -9223372036854775808 +} +], +[ +{ +"s": "\ta" +}, +{ +"s": "true" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +}, +{ +"s": "a:b" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 51\nparams:\n \"\\ta\": 'true'\n 0o7: null\n 'Null': -0.0\nstate: FAIL\nuser_attrs:\n xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx: a:b\nvalue: 1000000000000000000\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "66" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a\n b" +}, +{ +"s": "2026-1-2 3:04:05.5 +09:00" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 66\nparams:\n ? \"a\\n b\"\n : '2026-1-2 3:04:05.5 +09:00'\nstate: COMPLETE\nuser_attrs:\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b: {}\nvalue: -.inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "93" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\na" +}, +{ +"s": "0" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 93\nparams: {}\nstate: COMPLETE\nuser_attrs:\n ? '\n\n a'\n : '0'\nvalue: 123456789.123\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "73" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9221120237041090560 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "-.Inf" +}, +{ +"s": "a :b" +} +], +[ +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +}, +{ +"f": -4616189618054758400 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": " a" +}, +{ +"l": [ +{ +"l": [ +{ +"f": 4728057454355411894 +}, +{ +"s": "a " +}, +{ +"s": "*x" +} +] +}, +{ +"l": [ +{ +"s": "yes" +}, +{ +"i": "7" +}, +{ +"i": "-1099511627776" +} +] +}, +{ +"l": [] +}, +{ +"s": "1e3" +} +] +} +], +[ +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +}, +{ +"d": [ +[ +{ +"s": "a" +}, +{ +"s": "'" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -9223372036854775808 +}, +{ +"f": 9221120237041090560 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 73\nparams:\n '-.Inf': a :b\n ? 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n : -1.0\nstate: COMPLETE\nuser_attrs:\n ' a':\n - - 123456789.123\n - 'a '\n - '*x'\n - - 'yes'\n - 7\n - -1099511627776\n - []\n - 1e3\n \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \\xE9\":\n a: ''''\nvalue: .nan\nvalues:\n- -0.0\n- .nan\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "73" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "No" +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a " +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "a\\b" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "n_estimators" +}, +{ +"f": 4611686018427387904 +} +] +] +}, +{ +"f": 6103021453049119613 +}, +{ +"l": [ +{ +"s": "\u2028" +}, +{ +"f": -4503599627370496 +}, +{ +"s": "1.0e+3" +} +] +}, +{ +"l": [ +{ +"i": "-1" +} +] +} +] +} +], +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 73\nparams:\n 'No': null\nstate: PRUNED\nuser_attrs:\n 'a ':\n - a\\b: 1.0e+16\n n_estimators: 2.0\n - 1.0e+100\n - - \"\\L\"\n - -.inf\n - '1.0e+3'\n - - -1\n \"a\\U0001F600b\": {}\nvalue: 1.0e+16\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "40" +} +], +[ +{ +"s": "value" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\"" +}, +{ +"d": [ +[ +{ +"s": "''" +}, +{ +"d": [] +} +], +[ +{ +"s": "a \nb" +}, +{ +"d": [ +[ +{ +"s": " " +}, +{ +"s": "-a" +} +] +] +} +] +] +} +], +[ +{ +"s": "y" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 40\nparams: {}\nstate: RUNNING\nuser_attrs:\n '\"':\n '''''': {}\n ? \"a \\nb\"\n : ' ': -a\n y: []\nvalue: 9007199254740993\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "65" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"b": false +} +], +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"i": "1000000000000000000" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\u00e9" +}, +{ +"l": [ +{ +"s": "..." +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4728057454355411894 +}, +{ +"f": -9223372036854775808 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 65\nparams:\n \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \": 1000000000000000000\n \"\\u65E5\\u672C\\u8A9E\": false\nstate: FAIL\nuser_attrs:\n \"\\xE9\":\n - '...'\nvalue: 2.0\nvalues:\n- 123456789.123\n- -0.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "10" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "*x" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "~" +}, +{ +"s": "..." +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "''" +}, +{ +"i": "42" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 10\nparams:\n '*x': 1.0e+100\n '~': '...'\nstate: COMPLETE\nuser_attrs:\n '''''': 42\nvalue: 1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "37" +} +], +[ +{ +"s": "value" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "x" +}, +{ +"s": "{\"a\": [1, 2]}" +} +], +[ +{ +"s": "190:20:30" +}, +{ +"s": "on" +} +], +[ +{ +"s": "|x" +}, +{ +"f": 4614256656552045848 +} +], +[ +{ +"s": "1.e3" +}, +{ +"s": "\u00a0" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 37\nparams:\n 1.e3: \"\\_\"\n '190:20:30': 'on'\n x: '{\"a\": [1, 2]}'\n '|x': 3.141592653589793\nstate: FAIL\nuser_attrs: {}\nvalue: 1.0e+100\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "97" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "---" +}, +{ +"s": "|" +} +], +[ +{ +"s": "a\\b" +}, +{ +"s": "<<" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "=" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +} +], +[ +{ +"s": " a" +}, +{ +"l": [ +{ +"l": [ +{ +"i": "2147483648" +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +} +] +}, +{ +"d": [ +[ +{ +"s": ">" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "" +}, +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +} +], +[ +{ +"s": "0:00:00.012345" +}, +{ +"s": "~" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "[a]" +}, +{ +"s": "OFF" +} +], +[ +{ +"s": "*x" +}, +{ +"s": ": a" +} +], +[ +{ +"s": "1.e3" +}, +{ +"f": -4503599627370496 +} +] +] +}, +{ +"d": [ +[ +{ +"s": "{a}" +}, +{ +"f": 9221120237041090560 +} +], +[ +{ +"s": "y" +}, +{ +"s": "2026-1-2 3:04:05.5 +09:00" +} +], +[ +{ +"s": "1.5" +}, +{ +"s": "2026-11-10T22:51:17Z" +} +] +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 97\nparams:\n '---': '|'\n a\\b: '<<'\nstate: COMPLETE\nuser_attrs:\n ' a':\n - - 2147483648\n - aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b\n - ? ''\n : \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \"\n '0:00:00.012345': '~'\n '>': 2147483648\n - '*x': ': a'\n 1.e3: -.inf\n '[a]': 'OFF'\n - '1.5': '2026-11-10T22:51:17Z'\n y: '2026-1-2 3:04:05.5 +09:00'\n '{a}': .nan\n '=': 'word word word word word word word word word word word word word word word\n word word word word word '\nvalue: 1.0e+22\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "15" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "%x" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "0x1F" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "? a" +}, +{ +"s": "{\"a\": [1, 2]}" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 15\nparams:\n '%x': 2147483648\n '0x1F': 9007199254740993\n '? a': '{\"a\": [1, 2]}'\nstate: PRUNED\nuser_attrs: {}\nvalue: 1.0e+22\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "35" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\na" +}, +{ +"s": "a\n\nb" +} +], +[ +{ +"s": "\u2028" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "\u2029" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "2001-12-14t21:59:43.10-05:00" +}, +{ +"b": true +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"l": [] +} +], +[ +{ +"s": "+1" +}, +{ +"s": "a#b" +} +], +[ +{ +"s": "value" +}, +{ +"l": [ +{ +"s": "-1" +}, +{ +"d": [] +}, +{ +"l": [ +{ +"s": "a\u0000b" +}, +{ +"n": null +} +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4936209963552724370 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 35\nparams:\n ? '\n\n a'\n : 'a\n\n\n b'\n '2001-12-14t21:59:43.10-05:00': true\n ? \"\\L\"\n : 2.0\n ? \"\\P\"\n : 9007199254740993\nstate: RUNNING\nuser_attrs:\n '+1': a#b\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c: []\n value:\n - '-1'\n - {}\n - - \"a\\0b\"\n - null\nvalue: -1.0\nvalues:\n- 1.0e+22\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "54" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "na\u00efve" +}, +{ +"i": "1" +} +], +[ +{ +"s": "\u0007" +}, +{ +"s": "y" +} +], +[ +{ +"s": "~" +}, +{ +"i": "-1099511627776" +} +], +[ +{ +"s": "a\n\nb" +}, +{ +"s": "1e3" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "0o7" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "-" +} +] +}, +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +}, +{ +"d": [ +[ +{ +"s": "0x1F" +}, +{ +"i": "-1" +} +] +] +} +] +} +], +[ +{ +"s": "on" +}, +{ +"d": [ +[ +{ +"s": "007" +}, +{ +"s": "`x`" +} +], +[ +{ +"s": "n_estimators" +}, +{ +"b": false +} +], +[ +{ +"s": "a :b" +}, +{ +"d": [ +[ +{ +"s": "--" +}, +{ +"b": true +} +], +[ +{ +"s": "values" +}, +{ +"s": "*x" +} +], +[ +{ +"s": "0b101" +}, +{ +"f": -4503599627370496 +} +] +] +} +], +[ +{ +"s": ".NaN" +}, +{ +"l": [ +{ +"f": 0 +} +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -4503599627370496 +}, +{ +"f": 4861130398305394688 +}, +{ +"f": 4861130398305394688 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 54\nparams:\n \"\\a\": y\n ? 'a\n\n\n b'\n : 1e3\n \"na\\xEFve\": 1\n '~': -1099511627776\nstate: RUNNING\nuser_attrs:\n 0o7:\n - - '-'\n - 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n - '0x1F': -1\n 'on':\n '.NaN':\n - 0.0\n '007': '`x`'\n a :b:\n --: true\n '0b101': -.inf\n values: '*x'\n n_estimators: false\nvalue: 100.0\nvalues:\n- -.inf\n- 1.0e+17\n- 1.0e+17\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "43" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "0o7" +}, +{ +"s": "a\t" +} +], +[ +{ +"s": "{a}" +}, +{ +"f": 9218868437227405312 +} +], +[ +{ +"s": "it's" +}, +{ +"f": 1 +} +], +[ +{ +"s": "C:\\path\\to" +}, +{ +"i": "42" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "2026-11-10T22:51:17Z" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "a :b" +}, +{ +"f": 1 +} +], +[ +{ +"s": "--- x" +}, +{ +"s": "a" +} +] +] +}, +{ +"s": "a\ud83d\ude00b" +}, +{ +"i": "7" +}, +{ +"d": [ +[ +{ +"s": "a:" +}, +{ +"s": "1:30.5" +} +], +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"f": 9218868437227405312 +} +], +[ +{ +"s": "a\n" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "nan" +}, +{ +"f": 4728057454355411894 +} +] +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4607182418800017408 +}, +{ +"f": -4503599627370496 +}, +{ +"f": 6103021453049119613 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 43\nparams:\n 0o7: \"a\\t\"\n C:\\path\\to: 42\n it's: 5.0e-324\n '{a}': .inf\nstate: PRUNED\nuser_attrs:\n '2026-11-10T22:51:17Z':\n - '--- x': a\n a :b: 5.0e-324\n - \"a\\U0001F600b\"\n - 7\n - ? 'a\n\n '\n : 1.0e+22\n 'a:': '1:30.5'\n ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : .inf\n nan: 123456789.123\nvalue: 100.0\nvalues:\n- 1.0\n- -.inf\n- 1.0e+100\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "73" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a[0]" +}, +{ +"l": [ +{ +"l": [] +} +] +} +], +[ +{ +"s": " two leading" +}, +{ +"b": false +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 73\nparams: {}\nstate: FAIL\nuser_attrs:\n ' two leading': false\n a[0]:\n - []\nvalue: 1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "46" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4759972702479526251 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"d": [ +[ +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +}, +{ +"d": [ +[ +{ +"s": "[a]" +}, +{ +"s": "\na" +} +], +[ +{ +"s": "%x" +}, +{ +"f": -4503599627370496 +} +] +] +} +], +[ +{ +"s": "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 b" +}, +{ +"n": null +} +], +[ +{ +"s": "a b" +}, +{ +"l": [ +{ +"s": ".5" +} +] +} +], +[ +{ +"s": "007" +}, +{ +"l": [ +{ +"f": 4846369599423283200 +}, +{ +"s": "a\\b" +} +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 46\nparams: {}\nstate: PRUNED\nuser_attrs:\n \"\\u65E5\\u672C\\u8A9E\":\n '007':\n - 1.0e+16\n - a\\b\n a b:\n - '.5'\n 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 b: null\n xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx:\n '%x': -.inf\n '[a]': '\n\n a'\nvalue: -2.5e-10\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "25" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": ": a" +}, +{ +"s": "a #b" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 25\nparams:\n ': a': 'a #b'\nstate: RUNNING\nuser_attrs: {}\nvalue: -.inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "39" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9218868437227405312 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "-a" +}, +{ +"s": "<<" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 9097811302482466869 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 39\nparams:\n -a: '<<'\nstate: PRUNED\nuser_attrs: {}\nvalue: .inf\nvalues:\n- 1.5e+300\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "47" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "|" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "? a" +}, +{ +"s": "-.Inf" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +}, +{ +"i": "-1" +} +], +[ +{ +"s": "-1" +}, +{ +"s": "a \nb" +} +], +[ +{ +"s": "OFF" +}, +{ +"d": [ +[ +{ +"s": "`x`" +}, +{ +"l": [ +{ +"b": true +}, +{ +"i": "-1" +}, +{ +"s": "..." +}, +{ +"s": "a b" +} +] +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4607182418800017408 +}, +{ +"f": 9097811302482466869 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 47\nparams:\n '? a': '-.Inf'\n '|': 1.0e+100\nstate: COMPLETE\nuser_attrs:\n '-1': \"a \\nb\"\n 'OFF':\n '`x`':\n - true\n - -1\n - '...'\n - a b\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : []\n ? 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n : -1\nvalue: -1.0\nvalues:\n- 1.0\n- 1.5e+300\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "0" +} +], +[ +{ +"s": "value" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "*x" +}, +{ +"s": "a" +} +], +[ +{ +"s": "? a" +}, +{ +"s": "Null" +} +], +[ +{ +"s": ": a" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "\ufeff" +}, +{ +"s": "--- x" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 0\nparams:\n '*x': a\n ': a': 1000000000000000000\n '? a': 'Null'\n \"\\uFEFF\": '--- x'\nstate: RUNNING\nuser_attrs: {}\nvalue: -1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "0" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "yes" +}, +{ +"f": 4611686018427387904 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a\nb" +}, +{ +"l": [ +{ +"d": [] +} +] +} +], +[ +{ +"s": "2026-11-10T22:51:17Z" +}, +{ +"s": ".5" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 0\nparams:\n 'yes': 2.0\nstate: PRUNED\nuser_attrs:\n '2026-11-10T22:51:17Z': '.5'\n ? 'a\n\n b'\n : - {}\nvalue: 1.0e+22\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "92" +} +], +[ +{ +"s": "value" +}, +{ +"f": 1 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "1:30.5" +}, +{ +"s": "a:b" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a\u0000b" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "key: value # comment" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "C:\\path\\to" +} +], +[ +{ +"s": "\ud83d\ude00" +}, +{ +"b": false +} +], +[ +{ +"s": "a " +}, +{ +"s": "say \"hi\"" +} +] +] +} +] +} +], +[ +{ +"s": "007" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "&" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 92\nparams:\n '1:30.5': a:b\nstate: PRUNED\nuser_attrs:\n '007': -1.0\n \"a\\0b\":\n - 'a ': say \"hi\"\n 'key: value # comment': 1000000000000000000\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : C:\\path\\to\n \"\\U0001F600\": false\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '&'\nvalue: 5.0e-324\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "88" +} +], +[ +{ +"s": "value" +}, +{ +"i": "42" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\"" +}, +{ +"f": 4611686018427387904 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "-1" +}, +{ +"d": [ +[ +{ +"s": "\u2029" +}, +{ +"l": [ +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +}, +{ +"s": "<<" +}, +{ +"s": ">" +}, +{ +"s": "yes" +} +] +} +], +[ +{ +"s": "@x" +}, +{ +"s": "\"" +} +] +] +} +], +[ +{ +"s": "Null" +}, +{ +"d": [ +[ +{ +"s": "[a]" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": " a" +}, +{ +"l": [ +{ +"i": "-1099511627776" +}, +{ +"s": "a b" +}, +{ +"b": true +}, +{ +"s": "%x" +} +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 88\nparams:\n '\"': 2.0\nstate: PRUNED\nuser_attrs:\n '-1':\n '@x': '\"'\n ? \"\\P\"\n : - xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\n - '<<'\n - '>'\n - 'yes'\n 'Null':\n ' a':\n - -1099511627776\n - a b\n - true\n - '%x'\n '[a]': 2147483648\nvalue: 42\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "58" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4759972702479526251 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "a\\b" +} +], +[ +{ +"s": "a: b" +}, +{ +"s": "..." +} +], +[ +{ +"s": ">x" +}, +{ +"l": [ +{ +"l": [ +{ +"s": " a" +}, +{ +"s": " two leading" +}, +{ +"s": "a,b" +}, +{ +"f": 0 +} +] +}, +{ +"d": [ +[ +{ +"s": "1:30" +}, +{ +"s": "\u00e9" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "C:\\path\\to" +}, +{ +"s": "http://x.y/z?q=1#f" +} +], +[ +{ +"s": "a:b" +}, +{ +"s": "a\n b" +} +], +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"f": 1 +} +], +[ +{ +"s": "0" +}, +{ +"b": false +} +] +] +}, +{ +"d": [] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 58\nparams: {}\nstate: RUNNING\nuser_attrs:\n '>x':\n - - ' a'\n - ' two leading'\n - a,b\n - 0.0\n - '1:30': \"\\xE9\"\n - '0': false\n C:\\path\\to: http://x.y/z?q=1#f\n a:b: \"a\\n b\"\n '{\"a\": [1, 2]}': 5.0e-324\n - {}\n 'a: b': '...'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : a\\b\nvalue: -2.5e-10\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "50" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a b" +}, +{ +"s": "1" +} +], +[ +{ +"s": "!" +}, +{ +"s": ".inf" +} +], +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"n": null +} +], +[ +{ +"s": ":a" +}, +{ +"f": 4502148214488346440 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "!" +}, +{ +"d": [ +[ +{ +"s": "|" +}, +{ +"n": null +} +], +[ +{ +"s": "it's" +}, +{ +"d": [ +[ +{ +"s": "''" +}, +{ +"i": "1000000000000000000" +} +] +] +} +], +[ +{ +"s": ">x" +}, +{ +"l": [] +} +], +[ +{ +"s": "0:00:00.012345" +}, +{ +"i": "9007199254740993" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 50\nparams:\n '!': '.inf'\n :a: 1.0e-07\n a b: '1'\n '{\"a\": [1, 2]}': null\nstate: PRUNED\nuser_attrs:\n '!':\n '0:00:00.012345': 9007199254740993\n '>x': []\n it's:\n '''''': 1000000000000000000\n '|': null\nvalue: 1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "80" +} +], +[ +{ +"s": "value" +}, +{ +"f": -9223372036854775808 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a b" +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "|x" +}, +{ +"f": -4759972702479526251 +} +], +[ +{ +"s": "on" +}, +{ +"l": [] +} +], +[ +{ +"s": "!x" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 80\nparams:\n a b: aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b c\nstate: RUNNING\nuser_attrs:\n '!x': {}\n 'on': []\n '|x': -2.5e-10\nvalue: -0.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "55" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "~" +}, +{ +"i": "7" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": ": a" +}, +{ +"s": "a\n" +} +], +[ +{ +"s": "!x" +}, +{ +"s": "1_000" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 55\nparams:\n '~': 7\nstate: PRUNED\nuser_attrs:\n '!x': '1_000'\n ': a': 'a\n\n '\n \"a\\U0001F600b\": 1.0e+22\nvalue: 1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "29" +} +], +[ +{ +"s": "value" +}, +{ +"n": null +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": ".NaN" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "params" +}, +{ +"l": [ +{ +"d": [] +} +] +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [ +{ +"s": ".5" +} +] +} +], +[ +{ +"s": "190:20:30" +}, +{ +"s": ": a" +} +], +[ +{ +"s": "value" +}, +{ +"l": [ +{ +"s": "@x" +} +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 29\nparams: {}\nstate: PRUNED\nuser_attrs:\n '.NaN': 2147483648\n params:\n - {}\n 'word word word word word word word word word word word word word word word word word word word word ':\n '190:20:30': ': a'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : - '.5'\n value:\n - '@x'\nvalue: null\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "3" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\u2028" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "2026-11-10" +}, +{ +"s": "&x" +} +], +[ +{ +"s": "a\n\nb" +}, +{ +"b": false +} +], +[ +{ +"s": "0b101" +}, +{ +"f": 6103021453049119613 +} +] +] +}, +{ +"d": [ +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"f": 1 +} +], +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +} +], +[ +{ +"s": "n" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "na\u00efve" +}, +{ +"s": "1.0e+3" +} +] +] +} +] +} +], +[ +{ +"s": "1" +}, +{ +"d": [ +[ +{ +"s": "\ta" +}, +{ +"d": [ +[ +{ +"s": "yes" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"s": "007" +} +], +[ +{ +"s": "..." +}, +{ +"s": "a b" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"f": 4846369599423283200 +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 3\nparams: {}\nstate: FAIL\nuser_attrs:\n '1':\n \"\\ta\":\n '...': a b\n '2026-11-10 22:51:17': '007'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 1.0e+16\n 'yes': 1.0e+17\n ? \"\\L\"\n : - '0b101': 1.0e+100\n '2026-11-10': '&x'\n ? 'a\n\n\n b'\n : false\n - '2026-11-10 22:51:17': aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b\n http://x.y/z?q=1#f: 5.0e-324\n n: 2.0\n \"na\\xEFve\": '1.0e+3'\nvalue: -1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "5" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": ": a" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "|" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "\u2029" +} +], +[ +{ +"s": "-.Inf" +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "*x" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "OFF" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "---" +}, +{ +"s": "inf" +} +], +[ +{ +"s": "--- x" +}, +{ +"s": "- a" +} +], +[ +{ +"s": "a " +}, +{ +"s": "\ud83d\ude00" +} +] +] +}, +{ +"l": [ +{ +"s": " two leading" +}, +{ +"s": "'" +}, +{ +"s": "\u2028" +} +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 5\nparams:\n '-.Inf': null\n ': a': '2026-11-10 22:51:17'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : \"\\P\"\n '|': 2147483648\nstate: COMPLETE\nuser_attrs:\n '*x': 1.0\n 'OFF':\n - '---': inf\n '--- x': '- a'\n 'a ': \"\\U0001F600\"\n - - ' two leading'\n - ''''\n - \"\\L\"\nvalue: 100.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "18" +} +], +[ +{ +"s": "value" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "---" +}, +{ +"s": "a,b" +} +], +[ +{ +"s": "x" +}, +{ +"s": "---" +} +], +[ +{ +"s": " two leading" +}, +{ +"s": "|x" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 18\nparams:\n ' two leading': '|x'\n '---': a,b\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 1.0e+16\n x: '---'\nstate: PRUNED\nuser_attrs: {}\nvalue: 2147483648\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "47" +} +], +[ +{ +"s": "value" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 47\nparams: {}\nstate: PRUNED\nuser_attrs: {}\nvalue: 1.0e+100\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "92" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"s": "--" +} +], +[ +{ +"s": "1.0e+3" +}, +{ +"i": "1" +} +], +[ +{ +"s": "`x`" +}, +{ +"s": "2026-11-10" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "&x" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "2026-11-10" +}, +{ +"f": 9221120237041090560 +} +], +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"f": -4759972702479526251 +} +] +] +}, +{ +"s": "a:b" +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 92\nparams:\n '1.0e+3': 1\n '`x`': '2026-11-10'\n http://x.y/z?q=1#f: --\nstate: PRUNED\nuser_attrs:\n '&x':\n - '2026-11-10': .nan\n \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \": -2.5e-10\n - a:b\nvalue: 1000000000000000000\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "28" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "@x" +}, +{ +"f": 4636737291354636288 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "190:20:30" +}, +{ +"i": "7" +} +], +[ +{ +"s": "a\\b" +}, +{ +"d": [ +[ +{ +"s": "190:20:30" +}, +{ +"d": [ +[ +{ +"s": "true" +}, +{ +"s": "-1.5" +} +], +[ +{ +"s": "OFF" +}, +{ +"s": "1:30.5" +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4614256656552045848 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 28\nparams:\n '@x': 100.0\nstate: COMPLETE\nuser_attrs:\n '190:20:30': 7\n a\\b:\n '190:20:30':\n 'OFF': '1:30.5'\n 'true': '-1.5'\nvalue: 1.0e+22\nvalues:\n- 3.141592653589793\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "12" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a\t" +}, +{ +"s": "a #b" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a " +}, +{ +"d": [ +[ +{ +"s": "007" +}, +{ +"s": "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 b" +} +] +] +} +], +[ +{ +"s": "on" +}, +{ +"i": "2147483648" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 12\nparams:\n \"a\\t\": 'a #b'\nstate: FAIL\nuser_attrs:\n 'a ':\n '007': 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\n a a a a a a a a a a a a a a b\n 'on': 2147483648\nvalue: 1.5e+300\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "34" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "[a]" +}, +{ +"i": "0" +} +], +[ +{ +"s": "---" +}, +{ +"f": 4611686018427387904 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 34\nparams:\n '---': 2.0\n '[a]': 0\nstate: PRUNED\nuser_attrs: {}\nvalue: 2.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "0" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"s": "a:" +} +], +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"i": "42" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "true" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "!x" +}, +{ +"s": "\u00a0" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4728057454355411894 +}, +{ +"f": 4846369599423283200 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 0\nparams:\n \"a\\U0001F600b\": 'a:'\n \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \": 42\nstate: FAIL\nuser_attrs:\n '!x': \"\\_\"\n 'true': -1\nvalue: 1\nvalues:\n- 123456789.123\n- 1.0e+16\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "76" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4591870180066957722 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -4616189618054758400 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 76\nparams: {}\nstate: RUNNING\nuser_attrs: {}\nvalue: 0.1\nvalues:\n- -1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "17" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"i": "0" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "" +}, +{ +"d": [ +[ +{ +"s": "*" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": "\u0085" +}, +{ +"d": [ +[ +{ +"s": "n_estimators" +}, +{ +"l": [ +{ +"s": "1" +}, +{ +"s": "2026-1-2 3:04:05.5 +09:00" +} +] +} +], +[ +{ +"s": "1.0e+3" +}, +{ +"l": [ +{ +"s": "a\nb" +}, +{ +"s": "\u00e9" +}, +{ +"f": -4616189618054758400 +} +] +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"d": [ +[ +{ +"s": "Null" +}, +{ +"s": "a\t" +} +], +[ +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +}, +{ +"s": "---" +} +], +[ +{ +"s": "{a}" +}, +{ +"s": "'" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": ".NaN" +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4861130398305394688 +}, +{ +"f": -9223372036854775808 +}, +{ +"f": -4503599627370496 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 17\nparams:\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 0\nstate: FAIL\nuser_attrs:\n ? ''\n : '*': []\n ? \"\\N\"\n : '1.0e+3':\n - 'a\n\n b'\n - \"\\xE9\"\n - -1.0\n http://x.y/z?q=1#f:\n 'Null': \"a\\t\"\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '.NaN'\n xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx: '---'\n '{a}': ''''\n n_estimators:\n - '1'\n - '2026-1-2 3:04:05.5 +09:00'\nvalue: 1.0e+22\nvalues:\n- 1.0e+17\n- -0.0\n- -.inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "52" +} +], +[ +{ +"s": "value" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "lr" +}, +{ +"s": "!" +} +], +[ +{ +"s": "-.Inf" +}, +{ +"s": "0b101" +} +], +[ +{ +"s": ">" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "a \nb" +}, +{ +"f": 9097811302482466869 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "0b101" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "true" +}, +{ +"s": "2026-11-10T22:51:17Z" +} +], +[ +{ +"s": "=" +}, +{ +"i": "42" +} +], +[ +{ +"s": "\na" +}, +{ +"f": 4614256656552045848 +} +], +[ +{ +"s": "{a}" +}, +{ +"i": "1" +} +] +] +}, +{ +"l": [ +{ +"f": -9223372036854775808 +} +] +}, +{ +"l": [ +{ +"f": 4936209963552724370 +}, +{ +"i": "-1" +}, +{ +"i": "1" +}, +{ +"f": 1 +} +] +} +] +} +], +[ +{ +"s": "007" +}, +{ +"s": "OFF" +} +], +[ +{ +"s": "*" +}, +{ +"s": ">" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 52\nparams:\n '-.Inf': '0b101'\n '>': 2147483648\n ? \"a \\nb\"\n : 1.5e+300\n lr: '!'\nstate: PRUNED\nuser_attrs:\n '*': '>'\n '007': 'OFF'\n '0b101':\n - ? '\n\n a'\n : 3.141592653589793\n '=': 42\n 'true': '2026-11-10T22:51:17Z'\n '{a}': 1\n - - -0.0\n - - 1.0e+22\n - -1\n - 1\n - 5.0e-324\nvalue: 9007199254740993\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "37" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "1:30.5" +}, +{ +"s": "\u0007" +} +], +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"s": ":a" +} +], +[ +{ +"s": "1_000" +}, +{ +"s": "`x`" +} +], +[ +{ +"s": "-1" +}, +{ +"i": "42" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 37\nparams:\n '-1': 42\n '1:30.5': \"\\a\"\n '1_000': '`x`'\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b: :a\nstate: PRUNED\nuser_attrs: {}\nvalue: -1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "71" +} +], +[ +{ +"s": "value" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a\tb" +}, +{ +"s": "a #b" +} +], +[ +{ +"s": "x" +}, +{ +"i": "9007199254740993" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "nan" +}, +{ +"d": [ +[ +{ +"s": "\u00a0" +}, +{ +"s": ".NaN" +} +], +[ +{ +"s": "~" +}, +{ +"d": [ +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"i": "0" +} +], +[ +{ +"s": "y" +}, +{ +"s": "--- x" +} +] +] +} +] +] +} +], +[ +{ +"s": "a:b" +}, +{ +"d": [] +} +], +[ +{ +"s": "a\n b" +}, +{ +"d": [ +[ +{ +"s": "\u2029" +}, +{ +"d": [ +[ +{ +"s": "-1.5" +}, +{ +"s": "\\" +} +], +[ +{ +"s": "a :b" +}, +{ +"s": "a" +} +] +] +} +], +[ +{ +"s": "|" +}, +{ +"d": [ +[ +{ +"s": "-1.5" +}, +{ +"i": "1" +} +], +[ +{ +"s": "OFF" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "it's" +}, +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +} +], +[ +{ +"s": "#a" +}, +{ +"i": "-1099511627776" +} +] +] +} +], +[ +{ +"s": "it's" +}, +{ +"l": [ +{ +"s": "1.0e+3" +}, +{ +"s": "trailing two " +}, +{ +"i": "-1" +}, +{ +"s": " a" +} +] +} +], +[ +{ +"s": "@x" +}, +{ +"b": false +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 71\nparams:\n \"a\\tb\": 'a #b'\n x: 9007199254740993\nstate: FAIL\nuser_attrs:\n ? \"a\\n b\"\n : '@x': false\n it's:\n - '1.0e+3'\n - 'trailing two '\n - -1\n - ' a'\n '|':\n '#a': -1099511627776\n '-1.5': 1\n 'OFF': 1.0\n it's: \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \"\n ? \"\\P\"\n : '-1.5': \\\n a :b: a\n a:b: {}\n nan:\n '~':\n ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : 0\n y: '--- x'\n \"\\_\": '.NaN'\nvalue: 9007199254740993\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "34" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "@x" +}, +{ +"s": "a\n\nb" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "2026-11-10T22:51:17Z" +}, +{ +"f": 4614256656552045848 +} +], +[ +{ +"s": ".inf" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "0" +}, +{ +"s": "'" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"s": " " +} +], +[ +{ +"s": "OFF" +}, +{ +"s": "-" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "2001-12-14t21:59:43.10-05:00" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +}, +{ +"s": "a \nb" +} +], +[ +{ +"s": "1" +}, +{ +"s": "a\tb" +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"i": "-1" +} +] +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 34\nparams:\n '@x': 'a\n\n\n b'\nstate: COMPLETE\nuser_attrs:\n '.inf':\n - '0': ''''\n - 'OFF': '-'\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c: ' '\n - '1': \"a\\tb\"\n '2001-12-14t21:59:43.10-05:00': 1.0e+22\n \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \\xE9\": \"a\\\n \\ \\nb\"\n http://x.y/z?q=1#f: -1\n '2026-11-10T22:51:17Z': 3.141592653589793\nvalue: 1.5e+300\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "20" +} +], +[ +{ +"s": "value" +}, +{ +"f": 1 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 20\nparams: {}\nstate: FAIL\nuser_attrs: {}\nvalue: 5.0e-324\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "72" +} +], +[ +{ +"s": "value" +}, +{ +"i": "7" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 72\nparams: {}\nstate: PRUNED\nuser_attrs: {}\nvalue: 7\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "93" +} +], +[ +{ +"s": "value" +}, +{ +"n": null +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a\t" +}, +{ +"s": "a\n b" +} +], +[ +{ +"s": "&x" +}, +{ +"b": false +} +], +[ +{ +"s": "a #b" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "y" +}, +{ +"s": "a\u0000b" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 93\nparams:\n '&x': false\n \"a\\t\": \"a\\n b\"\n 'a #b': -.inf\n y: \"a\\0b\"\nstate: COMPLETE\nuser_attrs: {}\nvalue: null\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "17" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4759972702479526251 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\ufeff" +}, +{ +"s": "Null" +} +], +[ +{ +"s": "params" +}, +{ +"s": "2026-11-10 22:51:17" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 17\nparams:\n params: '2026-11-10 22:51:17'\n \"\\uFEFF\": 'Null'\nstate: PRUNED\nuser_attrs: {}\nvalue: -2.5e-10\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "53" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "1" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": "2026-11-10" +}, +{ +"s": "{a}" +} +], +[ +{ +"s": "\ud83d\ude00" +}, +{ +"i": "0" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\u00e9" +}, +{ +"b": false +} +], +[ +{ +"s": "params" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"s": "\u2029" +} +] +] +}, +{ +"i": "-1" +}, +{ +"l": [] +}, +{ +"l": [ +{ +"i": "9007199254740993" +}, +{ +"b": true +}, +{ +"s": "a\tb" +}, +{ +"s": "`x`" +} +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 53\nparams:\n '1': 1.0e+17\n '2026-11-10': '{a}'\n \"\\U0001F600\": 0\nstate: PRUNED\nuser_attrs:\n params:\n - '2026-11-10 22:51:17': \"\\P\"\n - -1\n - []\n - - 9007199254740993\n - true\n - \"a\\tb\"\n - '`x`'\n \"\\xE9\": false\nvalue: 1.0e+17\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "89" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "a,b" +} +], +[ +{ +"s": "a#b" +}, +{ +"s": "|" +} +], +[ +{ +"s": "value" +}, +{ +"s": "null" +} +], +[ +{ +"s": "1" +}, +{ +"s": "--- x" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "|x" +}, +{ +"d": [ +[ +{ +"s": "n_estimators" +}, +{ +"s": "a \nb" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [] +} +], +[ +{ +"s": "n" +}, +{ +"l": [ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"b": false +} +] +} +] +] +} +], +[ +{ +"s": "\\" +}, +{ +"l": [ +{ +"l": [] +}, +{ +"f": 4611686018427387904 +} +] +} +], +[ +{ +"s": " two leading" +}, +{ +"s": "-1.5" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4614256656552045848 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 89\nparams:\n '1': '--- x'\n a#b: '|'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : a,b\n value: 'null'\nstate: COMPLETE\nuser_attrs:\n ' two leading': '-1.5'\n \\:\n - []\n - 2.0\n '|x':\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : []\n n:\n - aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b\n - false\n n_estimators: \"a \\nb\"\nvalue: 1.0e+17\nvalues:\n- 3.141592653589793\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "48" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "|" +}, +{ +"s": "inf" +} +], +[ +{ +"s": "- a" +}, +{ +"s": "&" +} +], +[ +{ +"s": " a" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"s": "''" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 48\nparams:\n ' a': 1.0e-07\n '- a': '&'\n '2026-11-10 22:51:17': ''''''\n '|': inf\nstate: COMPLETE\nuser_attrs: {}\nvalue: -1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "87" +} +], +[ +{ +"s": "value" +}, +{ +"i": "42" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"s": "2026-1-2 3:04:05.5 +09:00" +} +], +[ +{ +"s": "inf" +}, +{ +"s": "OFF" +} +], +[ +{ +"s": "it's" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "[a]" +}, +{ +"s": "0b101" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "OFF" +}, +{ +"d": [ +[ +{ +"s": "1.e3" +}, +{ +"l": [ +{ +"s": "%x" +}, +{ +"s": "OFF" +} +] +} +], +[ +{ +"s": "OFF" +}, +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +} +] +] +} +], +[ +{ +"s": "key: value # comment" +}, +{ +"d": [ +[ +{ +"s": "a:" +}, +{ +"l": [ +{ +"f": 4636737291354636288 +}, +{ +"s": "yes" +}, +{ +"s": "1" +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +} +] +} +], +[ +{ +"s": "a[0]" +}, +{ +"s": ": a" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 87\nparams:\n '[a]': '0b101'\n inf: 'OFF'\n it's: -1.0\n '{\"a\": [1, 2]}': '2026-1-2 3:04:05.5 +09:00'\nstate: FAIL\nuser_attrs:\n 'OFF':\n 1.e3:\n - '%x'\n - 'OFF'\n 'OFF': 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n 'key: value # comment':\n 'a:':\n - 100.0\n - 'yes'\n - '1'\n - aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b\n a[0]: ': a'\nvalue: 42\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "16" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a #b" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "0x1F" +}, +{ +"s": "a b" +} +], +[ +{ +"s": "--- x" +}, +{ +"b": true +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "a :b" +} +], +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"s": "..." +} +], +[ +{ +"s": ">" +}, +{ +"l": [ +{ +"f": 4636737291354636288 +}, +{ +"l": [ +{ +"s": ">" +}, +{ +"f": -4616189618054758400 +} +] +}, +{ +"f": 4607182418800017408 +}, +{ +"s": "---" +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 16\nparams:\n '--- x': true\n '0x1F': a b\n 'a #b': 100.0\nstate: PRUNED\nuser_attrs:\n '>':\n - 100.0\n - - '>'\n - -1.0\n - 1.0\n - '---'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : a :b\n '{\"a\": [1, 2]}': '...'\nvalue: 123456789.123\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "79" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "Null" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "a: b" +}, +{ +"s": "- a" +} +], +[ +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +}, +{ +"f": 4636737291354636288 +} +] +] +}, +{ +"s": "--- x" +}, +{ +"d": [ +[ +{ +"s": "a\nb" +}, +{ +"s": ".NaN" +} +] +] +} +] +} +], +[ +{ +"s": "a: b" +}, +{ +"d": [ +[ +{ +"s": "&x" +}, +{ +"l": [ +{ +"i": "42" +}, +{ +"i": "42" +}, +{ +"f": 9218868437227405312 +} +] +} +], +[ +{ +"s": "'" +}, +{ +"l": [ +{ +"s": "%x" +}, +{ +"s": "\ta" +}, +{ +"s": "#a" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +} +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 0 +}, +{ +"f": 4636737291354636288 +}, +{ +"f": 9221120237041090560 +} +] +} +] +] +}, +"yaml": "datetime_complete: '2026-11-10 22:51:18'\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 79\nparams:\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 'Null'\nstate: FAIL\nuser_attrs:\n 'a: b':\n '&x':\n - 42\n - 42\n - .inf\n '''':\n - '%x'\n - \"\\ta\"\n - '#a'\n - 'word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word word '\n \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \\xE9\":\n - 'a: b': '- a'\n xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx: 100.0\n - '--- x'\n - ? 'a\n\n b'\n : '.NaN'\nvalue: 1\nvalues:\n- 0.0\n- 100.0\n- .nan\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "47" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\u00e9" +}, +{ +"s": ".NaN" +} +], +[ +{ +"s": "it's" +}, +{ +"f": 4591870180066957722 +} +], +[ +{ +"s": "2026-1-2 3:04:05.5 +09:00" +}, +{ +"s": ".inf" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "values" +}, +{ +"d": [] +} +], +[ +{ +"s": "n_estimators" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 47\nparams:\n '2026-1-2 3:04:05.5 +09:00': '.inf'\n it's: 0.1\n \"\\xE9\": '.NaN'\nstate: COMPLETE\nuser_attrs:\n n_estimators: []\n values: {}\nvalue: -.inf\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "58" +} +], +[ +{ +"s": "value" +}, +{ +"i": "42" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "1_000" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"s": "0x1F" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "!" +} +], +[ +{ +"s": ".NaN" +}, +{ +"s": "|" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: null\nnumber: 58\nparams:\n '.NaN': '|'\n '1_000': 1.0e-07\n '2026-11-10 22:51:17': '0x1F'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '!'\nstate: COMPLETE\nuser_attrs: {}\nvalue: 42\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "66" +} +], +[ +{ +"s": "value" +}, +{ +"n": null +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a b" +}, +{ +"s": "it's" +} +], +[ +{ +"s": "a: b" +}, +{ +"b": true +} +], +[ +{ +"s": "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 b" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"f": -4616189618054758400 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1:30" +}, +{ +"l": [ +{ +"s": "a,b" +} +] +} +], +[ +{ +"s": "1_000" +}, +{ +"s": "\\" +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"s": "1_000" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4861130398305394688 +}, +{ +"f": 9097811302482466869 +}, +{ +"f": 4614256656552045848 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: 0:00:01\nnumber: 66\nparams:\n a b: it's\n 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 b: 1000000000000000000\n 'a: b': true\n ? 'word word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word '\n : -1.0\nstate: COMPLETE\nuser_attrs:\n '1:30':\n - a,b\n '1_000': \\\n ? 'word word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word '\n : '1_000'\nvalue: null\nvalues:\n- 1.0e+17\n- 1.5e+300\n- 3.141592653589793\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "57" +} +], +[ +{ +"s": "value" +}, +{ +"f": 0 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a,b" +}, +{ +"s": ":a" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "@x" +}, +{ +"d": [ +[ +{ +"s": "\u00e9" +}, +{ +"i": "2147483648" +} +] +] +} +], +[ +{ +"s": "&" +}, +{ +"f": 4502148214488346440 +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 9221120237041090560 +}, +{ +"f": 4614256656552045848 +}, +{ +"f": 9221120237041090560 +} +] +} +] +] +}, +"yaml": "datetime_complete: null\ndatetime_start: '2026-11-10 22:51:17'\nduration: '0:00:00.012345'\nnumber: 57\nparams:\n a,b: :a\nstate: PRUNED\nuser_attrs:\n '&': 1.0e-07\n '@x':\n \"\\xE9\": 2147483648\nvalue: 0.0\nvalues:\n- .nan\n- 3.141592653589793\n- .nan\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "4" +} +], +[ +{ +"s": "value" +}, +{ +"f": -9223372036854775808 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "y" +}, +{ +"b": false +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a\nb" +}, +{ +"s": "*" +} +], +[ +{ +"s": "\ta" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "16" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "~" +}, +{ +"i": "42" +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"s": "na\u00efve" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1.5" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "-a" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "-.Inf" +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "a\tb" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "say \"hi\"" +}, +{ +"f": 4611686018427387904 +} +] +] +} +] +} +], +[ +{ +"s": "a" +}, +{ +"f": 4936209963552724370 +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 6103021453049119613 +} +] +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 4\n params:\n y: false\n state: COMPLETE\n user_attrs:\n \"\\ta\": {}\n ? 'a\n\n b'\n : '*'\n value: -0.0\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 16\n params:\n http://x.y/z?q=1#f: \"na\\xEFve\"\n '~': 42\n state: RUNNING\n user_attrs:\n '1.5':\n - '-.Inf': 123456789.123\n -a: 1000000000000000000\n \"a\\tb\": 1000000000000000000\n say \"hi\": 2.0\n a: 1.0e+22\n value: 1.5e+300\n values:\n - 1.0e+100\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "64" +} +], +[ +{ +"s": "value" +}, +{ +"n": null +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "--- x" +}, +{ +"d": [ +[ +{ +"s": "na\u00efve" +}, +{ +"d": [ +[ +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +}, +{ +"s": "#a" +} +], +[ +{ +"s": "0:00:00.012345" +}, +{ +"s": "\u00e9" +} +] +] +} +], +[ +{ +"s": ".NaN" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "nan" +}, +{ +"s": "a b" +} +] +] +} +], +[ +{ +"s": ".inf" +}, +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +} +], +[ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "48" +} +], +[ +{ +"s": "value" +}, +{ +"f": 1 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a \nb" +}, +{ +"s": " two leading" +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"b": false +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 1 +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "7" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9218868437227405312 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"s": "a,b" +} +], +[ +{ +"s": ".inf" +}, +{ +"b": true +} +], +[ +{ +"s": "\ta" +}, +{ +"s": "nan" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [ +[ +{ +"s": "? a" +}, +{ +"l": [ +{ +"f": 4607182418800017408 +}, +{ +"b": true +}, +{ +"f": 4502148214488346440 +}, +{ +"f": 4611686018427387904 +} +] +} +] +] +} +], +[ +{ +"s": "- a" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "trailing two " +}, +{ +"s": "\ufeff" +} +] +}, +{ +"l": [ +{ +"f": 0 +}, +{ +"s": ">x" +} +] +}, +{ +"s": ".inf" +} +] +} +], +[ +{ +"s": "\u00e9" +}, +{ +"l": [ +{ +"s": "\\" +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -4759972702479526251 +} +] +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 64\n params: {}\n state: FAIL\n user_attrs:\n '--- x':\n '.NaN': 1.0e-07\n nan: a b\n \"na\\xEFve\":\n '0:00:00.012345': \"\\xE9\"\n xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx: '#a'\n '.inf': \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa\\\n \\ bb aa bb aa bb aa bb \\xE9\"\n \"\\u65E5\\u672C\\u8A9E\": []\n value: null\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 48\n params: {}\n state: RUNNING\n user_attrs:\n ? \"a \\nb\"\n : ' two leading'\n http://x.y/z?q=1#f: false\n value: 5.0e-324\n values:\n - 5.0e-324\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 7\n params:\n \"\\ta\": nan\n '.inf': true\n \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \": a,b\n state: PRUNED\n user_attrs:\n '- a':\n - - 'trailing two '\n - \"\\uFEFF\"\n - - 0.0\n - '>x'\n - '.inf'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '? a':\n - 1.0\n - true\n - 1.0e-07\n - 2.0\n \"\\xE9\":\n - \\\n value: .inf\n values:\n - -2.5e-10\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "85" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "1:30" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "Null" +}, +{ +"s": "!" +} +], +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"s": "-" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -4503599627370496 +}, +{ +"f": -9223372036854775808 +}, +{ +"f": 6103021453049119613 +} +] +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 85\n params:\n '1:30': 9007199254740993\n 'Null': '!'\n ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : '-'\n state: COMPLETE\n user_attrs: {}\n value: 1\n values:\n - -.inf\n - -0.0\n - 1.0e+100\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "26" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "21" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "-a" +}, +{ +"i": "1" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"s": "1_000" +} +], +[ +{ +"s": "" +}, +{ +"b": true +} +], +[ +{ +"s": "{a}" +}, +{ +"d": [ +[ +{ +"s": "-a" +}, +{ +"d": [ +[ +{ +"s": "2001-12-14t21:59:43.10-05:00" +}, +{ +"i": "-1099511627776" +} +], +[ +{ +"s": "" +}, +{ +"s": "a#b" +} +], +[ +{ +"s": "lr" +}, +{ +"s": "\na" +} +], +[ +{ +"s": "---" +}, +{ +"b": false +} +] +] +} +], +[ +{ +"s": "'" +}, +{ +"l": [] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4614256656552045848 +} +] +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 26\n params: {}\n state: RUNNING\n user_attrs: {}\n value: 1.0e-07\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 21\n params:\n -a: 1\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : -.inf\n state: FAIL\n user_attrs:\n ? ''\n : true\n '2026-11-10 22:51:17': '1_000'\n '{a}':\n '''': []\n -a:\n ? ''\n : a#b\n '---': false\n '2001-12-14t21:59:43.10-05:00': -1099511627776\n lr: '\n\n a'\n value: 1.0\n values:\n - 3.141592653589793\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "94" +} +], +[ +{ +"s": "value" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "&" +}, +{ +"s": "-" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\na" +}, +{ +"s": ": a" +} +], +[ +{ +"s": "\u00e9" +}, +{ +"d": [ +[ +{ +"s": "0:00:00.012345" +}, +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +} +] +] +} +], +[ +{ +"s": "\ud83d\ude00" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "96" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "|x" +}, +{ +"s": "1" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 94\n params:\n '&': '-'\n state: PRUNED\n user_attrs:\n ? '\n\n a'\n : ': a'\n \"\\xE9\":\n '0:00:00.012345': 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n \"\\U0001F600\": []\n value: 2147483648\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 96\n params:\n '|x': '1'\n state: PRUNED\n user_attrs: {}\n value: 1.0e-07\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "13" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4591870180066957722 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "''" +}, +{ +"i": "42" +} +], +[ +{ +"s": "False" +}, +{ +"s": "na\u00efve" +} +], +[ +{ +"s": "a :b" +}, +{ +"s": "a\n" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "14" +} +], +[ +{ +"s": "value" +}, +{ +"n": null +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "value" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "a \nb" +}, +{ +"s": "--- x" +} +], +[ +{ +"s": "190:20:30" +}, +{ +"b": true +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "84" +} +], +[ +{ +"s": "value" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "{a}" +}, +{ +"n": null +} +], +[ +{ +"s": "OFF" +}, +{ +"s": "\na" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "0o7" +}, +{ +"d": [ +[ +{ +"s": "a,b" +}, +{ +"l": [ +{ +"s": "C:\\path\\to" +}, +{ +"s": "a\n\nb" +}, +{ +"i": "1" +} +] +} +] +] +} +], +[ +{ +"s": "a\t" +}, +{ +"d": [ +[ +{ +"s": "*" +}, +{ +"l": [ +{ +"f": 4728057454355411894 +}, +{ +"s": "2001-12-14t21:59:43.10-05:00" +} +] +} +], +[ +{ +"s": "1_000" +}, +{ +"s": "\\" +} +], +[ +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +}, +{ +"l": [ +{ +"s": "true" +}, +{ +"b": false +}, +{ +"s": "y" +}, +{ +"s": "C:\\path\\to" +} +] +} +] +] +} +], +[ +{ +"s": "007" +}, +{ +"d": [ +[ +{ +"s": "\u2029" +}, +{ +"d": [ +[ +{ +"s": "a,b" +}, +{ +"i": "1000000000000000000" +} +] +] +} +], +[ +{ +"s": "a: b" +}, +{ +"d": [ +[ +{ +"s": "2026-11-10" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": "a #b" +}, +{ +"f": 4607182418800017408 +} +] +] +} +], +[ +{ +"s": ">" +}, +{ +"i": "7" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4636737291354636288 +} +] +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 13\n params:\n '''''': 42\n 'False': \"na\\xEFve\"\n a :b: 'a\n\n '\n state: COMPLETE\n user_attrs: {}\n value: 0.1\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 14\n params:\n '190:20:30': true\n ? \"a \\nb\"\n : '--- x'\n value: 1.0e+22\n state: FAIL\n user_attrs: {}\n value: null\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 84\n params:\n 'OFF': '\n\n a'\n '{a}': null\n state: FAIL\n user_attrs:\n '007':\n '>': 7\n 'a: b':\n '2026-11-10': 1.0e+17\n 'a #b': 1.0\n ? \"\\P\"\n : a,b: 1000000000000000000\n 0o7:\n a,b:\n - C:\\path\\to\n - 'a\n\n\n b'\n - 1\n \"a\\t\":\n '*':\n - 123456789.123\n - '2001-12-14t21:59:43.10-05:00'\n '1_000': \\\n xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx:\n - 'true'\n - false\n - y\n - C:\\path\\to\n value: 1.0e+100\n values:\n - 100.0\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "81" +} +], +[ +{ +"s": "value" +}, +{ +"f": 1 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "190:20:30" +}, +{ +"s": "y" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": " a" +}, +{ +"d": [ +[ +{ +"s": "-.Inf" +}, +{ +"l": [ +{ +"b": false +}, +{ +"s": "? a" +} +] +} +], +[ +{ +"s": " " +}, +{ +"l": [ +{ +"i": "-1099511627776" +}, +{ +"b": true +}, +{ +"s": "190:20:30" +}, +{ +"f": 4728057454355411894 +} +] +} +], +[ +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +}, +{ +"d": [] +} +], +[ +{ +"s": "#a" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "64" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "2026-11-10T22:51:17Z" +}, +{ +"d": [ +[ +{ +"s": "yes" +}, +{ +"d": [ +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"s": "'" +} +], +[ +{ +"s": "a,b" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "..." +}, +{ +"i": "-1" +} +], +[ +{ +"s": "&x" +}, +{ +"s": "1:30.5" +} +] +] +} +], +[ +{ +"s": "1.e3" +}, +{ +"d": [ +[ +{ +"s": "''" +}, +{ +"f": 9221120237041090560 +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -4616189618054758400 +}, +{ +"f": 0 +}, +{ +"f": 4861130398305394688 +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "28" +} +], +[ +{ +"s": "value" +}, +{ +"f": -9223372036854775808 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "OFF" +}, +{ +"s": "a\nb" +} +], +[ +{ +"s": "true" +}, +{ +"s": "?a" +} +], +[ +{ +"s": "No" +}, +{ +"s": "1:30.5" +} +], +[ +{ +"s": "007" +}, +{ +"s": "`x`" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "'" +}, +{ +"l": [ +{ +"s": " a" +}, +{ +"d": [ +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"s": "a\\b" +} +], +[ +{ +"s": "? a" +}, +{ +"s": "0" +} +], +[ +{ +"s": "'" +}, +{ +"s": "a #b" +} +], +[ +{ +"s": " a" +}, +{ +"f": 4502148214488346440 +} +] +] +} +] +} +], +[ +{ +"s": "a " +}, +{ +"l": [ +{ +"l": [ +{ +"i": "7" +}, +{ +"s": "1.0e+3" +} +] +}, +{ +"f": 4611686018427387904 +}, +{ +"s": "a " +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 81\n params:\n '190:20:30': y\n state: RUNNING\n user_attrs:\n ' a':\n ' ':\n - -1099511627776\n - true\n - '190:20:30'\n - 123456789.123\n '#a': []\n '-.Inf':\n - false\n - '? a'\n xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx: {}\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b: []\n value: 5.0e-324\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 64\n params: {}\n state: FAIL\n user_attrs:\n '2026-11-10T22:51:17Z':\n 1.e3:\n '''''': .nan\n 'yes':\n '&x': '1:30.5'\n '...': -1\n a,b: -1\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b: ''''\n value: 1.0e+17\n values:\n - -1.0\n - 0.0\n - 1.0e+17\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 28\n params:\n '007': '`x`'\n 'No': '1:30.5'\n 'OFF': 'a\n\n b'\n 'true': ?a\n state: COMPLETE\n user_attrs:\n '''':\n - ' a'\n - ' a': 1.0e-07\n '''': 'a #b'\n '? a': '0'\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c: a\\b\n 'a ':\n - - 7\n - '1.0e+3'\n - 2.0\n - 'a '\n value: -0.0\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "29" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "-1" +}, +{ +"l": [] +} +], +[ +{ +"s": "-" +}, +{ +"s": "\na" +} +], +[ +{ +"s": "x" +}, +{ +"d": [ +[ +{ +"s": "+1" +}, +{ +"s": "|x" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "68" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9221120237041090560 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "--- x" +}, +{ +"i": "1" +} +], +[ +{ +"s": "C:\\path\\to" +}, +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +} +], +[ +{ +"s": "No" +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "<<" +}, +{ +"f": -4759972702479526251 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": ">x" +}, +{ +"s": "na\u00efve" +} +], +[ +{ +"s": "a :b" +}, +{ +"i": "7" +} +], +[ +{ +"s": "%x" +}, +{ +"d": [ +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"b": true +} +], +[ +{ +"s": "a :b" +}, +{ +"l": [] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 29\n params: {}\n state: PRUNED\n user_attrs:\n '-': '\n\n a'\n '-1': []\n x:\n '+1': '|x'\n value: 1.5e+300\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 68\n params:\n '--- x': 1\n '<<': -2.5e-10\n C:\\path\\to: \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \"\n 'No': 123456789.123\n state: COMPLETE\n user_attrs:\n '%x':\n a :b: []\n \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \": true\n '>x': \"na\\xEFve\"\n a :b: 7\n value: .nan\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "1" +} +], +[ +{ +"s": "value" +}, +{ +"i": "-1099511627776" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "0x1F" +}, +{ +"d": [ +[ +{ +"s": "value" +}, +{ +"l": [] +} +], +[ +{ +"s": "true" +}, +{ +"b": true +} +], +[ +{ +"s": "-1.5" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "n_estimators" +}, +{ +"f": 4502148214488346440 +} +] +] +} +], +[ +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "-.Inf" +}, +{ +"f": -4503599627370496 +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "18" +} +], +[ +{ +"s": "value" +}, +{ +"f": 1 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "yes" +}, +{ +"s": "n" +} +], +[ +{ +"s": "a " +}, +{ +"i": "-1099511627776" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "?a" +}, +{ +"d": [ +[ +{ +"s": "y" +}, +{ +"s": "1:30" +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"f": 4614256656552045848 +} +], +[ +{ +"s": "'" +}, +{ +"b": true +} +], +[ +{ +"s": "a\n\nb" +}, +{ +"l": [ +{ +"f": 0 +}, +{ +"s": "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 b" +} +] +} +] +] +} +], +[ +{ +"s": "a\\b" +}, +{ +"s": "=" +} +], +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "9" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "*" +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "- a" +}, +{ +"s": "%x" +} +], +[ +{ +"s": "*" +}, +{ +"s": "trailing two " +} +], +[ +{ +"s": "OFF" +}, +{ +"d": [ +[ +{ +"s": "a :b" +}, +{ +"l": [ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"s": "-1" +}, +{ +"n": null +}, +{ +"b": false +} +] +} +], +[ +{ +"s": "|" +}, +{ +"f": 4591870180066957722 +} +], +[ +{ +"s": "2001-12-14t21:59:43.10-05:00" +}, +{ +"d": [ +[ +{ +"s": "!x" +}, +{ +"s": ".NaN" +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 1\n params: {}\n state: PRUNED\n user_attrs:\n '-.Inf': -.inf\n '0x1F':\n '-1.5': -1.0\n n_estimators: 1.0e-07\n 'true': true\n value: []\n xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx: 1000000000000000000\n value: -1099511627776\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 18\n params:\n 'a ': -1099511627776\n 'yes': n\n state: COMPLETE\n user_attrs:\n ?a:\n '''': true\n ? 'a\n\n\n b'\n : - 0.0\n - 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\n a a a a a a a a a a a a a a b\n http://x.y/z?q=1#f: 3.141592653589793\n y: '1:30'\n a\\b: '='\n '{\"a\": [1, 2]}': {}\n value: 5.0e-324\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 9\n params:\n '*': null\n state: RUNNING\n user_attrs:\n '*': 'trailing two '\n '- a': '%x'\n 'OFF':\n '2001-12-14t21:59:43.10-05:00':\n '!x': '.NaN'\n a :b:\n - aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b\n - '-1'\n - null\n - false\n '|': 0.1\n value: 1.0\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "74" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "a b" +}, +{ +"s": "2026-1-2 3:04:05.5 +09:00" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4607182418800017408 +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "42" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "true" +}, +{ +"s": "a :b" +} +], +[ +{ +"s": "&x" +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "a #b" +}, +{ +"f": 1 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "!x" +}, +{ +"b": true +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 74\n params:\n a b: '2026-1-2 3:04:05.5 +09:00'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 123456789.123\n state: COMPLETE\n user_attrs: {}\n value: 1\n values:\n - 1.0\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 42\n params:\n '&x': 123456789.123\n 'a #b': 5.0e-324\n 'true': a :b\n state: RUNNING\n user_attrs:\n '!x': true\n value: 1.0\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "92" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9218868437227405312 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a, b" +}, +{ +"s": "!x" +} +], +[ +{ +"s": "yes" +}, +{ +"s": "-1.5" +} +], +[ +{ +"s": "nan" +}, +{ +"s": "007" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": " a" +}, +{ +"d": [ +[ +{ +"s": "a\n\nb" +}, +{ +"f": 9097811302482466869 +} +] +] +} +], +[ +{ +"s": "a b" +}, +{ +"d": [ +[ +{ +"s": "n" +}, +{ +"l": [ +{ +"s": "--" +}, +{ +"s": "yes" +}, +{ +"i": "42" +}, +{ +"b": true +} +] +} +] +] +} +], +[ +{ +"s": "1_000" +}, +{ +"f": 0 +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "93" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "1" +}, +{ +"s": "" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "0b101" +}, +{ +"l": [ +{ +"d": [] +}, +{ +"l": [] +}, +{ +"f": 4636737291354636288 +}, +{ +"s": "-a" +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 92\n params:\n a, b: '!x'\n nan: '007'\n 'yes': '-1.5'\n state: FAIL\n user_attrs:\n ' a':\n ? 'a\n\n\n b'\n : 1.5e+300\n '1_000': 0.0\n a b:\n n:\n - --\n - 'yes'\n - 42\n - true\n value: .inf\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 93\n params:\n '1': ''\n state: FAIL\n user_attrs:\n '0b101':\n - {}\n - []\n - 100.0\n - -a\n value: 100.0\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "82" +} +], +[ +{ +"s": "value" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "max_depth" +}, +{ +"s": "-.Inf" +} +], +[ +{ +"s": "\u00e9" +}, +{ +"f": 9221120237041090560 +} +], +[ +{ +"s": "0x1F" +}, +{ +"i": "42" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "''" +}, +{ +"s": "190:20:30" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4614256656552045848 +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "21" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": ": a" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "trailing two " +}, +{ +"s": "\\" +} +], +[ +{ +"s": "a" +}, +{ +"i": "0" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": ".5" +}, +{ +"s": "|x" +} +], +[ +{ +"s": "a #b" +}, +{ +"d": [ +[ +{ +"s": "a\nb" +}, +{ +"f": -4616189618054758400 +} +] +] +} +], +[ +{ +"s": "1_000" +}, +{ +"i": "-1099511627776" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4636737291354636288 +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "27" +} +], +[ +{ +"s": "value" +}, +{ +"n": null +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a :b" +}, +{ +"s": ">x" +} +], +[ +{ +"s": "<<" +}, +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 82\n params:\n '0x1F': 42\n max_depth: '-.Inf'\n \"\\xE9\": .nan\n state: FAIL\n user_attrs:\n '''''': '190:20:30'\n value: 9007199254740993\n values:\n - 3.141592653589793\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 21\n params:\n ': a': -1\n a: 0\n 'trailing two ': \\\n state: PRUNED\n user_attrs:\n '.5': '|x'\n '1_000': -1099511627776\n 'a #b':\n ? 'a\n\n b'\n : -1.0\n value: 100.0\n values:\n - 100.0\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 27\n params:\n '<<': 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n a :b: '>x'\n state: RUNNING\n user_attrs: {}\n value: null\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "86" +} +], +[ +{ +"s": "value" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "!" +}, +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "0" +} +], +[ +{ +"s": "value" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1_000" +}, +{ +"d": [] +} +], +[ +{ +"s": "`x`" +}, +{ +"l": [ +{ +"l": [] +}, +{ +"l": [ +{ +"s": "a b" +} +] +}, +{ +"s": "2026-11-10T22:51:17Z" +}, +{ +"l": [ +{ +"f": 4611686018427387904 +} +] +} +] +} +], +[ +{ +"s": "+1" +}, +{ +"d": [ +[ +{ +"s": "*" +}, +{ +"s": "&" +} +], +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"d": [ +[ +{ +"s": "\u00e9" +}, +{ +"f": -4759972702479526251 +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "0" +} +], +[ +{ +"s": "value" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "{a}" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": " two leading" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "1e3" +}, +{ +"s": "a\n\nb" +} +], +[ +{ +"s": "lr" +}, +{ +"s": "\u00a0" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 86\n params: {}\n state: FAIL\n user_attrs:\n '!': xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\n value: 9007199254740993\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 0\n params: {}\n state: FAIL\n user_attrs:\n '+1':\n '*': '&'\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c:\n \"\\xE9\": -2.5e-10\n '1_000': {}\n '`x`':\n - []\n - - a b\n - '2026-11-10T22:51:17Z'\n - - 2.0\n value: 9007199254740993\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 0\n params:\n ' two leading': -1.0\n 1e3: 'a\n\n\n b'\n lr: \"\\_\"\n '{a}': -1.0\n state: COMPLETE\n user_attrs: {}\n value: 1.0e+100\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "46" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "[a]" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "-" +}, +{ +"i": "-1" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "88" +} +], +[ +{ +"s": "value" +}, +{ +"i": "-1099511627776" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "\u2029" +} +], +[ +{ +"s": "''" +}, +{ +"s": "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 b" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [ +{ +"l": [ +{ +"i": "0" +}, +{ +"s": "0o7" +}, +{ +"s": "0o7" +}, +{ +"s": "a b" +} +] +}, +{ +"d": [] +}, +{ +"l": [ +{ +"f": 4846369599423283200 +}, +{ +"s": "!x" +}, +{ +"s": "?a" +} +] +}, +{ +"l": [ +{ +"f": 4728057454355411894 +}, +{ +"f": 1 +}, +{ +"f": 4728057454355411894 +} +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 9097811302482466869 +} +] +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 46\n params:\n '-': -1\n '[a]': 1.5e+300\n state: FAIL\n user_attrs: {}\n value: 123456789.123\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 88\n params:\n '''''': 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\n a a a a a a a a a a a a a a a b\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : \"\\P\"\n state: PRUNED\n user_attrs:\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : - - 0\n - 0o7\n - 0o7\n - a b\n - {}\n - - 1.0e+16\n - '!x'\n - ?a\n - - 123456789.123\n - 5.0e-324\n - 123456789.123\n value: -1099511627776\n values:\n - 1.5e+300\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "87" +} +], +[ +{ +"s": "value" +}, +{ +"i": "42" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "-1.5" +}, +{ +"s": "a b" +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"i": "-1" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 0 +}, +{ +"f": 1 +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "86" +} +], +[ +{ +"s": "value" +}, +{ +"n": null +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "=" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "a: b" +}, +{ +"n": null +} +], +[ +{ +"s": "0o7" +}, +{ +"s": "False" +} +], +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"s": "a\nb" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "52" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a\u0000b" +}, +{ +"s": "a " +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a\n\nb" +}, +{ +"d": [ +[ +{ +"s": "No" +}, +{ +"l": [ +{ +"f": 4607182418800017408 +}, +{ +"f": 4936209963552724370 +} +] +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 9218868437227405312 +} +] +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 87\n params:\n '-1.5': a b\n http://x.y/z?q=1#f: -1\n state: RUNNING\n user_attrs: {}\n value: 42\n values:\n - 0.0\n - 5.0e-324\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 86\n params:\n 0o7: 'False'\n '=': 1.0\n 'a: b': null\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b: 'a\n\n b'\n state: COMPLETE\n user_attrs: {}\n value: null\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 52\n params:\n \"a\\0b\": 'a '\n state: COMPLETE\n user_attrs:\n ? 'a\n\n\n b'\n : 'No':\n - 1.0\n - 1.0e+22\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : {}\n value: 1.0\n values:\n - .inf\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "82" +} +], +[ +{ +"s": "value" +}, +{ +"f": 0 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "0x1F" +}, +{ +"i": "1" +} +], +[ +{ +"s": "2026-11-10" +}, +{ +"s": ">x" +} +], +[ +{ +"s": "OFF" +}, +{ +"b": false +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "<<" +}, +{ +"f": 9221120237041090560 +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "54" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a b" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "*x" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "1.5" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a, b" +}, +{ +"l": [ +{ +"b": true +}, +{ +"s": ":a" +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4614256656552045848 +}, +{ +"f": -4503599627370496 +}, +{ +"f": -9223372036854775808 +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "38" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a\n b" +}, +{ +"s": "-" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "a\\b" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 82\n params:\n '0x1F': 1\n '2026-11-10': '>x'\n 'OFF': false\n state: RUNNING\n user_attrs:\n '<<': .nan\n value: 0.0\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 54\n params:\n '*x': 'word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word word '\n a b: 100.0\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '1.5'\n state: PRUNED\n user_attrs:\n a, b:\n - true\n - :a\n value: 1.0e+22\n values:\n - 3.141592653589793\n - -.inf\n - -0.0\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 38\n params:\n ? \"a\\n b\"\n : '-'\n state: COMPLETE\n user_attrs:\n '1': 100.0\n a\\b: {}\n value: 1.0e+16\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "43" +} +], +[ +{ +"s": "value" +}, +{ +"i": "42" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 43\n params: {}\n state: COMPLETE\n user_attrs:\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : {}\n value: 42\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "68" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "1.0e+3" +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": ": a" +}, +{ +"s": "No" +} +], +[ +{ +"s": "{a}" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "0o7" +}, +{ +"s": "#a" +} +], +[ +{ +"s": "\"" +}, +{ +"s": "-a" +} +] +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 68\n params:\n '1.0e+3': null\n state: COMPLETE\n user_attrs:\n ': a': 'No'\n '{a}':\n - '\"': -a\n 0o7: '#a'\n value: 2.0\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "79" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "nan" +}, +{ +"s": "a\ud83d\ude00b" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "-1.5" +}, +{ +"d": [] +} +], +[ +{ +"s": "values" +}, +{ +"d": [] +} +], +[ +{ +"s": "<<" +}, +{ +"l": [ +{ +"s": "2026-11-10T22:51:17Z" +}, +{ +"d": [ +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": " " +}, +{ +"s": ".5" +} +], +[ +{ +"s": "&" +}, +{ +"s": "1.0e+3" +} +], +[ +{ +"s": ".NaN" +}, +{ +"b": true +} +] +] +}, +{ +"d": [ +[ +{ +"s": "nan" +}, +{ +"s": "a :b" +} +], +[ +{ +"s": "0" +}, +{ +"s": "2026-1-2 3:04:05.5 +09:00" +} +] +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "63" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"s": "na\u00efve" +} +], +[ +{ +"s": "-1.5" +}, +{ +"f": -9223372036854775808 +} +], +[ +{ +"s": "trailing two " +}, +{ +"f": 4614256656552045848 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "x" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 79\n params:\n nan: \"a\\U0001F600b\"\n state: COMPLETE\n user_attrs:\n '-1.5': {}\n '<<':\n - '2026-11-10T22:51:17Z'\n - ' ': '.5'\n '&': '1.0e+3'\n '.NaN': true\n http://x.y/z?q=1#f: 1.0e+100\n - '0': '2026-1-2 3:04:05.5 +09:00'\n nan: a :b\n values: {}\n value: 1000000000000000000\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 63\n params:\n '-1.5': -0.0\n 'trailing two ': 3.141592653589793\n ? 'word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word word '\n : \"na\\xEFve\"\n state: COMPLETE\n user_attrs:\n x: {}\n value: 1.0e+17\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "75" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a\tb" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "a\n" +}, +{ +"s": "!" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "y" +}, +{ +"s": "---" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "77" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "OFF" +}, +{ +"i": "2147483648" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -4759972702479526251 +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "59" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4614256656552045848 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "-1" +}, +{ +"s": "\u2028" +} +], +[ +{ +"s": "true" +}, +{ +"s": "`x`" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "max_depth" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [ +[ +{ +"s": "\na" +}, +{ +"b": true +} +] +] +} +], +[ +{ +"s": "lr" +}, +{ +"d": [ +[ +{ +"s": "=" +}, +{ +"b": true +} +] +] +} +] +] +} +], +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"s": "a b" +} +], +[ +{ +"s": "!x" +}, +{ +"d": [ +[ +{ +"s": "2026-11-10T22:51:17Z" +}, +{ +"l": [ +{ +"f": 9221120237041090560 +}, +{ +"i": "42" +}, +{ +"f": -4616189618054758400 +}, +{ +"s": "0:00:00.012345" +} +] +} +], +[ +{ +"s": "1.5" +}, +{ +"s": "\u2028" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": " a" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 75\n params:\n \"a\\tb\": 1.0e+100\n ? 'a\n\n '\n : '!'\n state: PRUNED\n user_attrs:\n y: '---'\n value: 1.0e-07\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 77\n params:\n 'OFF': 2147483648\n state: RUNNING\n user_attrs: {}\n value: 1.0e-07\n values:\n - -2.5e-10\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 59\n params:\n '-1': \"\\L\"\n 'true': '`x`'\n state: PRUNED\n user_attrs:\n '!x':\n '1.5': \"\\L\"\n '2026-11-10T22:51:17Z':\n - .nan\n - 42\n - -1.0\n - '0:00:00.012345'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : ' a'\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c: a b\n max_depth:\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : ? '\n\n a'\n : true\n lr:\n '=': true\n value: 3.141592653589793\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "70" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"i": "-1" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "13" +} +], +[ +{ +"s": "value" +}, +{ +"i": "-1099511627776" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "%x" +}, +{ +"d": [ +[ +{ +"s": "a:b" +}, +{ +"d": [ +[ +{ +"s": "a #b" +}, +{ +"s": "?a" +} +], +[ +{ +"s": "..." +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +} +], +[ +{ +"s": "`x`" +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": "x" +}, +{ +"s": "\"" +} +], +[ +{ +"s": "=" +}, +{ +"d": [ +[ +{ +"s": "{a}" +}, +{ +"s": "a: b" +} +], +[ +{ +"s": "a: b" +}, +{ +"b": true +} +] +] +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"l": [ +{ +"s": "''" +}, +{ +"s": "1.5" +}, +{ +"i": "7" +}, +{ +"s": "say \"hi\"" +} +] +} +] +] +} +], +[ +{ +"s": "" +}, +{ +"l": [ +{ +"i": "7" +}, +{ +"d": [ +[ +{ +"s": "---" +}, +{ +"f": -4759972702479526251 +} +], +[ +{ +"s": "\u0007" +}, +{ +"s": "1_000" +} +], +[ +{ +"s": "<<" +}, +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +} +], +[ +{ +"s": "a,b" +}, +{ +"f": 9221120237041090560 +} +] +] +}, +{ +"d": [ +[ +{ +"s": "-1.5" +}, +{ +"f": 4591870180066957722 +} +], +[ +{ +"s": "C:\\path\\to" +}, +{ +"s": "-.Inf" +} +], +[ +{ +"s": "2026-11-10T22:51:17Z" +}, +{ +"s": "|" +} +] +] +}, +{ +"l": [ +{ +"s": "2026-11-10T22:51:17Z" +}, +{ +"i": "1" +}, +{ +"i": "0" +} +] +} +] +} +], +[ +{ +"s": "*x" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "26" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "OFF" +}, +{ +"s": "a\\b" +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +}, +{ +"b": true +} +], +[ +{ +"s": "y" +}, +{ +"s": "|" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 70\n params:\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : -1\n state: PRUNED\n user_attrs: {}\n value: -.inf\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 13\n params: {}\n state: RUNNING\n user_attrs:\n ? ''\n : - 7\n - \"\\a\": '1_000'\n '---': -2.5e-10\n '<<': \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \"\n a,b: .nan\n - '-1.5': 0.1\n '2026-11-10T22:51:17Z': '|'\n C:\\path\\to: '-.Inf'\n - - '2026-11-10T22:51:17Z'\n - 1\n - 0\n '%x':\n '=':\n 'a: b': true\n '{a}': 'a: b'\n a:b:\n '...': 'word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word\n word word word word word word word word word word word '\n '`x`': null\n 'a #b': ?a\n http://x.y/z?q=1#f:\n - ''''''\n - '1.5'\n - 7\n - say \"hi\"\n x: '\"'\n '*x': {}\n value: -1099511627776\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 26\n params:\n 'OFF': a\\b\n 'word word word word word word word word word word word word word word word word word word word word ': true\n y: '|'\n state: FAIL\n user_attrs: {}\n value: 1000000000000000000\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "29" +} +], +[ +{ +"s": "value" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\ta" +}, +{ +"s": "190:20:30" +} +], +[ +{ +"s": "1.5" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": "---" +}, +{ +"i": "42" +} +], +[ +{ +"s": "\ud83d\ude00" +}, +{ +"f": 4611686018427387904 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4607182418800017408 +} +] +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 29\n params:\n \"\\ta\": '190:20:30'\n '---': 42\n '1.5': 1.0e+17\n \"\\U0001F600\": 2.0\n state: COMPLETE\n user_attrs: {}\n value: 1.0e+100\n values:\n - 1.0\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "17" +} +], +[ +{ +"s": "value" +}, +{ +"f": 0 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a \nb" +}, +{ +"f": 9221120237041090560 +} +], +[ +{ +"s": "OFF" +}, +{ +"s": "*x" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"s": "say \"hi\"" +} +], +[ +{ +"s": ":a" +}, +{ +"l": [] +} +], +[ +{ +"s": "..." +}, +{ +"s": "190:20:30" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "84" +} +], +[ +{ +"s": "value" +}, +{ +"f": 0 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a\tb" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "2026-11-10" +}, +{ +"s": "say \"hi\"" +} +], +[ +{ +"s": "`x`" +}, +{ +"i": "0" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\u0007" +}, +{ +"l": [ +{ +"f": 9221120237041090560 +} +] +} +], +[ +{ +"s": "value" +}, +{ +"l": [ +{ +"s": "a\ud83d\ude00b" +} +] +} +], +[ +{ +"s": "*x" +}, +{ +"d": [ +[ +{ +"s": "''" +}, +{ +"s": "a\n" +} +], +[ +{ +"s": "=" +}, +{ +"f": 6103021453049119613 +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -9223372036854775808 +}, +{ +"f": 0 +} +] +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 17\n params:\n 'OFF': '*x'\n ? \"a \\nb\"\n : .nan\n state: PRUNED\n user_attrs:\n '...': '190:20:30'\n :a: []\n \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \": say\n \"hi\"\n value: 0.0\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 84\n params:\n '2026-11-10': say \"hi\"\n '`x`': 0\n \"a\\tb\": 1.0e+22\n state: RUNNING\n user_attrs:\n params:\n \"\\a\":\n - .nan\n '*x':\n '''''': 'a\n\n '\n '=': 1.0e+100\n value:\n - \"a\\U0001F600b\"\n value: 0.0\n values:\n - -0.0\n - 0.0\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "71" +} +], +[ +{ +"s": "value" +}, +{ +"f": 0 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a :b" +}, +{ +"b": false +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "-1" +}, +{ +"d": [ +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"l": [ +{ +"f": 4611686018427387904 +} +] +} +] +] +} +], +[ +{ +"s": "it's" +}, +{ +"s": "? a" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "65" +} +], +[ +{ +"s": "value" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "!" +}, +{ +"l": [ +{ +"i": "-1099511627776" +}, +{ +"d": [] +} +] +} +], +[ +{ +"s": "a,b" +}, +{ +"l": [ +{ +"s": "|" +}, +{ +"l": [ +{ +"i": "9007199254740993" +}, +{ +"i": "1000000000000000000" +} +] +}, +{ +"l": [ +{ +"s": "--- x" +} +] +}, +{ +"f": 4728057454355411894 +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "17" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"f": 1 +} +], +[ +{ +"s": "+1" +}, +{ +"s": "a " +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1.e3" +}, +{ +"l": [ +{ +"s": "{\"a\": [1, 2]}" +} +] +} +], +[ +{ +"s": "y" +}, +{ +"d": [ +[ +{ +"s": "&x" +}, +{ +"s": "a: b" +} +], +[ +{ +"s": "False" +}, +{ +"d": [] +} +], +[ +{ +"s": "*x" +}, +{ +"l": [ +{ +"b": true +} +] +} +], +[ +{ +"s": "-" +}, +{ +"d": [ +[ +{ +"s": "-" +}, +{ +"s": "007" +} +] +] +} +] +] +} +], +[ +{ +"s": "trailing two " +}, +{ +"d": [ +[ +{ +"s": "a\\b" +}, +{ +"s": "%x" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"f": 4614256656552045848 +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 71\n params:\n a :b: false\n state: RUNNING\n user_attrs:\n '-1':\n \"a\\U0001F600b\":\n - 2.0\n it's: '? a'\n value: 0.0\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 65\n params: {}\n state: RUNNING\n user_attrs:\n '!':\n - -1099511627776\n - {}\n a,b:\n - '|'\n - - 9007199254740993\n - 1000000000000000000\n - - '--- x'\n - 123456789.123\n value: -1\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 17\n params:\n '+1': 'a '\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 5.0e-324\n state: COMPLETE\n user_attrs:\n 1.e3:\n - '{\"a\": [1, 2]}'\n 'trailing two ':\n a\\b: '%x'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 3.141592653589793\n y:\n '&x': 'a: b'\n '*x':\n - true\n '-':\n '-': '007'\n 'False': {}\n value: 1\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "70" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9221120237041090560 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "0o7" +}, +{ +"i": "1" +} +], +[ +{ +"s": "2026-11-10" +}, +{ +"s": "a: b" +} +], +[ +{ +"s": "007" +}, +{ +"s": "a" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "na\u00efve" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [] +} +], +[ +{ +"s": "\ufeff" +}, +{ +"s": "2026-11-10" +} +], +[ +{ +"s": "key: value # comment" +}, +{ +"l": [ +{ +"s": "say \"hi\"" +}, +{ +"i": "42" +}, +{ +"b": false +} +] +} +] +] +} +], +[ +{ +"s": "a\n b" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "|" +}, +{ +"s": "y" +} +] +] +}, +{ +"f": 4607182418800017408 +}, +{ +"n": null +} +] +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [ +[ +{ +"s": "y" +}, +{ +"d": [] +} +], +[ +{ +"s": "z9" +}, +{ +"s": "a:b" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "56" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "False" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "'" +}, +{ +"f": 4502148214488346440 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +}, +{ +"l": [] +} +], +[ +{ +"s": "\ufeff" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "''" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"s": "-.Inf" +} +], +[ +{ +"s": "a:" +}, +{ +"s": "a,b" +} +] +] +}, +{ +"i": "0" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"i": "7" +} +], +[ +{ +"s": "n" +}, +{ +"b": false +} +] +] +}, +{ +"s": "2026-1-2 3:04:05.5 +09:00" +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 70\n params:\n '007': a\n 0o7: 1\n '2026-11-10': 'a: b'\n state: PRUNED\n user_attrs:\n ? \"a\\n b\"\n : - '|': y\n - 1.0\n - null\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : y: {}\n z9: a:b\n \"na\\xEFve\":\n 'key: value # comment':\n - say \"hi\"\n - 42\n - false\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : {}\n \"\\uFEFF\": '2026-11-10'\n value: .nan\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 56\n params:\n '''': 1.0e-07\n 'False': 1.0e-07\n state: PRUNED\n user_attrs:\n 'word word word word word word word word word word word word word word word word word word word word ': []\n \"\\uFEFF\":\n - '''''': 1.0e+22\n 'a:': a,b\n \"a\\U0001F600b\": '-.Inf'\n - 0\n - ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 7\n n: false\n - '2026-1-2 3:04:05.5 +09:00'\n value: 1.0\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "11" +} +], +[ +{ +"s": "value" +}, +{ +"n": null +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "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 b" +}, +{ +"s": "key: value # comment" +} +], +[ +{ +"s": "%x" +}, +{ +"s": "|" +} +], +[ +{ +"s": "a:b" +}, +{ +"f": -4503599627370496 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a\n\nb" +}, +{ +"s": ".inf" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 11\n params:\n '%x': '|'\n 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 b: 'key:\n value # comment'\n a:b: -.inf\n state: RUNNING\n user_attrs:\n ? 'a\n\n\n b'\n : '.inf'\n value: null\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "23" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "1.e3" +}, +{ +"b": false +} +], +[ +{ +"s": "|x" +}, +{ +"s": "a \nb" +} +], +[ +{ +"s": "1_000" +}, +{ +"s": "1:30" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "inf" +}, +{ +"d": [] +} +], +[ +{ +"s": "a :b" +}, +{ +"s": "!x" +} +], +[ +{ +"s": "\u0007" +}, +{ +"s": "-.Inf" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4861130398305394688 +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "5" +} +], +[ +{ +"s": "value" +}, +{ +"f": 1 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "null" +}, +{ +"f": 4636737291354636288 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "\ufeff" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "say \"hi\"" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [ +{ +"n": null +} +] +} +], +[ +{ +"s": "a,b" +}, +{ +"d": [ +[ +{ +"s": "---" +}, +{ +"f": 4728057454355411894 +} +] +] +} +] +] +} +], +[ +{ +"s": "max_depth" +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "29" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "--- x" +}, +{ +"s": "&x" +} +], +[ +{ +"s": "{a}" +}, +{ +"s": "'" +} +], +[ +{ +"s": "#a" +}, +{ +"i": "42" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +}, +{ +"d": [ +[ +{ +"s": "1" +}, +{ +"d": [] +} +], +[ +{ +"s": "0" +}, +{ +"s": " " +} +], +[ +{ +"s": ":a" +}, +{ +"s": "1.e3" +} +] +] +} +], +[ +{ +"s": "\u00a0" +}, +{ +"i": "2147483648" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 23\n params:\n 1.e3: false\n '1_000': '1:30'\n '|x': \"a \\nb\"\n state: RUNNING\n user_attrs:\n \"\\a\": '-.Inf'\n a :b: '!x'\n inf: {}\n value: 1.0e+22\n values:\n - 1.0e+17\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 5\n params:\n 'null': 100.0\n state: RUNNING\n user_attrs:\n max_depth: null\n say \"hi\":\n a,b:\n '---': 123456789.123\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : - null\n \"\\uFEFF\": -1.0\n value: 5.0e-324\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 29\n params:\n '#a': 42\n '--- x': '&x'\n '{a}': ''''\n state: FAIL\n user_attrs:\n xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx:\n '0': ' '\n '1': {}\n :a: 1.e3\n \"\\_\": 2147483648\n value: 1.0e+16\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "90" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "0" +}, +{ +"s": "&" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a #b" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "86" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "na\u00efve" +}, +{ +"s": "---" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "{a}" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "0:00:00.012345" +}, +{ +"s": "[a]" +} +], +[ +{ +"s": "1" +}, +{ +"f": 4636737291354636288 +} +] +] +}, +{ +"d": [] +}, +{ +"d": [ +[ +{ +"s": "\ud83d\ude00" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "max_depth" +}, +{ +"s": "\"" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "? a" +} +], +[ +{ +"s": "&" +}, +{ +"s": "\u00a0" +} +] +] +}, +{ +"d": [] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 9097811302482466869 +} +] +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 90\n params:\n '0': '&'\n state: COMPLETE\n user_attrs:\n 'a #b': {}\n value: 123456789.123\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 86\n params:\n \"na\\xEFve\": '---'\n state: RUNNING\n user_attrs:\n '{a}':\n - '0:00:00.012345': '[a]'\n '1': 100.0\n - {}\n - '&': \"\\_\"\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '? a'\n max_depth: '\"'\n \"\\U0001F600\": 1.0e+16\n - {}\n value: 2.0\n values:\n - 1.5e+300\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "86" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "1e3" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "\u2028" +}, +{ +"s": "1.5" +} +], +[ +{ +"s": "2026-11-10" +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "39" +} +], +[ +{ +"s": "value" +}, +{ +"i": "42" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "null" +}, +{ +"i": "42" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "@x" +}, +{ +"l": [ +{ +"s": "190:20:30" +}, +{ +"s": "y" +}, +{ +"s": "a" +}, +{ +"l": [ +{ +"f": 4728057454355411894 +}, +{ +"b": true +}, +{ +"n": null +}, +{ +"i": "1000000000000000000" +} +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4846369599423283200 +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "47" +} +], +[ +{ +"s": "value" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"s": "\u00e9" +} +], +[ +{ +"s": "n_estimators" +}, +{ +"s": "+1" +} +], +[ +{ +"s": "2026-11-10" +}, +{ +"i": "-1" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1_000" +}, +{ +"l": [ +{ +"l": [ +{ +"f": 4591870180066957722 +}, +{ +"b": false +} +] +}, +{ +"l": [ +{ +"b": true +}, +{ +"b": false +} +] +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 86\n params:\n 1e3: 2.0\n '2026-11-10': null\n ? \"\\L\"\n : '1.5'\n state: FAIL\n user_attrs: {}\n value: 1000000000000000000\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 39\n params:\n 'null': 42\n state: PRUNED\n user_attrs:\n '@x':\n - '190:20:30'\n - y\n - a\n - - 123456789.123\n - true\n - null\n - 1000000000000000000\n value: 42\n values:\n - 1.0e+16\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 47\n params:\n '2026-11-10': -1\n \"a\\U0001F600b\": \"\\xE9\"\n n_estimators: '+1'\n state: PRUNED\n user_attrs:\n '1_000':\n - - 0.1\n - false\n - - true\n - false\n value: 2147483648\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "7" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "n_estimators" +}, +{ +"s": "2026-1-2 3:04:05.5 +09:00" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "99" +} +], +[ +{ +"s": "value" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a\n\nb" +}, +{ +"s": "2026-11-10T22:51:17Z" +} +], +[ +{ +"s": "No" +}, +{ +"i": "7" +} +], +[ +{ +"s": "a\nb" +}, +{ +"f": 9218868437227405312 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": " " +}, +{ +"i": "-1" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "34" +} +], +[ +{ +"s": "value" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "No" +}, +{ +"s": "1:30" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "No" +}, +{ +"s": ": a" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 6103021453049119613 +}, +{ +"f": -4759972702479526251 +}, +{ +"f": 4846369599423283200 +} +] +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 7\n params:\n n_estimators: '2026-1-2 3:04:05.5 +09:00'\n state: FAIL\n user_attrs: {}\n value: 1.0\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 99\n params:\n 'No': 7\n ? 'a\n\n\n b'\n : '2026-11-10T22:51:17Z'\n ? 'a\n\n b'\n : .inf\n state: RUNNING\n user_attrs:\n ' ': -1\n value: 1.0e+100\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 34\n params:\n 'No': '1:30'\n state: FAIL\n user_attrs:\n 'No': ': a'\n value: 2147483648\n values:\n - 1.0e+100\n - -2.5e-10\n - 1.0e+16\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "40" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a, b" +}, +{ +"l": [] +} +], +[ +{ +"s": "\u0085" +}, +{ +"l": [] +} +], +[ +{ +"s": "!" +}, +{ +"i": "9007199254740993" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 40\n params: {}\n state: RUNNING\n user_attrs:\n '!': 9007199254740993\n a, b: []\n ? \"\\N\"\n : []\n value: 1.0e+17\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "80" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "<<" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "1:30.5" +}, +{ +"s": "1:30" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "*" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "a\nb" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "a#b" +}, +{ +"f": -9223372036854775808 +} +] +}, +{ +"l": [] +}, +{ +"d": [ +[ +{ +"s": "values" +}, +{ +"s": "a[0]" +} +], +[ +{ +"s": "0:00:00.012345" +}, +{ +"s": "y" +} +], +[ +{ +"s": "0x1F" +}, +{ +"i": "-1099511627776" +} +] +] +}, +{ +"b": true +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "36" +} +], +[ +{ +"s": "value" +}, +{ +"i": "0" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"s": "C:\\path\\to" +} +], +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"b": true +} +], +[ +{ +"s": "a\\b" +}, +{ +"s": "1e3" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "--- x" +}, +{ +"s": "`x`" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 80\n params:\n '1:30.5': '1:30'\n '<<': 2147483648\n state: RUNNING\n user_attrs:\n '*': 9007199254740993\n ? 'a\n\n b'\n : - - a#b\n - -0.0\n - []\n - '0:00:00.012345': y\n '0x1F': -1099511627776\n values: a[0]\n - true\n value: 1.0e+22\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 36\n params:\n '2026-11-10 22:51:17': true\n a\\b: 1e3\n \"a\\U0001F600b\": C:\\path\\to\n state: COMPLETE\n user_attrs:\n '--- x': '`x`'\n value: 0\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "90" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4591870180066957722 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "007" +}, +{ +"s": "a\nb" +} +], +[ +{ +"s": "a\n\nb" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +} +], +[ +{ +"s": "?a" +}, +{ +"s": ":a" +} +], +[ +{ +"s": "--- x" +}, +{ +"s": "a: b" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a, b" +}, +{ +"d": [ +[ +{ +"s": "a #b" +}, +{ +"l": [ +{ +"f": 4636737291354636288 +} +] +} +], +[ +{ +"s": "a:" +}, +{ +"s": "1.5" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "76" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4614256656552045848 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a " +}, +{ +"l": [] +} +], +[ +{ +"s": "a\u0000b" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 90\n params:\n '--- x': 'a: b'\n '007': 'a\n\n b'\n ?a: :a\n ? 'a\n\n\n b'\n : 'word word word word word word word word word word word word word word word\n word word word word word '\n state: COMPLETE\n user_attrs:\n a, b:\n 'a #b':\n - 100.0\n 'a:': '1.5'\n value: 0.1\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 76\n params: {}\n state: COMPLETE\n user_attrs:\n \"a\\0b\": {}\n 'a ': []\n value: 3.141592653589793\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "22" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "!" +}, +{ +"s": "\\" +} +], +[ +{ +"s": ">x" +}, +{ +"s": "it's" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a:" +}, +{ +"d": [ +[ +{ +"s": ".NaN" +}, +{ +"d": [] +} +], +[ +{ +"s": "x" +}, +{ +"f": 0 +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4502148214488346440 +} +] +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 22\n params:\n '!': \\\n '>x': it's\n state: FAIL\n user_attrs:\n 'a:':\n '.NaN': {}\n x: 0.0\n value: 1\n values:\n - 1.0e-07\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "4" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4614256656552045848 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"s": "Null" +} +], +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"i": "42" +} +], +[ +{ +"s": "1.5" +}, +{ +"s": "a #b" +} +], +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"i": "0" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "*x" +}, +{ +"d": [ +[ +{ +"s": "a #b" +}, +{ +"l": [] +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 4\n params:\n '1.5': 'a #b'\n http://x.y/z?q=1#f: 'Null'\n '{\"a\": [1, 2]}': 42\n \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \": 0\n state: RUNNING\n user_attrs:\n '*x':\n 'a #b': []\n value: 3.141592653589793\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "91" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9221120237041090560 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "yes" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "a\u0000b" +}, +{ +"s": "a:b" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 91\n params:\n \"a\\0b\": a:b\n 'yes': 9007199254740993\n state: PRUNED\n user_attrs: {}\n value: .nan\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "44" +} +], +[ +{ +"s": "value" +}, +{ +"i": "1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a[0]" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": ">x" +}, +{ +"f": -4759972702479526251 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "a: b" +}, +{ +"s": "1.0e+3" +}, +{ +"f": 9097811302482466869 +}, +{ +"f": 4614256656552045848 +} +] +}, +{ +"l": [ +{ +"f": 4936209963552724370 +}, +{ +"f": 1 +} +] +}, +{ +"l": [ +{ +"f": 4502148214488346440 +} +] +}, +{ +"f": -9223372036854775808 +} +] +} +], +[ +{ +"s": "@x" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "a, b" +}, +{ +"s": "-1.5" +} +] +] +}, +{ +"s": "a,b" +} +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "53" +} +], +[ +{ +"s": "value" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "-" +}, +{ +"n": null +} +], +[ +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "values" +}, +{ +"f": 0 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "RUNNING" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "23" +} +], +[ +{ +"s": "value" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": " " +}, +{ +"b": false +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "PRUNED" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 44\n params:\n '>x': -2.5e-10\n a[0]: 1.0e-07\n state: COMPLETE\n user_attrs:\n '@x':\n - a, b: '-1.5'\n - a,b\n \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \\xE9\":\n - - 'a: b'\n - '1.0e+3'\n - 1.5e+300\n - 3.141592653589793\n - - 1.0e+22\n - 5.0e-324\n - - 1.0e-07\n - -0.0\n value: 1\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 53\n params:\n '-': null\n ? 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n : 2.0\n values: 0.0\n state: RUNNING\n user_attrs: {}\n value: -1\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 23\n params: {}\n state: PRUNED\n user_attrs:\n ' ': false\n value: 1.0e-07\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "1" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "=" +}, +{ +"i": "-1" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "n" +}, +{ +"d": [ +[ +{ +"s": "0o7" +}, +{ +"s": "\u00a0" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": -9223372036854775808 +} +] +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 1\n params:\n '=': -1\n state: COMPLETE\n user_attrs:\n n:\n 0o7: \"\\_\"\n value: -1.0\n values:\n - -0.0\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "42" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4759972702479526251 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "0" +}, +{ +"f": 4861130398305394688 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "a :b" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": "? a" +}, +{ +"f": -4616189618054758400 +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "36" +} +], +[ +{ +"s": "value" +}, +{ +"f": 9097811302482466869 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"s": "2026-11-10 22:51:18" +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:01" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "&x" +}, +{ +"b": false +} +], +[ +{ +"s": "null" +}, +{ +"s": "a#b" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1.0e+3" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "61" +} +], +[ +{ +"s": "value" +}, +{ +"f": -4759972702479526251 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"n": null +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\u2028" +}, +{ +"b": false +} +], +[ +{ +"s": "---" +}, +{ +"i": "7" +} +], +[ +{ +"s": "1.e3" +}, +{ +"i": "1" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [] +} +], +[ +{ +"s": "state" +}, +{ +"s": "FAIL" +} +] +] +} +] +}, +"yaml": "- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 42\n params:\n '0': 1.0e+17\n state: COMPLETE\n user_attrs:\n '? a': -1.0\n a :b: 100.0\n value: -2.5e-10\n- datetime_complete: '2026-11-10 22:51:18'\n datetime_start: '2026-11-10 22:51:17'\n duration: 0:00:01\n number: 36\n params:\n '&x': false\n 'null': a#b\n state: FAIL\n user_attrs:\n '1.0e+3': {}\n value: 1.5e+300\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: null\n number: 61\n params:\n '---': 7\n 1.e3: 1\n ? \"\\L\"\n : false\n state: FAIL\n user_attrs: {}\n value: -2.5e-10\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "10" +} +], +[ +{ +"s": "value" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "a\\b" +}, +{ +"f": 0 +} +], +[ +{ +"s": ">" +}, +{ +"s": ":a" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "2026-11-10T22:51:17Z" +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "Null" +}, +{ +"d": [ +[ +{ +"s": "inf" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "a\n b" +}, +{ +"s": ".5" +} +], +[ +{ +"s": "true" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": " a" +}, +{ +"s": "007" +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"f": 4846369599423283200 +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "number" +}, +{ +"i": "60" +} +], +[ +{ +"s": "value" +}, +{ +"f": -9223372036854775808 +} +], +[ +{ +"s": "datetime_start" +}, +{ +"s": "2026-11-10 22:51:17" +} +], +[ +{ +"s": "datetime_complete" +}, +{ +"n": null +} +], +[ +{ +"s": "duration" +}, +{ +"s": "0:00:00.012345" +} +], +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "\na" +}, +{ +"f": 4936209963552724370 +} +] +] +} +], +[ +{ +"s": "user_attrs" +}, +{ +"d": [ +[ +{ +"s": "1_000" +}, +{ +"l": [ +{ +"d": [] +}, +{ +"d": [ +[ +{ +"s": "1:30" +}, +{ +"s": "\u2029" +} +], +[ +{ +"s": "\ufeff" +}, +{ +"s": "a #b" +} +], +[ +{ +"s": "a " +}, +{ +"b": true +} +], +[ +{ +"s": "C:\\path\\to" +}, +{ +"s": "1:30" +} +] +] +}, +{ +"i": "1000000000000000000" +} +] +} +], +[ +{ +"s": "0x1F" +}, +{ +"d": [ +[ +{ +"s": "-" +}, +{ +"d": [] +} +], +[ +{ +"s": "1.0e+3" +}, +{ +"s": "No" +} +] +] +} +] +] +} +], +[ +{ +"s": "state" +}, +{ +"s": "COMPLETE" +} +] +] +} +] +}, +"yaml": "- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 10\n params:\n '>': :a\n a\\b: 0.0\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '2026-11-10T22:51:17Z'\n state: COMPLETE\n user_attrs:\n ' a': '007'\n 'Null':\n ? \"a\\n b\"\n : '.5'\n inf: 9007199254740993\n 'true': []\n value: -1\n values:\n - 1.0e+16\n- datetime_complete: null\n datetime_start: '2026-11-10 22:51:17'\n duration: '0:00:00.012345'\n number: 60\n params:\n ? '\n\n a'\n : 1.0e+22\n state: COMPLETE\n user_attrs:\n '0x1F':\n '-': {}\n '1.0e+3': 'No'\n '1_000':\n - {}\n - '1:30': \"\\P\"\n C:\\path\\to: '1:30'\n 'a ': true\n \"\\uFEFF\": 'a #b'\n - 1000000000000000000\n value: -0.0\n" +}, +{ +"tree": { +"f": 0 +}, +"yaml": "0.0\n...\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "on" +}, +{ +"s": "\u0085" +} +] +] +}, +"yaml": "'on': \"\\N\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "|" +}, +{ +"d": [ +[ +{ +"s": "-1.5" +}, +{ +"s": "2026-11-10T22:51:17Z" +} +], +[ +{ +"s": "y" +}, +{ +"s": "0o7" +} +], +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"s": "true" +} +] +] +} +] +] +}, +"yaml": "'|':\n '-1.5': '2026-11-10T22:51:17Z'\n ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : 'true'\n y: 0o7\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "&x" +}, +{ +"l": [] +} +], +[ +{ +"s": "params" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "No" +}, +{ +"s": "<<" +}, +{ +"f": -4759972702479526251 +} +] +}, +{ +"d": [ +[ +{ +"s": "{a}" +}, +{ +"s": "null" +} +], +[ +{ +"s": ">" +}, +{ +"s": "Null" +} +] +] +}, +{ +"d": [] +}, +{ +"l": [ +{ +"n": null +} +] +} +] +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"l": [ +{ +"l": [ +{ +"s": "2026-1-2 3:04:05.5 +09:00" +}, +{ +"f": 9218868437227405312 +}, +{ +"s": "\u0007" +} +] +}, +{ +"l": [ +{ +"s": "a:" +}, +{ +"f": -4759972702479526251 +} +] +}, +{ +"s": "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 b" +}, +{ +"d": [ +[ +{ +"s": "1:30" +}, +{ +"i": "0" +} +], +[ +{ +"s": "a\n b" +}, +{ +"f": -9223372036854775808 +} +] +] +} +] +} +], +[ +{ +"s": "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 b" +}, +{ +"d": [ +[ +{ +"s": ": a" +}, +{ +"l": [ +{ +"s": "na\u00efve" +}, +{ +"s": "n" +}, +{ +"i": "-1099511627776" +} +] +} +], +[ +{ +"s": "=" +}, +{ +"l": [ +{ +"s": "190:20:30" +} +] +} +] +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "\u2028" +}, +{ +"l": [] +} +], +[ +{ +"s": "2001-12-14t21:59:43.10-05:00" +}, +{ +"s": "Null" +} +], +[ +{ +"s": "!x" +}, +{ +"d": [ +[ +{ +"s": "a\nb" +}, +{ +"s": "y" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "&" +} +], +[ +{ +"s": "0:00:00.012345" +}, +{ +"s": "\u00e9" +} +], +[ +{ +"s": "|x" +}, +{ +"d": [ +[ +{ +"s": "-" +}, +{ +"i": "42" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"f": 0 +} +] +] +} +] +] +} +], +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"d": [] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "a:b" +}, +{ +"s": "--" +} +] +] +} +] +}, +"yaml": "- '&x': []\n 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 b:\n ': a':\n - \"na\\xEFve\"\n - n\n - -1099511627776\n '=':\n - '190:20:30'\n params:\n - - 'No'\n - '<<'\n - -2.5e-10\n - '>': 'Null'\n '{a}': 'null'\n - {}\n - - null\n ? 'word word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word '\n : - - '2026-1-2 3:04:05.5 +09:00'\n - .inf\n - \"\\a\"\n - - 'a:'\n - -2.5e-10\n - 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\n a a a a a a a a a a a a b\n - '1:30': 0\n ? \"a\\n b\"\n : -0.0\n- '!x':\n '0:00:00.012345': \"\\xE9\"\n ? 'a\n\n b'\n : y\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '&'\n '|x':\n '-': 42\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 0.0\n '2001-12-14t21:59:43.10-05:00': 'Null'\n \"a\\U0001F600b\": {}\n ? \"\\L\"\n : []\n- a:b: --\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\tb" +}, +{ +"l": [ +{ +"l": [ +{ +"l": [ +{ +"f": 4728057454355411894 +}, +{ +"i": "1000000000000000000" +}, +{ +"f": 4636737291354636288 +}, +{ +"s": "1.5" +} +] +}, +{ +"d": [ +[ +{ +"s": ": a" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": "null" +}, +{ +"s": "|" +} +], +[ +{ +"s": "!" +}, +{ +"s": "No" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"i": "-1" +} +], +[ +{ +"s": "a #b" +}, +{ +"i": "1000000000000000000" +} +] +] +}, +{ +"d": [] +} +] +}, +{ +"s": "1.e3" +}, +{ +"s": ": a" +} +] +} +] +] +}, +"yaml": "\"a\\tb\":\n- - - 123456789.123\n - 1000000000000000000\n - 100.0\n - '1.5'\n - '!': 'No'\n ': a': 1.0e+17\n 'null': '|'\n - 'a #b': 1000000000000000000\n ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : -1\n - {}\n- 1.e3\n- ': a'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "na\u00efve" +}, +{ +"l": [ +{ +"l": [ +{ +"l": [ +{ +"f": 4861130398305394688 +} +] +}, +{ +"f": 4936209963552724370 +}, +{ +"d": [ +[ +{ +"s": "-" +}, +{ +"s": "--" +} +], +[ +{ +"s": "*" +}, +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +} +] +] +} +] +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [ +{ +"i": "0" +}, +{ +"f": 4936209963552724370 +}, +{ +"i": "1" +} +] +} +], +[ +{ +"s": "null" +}, +{ +"d": [] +} +], +[ +{ +"s": "-a" +}, +{ +"s": "a\t" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "a: b" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "n" +}, +{ +"b": true +} +] +] +} +] +} +] +] +}, +"yaml": "\"na\\xEFve\":\n- - - 1.0e+17\n - 1.0e+22\n - '*': \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb\\\n \\ aa bb aa bb aa bb \\xE9\"\n '-': --\n- -a: \"a\\t\"\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : - 0\n - 1.0e+22\n - 1\n 'null': {}\n- 'a: b': 9007199254740993\n n: true\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "a\n b" +}, +{ +"s": ":a" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "? a" +}, +{ +"d": [] +} +], +[ +{ +"s": "-" +}, +{ +"b": true +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [ +[ +{ +"s": "{a}" +}, +{ +"s": "Null" +} +] +] +} +] +] +}, +{ +"s": "<<" +}, +{ +"d": [ +[ +{ +"s": "*" +}, +{ +"d": [] +} +], +[ +{ +"s": "y" +}, +{ +"s": " " +} +] +] +} +] +}, +"yaml": "- ? \"a\\n b\"\n : :a\n- '-': true\n '? a': {}\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '{a}': 'Null'\n- '<<'\n- '*': {}\n y: ' '\n" +}, +{ +"tree": { +"s": " " +}, +"yaml": "' '\n" +}, +{ +"tree": { +"l": [ +{ +"l": [ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"l": [ +{ +"l": [ +{ +"s": "2001-12-14t21:59:43.10-05:00" +}, +{ +"s": "\\" +} +] +} +] +}, +{ +"d": [] +} +] +}, +{ +"s": "0b101" +}, +{ +"l": [] +}, +{ +"l": [] +} +] +}, +"yaml": "- - \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \"\n - - - '2001-12-14t21:59:43.10-05:00'\n - \\\n - {}\n- '0b101'\n- []\n- []\n" +}, +{ +"tree": { +"l": [] +}, +"yaml": "[]\n" +}, +{ +"tree": { +"f": 4502148214488346440 +}, +"yaml": "1.0e-07\n...\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"s": "" +} +], +[ +{ +"s": "a\n b" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": ">" +}, +{ +"l": [ +{ +"s": "say \"hi\"" +}, +{ +"s": "{a}" +}, +{ +"s": "a:b" +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "%x" +}, +{ +"d": [ +[ +{ +"s": "\u0007" +}, +{ +"s": "a\n\nb" +} +], +[ +{ +"s": "y" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": ".5" +}, +{ +"s": "-1.5" +} +] +] +} +] +] +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "2001-12-14t21:59:43.10-05:00" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +} +], +[ +{ +"s": "nan" +}, +{ +"s": ".5" +} +] +] +}, +{ +"l": [] +} +] +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "a\ud83d\ude00b" +} +], +[ +{ +"s": "+1" +}, +{ +"l": [ +{ +"f": 4936209963552724370 +}, +{ +"s": "1.5" +} +] +} +] +] +} +] +} +], +[ +{ +"s": "-1" +}, +{ +"b": false +} +] +] +}, +"yaml": "'-1': false\n? \"a\\n b\"\n: - '>':\n - say \"hi\"\n - '{a}'\n - a:b\n - aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b\n - '%x':\n \"\\a\": 'a\n\n\n b'\n '.5': '-1.5'\n y: 1.0e+22\n - - '2001-12-14t21:59:43.10-05:00': 'word word word word word word word word word\n word word word word word word word word word word word '\n nan: '.5'\n - []\n - '+1':\n - 1.0e+22\n - '1.5'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : \"a\\U0001F600b\"\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c: ''\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "!" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "\u0085" +}, +{ +"l": [ +{ +"s": "..." +}, +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"s": "---" +}, +{ +"s": "{a}" +} +] +} +] +] +} +] +} +], +[ +{ +"s": "y" +}, +{ +"d": [ +[ +{ +"s": "-1" +}, +{ +"l": [ +{ +"s": "yes" +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"i": "7" +} +] +} +] +] +} +] +] +}, +"yaml": "'!':\n- ? \"\\N\"\n : - '...'\n - '{\"a\": [1, 2]}'\n - '---'\n - '{a}'\ny:\n '-1':\n - 'yes'\n - aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b\n - 7\n" +}, +{ +"tree": { +"d": [] +}, +"yaml": "{}\n" +}, +{ +"tree": { +"d": [] +}, +"yaml": "{}\n" +}, +{ +"tree": { +"s": "190:20:30" +}, +"yaml": "'190:20:30'\n" +}, +{ +"tree": { +"l": [ +{ +"l": [ +{ +"l": [ +{ +"l": [] +} +] +}, +{ +"s": "a:b" +} +] +}, +{ +"d": [ +[ +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +}, +{ +"s": "a b" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "\ud83d\ude00" +} +], +[ +{ +"s": "a #b" +}, +{ +"d": [] +} +], +[ +{ +"s": "true" +}, +{ +"d": [] +} +] +] +}, +{ +"l": [] +}, +{ +"s": ".inf" +} +] +}, +"yaml": "- - - []\n - a:b\n- 'a #b': {}\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : \"\\U0001F600\"\n ? 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n : a b\n 'true': {}\n- []\n- '.inf'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [ +{ +"s": "" +} +] +} +], +[ +{ +"s": "=" +}, +{ +"d": [ +[ +{ +"s": "\na" +}, +{ +"d": [] +} +], +[ +{ +"s": "a :b" +}, +{ +"l": [ +{ +"l": [ +{ +"f": 4611686018427387904 +}, +{ +"s": "%x" +} +] +} +] +} +], +[ +{ +"s": "&" +}, +{ +"l": [ +{ +"s": ".inf" +} +] +} +], +[ +{ +"s": "a" +}, +{ +"i": "7" +} +] +] +} +], +[ +{ +"s": " " +}, +{ +"f": 0 +} +] +] +}, +"yaml": "' ': 0.0\n'=':\n ? '\n\n a'\n : {}\n '&':\n - '.inf'\n a: 7\n a :b:\n - - 2.0\n - '%x'\n? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n: - ''\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "1e3" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "&" +}, +{ +"l": [ +{ +"s": "=" +}, +{ +"i": "-1099511627776" +}, +{ +"b": false +} +] +} +], +[ +{ +"s": "? a" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "|x" +}, +{ +"d": [ +[ +{ +"s": "y" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "n" +}, +{ +"s": "-" +} +] +] +} +], +[ +{ +"s": "yes" +}, +{ +"d": [ +[ +{ +"s": "\u00e9" +}, +{ +"i": "42" +} +] +] +} +] +] +} +] +} +], +[ +{ +"s": "|x" +}, +{ +"d": [ +[ +{ +"s": "nan" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "a#b" +}, +{ +"s": "yes" +} +], +[ +{ +"s": "007" +}, +{ +"d": [ +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"d": [ +[ +{ +"s": "key: value # comment" +}, +{ +"s": "+1" +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "true" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "1.0e+3" +} +] +}, +{ +"s": "a\n\nb" +}, +{ +"l": [ +{ +"f": 9097811302482466869 +}, +{ +"f": 4846369599423283200 +} +] +} +] +} +], +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"l": [ +{ +"s": "a \nb" +}, +{ +"d": [ +[ +{ +"s": "|" +}, +{ +"d": [ +[ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": ">" +}, +{ +"n": null +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"s": "0o7" +} +], +[ +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +}, +{ +"b": false +} +] +] +} +], +[ +{ +"s": "a\n" +}, +{ +"d": [ +[ +{ +"s": "190:20:30" +}, +{ +"i": "0" +} +], +[ +{ +"s": "a[0]" +}, +{ +"i": "1000000000000000000" +} +] +] +} +], +[ +{ +"s": "190:20:30" +}, +{ +"d": [ +[ +{ +"s": ": a" +}, +{ +"i": "0" +} +] +] +} +] +] +}, +{ +"d": [] +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": ">" +}, +{ +"s": "2026-11-10 22:51:17" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "a b" +}, +{ +"s": "*x" +} +], +[ +{ +"s": "a:b" +}, +{ +"s": "007" +} +], +[ +{ +"s": "y" +}, +{ +"s": "\u2028" +} +] +] +} +] +} +] +} +] +] +}, +"yaml": "1e3:\n- '&':\n - '='\n - -1099511627776\n - false\n '? a': 9007199254740993\n 'yes':\n \"\\xE9\": 42\n '|x':\n n: '-'\n y: -1.0\n'true':\n- - '1.0e+3'\n- 'a\n\n\n b'\n- - 1.5e+300\n - 1.0e+16\n'{\"a\": [1, 2]}':\n- \"a \\nb\"\n- '190:20:30':\n ': a': 0\n ? 'a\n\n '\n : '190:20:30': 0\n a[0]: 1000000000000000000\n '|':\n '>': null\n \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \\xE9\": false\n http://x.y/z?q=1#f: 0o7\n \"\\u65E5\\u672C\\u8A9E\": 100.0\n- {}\n- - '>': '2026-11-10 22:51:17'\n - a b: '*x'\n a:b: '007'\n y: \"\\L\"\n \"\\u65E5\\u672C\\u8A9E\": -.inf\n'|x':\n '007':\n \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \":\n 'key: value # comment': '+1'\n a#b: 'yes'\n nan: 1.0e+100\n" +}, +{ +"tree": { +"s": "1.5" +}, +"yaml": "'1.5'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "|" +}, +{ +"d": [ +[ +{ +"s": "1:30.5" +}, +{ +"d": [ +[ +{ +"s": "a\tb" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +} +], +[ +{ +"s": "'" +}, +{ +"d": [ +[ +{ +"s": "a#b" +}, +{ +"i": "1" +} +], +[ +{ +"s": "---" +}, +{ +"b": false +} +], +[ +{ +"s": "2026-11-10" +}, +{ +"s": "on" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "2001-12-14t21:59:43.10-05:00" +} +] +] +} +], +[ +{ +"s": "0o7" +}, +{ +"l": [ +{ +"b": true +} +] +} +], +[ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"s": "190:20:30" +} +] +] +} +] +] +} +], +[ +{ +"s": "@x" +}, +{ +"l": [ +{ +"l": [ +{ +"i": "1" +}, +{ +"l": [ +{ +"i": "1" +}, +{ +"n": null +}, +{ +"s": "\u65e5\u672c\u8a9e" +} +] +} +] +}, +{ +"f": 4936209963552724370 +}, +{ +"i": "9007199254740993" +}, +{ +"d": [ +[ +{ +"s": "190:20:30" +}, +{ +"d": [ +[ +{ +"s": "1.5" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +} +], +[ +{ +"s": "a\tb" +}, +{ +"s": ".NaN" +} +] +] +} +] +] +} +] +} +] +] +}, +"yaml": "'@x':\n- - 1\n - - 1\n - null\n - \"\\u65E5\\u672C\\u8A9E\"\n- 1.0e+22\n- 9007199254740993\n- '190:20:30':\n '1.5': 'word word word word word word word word word word word word word word\n word word word word word word '\n \"a\\tb\": '.NaN'\n'|':\n '1:30.5':\n '''':\n '---': false\n '2026-11-10': 'on'\n a#b: 1\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '2001-12-14t21:59:43.10-05:00'\n 0o7:\n - true\n \"a\\tb\": 'word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word word word '\n \"\\u65E5\\u672C\\u8A9E\": '190:20:30'\n" +}, +{ +"tree": { +"l": [ +{ +"l": [ +{ +"l": [] +}, +{ +"s": "0b101" +} +] +} +] +}, +"yaml": "- - []\n - '0b101'\n" +}, +{ +"tree": { +"l": [ +{ +"l": [ +{ +"d": [ +[ +{ +"s": "''" +}, +{ +"d": [ +[ +{ +"s": "-a" +}, +{ +"i": "42" +} +], +[ +{ +"s": "x" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "a: b" +}, +{ +"b": false +} +] +] +} +], +[ +{ +"s": "key: value # comment" +}, +{ +"d": [ +[ +{ +"s": "|x" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "y" +}, +{ +"s": "a \nb" +} +] +] +} +] +] +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "a[0]" +}, +{ +"b": false +} +] +] +}, +{ +"d": [ +[ +{ +"s": "key: value # comment" +}, +{ +"f": 1 +} +], +[ +{ +"s": "a\\b" +}, +{ +"f": 9221120237041090560 +} +] +] +} +] +}, +{ +"l": [] +}, +{ +"l": [ +{ +"f": 4607182418800017408 +}, +{ +"f": 4614256656552045848 +}, +{ +"l": [ +{ +"i": "2147483648" +} +] +} +] +} +] +}, +{ +"l": [ +{ +"l": [ +{ +"d": [ +[ +{ +"s": "!" +}, +{ +"s": "null" +} +] +] +}, +{ +"d": [] +}, +{ +"s": "a " +}, +{ +"l": [] +} +] +}, +{ +"i": "1000000000000000000" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "No" +}, +{ +"s": "a\\b" +}, +{ +"s": "0" +} +] +}, +{ +"s": "a #b" +} +] +} +] +} +] +}, +"yaml": "- - '''''':\n -a: 42\n 'a: b': false\n x: 2.0\n 'key: value # comment':\n y: \"a \\nb\"\n '|x': 1.0e+16\n - - a[0]: false\n - a\\b: .nan\n 'key: value # comment': 5.0e-324\n - []\n - - 1.0\n - 3.141592653589793\n - - 2147483648\n- - - '!': 'null'\n - {}\n - 'a '\n - []\n - 1000000000000000000\n - - - 'No'\n - a\\b\n - '0'\n - 'a #b'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": " a" +}, +{ +"d": [ +[ +{ +"s": "a" +}, +{ +"s": "a\ud83d\ude00b" +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"d": [ +[ +{ +"s": "a,b" +}, +{ +"i": "42" +} +], +[ +{ +"s": "!x" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [ +{ +"s": "2026-11-10 22:51:17" +} +] +} +], +[ +{ +"s": "\ta" +}, +{ +"l": [ +{ +"f": 6103021453049119613 +}, +{ +"s": "?a" +}, +{ +"f": 9218868437227405312 +} +] +} +] +] +} +], +[ +{ +"s": "\u0007" +}, +{ +"d": [ +[ +{ +"s": "na\u00efve" +}, +{ +"l": [ +{ +"s": "a\u0000b" +} +] +} +] +] +} +], +[ +{ +"s": "`x`" +}, +{ +"d": [ +[ +{ +"s": "trailing two " +}, +{ +"l": [] +} +], +[ +{ +"s": "a\u0000b" +}, +{ +"s": "1.0e+3" +} +], +[ +{ +"s": "a: b" +}, +{ +"d": [ +[ +{ +"s": "+1" +}, +{ +"s": "a:" +} +] +] +} +], +[ +{ +"s": "n" +}, +{ +"d": [ +[ +{ +"s": "--- x" +}, +{ +"s": "" +} +], +[ +{ +"s": "a\n" +}, +{ +"s": "a#b" +} +], +[ +{ +"s": ":a" +}, +{ +"f": 0 +} +], +[ +{ +"s": "z9" +}, +{ +"s": " two leading" +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "value" +}, +{ +"l": [ +{ +"d": [] +}, +{ +"b": true +}, +{ +"i": "1" +} +] +} +], +[ +{ +"s": "\u0085" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [ +[ +{ +"s": "max_depth" +}, +{ +"s": "|" +} +], +[ +{ +"s": "z9" +}, +{ +"b": false +} +], +[ +{ +"s": "a\n\nb" +}, +{ +"n": null +} +] +] +} +] +] +} +], +[ +{ +"s": "na\u00efve" +}, +{ +"l": [ +{ +"f": 4607182418800017408 +}, +{ +"l": [] +} +] +} +] +] +}, +"yaml": "' a':\n \"\\a\":\n \"na\\xEFve\":\n - \"a\\0b\"\n '`x`':\n \"a\\0b\": '1.0e+3'\n 'a: b':\n '+1': 'a:'\n n:\n '--- x': ''\n :a: 0.0\n ? 'a\n\n '\n : a#b\n z9: ' two leading'\n 'trailing two ': []\n a: \"a\\U0001F600b\"\n http://x.y/z?q=1#f:\n \"\\ta\":\n - 1.0e+100\n - ?a\n - .inf\n '!x': 9007199254740993\n a,b: 42\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : - '2026-11-10 22:51:17'\n\"na\\xEFve\":\n- 1.0\n- []\nvalue:\n- {}\n- true\n- 1\n? \"\\N\"\n: ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : ? 'a\n\n\n b'\n : null\n max_depth: '|'\n z9: false\n" +}, +{ +"tree": { +"l": [ +{ +"l": [] +}, +{ +"l": [] +} +] +}, +"yaml": "- []\n- []\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": " a" +}, +{ +"l": [ +{ +"l": [ +{ +"d": [ +[ +{ +"s": "-a" +}, +{ +"s": "''" +} +], +[ +{ +"s": " two leading" +}, +{ +"s": "[a]" +} +], +[ +{ +"s": "0x1F" +}, +{ +"s": "007" +} +] +] +}, +{ +"l": [ +{ +"s": "null" +}, +{ +"s": "*" +} +] +} +] +}, +{ +"d": [ +[ +{ +"s": "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 b" +}, +{ +"s": "!x" +} +], +[ +{ +"s": "inf" +}, +{ +"d": [ +[ +{ +"s": "say \"hi\"" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "value" +}, +{ +"b": true +} +] +] +} +], +[ +{ +"s": "a :b" +}, +{ +"s": " a" +} +] +] +}, +{ +"f": 4614256656552045848 +} +] +} +] +] +}, +"yaml": "' a':\n- - ' two leading': '[a]'\n -a: ''''''\n '0x1F': '007'\n - - 'null'\n - '*'\n- a :b: ' a'\n 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 b: '!x'\n inf:\n say \"hi\": 1000000000000000000\n value: true\n- 3.141592653589793\n" +}, +{ +"tree": { +"d": [] +}, +"yaml": "{}\n" +}, +{ +"tree": { +"l": [ +{ +"l": [ +{ +"f": 9218868437227405312 +}, +{ +"s": "007" +} +] +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [] +} +], +[ +{ +"s": "say \"hi\"" +}, +{ +"l": [ +{ +"l": [ +{ +"i": "42" +}, +{ +"s": "OFF" +}, +{ +"s": ".NaN" +}, +{ +"i": "0" +} +] +}, +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +} +] +} +], +[ +{ +"s": "a b" +}, +{ +"s": "-1" +} +], +[ +{ +"s": "~" +}, +{ +"d": [ +[ +{ +"s": "-1" +}, +{ +"d": [ +[ +{ +"s": "---" +}, +{ +"s": "a\n" +} +], +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"s": "a:b" +} +], +[ +{ +"s": "|" +}, +{ +"f": -4503599627370496 +} +] +] +} +], +[ +{ +"s": "a" +}, +{ +"d": [ +[ +{ +"s": "x" +}, +{ +"i": "2147483648" +} +] +] +} +] +] +} +] +] +} +] +}, +"yaml": "- - .inf\n - '007'\n- a b: '-1'\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : {}\n say \"hi\":\n - - 42\n - 'OFF'\n - '.NaN'\n - 0\n - xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\n '~':\n '-1':\n '---': 'a\n\n '\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c: a:b\n '|': -.inf\n a:\n x: 2147483648\n" +}, +{ +"tree": { +"s": "0b101" +}, +"yaml": "'0b101'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "yes" +}, +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +} +], +[ +{ +"s": ".inf" +}, +{ +"d": [ +[ +{ +"s": "say \"hi\"" +}, +{ +"f": 4636737291354636288 +} +], +[ +{ +"s": " a" +}, +{ +"l": [ +{ +"l": [ +{ +"b": true +} +] +}, +{ +"l": [ +{ +"s": "1:30" +} +] +} +] +} +] +] +} +], +[ +{ +"s": "{a}" +}, +{ +"s": "key: value # comment" +} +], +[ +{ +"s": "0:00:00.012345" +}, +{ +"d": [] +} +] +] +}, +"yaml": "'.inf':\n ' a':\n - - true\n - - '1:30'\n say \"hi\": 100.0\n'0:00:00.012345': {}\n'yes': 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n'{a}': 'key: value # comment'\n" +}, +{ +"tree": { +"l": [] +}, +"yaml": "[]\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\tb" +}, +{ +"d": [ +[ +{ +"s": "--- x" +}, +{ +"l": [ +{ +"d": [] +}, +{ +"d": [] +}, +{ +"l": [] +}, +{ +"f": -4503599627370496 +} +] +} +], +[ +{ +"s": "na\u00efve" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "y" +}, +{ +"s": "2026-1-2 3:04:05.5 +09:00" +} +], +[ +{ +"s": " a" +}, +{ +"l": [ +{ +"b": true +}, +{ +"s": "\ud83d\ude00" +} +] +} +] +] +} +] +] +}, +"yaml": "\"a\\tb\":\n ' a':\n - true\n - \"\\U0001F600\"\n '--- x':\n - {}\n - {}\n - []\n - -.inf\n \"na\\xEFve\": 9007199254740993\n y: '2026-1-2 3:04:05.5 +09:00'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\na" +}, +{ +"d": [ +[ +{ +"s": "C:\\path\\to" +}, +{ +"n": null +} +] +] +} +] +] +}, +"yaml": "? '\n\n a'\n: C:\\path\\to: null\n" +}, +{ +"tree": { +"l": [ +{ +"l": [] +}, +{ +"d": [] +} +] +}, +"yaml": "- []\n- {}\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": " a" +}, +{ +"n": null +} +], +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"l": [] +} +], +[ +{ +"s": "- a" +}, +{ +"d": [ +[ +{ +"s": "on" +}, +{ +"d": [ +[ +{ +"s": "-a" +}, +{ +"d": [ +[ +{ +"s": "?a" +}, +{ +"s": "a\n b" +} +], +[ +{ +"s": "yes" +}, +{ +"s": "\u00a0" +} +], +[ +{ +"s": "trailing two " +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"d": [] +} +], +[ +{ +"s": "-1" +}, +{ +"d": [ +[ +{ +"s": "|" +}, +{ +"s": ">x" +} +], +[ +{ +"s": "?a" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": "max_depth" +}, +{ +"f": -4759972702479526251 +} +], +[ +{ +"s": "1.e3" +}, +{ +"f": -9223372036854775808 +} +] +] +} +], +[ +{ +"s": "!x" +}, +{ +"l": [ +{ +"s": "\na" +} +] +} +] +] +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"s": "- a" +} +], +[ +{ +"s": "value" +}, +{ +"d": [ +[ +{ +"s": "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 b" +}, +{ +"d": [ +[ +{ +"s": "x" +}, +{ +"i": "2147483648" +} +] +] +} +], +[ +{ +"s": "No" +}, +{ +"d": [ +[ +{ +"s": "a, b" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "!" +}, +{ +"s": ">x" +} +] +] +} +], +[ +{ +"s": "2026-11-10" +}, +{ +"l": [ +{ +"s": "..." +}, +{ +"s": ".inf" +}, +{ +"s": "--" +} +] +} +], +[ +{ +"s": "z9" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"l": [ +{ +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +}, +{ +"l": [ +{ +"b": true +}, +{ +"s": "{a}" +} +] +}, +{ +"d": [ +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"s": " " +} +], +[ +{ +"s": "a,b" +}, +{ +"s": "--" +} +], +[ +{ +"s": "1:30" +}, +{ +"s": "? a" +} +], +[ +{ +"s": "1.e3" +}, +{ +"n": null +} +] +] +}, +{ +"d": [ +[ +{ +"s": "=" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "!x" +}, +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +} +] +] +} +] +} +] +] +} +] +] +}, +"yaml": "' a': null\n'- a':\n 'on':\n '!x':\n - '\n\n a'\n '-1':\n 1.e3: -0.0\n ?a: 1.0e+17\n max_depth: -2.5e-10\n '|': '>x'\n -a:\n ?a: \"a\\n b\"\n 'trailing two ': null\n 'yes': \"\\_\"\n '2026-11-10 22:51:17': {}\n value:\n '2026-11-10':\n - '...'\n - '.inf'\n - --\n 'No':\n '!': '>x'\n a, b: 2147483648\n 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 b:\n x: 2147483648\n z9: []\n ? 'word word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word '\n : '- a'\n '{\"a\": [1, 2]}':\n - \"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb\\\n \\ aa bb aa bb \\xE9\"\n - - true\n - '{a}'\n - 1.e3: null\n '1:30': '? a'\n a,b: --\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c: ' '\n - '!x': \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \"\n '=': -1.0\n\"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \": []\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\n" +}, +{ +"d": [] +} +] +] +}, +"yaml": "? 'a\n\n '\n: {}\n" +}, +{ +"tree": { +"d": [] +}, +"yaml": "{}\n" +}, +{ +"tree": { +"s": "\u0007" +}, +"yaml": "\"\\a\"\n" +}, +{ +"tree": { +"s": "?a" +}, +"yaml": "?a\n...\n" +}, +{ +"tree": { +"l": [] +}, +"yaml": "[]\n" +}, +{ +"tree": { +"l": [ +{ +"s": "a :b" +}, +{ +"d": [ +[ +{ +"s": "-1.5" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"s": "|" +} +], +[ +{ +"s": "a\u0000b" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "!x" +}, +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +} +] +] +}, +{ +"s": "<<" +}, +{ +"l": [ +{ +"s": "|x" +} +] +}, +{ +"s": "{a}" +} +] +} +] +] +}, +{ +"d": [] +}, +{ +"d": [ +[ +{ +"s": "\u2028" +}, +{ +"s": "http://x.y/z?q=1#f" +} +], +[ +{ +"s": "a\n\nb" +}, +{ +"s": "|" +} +], +[ +{ +"s": "[a]" +}, +{ +"s": "on" +} +] +] +} +] +}, +"yaml": "- a :b\n- '-1.5':\n - '!x': 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n \"a\\0b\": 2147483648\n \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \": '|'\n - '<<'\n - - '|x'\n - '{a}'\n- {}\n- '[a]': 'on'\n ? 'a\n\n\n b'\n : '|'\n ? \"\\L\"\n : http://x.y/z?q=1#f\n" +}, +{ +"tree": { +"l": [ +{ +"s": "0b101" +}, +{ +"s": "it's" +} +] +}, +"yaml": "- '0b101'\n- it's\n" +}, +{ +"tree": { +"d": [] +}, +"yaml": "{}\n" +}, +{ +"tree": { +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +"yaml": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b\n...\n" +}, +{ +"tree": { +"l": [ +{ +"f": -4616189618054758400 +}, +{ +"d": [ +[ +{ +"s": "`x`" +}, +{ +"l": [ +{ +"s": "C:\\path\\to" +}, +{ +"l": [ +{ +"f": 4614256656552045848 +}, +{ +"s": "--" +}, +{ +"s": "~" +}, +{ +"b": true +} +] +}, +{ +"d": [ +[ +{ +"s": "1_000" +}, +{ +"s": "&x" +} +], +[ +{ +"s": ":a" +}, +{ +"f": 4591870180066957722 +} +] +] +} +] +} +], +[ +{ +"s": "on" +}, +{ +"b": true +} +], +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"l": [] +} +] +] +} +] +}, +"yaml": "- -1.0\n- '`x`':\n - C:\\path\\to\n - - 3.141592653589793\n - --\n - '~'\n - true\n - '1_000': '&x'\n :a: 0.1\n ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : []\n 'on': true\n" +}, +{ +"tree": { +"l": [ +{ +"l": [ +{ +"d": [ +[ +{ +"s": ":a" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "+1" +}, +{ +"l": [ +{ +"s": "1.5" +}, +{ +"b": false +}, +{ +"s": "a,b" +} +] +} +], +[ +{ +"s": "Null" +}, +{ +"f": 4936209963552724370 +} +] +] +}, +{ +"d": [ +[ +{ +"s": "1_000" +}, +{ +"l": [ +{ +"f": 4611686018427387904 +}, +{ +"i": "7" +}, +{ +"f": 9097811302482466869 +} +] +} +], +[ +{ +"s": "\u0085" +}, +{ +"l": [ +{ +"i": "-1" +}, +{ +"i": "2147483648" +}, +{ +"s": "a, b" +} +] +} +] +] +} +] +} +] +}, +"yaml": "- - '+1':\n - '1.5'\n - false\n - a,b\n :a: 2.0\n 'Null': 1.0e+22\n - '1_000':\n - 2.0\n - 7\n - 1.5e+300\n ? \"\\N\"\n : - -1\n - 2147483648\n - a, b\n" +}, +{ +"tree": { +"s": "aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb \u00e9" +}, +"yaml": "\"aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa bb aa\\\n \\ bb aa bb \\xE9\"\n" +}, +{ +"tree": { +"b": false +}, +"yaml": "false\n...\n" +}, +{ +"tree": { +"i": "7" +}, +"yaml": "7\n...\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "1.e3" +}, +{ +"l": [] +} +], +[ +{ +"s": "value" +}, +{ +"l": [ +{ +"s": "\ta" +} +] +} +] +] +}, +"yaml": "1.e3: []\nvalue:\n- \"\\ta\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [] +} +], +[ +{ +"s": "-" +}, +{ +"s": ">" +} +], +[ +{ +"s": "007" +}, +{ +"d": [ +[ +{ +"s": "a" +}, +{ +"s": "on" +} +] +] +} +] +] +}, +"yaml": "'-': '>'\n'007':\n a: 'on'\n? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n: []\n" +}, +{ +"tree": { +"l": [ +{ +"l": [] +} +] +}, +"yaml": "- []\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "1_000" +}, +{ +"l": [] +} +] +] +}, +"yaml": "'1_000': []\n" +}, +{ +"tree": { +"f": 1 +}, +"yaml": "5.0e-324\n...\n" +}, +{ +"tree": { +"s": "[a]" +}, +"yaml": "'[a]'\n" +}, +{ +"tree": { +"s": "\u2029" +}, +"yaml": "\"\\P\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\t" +}, +{ +"d": [ +[ +{ +"s": "=" +}, +{ +"f": 4936209963552724370 +} +], +[ +{ +"s": "n_estimators" +}, +{ +"s": "1" +} +], +[ +{ +"s": "a\u0000b" +}, +{ +"s": "-1" +} +] +] +} +] +] +}, +"yaml": "\"a\\t\":\n '=': 1.0e+22\n \"a\\0b\": '-1'\n n_estimators: '1'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "0b101" +}, +{ +"l": [ +{ +"s": "a\t" +}, +{ +"l": [ +{ +"l": [ +{ +"f": 4611686018427387904 +}, +{ +"s": "1e3" +}, +{ +"f": 6103021453049119613 +}, +{ +"s": "y" +} +] +} +] +}, +{ +"l": [ +{ +"s": "&x" +}, +{ +"l": [] +} +] +}, +{ +"s": "2026-11-10" +} +] +} +] +] +}, +"yaml": "'0b101':\n- \"a\\t\"\n- - - 2.0\n - 1e3\n - 1.0e+100\n - y\n- - '&x'\n - []\n- '2026-11-10'\n" +}, +{ +"tree": { +"s": "1.e3" +}, +"yaml": "1.e3\n...\n" +}, +{ +"tree": { +"i": "1000000000000000000" +}, +"yaml": "1000000000000000000\n...\n" +}, +{ +"tree": { +"d": [] +}, +"yaml": "{}\n" +}, +{ +"tree": { +"f": 4636737291354636288 +}, +"yaml": "100.0\n...\n" +}, +{ +"tree": { +"s": "2001-12-14t21:59:43.10-05:00" +}, +"yaml": "'2001-12-14t21:59:43.10-05:00'\n" +}, +{ +"tree": { +"s": "-a" +}, +"yaml": "-a\n...\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\n\nb" +}, +{ +"i": "0" +} +] +] +}, +"yaml": "? 'a\n\n\n b'\n: 0\n" +}, +{ +"tree": { +"f": -4503599627370496 +}, +"yaml": "-.inf\n...\n" +}, +{ +"tree": { +"l": [] +}, +"yaml": "[]\n" +}, +{ +"tree": { +"s": "1:30.5" +}, +"yaml": "'1:30.5'\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "&x" +}, +{ +"l": [ +{ +"s": "1" +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "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 b" +}, +{ +"s": "- a" +} +], +[ +{ +"s": " " +}, +{ +"d": [ +[ +{ +"s": "n_estimators" +}, +{ +"d": [ +[ +{ +"s": ": a" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": ">x" +}, +{ +"s": "http://x.y/z?q=1#f" +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"b": false +} +] +] +} +] +] +} +], +[ +{ +"s": "a b" +}, +{ +"d": [ +[ +{ +"s": "1" +}, +{ +"f": 4861130398305394688 +} +] +] +} +], +[ +{ +"s": "-" +}, +{ +"l": [ +{ +"l": [ +{ +"i": "42" +}, +{ +"f": 4591870180066957722 +}, +{ +"b": true +} +] +}, +{ +"b": true +}, +{ +"s": "1.e3" +} +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [] +} +] +] +}, +{ +"s": "1_000" +} +] +}, +"yaml": "- '&x':\n - '1'\n- ' ':\n n_estimators:\n ': a': 2147483648\n '>x': http://x.y/z?q=1#f\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : false\n 'word word word word word word word word word word word word word word word word word word word word ': 2147483648\n '-':\n - - 42\n - 0.1\n - true\n - true\n - 1.e3\n a b:\n '1': 1.0e+17\n 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 b: '-\n a'\n- ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : []\n- '1_000'\n" +}, +{ +"tree": { +"f": 4611686018427387904 +}, +"yaml": "2.0\n...\n" +}, +{ +"tree": { +"l": [ +{ +"l": [] +} +] +}, +"yaml": "- []\n" +}, +{ +"tree": { +"s": "yes" +}, +"yaml": "'yes'\n" +}, +{ +"tree": { +"s": "---" +}, +"yaml": "'---'\n" +}, +{ +"tree": { +"l": [ +{ +"f": 1 +}, +{ +"b": true +}, +{ +"f": -4616189618054758400 +} +] +}, +"yaml": "- 5.0e-324\n- true\n- -1.0\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "a b" +}, +{ +"f": 6103021453049119613 +} +] +] +}, +{ +"i": "0" +}, +{ +"l": [ +{ +"l": [ +{ +"l": [ +{ +"s": "inf" +}, +{ +"f": 4611686018427387904 +}, +{ +"s": "n" +}, +{ +"b": true +} +] +} +] +}, +{ +"s": "%x" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "2026-11-10" +} +] +}, +{ +"l": [ +{ +"f": 0 +}, +{ +"f": 6103021453049119613 +} +] +}, +{ +"d": [ +[ +{ +"s": "a" +}, +{ +"b": true +} +], +[ +{ +"s": "key: value # comment" +}, +{ +"i": "2147483648" +} +] +] +}, +{ +"l": [ +{ +"s": "a #b" +}, +{ +"s": "-a" +}, +{ +"s": "''" +} +] +} +] +}, +{ +"d": [ +[ +{ +"s": "?a" +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +} +] +] +} +] +}, +{ +"s": "null" +} +] +}, +"yaml": "- a b: 1.0e+100\n- 0\n- - - - inf\n - 2.0\n - n\n - true\n - '%x'\n - - - '2026-11-10'\n - - 0.0\n - 1.0e+100\n - a: true\n 'key: value # comment': 2147483648\n - - 'a #b'\n - -a\n - ''''''\n - ?a: aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b c\n- 'null'\n" +}, +{ +"tree": { +"l": [] +}, +"yaml": "[]\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "?a" +}, +{ +"d": [ +[ +{ +"s": "0o7" +}, +{ +"l": [ +{ +"l": [] +} +] +} +], +[ +{ +"s": "[a]" +}, +{ +"d": [ +[ +{ +"s": "--- x" +}, +{ +"s": "&x" +} +] +] +} +], +[ +{ +"s": "a#b" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "\ta" +}, +{ +"s": "\\" +} +], +[ +{ +"s": "2026-1-2 3:04:05.5 +09:00" +}, +{ +"s": "a" +} +] +] +}, +{ +"l": [ +{ +"b": true +}, +{ +"s": "''" +}, +{ +"s": "\ufeff" +} +] +}, +{ +"f": 1 +}, +{ +"d": [ +[ +{ +"s": "Null" +}, +{ +"s": "a\ud83d\ude00b" +} +], +[ +{ +"s": "x" +}, +{ +"i": "1" +} +], +[ +{ +"s": "<<" +}, +{ +"s": "\na" +} +], +[ +{ +"s": "z9" +}, +{ +"f": 4591870180066957722 +} +] +] +} +] +} +], +[ +{ +"s": "a[0]" +}, +{ +"s": "-.Inf" +} +] +] +} +], +[ +{ +"s": "a\n\nb" +}, +{ +"l": [ +{ +"l": [ +{ +"d": [ +[ +{ +"s": "value" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "a\nb" +}, +{ +"s": "&x" +} +], +[ +{ +"s": "0:00:00.012345" +}, +{ +"s": "\u0085" +} +] +] +}, +{ +"f": 4636737291354636288 +}, +{ +"s": "null" +}, +{ +"n": null +} +] +} +] +} +], +[ +{ +"s": "1.e3" +}, +{ +"s": "\u00a0" +} +], +[ +{ +"s": "2001-12-14t21:59:43.10-05:00" +}, +{ +"d": [ +[ +{ +"s": "1.0e+3" +}, +{ +"s": "190:20:30" +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"l": [ +{ +"f": 0 +} +] +} +], +[ +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +}, +{ +"l": [ +{ +"l": [] +}, +{ +"s": "it's" +}, +{ +"d": [ +[ +{ +"s": "\ud83d\ude00" +}, +{ +"s": "a\\b" +} +], +[ +{ +"s": "n_estimators" +}, +{ +"s": "\u0007" +} +], +[ +{ +"s": "?a" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "trailing two " +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +} +] +] +}, +{ +"i": "7" +} +] +} +] +] +} +] +] +}, +"yaml": "1.e3: \"\\_\"\n'2001-12-14t21:59:43.10-05:00':\n '1.0e+3': '190:20:30'\n http://x.y/z?q=1#f:\n - 0.0\n ? 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n : - []\n - it's\n - ?a: 2147483648\n n_estimators: \"\\a\"\n 'trailing two ': 'word word word word word word word word word word word word\n word word word word word word word word '\n \"\\U0001F600\": a\\b\n - 7\n?a:\n 0o7:\n - []\n '[a]':\n '--- x': '&x'\n a#b:\n - \"\\ta\": \\\n '2026-1-2 3:04:05.5 +09:00': a\n - - true\n - ''''''\n - \"\\uFEFF\"\n - 5.0e-324\n - '<<': '\n\n a'\n 'Null': \"a\\U0001F600b\"\n x: 1\n z9: 0.1\n a[0]: '-.Inf'\n? 'a\n\n\n b'\n: - - '0:00:00.012345': \"\\N\"\n ? 'a\n\n b'\n : '&x'\n value: 1.0\n - 100.0\n - 'null'\n - null\n" +}, +{ +"tree": { +"s": "OFF" +}, +"yaml": "'OFF'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": " two leading" +}, +{ +"s": "a\n\nb" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [ +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"d": [ +[ +{ +"s": "Null" +}, +{ +"d": [ +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "2026-11-10 22:51:17" +}, +{ +"f": 9218868437227405312 +} +], +[ +{ +"s": "OFF" +}, +{ +"s": "\ud83d\ude00" +} +], +[ +{ +"s": ">" +}, +{ +"s": "" +} +] +] +} +], +[ +{ +"s": "|x" +}, +{ +"l": [ +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +}, +{ +"i": "9007199254740993" +}, +{ +"f": 4611686018427387904 +} +] +} +] +] +} +], +[ +{ +"s": "'" +}, +{ +"d": [ +[ +{ +"s": "%x" +}, +{ +"s": "&x" +} +], +[ +{ +"s": "2026-1-2 3:04:05.5 +09:00" +}, +{ +"s": "--- x" +} +] +] +} +] +] +} +], +[ +{ +"s": "a" +}, +{ +"s": "!" +} +], +[ +{ +"s": "a\\b" +}, +{ +"d": [] +} +] +] +}, +"yaml": "' two leading': 'a\n\n\n b'\na: '!'\na\\b: {}\n? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n: '''':\n '%x': '&x'\n '2026-1-2 3:04:05.5 +09:00': '--- x'\n '2026-11-10 22:51:17':\n 'Null':\n '2026-11-10 22:51:17': .inf\n '>': ''\n 'OFF': \"\\U0001F600\"\n '{\"a\": [1, 2]}': 1.0\n '|x':\n - \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \"\n - 9007199254740993\n - 2.0\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": " two leading" +}, +{ +"d": [ +[ +{ +"s": "<<" +}, +{ +"b": true +} +], +[ +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +}, +{ +"d": [ +[ +{ +"s": "a\n b" +}, +{ +"i": "9007199254740993" +} +], +[ +{ +"s": "No" +}, +{ +"s": "!" +} +], +[ +{ +"s": "a:" +}, +{ +"i": "1000000000000000000" +} +] +] +} +], +[ +{ +"s": "z9" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": "null" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"f": 0 +} +] +] +}, +{ +"l": [ +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +} +] +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +} +], +[ +{ +"s": "-.Inf" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "1:30" +}, +{ +"s": "n" +} +], +[ +{ +"s": "C:\\path\\to" +}, +{ +"s": "a \nb" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "\ufeff" +}, +{ +"s": ".5" +} +], +[ +{ +"s": "a:b" +}, +{ +"s": "true" +} +] +] +} +] +} +], +[ +{ +"s": "-.Inf" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": " two leading" +}, +{ +"s": "a #b" +} +] +] +} +] +} +], +[ +{ +"s": "1_000" +}, +{ +"l": [ +{ +"f": 9097811302482466869 +} +] +} +] +] +}, +{ +"d": [] +}, +{ +"d": [ +[ +{ +"s": "\ud83d\ude00" +}, +{ +"d": [ +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"d": [ +[ +{ +"s": "-1.5" +}, +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +} +], +[ +{ +"s": "a#b" +}, +{ +"f": 4607182418800017408 +} +], +[ +{ +"s": "z9" +}, +{ +"s": "\u0085" +} +] +] +} +], +[ +{ +"s": "\na" +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": "z9" +}, +{ +"d": [ +[ +{ +"s": "1:30" +}, +{ +"d": [ +[ +{ +"s": "a :b" +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": "values" +}, +{ +"l": [ +{ +"s": " two leading" +}, +{ +"b": true +}, +{ +"s": "a \nb" +} +] +} +] +] +} +] +] +}, +{ +"f": 4502148214488346440 +} +] +}, +"yaml": "- ' two leading':\n '<<': true\n ? 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n : 'No': '!'\n ? \"a\\n b\"\n : 9007199254740993\n 'a:': 1000000000000000000\n z9: []\n '-.Inf':\n - ' two leading': 'a #b'\n '1_000':\n - 1.5e+300\n 'null':\n - ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 0.0\n - - 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n - '-.Inf': 1000000000000000000\n '1:30': n\n C:\\path\\to: \"a \\nb\"\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b\n - a:b: 'true'\n \"\\uFEFF\": '.5'\n- {}\n- z9:\n '1:30':\n a :b: null\n values:\n - ' two leading'\n - true\n - \"a \\nb\"\n \"\\U0001F600\":\n ? '\n\n a'\n : null\n ? 'word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word word '\n : '-1.5': xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\n a#b: 1.0\n z9: \"\\N\"\n- 1.0e-07\n" +}, +{ +"tree": { +"s": "|" +}, +"yaml": "'|'\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": ">" +}, +{ +"l": [] +} +], +[ +{ +"s": " " +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "y" +}, +{ +"d": [ +[ +{ +"s": "1.5" +}, +{ +"d": [ +[ +{ +"s": "a\ud83d\ude00b" +}, +{ +"s": "a " +} +], +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"i": "0" +} +], +[ +{ +"s": "params" +}, +{ +"s": ">" +} +], +[ +{ +"s": "a\t" +}, +{ +"s": "!x" +} +] +] +} +], +[ +{ +"s": "=" +}, +{ +"s": "na\u00efve" +} +], +[ +{ +"s": "|" +}, +{ +"b": true +} +] +] +} +], +[ +{ +"s": "a b" +}, +{ +"d": [ +[ +{ +"s": "Null" +}, +{ +"d": [ +[ +{ +"s": "a#b" +}, +{ +"s": "a\tb" +} +] +] +} +] +] +} +] +] +} +] +}, +"yaml": "- ' ': 123456789.123\n '>': []\n a b:\n 'Null':\n a#b: \"a\\tb\"\n y:\n '1.5':\n \"a\\t\": '!x'\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b: 0\n \"a\\U0001F600b\": 'a '\n params: '>'\n '=': \"na\\xEFve\"\n '|': true\n" +}, +{ +"tree": { +"l": [] +}, +"yaml": "[]\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "it's" +}, +{ +"d": [ +[ +{ +"s": "+1" +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +} +], +[ +{ +"s": "say \"hi\"" +}, +{ +"l": [ +{ +"s": "a" +}, +{ +"s": "&" +}, +{ +"s": "---" +} +] +} +] +] +} +], +[ +{ +"s": "=" +}, +{ +"d": [] +} +], +[ +{ +"s": "true" +}, +{ +"d": [ +[ +{ +"s": "\ufeff" +}, +{ +"l": [ +{ +"i": "-1099511627776" +} +] +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "a\u0000b" +} +] +] +} +], +[ +{ +"s": "!" +}, +{ +"l": [] +} +] +] +} +] +}, +"yaml": "- '!': []\n '=': {}\n it's:\n '+1': aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b c\n say \"hi\":\n - a\n - '&'\n - '---'\n 'true':\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : \"a\\0b\"\n \"\\uFEFF\":\n - -1099511627776\n" +}, +{ +"tree": { +"l": [ +{ +"s": "null" +}, +{ +"f": 1 +}, +{ +"d": [ +[ +{ +"s": "Null" +}, +{ +"s": "y" +} +], +[ +{ +"s": "a\n" +}, +{ +"d": [ +[ +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +}, +{ +"s": "a#b" +} +], +[ +{ +"s": "\\" +}, +{ +"d": [ +[ +{ +"s": "|x" +}, +{ +"n": null +} +] +] +} +] +] +} +], +[ +{ +"s": "values" +}, +{ +"d": [] +} +], +[ +{ +"s": "-1" +}, +{ +"d": [ +[ +{ +"s": "on" +}, +{ +"d": [ +[ +{ +"s": "007" +}, +{ +"b": true +} +], +[ +{ +"s": "=" +}, +{ +"s": "\ufeff" +} +], +[ +{ +"s": "key: value # comment" +}, +{ +"b": true +} +] +] +} +] +] +} +] +] +}, +{ +"f": 4607182418800017408 +} +] +}, +"yaml": "- 'null'\n- 5.0e-324\n- '-1':\n 'on':\n '007': true\n '=': \"\\uFEFF\"\n 'key: value # comment': true\n 'Null': y\n ? 'a\n\n '\n : \\:\n '|x': null\n ? 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n : a#b\n values: {}\n- 1.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "n_estimators" +}, +{ +"l": [] +} +], +[ +{ +"s": "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 b" +}, +{ +"b": true +} +] +] +}, +"yaml": "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 b: true\nn_estimators: []\n" +}, +{ +"tree": { +"f": 4728057454355411894 +}, +"yaml": "123456789.123\n...\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "..." +} +], +[ +{ +"s": "\u2028" +}, +{ +"d": [ +[ +{ +"s": "0:00:00.012345" +}, +{ +"s": "y" +} +], +[ +{ +"s": "1.e3" +}, +{ +"l": [ +{ +"b": false +}, +{ +"s": "a\n\nb" +}, +{ +"n": null +}, +{ +"s": "-1" +} +] +} +], +[ +{ +"s": "[a]" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +} +], +[ +{ +"s": ">" +}, +{ +"s": "1.e3" +} +] +] +} +], +[ +{ +"s": "*" +}, +{ +"i": "7" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [] +} +] +] +} +] +}, +"yaml": "- '*': 7\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : []\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '...'\n ? \"\\L\"\n : '0:00:00.012345': y\n 1.e3:\n - false\n - 'a\n\n\n b'\n - null\n - '-1'\n '>': 1.e3\n '[a]': 'word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word word word '\n" +}, +{ +"tree": { +"f": 9218868437227405312 +}, +"yaml": ".inf\n...\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "--- x" +}, +{ +"f": 4846369599423283200 +} +] +] +}, +"yaml": "'--- x': 1.0e+16\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "~" +}, +{ +"d": [ +[ +{ +"s": "{a}" +}, +{ +"l": [ +{ +"s": "\ta" +}, +{ +"i": "1" +} +] +} +], +[ +{ +"s": "OFF" +}, +{ +"l": [ +{ +"b": false +}, +{ +"s": "\u2028" +}, +{ +"s": "- a" +} +] +} +] +] +} +] +] +} +] +}, +"yaml": "- '~':\n 'OFF':\n - false\n - \"\\L\"\n - '- a'\n '{a}':\n - \"\\ta\"\n - 1\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\u2029" +}, +{ +"l": [ +{ +"d": [] +}, +{ +"f": -4503599627370496 +} +] +} +] +] +}, +"yaml": "? \"\\P\"\n: - {}\n - -.inf\n" +}, +{ +"tree": { +"l": [ +{ +"d": [] +}, +{ +"i": "2147483648" +}, +{ +"d": [ +[ +{ +"s": "\u00a0" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "?a" +}, +{ +"s": "a:b" +}, +{ +"f": 4614256656552045848 +} +] +} +] +} +] +] +}, +{ +"f": 4502148214488346440 +} +] +}, +"yaml": "- {}\n- 2147483648\n- \"\\_\":\n - - ?a\n - a:b\n - 3.141592653589793\n- 1.0e-07\n" +}, +{ +"tree": { +"l": [ +{ +"d": [] +}, +{ +"l": [ +{ +"s": "nan" +}, +{ +"d": [ +[ +{ +"s": "\"" +}, +{ +"d": [ +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"f": 9218868437227405312 +} +] +] +} +], +[ +{ +"s": "-1" +}, +{ +"s": "a" +} +], +[ +{ +"s": "a :b" +}, +{ +"d": [] +} +], +[ +{ +"s": "#a" +}, +{ +"l": [ +{ +"s": "a" +}, +{ +"b": false +}, +{ +"b": false +}, +{ +"s": "" +} +] +} +] +] +}, +{ +"d": [] +} +] +}, +{ +"l": [ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"d": [ +[ +{ +"s": "1e3" +}, +{ +"s": "`x`" +} +], +[ +{ +"s": "1:30" +}, +{ +"d": [ +[ +{ +"s": "OFF" +}, +{ +"s": ".inf" +} +], +[ +{ +"s": "{a}" +}, +{ +"s": "on" +} +], +[ +{ +"s": ">" +}, +{ +"b": true +} +] +] +} +], +[ +{ +"s": "a\n\nb" +}, +{ +"d": [ +[ +{ +"s": "'" +}, +{ +"s": "a:b" +} +], +[ +{ +"s": "---" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": "\ufeff" +}, +{ +"f": 4502148214488346440 +} +] +] +} +] +] +}, +{ +"d": [] +} +] +} +] +}, +"yaml": "- {}\n- - nan\n - '\"':\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c: .inf\n '#a':\n - a\n - false\n - false\n - ''\n '-1': a\n a :b: {}\n - {}\n- - http://x.y/z?q=1#f\n - '1:30':\n '>': true\n 'OFF': '.inf'\n '{a}': 'on'\n 1e3: '`x`'\n ? 'a\n\n\n b'\n : '''': a:b\n '---': 1.0e-07\n \"\\uFEFF\": 1.0e-07\n - {}\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\u00a0" +}, +{ +"d": [] +} +] +] +}, +"yaml": "\"\\_\": {}\n" +}, +{ +"tree": { +"s": "it's" +}, +"yaml": "it's\n...\n" +}, +{ +"tree": { +"s": "null" +}, +"yaml": "'null'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "1:30.5" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"d": [ +[ +{ +"s": "%x" +}, +{ +"i": "42" +} +], +[ +{ +"s": "@x" +}, +{ +"i": "1000000000000000000" +} +], +[ +{ +"s": "2026-11-10" +}, +{ +"s": "!" +} +], +[ +{ +"s": "it's" +}, +{ +"n": null +} +] +] +} +] +] +}, +{ +"b": false +} +] +} +], +[ +{ +"s": "a\nb" +}, +{ +"d": [ +[ +{ +"s": "on" +}, +{ +"d": [ +[ +{ +"s": "|" +}, +{ +"l": [] +} +] +] +} +], +[ +{ +"s": "#a" +}, +{ +"l": [ +{ +"s": "\u2028" +}, +{ +"l": [] +} +] +} +] +] +} +], +[ +{ +"s": "lr" +}, +{ +"d": [ +[ +{ +"s": "190:20:30" +}, +{ +"s": "--" +} +], +[ +{ +"s": "a, b" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "a " +}, +{ +"d": [] +} +] +] +}, +"yaml": "'1:30.5':\n- ? 'word word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word '\n : '%x': 42\n '2026-11-10': '!'\n '@x': 1000000000000000000\n it's: null\n- false\n? 'a\n\n b'\n: '#a':\n - \"\\L\"\n - []\n 'on':\n '|': []\n'a ': {}\nlr:\n '190:20:30': --\n a, b: {}\n" +}, +{ +"tree": { +"l": [] +}, +"yaml": "[]\n" +}, +{ +"tree": { +"d": [] +}, +"yaml": "{}\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\u0007" +}, +{ +"d": [] +} +], +[ +{ +"s": "\u2029" +}, +{ +"d": [] +} +], +[ +{ +"s": "|x" +}, +{ +"d": [ +[ +{ +"s": "1:30" +}, +{ +"f": 0 +} +], +[ +{ +"s": "-" +}, +{ +"d": [ +[ +{ +"s": "-" +}, +{ +"d": [] +} +], +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"l": [ +{ +"i": "9007199254740993" +}, +{ +"i": "2147483648" +} +] +} +], +[ +{ +"s": "y" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "a\nb" +}, +{ +"d": [ +[ +{ +"s": "a b" +}, +{ +"l": [ +{ +"s": "#a" +}, +{ +"i": "9007199254740993" +}, +{ +"s": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" +} +] +} +], +[ +{ +"s": "=" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"f": 4502148214488346440 +} +], +[ +{ +"s": ".NaN" +}, +{ +"s": "a, b" +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"s": "=" +} +] +] +} +] +] +} +], +[ +{ +"s": "n" +}, +{ +"d": [ +[ +{ +"s": "a\\b" +}, +{ +"d": [ +[ +{ +"s": "" +}, +{ +"s": "|x" +} +], +[ +{ +"s": "#a" +}, +{ +"s": "''" +} +], +[ +{ +"s": "..." +}, +{ +"s": ".5" +} +] +] +} +] +] +} +] +] +} +] +] +}, +"yaml": "\"\\a\": {}\n'|x':\n '-':\n '-': {}\n aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c:\n - 9007199254740993\n - 2147483648\n y: {}\n '1:30': 0.0\n ? 'a\n\n b'\n : '=':\n '.NaN': a, b\n http://x.y/z?q=1#f: '='\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 1.0e-07\n a b:\n - '#a'\n - 9007199254740993\n - xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\n n:\n a\\b:\n ? ''\n : '|x'\n '#a': ''''''\n '...': '.5'\n? \"\\P\"\n: {}\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": ".5" +}, +{ +"s": "inf" +} +], +[ +{ +"s": "No" +}, +{ +"l": [ +{ +"i": "7" +}, +{ +"l": [ +{ +"s": "1e3" +}, +{ +"d": [] +}, +{ +"d": [ +[ +{ +"s": "[a]" +}, +{ +"i": "42" +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"i": "-1" +} +], +[ +{ +"s": "z9" +}, +{ +"s": "a, b" +} +], +[ +{ +"s": "\ta" +}, +{ +"b": true +} +] +] +}, +{ +"n": null +} +] +}, +{ +"d": [ +[ +{ +"s": "&x" +}, +{ +"d": [] +} +], +[ +{ +"s": "yes" +}, +{ +"d": [ +[ +{ +"s": "--- x" +}, +{ +"i": "0" +} +], +[ +{ +"s": "a\t" +}, +{ +"f": 4861130398305394688 +} +], +[ +{ +"s": "-a" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "&x" +}, +{ +"s": "\na" +} +] +] +} +], +[ +{ +"s": "1:30" +}, +{ +"i": "0" +} +], +[ +{ +"s": "say \"hi\"" +}, +{ +"d": [] +} +] +] +}, +{ +"l": [ +{ +"s": "-1.5" +}, +{ +"s": " two leading" +}, +{ +"s": "{\"a\": [1, 2]}" +} +] +} +] +} +] +] +}, +"yaml": "'.5': inf\n'No':\n- 7\n- - 1e3\n - {}\n - \"\\ta\": true\n '[a]': 42\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : -1\n z9: a, b\n - null\n- '&x': {}\n '1:30': 0\n say \"hi\": {}\n 'yes':\n '&x': '\n\n a'\n '--- x': 0\n -a: -.inf\n \"a\\t\": 1.0e+17\n- - '-1.5'\n - ' two leading'\n - '{\"a\": [1, 2]}'\n" +}, +{ +"tree": { +"s": "<<" +}, +"yaml": "'<<'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two line one\nline two " +}, +{ +"l": [ +{ +"l": [] +} +] +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"d": [ +[ +{ +"s": "1" +}, +{ +"d": [] +} +], +[ +{ +"s": "1:30.5" +}, +{ +"d": [ +[ +{ +"s": "a\n" +}, +{ +"l": [ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +} +] +} +] +] +} +], +[ +{ +"s": "|" +}, +{ +"d": [ +[ +{ +"s": "params" +}, +{ +"d": [] +} +], +[ +{ +"s": "0x1F" +}, +{ +"l": [ +{ +"s": "-.Inf" +}, +{ +"s": "a b" +} +] +} +], +[ +{ +"s": "*" +}, +{ +"l": [ +{ +"i": "42" +}, +{ +"s": ":a" +} +] +} +], +[ +{ +"s": "1.0e+3" +}, +{ +"s": "\u2028" +} +] +] +} +], +[ +{ +"s": "190:20:30" +}, +{ +"l": [ +{ +"f": 9221120237041090560 +} +] +} +] +] +} +] +] +}, +"yaml": "? 'line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two line one\n\n line two '\n: - []\n? 'word word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word '\n: '1': {}\n '190:20:30':\n - .nan\n '1:30.5':\n ? 'a\n\n '\n : - aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b\n '|':\n '*':\n - 42\n - :a\n '0x1F':\n - '-.Inf'\n - a b\n '1.0e+3': \"\\L\"\n params: {}\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "x" +}, +{ +"d": [ +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": ".inf" +}, +{ +"s": "a[0]" +} +], +[ +{ +"s": "a: b" +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +} +], +[ +{ +"s": "\"" +}, +{ +"s": "n" +} +] +] +} +] +} +], +[ +{ +"s": "a:" +}, +{ +"f": -4759972702479526251 +} +], +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"d": [ +[ +{ +"s": ": a" +}, +{ +"d": [ +[ +{ +"s": "it's" +}, +{ +"s": "False" +} +], +[ +{ +"s": "\ta" +}, +{ +"f": 4591870180066957722 +} +], +[ +{ +"s": "a \nb" +}, +{ +"s": "2026-11-10 22:51:17" +} +] +] +} +], +[ +{ +"s": "nan" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": " a" +} +], +[ +{ +"s": "1.5" +}, +{ +"s": "\ud83d\ude00" +} +], +[ +{ +"s": "a\n" +}, +{ +"s": "''" +} +], +[ +{ +"s": "0o7" +}, +{ +"n": null +} +] +] +} +], +[ +{ +"s": "a " +}, +{ +"d": [ +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"s": "--- x" +} +], +[ +{ +"s": "[a]" +}, +{ +"s": "--" +} +] +] +} +] +] +} +], +[ +{ +"s": ">" +}, +{ +"f": 4502148214488346440 +} +] +] +} +] +] +}, +"yaml": "x:\n '>': 1.0e-07\n 'a:': -2.5e-10\n http://x.y/z?q=1#f:\n ': a':\n \"\\ta\": 0.1\n ? \"a \\nb\"\n : '2026-11-10 22:51:17'\n it's: 'False'\n 'a ':\n '[a]': --\n '{\"a\": [1, 2]}': '--- x'\n nan:\n 0o7: null\n '1.5': \"\\U0001F600\"\n ? 'a\n\n '\n : ''''''\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : ' a'\n '{\"a\": [1, 2]}':\n - '\"': n\n '.inf': a[0]\n 'a: b': aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b\n" +}, +{ +"tree": { +"l": [ +{ +"l": [ +{ +"s": "1.5" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "\u2028" +} +] +}, +{ +"l": [ +{ +"f": 9218868437227405312 +}, +{ +"s": "yes" +} +] +} +] +}, +{ +"f": 9221120237041090560 +}, +{ +"l": [ +{ +"l": [ +{ +"i": "-1099511627776" +}, +{ +"s": "#a" +} +] +} +] +} +] +}, +{ +"l": [ +{ +"l": [ +{ +"s": "'" +}, +{ +"l": [ +{ +"s": "true" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +}, +{ +"s": "\u2028" +}, +{ +"s": "-a" +} +] +}, +{ +"l": [ +{ +"i": "-1" +} +] +} +] +}, +{ +"i": "0" +}, +{ +"f": 1 +} +] +} +] +}, +"yaml": "- - '1.5'\n - - - \"\\L\"\n - - .inf\n - 'yes'\n - .nan\n - - - -1099511627776\n - '#a'\n- - - ''''\n - - 'true'\n - 'word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word\n word word word word word word word word word word '\n - \"\\L\"\n - -a\n - - -1\n - 0\n - 5.0e-324\n" +}, +{ +"tree": { +"d": [] +}, +"yaml": "{}\n" +}, +{ +"tree": { +"s": "\u0085" +}, +"yaml": "\"\\N\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "? a" +}, +{ +"l": [ +{ +"l": [] +}, +{ +"s": "0b101" +} +] +} +] +] +}, +"yaml": "'? a':\n- []\n- '0b101'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "true" +}, +{ +"l": [] +} +], +[ +{ +"s": "1:30.5" +}, +{ +"d": [] +} +], +[ +{ +"s": "a \nb" +}, +{ +"l": [] +} +] +] +}, +"yaml": "'1:30.5': {}\n? \"a \\nb\"\n: []\n'true': []\n" +}, +{ +"tree": { +"i": "0" +}, +"yaml": "0\n...\n" +}, +{ +"tree": { +"f": 4591870180066957722 +}, +"yaml": "0.1\n...\n" +}, +{ +"tree": { +"s": ".5" +}, +"yaml": "'.5'\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"d": [ +[ +{ +"s": "a\\b" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "-1.5" +} +] +}, +{ +"s": "\"" +}, +{ +"d": [] +}, +{ +"l": [ +{ +"s": "-1" +}, +{ +"n": null +}, +{ +"f": 4846369599423283200 +} +] +} +] +} +], +[ +{ +"s": "\ta" +}, +{ +"l": [ +{ +"l": [] +} +] +} +] +] +} +] +] +}, +"yaml": "? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n: \"\\ta\":\n - []\n a\\b:\n - - '-1.5'\n - '\"'\n - {}\n - - '-1'\n - null\n - 1.0e+16\n" +}, +{ +"tree": { +"l": [ +{ +"s": "\u00a0" +}, +{ +"b": false +}, +{ +"f": 4611686018427387904 +} +] +}, +"yaml": "- \"\\_\"\n- false\n- 2.0\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\nb" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [ +[ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +}, +{ +"d": [ +[ +{ +"s": "\u0007" +}, +{ +"i": "42" +} +] +] +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [ +[ +{ +"s": "---" +}, +{ +"s": "a[0]" +} +], +[ +{ +"s": "2026-1-2 3:04:05.5 +09:00" +}, +{ +"i": "7" +} +], +[ +{ +"s": "1.0e+3" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "1" +}, +{ +"s": ".inf" +} +] +] +} +], +[ +{ +"s": "null" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "\u00a0" +} +], +[ +{ +"s": "inf" +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "---" +}, +{ +"s": "key: value # comment" +} +] +] +} +] +] +} +], +[ +{ +"s": "|x" +}, +{ +"s": "!" +} +], +[ +{ +"s": "a: b" +}, +{ +"d": [ +[ +{ +"s": "=" +}, +{ +"s": "%x" +} +], +[ +{ +"s": "a\n b" +}, +{ +"i": "-1" +} +] +] +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [] +} +] +] +} +] +] +}, +"yaml": "? 'a\n\n b'\n: 'a: b':\n '=': '%x'\n ? \"a\\n b\"\n : -1\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : {}\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c:\n \"\\a\": 42\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : '---': a[0]\n '1': '.inf'\n '1.0e+3': 2.0\n '2026-1-2 3:04:05.5 +09:00': 7\n 'null':\n '---': 'key: value # comment'\n inf: 123456789.123\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : \"\\_\"\n '|x': '!'\n" +}, +{ +"tree": { +"f": 9097811302482466869 +}, +"yaml": "1.5e+300\n...\n" +}, +{ +"tree": { +"l": [] +}, +"yaml": "[]\n" +}, +{ +"tree": { +"f": -4503599627370496 +}, +"yaml": "-.inf\n...\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a#b" +}, +{ +"l": [ +{ +"d": [] +}, +{ +"d": [ +[ +{ +"s": "\u0085" +}, +{ +"f": 4611686018427387904 +} +] +] +}, +{ +"f": 9221120237041090560 +} +] +} +] +] +}, +"yaml": "a#b:\n- {}\n- ? \"\\N\"\n : 2.0\n- .nan\n" +}, +{ +"tree": { +"l": [ +{ +"l": [ +{ +"s": "~" +}, +{ +"l": [ +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b" +}, +{ +"l": [] +}, +{ +"s": "2026-1-2 3:04:05.5 +09:00" +}, +{ +"d": [] +} +] +}, +{ +"l": [] +} +] +}, +{ +"l": [ +{ +"b": false +}, +{ +"i": "-1" +}, +{ +"d": [] +}, +{ +"d": [ +[ +{ +"s": "a[0]" +}, +{ +"i": "-1099511627776" +} +], +[ +{ +"s": "a:" +}, +{ +"s": "a\tb" +} +], +[ +{ +"s": "|" +}, +{ +"d": [ +[ +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"f": -4503599627370496 +} +], +[ +{ +"s": "a: b" +}, +{ +"f": -4759972702479526251 +} +] +] +} +] +] +} +] +}, +{ +"d": [] +}, +{ +"d": [] +} +] +}, +"yaml": "- - '~'\n - - aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b\n - []\n - '2026-1-2 3:04:05.5 +09:00'\n - {}\n - []\n- - false\n - -1\n - {}\n - 'a:': \"a\\tb\"\n a[0]: -1099511627776\n '|':\n 'a: b': -2.5e-10\n http://x.y/z?q=1#f: 1.0e+16\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : -.inf\n- {}\n- {}\n" +}, +{ +"tree": { +"s": "it's" +}, +"yaml": "it's\n...\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": " a" +}, +{ +"l": [ +{ +"l": [ +{ +"l": [ +{ +"s": "\u65e5\u672c\u8a9e" +}, +{ +"f": -4759972702479526251 +}, +{ +"f": 4591870180066957722 +}, +{ +"s": "1_000" +} +] +}, +{ +"l": [] +}, +{ +"s": "*" +} +] +}, +{ +"l": [ +{ +"s": "key: value # comment" +} +] +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "a\\b" +}, +{ +"f": -4759972702479526251 +} +] +] +}, +{ +"s": "a\tb" +} +] +}, +{ +"l": [ +{ +"s": "n" +} +] +} +] +} +], +[ +{ +"s": "Null" +}, +{ +"l": [ +{ +"l": [ +{ +"s": "2026-1-2 3:04:05.5 +09:00" +}, +{ +"d": [ +[ +{ +"s": "'" +}, +{ +"s": ">" +} +], +[ +{ +"s": "na\u00efve" +}, +{ +"i": "1" +} +], +[ +{ +"s": "it's" +}, +{ +"n": null +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"f": 4861130398305394688 +} +] +] +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +} +] +] +}, +{ +"s": "true" +} +] +}, +{ +"d": [ +[ +{ +"s": "-1" +}, +{ +"d": [] +} +], +[ +{ +"s": "a :b" +}, +{ +"d": [ +[ +{ +"s": "trailing two " +}, +{ +"s": "a\u0000b" +} +] +] +} +] +] +}, +{ +"d": [] +} +] +} +] +] +}, +"yaml": "' a':\n- - - \"\\u65E5\\u672C\\u8A9E\"\n - -2.5e-10\n - 0.1\n - '1_000'\n - []\n - '*'\n- - 'key: value # comment'\n- - a\\b: -2.5e-10\n - \"a\\tb\"\n- - n\n'Null':\n- - '2026-1-2 3:04:05.5 +09:00'\n - '''': '>'\n it's: null\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : 1.0e+17\n \"na\\xEFve\": 1\n - ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \"\n - 'true'\n- '-1': {}\n a :b:\n 'trailing two ': \"a\\0b\"\n- {}\n" +}, +{ +"tree": { +"d": [] +}, +"yaml": "{}\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [ +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"d": [] +} +] +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "a\n\nb" +}, +{ +"s": "1:30.5" +} +], +[ +{ +"s": "\ud83d\ude00" +}, +{ +"s": "'" +} +] +] +} +] +}, +"yaml": "- ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : {}\n- ? 'a\n\n\n b'\n : '1:30.5'\n \"\\U0001F600\": ''''\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "=" +}, +{ +"l": [ +{ +"l": [] +} +] +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"d": [ +[ +{ +"s": "False" +}, +{ +"d": [ +[ +{ +"s": "on" +}, +{ +"d": [] +} +] +] +} +], +[ +{ +"s": "-1.5" +}, +{ +"d": [] +} +] +] +} +] +] +}, +"yaml": "'=':\n- []\n? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n: '-1.5': {}\n 'False':\n 'on': {}\n" +}, +{ +"tree": { +"i": "7" +}, +"yaml": "7\n...\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a\tb" +}, +{ +"d": [ +[ +{ +"s": "*x" +}, +{ +"f": 4611686018427387904 +} +], +[ +{ +"s": "yes" +}, +{ +"n": null +} +], +[ +{ +"s": "~" +}, +{ +"d": [ +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [ +{ +"s": "''" +}, +{ +"s": "a b" +} +] +} +], +[ +{ +"s": "=" +}, +{ +"l": [ +{ +"s": "trailing two " +} +] +} +], +[ +{ +"s": "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk" +}, +{ +"l": [ +{ +"s": "%x" +}, +{ +"i": "0" +}, +{ +"s": "<<" +}, +{ +"f": 9097811302482466869 +} +] +} +], +[ +{ +"s": "--- x" +}, +{ +"l": [ +{ +"f": 9097811302482466869 +}, +{ +"f": 4502148214488346440 +} +] +} +] +] +} +] +] +} +], +[ +{ +"s": "z9" +}, +{ +"s": "\u0085" +} +] +] +}, +"yaml": "\"a\\tb\":\n '*x': 2.0\n 'yes': null\n '~':\n '--- x':\n - 1.5e+300\n - 1.0e-07\n '=':\n - 'trailing two '\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : - ''''''\n - a b\n ? kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk\n : - '%x'\n - 0\n - '<<'\n - 1.5e+300\nz9: \"\\N\"\n" +}, +{ +"tree": { +"l": [ +{ +"s": "say \"hi\"" +}, +{ +"d": [ +[ +{ +"s": "007" +}, +{ +"f": 1 +} +], +[ +{ +"s": "*" +}, +{ +"i": "-1" +} +] +] +}, +{ +"f": 9218868437227405312 +} +] +}, +"yaml": "- say \"hi\"\n- '*': -1\n '007': 5.0e-324\n- .inf\n" +}, +{ +"tree": { +"i": "-1" +}, +"yaml": "-1\n...\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "0:00:00.012345" +}, +{ +"d": [ +[ +{ +"s": "2026-11-10" +}, +{ +"d": [ +[ +{ +"s": "yes" +}, +{ +"l": [ +{ +"i": "1000000000000000000" +}, +{ +"f": 0 +}, +{ +"s": "'" +}, +{ +"n": null +} +] +} +], +[ +{ +"s": "0b101" +}, +{ +"l": [] +} +] +] +} +] +] +} +], +[ +{ +"s": "a:" +}, +{ +"l": [ +{ +"l": [ +{ +"d": [ +[ +{ +"s": ">x" +}, +{ +"s": "!" +} +], +[ +{ +"s": "''" +}, +{ +"s": ".5" +} +] +] +}, +{ +"b": true +}, +{ +"l": [] +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +} +] +}, +{ +"d": [] +}, +{ +"s": "a,b" +} +] +} +] +] +}, +"yaml": "'0:00:00.012345':\n '2026-11-10':\n '0b101': []\n 'yes':\n - 1000000000000000000\n - 0.0\n - ''''\n - null\n'a:':\n- - '''''': '.5'\n '>x': '!'\n - true\n - []\n - aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b c\n- {}\n- a,b\n" +}, +{ +"tree": { +"d": [] +}, +"yaml": "{}\n" +}, +{ +"tree": { +"i": "9007199254740993" +}, +"yaml": "9007199254740993\n...\n" +}, +{ +"tree": { +"l": [] +}, +"yaml": "[]\n" +}, +{ +"tree": { +"l": [ +{ +"d": [ +[ +{ +"s": "1:30" +}, +{ +"d": [ +[ +{ +"s": "lr" +}, +{ +"s": "007" +} +], +[ +{ +"s": "it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's it's " +}, +{ +"l": [ +{ +"s": "a\n" +}, +{ +"s": "007" +}, +{ +"s": "--" +}, +{ +"f": 0 +} +] +} +], +[ +{ +"s": "a\n" +}, +{ +"l": [ +{ +"i": "0" +}, +{ +"f": 4936209963552724370 +}, +{ +"s": "<<" +}, +{ +"b": false +} +] +} +] +] +} +], +[ +{ +"s": "2026-1-2 3:04:05.5 +09:00" +}, +{ +"s": "\u0085" +} +], +[ +{ +"s": "0:00:00.012345" +}, +{ +"s": "!" +} +] +] +} +] +}, +"yaml": "- '0:00:00.012345': '!'\n '1:30':\n ? 'a\n\n '\n : - 0\n - 1.0e+22\n - '<<'\n - false\n ? 'it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s\n it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s it''s '\n : - 'a\n\n '\n - '007'\n - --\n - 0.0\n lr: '007'\n '2026-1-2 3:04:05.5 +09:00': \"\\N\"\n" +}, +{ +"tree": { +"i": "42" +}, +"yaml": "42\n...\n" +}, +{ +"tree": { +"l": [ +{ +"s": "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 b" +}, +{ +"s": "a\t" +} +] +}, +"yaml": "- 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\n a a a a a a a a a a b\n- \"a\\t\"\n" +}, +{ +"tree": { +"l": [] +}, +"yaml": "[]\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "a \nb" +}, +{ +"d": [ +[ +{ +"s": "007" +}, +{ +"l": [ +{ +"d": [] +}, +{ +"l": [ +{ +"s": "0x1F" +}, +{ +"i": "9007199254740993" +} +] +}, +{ +"s": "http://x.y/z?q=1#f" +}, +{ +"s": "a#b" +} +] +} +], +[ +{ +"s": "a:b" +}, +{ +"d": [ +[ +{ +"s": "it's" +}, +{ +"d": [ +[ +{ +"s": "=" +}, +{ +"s": "C:\\path\\to" +} +] +] +} +], +[ +{ +"s": "!x" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +} +], +[ +{ +"s": "1_000" +}, +{ +"s": "2026-11-10" +} +], +[ +{ +"s": "!" +}, +{ +"d": [ +[ +{ +"s": "\u00a0" +}, +{ +"s": "na\u00efve" +} +], +[ +{ +"s": "a\nb" +}, +{ +"s": "@x" +} +], +[ +{ +"s": " two leading" +}, +{ +"s": "-a" +} +], +[ +{ +"s": ": a" +}, +{ +"s": "-a" +} +] +] +} +] +] +} +], +[ +{ +"s": "--- x" +}, +{ +"l": [ +{ +"s": "\u2028" +}, +{ +"l": [ +{ +"s": "?a" +}, +{ +"s": "\u65e5\u672c\u8a9e" +} +] +}, +{ +"s": "'" +} +] +} +] +] +} +], +[ +{ +"s": "? a" +}, +{ +"f": 6103021453049119613 +} +], +[ +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "+1" +}, +{ +"n": null +} +], +[ +{ +"s": "&x" +}, +{ +"l": [ +{ +"s": "--- x" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word " +}, +{ +"f": -4759972702479526251 +} +] +} +] +] +} +] +} +] +] +}, +"yaml": "'? a': 1.0e+100\n? \"a \\nb\"\n: '--- x':\n - \"\\L\"\n - - ?a\n - \"\\u65E5\\u672C\\u8A9E\"\n - ''''\n '007':\n - {}\n - - '0x1F'\n - 9007199254740993\n - http://x.y/z?q=1#f\n - a#b\n a:b:\n '!':\n ' two leading': -a\n ': a': -a\n ? 'a\n\n b'\n : '@x'\n \"\\_\": \"na\\xEFve\"\n '!x': 'word word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word word '\n '1_000': '2026-11-10'\n it's:\n '=': C:\\path\\to\n'word word word word word word word word word word word word word word word word word word word word ':\n- '&x':\n - '--- x'\n - 'word word word word word word word word word word word word word word word word\n word word word word '\n - -2.5e-10\n '+1': null\n" +}, +{ +"tree": { +"l": [ +{ +"s": "?a" +}, +{ +"l": [ +{ +"l": [ +{ +"f": 4936209963552724370 +}, +{ +"d": [ +[ +{ +"s": "<<" +}, +{ +"i": "2147483648" +} +], +[ +{ +"s": "y" +}, +{ +"s": "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa b c" +} +] +] +} +] +}, +{ +"d": [ +[ +{ +"s": "- a" +}, +{ +"l": [ +{ +"s": ".NaN" +} +] +} +], +[ +{ +"s": "1.5" +}, +{ +"l": [ +{ +"s": "&x" +}, +{ +"s": "1:30.5" +}, +{ +"f": 4607182418800017408 +} +] +} +], +[ +{ +"s": "!x" +}, +{ +"f": 4846369599423283200 +} +], +[ +{ +"s": "on" +}, +{ +"d": [ +[ +{ +"s": "{a}" +}, +{ +"s": "#a" +} +] +] +} +] +] +}, +{ +"s": "'" +} +] +}, +{ +"n": null +}, +{ +"l": [] +} +] +}, +"yaml": "- ?a\n- - - 1.0e+22\n - '<<': 2147483648\n y: aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n b c\n - '!x': 1.0e+16\n '- a':\n - '.NaN'\n '1.5':\n - '&x'\n - '1:30.5'\n - 1.0\n 'on':\n '{a}': '#a'\n - ''''\n- null\n- []\n" +}, +{ +"tree": { +"f": 9097811302482466869 +}, +"yaml": "1.5e+300\n...\n" +}, +{ +"tree": { +"l": [ +{ +"d": [] +} +] +}, +"yaml": "- {}\n" +}, +{ +"tree": { +"l": [ +{ +"f": -4759972702479526251 +}, +{ +"l": [] +}, +{ +"s": "say \"hi\"" +} +] +}, +"yaml": "- -2.5e-10\n- []\n- say \"hi\"\n" +}, +{ +"tree": { +"d": [ +[ +{ +"s": "\\" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "params" +}, +{ +"d": [ +[ +{ +"s": "~" +}, +{ +"s": "\u00e9" +} +], +[ +{ +"s": "'" +}, +{ +"s": "0:00:00.012345" +} +] +] +} +], +[ +{ +"s": "- a" +}, +{ +"f": 4728057454355411894 +} +], +[ +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"f": 4846369599423283200 +} +] +] +}, +{ +"d": [ +[ +{ +"s": "values" +}, +{ +"d": [] +} +], +[ +{ +"s": "z9" +}, +{ +"s": "a, b" +} +] +] +}, +{ +"l": [ +{ +"l": [ +{ +"s": "a,b" +} +] +}, +{ +"d": [ +[ +{ +"s": "\"" +}, +{ +"b": false +} +], +[ +{ +"s": "1_000" +}, +{ +"s": "-" +} +] +] +}, +{ +"d": [] +} +] +}, +{ +"l": [] +} +] +} +], +[ +{ +"s": "a\nb" +}, +{ +"d": [ +[ +{ +"s": "- a" +}, +{ +"d": [ +[ +{ +"s": "\"" +}, +{ +"d": [] +} +], +[ +{ +"s": "\u2029" +}, +{ +"d": [ +[ +{ +"s": "'" +}, +{ +"s": "\u2029" +} +], +[ +{ +"s": "~" +}, +{ +"s": "\u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 \u00e9 " +} +], +[ +{ +"s": "-a" +}, +{ +"s": ": a" +} +] +] +} +] +] +} +] +] +} +], +[ +{ +"s": "1e3" +}, +{ +"l": [] +} +] +] +}, +"yaml": "1e3: []\n\\:\n- '- a': 123456789.123\n params:\n '''': '0:00:00.012345'\n '~': \"\\xE9\"\n '{\"a\": [1, 2]}': 1.0e+16\n- values: {}\n z9: a, b\n- - - a,b\n - '\"': false\n '1_000': '-'\n - {}\n- []\n? 'a\n\n b'\n: '- a':\n '\"': {}\n ? \"\\P\"\n : '''': \"\\P\"\n -a: ': a'\n '~': \"\\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9 \\xE9\\\n \\ \\xE9 \"\n" +}, +{ +"tree": { +"s": "|" +}, +"yaml": "'|'\n" +}, +{ +"tree": { +"l": [] +}, +"yaml": "[]\n" +}, +{ +"tree": { +"l": [ +{ +"s": "007" +} +] +}, +"yaml": "- '007'\n" +}, +{ +"tree": { +"l": [ +{ +"s": "-" +}, +{ +"d": [ +[ +{ +"s": "No" +}, +{ +"d": [] +} +], +[ +{ +"s": "\"" +}, +{ +"d": [ +[ +{ +"s": "yes" +}, +{ +"l": [] +} +], +[ +{ +"s": "\ufeff" +}, +{ +"s": "word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word word " +} +], +[ +{ +"s": "\u2028" +}, +{ +"l": [ +{ +"s": "on" +} +] +} +], +[ +{ +"s": "a \nb" +}, +{ +"b": false +} +] +] +} +] +] +}, +{ +"d": [ +[ +{ +"s": "\ud83d\ude00" +}, +{ +"l": [ +{ +"d": [] +}, +{ +"d": [ +[ +{ +"s": ">" +}, +{ +"f": -4616189618054758400 +} +], +[ +{ +"s": "1e3" +}, +{ +"i": "7" +} +] +] +}, +{ +"d": [ +[ +{ +"s": "!" +}, +{ +"f": 4611686018427387904 +} +] +] +}, +{ +"d": [] +} +] +} +], +[ +{ +"s": "2001-12-14t21:59:43.10-05:00" +}, +{ +"l": [ +{ +"d": [ +[ +{ +"s": "+1" +}, +{ +"s": "[a]" +} +] +] +}, +{ +"s": "{\"a\": [1, 2]}" +}, +{ +"s": "\ta" +}, +{ +"i": "-1" +} +] +} +], +[ +{ +"s": "a\\b" +}, +{ +"d": [ +[ +{ +"s": "a, b" +}, +{ +"s": "\u00e9" +} +] +] +} +] +] +} +] +}, +"yaml": "- '-'\n- '\"':\n ? \"a \\nb\"\n : false\n 'yes': []\n ? \"\\L\"\n : - 'on'\n \"\\uFEFF\": 'word word word word word word word word word word word word word word\n word word word word word word word word word word word word word word word word\n word word word word word word word word word word '\n 'No': {}\n- '2001-12-14t21:59:43.10-05:00':\n - '+1': '[a]'\n - '{\"a\": [1, 2]}'\n - \"\\ta\"\n - -1\n a\\b:\n a, b: \"\\xE9\"\n \"\\U0001F600\":\n - {}\n - 1e3: 7\n '>': -1.0\n - '!': 2.0\n - {}\n" +}, +{ +"tree": { +"s": "--- x" +}, +"yaml": "'--- x'\n" +}, +{ +"tree": { +"i": "9007199254740993" +}, +"yaml": "9007199254740993\n...\n" +} +] +} diff --git a/test/OptunaSharp.Tests.Integration.LightGbm/Run2LightGbmParityBugTests.cs b/test/OptunaSharp.Tests.Integration.LightGbm/Run2LightGbmParityBugTests.cs new file mode 100644 index 0000000..4b549cc --- /dev/null +++ b/test/OptunaSharp.Tests.Integration.LightGbm/Run2LightGbmParityBugTests.cs @@ -0,0 +1,129 @@ +using System; +using System.Globalization; +using AwesomeAssertions; +using OptunaSharp.Integration.LightGbm; + +namespace OptunaSharp.Tests.Integration.LightGbm; + +/// <summary> +/// Open parity bugs in the LightGBM integration found by the 2026-11-10 parity QA run +/// (<c>docs/qa/PARITY_QA_2026-11-10.md</c>). Each test fails today and passes once fixed, at which point its +/// <c>OpenBugs</c> category should be removed. +/// </summary> +[TestClass] +public class Run2LightGbmParityBugTests +{ + /// <summary> + /// QA-76: when the callback's validation name and metric are not in the evaluation results, optuna-integration's + /// <c>LightGBMPruningCallback</c> raises a <c>ValueError</c> that ends with <c>str(env.evaluation_result_list)</c>, + /// the Python repr of the list of tuples (<c>100.0</c>, <c>1e-05</c>). The port formats each score with C#'s + /// default <c>double</c> formatting (<c>{r.Score}</c> in an interpolated string), which prints <c>100</c> and + /// <c>1E-05</c>. + /// </summary> + /// <remarks> + /// Python: <c>str([('valid_0', 'l2', 100.0, False), ('valid_1', 'auc', 1e-05, True)])</c> is + /// <c>[('valid_0', 'l2', 100.0, False), ('valid_1', 'auc', 1e-05, True)]</c>. The validation and metric names + /// are always single-quoted too, where Python switches to double quotes for a name that contains a single quote, + /// and a cross-validation result (five-element tuples with the standard deviation) is printed with four elements. + /// <b>Fixed 2026-11-12:</b> every element is formatted with Core's <c>PythonRepr.Repr</c>. + /// </remarks> + [TestMethod] + public void MissingMetric_ListsTheResultsInPythonRepr() + { + var trial = Optuna.CreateStudy().Ask(); + var callback = new LightGBMPruningCallback(trial, "missing"); + var results = new[] + { + new LightGbmEvaluationResult("valid_0", "l2", 100.0, false), + new LightGbmEvaluationResult("valid_1", "auc", 1e-05, true), + }; + + Action call = () => callback.Call(0, results); + + call.Should().Throw<NumSharp.ValueError>().WithMessage( + "The entry associated with the validation name \"valid_0\" and the metric name \"missing\" is not found in " + + "the evaluation result list [('valid_0', 'l2', 100.0, False), ('valid_1', 'auc', 1e-05, True)]."); + } + + /// <summary> + /// QA-76, the culture half: the interpolated score uses the current culture, so under a culture with a decimal + /// comma the message reads <c>0,5</c> where Python always prints <c>0.5</c>. + /// <b>Fixed 2026-11-12:</b> <c>PythonRepr.Repr</c> is culture-invariant. + /// </summary> + [TestMethod] + public void MissingMetric_FormatsScoresWithoutTheCurrentCulture() + { + var previous = CultureInfo.CurrentCulture; + try + { + // de-DE writes 0.5 as "0,5"; Python's repr never depends on a locale. + CultureInfo.CurrentCulture = new CultureInfo("de-DE"); + var callback = new LightGBMPruningCallback(Optuna.CreateStudy().Ask(), "missing"); + + Action call = () => callback.Call(0, new[] { new LightGbmEvaluationResult("valid_0", "l2", 0.5, false) }); + + call.Should().Throw<NumSharp.ValueError>().WithMessage("*[('valid_0', 'l2', 0.5, False)]."); + } + finally + { + CultureInfo.CurrentCulture = previous; + } + } + + /// <summary> + /// QA-76, the tuner's alias handling: optuna-integration's <c>_handling_alias_parameters</c> warns with an + /// f-string of the duplicated aliases' <c>dict</c> (Python repr: quoted strings, <c>1.0</c>) and + /// <c>{param_name}={value}</c> (<c>str</c>: <c>1.0</c>, bare strings). The port's <c>FormatDict</c> interpolates + /// the values with C#'s <c>ToString</c>, so <c>'x'</c> loses its quotes and <c>1.0</c> becomes <c>1</c>. + /// </summary> + /// <remarks> + /// Python (optuna-integration 5.1.0.dev on the vendored source): the parameters + /// <c>{'sub_row': 0.5, 'subsample': 1.0, 'min_data': 20, 'min_data_in_leaf': 'x'}</c> warn + /// <c>bagging_fraction in param detected multiple identical aliases {'sub_row': 0.5, 'subsample': 1.0}, but we use + /// bagging_fraction=1.0.</c> and <c>min_child_samples in param detected multiple identical aliases + /// {'min_data': 20, 'min_data_in_leaf': 'x'}, but we use min_child_samples=x.</c> The warning reaches the port's + /// log at WARNING level, which is where this test reads it. + /// <b>Fixed 2026-11-12:</b> the dict is formatted in repr and the chosen value in <c>str</c>. + /// </remarks> + [TestMethod] + public void DuplicatedAliases_WarnWithPythonDictRepr() + { + var writer = new System.IO.StringWriter(); + var handler = new OptunaSharp.Logging.StreamLogHandler(writer); + OptunaSharp.Logging.OptunaLogging.AddHandler(handler); + try + { + Alias.HandleAliasParameters(new OptunaSharp.Collections.OrderedDict<string, object?> + { + ["sub_row"] = 0.5, ["subsample"] = 1.0, ["min_data"] = 20L, ["min_data_in_leaf"] = "x", + }); + } + finally + { + // Detach before asserting so a failure does not leave the handler on the shared logger. + OptunaSharp.Logging.OptunaLogging.RemoveHandler(handler); + } + + writer.ToString().Should() + .Contain("bagging_fraction in param detected multiple identical aliases {'sub_row': 0.5, 'subsample': 1.0}, " + + "but we use bagging_fraction=1.0.") + .And.Contain("min_child_samples in param detected multiple identical aliases {'min_data': 20, " + + "'min_data_in_leaf': 'x'}, but we use min_child_samples=x."); + } + + /// <summary> + /// QA-76, the metric type error: optuna-integration's <c>_handling_alias_metrics</c> names the offending type as + /// <c>{type(metric)}</c>, i.e. <c><class 'int'></c>; the port prints the CLR type name (<c>Int64</c>). + /// <b>Fixed 2026-11-12:</b> the message names the Python type (<c><class 'int'></c>). + /// </summary> + /// <exception cref="AssertFailedException">The message does not match Optuna's.</exception> + [TestMethod] + public void NonIterableMetric_NamesThePythonType() + { + Action handle = () => Alias.HandleAliasMetrics( + new OptunaSharp.Collections.OrderedDict<string, object?> { ["metric"] = 1L }); + + handle.Should().Throw<NumSharp.ValueError>().WithMessage( + "The `metric` parameter is expected to be a string or an iterable object, but got <class 'int'>."); + } +} diff --git a/test/OptunaSharp.Tests.Interop/BoTorchIntegrationParityTests.cs b/test/OptunaSharp.Tests.Interop/BoTorchIntegrationParityTests.cs index 971d3db..705b843 100644 --- a/test/OptunaSharp.Tests.Interop/BoTorchIntegrationParityTests.cs +++ b/test/OptunaSharp.Tests.Interop/BoTorchIntegrationParityTests.cs @@ -167,6 +167,85 @@ public void MixedIntFloatMultiObjective_Qehvi_ByteExact() new[] { (n - 8.0) * (n - 8.0) + x * x, (n - 12.0) * (n - 12.0) + (x - 1.0) * (x - 1.0) }); }); + /// <summary> + /// Parity QA run 2 (E63, <c>docs/qa/PARITY_QA_2026-11-10.md</c>): the configuration whose full studies diverged — + /// two minimized objectives over <c>n</c> in [0, 4] and <c>x</c> in [0, 1], four startup trials, seed 0. A + /// full Python study and the bridge's full study agree on the four startup trials and then differ in the + /// eighth significant digit of <c>x</c> from the first BoTorch trial on (both sides deterministic run to run, + /// independent of torch's thread count and of whether constraints are present). This replay feeds the bridge's + /// own history into real <c>optuna_integration.BoTorchSampler</c> and compares each BoTorch suggestion: QA-82, + /// measured 3.4e-8 maximum difference, where every other configuration in this class is 0. Variants measured + /// while narrowing it: <c>n</c> in [0, 20] 2.6e-8; <c>x</c> in [-5, 5] 9.8e-8; <c>n</c> suggested before + /// <c>x</c> 3.1e-9; only <c>x</c> in [-5, 5] with <c>n</c> suggested first was identical. The divergence is + /// therefore configuration-dependent; neither the ranges nor the suggestion order alone cause it. + /// </summary> + /// <remarks> + /// Revalidated 2026-11-12: the divergence shows only in the first BoTorch study of a process. Run alone, this + /// case fails with 3.4232472856388085e-8; run after another BoTorch study in the same test process (for example + /// <see cref="MixedIntFloatMultiObjective_Qehvi_ByteExact" />), it is byte-exact. Native optuna-integration gives + /// the same trials standalone and embedded, so the bridge's first study is what differs (botorch's one-time + /// fused qLogEHVI extension attempt is the prime suspect). Run this repro on its own to see it fail. + /// </remarks> + /// <exception cref="AssertInconclusiveException">Under CI, where this known-failing repro must not run.</exception> + [TestMethod] + [TestCategory("RequiresPython")] + [TestCategory("Slow")] + [TestCategory("OpenBugs")] + public void Run2SmallIntFloatMultiObjective_Qehvi_ByteExact() + { + // The interop job's Slow leg filters only `TestCategory=Slow`, not OpenBugs, so this known-failing repro must + // not run there; locally (no CI variable) it runs and fails until the divergence is fixed. + if (Environment.GetEnvironmentVariable("CI") == "true") + Assert.Inconclusive("OpenBugs repro (QA-82); the interop CI job does not filter OpenBugs."); + AssertReplay( + 0, new[] { StudyDirection.Minimize, StudyDirection.Minimize }, cfExpr: "None", + considerRunning: false, constraintsFunc: null, + nStartup: 4, nCompletedBo: 4, nRunning: 0, + spaceExpr: "{'n': IntDistribution(0, 4), 'x': FloatDistribution(0.0, 1.0)}", + objective: t => + { + double x = t.SuggestFloat("x", 0.0, 1.0); + long n = t.SuggestInt("n", 0, 4); + return (new() { ["x"] = x, ["n"] = n }, + new[] { x * x + 0.05 * n, Math.Pow(1.0 - x, 2) + 0.05 * (4 - n) }); + }); + } + + /// <summary> + /// Parity QA run 2 (QA-82, E63): the same two objectives over two floats (<c>n</c> in [0, 4], <c>x</c> in [0, 1], + /// <c>x</c> suggested first). Here the replay's maximum difference was 0.66: the bridge suggests a different + /// point altogether, consistent with QA-82's small numerical difference flipping which acquisition restart wins. + /// The class's own float-only qEHVI case (<c>a</c>, <c>b</c> over [-5, 5]) stays at 0. + /// </summary> + /// <remarks> + /// Revalidated 2026-11-12: like the int / float case, this reproduces only as the first BoTorch study of the test + /// process (0.6619209926977506 when run alone; byte-exact after <see cref="Run2SmallIntFloatMultiObjective_Qehvi_ByteExact" /> + /// in the same process). Run it on its own to see it fail. + /// </remarks> + /// <exception cref="AssertInconclusiveException">Under CI, where this known-failing repro must not run.</exception> + [TestMethod] + [TestCategory("RequiresPython")] + [TestCategory("Slow")] + [TestCategory("OpenBugs")] + public void Run2TwoFloatMultiObjective_Qehvi_ByteExact() + { + // The interop job's Slow leg filters only `TestCategory=Slow`, not OpenBugs (see the case above). + if (Environment.GetEnvironmentVariable("CI") == "true") + Assert.Inconclusive("OpenBugs repro (QA-82); the interop CI job does not filter OpenBugs."); + AssertReplay( + 0, new[] { StudyDirection.Minimize, StudyDirection.Minimize }, cfExpr: "None", + considerRunning: false, constraintsFunc: null, + nStartup: 4, nCompletedBo: 4, nRunning: 0, + spaceExpr: "{'n': FloatDistribution(0.0, 4.0), 'x': FloatDistribution(0.0, 1.0)}", + objective: t => + { + double x = t.SuggestFloat("x", 0.0, 1.0); + double n = t.SuggestFloat("n", 0.0, 4.0); + return (new() { ["x"] = x, ["n"] = n }, + new[] { x * x + 0.05 * n, Math.Pow(1.0 - x, 2) + 0.05 * (4 - n) }); + }); + } + // ---- harness -------------------------------------------------------------------------------- private void AssertReplay( diff --git a/test/OptunaSharp.Tests.Interop/BridgeSamplerParallelReadTests.cs b/test/OptunaSharp.Tests.Interop/BridgeSamplerParallelReadTests.cs index 1497fae..4a127fb 100644 --- a/test/OptunaSharp.Tests.Interop/BridgeSamplerParallelReadTests.cs +++ b/test/OptunaSharp.Tests.Interop/BridgeSamplerParallelReadTests.cs @@ -36,8 +36,9 @@ namespace OptunaSharp.Tests.Interop; /// running trials whose parameters are stored), threaded 0-1/0. pymoo NSGA-II and AGE-MOEA-2 lockstep 42/0 /// (one offspring per round), threaded 0-2 collisions and 7-8 history repeats: under real threads the bridge /// re-hands offspring a told trial already evaluated, which one trial at a time never happens. OptunaHub -/// <c>random_search</c> and <c>pso</c> 0/0 in both, the hub's <c>differential_evolution</c> 49/0 in both (it -/// ignores running trials). BoTorch 0/0 in both, with and without <c>considerRunningTrials</c>. +/// <c>random_search</c> and <c>pso</c> 0/0 in both, the hub's <c>differential_evolution</c> 0/4 in both since the +/// persistent shadow study of 2026-11-12, as native Optuna (QA-72; 49/0 before, see the test). BoTorch 0/0 in +/// both, with and without <c>considerRunningTrials</c>. /// </para> /// <para> /// Self-skips (Inconclusive) without the engine or the bridge's Python package, like the other RequiresPython @@ -165,19 +166,27 @@ public void Pymoo_ParallelReads_CompleteEveryTrial_AndCollideAtMostAsInLockstep( /// <summary> /// The OptunaHub bridge adds no repeat of its own: a hub sampler that draws every point afresh - /// (<c>random_search</c>) or queues distinct candidates (<c>pso</c>) repeats nothing in either volley, and one - /// that ignores running trials (<c>differential_evolution</c>) hands every trial of a round one point in both, - /// 49 collisions, because each read sees the same told trials. + /// (<c>random_search</c>) or queues distinct candidates (<c>pso</c>) repeats nothing in either volley, and + /// <c>differential_evolution</c>, which picks each trial's individual by <c>trial.number % population_size</c>, + /// repeats what native Optuna repeats: no collision, as the shadow study mirrors every trial, running ones + /// included, under its own number, and 4 history repeats in round 7, where 4 trials receive points earlier trials + /// already evaluated. Native Optuna does the same under the same lockstep: all 64 points identical, bit for bit + /// (measured 2026-11-12). The threaded volley gives the same counts, as the bridge serializes every call on the + /// Python thread (three runs). Before the persistent shadow (QA-72) each read's shadow trial was numbered after + /// the finished trials only and its history cache never refreshed: 49 collisions and no history repeat, artifacts + /// of the bridge. /// </summary> /// <param name="package">The registry package under <c>refs/optunahub-registry/package</c>.</param> /// <param name="className">The sampler class the package exports.</param> /// <param name="collisions">The collisions pinned for both volleys.</param> + /// <param name="historyRepeats">The history repeats pinned for both volleys.</param> [TestMethod] [TestCategory("RequiresPython")] - [DataRow("samplers/random_search", "RandomSampler", 0)] - [DataRow("samplers/pso", "PSOSampler", 0)] - [DataRow("samplers/differential_evolution", "DESampler", 49)] - public void OptunaHub_BothVolleys_RepeatWhatTheHubSamplerRepeats(string package, string className, int collisions) + [DataRow("samplers/random_search", "RandomSampler", 0, 0)] + [DataRow("samplers/pso", "PSOSampler", 0, 0)] + [DataRow("samplers/differential_evolution", "DESampler", 0, 4)] + public void OptunaHub_BothVolleys_RepeatWhatTheHubSamplerRepeats( + string package, string className, int collisions, int historyRepeats) { RequireOptunaHubOrInconclusive(); string registry = Path.Combine(RepoRoot(), "refs", "optunahub-registry", "package"); @@ -196,9 +205,9 @@ public void OptunaHub_BothVolleys_RepeatWhatTheHubSamplerRepeats(string package, threadedSampler, false, ParallelReads.Space.Continuous, Rounds); lockstep.Collisions.Should().Be(collisions, "lockstep: {0}", lockstep); - lockstep.HistoryRepeats.Should().Be(0, "lockstep: {0}", lockstep); + lockstep.HistoryRepeats.Should().Be(historyRepeats, "lockstep: {0}", lockstep); threaded.Collisions.Should().Be(collisions, "threaded: {0}", threaded); - threaded.HistoryRepeats.Should().Be(0, "threaded: {0}", threaded); + threaded.HistoryRepeats.Should().Be(historyRepeats, "threaded: {0}", threaded); } /// <summary> diff --git a/test/OptunaSharp.Tests.Interop/CmaEsMixedFleetInteropTests.cs b/test/OptunaSharp.Tests.Interop/CmaEsMixedFleetInteropTests.cs index 8169be8..c7b2496 100644 --- a/test/OptunaSharp.Tests.Interop/CmaEsMixedFleetInteropTests.cs +++ b/test/OptunaSharp.Tests.Interop/CmaEsMixedFleetInteropTests.cs @@ -115,6 +115,30 @@ public void CSharpAndPythonWorkers_TakingTurns_WithMargin_CompleteTheStudy(bool } } + /// <summary> + /// The C# seat opts into <c>reuseToldOptimizer</c> (Rustuna plan 13, D1): its samples are no longer Optuna's, but + /// it still stores Optuna's state every generation, so the Python seat keeps restoring and continuing it. Every + /// trial completes, the states change hands both ways, and the study passes through the same generations at the + /// same trials as the Python-only fleet. + /// </summary> + /// <param name="csharpFirst">Whether the C# worker takes the first turn.</param> + [TestMethod] + [TestCategory("RequiresPython")] + [DataRow(true)] + [DataRow(false)] + public void CSharpWorkerReusingItsToldOptimizer_AndAPythonWorker_CompleteTheStudy(bool csharpFirst) + { + PythonSession.EnsureOrInconclusive(); + + var reference = RunFleet("cma", "reference", firstIsCSharp: false, secondIsCSharp: false); + var mixed = RunFleet("cma_reuse", "mixed", firstIsCSharp: csharpFirst, secondIsCSharp: !csharpFirst); + + mixed.Should().HaveCount(Turns * TrialsPerTurn).And.OnlyContain(t => t.State == TrialState.Complete); + AssertStatesChangedHands(mixed, "cma:"); + mixed.Select(t => Generation(t, "cma:")).Should().Equal(reference.Select(t => Generation(t, "cma:")), + "tells happen when a generation's trials are complete, whatever their values"); + } + /// <summary> /// Runs a two-seat fleet on a new journal: the first seat (seed 11) takes the even turns, the second (seed 22) /// the odd ones, each seat a C# or a Python worker whose study, storage and sampler live across its turns. @@ -200,6 +224,7 @@ private IReadOnlyList<FrozenTrial> RunFleet(string variant, string name, bool fi private static CmaEsSampler CsSampler(string variant, int seed) => variant switch { "cma" => new CmaEsSampler(seed: seed), + "cma_reuse" => new CmaEsSampler(seed: seed, reuseToldOptimizer: true), "sepcma" => new CmaEsSampler(seed: seed, useSeparableCma: true), "lr_adapt" => new CmaEsSampler(seed: seed, lrAdapt: true), "with_margin" => new CmaEsSampler(seed: seed, withMargin: true), @@ -212,7 +237,7 @@ private IReadOnlyList<FrozenTrial> RunFleet(string variant, string name, bool fi /// <exception cref="ArgumentOutOfRangeException">The variant is unknown.</exception> private static string PySampler(string variant) => variant switch { - "cma" => "optuna.samplers.CmaEsSampler(seed=seed)", + "cma" or "cma_reuse" => "optuna.samplers.CmaEsSampler(seed=seed)", "sepcma" => "optuna.samplers.CmaEsSampler(seed=seed, use_separable_cma=True)", "lr_adapt" => "optuna.samplers.CmaEsSampler(seed=seed, lr_adapt=True)", "with_margin" => "optuna.samplers.CmaEsSampler(seed=seed, with_margin=True)", diff --git a/test/OptunaSharp.Tests.Interop/CmaEsSamplerParityTests.cs b/test/OptunaSharp.Tests.Interop/CmaEsSamplerParityTests.cs index 2471c75..31f2b25 100644 --- a/test/OptunaSharp.Tests.Interop/CmaEsSamplerParityTests.cs +++ b/test/OptunaSharp.Tests.Interop/CmaEsSamplerParityTests.cs @@ -396,6 +396,194 @@ public void WithMargin_Trajectory_MatchesLiveOptuna(int seed, int nTrials) $"study.optimize(_obj, n_trials={nTrials})\n"); } + // ---- Rustuna plan 13, phase 1: the optimizer cache and the incremental history must leave every trial and every + // ---- stored optimizer state identical to Optuna's over many generations, failing tellers and pruned trials. + + /// <summary> + /// 30-40 generations of the plain sampler: the optimizer is restored once per generation and reused, and the + /// history is folded incrementally, yet every trial and stored state equals live Optuna's. + /// </summary> + /// <param name="dim">Search-space dimension.</param> + /// <param name="seed">Sampler seed.</param> + /// <param name="nTrials">Number of trials.</param> + [TestMethod] + [TestCategory("RequiresPython")] + [DataRow(10, 3, 400)] + [DataRow(6, 11, 300)] + public void LongRun_FloatSphere_FullState_IsBitIdentical(int dim, int seed, int nTrials) + { + PythonSession.EnsureBitExactHostOrInconclusive(); + + var csStudy = Optuna.CreateStudy( + storage: new InMemoryStorage(), studyName: "cma", + sampler: new CmaEsSampler(seed: seed)); + csStudy.Optimize(SphereCs(dim), nTrials: nTrials); + + AssertParityExceptOptimizerBlob(csStudy, + $"study = optuna.create_study(study_name='cma', sampler=optuna.samplers.CmaEsSampler(seed={seed}))\n" + + SpherePy(dim) + + $"study.optimize(_obj, n_trials={nTrials})\n"); + } + + /// <summary> + /// The 40-D workload of the Rustuna comparison for 1,200 trials (80 generations), where a wrong cache hit or a + /// mis-ordered generation would show within a few generations. + /// </summary> + [TestMethod] + [TestCategory("RequiresPython")] + [TestCategory("Slow")] + public void LongRun_40D_FullState_IsBitIdentical() + { + PythonSession.EnsureBitExactHostOrInconclusive(); + + var csStudy = Optuna.CreateStudy( + storage: new InMemoryStorage(), studyName: "cma", + sampler: new CmaEsSampler(seed: 0)); + csStudy.Optimize(SphereCs(40), nTrials: 1200); + + AssertParityExceptOptimizerBlob(csStudy, + "study = optuna.create_study(study_name='cma', sampler=optuna.samplers.CmaEsSampler(seed=0))\n" + + SpherePy(40) + + "study.optimize(_obj, n_trials=1200)\n"); + } + + /// <summary> + /// Every other trial that told a generation (its sampling stored a state) fails afterwards, plus every 7th + /// trial. A failed teller never becomes the latest state holder, so the next ask must restore the previous state + /// (the cache was dropped at the tell) and tell the same generation again, exactly as Optuna does. + /// </summary> + /// <exception cref="InvalidOperationException"> + /// Thrown by the objective on purpose; <c>Optimize</c>'s <c>catch</c> turns it into a FAIL trial, so it never + /// leaves the test. + /// </exception> + [TestMethod] + [TestCategory("RequiresPython")] + public void FailingTellers_FullState_IsBitIdentical() + { + PythonSession.EnsureBitExactHostOrInconclusive(); + + var sphere = SphereCs(6); + var csStudy = Optuna.CreateStudy( + storage: new InMemoryStorage(), studyName: "cma", + sampler: new CmaEsSampler(seed: 5)); + int tellersSeen = 0; + csStudy.Optimize(t => + { + double v = sphere(t); + bool told = csStudy.Storage.GetTrialSystemAttrs(t.TrialId).ContainsKey("cma:optimizer:0"); + if ((told && tellersSeen++ % 2 == 0) || t.Number % 7 == 3) + throw new InvalidOperationException("planned failure"); + return v; + }, nTrials: 300, @catch: new[] { typeof(InvalidOperationException) }); + + csStudy.Trials.Count(t => t.State == TrialState.Fail + && t.SystemAttrs.ContainsKey("cma:optimizer:0")).Should().BeGreaterThan(5, "failed tellers must occur"); + AssertParityExceptOptimizerBlob(csStudy, + "study = optuna.create_study(study_name='cma', sampler=optuna.samplers.CmaEsSampler(seed=5))\n" + + SpherePy(6) + + "_tellers_seen = [0]\n" + + "def _obj_failing(t):\n" + + " v = _obj(t)\n" + + " told = 'cma:optimizer:0' in t.study._storage.get_trial_system_attrs(t._trial_id)\n" + + " fail = False\n" + + " if told:\n" + + " fail = _tellers_seen[0] % 2 == 0\n" + + " _tellers_seen[0] += 1\n" + + " if fail or t.number % 7 == 3:\n" + + " raise ValueError('planned failure')\n" + + " return v\n" + + "study.optimize(_obj_failing, n_trials=300, catch=(ValueError,))\n"); + } + + /// <summary> + /// With <c>consider_pruned_trials</c>, pruned trials join the history as copies carrying their last + /// intermediate value; the history makes each copy once, when the trial is folded, and the run still equals + /// Optuna's, which copies them on every ask. + /// </summary> + /// <exception cref="TrialPruned"> + /// Thrown by the objective on purpose for every 5th trial; the study records it as a PRUNED trial, so it never + /// leaves the test. + /// </exception> + [TestMethod] + [TestCategory("RequiresPython")] + public void ConsiderPrunedTrials_FullState_IsBitIdentical() + { + PythonSession.EnsureBitExactHostOrInconclusive(); + + var sphere = SphereCs(5); + var csStudy = Optuna.CreateStudy( + storage: new InMemoryStorage(), studyName: "cma", + sampler: new CmaEsSampler(seed: 2, considerPrunedTrials: true)); + csStudy.Optimize(t => + { + double v = sphere(t); + if (t.Number % 5 == 2) + { + t.Report(v + 1.0, 1); + t.Report(v * 0.5, 3); + throw new TrialPruned(); + } + return v; + }, nTrials: 250); + + csStudy.Trials.Count(t => t.State == TrialState.Pruned).Should().BeGreaterThan(40); + AssertParityExceptOptimizerBlob(csStudy, + "study = optuna.create_study(study_name='cma', sampler=optuna.samplers.CmaEsSampler(seed=2, consider_pruned_trials=True))\n" + + SpherePy(5) + + "def _obj_pruning(t):\n" + + " v = _obj(t)\n" + + " if t.number % 5 == 2:\n" + + " t.report(v + 1.0, 1)\n" + + " t.report(v * 0.5, 3)\n" + + " raise optuna.TrialPruned()\n" + + " return v\n" + + "study.optimize(_obj_pruning, n_trials=250)\n"); + } + + /// <summary>The separable variant over 30+ generations: its own state prefix (<c>sepcma:</c>) and diagonal state.</summary> + /// <remarks> + /// Pinned to the bit-exact host (x64) like every other long run here. The short + /// <see cref="SeparableCma_FullState_IsBitIdentical" /> still runs on every host, but 30 generations meet the + /// last-bit math difference <see cref="PythonSession.BitExactHost" /> documents for arm64: in CI's first macOS run + /// of this test (2026-11-14), trial 11's stored optimizer state already differed from Optuna's. + /// </remarks> + [TestMethod] + [TestCategory("RequiresPython")] + public void SeparableCma_LongRun_FullState_IsBitIdentical() + { + // x64 only: the run is long enough to meet an arm64 last-bit difference (see remarks). + PythonSession.EnsureBitExactHostOrInconclusive(); + + var csStudy = Optuna.CreateStudy( + storage: new InMemoryStorage(), studyName: "cma", + sampler: new CmaEsSampler(seed: 4, useSeparableCma: true)); + csStudy.Optimize(SphereCs(8), nTrials: 300); + + AssertParityExceptOptimizerBlob(csStudy, + "import warnings; warnings.simplefilter('ignore')\n" + + "study = optuna.create_study(study_name='cma', sampler=optuna.samplers.CmaEsSampler(seed=4, use_separable_cma=True))\n" + + SpherePy(8) + + "study.optimize(_obj, n_trials=300)\n"); + } + + /// <summary>Learning-rate adaptation over 30+ generations: its extra state (the lr-adapt moments) survives the cache.</summary> + [TestMethod] + [TestCategory("RequiresPython")] + public void LrAdapt_LongRun_FullState_IsBitIdentical() + { + PythonSession.EnsureBitExactHostOrInconclusive(); + + var csStudy = Optuna.CreateStudy( + storage: new InMemoryStorage(), studyName: "cma", + sampler: new CmaEsSampler(seed: 9, lrAdapt: true)); + csStudy.Optimize(SphereCs(6), nTrials: 300); + + AssertParityExceptOptimizerBlob(csStudy, + "study = optuna.create_study(study_name='cma', sampler=optuna.samplers.CmaEsSampler(seed=9, lr_adapt=True))\n" + + SpherePy(6) + + "study.optimize(_obj, n_trials=300)\n"); + } + // Deterministic shifted sphere with an explicit left-to-right sum (NOT Python's builtin sum(), // which since 3.12 uses Neumaier compensated summation and would drift ~1 ULP from the C# sum). private static Func<Trial, double> SphereCs(int dim) diff --git a/test/OptunaSharp.Tests.Interop/CompactStorageParityTests.cs b/test/OptunaSharp.Tests.Interop/CompactStorageParityTests.cs new file mode 100644 index 0000000..0d4701d --- /dev/null +++ b/test/OptunaSharp.Tests.Interop/CompactStorageParityTests.cs @@ -0,0 +1,256 @@ +using System; +using System.Collections.Generic; +using System.Linq; +using AwesomeAssertions; +using OptunaSharp.Distributions; +using OptunaSharp.Samplers; +using OptunaSharp.Storages; + +namespace OptunaSharp.Tests.Interop; + +/// <summary> +/// Plan 13, item S12, against live Optuna: studies run on <c>InMemoryStorage(compactFinishedTrials: true)</c> give +/// Python's trials bit for bit (TPE to its documented erf tolerance), attributes included, while every finished +/// record stays compact through the run. The compact storage is an opt-in memory layout, so the samplers must not be +/// able to tell it from Optuna's. +/// </summary> +[TestClass] +public class CompactStorageParityTests : OptunaInteropTestBase +{ + /// <summary>The storage under test: Optuna's in-memory storage with finished trials kept compactly.</summary> + /// <returns>A new compacting storage.</returns> + private static InMemoryStorage CompactStorage() => new(compactFinishedTrials: true); + + /// <summary>Every finished record of the study is still compact after the run.</summary> + /// <param name="study">A study on a compacting storage.</param> + private static void AssertRecordsStayedCompact(Study study) + { + var records = study.Storage.GetAllTrials(study.StudyId, deepcopy: false); + records.Should().NotBeEmpty(); + records.Where(r => r.State.IsFinished()).Should().OnlyContain(r => r.IsCompact, + "the sampler and the snapshot read finished records through the read-only accessors"); + } + + /// <summary>Runs the Python study and asserts bit-exact full-state parity with the compact C# one.</summary> + /// <param name="csStudy">The finished OptunaSharp study on a compacting storage.</param> + /// <param name="pyCreateAndRun">Python that creates and runs the same study as <c>study</c>.</param> + private void AssertFullParity(Study csStudy, string pyCreateAndRun) + { + AssertRecordsStayedCompact(csStudy); + var csState = StudySnapshot.Capture(csStudy); + PyExec(pyCreateAndRun); + StudySnapshot.AssertParity(PyStudyState("study"), csState, DatetimeComparison.NullnessOnly); + AssertRecordsStayedCompact(csStudy); + } + + /// <summary> + /// Random search over every parameter kind, writing attributes the compact storage stores as bytes (a long ASCII + /// string, an odd-length lowercase hexadecimal string), a non-ASCII string it keeps, and a nested list: every + /// trial and attribute matches Python's bit for bit. + /// </summary> + /// <param name="seed">Sampler seed.</param> + [TestMethod] + [TestCategory("RequiresPython")] + [DataRow(0)] + [DataRow(17)] + public void RandomWithAttributes_FullState_IsBitIdentical(int seed) + { + PythonSession.EnsureOrInconclusive(); + + var csStudy = Optuna.CreateStudy(storage: CompactStorage(), studyName: "compact", + sampler: new RandomSampler(seed: seed)); + csStudy.Optimize(t => + { + double x = t.SuggestFloat("x", -5, 5); + t.SuggestFloat("lx", 1e-3, 1e3, log: true); + t.SuggestFloat("sx", -1, 1, step: 0.25); + long n = t.SuggestInt("n", -3, 3); + t.SuggestInt("ln", 1, 64, log: true); + t.SuggestCategorical("c", new CategoricalChoice[] { "a", CategoricalChoice.None, true, 7L, 2.5 }); + t.SetUserAttr("blob", new string('q', 90) + t.Number); + t.SetUserAttr("hex", string.Concat(Enumerable.Repeat("0a1b2c3d4e5f", 6)) + "9"); + t.SetUserAttr("unicode", new string('é', 70)); + t.SetUserAttr("nested", new List<object?> { (long)t.Number, "two", 3.5, null }); + return x * x + n; + }, nTrials: 30); + + AssertFullParity(csStudy, + $"study = optuna.create_study(study_name='compact', sampler=optuna.samplers.RandomSampler(seed={seed}))\n" + + "def _obj(t):\n" + + " x = t.suggest_float('x', -5, 5)\n" + + " t.suggest_float('lx', 1e-3, 1e3, log=True)\n" + + " t.suggest_float('sx', -1, 1, step=0.25)\n" + + " n = t.suggest_int('n', -3, 3)\n" + + " t.suggest_int('ln', 1, 64, log=True)\n" + + " t.suggest_categorical('c', ['a', None, True, 7, 2.5])\n" + + " t.set_user_attr('blob', 'q' * 90 + str(t.number))\n" + + " t.set_user_attr('hex', '0a1b2c3d4e5f' * 6 + '9')\n" + + " t.set_user_attr('unicode', '\\u00e9' * 70)\n" + + " t.set_user_attr('nested', [t.number, 'two', 3.5, None])\n" + + " return x * x + n\n" + + "study.optimize(_obj, n_trials=30)\n"); + } + + /// <summary>NSGA-II over a mixed space reads its parents from compact records and matches Python bit for bit.</summary> + /// <param name="seed">Sampler seed.</param> + [TestMethod] + [TestCategory("RequiresPython")] + [DataRow(0)] + [DataRow(42)] + public void NsgaiiMixedSpace_FullState_IsBitIdentical(int seed) + { + PythonSession.EnsureOrInconclusive(); + + var csStudy = Optuna.CreateStudy(storage: CompactStorage(), studyName: "compact", + sampler: new NSGAIISampler(populationSize: 5, seed: seed), direction: StudyDirection.Minimize); + csStudy.Optimize(t => + { + double x = t.SuggestFloat("x", -5, 5); + long y = t.SuggestInt("y", 0, 10); + t.SuggestCategorical("z", new CategoricalChoice[] { "a", "b", "c" }); + double lx = t.SuggestFloat("lx", 1e-3, 1e3, log: true); + return Math.Pow(x - 2, 2) + y + lx; + }, nTrials: 24); + + AssertFullParity(csStudy, + "study = optuna.create_study(study_name='compact', direction='minimize', " + + $"sampler=optuna.samplers.NSGAIISampler(population_size=5, seed={seed}))\n" + + "def _obj(t):\n" + + " x = t.suggest_float('x', -5, 5)\n" + + " y = t.suggest_int('y', 0, 10)\n" + + " t.suggest_categorical('z', ['a', 'b', 'c'])\n" + + " lx = t.suggest_float('lx', 1e-3, 1e3, log=True)\n" + + " return (x - 2) ** 2 + y + lx\n" + + "study.optimize(_obj, n_trials=24)\n"); + } + + /// <summary>QMC reads its first finished trial's distributions from a compact record and matches Python bit for bit.</summary> + [TestMethod] + [TestCategory("RequiresPython")] + public void Qmc_FullState_IsBitIdentical() + { + PythonSession.EnsureOrInconclusive(); + + var csStudy = Optuna.CreateStudy(storage: CompactStorage(), studyName: "compact", + sampler: new QMCSampler(seed: 3)); + csStudy.Optimize(t => t.SuggestFloat("x", -1, 1) + t.SuggestInt("n", 0, 9), nTrials: 16); + + AssertFullParity(csStudy, + "import warnings; warnings.simplefilter('ignore')\n" + + "study = optuna.create_study(study_name='compact', sampler=optuna.samplers.QMCSampler(seed=3))\n" + + "study.optimize(lambda t: t.suggest_float('x', -1, 1) + t.suggest_int('n', 0, 9), n_trials=16)\n"); + } + + /// <summary> + /// CMA-ES restores its optimizer from the hexadecimal chunks the compact storage holds as bytes: every trial + /// matches Python bit for bit, and the stored chunks are exactly the strings an uncompacted C# run stores + /// (whose pickles <see cref="CmaEsSamplerParityTests" /> already proves equal to Python's). + /// </summary> + /// <param name="seed">Sampler seed.</param> + [TestMethod] + [TestCategory("RequiresPython")] + [DataRow(0)] + [DataRow(7)] + public void CmaEs_FullState_IsBitIdentical_AndStoresTheSameChunks(int seed) + { + PythonSession.EnsureBitExactHostOrInconclusive(); + + // Summed left to right on both sides: Python's sum() compensates (Neumaier, CPython 3.12+), which would change + // the last bit of some values for a reason that has nothing to do with the storage. + Func<Trial, double> sphere = t => + { + double v = 0; + for (int i = 0; i < 3; i++) + v += Math.Pow(t.SuggestFloat($"x{i}", -3, 3) - 1, 2); + return v; + }; + var csStudy = Optuna.CreateStudy(storage: CompactStorage(), studyName: "cma", sampler: new CmaEsSampler(seed: seed)); + csStudy.Optimize(sphere, nTrials: 28); + var plainStudy = Optuna.CreateStudy(storage: new InMemoryStorage(), studyName: "cma", sampler: new CmaEsSampler(seed: seed)); + plainStudy.Optimize(sphere, nTrials: 28); + AssertRecordsStayedCompact(csStudy); + + var csState = StudySnapshot.Capture(csStudy); + var plainState = StudySnapshot.Capture(plainStudy); + int chunks = 0; + for (int i = 0; i < csState.Trials.Count; i++) + { + var compactChunks = csState.Trials[i].SystemAttrs.Where(kv => kv.Key.Contains(":optimizer:")).ToList(); + var plainChunks = plainState.Trials[i].SystemAttrs.Where(kv => kv.Key.Contains(":optimizer:")).ToList(); + compactChunks.Select(kv => kv.Key).Should().Equal(plainChunks.Select(kv => kv.Key)); + compactChunks.Select(kv => (string)kv.Value!).Should().Equal(plainChunks.Select(kv => (string)kv.Value!)); + chunks += compactChunks.Count; + } + chunks.Should().BePositive("the study must have stored optimizer states"); + + PyExec( + $"study = optuna.create_study(study_name='cma', sampler=optuna.samplers.CmaEsSampler(seed={seed}))\n" + + "def _obj(t):\n" + + " v = 0.0\n" + + " for i in range(3):\n" + + " v += (t.suggest_float(f'x{i}', -3, 3) - 1) ** 2\n" + + " return v\n" + + "study.optimize(_obj, n_trials=28)\n"); + var pyState = PyStudyState("study"); + foreach (var snapshot in new[] { pyState, csState }) + foreach (var trial in snapshot.Trials) + foreach (string key in trial.SystemAttrs.Keys.Where(k => k.Contains(":optimizer:")).ToList()) + trial.SystemAttrs.Remove(key); + StudySnapshot.AssertParity(pyState, csState, DatetimeComparison.NullnessOnly); + } + + /// <summary> + /// Multivariate TPE reads every finished trial's parameters on every ask through the compact views and stays in + /// lock-step with Python: same trial count, states and parameter sets, continuous values within TPE's documented + /// erf tolerance and categorical values exact. + /// </summary> + /// <param name="seed">Sampler seed.</param> + [TestMethod] + [TestCategory("RequiresPython")] + [DataRow(0)] + [DataRow(42)] + public void TpeMultivariate_TrajectoryMatches(int seed) + { + PythonSession.EnsureOrInconclusive(); + const double tolerance = 1e-9; + + var csStudy = Optuna.CreateStudy(storage: CompactStorage(), studyName: "tpe", sampler: new TPESampler(seed: seed)); + csStudy.Optimize(t => + { + double x1 = t.SuggestFloat("x1", -5, 5); + t.SuggestFloat("x2", -5, 5); + t.SuggestFloat("lx", 1e-3, 1e3, log: true); + t.SuggestCategorical("cc", new CategoricalChoice[] { "a", "b", "c" }); + return x1 * x1; + }, nTrials: 30); + AssertRecordsStayedCompact(csStudy); + var csState = StudySnapshot.Capture(csStudy); + + PyExec( + $"study = optuna.create_study(study_name='tpe', sampler=optuna.samplers.TPESampler(seed={seed}))\n" + + "def _obj(t):\n" + + " x1 = t.suggest_float('x1', -5, 5)\n" + + " t.suggest_float('x2', -5, 5)\n" + + " t.suggest_float('lx', 1e-3, 1e3, log=True)\n" + + " t.suggest_categorical('cc', ['a', 'b', 'c'])\n" + + " return x1 ** 2\n" + + "study.optimize(_obj, n_trials=30)\n"); + var pyState = PyStudyState("study"); + + csState.Trials.Count.Should().Be(pyState.Trials.Count); + for (int i = 0; i < pyState.Trials.Count; i++) + { + var expected = pyState.Trials[i]; + var actual = csState.Trials[i]; + actual.State.Should().Be(expected.State, $"trial {i} state"); + actual.Params.Keys.Should().BeEquivalentTo(expected.Params.Keys, $"trial {i} parameter set"); + foreach (string key in expected.Params.Keys) + { + if (expected.Params[key] is double e && actual.Params[key] is double a) + a.Should().BeApproximately(e, Math.Max(tolerance, tolerance * Math.Abs(e)), $"trial {i} '{key}'"); + else + actual.Params[key].Should().Be(expected.Params[key], $"trial {i} '{key}'"); + } + } + } +} diff --git a/test/OptunaSharp.Tests.Interop/HypervolumeParityTests.cs b/test/OptunaSharp.Tests.Interop/HypervolumeParityTests.cs new file mode 100644 index 0000000..77eb982 --- /dev/null +++ b/test/OptunaSharp.Tests.Interop/HypervolumeParityTests.cs @@ -0,0 +1,199 @@ +using System; +using System.Globalization; +using System.Linq; +using AwesomeAssertions; +using OptunaSharp.Internal; + +namespace OptunaSharp.Tests.Interop; + +/// <summary> +/// Bit-for-bit parity of <see cref="Hypervolume.ComputeHypervolume" /> and <see cref="Hypervolume.SolveHssp" /> with +/// Optuna's own <c>optuna._hypervolume.compute_hypervolume</c> and <c>_solve_hssp</c>, live. Optuna computes the +/// two- and three-objective volumes with NumPy's <c>@</c> / <c>np.dot</c>, i.e. BLAS <c>ddot</c> and <c>dgemv</c>, whose +/// accumulation order no sequential loop reproduces; OptunaSharp routes those products through NumSharp's +/// <c>np.dot</c> on the same OpenBLAS binary NumPy bundles, so the volumes, and the greedy subset selection built on +/// them (multi-objective TPE's tie-break, SMS-EMOA's survival), match to the last bit. Fronts use full-precision +/// random coordinates, so every product and sum rounds; duplicated and weakly dominated rows exercise the +/// zero-contribution ties of the three-objective subset selection. +/// </summary> +/// <remarks> +/// Both tests need the live NumPy to run on the scipy-openblas NumSharp bundles, so they are pinned to the +/// bit-exact host (<see cref="PythonSession.EnsureBitExactHostOrInconclusive" />, x64) like the suite's other +/// bit-exact gates. On macOS arm64, pip installs NumPy's <c>macosx_14_0_arm64</c> wheel, which is built against +/// Apple's Accelerate instead: CI's first macOS run of these tests (2026-11-14, NumSharp 0.81.0, NumPy 2.5.4) found +/// 54 of 240 volumes and 5 of 240 selections a last bit away from Optuna's, the products' rounding and not a port +/// error. +/// </remarks> +[TestClass] +public class HypervolumeParityTests : OptunaInteropTestBase +{ + /// <summary> + /// 240 fronts in 2 to 5 objectives: half random rows of 1 to 80 points (dominated rows and duplicates included, + /// so Optuna's own Pareto filtering and sorting run, leaving short fronts), half mutually non-dominated simplex + /// fronts of up to 80 points (long dot products, through BLAS's unrolled kernels). Every volume equals Optuna's bit + /// for bit. + /// </summary> + [TestMethod] + [TestCategory("RequiresPython")] + public void ComputeHypervolume_MatchesOptunaBitForBit_TwoToFiveObjectives() + { + // Bit-exact against NumPy's BLAS products: x64 only, where NumPy's wheel bundles NumSharp's OpenBLAS (the + // class remarks give the macOS numbers). + PythonSession.EnsureBitExactHostOrInconclusive(); + PyExec("import struct\nimport numpy as np\nfrom optuna._hypervolume import compute_hypervolume\n"); + // A seeded System.Random only generates test fronts; no sampler path reads it. + var rng = new Random(20261111); + int mismatches = 0; + string firstMismatch = ""; + for (int trial = 0; trial < 240; trial++) + { + int m = 2 + trial % 4; + int n = 1 + rng.Next(80); + double[][] loss = (trial / 4) % 2 == 0 + ? RandomRows(rng, n, m, duplicateEvery: 7) + : SimplexFront(rng, n, m, duplicateEvery: 11); + double[] reference = Enumerable.Repeat(1.1, m).ToArray(); + double hv = Hypervolume.ComputeHypervolume(loss, reference); + + PyExec($"loss = np.array({Lit(loss)}).reshape(-1, {m})\nref = np.array({Lit(reference)})\n" + + "hv_hex = struct.pack('>d', compute_hypervolume(loss, ref)).hex()\n"); + string expected = PyStr("hv_hex"); + string actual = BitConverter.DoubleToInt64Bits(hv).ToString("x16"); + if (expected != actual) + { + mismatches++; + if (firstMismatch.Length == 0) + firstMismatch = $"trial {trial}: m={m} n={n} OptunaSharp {actual} vs Optuna {expected}"; + } + } + mismatches.Should().Be(0, $"every hypervolume must be Optuna's to the last bit; first mismatch: {firstMismatch}"); + } + + /// <summary> + /// Greedy hypervolume subset selection on 240 three- and four-objective fronts: the selected indices equal + /// Optuna's, in order. Half the fronts carry duplicated rows (Optuna de-duplicates them first); the other half + /// put some points on the reference point's boundary (a coordinate equal to the reference, so their boxes have + /// zero volume) and ask for more points than have positive volume, so the greedy step must choose among + /// contributions that are zero up to the sub-ulp residual of the hypervolume differences, which only Optuna's + /// own BLAS accumulation order resolves the same way. + /// </summary> + [TestMethod] + [TestCategory("RequiresPython")] + public void SolveHssp_SelectsOptunasIndices_ThreeAndFourObjectives() + { + // The zero-contribution ties resolve by the products' last bits, so the same x64 pin as the volumes above. + PythonSession.EnsureBitExactHostOrInconclusive(); + PyExec("import numpy as np\nfrom optuna._hypervolume import _solve_hssp\n"); + var rng = new Random(424242); + int mismatches = 0; + string firstMismatch = ""; + for (int trial = 0; trial < 240; trial++) + { + int m = 3 + trial % 2; + int n = 4 + rng.Next(40); + double[] reference = Enumerable.Repeat(1.05, m).ToArray(); + double[][] front = SimplexFront(rng, n, m, duplicateEvery: 3); + int subsetSize = 1 + rng.Next(front.Length - 1); + if ((trial / 2) % 2 == 1) + { + // Append zero-volume points: one coordinate on the reference, the others a tiny simplex of total 0.01. + // The simplex points' coordinates are all at least ~0.03, so none dominates or is dominated by these, + // and the subset size reaches past the positive-volume points so some zero contribution is chosen. + int zeros = 2 + rng.Next(6); + var withZeros = front.ToList(); + for (int z = 0; z < zeros; z++) + { + var v = new double[m]; + int pinned = rng.Next(m); + double sum = 0; + for (int d = 0; d < m; d++) + if (d != pinned) + sum += v[d] = 0.1 + rng.NextDouble(); + for (int d = 0; d < m; d++) + v[d] = d == pinned ? reference[d] : v[d] / sum * 0.01; + withZeros.Add(v); + } + front = withZeros.ToArray(); + subsetSize = Math.Min(front.Length - 1, front.Length - zeros + 1 + rng.Next(zeros - 1)); + } + int[] indices = Enumerable.Range(0, front.Length).ToArray(); + int[] selected = Hypervolume.SolveHssp(front, indices, subsetSize, reference); + + PyExec($"front = np.array({Lit(front)}).reshape(-1, {m})\nref = np.array({Lit(reference)})\n" + + $"sel = _solve_hssp(front, np.arange({front.Length}), {subsetSize}, ref)\n" + + "sel_str = ','.join(str(int(i)) for i in sel)\n"); + string expected = PyStr("sel_str"); + string actual = string.Join(",", selected); + if (expected != actual) + { + mismatches++; + if (firstMismatch.Length == 0) + firstMismatch = $"trial {trial}: m={m} n={front.Length} k={subsetSize} OptunaSharp [{actual}] vs Optuna [{expected}]"; + } + } + mismatches.Should().Be(0, $"every selection must be Optuna's; first mismatch: {firstMismatch}"); + } + + /// <summary>Uniform rows in [0, 1) with every <paramref name="duplicateEvery" />-th row a copy of an earlier one.</summary> + /// <param name="rng">The seeded test-input generator.</param> + /// <param name="n">The number of rows.</param> + /// <param name="m">The number of objectives.</param> + /// <param name="duplicateEvery">The period of duplicated rows (exact copies, so Optuna's de-duplication runs).</param> + /// <returns>The rows; most are dominated, so the Pareto filter does real work.</returns> + private static double[][] RandomRows(Random rng, int n, int m, int duplicateEvery) + { + var rows = new double[n][]; + for (int i = 0; i < n; i++) + { + if (i > 0 && i % duplicateEvery == 0) + { + rows[i] = (double[])rows[rng.Next(i)].Clone(); + continue; + } + rows[i] = new double[m]; + for (int d = 0; d < m; d++) + rows[i][d] = rng.NextDouble(); + } + return rows; + } + + /// <summary> + /// A mutually non-dominated front: positive random vectors scaled to sum to one (no point on that simplex can + /// dominate another), with every <paramref name="duplicateEvery" />-th row a copy of an earlier one. + /// </summary> + /// <param name="rng">The seeded test-input generator.</param> + /// <param name="n">The number of rows before duplicates are appended.</param> + /// <param name="m">The number of objectives.</param> + /// <param name="duplicateEvery">The period of appended duplicates.</param> + /// <returns>The front, duplicates included, as HSSP receives a non-dominated rank's loss values.</returns> + private static double[][] SimplexFront(Random rng, int n, int m, int duplicateEvery) + { + var rows = new System.Collections.Generic.List<double[]>(); + for (int i = 0; i < n; i++) + { + var v = new double[m]; + double sum = 0; + for (int d = 0; d < m; d++) + { + v[d] = 0.05 + rng.NextDouble(); + sum += v[d]; + } + for (int d = 0; d < m; d++) + v[d] /= sum; + rows.Add(v); + if (i % duplicateEvery == duplicateEvery - 1) + rows.Add((double[])rows[rng.Next(rows.Count)].Clone()); + } + return rows.ToArray(); + } + + /// <summary>A Python list literal of rows, every value printed round-trip exact.</summary> + /// <param name="a">The rows.</param> + /// <returns>The literal, e.g. <c>[[0.1, 0.2], [0.3, 0.4]]</c>.</returns> + private static string Lit(double[][] a) => "[" + string.Join(", ", a.Select(Lit)) + "]"; + + /// <summary>A Python list literal of one row, every value printed round-trip exact.</summary> + /// <param name="a">The values.</param> + /// <returns>The literal, e.g. <c>[0.1, 0.2]</c>.</returns> + private static string Lit(double[] a) => "[" + string.Join(", ", a.Select(x => x.ToString("R", CultureInfo.InvariantCulture))) + "]"; +} diff --git a/test/OptunaSharp.Tests.Interop/JournalInteropTests.cs b/test/OptunaSharp.Tests.Interop/JournalInteropTests.cs index 914ea61..f76ffa1 100644 --- a/test/OptunaSharp.Tests.Interop/JournalInteropTests.cs +++ b/test/OptunaSharp.Tests.Interop/JournalInteropTests.cs @@ -179,4 +179,60 @@ public void CSharp_Writes_First_Python_Continues() Optuna.LoadStudy("cs-first", NewCSharpStorage(), sampler: new RandomSampler(4)) .Trials.Should().HaveCount(5); } + + /// <summary> + /// Plan 13, item S8: attributes C# writes in batches (a trial's user and system attributes, a study's user and + /// system attributes) are ordinary single-key journal records, so live Python Optuna replays the file without + /// tripping its <c>assert len(log["user_attr"]) == 1</c>, sees every attribute with its value, and continues the + /// study in the same file. + /// </summary> + [TestMethod] + [TestCategory("RequiresPython")] + public void CSharp_WritesAttributeBatches_Python_ReadsEveryOne() + { + PythonSession.EnsureOrInconclusive(); + + var storage = NewCSharpStorage(); + var study = Optuna.CreateStudy(storage: storage, studyName: "batches", sampler: new RandomSampler(seed: 5)); + var batch = new OptunaSharp.Collections.OrderedDict<string, object?> + { + ["seed"] = 7L, ["ratio"] = 0.25, ["name"] = "run", ["flag"] = true, ["none"] = null, + ["list"] = new System.Collections.Generic.List<object?> { 1L, "two" }, + }; + Trial trial = study.Ask(); + trial.SuggestFloat("x", 0, 1); + trial.SetUserAttrs(batch); + storage.SetTrialSystemAttrs(trial.TrialId, new OptunaSharp.Collections.OrderedDict<string, object?> { ["sys"] = "s" }); + study.SetUserAttrs(batch); + storage.SetStudySystemAttrs(study.StudyId, new OptunaSharp.Collections.OrderedDict<string, object?> { ["ssys"] = 1L }); + study.Tell(trial, 0.5); + + using (Py.GIL()) + { + using PyModule scope = Py.CreateScope(); + scope.Exec( + "import json, optuna\n" + + "optuna.logging.set_verbosity(optuna.logging.WARNING)\n" + + $"path = r'{_path}'\n" + + "storage = optuna.storages.JournalStorage(optuna.storages.journal.JournalFileBackend(" + + "path, lock_obj=optuna.storages.journal.JournalFileOpenLock(path)))\n" + + "study = optuna.load_study(study_name='batches', storage=storage)\n" + + "t0 = study.trials[0]\n" + + "trial_user = json.dumps(t0.user_attrs, sort_keys=True)\n" + + "trial_sys = json.dumps(storage.get_trial_system_attrs(t0._trial_id), sort_keys=True)\n" + + "study_user = json.dumps(study.user_attrs, sort_keys=True)\n" + + "study_sys = json.dumps(storage.get_study_system_attrs(study._study_id), sort_keys=True)\n" + + "study.optimize(lambda t: t.suggest_float('x', 0, 1), n_trials=2)\n" + + "n_trials = len(study.trials)\n"); + + string expected = "{\"flag\": true, \"list\": [1, \"two\"], \"name\": \"run\", \"none\": null, \"ratio\": 0.25, \"seed\": 7}"; + scope.Get("trial_user").As<string>().Should().Be(expected); + scope.Get("study_user").As<string>().Should().Be(expected); + scope.Get("trial_sys").As<string>().Should().Contain("\"sys\": \"s\""); + scope.Get("study_sys").As<string>().Should().Contain("\"ssys\": 1"); + scope.Get("n_trials").As<int>().Should().Be(3); + } + + Optuna.LoadStudy("batches", NewCSharpStorage()).Trials.Should().HaveCount(3); + } } diff --git a/test/OptunaSharp.Tests.Interop/JournalStateParityTests.cs b/test/OptunaSharp.Tests.Interop/JournalStateParityTests.cs index 04456ee..d1be4ba 100644 --- a/test/OptunaSharp.Tests.Interop/JournalStateParityTests.cs +++ b/test/OptunaSharp.Tests.Interop/JournalStateParityTests.cs @@ -2,6 +2,7 @@ using System.Collections.Generic; using System.IO; using System.Linq; +using AwesomeAssertions; using OptunaSharp.Samplers; using OptunaSharp.Storages.Journal; using Python.Runtime; @@ -195,6 +196,60 @@ double Objective(Trial t) StudySnapshot.AssertParity(pyState, csState, DatetimeComparison.Instant); } + // ------------------------------------------------------------------ large journals (plan 14 offset checkpoints) + + /// <summary> + /// Plan 14 gate: the file backend now keeps one offset per <c>JournalFileBackend.OffsetCheckpointInterval</c> lines + /// (4,096) plus the furthest one, where Python keeps one per line. Python writes a 40-parameter study of 250 trials + /// (over 10,000 lines, more than two checkpoint intervals); a C# storage replays it to Python's full state. Two C# + /// storages then share one backend: one stays synced at Python's end while the other writes 30 more trials, so the + /// lagging one's next sync starts behind the furthest offset (at a checkpoint, skipping forward). Every replay — + /// the lagging storage, a cold C# storage and Python's — must give the identical full state, floats and datetimes + /// included. + /// </summary> + [TestMethod] + [TestCategory("RequiresPython")] + public void LargeJournal_PythonWrites_CSharpReplaysAndContinues_SharedBackendCatchesUp_FullState() + { + PyExec( + $"storage = {PyJournalStorageExpr(_path)}\n" + + "study = optuna.create_study(study_name='big', storage=storage, " + + "sampler=optuna.samplers.RandomSampler(seed=14))\n" + + "def objective(t):\n" + + " return sum(t.suggest_float(f'x{i}', -10, 10) ** 2 for i in range(40))\n" + + "study.optimize(objective, n_trials=250)\n"); + var pyWritten = PyStudyState("study"); + File.ReadAllLines(_path).Length.Should().BeGreaterThan(2 * JournalFileBackend.OffsetCheckpointInterval); + + var shared = new JournalFileBackend(_path, lockObj: new JournalFileOpenLock(_path)); + var writer = Optuna.LoadStudy("big", new JournalStorage(shared), sampler: new RandomSampler(seed: 15)); + var lagging = Optuna.LoadStudy("big", new JournalStorage(shared), sampler: new RandomSampler(0)); + StudySnapshot.AssertParity(pyWritten, StudySnapshot.Capture(writer), DatetimeComparison.Instant); + StudySnapshot.AssertParity(pyWritten, StudySnapshot.Capture(lagging), DatetimeComparison.Instant); + + writer.Optimize(t => + { + double sum = 0; + for (int i = 0; i < 40; i++) + { + double v = t.SuggestFloat($"x{i}", -10, 10); + sum += v * v; + } + return sum; + }, nTrials: 30); + var written = StudySnapshot.Capture(writer); + written.Trials.Should().HaveCount(280); + + StudySnapshot.AssertParity(written, StudySnapshot.Capture(lagging), DatetimeComparison.Instant); + StudySnapshot.AssertParity(written, + StudySnapshot.Capture(Optuna.LoadStudy("big", NewCSharpStorage(), sampler: new RandomSampler(0))), + DatetimeComparison.Instant); + PyExec( + $"fresh_storage = {PyJournalStorageExpr(_path)}\n" + + "fresh = optuna.load_study(study_name='big', storage=fresh_storage)\n"); + StudySnapshot.AssertParity(written, PyStudyState("fresh"), DatetimeComparison.Instant); + } + // ------------------------------------------------------------------ raw line-format parity [TestMethod] diff --git a/test/OptunaSharp.Tests.Interop/NsgaiiSamplerParityTests.cs b/test/OptunaSharp.Tests.Interop/NsgaiiSamplerParityTests.cs index 437295c..f5187c1 100644 --- a/test/OptunaSharp.Tests.Interop/NsgaiiSamplerParityTests.cs +++ b/test/OptunaSharp.Tests.Interop/NsgaiiSamplerParityTests.cs @@ -224,6 +224,54 @@ public void UndxCrossover_FullState_IsBitIdentical(int seed) "study.optimize(_obj, n_trials=24)\n"); } + /// <summary> + /// UNDX over 24 float parameters stays bit-identical to Optuna across 48 trials. UNDX takes three 1-D BLAS + /// products per child (<c>np.dot(v_13, e_12)</c> and two <c>np.linalg.norm</c>, which NumPy computes as + /// <c>sqrt(x.dot(x))</c>); over three parameters a left-to-right sum happens to round like BLAS's <c>ddot</c>, over + /// 24 it does not, so this pins the products to NumSharp's <c>np.dot</c> on NumPy's OpenBLAS. + /// </summary> + /// <param name="seed">The sampler seed both sides use.</param> + [TestMethod] + [TestCategory("RequiresPython")] + [DataRow(0)] + [DataRow(7)] + public void UndxCrossover_ManyParameters_FullState_IsBitIdentical(int seed) + { + // Same host pin as the three-parameter case: LAPACK's QR signs and BLAS's ddot are NumPy's only on x64 hosts. + PythonSession.EnsureBitExactHostOrInconclusive(); + const int dims = 24; + + var csStudy = Optuna.CreateStudy( + storage: new InMemoryStorage(), studyName: "nsga", + sampler: new NSGAIISampler(populationSize: 8, seed: seed, crossover: new UNDXCrossover()), + directions: new[] { StudyDirection.Minimize, StudyDirection.Maximize }); + csStudy.Optimize(t => + { + double first = 0, second = 0; + for (int i = 0; i < dims; i++) + { + double v = t.SuggestFloat("x" + i, -5, 5); + first += v * v; + second += v; + } + return (IReadOnlyList<double>)new[] { first, second }; + }, nTrials: 48); + + AssertFullParity(csStudy, + "study = optuna.create_study(study_name='nsga', directions=['minimize', 'maximize'], " + + $"sampler=optuna.samplers.NSGAIISampler(population_size=8, seed={seed}, " + + "crossover=optuna.samplers.nsgaii.UNDXCrossover()))\n" + + "def _obj(t):\n" + + " first = 0.0\n" + + " second = 0.0\n" + + $" for i in range({dims}):\n" + + " v = t.suggest_float('x' + str(i), -5, 5)\n" + + " first += v * v\n" + + " second += v\n" + + " return (first, second)\n" + + "study.optimize(_obj, n_trials=48)\n"); + } + [TestMethod] [TestCategory("RequiresPython")] [DataRow(0)] @@ -318,4 +366,45 @@ public void ConstrainedConstraintsFunc_FullState_IsBitIdentical(int seed) " return (x * x + y * y, x - y)\n" + "study.optimize(_obj, n_trials=20)\n"); } + + /// <summary> + /// Plan 13 gate (docs/plans/13-rustuna-derived-performance.md, phase 0): the default NSGA-II over 40 float + /// parameters for 2,000 trials (40 generations of 50), the workload whose suggestions item S4 now writes in place. + /// Every trial's full state, generations and parent caches included, is bit-identical to live Optuna's. + /// </summary> + [TestMethod] + [TestCategory("RequiresPython")] + [TestCategory("Slow")] + public void LongRun_40Parameters_2000Trials_FullState_IsBitIdentical() + { + PythonSession.EnsureOrInconclusive(); + + var csStudy = Optuna.CreateStudy( + storage: new InMemoryStorage(), studyName: "nsga", sampler: new NSGAIISampler(seed: 0), + directions: new[] { StudyDirection.Minimize, StudyDirection.Minimize }); + csStudy.Optimize(t => + { + double a = 0, b = 0; + for (int i = 0; i < 40; i++) + { + double v = t.SuggestFloat($"x{i}", -10, 10); + a += v * v; + b += (v - 2) * (v - 2); + } + return new[] { a, b }; + }, nTrials: 2000); + + AssertFullParity(csStudy, + "study = optuna.create_study(study_name='nsga', directions=['minimize', 'minimize'], " + + "sampler=optuna.samplers.NSGAIISampler(seed=0))\n" + + "def _obj(t):\n" + + " a = 0.0\n" + + " b = 0.0\n" + + " for i in range(40):\n" + + " v = t.suggest_float(f'x{i}', -10, 10)\n" + + " a += v * v\n" + + " b += (v - 2) * (v - 2)\n" + + " return a, b\n" + + "study.optimize(_obj, n_trials=2000)\n"); + } } diff --git a/test/OptunaSharp.Tests.Interop/NsgaiiiSamplerParityTests.cs b/test/OptunaSharp.Tests.Interop/NsgaiiiSamplerParityTests.cs index ca16baa..612b87f 100644 --- a/test/OptunaSharp.Tests.Interop/NsgaiiiSamplerParityTests.cs +++ b/test/OptunaSharp.Tests.Interop/NsgaiiiSamplerParityTests.cs @@ -129,6 +129,66 @@ public void DefaultThreeObjective_FullState_IsBitIdentical(int seed) "study.optimize(_obj, n_trials=24)\n"); } + /// <summary> + /// The many-objective regime NSGA-III exists for: 8 and 10 minimized objectives (sums of squares around a + /// distinct centre each, polynomial only, so both languages evaluate them alike), population 20, 200 trials, + /// the default reference points (120 and 220 of them). From eight objectives on, NumPy's + /// <c>np.linalg.norm(..., axis=2)</c> in <c>_associate_individuals_with_reference_points</c> sums each row + /// pairwise; the left-to-right sum the port used until 2026-11-11 moved the reference-line distances by an ulp + /// and changed the survivors in both rows below: the trajectory left Optuna's at trial 80 (8 objectives, seed + /// 4) and at trial 100 (10 objectives, seed 0); 6 of 8 seeds at 8 objectives happened to stay identical. + /// </summary> + /// <param name="nObjectives">The number of objectives (each over <c>nObjectives + 2</c> float parameters).</param> + /// <param name="seed">The sampler seed.</param> + [TestMethod] + [TestCategory("RequiresPython")] + [DataRow(8, 4)] + [DataRow(10, 0)] + public void ManyObjectives_FullState_IsBitIdentical(int nObjectives, int seed) + { + PythonSession.EnsureOrInconclusive(); + + int nParams = nObjectives + 2; + var csStudy = Optuna.CreateStudy( + storage: new InMemoryStorage(), studyName: "nsga3", + sampler: new NSGAIIISampler(populationSize: 20, seed: seed), + directions: System.Linq.Enumerable.Repeat(StudyDirection.Minimize, nObjectives)); + csStudy.Optimize(t => + { + var x = new double[nParams]; + for (int j = 0; j < nParams; j++) + x[j] = t.SuggestFloat($"x{j:D2}", 0.0, 1.0); + var f = new double[nObjectives]; + for (int m = 0; m < nObjectives; m++) + { + double s = 0.0; + for (int j = 0; j < nParams; j++) + { + double d = x[j] - ((m * 7 + j * 3) % 10) / 10.0; + s += d * d; + } + f[m] = s; + } + return (IReadOnlyList<double>)f; + }, nTrials: 200); + + AssertFullParity(csStudy, + "study = optuna.create_study(study_name='nsga3', " + + $"directions=['minimize'] * {nObjectives}, " + + $"sampler=optuna.samplers.NSGAIIISampler(population_size=20, seed={seed}))\n" + + "def _obj(t):\n" + + $" x = [t.suggest_float(f'x{{j:02d}}', 0.0, 1.0) for j in range({nParams})]\n" + + " f = []\n" + + $" for m in range({nObjectives}):\n" + + " s = 0.0\n" + + $" for j in range({nParams}):\n" + + " d = x[j] - ((m * 7 + j * 3) % 10) / 10.0\n" + + " s += d * d\n" + + " f.append(s)\n" + + " return f\n" + + "study.optimize(_obj, n_trials=200)\n"); + } + [TestMethod] [TestCategory("RequiresPython")] [DataRow("uniform", 1)] diff --git a/test/OptunaSharp.Tests.Interop/OptunaHubBridgeParityTests.cs b/test/OptunaSharp.Tests.Interop/OptunaHubBridgeParityTests.cs index f73de1e..17c85a8 100644 --- a/test/OptunaSharp.Tests.Interop/OptunaHubBridgeParityTests.cs +++ b/test/OptunaSharp.Tests.Interop/OptunaHubBridgeParityTests.cs @@ -42,7 +42,10 @@ public void BenchmarkBridge_ToyProblem_ExposesSpaceAndOptimizes() Assert.IsInstanceOfType(problem.SearchSpace["n"], typeof(IntDistribution)); Assert.IsInstanceOfType(problem.SearchSpace["c"], typeof(CategoricalDistribution)); - var study = Optuna.CreateStudy(directions: problem.Directions); + // Seeded: an unseeded TPE study draws its seed from OS entropy, and 40 trials then end above the bound + // below in a few percent of runs (one did on 2026-11-09, best 1.018; eight reruns passed). The test is about + // the bridge, not TPE's luck, so the sampler is seeded and the outcome fixed. + var study = Optuna.CreateStudy(directions: problem.Directions, sampler: new OptunaSharp.Samplers.TPESampler(seed: 0)); study.Optimize(problem.SingleObjective, nTrials: 40); Assert.AreEqual(40, study.Trials.Count); diff --git a/test/OptunaSharp.Tests.Interop/OptunaHubNativeParityTests.cs b/test/OptunaSharp.Tests.Interop/OptunaHubNativeParityTests.cs new file mode 100644 index 0000000..9ab4f6a --- /dev/null +++ b/test/OptunaSharp.Tests.Interop/OptunaHubNativeParityTests.cs @@ -0,0 +1,365 @@ +using System; +using System.Collections.Generic; +using System.Globalization; +using System.IO; +using System.Linq; +using System.Runtime.CompilerServices; +using System.Text.Json; +using AwesomeAssertions; +using OptunaSharp; +using OptunaSharp.Interop.PythonNet; +using OptunaSharp.Samplers; +using Python.Runtime; + +namespace OptunaSharp.Tests.Interop; + +/// <summary> +/// Registry samplers and pruners through the OptunaHub bridges against the same objects run natively, trial for +/// trial: the comparison that found QA-72 and QA-73 (<c>docs/qa/PARITY_QA_2026-11-10.md</c>), kept as a gate for the +/// persistent shadow study (<c>OptunaHubShadow</c>, 2026-11-12). +/// </summary> +/// <remarks> +/// <para> +/// Both sides run in the one embedded interpreter, against the pinned <c>refs/optunahub-registry</c>, with a +/// seeded sampler and the study name <c>hub-parity</c> on both (some hub objects derive state from the name: +/// <c>HyperbandPruner</c>'s brackets do). The native side is a plain Python study; the OptunaSharp side drives +/// the same class through <see cref="OptunaHubSampler" /> or <see cref="OptunaHubPruner" /> (with the port's +/// bit-exact <see cref="RandomSampler" /> under a pruner). Every trial's state, parameters (bit for bit) and +/// reported steps must agree. +/// </para> +/// <para> +/// The samplers cover what the QA run found broken (PSO builds its swarm in <c>after_trial</c>; MO-CMA, the +/// NSGA-II variants and the implicit natural gradient keep generations in system attributes) and what it found +/// unaffected; the pruners cover the stateful successive halving and Hyperband and the stateless rest. A package +/// whose imports fail (a missing optional dependency) self-skips, like the other RequiresPython tests. +/// </para> +/// </remarks> +[TestClass] +public class OptunaHubNativeParityTests +{ + /// <summary>The study name both sides use.</summary> + private const string StudyName = "hub-parity"; + + /// <summary>The objective both sides run: two floats and an int, one or two values.</summary> + private const string PythonObjective = """ + def objective(trial): + x = trial.suggest_float("x", -1.0, 1.0) + y = trial.suggest_float("y", 0.0, 2.0) + n = trial.suggest_int("n", 0, 5) + first = (x - 0.3) ** 2 + (y - 0.4) ** 2 + 0.1 * n + second = (x + 0.5) ** 2 + (y - 1.5) ** 2 + 0.05 * (5 - n) + return first if objectives == 1 else (first, second) + """; + + /// <summary>The pruning objective both sides run: one float, ten reported steps, the pruner asked after each.</summary> + private const string PythonReportingObjective = """ + def objective(trial): + x = trial.suggest_float("x", -1.0, 1.0) + value = 0.0 + for step in range(10): + value = (x - 0.3) ** 2 + 1.0 / (step + 1) + trial.report(value, step) + if trial.should_prune(): + raise optuna.TrialPruned() + return value + """; + + /// <summary>A registry sampler, seeded, through the bridge and natively: the same trials.</summary> + /// <param name="package">The registry package.</param> + /// <param name="className">The sampler class it exports.</param> + /// <param name="objectives">1 or 2.</param> + /// <param name="nTrials">Trials per side.</param> + /// <param name="populationSize">A <c>population_size</c> kwarg, or 0 for none.</param> + [TestMethod] + [TestCategory("RequiresPython")] + [DataRow("samplers/pso", "PSOSampler", 1, 30, 0)] + [DataRow("samplers/mocma", "MoCmaSampler", 2, 30, 0)] + [DataRow("samplers/nsgaii_with_initial_trials", "NSGAIIwITSampler", 2, 30, 8)] + [DataRow("samplers/speaii", "SPEAIISampler", 2, 30, 8)] + [DataRow("samplers/implicit_natural_gradient", "ImplicitNaturalGradientSampler", 1, 30, 0)] + [DataRow("samplers/differential_evolution", "DESampler", 1, 30, 0)] + [DataRow("samplers/restart_cmaes", "RestartCmaEsSampler", 1, 30, 0)] + [DataRow("samplers/levy_flight_sampler", "LevyFlightSampler", 1, 30, 0)] + [DataRow("samplers/nelder_mead", "NelderMeadSampler", 1, 30, 0)] + [DataRow("samplers/tpe_union_multivariate", "TPEUnionMultivariateSampler", 1, 30, 0)] + [DataRow("samplers/random_search", "RandomSampler", 1, 30, 0)] + public void Sampler_ThroughTheBridge_MatchesNativePython( + string package, string className, int objectives, int nTrials, int populationSize) + => CompareSampler(package, className, objectives, nTrials, populationSize); + + /// <summary> + /// The Optuna team's <c>AutoSampler</c> (<c>samplers/auto_sampler</c>), which differed from trial 1 through the + /// rebuilt shadow (QA-72): the same trials as natively. It switches to Optuna's GP sampler, so 30 trials take about + /// 20 seconds a side; slow category. + /// </summary> + [TestMethod] + [TestCategory("RequiresPython")] + [TestCategory("Slow")] + public void AutoSampler_ThroughTheBridge_MatchesNativePython() + => CompareSampler("samplers/auto_sampler", "AutoSampler", objectives: 1, nTrials: 30, populationSize: 0); + + /// <summary>Runs a registry sampler natively and through the bridge, then compares every trial.</summary> + /// <param name="package">The registry package.</param> + /// <param name="className">The sampler class it exports.</param> + /// <param name="objectives">1 or 2.</param> + /// <param name="nTrials">Trials per side.</param> + /// <param name="populationSize">A <c>population_size</c> kwarg, or 0 for none.</param> + private static void CompareSampler(string package, string className, int objectives, int nTrials, int populationSize) + { + string registry = RegistryOrInconclusive(package); + var kwargs = new Dictionary<string, object?> { ["seed"] = 0 }; + if (populationSize > 0) + kwargs["population_size"] = populationSize; + + string native = RunNativeOrInconclusive(package, registry, className, kwargs, objectives, nTrials, sampler: true); + + using var module = OptunaHub.LoadLocalModule(package, registry); + using var sampler = module.CreateSampler(className, kwargs); + var directions = Enumerable.Repeat(StudyDirection.Minimize, objectives).ToArray(); + var study = Optuna.CreateStudy(studyName: StudyName, sampler: sampler, directions: directions); + study.Optimize(t => + { + double x = t.SuggestFloat("x", -1.0, 1.0); + double y = t.SuggestFloat("y", 0.0, 2.0); + long n = t.SuggestInt("n", 0, 5); + double first = Math.Pow(x - 0.3, 2) + Math.Pow(y - 0.4, 2) + 0.1 * n; + double second = Math.Pow(x + 0.5, 2) + Math.Pow(y - 1.5, 2) + 0.05 * (5 - n); + return objectives == 1 ? new[] { first } : new[] { first, second }; + }, nTrials: nTrials); + + ShouldMatch(native, study.Trials, new[] { "x", "y", "n" }); + } + + /// <summary>A registry pruner through the bridge and natively, under the same seeded random sampler: the same trials.</summary> + /// <param name="package">The registry package.</param> + /// <param name="className">The pruner class it exports.</param> + /// <param name="kwargName">One constructor kwarg's name, or empty for the defaults.</param> + /// <param name="kwargValue">That kwarg's value.</param> + /// <exception cref="TrialPruned"> + /// Thrown inside the objective when the bridged pruner prunes a trial; <c>Optimize</c> records the trial as pruned, + /// so it never leaves the test. + /// </exception> + [TestMethod] + [TestCategory("RequiresPython")] + [DataRow("pruners/successive_halving", "SuccessiveHalvingPruner", "", 0.0)] + [DataRow("pruners/hyperband", "HyperbandPruner", "", 0.0)] + [DataRow("pruners/median", "MedianPruner", "", 0.0)] + [DataRow("pruners/percentile", "PercentilePruner", "percentile", 25.0)] + [DataRow("pruners/wilcoxon", "WilcoxonPruner", "", 0.0)] + [DataRow("pruners/threshold", "ThresholdPruner", "upper", 1.2)] + public void Pruner_ThroughTheBridge_MatchesNativePython( + string package, string className, string kwargName, double kwargValue) + { + string registry = RegistryOrInconclusive(package); + var kwargs = new Dictionary<string, object?>(); + if (kwargName.Length > 0) + kwargs[kwargName] = kwargValue; + + string native = RunNativeOrInconclusive(package, registry, className, kwargs, objectives: 1, nTrials: 40, + sampler: false); + + using var module = OptunaHub.LoadLocalModule(package, registry); + using var pruner = module.CreatePruner(className, kwargs); + var study = Optuna.CreateStudy(studyName: StudyName, sampler: new RandomSampler(seed: 0), pruner: pruner); + study.Optimize(t => + { + double x = t.SuggestFloat("x", -1.0, 1.0); + double value = 0.0; + for (int step = 0; step < 10; step++) + { + value = Math.Pow(x - 0.3, 2) + 1.0 / (step + 1); + t.Report(value, step); + if (t.ShouldPrune()) + throw new TrialPruned(); + } + return value; + }, nTrials: 40); + + ShouldMatch(native, study.Trials, new[] { "x" }); + } + + /// <summary> + /// Runs the package natively and returns its trials as JSON: <c>[state, {param: value}, [reported steps]]</c> each, + /// floats as <c>float.hex</c> so the comparison is bit for bit. + /// </summary> + /// <param name="package">The registry package.</param> + /// <param name="registry">The registry root.</param> + /// <param name="className">The class to instantiate.</param> + /// <param name="kwargs">Its constructor kwargs (scalars).</param> + /// <param name="objectives">1 or 2.</param> + /// <param name="nTrials">Trials to run.</param> + /// <param name="sampler">Whether the class is a sampler (else a pruner under <c>RandomSampler(seed=0)</c>).</param> + /// <returns>The JSON text.</returns> + /// <exception cref="PythonException">The native run fails.</exception> + private static string RunNative(string package, string registry, string className, + IReadOnlyDictionary<string, object?> kwargs, int objectives, int nTrials, bool sampler) + { + string kwargText = string.Join(", ", kwargs.Select(kv => $"{kv.Key}={PythonLiteral(kv.Value)}")); + string code = $$""" + import json + import optuna + import optunahub + optuna.logging.set_verbosity(optuna.logging.WARNING) + module = optunahub.load_local_module(package, registry_root=registry) + obj = getattr(module, class_name)({{kwargText}}) + objectives = {{objectives}} + {{(sampler ? PythonObjective : PythonReportingObjective)}} + if sampler: + study = optuna.create_study(study_name="{{StudyName}}", sampler=obj, directions=["minimize"] * objectives) + else: + study = optuna.create_study(study_name="{{StudyName}}", sampler=optuna.samplers.RandomSampler(seed=0), + pruner=obj) + study.optimize(objective, n_trials={{nTrials}}) + def enc(v): + return float(v).hex() if isinstance(v, float) else v + result = json.dumps([[t.state.name, {k: enc(v) for k, v in t.params.items()}, sorted(t.intermediate_values)] + for t in study.trials]) + """; + return PythonRuntime.Run(() => + { + using PyModule scope = Py.CreateScope(); + using (var p = package.ToPython()) scope.Set("package", p); + using (var r = registry.ToPython()) scope.Set("registry", r); + using (var c = className.ToPython()) scope.Set("class_name", c); + using (var s = sampler.ToPython()) scope.Set("sampler", s); + scope.Exec(code); + return scope.Get<string>("result"); + }); + } + + /// <summary> + /// <see cref="RunNative" />, reporting Inconclusive when the package needs an optional dependency this interpreter + /// lacks: several import theirs lazily (restart CMA-ES needs <c>cmaes</c>, the Wilcoxon pruner <c>scipy</c>, + /// <c>AutoSampler</c> <c>torch</c>), so the import check of <see cref="RegistryOrInconclusive" /> passes and the + /// run fails. + /// </summary> + /// <param name="package">The registry package.</param> + /// <param name="registry">The registry root.</param> + /// <param name="className">The class to instantiate.</param> + /// <param name="kwargs">Its constructor kwargs (scalars).</param> + /// <param name="objectives">1 or 2.</param> + /// <param name="nTrials">Trials to run.</param> + /// <param name="sampler">Whether the class is a sampler (else a pruner).</param> + /// <returns>The native trials' JSON.</returns> + /// <exception cref="PythonException">The native run fails for another reason than a missing module.</exception> + private static string RunNativeOrInconclusive(string package, string registry, string className, + IReadOnlyDictionary<string, object?> kwargs, int objectives, int nTrials, bool sampler) + { + try + { + return RunNative(package, registry, className, kwargs, objectives, nTrials, sampler); + } + catch (PythonException ex) when (ex.Type.Name is "ModuleNotFoundError" or "ImportError") + { + Assert.Inconclusive($"{package} needs a module this interpreter lacks: {ex.Message}"); + throw; // unreachable: Inconclusive throws + } + } + + /// <summary>A scalar kwarg as Python source.</summary> + /// <param name="value">An int, long or double.</param> + /// <returns>Its Python literal.</returns> + /// <exception cref="ArgumentException">Another type.</exception> + private static string PythonLiteral(object? value) => value switch + { + int or long => Convert.ToString(value, CultureInfo.InvariantCulture)!, + double d => d.ToString("R", CultureInfo.InvariantCulture), + _ => throw new ArgumentException($"Unsupported kwarg value {value}.", nameof(value)), + }; + + /// <summary> + /// Compares the native trials with the bridge's: the first trial that differs fails the test, showing both. + /// </summary> + /// <param name="nativeJson">The native trials (see <see cref="RunNative" />).</param> + /// <param name="trials">The OptunaSharp study's trials.</param> + /// <param name="paramNames">The parameters to compare.</param> + private static void ShouldMatch(string nativeJson, IReadOnlyList<FrozenTrial> trials, string[] paramNames) + { + using JsonDocument doc = JsonDocument.Parse(nativeJson); + JsonElement[] native = doc.RootElement.EnumerateArray().ToArray(); + trials.Should().HaveCount(native.Length); + for (int i = 0; i < native.Length; i++) + { + string expected = Describe(native[i], paramNames); + string actual = Describe(trials[i], paramNames); + actual.Should().Be(expected, $"trial {i} (native first, then the bridge's)"); + } + } + + /// <summary>One native trial as text: state, parameters (floats as hex), reported steps.</summary> + /// <param name="trial">The native trial's JSON.</param> + /// <param name="paramNames">The parameters to show.</param> + /// <returns>The description.</returns> + private static string Describe(JsonElement trial, string[] paramNames) + { + string state = trial[0].GetString()!; + JsonElement ps = trial[1]; + var parts = paramNames.Select(name => ps.TryGetProperty(name, out JsonElement v) + ? $"{name}={(v.ValueKind == JsonValueKind.String ? v.GetString() : v.GetRawText())}" + : $"{name}=-"); + string steps = string.Join(",", trial[2].EnumerateArray().Select(e => e.GetRawText())); + return $"{state} {string.Join(" ", parts)} steps=[{steps}]"; + } + + /// <summary>One OptunaSharp trial in <see cref="Describe(JsonElement, string[])" />'s format.</summary> + /// <param name="trial">The trial.</param> + /// <param name="paramNames">The parameters to show.</param> + /// <returns>The description.</returns> + private static string Describe(FrozenTrial trial, string[] paramNames) + { + string state = trial.State.ToString().ToUpperInvariant(); + var parts = paramNames.Select(name => trial.Params.TryGetValue(name, out object? v) + ? $"{name}={(v is double d ? Hex(d) : Convert.ToString(v, CultureInfo.InvariantCulture))}" + : $"{name}=-"); + string steps = string.Join(",", trial.IntermediateValues.Keys.OrderBy(k => k)); + return $"{state} {string.Join(" ", parts)} steps=[{steps}]"; + } + + /// <summary>Python's <c>float.hex()</c> of a double, for a bit-exact text comparison.</summary> + /// <param name="value">The double.</param> + /// <returns>The hex text, e.g. <c>0x1.0000000000000p+0</c>.</returns> + private static string Hex(double value) + => PythonRuntime.Run(() => + { + using PyObject f = value.ToPython(); + using PyObject hex = f.InvokeMethod("hex"); + return hex.As<string>(); + }); + + /// <summary> + /// The pinned registry root, after checking Python, OptunaHub and the package's own imports, or Inconclusive. + /// </summary> + /// <param name="package">The registry package the test loads.</param> + /// <returns>The registry root.</returns> + private static string RegistryOrInconclusive(string package) + { + PythonSession.EnsureOrInconclusive(); + string registry = Path.Combine(RepoRoot(), "refs", "optunahub-registry", "package"); + if (!Directory.Exists(Path.Combine(registry, package))) + Assert.Inconclusive("refs/optunahub-registry submodule not initialized " + + "(`git submodule update --init refs/optunahub-registry`)."); + try + { + PythonRuntime.Run(() => + { + using PyObject optunahub = Py.Import("optunahub"); + using PyObject load = optunahub.GetAttr("load_local_module"); + using var kwargs = new PyDict(); + using (var r = registry.ToPython()) kwargs["registry_root"] = r; + using var p = package.ToPython(); + using PyObject _ = load.Invoke(new[] { p }, kwargs); + }); + } + catch (Exception ex) + { + Assert.Inconclusive($"{package} does not import here (an optional dependency is missing?): {ex.Message}"); + } + return registry; + } + + /// <summary>Returns the repository root, two levels above this source file.</summary> + /// <param name="thisFile">Filled in by the compiler with this file's path.</param> + /// <returns>The absolute repository root.</returns> + private static string RepoRoot([CallerFilePath] string? thisFile = null) + => Path.GetFullPath(Path.Combine(Path.GetDirectoryName(thisFile)!, "..", "..")); +} diff --git a/test/OptunaSharp.Tests.Interop/PythonSession.cs b/test/OptunaSharp.Tests.Interop/PythonSession.cs index 490e527..5f08f45 100644 --- a/test/OptunaSharp.Tests.Interop/PythonSession.cs +++ b/test/OptunaSharp.Tests.Interop/PythonSession.cs @@ -72,6 +72,15 @@ public static void Start(TestContext _) scope.Exec("import os\nos.environ.setdefault('NPY_DISABLE_CPU_FEATURES', _npy_disabled)\n"); } + // pymoo 0.6.1.3, the oracle the native AGE-MOEA-2 reproduces generation by generation and the version the + // pymoo bridge tests pin, calls np.row_stack (NSGA-II's crowding distance), which NumPy 2.5 removed; the + // oracle NumPy is 2.5.4 since NumSharp 0.81.0 bundles its OpenBLAS. NumPy 2.0-2.4 defined row_stack as an + // alias of vstack, so restoring that alias changes no result (pymoo 0.6.2 no longer calls it, but it also + // changed AGE-MOEA-2's arithmetic, so it cannot be the oracle). Test environment only: the product's + // pythonnet runtime leaves the user's NumPy untouched. + using (PyModule scope = Py.CreateScope()) + scope.Exec("import numpy\nif not hasattr(numpy, 'row_stack'):\n numpy.row_stack = numpy.vstack\n"); + using PyObject optuna = Py.Import("optuna"); OptunaVersion = optuna.GetAttr("__version__").ToString(); } diff --git a/test/OptunaSharp.Tests.Interop/QmcSamplerParityTests.cs b/test/OptunaSharp.Tests.Interop/QmcSamplerParityTests.cs index b6d192a..1ec1bf2 100644 --- a/test/OptunaSharp.Tests.Interop/QmcSamplerParityTests.cs +++ b/test/OptunaSharp.Tests.Interop/QmcSamplerParityTests.cs @@ -225,4 +225,51 @@ public void ScrambledHalton_ManyDims_FullState_IsBitIdentical() " return v\n" + "study.optimize(_obj, n_trials=20)\n"); } + + /// <summary> + /// Plan 14 gate: QMC now computes its <c>qmc:<sha256></c> sample-id key once per search space and reuses it while + /// the same distribution objects come back. A 40-parameter study (float, log-float, int and categorical) over 300 + /// trials, for each engine and scrambling, must keep the whole state, the counter in the study system attrs + /// included, bit-identical to live Optuna. + /// </summary> + /// <param name="qmcType">The engine: <c>sobol</c> or <c>halton</c>.</param> + /// <param name="scramble">Whether the engine is scrambled (the seed then enters the key).</param> + [TestMethod] + [TestCategory("RequiresPython")] + [DataRow("sobol", false)] + [DataRow("halton", false)] + [DataRow("sobol", true)] + [DataRow("halton", true)] + public void LongRun_40Parameters_300Trials_FullState_IsBitIdentical(string qmcType, bool scramble) + { + PythonSession.EnsureOrInconclusive(); + + var csStudy = Optuna.CreateStudy( + storage: new InMemoryStorage(), studyName: "qmc", + sampler: new QMCSampler(qmcType: qmcType, scramble: scramble, seed: 11)); + csStudy.Optimize(t => + { + double v = 0; + for (int i = 0; i < 37; i++) + v += t.SuggestFloat($"x{i}", -1, 1); + v += Math.Log(t.SuggestFloat("lx", 1e-3, 1e3, log: true)); + v += t.SuggestInt("n", -5, 5); + v += t.SuggestCategorical("c", new[] { "a", "b", "cc" }).Length; + return v; + }, nTrials: 300); + + AssertFullParity(csStudy, + "import math\n" + + "study = optuna.create_study(study_name='qmc', " + + $"sampler=optuna.samplers.QMCSampler(qmc_type='{qmcType}', scramble={(scramble ? "True" : "False")}, seed=11))\n" + + "def _obj(t):\n" + + " v = 0.0\n" + + " for i in range(37):\n" + + " v += t.suggest_float(f'x{i}', -1, 1)\n" + + " v += math.log(t.suggest_float('lx', 1e-3, 1e3, log=True))\n" + + " v += t.suggest_int('n', -5, 5)\n" + + " v += len(t.suggest_categorical('c', ['a', 'b', 'cc']))\n" + + " return v\n" + + "study.optimize(_obj, n_trials=300)\n"); + } } diff --git a/test/OptunaSharp.Tests.Interop/RandomSamplerParityTests.cs b/test/OptunaSharp.Tests.Interop/RandomSamplerParityTests.cs index d60fd87..4f81497 100644 --- a/test/OptunaSharp.Tests.Interop/RandomSamplerParityTests.cs +++ b/test/OptunaSharp.Tests.Interop/RandomSamplerParityTests.cs @@ -105,6 +105,97 @@ public void MixedSearchSpace_IsBitIdentical_ToLiveOptuna(int seed) } } + /// <summary> + /// Plan 14: <see cref="RandomSampler" /> now draws the transform's bound rows one at a time through + /// <c>NumPyDraws.Uniform</c> instead of NumPy's array form (and creates no NumSharp arrays). This pins a long run over + /// every distribution kind to live Optuna: one-hot categoricals with two choices and with five choices of mixed types + /// (str, int, float, None), a log int spanning 1..2^40, a stepped int with negative bounds and a float spanning + /// ±1e300, 300 trials per seed, every value compared through Python's <c>repr</c> (exact for floats). + /// </summary> + /// <param name="seed">The seed both samplers start from.</param> + [TestMethod] + [TestCategory("RequiresPython")] + [DataRow(0)] + [DataRow(31337)] + public void LongRun_AllDistributionKinds_IsBitIdentical_ToLiveOptuna(int seed) + { + PythonSession.EnsureBitExactHostOrInconclusive(); + const int nTrials = 300; + string[] names = { "a", "b", "c", "d", "e", "f", "g", "h", "w" }; + + var study = Optuna.CreateStudy(sampler: new RandomSampler(seed)); + study.Optimize(t => + { + double a = t.SuggestFloat("a", -10, 10); + t.SuggestFloat("b", 1e-5, 1e-1, log: true); + t.SuggestFloat("c", 0.1, 0.9, step: 0.2); + t.SuggestInt("d", 1, 100); + t.SuggestInt("e", 1, 1L << 40, log: true); + t.SuggestInt("f", -20, 20, step: 5); + t.SuggestCategorical("g", new[] { true, false }); + t.SuggestCategorical("h", new OptunaSharp.Distributions.CategoricalChoice[] + { "x", 1L, 2.5, OptunaSharp.Distributions.CategoricalChoice.None, "y" }); + t.SuggestFloat("w", -1e300, 1e300); + return a; + }, nTrials: nTrials); + var csharp = study.Trials + .Select(t => string.Join(" ", names.Select(n => ReprOf(t.Params[n])))) + .ToList(); + + var python = new List<string>(); + using (Py.GIL()) + { + using PyModule scope = Py.CreateScope(); + scope.Exec( + "import optuna\n" + + "optuna.logging.set_verbosity(optuna.logging.WARNING)\n" + + "def objective(t):\n" + + " a = t.suggest_float('a', -10, 10)\n" + + " t.suggest_float('b', 1e-5, 1e-1, log=True)\n" + + " t.suggest_float('c', 0.1, 0.9, step=0.2)\n" + + " t.suggest_int('d', 1, 100)\n" + + " t.suggest_int('e', 1, 2**40, log=True)\n" + + " t.suggest_int('f', -20, 20, step=5)\n" + + " t.suggest_categorical('g', [True, False])\n" + + " t.suggest_categorical('h', ['x', 1, 2.5, None, 'y'])\n" + + " t.suggest_float('w', -1e300, 1e300)\n" + + " return a\n" + + $"study = optuna.create_study(sampler=optuna.samplers.RandomSampler(seed={seed}))\n" + + $"study.optimize(objective, n_trials={nTrials})\n" + + $"rows = [' '.join(repr(t.params[n]) for n in {PyList(names)}) for t in study.trials]\n"); + using var rows = scope.Get("rows"); + long count = rows.Length(); + for (int i = 0; i < count; i++) + { + using var row = rows[i]; + python.Add(row.As<string>()); + } + } + + python.Should().HaveCount(nTrials); + for (int i = 0; i < nTrials; i++) + csharp[i].Should().Be(python[i], $"seed {seed} trial {i} (a b c d e f g h w)"); + } + + /// <summary>Python's <c>repr</c> of a suggested external value, for the value kinds the long run suggests.</summary> + /// <param name="value">A trial's external parameter value.</param> + /// <returns>The text Python's <c>repr</c> prints for the same value.</returns> + /// <exception cref="NotSupportedException">The value is of a kind the long run never suggests.</exception> + private static string ReprOf(object? value) => value switch + { + null => "None", + bool b => b ? "True" : "False", + long l => l.ToString(System.Globalization.CultureInfo.InvariantCulture), + double d => OptunaSharp.Internal.PythonRepr.FloatRepr(d), + string s => "'" + s + "'", + _ => throw new NotSupportedException(value.GetType().Name), + }; + + /// <summary>A Python list literal of the given names, for embedding in a script.</summary> + /// <param name="names">Parameter names without quotes or backslashes.</param> + /// <returns>The list literal, for example <c>['a', 'b']</c>.</returns> + private static string PyList(IEnumerable<string> names) => "[" + string.Join(", ", names.Select(n => "'" + n + "'")) + "]"; + [TestMethod] [TestCategory("RequiresPython")] public void DistributionJson_IsByteIdentical_ToLiveOptuna() diff --git a/test/OptunaSharp.Tests.Interop/Run2OptunaHubBridgeParityBugTests.cs b/test/OptunaSharp.Tests.Interop/Run2OptunaHubBridgeParityBugTests.cs new file mode 100644 index 0000000..aaa59c6 --- /dev/null +++ b/test/OptunaSharp.Tests.Interop/Run2OptunaHubBridgeParityBugTests.cs @@ -0,0 +1,191 @@ +using System; +using System.Collections.Generic; +using System.IO; +using System.Linq; +using System.Runtime.CompilerServices; +using AwesomeAssertions; +using OptunaSharp; +using OptunaSharp.Interop.PythonNet; +using Python.Runtime; + +namespace OptunaSharp.Tests.Interop; + +/// <summary> +/// Parity bugs in the OptunaHub sampler bridge (<see cref="OptunaHubSampler" />) found by the 2026-11-10 parity QA +/// run (<c>docs/qa/PARITY_QA_2026-11-10.md</c>, QA-72), and the same defect in <see cref="OptunaHubPruner" /> +/// (QA-73). Fixed on 2026-11-12 by the persistent shadow study (<c>OptunaHubShadow</c>); each test compares the +/// bridge with the values native Python produces. +/// </summary> +/// <remarks> +/// They need Python with Optuna and OptunaHub and the pinned <c>refs/optunahub-registry</c> submodule, and +/// self-skip without them like the other live tests. While they were open bugs a CI guard reported them +/// Inconclusive (the interop job filters only <c>TestCategory!=Slow</c>); it is gone with the fix. +/// </remarks> +[TestClass] +public class Run2OptunaHubBridgeParityBugTests +{ + /// <summary> + /// QA-72: OptunaHub's <c>PSOSampler</c> (<c>samplers/pso</c>) does all of its swarm work in <c>after_trial</c> — + /// it collects each generation's completed trials there, builds and steps the swarm, and queues the next + /// generation for <c>sample_relative</c>. <see cref="OptunaHubSampler" /> never forwards <c>after_trial</c> (nor + /// <c>before_trial</c>) to the Python sampler, so through the bridge the swarm is never built and every trial + /// stays in PSO's random phase. + /// </summary> + /// <remarks> + /// Measured with Optuna 5.0.0 and OptunaHub 0.4.1 on the pinned registry: run natively, + /// <c>PSOSampler(seed=0)</c> on this objective serves its first swarm candidate at trial 11 + /// (<c>x = 0.5201450987386327, y = 1.0528363508210972, n = 3</c>), reproducibly; through the bridge trial 11 is + /// another random draw, and all trials from 11 on differ. The other half of the gap is QA-72's second test. + /// <b>Fixed 2026-11-12:</b> the bridge keeps a persistent shadow study (<c>OptunaHubShadow</c>) and forwards + /// <c>before_trial</c> / <c>after_trial</c>; trial 11 is the native swarm candidate, bit for bit. + /// </remarks> + [TestMethod] + [TestCategory("RequiresPython")] + public void PsoThroughBridge_BuildsItsSwarmInAfterTrialLikeNativePython() + { + using var module = LoadHubModuleOrInconclusive("samplers/pso"); + using var sampler = module.CreateSampler("PSOSampler", new() { ["seed"] = 0 }); + + var study = Optuna.CreateStudy(sampler: sampler); + study.Optimize(t => Objective(t)[0], nTrials: 12); + + var eleventh = study.Trials[11].Params; + // Native Python: optunahub.load_local_module("samplers/pso", registry).PSOSampler(seed=0), the same objective. + ((double)eleventh["x"]!).Should().Be(0.5201450987386327); + ((double)eleventh["y"]!).Should().Be(1.0528363508210972); + Convert.ToInt64(eleventh["n"]).Should().Be(3); + } + + /// <summary> + /// QA-72: the bridge's shadow study mirrors each finished trial as <c>create_trial(state, values, params, + /// distributions)</c> only and is rebuilt for every trial, so the trial system attributes a hub sampler writes in + /// <c>sample_relative</c> are lost, and the C# trials' user / system attributes, intermediate values and + /// constraints never reach it. OptunaHub's <c>MoCmaSampler</c> (<c>samplers/mocma</c>) stores its generation in + /// <c>trial.system_attrs["mocma:g"]</c> and reads it back from the completed trials, so through the bridge it fails + /// with <c>KeyError: 'mocma:g'</c>, where the native run completes all 30 trials. + /// </summary> + /// <remarks> + /// The same loss changes the trajectories of the NSGA-II-based hub samplers (<c>nsgaii_with_initial_trials</c>, + /// <c>speaii</c>: from the first generation boundary, trial 8 with <c>population_size=8</c>) and of + /// <c>implicit_natural_gradient</c> (from trial 7), and the Optuna team's <c>AutoSampler</c> + /// (<c>samplers/auto_sampler</c>) differs from trial 1, all reproducible natively. Unaffected in the same comparison: + /// <c>differential_evolution</c>, <c>restart_cmaes</c>, <c>levy_flight_sampler</c>, <c>nelder_mead</c>, + /// <c>tpe_union_multivariate</c>, <c>random_search</c>. In the registry 26 samplers implement <c>after_trial</c> + /// and 25 read or write system attributes. + /// <b>Fixed 2026-11-12:</b> the shadow keeps every trial's system attributes, and those the sampler writes + /// (<c>mocma:g</c>) are written to the OptunaSharp trials too; the 30 trials complete. + /// </remarks> + [TestMethod] + [TestCategory("RequiresPython")] + public void MoCmaThroughBridge_KeepsTheSystemAttributesItWrites() + { + using var module = LoadHubModuleOrInconclusive("samplers/mocma"); + using var sampler = module.CreateSampler("MoCmaSampler", new() { ["seed"] = 0 }); + + var study = Optuna.CreateStudy(sampler: sampler, + directions: new[] { StudyDirection.Minimize, StudyDirection.Minimize }); + Action optimize = () => study.Optimize(Objective, nTrials: 30); + + optimize.Should().NotThrow("the native MoCmaSampler(seed=0) completes the 30 trials"); + study.Trials.Count(t => t.State == TrialState.Complete).Should().Be(30); + } + + /// <summary> + /// QA-73: OptunaHub's <c>pruners/successive_halving</c> re-exports Optuna's own <c>SuccessiveHalvingPruner</c>, + /// which records each rung a trial passes in that trial's system attributes (<c>completed_rung_N</c>) and compares + /// a trial with the other trials' values in the same rung. <see cref="OptunaHubPruner" /> rebuilds its shadow study + /// for every <c>prune</c> call from <c>create_trial(state, values, params, distributions, intermediate_values)</c>, + /// so the rung records of earlier calls and of other trials are gone; each trial then competes only with itself, + /// is always promotable, and nothing is ever pruned. + /// </summary> + /// <remarks> + /// Measured: natively (Optuna 5.0.0, <c>RandomSampler(seed=0)</c>, 40 trials of this ten-step objective) 36 trials + /// are pruned, the first ones (trials 3 and 4) after step 1; through the bridge, with the port's bit-exact + /// <c>RandomSampler(seed: 0)</c> drawing the same <c>x</c> values, none is. <c>pruners/hyperband</c> (also + /// Optuna's, built on successive halving) prunes 31 natively and none through the bridge; <c>median</c>, + /// <c>percentile</c>, <c>wilcoxon</c> and <c>threshold</c>, which keep no state, agree trial for trial. + /// <b>Fixed 2026-11-12:</b> the pruner's persistent shadow keeps the <c>completed_rung_N</c> records; 36 + /// trials are pruned, trial 3 after step 1, as natively. + /// </remarks> + [TestMethod] + [TestCategory("RequiresPython")] + public void SuccessiveHalvingThroughBridge_PrunesLikeNativePython() + { + using var module = LoadHubModuleOrInconclusive("pruners/successive_halving"); + using var pruner = module.CreatePruner("SuccessiveHalvingPruner", new()); + + var study = Optuna.CreateStudy(sampler: new OptunaSharp.Samplers.RandomSampler(seed: 0), pruner: pruner); + study.Optimize(ReportingObjective, nTrials: 40); + + study.Trials[3].State.Should().Be(TrialState.Pruned, "native Optuna prunes trial 3 after step 1"); + study.Trials[3].IntermediateValues.Keys.Should().Equal(0L, 1L); + study.Trials.Count(t => t.State == TrialState.Pruned).Should().Be(36); + } + + /// <summary> + /// The pruning comparison's objective (<c>hub_prune.py</c> in the QA scratch): one float, ten reported steps + /// <c>(x - 0.3)² + 1 / (step + 1)</c>, asking the pruner after each. + /// </summary> + /// <param name="trial">The trial to suggest on and report to.</param> + /// <returns>The last reported value, when the trial is never pruned.</returns> + /// <exception cref="TrialPruned">The study's pruner asks to prune the trial; <c>Optimize</c> records it as pruned.</exception> + private static double ReportingObjective(Trial trial) + { + double x = trial.SuggestFloat("x", -1.0, 1.0); + double value = 0.0; + for (int step = 0; step < 10; step++) + { + value = Math.Pow(x - 0.3, 2) + 1.0 / (step + 1); + trial.Report(value, step); + if (trial.ShouldPrune()) + throw new TrialPruned(); + } + return value; + } + + /// <summary> + /// The objective both sides of the comparison ran (<c>hub_run.py</c> in the QA scratch): two floats and an int; + /// the second value is used by the multi-objective test only. + /// </summary> + /// <param name="trial">The trial to suggest on.</param> + /// <returns>The two objective values; single-objective callers take the first.</returns> + private static IReadOnlyList<double> Objective(Trial trial) + { + double x = trial.SuggestFloat("x", -1.0, 1.0); + double y = trial.SuggestFloat("y", 0.0, 2.0); + long n = trial.SuggestInt("n", 0, 5); + double first = Math.Pow(x - 0.3, 2) + Math.Pow(y - 0.4, 2) + 0.1 * n; + double second = Math.Pow(x + 0.5, 2) + Math.Pow(y - 1.5, 2) + 0.05 * (5 - n); + return new[] { first, second }; + } + + /// <summary> + /// Loads <paramref name="package" /> from the pinned registry, or reports Inconclusive when Python, OptunaHub or + /// the submodule is missing. + /// </summary> + /// <param name="package">The registry package, e.g. <c>samplers/pso</c>.</param> + /// <returns>The loaded module; the caller disposes it.</returns> + private static OptunaHubModule LoadHubModuleOrInconclusive(string package) + { + PythonSession.EnsureOrInconclusive(); + try + { + PythonRuntime.Run(() => { using var _ = Py.Import("optunahub"); }); + } + catch (Exception ex) + { + Assert.Inconclusive($"optunahub not importable (`pip install optunahub`): {ex.Message}"); + } + string root = Path.Combine(RepoRoot(), "refs", "optunahub-registry", "package"); + if (!Directory.Exists(Path.Combine(root, package))) + Assert.Inconclusive("refs/optunahub-registry submodule not initialized " + + "(`git submodule update --init refs/optunahub-registry`)."); + return OptunaHub.LoadLocalModule(package, root); + } + + /// <summary>Returns the repository root, two levels above this source file.</summary> + /// <param name="thisFile">Filled in by the compiler with this file's path.</param> + /// <returns>The absolute repository root.</returns> + private static string RepoRoot([CallerFilePath] string? thisFile = null) + => Path.GetFullPath(Path.Combine(Path.GetDirectoryName(thisFile)!, "..", "..")); +} diff --git a/test/OptunaSharp.Tests.Interop/SqliteRdbInteropParityTests.cs b/test/OptunaSharp.Tests.Interop/SqliteRdbInteropParityTests.cs index 20642e5..770686a 100644 --- a/test/OptunaSharp.Tests.Interop/SqliteRdbInteropParityTests.cs +++ b/test/OptunaSharp.Tests.Interop/SqliteRdbInteropParityTests.cs @@ -294,4 +294,45 @@ public void Heartbeat_RetryStaleTrialCallback_Parity_With_Live_Optuna() wait.UserAttrs["owner"].Should().Be(PyStr("rwait.user_attrs['owner']")); ((long)wait.SystemAttrs["custom"]!).Should().Be(PyLong("rwait.system_attrs['custom']")); } + + /// <summary> + /// Plan 14 gate: the cached SQLite refresh now asks for <c>trial_id > watermark UNION ALL trial_id IN + /// (running ids)</c> instead of Optuna's OR, a query shape that only runs while a trial below the watermark is still + /// RUNNING. Python opens the study, leaves its first trial running and completes 15 more; C# loads it through + /// <see cref="CachedStorage" /> and optimizes 25 trials (every sync takes the new query, with the running trial + /// included); Python then gives the running trial a parameter, an intermediate value and its value and completes it; + /// C#'s cached view must then equal Python's fresh read of the file, field for field. + /// </summary> + [TestMethod] + [TestCategory("RequiresPython")] + public void RunningTrialBelowTheWatermark_CachedRefresh_MatchesPythonsRead() + { + PythonSession.EnsureOrInconclusive(); + + PyExec( + $"study = optuna.create_study(study_name='s', storage=r'{Url}', " + + "sampler=optuna.samplers.RandomSampler(5))\n" + + "stale = study.ask()\n" + + PyMixedObjective + + "study.optimize(_obj, n_trials=15)\n"); + + var csStudy = Optuna.LoadStudy("s", new RDBStorage(Url), sampler: new RandomSampler(6)); + csStudy.Storage.Should().BeOfType<CachedStorage>(); + csStudy.Optimize(MixedObjective, nTrials: 25); + csStudy.Trials.Count(t => t.State == TrialState.Running).Should().Be(1, "Python's first trial is still running"); + + PyExec( + "stale.suggest_float('x', -10, 10)\n" + + "stale.report(1.25, 0)\n" + + "study.tell(stale, 3.5)\n" + + "study._storage.remove_session()\n" + + $"fresh = optuna.load_study(study_name='s', storage=r'{Url}')\n"); + var pyState = PyStudyState("fresh"); + PyExec("fresh._storage.remove_session()\n"); + + var csState = StudySnapshot.Capture(csStudy); + csState.Trials.Should().HaveCount(41); + csStudy.Trials[0].State.Should().Be(TrialState.Complete, "the cached view picked up Python's tell"); + StudySnapshot.AssertParity(pyState, csState, DatetimeComparison.NullnessOnly); + } } diff --git a/test/OptunaSharp.Tests.Interop/StorageUrlStandardParityTests.cs b/test/OptunaSharp.Tests.Interop/StorageUrlStandardParityTests.cs index a6a7cd0..175bd0a 100644 --- a/test/OptunaSharp.Tests.Interop/StorageUrlStandardParityTests.cs +++ b/test/OptunaSharp.Tests.Interop/StorageUrlStandardParityTests.cs @@ -140,7 +140,7 @@ private string[] PythonOutcomes(IReadOnlyList<string> urls, string function) UnicodeEncodeError => $"UnicodeEncodeError|{e.Message}", ValueError => $"ValueError|{e.Message}", TypeError => $"TypeError|{e.Message}", - OverflowException => $"OverflowError|{e.Message}", + OverflowError => $"OverflowError|{e.Message}", FormatException => $"ProgrammingError|{e.Message}", NotSupportedException when e.Message.StartsWith(StorageUrlResolver.ImportErrorMessage, StringComparison.Ordinal) => $"ImportError|{StorageUrlResolver.ImportErrorMessage}", diff --git a/test/OptunaSharp.Tests.Interop/TpeSamplerParityTests.cs b/test/OptunaSharp.Tests.Interop/TpeSamplerParityTests.cs index 88e1148..41f2a45 100644 --- a/test/OptunaSharp.Tests.Interop/TpeSamplerParityTests.cs +++ b/test/OptunaSharp.Tests.Interop/TpeSamplerParityTests.cs @@ -326,4 +326,190 @@ public void StartupPhase_UsesRandomSampling_BitExact() for (int i = 0; i < 10; i++) csState.Trials[i].ParamsInternal["x"].Should().Be(pyState.Trials[i].ParamsInternal["x"]); } + + /// <summary> + /// Plan 13 gate (docs/plans/13-rustuna-derived-performance.md, phase 0): the default single-objective TPE + /// (multivariate, constant liar) over 40 float parameters for 1,000 trials, the workload whose scoring kernel + /// item S6 rewrote. The whole trajectory stays in lock-step with live Optuna, within the erf tolerance of the + /// other TPE cases, so the fused kernel, the pooled buffers and the sort that replaced LINQ changed nothing a + /// thousand trials of compounding would show. + /// </summary> + [TestMethod] + [TestCategory("RequiresPython")] + [TestCategory("Slow")] + public void LongRun_Multivariate40D_1000Trials_TrajectoryMatches() + { + PythonSession.EnsureOrInconclusive(); + + var csStudy = Optuna.CreateStudy(storage: new InMemoryStorage(), sampler: new TPESampler(seed: 0), studyName: "tpe"); + csStudy.Optimize(t => + { + double s = 0; + for (int i = 0; i < 40; i++) + { + double v = t.SuggestFloat($"x{i}", -10, 10); + s += (v - 1) * (v - 1); + } + return s; + }, nTrials: 1000); + + AssertTrajectoryParity(csStudy, + "study = optuna.create_study(study_name='tpe', sampler=optuna.samplers.TPESampler(seed=0))\n" + + "def _obj(t):\n" + + " s = 0.0\n" + + " for i in range(40):\n" + + " v = t.suggest_float(f'x{i}', -10, 10)\n" + + " s += (v - 1) * (v - 1)\n" + + " return s\n" + + "study.optimize(_obj, n_trials=1000)\n"); + } + + /// <summary> + /// Plan 13 gate (phase 0): the default two-objective TPE (independent, constant liar) over 40 float parameters + /// for 300 trials, the workload of items S3 (the constant-liar read that skips the current trial), S5 (one split per + /// trial instead of per parameter) and S6. Every trial stays in lock-step with live Optuna within the erf + /// tolerance. + /// </summary> + [TestMethod] + [TestCategory("RequiresPython")] + [TestCategory("Slow")] + public void LongRun_MultiObjective40D_300Trials_TrajectoryMatches() + { + PythonSession.EnsureOrInconclusive(); + + var csStudy = Optuna.CreateStudy( + storage: new InMemoryStorage(), sampler: new TPESampler(seed: 0), studyName: "tpe", + directions: new[] { StudyDirection.Minimize, StudyDirection.Minimize }); + csStudy.Optimize(t => + { + double a = 0, b = 0; + for (int i = 0; i < 40; i++) + { + double v = t.SuggestFloat($"x{i}", -10, 10); + a += v * v; + b += (v - 2) * (v - 2); + } + return new[] { a, b }; + }, nTrials: 300); + + AssertTrajectoryParity(csStudy, + "study = optuna.create_study(study_name='tpe', directions=['minimize', 'minimize'], " + + "sampler=optuna.samplers.TPESampler(seed=0))\n" + + "def _obj(t):\n" + + " a = 0.0\n" + + " b = 0.0\n" + + " for i in range(40):\n" + + " v = t.suggest_float(f'x{i}', -10, 10)\n" + + " a += v * v\n" + + " b += (v - 2) * (v - 2)\n" + + " return a, b\n" + + "study.optimize(_obj, n_trials=300)\n"); + } + + /// <summary> + /// Plan 14 gate: the observation cache keys each column by parameter name and distribution, and remembers that a + /// finished trial lacks a parameter. This study gives it every case: a float whose range changes with the trial + /// number (three distributions under one name), a log float suggested only on one categorical branch (absent from + /// the other trials), and pruned trials (finished, so cached, and part of TPE's history), in both TPE modes, for 80 + /// trials. The trajectory must stay in lock-step with live Optuna within the erf tolerance. + /// </summary> + /// <param name="multivariate">Whether TPE models the parameters jointly (the dynamic range is then sampled independently).</param> + /// <param name="seed">The sampler seed on both sides.</param> + /// <exception cref="TrialPruned">Never escapes: the objective raises it to prune every seventh trial, and Optimize records that trial as pruned.</exception> + [TestMethod] + [TestCategory("RequiresPython")] + [DataRow(false, 0)] + [DataRow(false, 42)] + [DataRow(true, 0)] + [DataRow(true, 7)] + public void DynamicRangesConditionalAndPrunedTrials_TrajectoryMatches(bool multivariate, int seed) + { + PythonSession.EnsureOrInconclusive(); + + var csStudy = Optuna.CreateStudy( + storage: new InMemoryStorage(), sampler: new TPESampler(seed: seed, multivariate: multivariate), studyName: "tpe"); + csStudy.Optimize(t => + { + double span = 5.0 + t.Number % 3; + double x = t.SuggestFloat("x", -span, span); + string c = t.SuggestCategorical("c", new[] { "a", "b", "c" }); + double y = c == "a" ? t.SuggestFloat("y", 1e-3, 10.0, log: true) : 0.0; + double value = x * x + y + (c == "b" ? 0.0 : 1.0); + t.Report(value, 0); + if (t.Number % 7 == 3) + throw new TrialPruned(); + return value; + }, nTrials: 80); + + AssertTrajectoryParity(csStudy, + "study = optuna.create_study(study_name='tpe', " + + $"sampler=optuna.samplers.TPESampler(seed={seed}, multivariate={(multivariate ? "True" : "False")}))\n" + + "def _obj(t):\n" + + " span = 5.0 + t.number % 3\n" + + " x = t.suggest_float('x', -span, span)\n" + + " c = t.suggest_categorical('c', ['a', 'b', 'c'])\n" + + " y = t.suggest_float('y', 1e-3, 10.0, log=True) if c == 'a' else 0.0\n" + + " value = x * x + y + (0.0 if c == 'b' else 1.0)\n" + + " t.report(value, 0)\n" + + " if t.number % 7 == 3:\n" + + " raise optuna.TrialPruned()\n" + + " return value\n" + + "study.optimize(_obj, n_trials=80)\n"); + } + + /// <summary> + /// Plan 14 gate: constant liar with trials still running. Trials are asked three at a time and told only after all + /// three have sampled, so each later sample sees the earlier ones RUNNING: their relative parameters come from + /// system attributes (multivariate) or their suggested values (independent), and the observation cache must leave + /// them uncached and read them fresh. Fifteen rounds, both TPE modes, in lock-step with live Optuna within the erf + /// tolerance. + /// </summary> + /// <param name="multivariate">Whether TPE models the parameters jointly.</param> + /// <param name="seed">The sampler seed on both sides.</param> + [TestMethod] + [TestCategory("RequiresPython")] + [DataRow(false, 3)] + [DataRow(true, 3)] + [DataRow(true, 11)] + public void ConstantLiarWithRunningTrials_AskTell_TrajectoryMatches(bool multivariate, int seed) + { + PythonSession.EnsureOrInconclusive(); + + var csStudy = Optuna.CreateStudy( + storage: new InMemoryStorage(), + sampler: new TPESampler(seed: seed, multivariate: multivariate, constantLiar: true, nStartupTrials: 5), + studyName: "tpe"); + for (int round = 0; round < 15; round++) + { + var batch = new Trial[3]; + for (int i = 0; i < batch.Length; i++) + { + batch[i] = csStudy.Ask(); + batch[i].SuggestFloat("x", -5, 5); + batch[i].SuggestFloat("y", 1e-2, 1e2, log: true); + batch[i].SuggestCategorical("c", new[] { "u", "v" }); + } + foreach (var t in batch) + { + var p = csStudy.Storage.GetTrial(t.TrialId).Params; + double x = (double)p["x"]!, y = (double)p["y"]!; + csStudy.Tell(t, x * x + Math.Log(y) * Math.Log(y) + ((string)p["c"]! == "u" ? 0.0 : 0.5)); + } + } + + AssertTrajectoryParity(csStudy, + "import math\n" + + "study = optuna.create_study(study_name='tpe', " + + $"sampler=optuna.samplers.TPESampler(seed={seed}, multivariate={(multivariate ? "True" : "False")}, " + + "constant_liar=True, n_startup_trials=5))\n" + + "for _ in range(15):\n" + + " batch = [study.ask() for _ in range(3)]\n" + + " for t in batch:\n" + + " t.suggest_float('x', -5, 5)\n" + + " t.suggest_float('y', 1e-2, 1e2, log=True)\n" + + " t.suggest_categorical('c', ['u', 'v'])\n" + + " for t in batch:\n" + + " p = t.params\n" + + " study.tell(t, p['x'] ** 2 + math.log(p['y']) ** 2 + (0.0 if p['c'] == 'u' else 0.5))\n"); + } } diff --git a/test/OptunaSharp.Tests.PackageParity/Dockerfile b/test/OptunaSharp.Tests.PackageParity/Dockerfile index 34d23e0..fe0f3bd 100644 --- a/test/OptunaSharp.Tests.PackageParity/Dockerfile +++ b/test/OptunaSharp.Tests.PackageParity/Dockerfile @@ -17,14 +17,16 @@ RUN apt-get update \ # Install the VENDORED optuna — the EXACT submodule commit (the v5.0.0 release @ 01ddd17) OptunaSharp's # samplers track. An older PyPI optuna (4.x) is a different TPE implementation and its trajectory diverges # wildly (the SvmSklearn_Tpe oracle went 0.034 -> 4.73), so the commit is pinned rather than left to -# whatever PyPI resolves. numpy is pinned to 2.4.2 (the port's byte-exact target; the erf-tolerant TPE -# parity then holds at 1e-9, exactly as the live interop suite does). +# whatever PyPI resolves. numpy is pinned to 2.5.4, the port's byte-exact target since NumSharp 0.81.0 +# (its OpenBLAS natives are numpy 2.5.4's scipy-openblas build, so the BLAS-backed oracles stay +# byte-identical); the erf-tolerant TPE parity then holds at 1e-9, exactly as the live interop suite does. +# Move this pin with the repo's $(NumSharpVersion), like the interop job's. # The container has no access to src/ (isolation), so it fetches the commit from GitHub instead. -RUN pip3 install --no-cache-dir --break-system-packages "numpy==2.4.2" \ +RUN pip3 install --no-cache-dir --break-system-packages "numpy==2.5.4" \ && pip3 install --no-cache-dir --break-system-packages \ "optuna @ git+https://github.com/optuna/optuna.git@01ddd17ab9f36c3d2817aed9afe376e1cb047d35" \ xgboost lightgbm scikit-learn \ - && pip3 install --no-cache-dir --break-system-packages "numpy==2.4.2" + && pip3 install --no-cache-dir --break-system-packages "numpy==2.5.4" WORKDIR /work ARG OPTUNASHARP_VERSION=0.1.0 diff --git a/test/OptunaSharp.Tests.Storage/EFCoreDriverParityTests.cs b/test/OptunaSharp.Tests.Storage/EFCoreDriverParityTests.cs index a4916c3..e5f62fd 100644 --- a/test/OptunaSharp.Tests.Storage/EFCoreDriverParityTests.cs +++ b/test/OptunaSharp.Tests.Storage/EFCoreDriverParityTests.cs @@ -311,11 +311,11 @@ public void MySqlDb_ArgumentParsing_FollowsCPython() public void MySqlDb_IntegerOverflow_UsesThePlatformsMessage() { string large = OperatingSystem.IsWindows() ? "Python int too large to convert to C long" : "signed integer is greater than maximum"; - Fails("mysql://u:p@h/db?connect_timeout=99999999999", typeof(OverflowException), large); - Fails("mysql://u:p@h/db?client_flag=99999999999", typeof(OverflowException), large); - Fails("mysql://u:p@h:99999999999/db", typeof(OverflowException), large); + Fails("mysql://u:p@h/db?connect_timeout=99999999999", typeof(OverflowError), large); + Fails("mysql://u:p@h/db?client_flag=99999999999", typeof(OverflowError), large); + Fails("mysql://u:p@h:99999999999/db", typeof(OverflowError), large); string small = OperatingSystem.IsWindows() ? "Python int too large to convert to C long" : "signed integer is less than minimum"; - Fails("mysql://u:p@h/db?client_flag=-2147483649", typeof(OverflowException), small); + Fails("mysql://u:p@h/db?client_flag=-2147483649", typeof(OverflowError), small); } /// <summary> @@ -389,9 +389,9 @@ public void PyMySql_Password_MustBeLatin1() [TestMethod] public void PyMySql_SslFiles_LoadLikePython() { - Fails("mysql+pymysql://u:p@h/db?ssl_ca=nonexistent", typeof(FileNotFoundException), "[Errno 2] No such file or directory"); - Fails("mysql+pymysql://u:p@h/db?ssl_cert=nonexistent", typeof(FileNotFoundException), "[Errno 2] No such file or directory"); - Fails("mysql+pymysql://u:p@h/db?ssl_capath=x&ssl_ca=nonexistent", typeof(FileNotFoundException), "[Errno 2] No such file or directory"); + Fails("mysql+pymysql://u:p@h/db?ssl_ca=nonexistent", typeof(FileNotFoundError), "[Errno 2] No such file or directory"); + Fails("mysql+pymysql://u:p@h/db?ssl_cert=nonexistent", typeof(FileNotFoundError), "[Errno 2] No such file or directory"); + Fails("mysql+pymysql://u:p@h/db?ssl_capath=x&ssl_ca=nonexistent", typeof(FileNotFoundError), "[Errno 2] No such file or directory"); My("mysql+pymysql://u:p@h/db?ssl_key_password=x").Server.Should().Be("h"); My("mysql+pymysql://u:p@h/db?ssl_key_password=x&ssl_verify_cert=1").SslMode.Should().Be(MySqlSslMode.VerifyCA); } diff --git a/test/OptunaSharp.Tests.Storage/GrpcStorageProxyTests.cs b/test/OptunaSharp.Tests.Storage/GrpcStorageProxyTests.cs index 97d863b..9e77de2 100644 --- a/test/OptunaSharp.Tests.Storage/GrpcStorageProxyTests.cs +++ b/test/OptunaSharp.Tests.Storage/GrpcStorageProxyTests.cs @@ -517,6 +517,87 @@ public void GaSampler_ReusedOnARecreatedStudyUnderTheSameId_StartsAtGenerationZe System.IO.File.Delete(path); } } + + /// <summary> + /// Plan 14's TPE observation cache, in the recreated-study case of pre-release review item H3. TPE keeps each + /// finished trial's internal parameter values by trial number for the study it last sampled. Over a gRPC proxy to + /// SQLite, one storage object serves every study and SQLite reuses the highest deleted study and trial ids, so a + /// study deleted and recreated under the same id shows a reused sampler different trials under numbers it has + /// already cached. The reference is the same run with the first study kept, so the second study gets a new id: + /// the reused sampler must suggest exactly the same parameters in both runs, as TPE without the cache (and + /// Optuna, which keeps no such cache) does. Before the cache checked each row's trial identity, the recreated run + /// read the deleted study's values for trials 0-19 and suggested different parameters. The sampler is the + /// independent TPE: the multivariate one (Optuna 5's single-objective default) refuses, as Optuna does, a sampler + /// reused for a study under another id (<c>IntersectionSearchSpace</c> cannot handle multiple studies), which is + /// what the reference run does; the independent TPE reads the same cache. + /// </summary> + [TestMethod] + public void Tpe_ReusedOnARecreatedStudyUnderTheSameId_SamplesAsUnderANewId() + { + IReadOnlyList<string> reference = TpeTrialsOnASecondStudy(deleteTheFirst: false); + IReadOnlyList<string> recreated = TpeTrialsOnASecondStudy(deleteTheFirst: true); + recreated.Should().HaveCount(12); + recreated.Should().Equal(reference, + "a study recreated under a reused id is a new history: no value cached for the deleted study may be read"); + } + + /// <summary> + /// One run of <see cref="Tpe_ReusedOnARecreatedStudyUnderTheSameId_SamplesAsUnderANewId" /> on a fresh SQLite file + /// behind a fresh gRPC proxy: a reused <see cref="TPESampler" /> optimizes a first study for 20 trials, a second + /// study gets 24 random trials, then the reused sampler optimizes the second study for 12 more. + /// </summary> + /// <param name="deleteTheFirst"> + /// Whether the first study is deleted before the second is created, so that the second reuses its id. + /// </param> + /// <returns>The 12 TPE trials of the second study, each as its parameters' value bits.</returns> + /// <exception cref="Exception">Whatever the proxy, the server or the study throws; the test then fails.</exception> + private static IReadOnlyList<string> TpeTrialsOnASecondStudy(bool deleteTheFirst) + { + string path = System.IO.Path.Combine(System.IO.Path.GetTempPath(), $"optunasharp-h3-tpe-{Guid.NewGuid():N}.db"); + int port = FreePort(); + var backend = new RDBStorage($"sqlite:///{path.Replace('\\', '/')}"); + var app = GrpcProxyServer.MakeServer(backend, "localhost", port); + app.StartAsync().GetAwaiter().GetResult(); + try + { + using var proxy = new GrpcStorageProxy("localhost", port); + proxy.WaitServerReady(TimeSpan.FromSeconds(15)); + double Objective(Trial t) + { + double x = t.SuggestFloat("x", 0, 1), y = t.SuggestFloat("y", 0, 1); + return (x - 0.3) * (x - 0.3) + (y - 0.7) * (y - 0.7); + } + var tpe = new TPESampler(seed: 0, nStartupTrials: 5, multivariate: false); + + var first = Optuna.CreateStudy(storage: proxy, studyName: "first", sampler: tpe); + first.Optimize(Objective, nTrials: 20); + int firstStudyId = proxy.GetStudyIdFromName("first"); + if (deleteTheFirst) + Optuna.DeleteStudy("first", proxy); + + var second = Optuna.CreateStudy(storage: proxy, studyName: "second", sampler: new RandomSampler(seed: 1)); + if (deleteTheFirst) + proxy.GetStudyIdFromName("second").Should().Be(firstStudyId, + "SQLite reuses the deleted study's id, which is the case under test"); + else + proxy.GetStudyIdFromName("second").Should().NotBe(firstStudyId, "the reference run keeps the first study"); + second.Optimize(Objective, nTrials: 24); + var secondWithTpe = Optuna.LoadStudy("second", proxy, sampler: tpe); + secondWithTpe.Optimize(Objective, nTrials: 12); + + return secondWithTpe.Trials.Skip(24) + .Select(t => $"{BitConverter.DoubleToInt64Bits((double)t.Params["x"]!):X16} {BitConverter.DoubleToInt64Bits((double)t.Params["y"]!):X16}") + .ToList(); + } + finally + { + app.StopAsync().GetAwaiter().GetResult(); + app.DisposeAsync().AsTask().GetAwaiter().GetResult(); + backend.Dispose(); + Microsoft.Data.Sqlite.SqliteConnection.ClearAllPools(); + System.IO.File.Delete(path); + } + } } /// <summary>A trivial server interceptor used to prove <c>configureGrpc</c> is honored.</summary> diff --git a/test/OptunaSharp.Tests.Storage/RedisTlsTests.cs b/test/OptunaSharp.Tests.Storage/RedisTlsTests.cs index 5a7e63a..aec3f52 100644 --- a/test/OptunaSharp.Tests.Storage/RedisTlsTests.cs +++ b/test/OptunaSharp.Tests.Storage/RedisTlsTests.cs @@ -4,7 +4,7 @@ using System.Security.Cryptography; using System.Security.Cryptography.X509Certificates; using AwesomeAssertions; -using NumSharp; // TypeError +using NumSharp; // TypeError, FileNotFoundError using OptunaSharp.Storages.Journal; // RedisTls (friend access), RedisEndpoint namespace OptunaSharp.Tests.Storage; @@ -152,7 +152,7 @@ public void LoadAuthorities_FollowsPythonsLoadVerifyLocations() Action noData = () => RedisTls.LoadAuthorities(new RedisEndpoint { Ssl = true, SslCaData = "x" }); noData.Should().Throw<CryptographicException>().WithMessage("no start line: cadata does not contain a certificate"); Action missing = () => RedisTls.LoadAuthorities(new RedisEndpoint { Ssl = true, SslCaCerts = Path.Combine(_dir, "none.pem") }); - missing.Should().Throw<FileNotFoundException>(); + missing.Should().ThrowExactly<FileNotFoundError>().WithMessage("[Errno 2] No such file or directory"); Action empty = () => RedisTls.LoadAuthorities(new RedisEndpoint { Ssl = true, SslCaCerts = WriteFile("empty.pem", "hello") }); empty.Should().Throw<CryptographicException>().WithMessage("[X509: NO_CERTIFICATE_OR_CRL_FOUND] no certificate or crl found"); diff --git a/test/OptunaSharp.Tests.Storage/RedisUrlTests.cs b/test/OptunaSharp.Tests.Storage/RedisUrlTests.cs index c0fbe21..8c93668 100644 --- a/test/OptunaSharp.Tests.Storage/RedisUrlTests.cs +++ b/test/OptunaSharp.Tests.Storage/RedisUrlTests.cs @@ -1,6 +1,6 @@ using System; using AwesomeAssertions; -using NumSharp; // ValueError, TypeError +using NumSharp; // ValueError, TypeError, OverflowError using OptunaSharp.Storages.Journal; // RedisUrl / RedisEndpoint (shared package) namespace OptunaSharp.Tests.Storage; @@ -288,7 +288,7 @@ public void PoolAndDecodingOptions_AreAcceptedWithoutEffect() [DataRow("redis://[::1", typeof(ValueError), "Invalid IPv6 URL")] [DataRow("redis://h?socket_timeout=-1", typeof(ValueError), "Timeout value out of range")] [DataRow("redis://h?socket_connect_timeout=nan", typeof(ValueError), "Invalid value NaN (not a number)")] - [DataRow("redis://h?socket_timeout=inf", typeof(OverflowException), "timestamp out of range for platform time_t")] + [DataRow("redis://h?socket_timeout=inf", typeof(OverflowError), "timestamp out of range for platform time_t")] [DataRow("rediss://h?ssl_min_version=999", typeof(ValueError), "Unsupported TLS/SSL version 0x3e7")] [DataRow("rediss://h?ssl_min_version=-3", typeof(ValueError), "Unsupported TLS/SSL version 0xfffffffd")] [DataRow("rediss://h?ssl_validate_ocsp=1&ssl_validate_ocsp_stapled=1", typeof(ValueError), "Either an OCSP staple or pure OCSP connection must be validated - not both.")] diff --git a/test/OptunaSharp.Tests.Storage/Run2EFCoreParityBugTests.cs b/test/OptunaSharp.Tests.Storage/Run2EFCoreParityBugTests.cs new file mode 100644 index 0000000..c6a6daa --- /dev/null +++ b/test/OptunaSharp.Tests.Storage/Run2EFCoreParityBugTests.cs @@ -0,0 +1,81 @@ +using System; +using AwesomeAssertions; +using OptunaSharp; +using OptunaSharp.Storages.EFCore; + +namespace OptunaSharp.Tests.Storage; + +/// <summary> +/// Open parity bugs in the EF Core RDB storage (PostgreSQL, MySQL) found by the 2026-11-10 parity QA run +/// (<c>docs/qa/PARITY_QA_2026-11-10.md</c>). Each test fails today and passes once fixed, at which point its +/// <c>OpenBugs</c> category should be removed. The databases come from <see cref="EFCoreDbSession" /> +/// (Testcontainers); without Docker the tests report Inconclusive, as the rest of the EF Core suite does. +/// </summary> +[TestClass] +public class Run2EFCoreParityBugTests +{ + /// <summary>The message of Optuna's <c>_create_scoped_session</c> for every non-integrity database error.</summary> + private const string OptunaCommitMessage = + "An exception is raised during the commit. This typically happens due to invalid data in the commit, " + + "e.g. exceeding max length. "; + + /// <summary> + /// QA-74: Optuna's RDB storage runs every write in <c>_create_scoped_session</c>, which turns any SQLAlchemy error + /// other than an integrity error into <c>StorageInternalError</c> with <see cref="OptunaCommitMessage" />. A key + /// longer than the 512-character <c>key</c> column is such an error on PostgreSQL and MySQL. The port's EF Core + /// storage lets EF's <c>DbUpdateException</c> ("An error occurred while saving the entity changes. See the inner + /// exception for details.") escape, so code that catches <c>StorageInternalError</c> misses it. + /// </summary> + /// <remarks> + /// Measured with Optuna 5.0.0 / SQLAlchemy 2.0.45 (PyMySQL, psycopg2) against MySQL 8.0 and PostgreSQL 16 and the + /// port against the same servers: a study name, parameter name, study or trial user-attribute key of 600 + /// characters, and on MySQL a 70,000-character attribute value (beyond <c>TEXT</c>'s 65,535 bytes), all raise + /// <c>StorageInternalError</c> in Optuna and <c>DbUpdateException</c> in the port (9 of 9 cases; PostgreSQL's + /// <c>TEXT</c> takes the long value on both sides). SQLite enforces no length, so both accept everything there. No + /// storage of the port raises <c>StorageInternalError</c> at all: the type exists but nothing throws it. + /// <b>Fixed 2026-11-12:</b> the EF Core storage's <c>Mutate</c> translates every non-integrity database error into + /// Optuna's <c>StorageInternalError</c>, wrapping the provider's error, outside the execution strategy. + /// </remarks> + /// <param name="provider">The database server to run against.</param> + [TestMethod] + [DataRow(RdbProvider.PostgreSql)] + [DataRow(RdbProvider.MySql)] + public void OverLongAttributeKey_RaisesStorageInternalErrorLikeOptuna(RdbProvider provider) + { + EFCoreDbSession.EnsureAvailable(provider); + var study = Optuna.CreateStudy(storage: EFCoreDbSession.NewStorage(provider), studyName: "limits"); + + Action setLongKey = () => study.SetUserAttr(new string('k', 600), 1L); + + setLongKey.Should().Throw<StorageInternalError>().WithMessage(OptunaCommitMessage); + } + + /// <summary> + /// QA-71 on MySQL: Optuna reads a study's and a trial's attributes with no <c>ORDER BY</c>, and InnoDB answers + /// through the unique <c>(study_id, key)</c> / <c>(trial_id, key)</c> index, so they come back sorted by key, as on + /// SQLite; the EF Core storage orders by attribute id (insertion order). + /// </summary> + /// <remarks> + /// Measured against MySQL 8.0: study user attributes set <c>zz, b, m</c> read back <c>b, m, zz</c> in Optuna, + /// <c>zz, b, m</c> in the port; trial user attributes <c>k, a</c> as <c>a, k</c>. On PostgreSQL 16 Optuna's own order + /// is not stable (sorted on the first read of a study, insertion order after <c>load_study</c>), so there is no + /// single target and no PostgreSQL case here. + /// <b>Fixed 2026-11-12:</b> on MySQL the EF Core storage reads study and trial attributes ordered by key + /// (the column collation's order, as InnoDB's unique indexes return them); PostgreSQL keeps insertion order. + /// </remarks> + [TestMethod] + public void MySqlAttributeReads_ComeBackInKeyOrderLikeOptuna() + { + EFCoreDbSession.EnsureAvailable(RdbProvider.MySql); + var study = Optuna.CreateStudy(storage: EFCoreDbSession.NewStorage(RdbProvider.MySql), studyName: "attrs"); + foreach (var key in new[] { "zz", "b", "m" }) + study.SetUserAttr(key, 1L); + var trial = study.Ask(); + trial.SetUserAttr("k", 1L); + trial.SetUserAttr("a", 2L); + study.Tell(trial, 1.0); + + study.UserAttrs.Keys.Should().Equal(new[] { "b", "m", "zz" }, "InnoDB returns Optuna's unordered query in (study_id, key) order"); + study.Trials[0].UserAttrs.Keys.Should().Equal("a", "k"); + } +} diff --git a/test/OptunaSharp.Tests.Storage/Run2GrpcParityBugTests.cs b/test/OptunaSharp.Tests.Storage/Run2GrpcParityBugTests.cs new file mode 100644 index 0000000..e49899d --- /dev/null +++ b/test/OptunaSharp.Tests.Storage/Run2GrpcParityBugTests.cs @@ -0,0 +1,133 @@ +using System; +using System.Linq; +using System.Net; +using System.Net.Sockets; +using AwesomeAssertions; +using Microsoft.AspNetCore.Builder; +using OptunaSharp; +using OptunaSharp.Samplers; +using OptunaSharp.Storages; +using OptunaSharp.Storages.Grpc; + +namespace OptunaSharp.Tests.Storage; + +/// <summary> +/// The gRPC storage proxy's dictionary order, found by the 2026-11-10 parity QA run +/// (<c>docs/qa/PARITY_QA_2026-11-10.md</c>, QA-69): Optuna's proxy client returns trial dictionaries in Python +/// protobuf's hash order, the port's keeps insertion order. The owner chose insertion order on 2026-11-12, so these +/// tests are <c>Misaligned</c>: they pin the port's order and record Optuna's. Every test hosts the C# proxy server +/// in-process over an <see cref="InMemoryStorage" /> and talks to it through the C# <see cref="GrpcStorageProxy" />, +/// so no Python and no external service are needed. +/// </summary> +[TestClass] +public class Run2GrpcParityBugTests +{ + private WebApplication _app = null!; + private GrpcStorageProxy _proxy = null!; + + /// <summary>Starts a proxy server over a fresh in-memory storage on a free loopback port and connects a client.</summary> + [TestInitialize] + public void Init() + { + int port; + // Ask the OS for a free port, then release it for Kestrel; a race with another process is possible but rare. + var listener = new TcpListener(IPAddress.Loopback, 0); + listener.Start(); + port = ((IPEndPoint)listener.LocalEndpoint).Port; + listener.Stop(); + _app = GrpcProxyServer.MakeServer(new InMemoryStorage(), "localhost", port); + _app.StartAsync().GetAwaiter().GetResult(); + _proxy = new GrpcStorageProxy("localhost", port); + _proxy.WaitServerReady(TimeSpan.FromSeconds(15)); + } + + /// <summary>Disposes the client, then stops and disposes the server.</summary> + [TestCleanup] + public void Cleanup() + { + _proxy?.Dispose(); + if (_app is not null) + { + _app.StopAsync().GetAwaiter().GetResult(); + _app.DisposeAsync().AsTask().GetAwaiter().GetResult(); + } + } + + /// <summary> + /// QA-69: Optuna's <c>GrpcStorageProxy</c> rebuilds every <c>FrozenTrial</c> from protobuf maps + /// (<c>_from_proto_trial</c>: <c>{key: ... for key, value in trial.params.items()}</c>, the same for + /// <c>distributions</c>, <c>user_attributes</c>, <c>system_attributes</c>; the study attributes likewise), and + /// the Python protobuf runtime (upb) iterates a map in its hash-table order, not in insertion order. So through + /// Optuna's proxy <c>trial.params</c>, <c>trial.distributions</c> and the attribute dictionaries come back in a + /// fixed hash order whatever server sits behind it. The port's client keeps the wire order: insertion order + /// from a C# server, the Python server's own serialization order from a Python server. <b>Misaligned</b> by the + /// owner's decision of 2026-11-12 (question Q6): the port keeps insertion order, the order of every other + /// storage, rather than reproduce an implementation detail of Python protobuf that can move with its version. + /// </summary> + /// <remarks> + /// <para> + /// Measured with Optuna 5.0.0, grpcio 1.78.0 and protobuf 6.33.5 (upb): nine floats suggested as + /// <c>u0, y1, depth2, x3, lr4, z5, a, b, c</c> read back as <c>depth2, u0, x3, b, y1, z5, lr4, c, a</c> + /// through a Python client against a Python or a C# server (the same in three processes with different + /// <c>PYTHONHASHSEED</c>s); user attributes <c>k1, a2, zz</c> read back as <c>a2, zz, k1</c>. The port's client + /// reads <c>u0, y1, ...</c> from a C# server and <c>a, c, lr4, z5, y1, depth2, x3, u0, b</c> from a Python + /// server. + /// </para> + /// <para> + /// Beyond the visible key order, two samplers depend on it: <c>QMCSampler</c> takes its relative search space + /// as <c>dict(first_trial.distributions)</c>, so the parameter-to-dimension assignment follows this order + /// (see <see cref="QmcThroughGrpc_AssignsDimensionsInOptunasProxyOrder" />), and <c>BruteForceSampler</c> + /// builds its tree from <c>trial.distributions.items()</c>. A random-program fuzz through the proxy changed + /// Optuna's own trajectory against the in-memory one in 41 of 65 QMC and 3 of 26 BruteForce programs; the + /// port's trajectories through its proxy equal its in-memory ones, so they differ from Optuna's there. Random, + /// TPE, CMA-ES, NSGA-II / III and Grid read sorted or per-parameter spaces and were unaffected. + /// </para> + /// <para> + /// This test pins the port's insertion order; Optuna's order for the same calls is the one quoted above. + /// </para> + /// </remarks> + [TestMethod] + [TestCategory("Misaligned")] + public void TrialDictionaries_ReadBackInInsertionOrder_NotOptunasUpbOrder() + { + var study = Optuna.CreateStudy(storage: _proxy, studyName: "order"); + var trial = study.Ask(); + foreach (var name in new[] { "u0", "y1", "depth2", "x3", "lr4", "z5", "a", "b", "c" }) + trial.SuggestFloat(name, 0, 1); + trial.SetUserAttr("k1", 1); + trial.SetUserAttr("a2", 2); + trial.SetUserAttr("zz", 3); + study.Tell(trial, 0.0); + + var frozen = study.Trials[0]; + // Optuna through its own proxy: depth2, u0, x3, b, y1, z5, lr4, c, a (upb map order); user attrs a2, zz, k1. + frozen.Params.Keys.Should().Equal(new[] { "u0", "y1", "depth2", "x3", "lr4", "z5", "a", "b", "c" }, + "the port keeps the suggestion order, as every other storage does"); + frozen.Distributions.Keys.Should().Equal(new[] { "u0", "y1", "depth2", "x3", "lr4", "z5", "a", "b", "c" }); + frozen.UserAttrs.Keys.Should().Equal(new[] { "k1", "a2", "zz" }); + } + + /// <summary> + /// QA-69, the sampler consequence: <c>QMCSampler(seed=0)</c> over <c>u0, y1, depth2</c> (each in [0, 1]) through + /// the proxy. Optuna's relative search space follows the first trial's <c>distributions</c>, which its proxy + /// returns as <c>depth2, u0, y1</c>, so the first Sobol dimension goes to <c>depth2</c>: trial 3 is + /// <c>u0 = 0.25, y1 = 0.25, depth2 = 0.75</c>, where the in-memory study (and the port, on either storage) gives + /// <c>u0 = 0.75, y1 = 0.25, depth2 = 0.25</c>. <b>Misaligned</b> (owner's decision of 2026-11-12): the port's + /// proxy run equals its in-memory run, as Optuna's in-memory run does, not Optuna's proxy run. + /// </summary> + [TestMethod] + [TestCategory("Misaligned")] + public void QmcThroughGrpc_AssignsDimensionsAsInMemory_NotInOptunasProxyOrder() + { + var study = Optuna.CreateStudy(storage: _proxy, studyName: "qmc", sampler: new QMCSampler(seed: 0)); + study.Optimize(t => t.SuggestFloat("u0", 0, 1) + t.SuggestFloat("y1", 0, 1) + t.SuggestFloat("depth2", 0, 1), + nTrials: 4); + + var third = study.Trials[3].Params; + // Optuna 5.0.0 in memory gives these too; through its GrpcStorageProxy (grpcio 1.78.0, protobuf 6.33.5 upb) + // it gives u0 = 0.25, y1 = 0.25, depth2 = 0.75. + ((double)third["u0"]!).Should().Be(0.75); + ((double)third["y1"]!).Should().Be(0.25); + ((double)third["depth2"]!).Should().Be(0.25); + } +} diff --git a/test/OptunaSharp.Tests.Storage/Run2SqliteParityBugTests.cs b/test/OptunaSharp.Tests.Storage/Run2SqliteParityBugTests.cs new file mode 100644 index 0000000..390b454 --- /dev/null +++ b/test/OptunaSharp.Tests.Storage/Run2SqliteParityBugTests.cs @@ -0,0 +1,241 @@ +using System; +using System.Collections.Generic; +using System.Globalization; +using System.IO; +using AwesomeAssertions; +using Microsoft.Data.Sqlite; +using OptunaSharp; +using OptunaSharp.Storages; + +namespace OptunaSharp.Tests.Storage; + +/// <summary> +/// Open parity bugs in the SQLite RDB storage found by the 2026-11-10 parity QA run +/// (<c>docs/qa/PARITY_QA_2026-11-10.md</c>). Each test fails today and passes once fixed, at which point its +/// <c>OpenBugs</c> category should be removed. +/// </summary> +[TestClass] +public class Run2SqliteParityBugTests +{ + private readonly List<string> _tempFiles = new(); + + /// <summary>Deletes the SQLite files the tests created; a file still held by the connection pool is left.</summary> + [TestCleanup] + public void Cleanup() + { + // Release pooled connections first so Windows lets the files go. + SqliteConnection.ClearAllPools(); + foreach (var f in _tempFiles) + { + try + { + if (File.Exists(f)) + File.Delete(f); + } + catch (IOException) + { + // The pool may still hold the file on Windows; the temp folder is cleaned later. + } + } + } + + /// <summary> + /// QA-59: the cached refresh asks SQLite for every unfinished trial below the last finished one by id + /// (<c>trial_id IN (...)</c>, one bound variable per trial). Past SQLite's variable limit (32,766 in the + /// <c>e_sqlite3</c> build Microsoft.Data.Sqlite ships) the read throws <c>SqliteException: 'too many SQL + /// variables'</c> and the study can no longer be read. Optuna catches that <c>OperationalError</c>, logs + /// <c>Caught an error from sqlalchemy: … Falling back to a slower alternative.</c> and reads every trial of the + /// study instead (<c>RDBStorage._get_trials</c>). + /// </summary> + /// <remarks> + /// <para> + /// Built here the way a long distributed run gets there: 33,000 trials left RUNNING (crashed workers, never + /// failed by a heartbeat) below a COMPLETE one. The first read has no watermark yet and succeeds; the second + /// sends the 33,000 running ids. Measured: Optuna 5.0.0 reads 33,003 trials both times (its Anaconda SQLite + /// 3.51.0 allows 250,000 variables, so it does not even need the fallback; a 32,766-variable build takes the + /// fallback with the warning); the port's second read throws. + /// </para> + /// <para> + /// The EF Core storage builds the same <c>IN</c> list (PostgreSQL allows 65,535 parameters, MySQL a packet's + /// worth) without a fallback either; it is not covered here. + /// </para> + /// <b>Fixed 2026-11-12:</b> the read catches the SQLite errors Python raises as <c>OperationalError</c>, logs + /// Optuna's warning and reads every trial of the base query, keeping the included ones and those above the + /// watermark, as <c>_get_trials</c> does. EF Core never binds one variable per id (MySQL inlines the ids, + /// PostgreSQL passes one array), so it needs no fallback. + /// </remarks> + [TestMethod] + public void CachedRefresh_TooManyRunningTrialsBelowTheWatermark_FallsBackLikeOptuna() + { + string path = Path.Combine(Path.GetTempPath(), $"optunasharp-rdb-qa59-{Guid.NewGuid():N}.db"); + _tempFiles.Add(path); + string url = "sqlite:///" + path.Replace('\\', '/'); + + var creator = Optuna.CreateStudy(studyName: "many", storage: new RDBStorage(url)); + creator.Tell(creator.Ask(), 1.0); + + // 33,000 RUNNING rows and one COMPLETE row above them, written in one transaction: through the API every trial + // would be its own synchronous commit, minutes for a test. + const int running = 33_000; + using (var connection = new SqliteConnection("Data Source=" + path)) + { + connection.Open(); + long studyId; + using (var find = connection.CreateCommand()) + { + find.CommandText = "SELECT study_id FROM studies WHERE study_name = 'many'"; + studyId = (long)find.ExecuteScalar()!; + } + string now = DateTime.Now.ToString("yyyy-MM-dd HH:mm:ss.ffffff", CultureInfo.InvariantCulture); + using var tx = connection.BeginTransaction(); + using (var insert = connection.CreateCommand()) + { + insert.Transaction = tx; + insert.CommandText = + "INSERT INTO trials (number, study_id, state, datetime_start, datetime_complete) VALUES ($n, $s, $state, $t, $c)"; + var number = insert.Parameters.Add("$n", SqliteType.Integer); + insert.Parameters.AddWithValue("$s", studyId); + var state = insert.Parameters.Add("$state", SqliteType.Text); + insert.Parameters.AddWithValue("$t", now); + var complete = insert.Parameters.Add("$c", SqliteType.Text); + for (int i = 0; i <= running; i++) + { + number.Value = i + 1; + bool last = i == running; + state.Value = last ? "COMPLETE" : "RUNNING"; + complete.Value = last ? now : DBNull.Value; + insert.ExecuteNonQuery(); + } + } + using (var value = connection.CreateCommand()) + { + value.Transaction = tx; + value.CommandText = + "INSERT INTO trial_values (trial_id, objective, value, value_type) VALUES (last_insert_rowid(), 0, 2.0, 'FINITE')"; + value.ExecuteNonQuery(); + } + tx.Commit(); + } + + var study = Optuna.LoadStudy("many", new RDBStorage(url)); + study.Trials.Should().HaveCount(running + 2, "the first read has no watermark yet"); + // The second read sends every running id below the COMPLETE trial; Optuna answers it (or falls back). + study.Trials.Should().HaveCount(running + 2); + } + + /// <summary> + /// QA-71: on SQLite, Optuna reads a study's and a trial's user and system attributes in key order, the port in + /// insertion order. Optuna's queries have no <c>ORDER BY</c> (<c>StudyUserAttributeModel.where_study_id</c>, the + /// <c>selectinload</c> of a trial's attributes), and SQLite answers <c>WHERE study_id = ?</c> / + /// <c>WHERE trial_id IN (...)</c> through the unique <c>(study_id, key)</c> / <c>(trial_id, key)</c> autoindex + /// (<c>EXPLAIN QUERY PLAN</c>: <c>SEARCH ... USING INDEX sqlite_autoindex_..._1</c>), so the rows come sorted by + /// key. The port's queries order by the attribute id. + /// </summary> + /// <remarks> + /// Measured with Optuna 5.0.0 / SQLAlchemy 2.0.45 / SQLite 3.51: study user attributes set as <c>zz, b, m</c> read + /// back <c>b, m, zz</c> through <c>study.user_attrs</c> and <c>load_study(...).user_attrs</c>; system attributes + /// <c>q, d</c> as <c>d, q</c>; trial user attributes <c>k, a</c> as <c>a, k</c> through <c>study.trials</c>, + /// <c>get_trial</c> and <c>best_trial</c>. <c>get_all_studies()</c> scans the whole attribute table (no + /// <c>WHERE</c>, <c>SCAN study_user_attributes</c>), so its summaries keep insertion order (<c>zz, b, m</c>), as + /// the port's do. The in-memory and journal storages keep insertion order in both. Parameters and intermediate + /// values already match (Optuna sorts parameters by <c>param_id</c>; intermediate values come by step through + /// the same kind of index, as in the port). Only key order differs; no sampler depends on it (they read system + /// attributes by key, CMA-ES sorts its keys). + /// <b>Fixed 2026-11-12:</b> study and trial attribute reads order by <c>"key"</c> (the unique index's order); + /// <c>get_all_studies</c> keeps insertion order, as Optuna's table scan does. + /// </remarks> + [TestMethod] + public void AttributeReads_ComeBackInKeyOrderLikeOptunasIndexScan() + { + string path = Path.Combine(Path.GetTempPath(), $"optunasharp-rdb-qa71-{Guid.NewGuid():N}.db"); + _tempFiles.Add(path); + var storage = new RDBStorage("sqlite:///" + path.Replace('\\', '/')); + var study = Optuna.CreateStudy(studyName: "attrs", storage: storage); + foreach (var key in new[] { "zz", "b", "m" }) + study.SetUserAttr(key, 1L); + int studyId = storage.GetStudyIdFromName("attrs"); + storage.SetStudySystemAttr(studyId, "q", 1L); + storage.SetStudySystemAttr(studyId, "d", 1L); + var trial = study.Ask(); + trial.SetUserAttr("k", 1L); + trial.SetUserAttr("a", 2L); + study.Tell(trial, 1.0); + + study.UserAttrs.Keys.Should().Equal(new[] { "b", "m", "zz" }, "Optuna's study.user_attrs comes through the (study_id, key) index"); + storage.GetStudySystemAttrs(studyId).Keys.Should().Equal("d", "q"); + study.Trials[0].UserAttrs.Keys.Should().Equal(new[] { "a", "k" }, "Optuna's trial reads come through the (trial_id, key) index"); + storage.GetAllStudies()[0].UserAttrs.Keys.Should().Equal(new[] { "zz", "b", "m" }, "get_all_studies scans the table in insertion order"); + } + + /// <summary> + /// QA-75: opening a database whose schema predates the head revision without <c>skip_compatibility_check</c> + /// raises Optuna's <c>RuntimeError</c> naming the runtime version as <c>version.__version__</c>, i.e. + /// <c>5.0.0</c>; the port interpolates <c>OptunaSharpVersion.OptunaCompatibilityTarget</c>, which is + /// <c>"5.0"</c>, so the verbatim message differs (both the SQLite and the EF Core storage use it). + /// </summary> + /// <remarks> + /// Measured on copies of every Optuna upgrade-test asset (<c>refs/optuna/tests/storages_tests/rdb_tests/ + /// test_upgrade_assets</c>): the nine pre-3.2 databases give the same message on both sides except + /// <c>5.0.0</c> / <c>5.0</c>; with <c>skip_compatibility_check=True</c> both open them and report the same + /// current / head revisions and studies. + /// <b>Fixed 2026-11-12:</b> <c>OptunaSharpVersion.OptunaCompatibilityTarget</c> is <c>"5.0.0"</c>, Optuna's + /// <c>__version__</c>. + /// </remarks> + [TestMethod] + public void OldSchemaDatabase_CompatibilityErrorNamesOptunasFullVersion() + { + string asset = Path.Combine(RepoRoot(), "refs", "optuna", "tests", "storages_tests", "rdb_tests", + "test_upgrade_assets", "3.0.0.a.db"); + if (!File.Exists(asset)) + Assert.Inconclusive("refs/optuna submodule not initialized (`git submodule update --init refs/optuna`)."); + string path = Path.Combine(Path.GetTempPath(), $"optunasharp-rdb-qa75-{Guid.NewGuid():N}.db"); + File.Copy(asset, path); + _tempFiles.Add(path); + + Action open = () => new RDBStorage("sqlite:///" + path.Replace('\\', '/')); + + open.Should().Throw<NumSharp.RuntimeError>().WithMessage( + "The runtime optuna version 5.0.0 is no longer compatible with the table schema (set up by optuna 3.0.0). " + + "Please execute `$ optuna storage upgrade --storage $STORAGE_URL` for upgrading the storage."); + } + + /// <summary> + /// QA-74 (SQLite half): <c>RDBStorage(url, skip_table_creation=True)</c> over a database without Optuna's tables + /// fails in Optuna's constructor. Its version manager reads <c>version_info</c> inside + /// <c>_create_scoped_session</c>, which turns the <c>OperationalError</c> ("no such table: version_info") into + /// <c>StorageInternalError</c> with the commit message, even with <c>skip_compatibility_check=True</c>. The port + /// constructs the storage and fails later, on its first read, with Microsoft.Data.Sqlite's + /// <c>SqliteException</c> ("SQLite Error 1: 'no such table: studies'."). + /// </summary> + /// <remarks> + /// Measured with Optuna 5.0.0 / SQLAlchemy 2.0.45 on a fresh empty file: both keyword combinations raise + /// <c>optuna.exceptions.StorageInternalError</c> from the constructor (the cause chains the + /// <c>sqlite3.OperationalError</c>). Code that wraps storage creation in <c>except StorageInternalError</c> to + /// detect an uninitialized database sees nothing from the port's constructor and an unrelated exception type + /// afterwards. + /// <b>Fixed 2026-11-12:</b> under <c>skip_table_creation</c> the version-info step only reads <c>version_info</c>, and a + /// database error there becomes <c>StorageInternalError</c> in the constructor, as Optuna's scoped session makes it. + /// </remarks> + [TestMethod] + public void SkipTableCreation_OverAnEmptyDatabase_RaisesStorageInternalErrorLikeOptuna() + { + string path = Path.Combine(Path.GetTempPath(), $"optunasharp-rdb-qa74-{Guid.NewGuid():N}.db"); + _tempFiles.Add(path); + string url = "sqlite:///" + path.Replace('\\', '/'); + const string optunaCommitMessage = + "An exception is raised during the commit. This typically happens due to invalid data in the commit, " + + "e.g. exceeding max length. "; + + Action open = () => new RDBStorage(url, skipTableCreation: true); + Action openSkippingTheCheck = () => new RDBStorage(url, skipCompatibilityCheck: true, skipTableCreation: true); + + open.Should().Throw<StorageInternalError>().WithMessage(optunaCommitMessage); + openSkippingTheCheck.Should().Throw<StorageInternalError>().WithMessage(optunaCommitMessage); + } + + /// <summary>Returns the repository root, two levels above this source file, wherever the test binaries were built.</summary> + /// <param name="thisFile">Filled in by the compiler with this file's path.</param> + /// <returns>The absolute repository root.</returns> + private static string RepoRoot([System.Runtime.CompilerServices.CallerFilePath] string? thisFile = null) + => Path.GetFullPath(Path.Combine(Path.GetDirectoryName(thisFile)!, "..", "..")); +} diff --git a/test/OptunaSharp.Tests.Storage/SqliteRdbStorageTests.cs b/test/OptunaSharp.Tests.Storage/SqliteRdbStorageTests.cs index 1aa7b99..436a236 100644 --- a/test/OptunaSharp.Tests.Storage/SqliteRdbStorageTests.cs +++ b/test/OptunaSharp.Tests.Storage/SqliteRdbStorageTests.cs @@ -56,6 +56,157 @@ private string TempDbPath() private static OrderedDict<string, BaseDistribution> QuadDist() => new() { ["x"] = new FloatDistribution(-10, 10) }; + // ------------------------------------------------------------------ plan 13: bulk attribute writes (S8) + + /// <summary> + /// Plan 13, item S8: a batch of trial and study attributes on SQLite leaves exactly what one single write per + /// entry leaves (keys, values and their JSON), read back through a fresh storage on the same file. + /// </summary> + [TestMethod] + public void BulkAttributes_LeaveWhatSingleWritesLeave() + { + string path = TempDbPath(); + string url = $"sqlite:///{path.Replace('\\', '/')}"; + var attrs = new OrderedDict<string, object?> + { + ["seed"] = 7L, ["ratio"] = 0.25, ["name"] = "run", ["flag"] = true, ["none"] = null, + ["list"] = new List<object?> { 1L, "two" }, + }; + int bulkStudy, singleStudy, bulkTrial, singleTrial; + using (var storage = new RDBStorage(url)) + { + bulkStudy = storage.CreateNewStudy(new[] { StudyDirection.Minimize }, "bulk"); + singleStudy = storage.CreateNewStudy(new[] { StudyDirection.Minimize }, "single"); + bulkTrial = storage.CreateNewTrial(bulkStudy); + singleTrial = storage.CreateNewTrial(singleStudy); + storage.SetTrialUserAttr(bulkTrial, "name", "earlier"); + storage.SetTrialUserAttr(singleTrial, "name", "earlier"); + + storage.SetTrialUserAttrs(bulkTrial, attrs); + storage.SetTrialSystemAttrs(bulkTrial, attrs); + storage.SetStudyUserAttrs(bulkStudy, attrs); + storage.SetStudySystemAttrs(bulkStudy, attrs); + foreach (var (key, value) in attrs) + { + storage.SetTrialUserAttr(singleTrial, key, value); + storage.SetTrialSystemAttr(singleTrial, key, value); + storage.SetStudyUserAttr(singleStudy, key, value); + storage.SetStudySystemAttr(singleStudy, key, value); + } + } + + using var reopened = new RDBStorage(url); + static string Describe(IReadOnlyDictionary<string, object?> a) + => string.Join("; ", a.OrderBy(kv => kv.Key, StringComparer.Ordinal).Select(kv => $"{kv.Key}={PyJson.Dumps(kv.Value)}")); + Describe(reopened.GetTrial(bulkTrial).UserAttrs).Should().Be(Describe(reopened.GetTrial(singleTrial).UserAttrs)); + Describe(reopened.GetTrial(bulkTrial).SystemAttrs).Should().Be(Describe(reopened.GetTrial(singleTrial).SystemAttrs)); + Describe(reopened.GetStudyUserAttrs(bulkStudy)).Should().Be(Describe(reopened.GetStudyUserAttrs(singleStudy))); + Describe(reopened.GetStudySystemAttrs(bulkStudy)).Should().Be(Describe(reopened.GetStudySystemAttrs(singleStudy))); + reopened.GetTrial(bulkTrial).UserAttrs["name"].Should().Be("run", "the batch overwrites an earlier value"); + } + + /// <summary> + /// A batch is one transaction: a value that cannot be serialized, in the middle of the batch, rolls back the + /// entries before it; a finished trial and an unknown study refuse the batch with nothing written. + /// </summary> + [TestMethod] + public void BulkAttributes_AreAllOrNothing() + { + using RDBStorage storage = NewMemoryStorage(); + int studyId = storage.CreateNewStudy(new[] { StudyDirection.Minimize }, "atomic"); + int trialId = storage.CreateNewTrial(studyId); + var poisoned = new OrderedDict<string, object?> { ["ok"] = 1L, ["bad"] = new object(), ["after"] = 2L }; + + Action trialBatch = () => storage.SetTrialUserAttrs(trialId, poisoned); + Action studyBatch = () => storage.SetStudyUserAttrs(studyId, poisoned); + trialBatch.Should().Throw<TypeError>(); + studyBatch.Should().Throw<TypeError>(); + storage.GetTrial(trialId).UserAttrs.Should().BeEmpty("the transaction rolled the first entry back"); + storage.GetStudyUserAttrs(studyId).Should().BeEmpty(); + + storage.SetTrialStateValues(trialId, TrialState.Complete, new[] { 1.0 }); + Action finished = () => storage.SetTrialSystemAttrs(trialId, new OrderedDict<string, object?> { ["x"] = 1L }); + Action unknownStudy = () => storage.SetStudySystemAttrs(424242, new OrderedDict<string, object?> { ["x"] = 1L }); + finished.Should().Throw<UpdateFinishedTrialError>(); + unknownStudy.Should().Throw<KeyError>(); + storage.GetTrial(trialId).SystemAttrs.Should().NotContainKey("x"); + } + + /// <summary> + /// A study on SQLite runs through <see cref="CachedStorage" />, which forwards a trial's and a study's batch to the + /// backend whole; the trial and the study see their attributes, and so does a fresh storage. + /// </summary> + [TestMethod] + public void BulkAttributes_ThroughCachedStorage_ReachTheDatabase() + { + string path = TempDbPath(); + string url = $"sqlite:///{path.Replace('\\', '/')}"; + var rdb = new RDBStorage(url); + Study study = Optuna.CreateStudy(storage: rdb, studyName: "cached"); + study.Storage.Should().BeOfType<CachedStorage>(); + Trial trial = study.Ask(); + trial.SetUserAttrs(new OrderedDict<string, object?> { ["a"] = 1L, ["b"] = "two" }); + study.SetUserAttr(new OrderedDict<string, object?> { ["c"] = 3.5 }); + study.Tell(trial, 1.0); + + trial.UserAttrs.Keys.Should().Contain(new[] { "a", "b" }); + study.UserAttrs["c"].Should().Be(3.5); + rdb.Dispose(); + using var reopened = new RDBStorage(url); + int studyId = reopened.GetStudyIdFromName("cached"); + reopened.GetAllTrials(studyId)[0].UserAttrs.Should().Contain(new KeyValuePair<string, object?>("b", "two")); + reopened.GetStudyUserAttrs(studyId)["c"].Should().Be(3.5); + } + + // ------------------------------------------------------------------ plan 13: one parse per distribution text + + /// <summary> + /// Plan 13 (docs/plans/13-rustuna-derived-performance.md), item S9 as measured: a load parses each distinct + /// distribution text once. Reloading a study gives every trial of a parameter the same distribution object, equal + /// to a fresh parse of its stored text; a different text (a -0.0 bound, another range, a categorical) is its own + /// object, and the deprecated types are never shared, so their warnings fire per use as before. + /// </summary> + [TestMethod] + public void Reload_ParsesEachDistributionTextOnce_SharingOnlyTheCurrentTypes() + { + string path = TempDbPath(); + string url = $"sqlite:///{path.Replace('\\', '/')}"; + int studyId; + using (var storage = new RDBStorage(url)) + { + studyId = storage.CreateNewStudy(new[] { StudyDirection.Minimize }, "shared-distributions"); + for (int n = 0; n < 6; n++) + { + int id = storage.CreateNewTrial(studyId); + storage.SetTrialParam(id, "x", 0.25 * n, new FloatDistribution(0, 2)); + storage.SetTrialParam(id, "c", n % 2, new CategoricalDistribution(new CategoricalChoice[] { "a", "b" })); + storage.SetTrialParam(id, "z", 0.5, n < 3 ? new FloatDistribution(0.0, 1) : new FloatDistribution(-0.0, 1)); +#pragma warning disable CS0618 // the deprecated family is the point of this case + storage.SetTrialParam(id, "u", 0.5, new UniformDistribution(0, 1)); +#pragma warning restore CS0618 + storage.SetTrialStateValues(id, TrialState.Complete, new[] { (double)n }); + } + } + + using var reopened = new RDBStorage(url); + List<FrozenTrial> trials = reopened.GetAllTrials(studyId, deepcopy: false); + trials.Should().HaveCount(6); + foreach (FrozenTrial trial in trials) + { + trial.Distributions["x"].Should().BeSameAs(trials[0].Distributions["x"]); + trial.Distributions["c"].Should().BeSameAs(trials[0].Distributions["c"]); + foreach (var (name, distribution) in trial.Distributions) + distribution.Should().Be(Distribution.FromJson(Distribution.ToJson(distribution)), name); + } + trials[0].Distributions["z"].Should().BeSameAs(trials[2].Distributions["z"]); + trials[3].Distributions["z"].Should().BeSameAs(trials[5].Distributions["z"]); + trials[0].Distributions["z"].Should().NotBeSameAs(trials[3].Distributions["z"], "-0.0 is stored as its own text"); + trials[3].Distributions["z"].ToString().Should().Contain("low=-0.0"); + trials[0].Distributions["u"].Should().NotBeSameAs(trials[1].Distributions["u"], "deprecated types are never shared"); + trials.Select(t => t.Params["x"]).Should().Equal(0.0, 0.25, 0.5, 0.75, 1.0, 1.25); + trials.Select(t => t.Params["c"]).Should().Equal("a", "b", "a", "b", "a", "b"); + } + // ------------------------------------------------------------------ schema / version pins [TestMethod] @@ -470,6 +621,66 @@ public void FileStorage_PersistsAcrossReopen() } } + /// <summary> + /// Plan 14: <see cref="CachedStorage" />'s refresh asks the SQLite storage for <c>trial_id > watermark</c> plus the + /// running trials it tracks below it, now as a <c>UNION ALL</c> of two indexable halves instead of Optuna's OR. Two + /// workers share one database file: the other worker leaves trials running below the watermark, completes trials + /// around them, then finishes the running ones out of order. After every step the cached view must equal a fresh + /// storage's read of the file (numbers, states, parameters, values and intermediate values, in order). + /// </summary> + [TestMethod] + public void CachedRefresh_WithRunningTrialsBelowTheWatermark_EqualsAFreshRead() + { + string url = $"sqlite:///{TempDbPath().Replace('\\', '/')}"; + using var other = new RDBStorage(url); + int studyId = other.CreateNewStudy(new[] { StudyDirection.Minimize }, "s"); + using var backend = new RDBStorage(url); + var cached = new CachedStorage(backend); + + void AssertSameAsFresh(string step) + { + using var fresh = new RDBStorage(url); + var expected = fresh.GetAllTrials(studyId); + var actual = cached.GetAllTrials(studyId); + actual.Select(t => t.Number).Should().Equal(expected.Select(t => t.Number), step); + for (int i = 0; i < expected.Count; i++) + { + actual[i].State.Should().Be(expected[i].State, $"{step}: trial {i} state"); + actual[i].Params.Should().BeEquivalentTo(expected[i].Params, $"{step}: trial {i} params"); + (actual[i].Values ?? new List<double>()).Should().Equal(expected[i].Values ?? new List<double>(), $"{step}: trial {i} values"); + actual[i].IntermediateValues.Should().BeEquivalentTo(expected[i].IntermediateValues, $"{step}: trial {i} intermediate values"); + } + } + + int Finished(int value) + { + int id = other.CreateNewTrial(studyId); + other.SetTrialParam(id, "x", value * 0.5, new FloatDistribution(-100, 100)); + other.SetTrialStateValues(id, TrialState.Complete, new[] { value * 0.25 }); + return id; + } + + int stale1 = other.CreateNewTrial(studyId); + Finished(1); + int stale2 = other.CreateNewTrial(studyId); + Finished(2); + AssertSameAsFresh("two running trials below the watermark"); + + for (int i = 3; i < 23; i++) + Finished(i); + other.SetTrialParam(stale2, "x", 7.0, new FloatDistribution(-100, 100)); + other.SetTrialIntermediateValue(stale2, 0, 1.5); + AssertSameAsFresh("more trials completed; a running one changed"); + + other.SetTrialStateValues(stale2, TrialState.Complete, new[] { -1.0 }); + AssertSameAsFresh("the later running trial finished first"); + + other.SetTrialParam(stale1, "x", -3.0, new FloatDistribution(-100, 100)); + other.SetTrialStateValues(stale1, TrialState.Fail, null); + Finished(99); + AssertSameAsFresh("the earlier running trial failed; one more completed"); + } + [TestMethod] public void GetStorage_WrapsRdbStorage_InCachedStorage() { diff --git a/test/OptunaSharp.Tests/Concurrency/ParallelReads.cs b/test/OptunaSharp.Tests/Concurrency/ParallelReads.cs index f4817b9..ad141d0 100644 --- a/test/OptunaSharp.Tests/Concurrency/ParallelReads.cs +++ b/test/OptunaSharp.Tests/Concurrency/ParallelReads.cs @@ -2,6 +2,7 @@ using System.Collections.Generic; using System.Globalization; using System.Linq; +using System.Runtime.ExceptionServices; using System.Threading; using OptunaSharp.Samplers; @@ -31,8 +32,8 @@ namespace OptunaSharp.Tests.Concurrency; /// <para> /// <see cref="Fire" /> runs whatever interleaving the threads take, so a sampler whose result depends on which /// reads landed before which writes repeats a varying count. <see cref="ReadInLockstep" /> makes the one -/// interleaving where every read of a round lands before any write, on one thread, so its counts repeat exactly -/// and a test can pin them. +/// interleaving where every read of a round lands before any write, in a fixed order (on the calling thread, or +/// each read on a thread of its own), so its counts repeat exactly and a test can pin them. /// </para> /// </remarks> internal static class ParallelReads @@ -168,20 +169,35 @@ internal static Outcome Fire(BaseSampler sampler, bool multiObjective, Space spa /// repeats exactly, for counts a test can pin. /// </summary> /// <remarks> - /// Independent parameters (all of BruteForce's and Grid's, the startup draws of the others) are sampled in the - /// suggests, one trial after another, so each of those reads sees the earlier trials' parameters, as a sampler - /// monitor serializes them in <see cref="Fire" /> too. Each relative read starts from an empty history cache, as a - /// trial's first read on a thread of its own does. + /// <para> + /// Independent parameters (all of BruteForce's and Grid's, the startup draws of the others) are sampled in the + /// suggests, one trial after another, so each of those reads sees the earlier trials' parameters, as a sampler + /// monitor serializes them in <see cref="Fire" /> too. Each relative read starts from an empty history cache, + /// as a trial's first read on a thread of its own does. + /// </para> + /// <para> + /// <b>Which thread reads.</b> By default every relative read runs on the calling thread: a batch one caller asks + /// before telling any of it, as Optuna's batch-optimization tutorial does. The genetic samplers follow Optuna + /// there and do not steer the batch's children apart (QA-57). With <paramref name="readsOnOwnThreads" /> each + /// relative read runs on a thread of its own, started and joined in turn, so the order of the reads, and with + /// it the counts, stay exactly repeatable while every trial is asked for by a different thread, as concurrent + /// workers ask. + /// </para> /// </remarks> /// <param name="sampler">The study's sampler, shared by every trial.</param> /// <param name="multiObjective">Whether the study minimizes two objectives instead of one.</param> /// <param name="space">The search space each trial suggests.</param> /// <param name="rounds">How many rounds to read; each asks and tells <paramref name="shooters" /> trials.</param> /// <param name="shooters">How many trials read in each round before any of them writes.</param> + /// <param name="readsOnOwnThreads"> + /// Whether each trial's relative read runs on a dedicated thread (concurrent workers) rather than on the calling + /// thread (one caller's batch); see the remarks. + /// </param> /// <returns>The trial count and the repeated points, classified as by <see cref="Fire" />.</returns> - /// <exception cref="Exception">Whatever the sampler, a suggest or a tell throws, unchanged.</exception> + /// <exception cref="Exception">Whatever the sampler, a suggest or a tell throws, unchanged (a read's on its own thread too).</exception> internal static Outcome ReadInLockstep( - BaseSampler sampler, bool multiObjective, Space space, int rounds, int shooters = 8) + BaseSampler sampler, bool multiObjective, Space space, int rounds, int shooters = 8, + bool readsOnOwnThreads = false) { Study study = multiObjective ? Optuna.CreateStudy(sampler: sampler, directions: new[] { StudyDirection.Minimize, StudyDirection.Minimize }) @@ -195,6 +211,29 @@ internal static Outcome ReadInLockstep( foreach (Trial trial in trials) { + if (readsOnOwnThreads) + { + // A fresh thread per read, joined before the next starts: the reads keep their order, and each + // trial's child is claimed on a thread of its own, as a concurrent worker's is. A new thread's history + // cache is empty, so no reset is needed. A failure is rethrown here with its original stack. + ExceptionDispatchInfo? failure = null; + var reader = new Thread(() => + { + try + { + _ = trial.RelativeParams; + } + catch (Exception e) + { + failure = ExceptionDispatchInfo.Capture(e); + } + }); + reader.Start(); + reader.Join(); + failure?.Throw(); + continue; + } + // In Fire each trial reads on its own thread, whose history cache its first read fills; on this one // thread the previous trial's read filled it, so drop it and let this read take its own snapshot. study.ThreadLocal.CachedAllTrials = null; diff --git a/test/OptunaSharp.Tests/Concurrency/SamplerParallelReadTests.cs b/test/OptunaSharp.Tests/Concurrency/SamplerParallelReadTests.cs index 6d426f3..acfa57d 100644 --- a/test/OptunaSharp.Tests/Concurrency/SamplerParallelReadTests.cs +++ b/test/OptunaSharp.Tests/Concurrency/SamplerParallelReadTests.cs @@ -28,7 +28,8 @@ namespace OptunaSharp.Tests.Concurrency; /// applies: seeded results, Optuna parity included, are unchanged. /// </para> /// <para> -/// The volleys run on eight threads and in lockstep (every read of a round before any write). Rounds release a +/// The volleys run on eight threads and in lockstep (every read of a round before any write, each on a thread of +/// its own: the genetic samplers steer apart only children asked on different threads, QA-57). Rounds release a /// generation together, so <see cref="ParallelReads_GenerationSpanningTwoRounds_HandsNoCandidateTwice" /> uses a /// population larger than a round, and /// <see cref="Optimize_SixteenWorkers_SamplerThatNeverRepeats_EvaluatesNoPointTwice" /> runs real @@ -44,6 +45,12 @@ namespace OptunaSharp.Tests.Concurrency; /// may repeat one point a volley through Optuna's per-trial seeding (<see cref="SeedCollisionOnce" />). /// </para> /// <para> +/// REMBO repeats told trials' points as well, one trial at a time too (2026-11-14). That is an open bug, not a +/// design choice, so it stays out of <see cref="RepeatsFinishedPoints" />: its whole-run case is held out as +/// <see cref="Optimize_SixteenWorkers_Rembo_EvaluatesNoPointTwice" />, and its volleys, which have not repeated +/// a point, are still asserted in full. +/// </para> +/// <para> /// The record of handed-out points lives in the sampler instance, so these guarantees hold for the asks one /// process makes through one sampler: two processes sharing a storage are steered apart only by the slot and /// row stamps written to the storage. @@ -125,11 +132,15 @@ public void ParallelReads_SharedSampler_HandsNoNewPointToTwoTrials(string name) bool multiObjective = SamplerNJobsSweepTests.MultiObjective.Contains(name); // On eight threads, whatever interleaving they take; then in lockstep, where every read of a round lands - // before any write, the interleaving a sampler that waits for stored parameters handles worst. + // before any write, the interleaving a sampler that waits for stored parameters handles worst. The lockstep + // reads run on threads of their own, as concurrent workers' do: the genetic samplers steer apart only children + // asked on different threads, and leave one caller's batch to Optuna's draws (QA-57, pinned against Optuna by + // Run2SamplerParityBugTests.Nsga_BatchedAskTell_PartialChildIsNotRedrawn). ParallelReads.Outcome threaded = ParallelReads.Fire( SamplerNJobsSweepTests.Make(name), multiObjective, ParallelReads.Space.Continuous, Rounds); ParallelReads.Outcome lockstep = ParallelReads.ReadInLockstep( - SamplerNJobsSweepTests.Make(name), multiObjective, ParallelReads.Space.Continuous, Rounds); + SamplerNJobsSweepTests.Make(name), multiObjective, ParallelReads.Space.Continuous, Rounds, + readsOnOwnThreads: true); AssertNoDuplicates(name, threaded, Rounds); AssertNoDuplicates(name, lockstep, Rounds); @@ -170,7 +181,7 @@ public void ParallelReads_GenerationSpanningTwoRounds_HandsNoCandidateTwice(stri "de" => new DifferentialEvolutionSampler(seed: 1, popsize: 12), "pso" => new PsoSampler(seed: 1, popsize: 12), _ => new LmCmaSampler(seed: 1, popsize: 12), - }, false, ParallelReads.Space.Continuous, Rounds); + }, false, ParallelReads.Space.Continuous, Rounds, readsOnOwnThreads: true); AssertNoDuplicates(name, threaded, Rounds); AssertNoDuplicates(name, lockstep, Rounds); @@ -204,7 +215,6 @@ public void ParallelReads_GenerationSpanningTwoRounds_HandsNoCandidateTwice(stri [DataRow("snes")] [DataRow("gp")] [DataRow("turbo")] - [DataRow("rembo")] public void Optimize_SixteenWorkers_SamplerThatNeverRepeats_EvaluatesNoPointTwice(string name) { using var quiet = new QuietLogs(); @@ -220,6 +230,47 @@ public void Optimize_SixteenWorkers_SamplerThatNeverRepeats_EvaluatesNoPointTwic AssertNoPointEvaluatedTwice(name, study, trials); } + /// <summary> + /// REMBO's row of <see cref="Optimize_SixteenWorkers_SamplerThatNeverRepeats_EvaluatesNoPointTwice" />, held out as + /// an open bug: REMBO's paper-faithful optimizer proposes points it has already evaluated, with one worker as well + /// (<see cref="RandomEmbeddingSamplerTests.Optimize_OneWorker_EvaluatesNoPointTwice" />), so a 16-worker run + /// repeats a point whenever its interleaving steers the seeded trajectory into that state. Seed 1, used here, + /// repeats nothing with one worker; an interleaving acts as another seed. + /// </summary> + /// <remarks> + /// <para> + /// <b>Seen in CI.</b> The row failed 2 of about 45 runs on the 1.1.0 release branch (net8.0), for example + /// "rembo evaluated these points more than once: x=9.999999999999998|y=-3.6688215204910746|z=0.9715361410124286 + /// x4". Measured locally on 2026-11-14: 3 of 80 runs repeated a point on 32 CPUs and 0 of 80 on 4 (.NET 11). + /// </para> + /// <para> + /// <b>Not a lost read.</b> A storage decorator numbering every read and write under one lock traced 220 runs + /// (13,200 proposals, .NET 10): no proposal missed an earlier proposal's latent stamp. The running trials are + /// read inside the sampler's lock, the history right after, and every stamp is written before the lock is + /// released. Each repeated point was visible to the proposal that repeated it, as a finished observation or + /// as a running trial's pessimistic lie, and the acquisition's optimizers still returned the same cell of + /// DIRECT's grid. The repeats were exact latent repeats at corners of the latent box <c>[-√2, √2]²</c>, such + /// as (−√2 + 2.4e-5, √2 − 2.4e-5), the center of DIRECT's corner cell after 10 trisections, at poor values + /// (about 72 for the point in the CI message, against a minimum of 0); DIRECT is deterministic, so the same + /// cell is the same point, bit for bit. One worker repeats such corners too (seed 48 there), alongside the two + /// routes that test documents. + /// </para> + /// <para> + /// One concurrency imprecision showed on the way: in about 1.4 % of the proposals, a trial told between the two + /// reads is in both, so the acquisition's GP holds its real value and its lie at one input. No repeat coincided + /// with one. + /// </para> + /// <para> + /// Once REMBO no longer proposes an evaluated point, remove <c>[OpenBugs]</c> and return <c>rembo</c> to the + /// rows of the shared test. + /// </para> + /// </remarks> + /// <exception cref="AssertFailedException">REMBO evaluated a point twice (today in a few percent of runs).</exception> + [TestMethod] + [OpenBugs] + public void Optimize_SixteenWorkers_Rembo_EvaluatesNoPointTwice() + => Optimize_SixteenWorkers_SamplerThatNeverRepeats_EvaluatesNoPointTwice("rembo"); + /// <summary> /// SAASBO's Sobol startup design: every trial of a round used to take the row the completed count names, so 7 of /// 8 parallel reads received one point. With 12 startup trials the second round needs rows 8 to 15, past the @@ -276,7 +327,8 @@ public void ParallelReads_Grid_HandsEveryTrialADistinctGridPoint() }, seed: 1); ParallelReads.Outcome threaded = ParallelReads.Fire(Grid(), false, ParallelReads.Space.Discrete, DiscreteRounds); - ParallelReads.Outcome lockstep = ParallelReads.ReadInLockstep(Grid(), false, ParallelReads.Space.Discrete, DiscreteRounds); + ParallelReads.Outcome lockstep = ParallelReads.ReadInLockstep( + Grid(), false, ParallelReads.Space.Discrete, DiscreteRounds, readsOnOwnThreads: true); AssertNoDuplicates("grid", threaded, DiscreteRounds); AssertNoDuplicates("grid", lockstep, DiscreteRounds); @@ -305,7 +357,7 @@ public void ParallelReads_BruteForce_NeverHandsOutAPointARunningTrialHolds(bool DiscreteRounds); ParallelReads.Outcome lockstep = ParallelReads.ReadInLockstep( new BruteForceSampler(seed: 1, avoidPrematureStop: avoidPrematureStop), false, ParallelReads.Space.Discrete, - DiscreteRounds); + DiscreteRounds, readsOnOwnThreads: true); AssertNoDuplicates("bruteforce", threaded, DiscreteRounds); AssertNoDuplicates("bruteforce", lockstep, DiscreteRounds); diff --git a/test/OptunaSharp.Tests/Concurrency/StorageConcurrencyCoverageTests.cs b/test/OptunaSharp.Tests/Concurrency/StorageConcurrencyCoverageTests.cs index 42367c6..3596dbc 100644 --- a/test/OptunaSharp.Tests/Concurrency/StorageConcurrencyCoverageTests.cs +++ b/test/OptunaSharp.Tests/Concurrency/StorageConcurrencyCoverageTests.cs @@ -58,9 +58,10 @@ public void TearDown() /// <summary> /// Shooter 0 reads every trial without a deep copy, fingerprints each record, waits a moment, and fingerprints the /// same record objects again, over and over. Meanwhile every other shooter writes its own trial (attributes, - /// reports, parameters). The two fingerprints always match: the storage replaces a record on every update instead - /// of changing it, so a record a reader holds is never changed under it, as Optuna documents for - /// <c>deepcopy=False</c>. + /// reports, parameters). The two fingerprints always match: a record a reader holds is never changed under it, as + /// Optuna documents for <c>deepcopy=False</c>. The journal replaces a record on every update; the in-memory storage + /// writes a running record in place only while no reader holds it, and the read marks it, so the next write copies + /// it first (plan 13, item S4). /// </summary> /// <param name="setup"><c>memory</c> or <c>journal</c>.</param> [TestMethod] @@ -118,6 +119,77 @@ public void RecordReadWithoutADeepCopy_NeverChangesUnderItsReader_WhileOthersWri changedUnderReader.Should().Be(0, "a record read without a deep copy is never changed under its reader"); } + /// <summary> + /// Plan 13, item S4, through the two reads it added a hand-out to. The in-memory storage writes a running record in + /// place while no reader holds it. Shooter 0 reads the round's trials through the zero-copy view + /// (<see cref="BaseStorage.GetTrialsPrefixView" />) or through <see cref="BaseStorage.GetTrial" />, fingerprints the + /// records it holds, waits a moment and fingerprints them again, over and over, while every other shooter writes + /// its own trial. The two fingerprints always match, and the writers did copy records the reader held, so the race + /// the hand-out guards against was in play. + /// </summary> + /// <param name="readPath"><c>view</c> or <c>get-trial</c>.</param> + [TestMethod] + [DataRow("view")] + [DataRow("get-trial")] + public void RecordReadThroughTheViewOrGetTrial_NeverChangesUnderItsReader_WhileOthersWriteInPlace(string readPath) + { + var storage = new InMemoryStorage(); + Study study = Optuna.CreateStudy(storage: storage, sampler: new RandomSampler(22)); + const int rounds = 30, writes = 30; + var trials = new Trial[Threads]; + int changedUnderReader = 0, reads = 0, firstNumberOfRound = 0; + + using var quiet = new QuietLogs(); + using var gun = new ConcurrencyGun(Threads); + GunReport report = gun.Fire(rounds, + shot => + { + if (shot.Thread == 0) + { + for (int pass = 0; pass < writes * 4; pass++) + { + // Only this round's trials: older ones are finished and no longer written. + List<FrozenTrial> records = readPath == "view" + ? storage.GetTrialsPrefixView(study.StudyId).Skip(firstNumberOfRound).ToList() + : trials.Skip(1).Select(t => storage.GetTrial(t.TrialId)).ToList(); + string[] before = records.Select(Fingerprint).ToArray(); + Thread.SpinWait(2_000); + string[] after = records.Select(Fingerprint).ToArray(); + if (!before.SequenceEqual(after)) + Interlocked.Increment(ref changedUnderReader); + Interlocked.Increment(ref reads); + } + return; + } + Trial trial = trials[shot.Thread]; + for (int k = 0; k < writes; k++) + { + trial.SetUserAttr($"a{k}", k); + trial.Report(k, step: k); + trial.SuggestFloat($"p{k}", 0, 1); + } + }, + beforeRound: _ => + { + for (int t = 1; t < Threads; t++) + trials[t] = study.Ask(); + firstNumberOfRound = trials[1].Number; + }, + afterRound: _ => + { + // Each round's trials finish, so the next round's reads look only at fresh running records. + for (int t = 1; t < Threads; t++) + study.Tell(trials[t], 0.0); + return false; + }); + + report.AssertClean(); + reads.Should().BeGreaterThan(0); + changedUnderReader.Should().Be(0, $"a record read through {readPath} is never changed under its reader"); + storage.WriteCopyCount.Should().BeGreaterThan(rounds * (Threads - 1), + "beyond each trial's own read at Ask, the reader's hand-outs made the writers copy records it held"); + } + /// <summary> /// Every shooter writes a trial of its own at once (user and system attributes, reports, parameters) and then tells /// it. Every write lands, and for a journal a storage that replays the file from scratch sees exactly what the live diff --git a/test/OptunaSharp.Tests/Internal/CPythonOrderOracleTests.cs b/test/OptunaSharp.Tests/Internal/CPythonOrderOracleTests.cs new file mode 100644 index 0000000..95f58fe --- /dev/null +++ b/test/OptunaSharp.Tests/Internal/CPythonOrderOracleTests.cs @@ -0,0 +1,193 @@ +using System; +using System.Collections.Generic; +using System.IO; +using System.Linq; +using System.Security.Cryptography; +using System.Text; +using System.Text.Json; +using AwesomeAssertions; +using OptunaSharp.Internal; +using OptunaSharp.Samplers.Nsgaiii; + +namespace OptunaSharp.Tests.Internal; + +/// <summary> +/// Replays the committed corpus <c>oracle/cpython_order.json</c> (CPython 3.12, recorded by +/// <c>oracle/gen_cpython_order_oracle.py</c>) with no Python: two orders Optuna inherits from CPython itself. +/// <list type="bullet"> +/// <item><description> +/// <see cref="PyIntSet" />: GridSampler's <c>list(set(range(n)) - set(visited) - set(running))</c> and +/// <c>list(set(range(n)) - set(visited))</c>, in slot order (QA-68), over 271 histories up to 70,000 grids. +/// </description></item> +/// <item><description> +/// <see cref="PyListSort" /> with <see cref="NSGAIIIElitePopulationSelectionStrategy.DistanceIndexLessThan" />: +/// NSGA-III's <c>list.sort(reverse=True)</c> on <c>(distance, index)</c> tuples where distances can be NaN +/// (QA-56), over 353 lists up to 1,000 elements, both directions. +/// </description></item> +/// </list> +/// Long results are compared by count, first and last 32 elements, and the SHA-256 of the decimal elements joined by +/// commas, as the generator wrote them. +/// </summary> +[TestClass] +public class CPythonOrderOracleTests +{ + /// <summary>The generator's alphabet: a sort case stores each distance as two of these, its pool index in base 64.</summary> + private const string Alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; + + /// <summary>Every set-difference case yields CPython's iteration order, for both differences GridSampler takes.</summary> + [TestMethod] + public void SetDifferences_IterateInCPythonsSlotOrder() + { + JsonElement corpus = LoadCorpus(); + int checkedCases = 0; + foreach (JsonElement c in corpus.GetProperty("set_difference").EnumerateArray()) + { + int n = c.GetProperty("n").GetInt32(); + HashSet<int> visited = FromBitmap(c.GetProperty("visited").GetString()!, n); + HashSet<int> running = FromBitmap(c.GetProperty("running").GetString()!, n); + + List<int> unvisited = PyIntSet.Range(n).Difference(visited).Difference(running).ToList(); + List<int> unfinished = PyIntSet.Range(n).Difference(visited).ToList(); + + ShouldMatch(unvisited, c.GetProperty("unvisited"), $"n={n}, |visited|={visited.Count}, |running|={running.Count}"); + ShouldMatch(unfinished, c.GetProperty("unfinished"), $"n={n}, |visited|={visited.Count} (unfinished)"); + checkedCases++; + } + checkedCases.Should().Be(271); + } + + /// <summary>The journal's example, spelled out: the fresh table of the difference wraps 8 and 11 onto slots 0 and 3.</summary> + [TestMethod] + public void SetDifference_TheQa68Example_Is_8_11_4() + { + var visited = new HashSet<int> { 0, 1, 2, 3, 5, 6, 7, 9, 10, 12, 13, 14, 15 }; + PyIntSet.Range(16).Difference(visited).Difference(new HashSet<int>()).ToList().Should().Equal(8, 11, 4); + } + + /// <summary>Every sort case leaves the tuples in CPython's order, NaN distances included.</summary> + [TestMethod] + public void TupleSorts_WithNaNDistances_LeaveCPythonsOrder() + { + JsonElement corpus = LoadCorpus(); + int checkedCases = 0; + foreach (JsonElement c in corpus.GetProperty("list_sort").EnumerateArray()) + { + double[] distances = DecodeDistances(c.GetProperty("distances").GetString()!); + bool reverse = c.GetProperty("reverse").GetBoolean(); + var pairs = distances.Select((d, i) => (Distance: d, Index: i)).ToList(); + + PyListSort.Sort(pairs, NSGAIIIElitePopulationSelectionStrategy.DistanceIndexLessThan, reverse); + + ShouldMatch(pairs.Select(p => p.Index).ToList(), c.GetProperty("order"), + $"{distances.Length} distances ({distances.Count(double.IsNaN)} NaN), reverse={reverse}, case {checkedCases}"); + checkedCases++; + } + checkedCases.Should().Be(353); + } + + /// <summary> + /// With a total order the port is an ordinary stable sort: random lists with ties (no NaN) agree with LINQ's stable + /// <c>OrderBy</c>, ascending and descending (CPython's reverse keeps equal elements in their original order). + /// </summary> + [TestMethod] + public void WithATotalOrder_ItIsAStableSort() + { + var rng = new Random(7); + for (int trial = 0; trial < 200; trial++) + { + int size = rng.Next(0, 600); + var items = Enumerable.Range(0, size).Select(i => (Key: rng.Next(0, 12), Original: i)).ToList(); + var ascending = items.ToList(); + PyListSort.Sort(ascending, (x, y) => x.Key < y.Key); + ascending.Should().Equal(items.OrderBy(t => t.Key).ToList()); + + var descending = items.ToList(); + PyListSort.Sort(descending, (x, y) => x.Key < y.Key, reverse: true); + descending.Should().Equal(items.OrderByDescending(t => t.Key).ToList()); + } + } + + /// <summary>Null arguments are refused; a negative set size is refused.</summary> + [TestMethod] + public void InvalidArguments_AreRefused() + { + Action noList = () => PyListSort.Sort<int>(null!, (x, y) => x < y); + Action noComparison = () => PyListSort.Sort(new List<int> { 2, 1 }, null!); + Action negativeRange = () => PyIntSet.Range(-1); + Action noOther = () => PyIntSet.Range(3).Difference(null!); + noList.Should().Throw<ArgumentNullException>(); + noComparison.Should().Throw<ArgumentNullException>(); + negativeRange.Should().Throw<ArgumentOutOfRangeException>(); + noOther.Should().Throw<ArgumentNullException>(); + } + + /// <summary>Loads the committed corpus copied next to the test assembly.</summary> + /// <returns>The corpus root: <c>set_difference</c> and <c>list_sort</c> case arrays.</returns> + /// <exception cref="FileNotFoundException">The corpus was not copied to the output directory.</exception> + private static JsonElement LoadCorpus() + { + string path = Path.Combine(AppContext.BaseDirectory, "oracle", "cpython_order.json"); + return JsonDocument.Parse(File.ReadAllText(path)).RootElement.Clone(); + } + + /// <summary>Decodes the generator's base64 little-endian bitmap of a set of ints in <c>range(n)</c>.</summary> + /// <param name="base64">The bitmap text.</param> + /// <param name="n">The universe size.</param> + /// <returns>The set the bitmap encodes.</returns> + private static HashSet<int> FromBitmap(string base64, int n) + { + byte[] data = Convert.FromBase64String(base64); + var set = new HashSet<int>(); + for (int k = 0; k < n; k++) + { + if ((data[k >> 3] & (1 << (k & 7))) != 0) + set.Add(k); + } + return set; + } + + /// <summary> + /// Decodes a sort case's distances: two alphabet characters per distance, a pool index whose values are NaN, + /// +inf, -inf, 0.0, -0.0 and then k / 4090 (the same double as Python's, IEEE division being exact-rounded). + /// </summary> + /// <param name="text">The encoded distances.</param> + /// <returns>The distances.</returns> + private static double[] DecodeDistances(string text) + { + var values = new double[text.Length / 2]; + for (int i = 0; i < values.Length; i++) + { + int code = (Alphabet.IndexOf(text[2 * i]) << 6) | Alphabet.IndexOf(text[2 * i + 1]); + values[i] = code switch + { + 0 => double.NaN, + 1 => double.PositiveInfinity, + 2 => double.NegativeInfinity, + 3 => 0.0, + 4 => -0.0, + _ => (code - 5) / 4090.0, + }; + } + return values; + } + + /// <summary>Asserts an order equals a corpus description: the full list, or count, head, tail and SHA-256.</summary> + /// <param name="actual">The order the port produced.</param> + /// <param name="expected">The corpus description.</param> + /// <param name="because">What the case is, for the failure message.</param> + private static void ShouldMatch(List<int> actual, JsonElement expected, string because) + { + actual.Should().HaveCount(expected.GetProperty("count").GetInt32(), because); + if (expected.TryGetProperty("items", out JsonElement items)) + { + actual.Should().Equal(items.EnumerateArray().Select(e => e.GetInt32()).ToList(), because); + return; + } + actual.Take(32).Should().Equal(expected.GetProperty("head").EnumerateArray().Select(e => e.GetInt32()), because); + actual.Skip(actual.Count - 32).Should() + .Equal(expected.GetProperty("tail").EnumerateArray().Select(e => e.GetInt32()), because); + string digest = Convert.ToHexString(SHA256.HashData(Encoding.UTF8.GetBytes(string.Join(",", actual)))) + .ToLowerInvariant(); + digest.Should().Be(expected.GetProperty("sha256").GetString(), because); + } +} diff --git a/test/OptunaSharp.Tests/Internal/MathUtilNumSharpModelTests.cs b/test/OptunaSharp.Tests/Internal/MathUtilNumSharpModelTests.cs new file mode 100644 index 0000000..83281cb --- /dev/null +++ b/test/OptunaSharp.Tests/Internal/MathUtilNumSharpModelTests.cs @@ -0,0 +1,210 @@ +using System; +using System.IO; +using System.Text.Json; +using AwesomeAssertions; +using NumSharp.Utilities; +using OptunaSharp.Internal; + +namespace OptunaSharp.Tests.Internal; + +/// <summary> +/// Pins <see cref="MathUtil.Log1p" />, <see cref="MathUtil.Expm1" /> and <see cref="MathUtil.LogAddExp" /> to NumSharp's +/// public scalar models of the UCRT routines NumPy calls, and those to NumPy itself. +/// <list type="bullet"> +/// <item><description> +/// On every OS: each helper is NumSharp's model bit for bit, so a future inline copy (the former Kahan +/// <c>expm1</c> was 62–84% equal to NumPy where TPE calls it) fails here first. +/// </description></item> +/// <item><description> +/// On Windows: the committed corpus <c>oracle/numpy_scalar_math.json</c> (NumPy 2.4.2, win-amd64, recorded by +/// <c>oracle/gen_numpy_scalar_math_oracle.py</c>) is replayed with no Python. log1p and logaddexp must match +/// bit for bit everywhere; expm1 bit for bit outside <c>[-ln 2, ln 1.5]</c> and within 2 ulp inside it, the +/// documented bound of the model (the UCRT's in-band polynomial is undocumented). +/// </description></item> +/// </list> +/// The corpus is Windows-only because NumPy's float64 log1p/expm1 call the platform libm (glibc or SVML loops on +/// Linux, Apple's libm on macOS), so its bits describe Windows NumPy only, which is what NumSharp's models reproduce. +/// </summary> +[TestClass] +public class MathUtilNumSharpModelTests +{ + /// <summary>Seeded inputs spanning every regime of the three functions, shared by the delegation pins.</summary> + /// <returns>About 30,000 doubles: specials, tiny and huge magnitudes, both sides of expm1's band, and (-1, 1).</returns> + private static double[] DelegationInputs() + { + var specials = new[] + { + 0.0, -0.0, -1.0, 1.0, double.PositiveInfinity, double.NegativeInfinity, double.Epsilon, -double.Epsilon, + 1e-300, -1e-300, -Math.Log(2.0), Math.Log(1.5), -745.2, 709.7, 710.0, -1000.0, + }; + // A seeded System.Random only picks test inputs; no sampler path reads it, so the RNG rule does not apply. + var rng = new Random(20261111); + var values = new double[specials.Length + 30_000]; + specials.CopyTo(values, 0); + for (int i = specials.Length; i < values.Length; i++) + { + double sign = rng.Next(2) == 0 ? -1.0 : 1.0; + values[i] = (i % 3) switch + { + 0 => rng.NextDouble() * 2.0 - 1.0, // (-1, 1): log1p's core and expm1's band. + 1 => sign * Math.Pow(10.0, rng.NextDouble() * 600 - 300), // tiny to huge magnitudes, both signs. + _ => rng.NextDouble() * 80.0 - 40.0, // expm1 well outside the band, both sides. + }; + } + return values; + } + + /// <summary>Loads the committed NumPy corpus copied next to the test assembly.</summary> + /// <returns>The corpus root: <c>log1p</c>, <c>expm1</c> and <c>logaddexp</c> arrays of hex bit patterns.</returns> + /// <exception cref="FileNotFoundException">The corpus was not copied to the output directory.</exception> + private static JsonElement LoadCorpus() + { + string path = Path.Combine(AppContext.BaseDirectory, "oracle", "numpy_scalar_math.json"); + return JsonDocument.Parse(File.ReadAllText(path)).RootElement.Clone(); + } + + /// <summary>Decodes a corpus entry: 16 hex digits of an IEEE-754 bit pattern, sign of zero and NaN payload kept.</summary> + /// <param name="element">A JSON string holding the bit pattern.</param> + /// <returns>The exact double the pattern encodes.</returns> + private static double FromBits(JsonElement element) + => BitConverter.Int64BitsToDouble(unchecked((long)Convert.ToUInt64(element.GetString(), 16))); + + /// <summary> + /// The distance between two doubles in units in the last place, counted along the ordered bit patterns, so 0 means + /// bit-identical (NaN to NaN only when the bits agree) and +0 to -0 counts as one step. + /// </summary> + /// <param name="a">The first value.</param> + /// <param name="b">The second value.</param> + /// <returns>The number of representable doubles between them; <see cref="long.MaxValue" /> when exactly one is NaN.</returns> + private static long UlpDistance(double a, double b) + { + long ia = BitConverter.DoubleToInt64Bits(a), ib = BitConverter.DoubleToInt64Bits(b); + if (ia == ib) + return 0; + if (double.IsNaN(a) || double.IsNaN(b)) + return long.MaxValue; + // Map the sign-magnitude patterns onto one monotonic integer line, negatives below positives. + if (ia < 0) + ia = long.MinValue - ia; + if (ib < 0) + ib = long.MinValue - ib; + return Math.Abs(ia - ib); + } + + /// <summary> + /// Skips (Inconclusive) off Windows: the corpus records Windows NumPy, whose log1p/expm1 come from the UCRT. CI + /// already excludes the <c>WindowsOnly</c> category elsewhere; this keeps an unfiltered local run green too. + /// </summary> + /// <exception cref="AssertInconclusiveException">The test runs on a platform other than Windows.</exception> + private static void RequireWindows() + { + if (!OperatingSystem.IsWindows()) + Assert.Inconclusive("The NumPy corpus is a win-amd64 pin: NumPy's log1p/expm1 call the platform libm."); + } + + /// <summary> + /// <see cref="MathUtil.Log1p" /> and <see cref="MathUtil.Expm1" /> return NumSharp's models bit for bit over 30,000 + /// seeded inputs and the special values, on every OS. + /// </summary> + [TestMethod] + public void Log1pAndExpm1_AreNumSharpsModels_BitForBit() + { + foreach (double x in DelegationInputs()) + { + BitConverter.DoubleToInt64Bits(MathUtil.Log1p(x)).Should() + .Be(BitConverter.DoubleToInt64Bits(NDLog1pExpm1Math.Log1p(x)), $"log1p({x:R})"); + BitConverter.DoubleToInt64Bits(MathUtil.Expm1(x)).Should() + .Be(BitConverter.DoubleToInt64Bits(NDLog1pExpm1Math.Expm1(x)), $"expm1({x:R})"); + } + } + + /// <summary> + /// <see cref="MathUtil.LogAddExp" /> returns NumSharp's <c>npy_logaddexp</c> port bit for bit over 15,000 seeded + /// pairs (near-equal ones included, the cancellation regime) and the infinities, on every OS. + /// </summary> + [TestMethod] + public void LogAddExp_IsNumSharpsModel_BitForBit() + { + double[] values = DelegationInputs(); + for (int i = 0; i + 1 < values.Length; i += 2) + { + double a = values[i]; + // Every other pair is near-equal: b = a(1 + 1e-12) exercises log1p of exp(-tiny). + double b = (i / 2) % 2 == 0 ? values[i + 1] : a * (1 + 1e-12); + BitConverter.DoubleToInt64Bits(MathUtil.LogAddExp(a, b)).Should() + .Be(BitConverter.DoubleToInt64Bits(NDLogAddExpMath.LogAddExp(a, b)), $"logaddexp({a:R}, {b:R})"); + } + MathUtil.LogAddExp(double.PositiveInfinity, double.PositiveInfinity).Should().Be(double.PositiveInfinity); + MathUtil.LogAddExp(double.NegativeInfinity, double.NegativeInfinity).Should().Be(double.NegativeInfinity); + MathUtil.LogAddExp(double.NegativeInfinity, -3.5).Should().Be(-3.5); + } + + /// <summary> + /// <see cref="MathUtil.Log1p" /> reproduces Windows NumPy's <c>np.log1p</c> bit for bit over the 163-input corpus: + /// zeros of both signs, <c>-1</c>, the infinities, subnormals, (-1, 1), just above -1, and up to 1e300. + /// </summary> + [TestMethod] + [WindowsOnly] + public void Log1p_ReplaysNumPyCorpus_BitForBit() + { + RequireWindows(); + foreach (JsonElement entry in LoadCorpus().GetProperty("log1p").EnumerateArray()) + { + double x = FromBits(entry.GetProperty("x")), expected = FromBits(entry.GetProperty("y")); + UlpDistance(MathUtil.Log1p(x), expected).Should().Be(0, $"log1p({x:R}) must be NumPy's {expected:R}"); + } + } + + /// <summary> + /// <see cref="MathUtil.LogAddExp" /> reproduces Windows NumPy's <c>np.logaddexp</c> bit for bit over the 131-pair + /// corpus: near-equal pairs down to a 1e-17 gap, wide pairs, equal pairs and the infinities. + /// </summary> + [TestMethod] + [WindowsOnly] + public void LogAddExp_ReplaysNumPyCorpus_BitForBit() + { + RequireWindows(); + foreach (JsonElement entry in LoadCorpus().GetProperty("logaddexp").EnumerateArray()) + { + double a = FromBits(entry.GetProperty("a")), b = FromBits(entry.GetProperty("b")); + double expected = FromBits(entry.GetProperty("y")); + UlpDistance(MathUtil.LogAddExp(a, b), expected).Should().Be(0, $"logaddexp({a:R}, {b:R}) must be NumPy's {expected:R}"); + } + } + + /// <summary> + /// <see cref="MathUtil.Expm1" /> reproduces Windows NumPy's <c>np.expm1</c> bit for bit outside + /// <c>[-ln 2, ln 1.5]</c> (where the UCRT returns <c>exp(x) - 1</c>) and within 2 ulp inside it, over the 233-input + /// corpus, which includes both ranges <see cref="TruncNorm.NdtriExp" /> calls it on. The former Kahan form failed + /// both halves: 2 ulp off outside the band, up to 4 inside. + /// </summary> + [TestMethod] + [WindowsOnly] + public void Expm1_ReplaysNumPyCorpus_ExactOutsideTheBand_WithinTwoUlpInside() + { + RequireWindows(); + JsonElement corpus = LoadCorpus(); + double low = FromBits(corpus.GetProperty("band").GetProperty("low")); + double high = FromBits(corpus.GetProperty("band").GetProperty("high")); + int inBand = 0, inBandExact = 0; + foreach (JsonElement entry in corpus.GetProperty("expm1").EnumerateArray()) + { + double x = FromBits(entry.GetProperty("x")), expected = FromBits(entry.GetProperty("y")); + long ulps = UlpDistance(MathUtil.Expm1(x), expected); + if (x < low || x > high) + { + ulps.Should().Be(0, $"expm1({x:R}) lies outside the band, where NumPy's bits are exp(x) - 1"); + } + else + { + inBand++; + if (ulps == 0) + inBandExact++; + ulps.Should().BeLessThanOrEqualTo(2, $"expm1({x:R}) lies inside the band, within 2 ulp of the UCRT polynomial"); + } + } + // The band must actually have been exercised, or the bound above proved nothing. + inBand.Should().BeGreaterThan(100); + inBandExact.Should().BeGreaterThan(0); + } +} diff --git a/test/OptunaSharp.Tests/Internal/NumPyDrawsTests.cs b/test/OptunaSharp.Tests/Internal/NumPyDrawsTests.cs new file mode 100644 index 0000000..9b4cca4 --- /dev/null +++ b/test/OptunaSharp.Tests/Internal/NumPyDrawsTests.cs @@ -0,0 +1,260 @@ +using System; +using System.Collections.Generic; +using AwesomeAssertions; +using NumSharp; +using OptunaSharp.Internal; + +namespace OptunaSharp.Tests.Internal; + +/// <summary> +/// Plan 14: pins every <see cref="NumPyDraws" /> helper to the NumSharp call it replaces. Each test drives two +/// generators seeded alike, one through the helper and one through the NumSharp call the sampler code made before plan +/// 14, and asserts the values are bit-identical and the streams stay in step afterwards (the next draws agree), so the +/// helper consumes exactly the words the call consumed. NumSharp's own calls are pinned to NumPy by its oracle; the +/// samplers built on the helpers are pinned to live Optuna by the interop parity suites. +/// </summary> +[TestClass] +public class NumPyDrawsTests +{ + /// <summary>Two generators seeded alike: the left is drawn through <see cref="NumPyDraws" />, the right through NumSharp.</summary> + /// <param name="seed">The seed both generators start from.</param> + /// <returns>The helper-side and the NumSharp-side generator.</returns> + private static (NumPyRandom Helper, NumPyRandom NumSharp) Pair(int seed) + => (np.random.RandomState(seed), np.random.RandomState(seed)); + + /// <summary>Asserts both generators continue with the same words: a long run of plain uniforms must agree bit for bit.</summary> + /// <param name="helper">The generator drawn through the helpers.</param> + /// <param name="reference">The generator drawn through NumSharp.</param> + private static void AssertInStep(NumPyRandom helper, NumPyRandom reference) + { + using NDArray expected = reference.random_sample(64L); + double[] want = expected.ToArray<double>(); + for (int i = 0; i < want.Length; i++) + BitConverter.DoubleToInt64Bits(NumPyDraws.Rand(helper)).Should().Be(BitConverter.DoubleToInt64Bits(want[i]), + $"the streams must stay in step (draw {i} after the compared calls)"); + } + + /// <summary>A thousand scalar uniforms equal NumSharp's <c>rand()</c> bit for bit, and the streams stay in step.</summary> + /// <param name="seed">The seed both generators start from.</param> + [TestMethod] + [DataRow(0)] + [DataRow(42)] + [DataRow(2147483646)] + public void Rand_Scalar_MatchesNumSharpRand_AndKeepsTheStreamInStep(int seed) + { + var (helper, reference) = Pair(seed); + for (int i = 0; i < 1000; i++) + { + using NDArray expected = reference.rand(); + BitConverter.DoubleToInt64Bits(NumPyDraws.Rand(helper)).Should().Be(BitConverter.DoubleToInt64Bits((double)expected)); + } + AssertInStep(helper, reference); + } + + /// <summary>A vector of uniforms equals NumSharp's <c>rand(n)</c> element by element, for empty, single and long vectors.</summary> + /// <param name="n">The number of draws.</param> + [TestMethod] + [DataRow(0)] + [DataRow(1)] + [DataRow(7)] + [DataRow(1000)] + public void Rand_Vector_MatchesNumSharpRand(int n) + { + var (helper, reference) = Pair(123); + using NDArray expected = reference.rand(n); + double[] actual = NumPyDraws.Rand(helper, n); + actual.Should().HaveCount(n); + double[] want = expected.ToArray<double>(); + for (int i = 0; i < n; i++) + BitConverter.DoubleToInt64Bits(actual[i]).Should().Be(BitConverter.DoubleToInt64Bits(want[i]), $"value {i} of {n}"); + AssertInStep(helper, reference); + } + + /// <summary> + /// A vector of uniforms equals NumSharp's <c>random_sample(n)</c>, at TPE's sizes (24 candidates; 40 parameters × 24 + /// candidates). + /// </summary> + /// <param name="n">The number of draws.</param> + [TestMethod] + [DataRow(0L)] + [DataRow(24L)] + [DataRow(960L)] + public void RandomSample_MatchesNumSharpRandomSample(long n) + { + var (helper, reference) = Pair(20260830); + using NDArray expected = reference.random_sample(n); + double[] actual = NumPyDraws.RandomSample(helper, n); + double[] want = expected.ToArray<double>(); + actual.Should().HaveCount(want.Length); + for (int i = 0; i < want.Length; i++) + BitConverter.DoubleToInt64Bits(actual[i]).Should().Be(BitConverter.DoubleToInt64Bits(want[i]), $"value {i}"); + AssertInStep(helper, reference); + } + + /// <summary>A negative count raises NumPy's ValueError before any draw, so the stream does not move.</summary> + [TestMethod] + public void RandomSample_Negative_RaisesValueError_AndDrawsNothing() + { + var (helper, reference) = Pair(5); + Action act = () => NumPyDraws.RandomSample(helper, -1); + act.Should().Throw<ValueError>(); + AssertInStep(helper, reference); + } + + /// <summary> + /// The bounds RandomSampler meets: plain, log-transformed and step-widened float and int bounds, one-hot categorical + /// rows, a zero-width range, reversed bounds and very wide ones. + /// </summary> + /// <returns>Pairs of (low, high).</returns> + private static IEnumerable<(double Low, double High)> Bounds() => new[] + { + (-10.0, 10.0), (Math.Log(1e-5), Math.Log(1e-1)), (0.1 - 0.1, 0.9 + 0.1), (0.5, 100.5), (Math.Log(0.5), Math.Log(128.5)), + (-2.5, 22.5), (0.0, 1.0), (3.25, 3.25), (5.0, -5.0), (-1e300, 1e300), (1e-300, 2e-300), (-0.0, 0.0), + }; + + /// <summary>Scalar uniforms over every bound shape RandomSampler meets equal NumSharp's scalar <c>uniform(low, high)</c>.</summary> + /// <param name="seed">The seed both generators start from.</param> + [TestMethod] + [DataRow(0)] + [DataRow(99)] + public void Uniform_MatchesNumSharpScalarUniform(int seed) + { + var (helper, reference) = Pair(seed); + for (int round = 0; round < 50; round++) + { + foreach (var (low, high) in Bounds()) + { + using NDArray expected = reference.uniform(low, high); + BitConverter.DoubleToInt64Bits(NumPyDraws.Uniform(helper, low, high)) + .Should().Be(BitConverter.DoubleToInt64Bits((double)expected), $"uniform({low}, {high}), round {round}"); + } + } + AssertInStep(helper, reference); + } + + /// <summary> + /// Drawing a bounds column row by row equals NumSharp's array form <c>uniform(bounds[:, 0], bounds[:, 1])</c>, which + /// RandomSampler used before plan 14: four one-hot rows of a categorical, and the single row of a numerical parameter. + /// </summary> + [TestMethod] + public void Uniform_RowByRow_MatchesNumSharpArrayUniform_OverABoundsColumn() + { + double[,] categorical = { { 0, 1 }, { 0, 1 }, { 0, 1 }, { 0, 1 } }; + double[,] numerical = { { Math.Log(1e-3), Math.Log(10.0) } }; + foreach (double[,] bounds in new[] { categorical, numerical }) + { + var (helper, reference) = Pair(77); + for (int round = 0; round < 100; round++) + { + int rows = bounds.GetLength(0); + var lows = new double[rows]; + var highs = new double[rows]; + for (int r = 0; r < rows; r++) + { + lows[r] = bounds[r, 0]; + highs[r] = bounds[r, 1]; + } + using NDArray lowArray = np.array(lows); + using NDArray highArray = np.array(highs); + using NDArray expected = reference.uniform(lowArray, highArray); + double[] want = expected.ToArray<double>(); + for (int r = 0; r < rows; r++) + BitConverter.DoubleToInt64Bits(NumPyDraws.Uniform(helper, bounds[r, 0], bounds[r, 1])) + .Should().Be(BitConverter.DoubleToInt64Bits(want[r]), $"row {r} of {rows}, round {round}"); + } + AssertInStep(helper, reference); + } + } + + /// <summary> + /// A non-finite range raises NumPy's <c>OverflowError</c> (NumSharp's Python class since 0.81.0, which was .NET's + /// <see cref="OverflowException" /> in 0.80.0) with NumPy's text before any draw, as NumSharp's call does, and the + /// stream does not move. + /// </summary> + /// <param name="low">The lower bound.</param> + /// <param name="high">The upper bound.</param> + [TestMethod] + [DataRow(double.MinValue, double.MaxValue)] + [DataRow(0.0, double.PositiveInfinity)] + [DataRow(double.NaN, 1.0)] + public void Uniform_NonFiniteRange_RaisesOverflow_AndDrawsNothing(double low, double high) + { + var (helper, reference) = Pair(3); + Action numSharp = () => reference.uniform(low, high).Dispose(); + numSharp.Should().ThrowExactly<OverflowError>().WithMessage("Range exceeds valid bounds"); + Action act = () => NumPyDraws.Uniform(helper, low, high); + act.Should().ThrowExactly<OverflowError>().WithMessage("Range exceeds valid bounds"); + AssertInStep(helper, reference); + } + + /// <summary>Integer draws equal NumSharp's <c>randint(low, high)</c>, including the seed ranges CMA-ES and GP draw from.</summary> + /// <param name="low">The smallest value that can be drawn.</param> + /// <param name="high">One past the largest value that can be drawn.</param> + [TestMethod] + [DataRow(0L, 2L)] + [DataRow(0L, 50L)] + [DataRow(1L, 65536L)] + [DataRow(1L, 2147483646L)] + public void RandInt_MatchesNumSharpRandint(long low, long high) + { + var (helper, reference) = Pair(11); + for (int i = 0; i < 500; i++) + { + using NDArray expected = reference.randint(low, high); + NumPyDraws.RandInt(helper, low, high).Should().Be((long)expected, $"draw {i}"); + } + AssertInStep(helper, reference); + } + + /// <summary> + /// Gaussians equal NumSharp's <c>normal</c>, scalar and vector, including the polar method's cached second value: + /// odd vector sizes, scalars and plain uniforms are interleaved so a cached Gaussian must be handed out on both sides. + /// </summary> + [TestMethod] + public void Normal_Scalar_And_Vector_MatchNumSharp_IncludingTheCachedGaussian() + { + var (helper, reference) = Pair(42); + for (int round = 0; round < 40; round++) + { + int n = 1 + 2 * (round % 5); + using NDArray expectedVector = reference.normal(0.5, 0.35, new Shape(n)); + double[] actual = NumPyDraws.Normal(helper, 0.5, 0.35, n); + double[] want = expectedVector.ToArray<double>(); + for (int i = 0; i < n; i++) + BitConverter.DoubleToInt64Bits(actual[i]).Should().Be(BitConverter.DoubleToInt64Bits(want[i]), $"vector draw {i}, round {round}"); + + using NDArray expectedScalar = reference.normal(-1.0, 4.0); + BitConverter.DoubleToInt64Bits(NumPyDraws.Normal(helper, -1.0, 4.0)) + .Should().Be(BitConverter.DoubleToInt64Bits((double)expectedScalar), $"scalar draw, round {round}"); + + using NDArray expectedUniform = reference.rand(); + BitConverter.DoubleToInt64Bits(NumPyDraws.Rand(helper)) + .Should().Be(BitConverter.DoubleToInt64Bits((double)expectedUniform), $"uniform between normals, round {round}"); + } + AssertInStep(helper, reference); + } + + /// <summary> + /// Every helper in the order NSGA-II's child generation uses them (a crossover decision, a parent tournament, a + /// crossover vector, a resample, per-gene decisions), repeated, equals the same sequence of NumSharp calls. + /// </summary> + [TestMethod] + public void MixedSequence_OfEveryHelper_MatchesTheNumSharpSequence() + { + var (helper, reference) = Pair(2026); + for (int round = 0; round < 200; round++) + { + using (NDArray d = reference.rand()) + NumPyDraws.Rand(helper).Should().Be((double)d); + using (NDArray d = reference.randint(0, 20)) + NumPyDraws.RandInt(helper, 0, 20).Should().Be((long)d); + using (NDArray d = reference.rand(8)) + NumPyDraws.Rand(helper, 8).Should().Equal(d.ToArray<double>()); + using (NDArray d = reference.uniform(-5.0, 5.0)) + NumPyDraws.Uniform(helper, -5.0, 5.0).Should().Be((double)d); + using (NDArray d = reference.random_sample(3L)) + NumPyDraws.RandomSample(helper, 3).Should().Equal(d.ToArray<double>()); + } + AssertInStep(helper, reference); + } +} diff --git a/test/OptunaSharp.Tests/Internal/ScrambledHaltonTests.cs b/test/OptunaSharp.Tests/Internal/ScrambledHaltonTests.cs new file mode 100644 index 0000000..aff03d2 --- /dev/null +++ b/test/OptunaSharp.Tests/Internal/ScrambledHaltonTests.cs @@ -0,0 +1,88 @@ +using System; +using AwesomeAssertions; +using NumSharp; +using OptunaSharp.Internal; + +namespace OptunaSharp.Tests.Internal; + +/// <summary> +/// Plan 15: <see cref="ScrambledHalton" /> draws a sequence's digit permutations once into an immutable engine that +/// QMCSampler keeps across trials, instead of re-drawing them for every point. These tests pin the engine to the +/// per-call algorithm it replaced, written out here, by bits. Parity with scipy itself is covered by +/// <c>QmcSamplerTests.ScrambledHalton*</c> and the live <c>QmcSamplerParityTests</c>. +/// </summary> +[TestClass] +public class ScrambledHaltonTests +{ + /// <summary> + /// The engine's points equal the replaced per-call algorithm's for several dimensions, seeds and indexes, + /// including indexes with many base-b digits. + /// </summary> + [TestMethod] + public void EnginePoint_EqualsThePerCallAlgorithm() + { + foreach (var (dim, seed) in new[] { (1, 0), (3, 42), (10, 0), (20, 2024) }) + { + ScrambledHalton.Engine engine = ScrambledHalton.Create(dim, seed); + foreach (ulong n in new ulong[] { 0, 1, 2, 3, 7, 100, 4095, 4096, 99_991, 1_000_003, 123_456_789 }) + { + double[] expected = ReplacedPoint(dim, n, seed); + double[] actual = engine.Point(n); + for (int d = 0; d < dim; d++) + BitConverter.DoubleToInt64Bits(actual[d]).Should().Be(BitConverter.DoubleToInt64Bits(expected[d]), + $"dim={dim}, seed={seed}, n={n}, coordinate {d}"); + } + } + } + + /// <summary>The static per-call entry point still answers what the engine answers.</summary> + [TestMethod] + public void StaticPoint_EqualsEnginePoint() + { + ScrambledHalton.Engine engine = ScrambledHalton.Create(6, 17); + for (ulong n = 0; n < 50; n++) + ScrambledHalton.Point(6, n, 17).Should().Equal(engine.Point(n)); + } + + /// <summary> + /// The algorithm <see cref="ScrambledHalton.Point" /> used before plan 15, kept verbatim as the reference: + /// the permutations are re-drawn from <c>default_rng(seed)</c> on every call. + /// </summary> + /// <param name="dim">The number of coordinates in each point.</param> + /// <param name="n">The zero-based sequence index.</param> + /// <param name="seed">The scramble seed.</param> + /// <returns>The scrambled Halton point at <paramref name="n" />.</returns> + private static double[] ReplacedPoint(int dim, ulong n, int seed) + { + int[] primes = QuasiMonteCarlo.HaltonPrimes(dim); + Generator rng = np.random.default_rng(seed); + + var point = new double[dim]; + for (int d = 0; d < dim; d++) + { + int b = primes[d]; + int count = (int)Math.Ceiling(54.0 / Math.Log2(b)) - 1; + var perms = new long[count][]; + for (int j = 0; j < count; j++) + { + NDArray row = np.arange((long)b); + rng.shuffle(row); + perms[j] = row.ToArray<long>(); + } + + double r = 0.0; + double b2r = 1.0 / b; + ulong quotient = n; + for (int j = 0; j < count; j++) + { + int remainder = (int)(quotient % (ulong)b); + remainder = (int)perms[j][remainder]; + r += remainder * b2r; + b2r /= b; + quotient /= (ulong)b; + } + point[d] = r; + } + return point; + } +} diff --git a/test/OptunaSharp.Tests/Internal/ScrambledSobolTests.cs b/test/OptunaSharp.Tests/Internal/ScrambledSobolTests.cs index c8db137..ea675cb 100644 --- a/test/OptunaSharp.Tests/Internal/ScrambledSobolTests.cs +++ b/test/OptunaSharp.Tests/Internal/ScrambledSobolTests.cs @@ -1,3 +1,4 @@ +using System; using AwesomeAssertions; using OptunaSharp.Internal; @@ -30,6 +31,54 @@ public void Random_MatchesScipy_D2Seed42() p[i, j].Should().Be(expected[i, j], $"scrambled Sobol' point [{i},{j}] is byte-identical to scipy"); } + /// <summary> + /// Plan 15: QMCSampler now computes the point at <c>sample_id</c> directly from the Gray code of the index + /// (<see cref="ScrambledSobol.Engine.Point" />) instead of generating every earlier point. Pins the direct form + /// to the stepping form it replaced, by bits, over every index of a long prefix and several dimensions and + /// seeds, including the indexes where the Gray code gains a new top bit. + /// </summary> + [TestMethod] + public void EnginePoint_EqualsTheSteppedSequenceRowByRow() + { + foreach (var (d, seed) in new[] { (1, 0), (2, 42), (5, 7), (10, 0), (21, 123456) }) + { + ScrambledSobol.Engine engine = ScrambledSobol.Create(d, seed); + const int n = 4100; + double[,] stepped = engine.Generate(n); + for (int i = 0; i < n; i++) + { + double[] direct = engine.Point((ulong)i); + for (int j = 0; j < d; j++) + BitConverter.DoubleToInt64Bits(direct[j]).Should().Be(BitConverter.DoubleToInt64Bits(stepped[i, j]), + $"d={d}, seed={seed}: point {i}, coordinate {j} is the same as stepping there"); + } + } + } + + /// <summary> + /// Plan 15: the engine is built once and reused, so building it twice must give the same sequence as + /// <see cref="ScrambledSobol.Random" />, which builds it per call. + /// </summary> + [TestMethod] + public void Create_ThenGenerate_EqualsRandom() + { + double[,] viaRandom = ScrambledSobol.Random(4, 300, 99); + double[,] viaEngine = ScrambledSobol.Create(4, 99).Generate(300); + for (int i = 0; i < 300; i++) + for (int j = 0; j < 4; j++) + viaEngine[i, j].Should().Be(viaRandom[i, j]); + } + + /// <summary>Plan 15: the direct form refuses an index past the 2^30 points of a 30-bit sequence, as stepping could not reach it.</summary> + [TestMethod] + public void EnginePoint_PastTheEndOfTheSequence_Throws() + { + ScrambledSobol.Engine engine = ScrambledSobol.Create(2, 0); + Action past = () => engine.Point(1UL << QuasiMonteCarlo.SobolBits); + past.Should().Throw<NumSharp.ValueError>(); + engine.Point((1UL << QuasiMonteCarlo.SobolBits) - 1).Should().HaveCount(2); + } + [TestMethod] public void Random_FirstPointIsInUnitCube_AndDeterministic() { diff --git a/test/OptunaSharp.Tests/Internal/SearchSpaceTransformTests.cs b/test/OptunaSharp.Tests/Internal/SearchSpaceTransformTests.cs index 82083b0..7f7d968 100644 --- a/test/OptunaSharp.Tests/Internal/SearchSpaceTransformTests.cs +++ b/test/OptunaSharp.Tests/Internal/SearchSpaceTransformTests.cs @@ -163,4 +163,105 @@ public void Categorical_Untransform_Picks_First_ArgMax() trans.Untransform(NumSharp.np.array(new[] { 0.4, 0.4, 0.1 }))["c"] .Should().Be("a", "np.argmax returns the first maximum"); } + + /// <summary> + /// Plan 14: <see cref="SearchSpaceTransform.TransformValues" /> returns exactly the values <see cref="SearchSpaceTransform.Transform" /> + /// wraps in a NumSharp array, for the mixed space, with and without the unit-cube rescaling, over many random + /// configurations (one-hot categorical columns included). + /// </summary> + /// <param name="transform01">Whether the transform rescales numerical columns to the unit cube.</param> + [TestMethod] + [DataRow(false)] + [DataRow(true)] + public void TransformValues_Equal_Transform_BitForBit(bool transform01) + { + var space = MixedSpace(); + var trans = new SearchSpaceTransform(space, transform01: transform01); + var rng = new Random(7); + string[] choices = { "u", "v", "w" }; + for (int round = 0; round < 200; round++) + { + var config = new OrderedDict<string, object?> + { + ["f"] = -5.0 + 10.0 * rng.NextDouble(), + ["fl"] = Math.Exp(Math.Log(1e-3) + (Math.Log(10.0) - Math.Log(1e-3)) * rng.NextDouble()), + ["fs"] = 0.25 * rng.Next(0, 5), + ["i"] = (long)rng.Next(1, 21), + ["il"] = (long)rng.Next(1, 65), + ["c"] = choices[rng.Next(0, 3)], + }; + using NumSharp.NDArray expected = trans.Transform(config); + double[] want = expected.ToArray<double>(); + double[] actual = trans.TransformValues(config); + actual.Should().HaveCount(want.Length); + for (int i = 0; i < want.Length; i++) + BitConverter.DoubleToInt64Bits(actual[i]).Should().Be(BitConverter.DoubleToInt64Bits(want[i]), $"column {i}, round {round}"); + } + } + + /// <summary> + /// Plan 14: <see cref="SearchSpaceTransform.UntransformValues" /> returns exactly what <see cref="SearchSpaceTransform.Untransform(NumSharp.NDArray)" /> + /// returns for the same float64 values (same keys in the same order, same values and types), with and without the + /// unit-cube rescaling, including coordinates outside the bounds that the untransform clamps and one-hot ties. + /// </summary> + /// <param name="transform01">Whether the transform rescales numerical columns to the unit cube.</param> + [TestMethod] + [DataRow(false)] + [DataRow(true)] + public void UntransformValues_Equal_Untransform_ForTheSameValues(bool transform01) + { + var trans = new SearchSpaceTransform(MixedSpace(), transform01: transform01); + double[,] bounds = trans.RawBounds; + int n = bounds.GetLength(0); + var rng = new Random(11); + for (int round = 0; round < 300; round++) + { + var values = new double[n]; + for (int i = 0; i < n; i++) + { + // Mostly inside the box, sometimes a little outside (the clamping branches), sometimes a tie (argmax). + double low = transform01 ? 0.0 : bounds[i, 0]; + double high = transform01 ? 1.0 : bounds[i, 1]; + values[i] = round % 7 == 0 ? 0.5 * (low + high) : low + (high - low) * (1.2 * rng.NextDouble() - 0.1); + } + using NumSharp.NDArray array = NumSharp.np.array(values); + var expected = trans.Untransform(array); + var actual = trans.UntransformValues(values); + actual.Keys.Should().Equal(expected.Keys); + foreach (var (name, value) in expected) + { + actual[name]!.GetType().Should().Be(value!.GetType(), $"{name}, round {round}"); + if (value is double d) + BitConverter.DoubleToInt64Bits((double)actual[name]!).Should().Be(BitConverter.DoubleToInt64Bits(d), $"{name}, round {round}"); + else + actual[name].Should().Be(value, $"{name}, round {round}"); + } + } + } + + /// <summary> + /// Plan 14: the NumSharp overload still reads any numeric dtype through <c>astype(float64)</c> (now disposing that copy): + /// a float32 and an int64 input untransform as their float64 conversions do, and the caller's array stays usable. + /// </summary> + [TestMethod] + public void Untransform_NonFloat64Input_IsReadThroughAFloat64Copy_AndTheInputSurvives() + { + var space = new OrderedDict<string, BaseDistribution> + { + ["x"] = new FloatDistribution(-10.0, 10.0), + ["n"] = new IntDistribution(0, 9), + }; + var trans = new SearchSpaceTransform(space); + using NumSharp.NDArray asFloat32 = NumSharp.np.array(new[] { 2.5f, 3.4f }); + var fromFloat32 = trans.Untransform(asFloat32); + fromFloat32["x"].Should().Be((double)2.5f); + fromFloat32["n"].Should().Be(3L); + asFloat32.ToArray<float>().Should().Equal(2.5f, 3.4f); + + using NumSharp.NDArray asInt64 = NumSharp.np.array(new[] { 4L, 7L }); + var fromInt64 = trans.Untransform(asInt64); + fromInt64["x"].Should().Be(4.0); + fromInt64["n"].Should().Be(7L); + asInt64.ToArray<long>().Should().Equal(4L, 7L); + } } diff --git a/test/OptunaSharp.Tests/Internal/SequentialProductTests.cs b/test/OptunaSharp.Tests/Internal/SequentialProductTests.cs new file mode 100644 index 0000000..55c1c5a --- /dev/null +++ b/test/OptunaSharp.Tests/Internal/SequentialProductTests.cs @@ -0,0 +1,123 @@ +using System; +using System.Reflection; +using AwesomeAssertions; +using NumSharp; +using OptunaSharp.Importance.Forests.Internal; +using OptunaSharp.Visualization; + +namespace OptunaSharp.Tests.Internal; + +/// <summary> +/// Pins the port's three hand-written sequential products to NumSharp's <c>np.prod</c>, bit for bit. Optuna computes +/// them with <c>np.prod</c>, which NumPy runs as a sequential <c>multiply.reduce</c>; NumSharp 0.81.0's float +/// <c>np.prod</c> multiplies in that same order (0.80.0's SIMD lanes did not, which is why the port wrote loops). The +/// loops stay, because each runs once per point inside the hypervolume and fANOVA loops, where a NumSharp call (about +/// 2 µs) costs more than the multiplications; these tests are what lets them stay: if a NumSharp release ever reorders +/// <c>np.prod</c> again, they fail and name the helper that no longer equals it. +/// </summary> +[TestClass] +public class SequentialProductTests +{ + /// <summary>The private static helpers are reached by reflection, as the reduction-order pins reach theirs.</summary> + private const BindingFlags PrivateStatic = BindingFlags.NonPublic | BindingFlags.Static; + + /// <summary> + /// Builds a row of objective-like values: magnitudes from 1e-3 to 1e3 with both signs, so the products round in + /// their last bits and an order change would show. + /// </summary> + /// <param name="rng">The generator to draw from.</param> + /// <param name="length">The number of values.</param> + /// <returns>The row.</returns> + private static double[] Row(NumPyRandom rng, int length) + { + using NDArray exponents = rng.uniform(-3.0, 3.0, new Shape(length)); + using NDArray signs = rng.uniform(0.0, 1.0, new Shape(length)); + var row = new double[length]; + for (int i = 0; i < length; i++) + row[i] = (signs.GetDouble(i) < 0.5 ? -1.0 : 1.0) * Math.Pow(10.0, exponents.GetDouble(i)); + return row; + } + + /// <summary>NumSharp's <c>np.prod(a - b)</c> over two rows of the same length, as one double.</summary> + /// <param name="a">The minuend row.</param> + /// <param name="b">The subtrahend row.</param> + /// <returns>The product of the differences.</returns> + private static double NpProdOfDifference(double[] a, double[] b) + { + using NDArray left = np.array(a); + using NDArray right = np.array(b); + using NDArray difference = left - right; + using NDArray product = np.prod(difference); + return (double)product; + } + + /// <summary>Asserts two doubles are the same value: equal bits, or both NaN (whose payload no Python caller sees).</summary> + /// <param name="actual">The helper's result.</param> + /// <param name="expected">NumSharp's result.</param> + /// <param name="what">The helper and case, for the failure message.</param> + private static void ShouldBeSameValue(double actual, double expected, string what) + { + if (double.IsNaN(expected)) + { + double.IsNaN(actual).Should().BeTrue($"{what}: NumSharp's np.prod is NaN, the helper gave {actual:R}"); + return; + } + BitConverter.DoubleToInt64Bits(actual).Should().Be(BitConverter.DoubleToInt64Bits(expected), + $"{what}: NumSharp's np.prod is {expected:R}, the helper gave {actual:R}"); + } + + /// <summary> + /// <c>Hypervolume.ProdRefMinus</c> (<c>np.prod(reference_point - row)</c> in Optuna's hypervolume and HSSP) and + /// <c>HypervolumeHistory.Prod</c> (<c>np.prod(ref - values)</c> in <c>_get_hypervolume_history</c>) equal NumSharp's + /// <c>np.prod</c> over 2 to 16 objectives, 400 random rows, plus rows holding an infinity, a zero and a signed zero. + /// </summary> + [TestMethod] + public void HypervolumeProducts_EqualNumSharpsNpProd() + { + MethodInfo prodRefMinus = typeof(OptunaSharp.Internal.Hypervolume).GetMethod("ProdRefMinus", PrivateStatic)!; + MethodInfo historyProd = typeof(HypervolumeHistory).GetMethod("Prod", PrivateStatic)!; + NumPyRandom rng = np.random.RandomState(20261114); + + void Check(double[] reference, double[] row, string label) + { + double expected = NpProdOfDifference(reference, row); + ShouldBeSameValue((double)prodRefMinus.Invoke(null, new object[] { reference, row })!, expected, $"ProdRefMinus {label}"); + ShouldBeSameValue((double)historyProd.Invoke(null, new object[] { reference, row })!, expected, $"HypervolumeHistory.Prod {label}"); + } + + for (int i = 0; i < 400; i++) + { + int m = 2 + i % 15; + Check(Row(rng, m), Row(rng, m), $"random row {i} (m={m})"); + } + Check(new[] { 1.0, 2.0, 3.0 }, new[] { 1.0, double.NegativeInfinity, 0.5 }, "zero times infinity"); + Check(new[] { 1.0, 2.0, 3.0, 4.0 }, new[] { 0.5, double.NegativeInfinity, 0.5, 1.0 }, "one infinite distance"); + Check(new[] { -0.0, 2.0, 3.0 }, new[] { 0.0, 1.0, 2.5 }, "a signed zero distance"); + } + + /// <summary> + /// <c>FanovaTree.GetCardinality</c> (<c>_get_cardinality(search_spaces) = np.prod(hi - lo)</c>) equals NumSharp's + /// <c>np.prod</c> over 1 to 16 features, 400 random bound pairs. + /// </summary> + [TestMethod] + public void FanovaCardinality_EqualsNumSharpsNpProd() + { + MethodInfo cardinality = typeof(FanovaTree).GetMethod("GetCardinality", PrivateStatic)!; + NumPyRandom rng = np.random.RandomState(1114); + + for (int i = 0; i < 400; i++) + { + int features = 1 + i % 16; + double[] lo = Row(rng, features); + double[] hi = Row(rng, features); + var searchSpaces = new double[features, 2]; + for (int f = 0; f < features; f++) + { + searchSpaces[f, 0] = lo[f]; + searchSpaces[f, 1] = hi[f]; + } + ShouldBeSameValue((double)cardinality.Invoke(null, new object[] { searchSpaces })!, NpProdOfDifference(hi, lo), + $"GetCardinality row {i} (features={features})"); + } + } +} diff --git a/test/OptunaSharp.Tests/LinAlgTests.cs b/test/OptunaSharp.Tests/LinAlgTests.cs index 9193ff8..56bc1fd 100644 --- a/test/OptunaSharp.Tests/LinAlgTests.cs +++ b/test/OptunaSharp.Tests/LinAlgTests.cs @@ -197,4 +197,211 @@ public void SelfConsistency_Cholesky_SolveTriangular_Eigh() maxOrtho.Should().BeLessThan(1e-11); ascFail.Should().Be(0); } + + // ---- SolveTriangular with a block of right-hand sides (plan 15) -------------------------------- + + /// <summary> + /// Plan 15: the matrix <c>SolveTriangular</c> sweeps all right-hand sides at once, vectorized across them, instead + /// of solving them one by one. Every combination of triangle (lower, upper), side (left, right), system size (1 to + /// 17) and number of right-hand sides (1 to 33, below, at and past whole vectors) against the replaced + /// one-at-a-time code, written out below: every element has the same bits. The coefficient matrices have random + /// off-diagonal values in the other triangle too, which must be ignored as before. + /// </summary> + [TestMethod] + public void SolveTriangular_Matrix_AllRightHandSidesAtOnce_MatchesTheOneAtATimeCodeToTheBit() + { + var rng = new Random(15); + foreach (int n in new[] { 1, 2, 3, 5, 8, 17 }) + { + foreach (int sides in new[] { 1, 2, 3, 4, 5, 7, 8, 13, 33 }) + { + foreach (bool upper in new[] { false, true }) + { + var a = new double[n, n]; + for (int i = 0; i < n; i++) + for (int j = 0; j < n; j++) + a[i, j] = i == j ? 0.5 + rng.NextDouble() * 3 : rng.NextDouble() * 4 - 2; + foreach (bool left in new[] { true, false }) + { + var b = left ? new double[n, sides] : new double[sides, n]; + for (int i = 0; i < b.GetLength(0); i++) + for (int j = 0; j < b.GetLength(1); j++) + b[i, j] = rng.NextDouble() * 20 - 10; + + double[,] actual = LinAlg.SolveTriangular(a, b, upper, left); + double[,] expected = OneAtATimeSolveTriangular(a, b, upper, left); + actual.GetLength(0).Should().Be(expected.GetLength(0)); + actual.GetLength(1).Should().Be(expected.GetLength(1)); + for (int i = 0; i < expected.GetLength(0); i++) + for (int j = 0; j < expected.GetLength(1); j++) + BitConverter.DoubleToInt64Bits(actual[i, j]).Should().Be(BitConverter.DoubleToInt64Bits(expected[i, j]), + $"n={n}, sides={sides}, upper={upper}, left={left}, element [{i},{j}]"); + } + } + } + } + } + + /// <summary> + /// Plan 15: <c>CholeskySolve</c> runs both triangular solves of a Cholesky solve on one block. On both sides, for + /// sizes 1 to 17 and 1 to 33 right-hand sides, it equals the two solves the GP stack spelled out (L then a + /// materialized Lᵀ on the left; Lᵀ then L on the right), each computed with the replaced one-at-a-time code: same + /// bits. The factor's upper triangle holds noise, which must be ignored as before. + /// </summary> + [TestMethod] + public void CholeskySolve_FusedOnOneBlock_MatchesTheTwoSpelledOutSolvesToTheBit() + { + var rng = new Random(16); + foreach (int n in new[] { 1, 2, 3, 5, 8, 17 }) + { + foreach (int sides in new[] { 1, 3, 4, 5, 9, 33 }) + { + var l = new double[n, n]; + for (int i = 0; i < n; i++) + for (int j = 0; j < n; j++) + l[i, j] = i == j ? 0.5 + rng.NextDouble() * 3 : rng.NextDouble() * 4 - 2; + var lt = new double[n, n]; + for (int i = 0; i < n; i++) + for (int j = 0; j < n; j++) + lt[i, j] = l[j, i]; + + var bLeft = new double[n, sides]; + for (int i = 0; i < n; i++) + for (int c = 0; c < sides; c++) + bLeft[i, c] = rng.NextDouble() * 20 - 10; + double[,] expectedLeft = OneAtATimeSolveTriangular(lt, OneAtATimeSolveTriangular(l, bLeft, upper: false, left: true), upper: true, left: true); + AssertSameBits(LinAlg.CholeskySolve(l, bLeft, left: true), expectedLeft, $"left, n={n}, sides={sides}"); + + var bRight = new double[sides, n]; + for (int r = 0; r < sides; r++) + for (int j = 0; j < n; j++) + bRight[r, j] = rng.NextDouble() * 20 - 10; + double[,] expectedRight = OneAtATimeSolveTriangular(l, OneAtATimeSolveTriangular(lt, bRight, upper: true, left: false), upper: false, left: false); + AssertSameBits(LinAlg.CholeskySolve(l, bRight, left: false), expectedRight, $"right, n={n}, sides={sides}"); + } + } + } + + /// <summary> + /// Plan 15: the vector <c>SolveTriangular(a, b, upper, transposeA: true)</c> reads <c>a</c> transposed in place; + /// it equals solving with a materialized transpose and the opposite triangle, for both triangles and sizes 1 to + /// 40: same bits. + /// </summary> + [TestMethod] + public void SolveTriangular_Vector_TransposedInPlace_MatchesTheMaterializedTransposeToTheBit() + { + var rng = new Random(17); + for (int n = 1; n <= 40; n++) + { + foreach (bool upper in new[] { false, true }) + { + var a = new double[n, n]; + for (int i = 0; i < n; i++) + for (int j = 0; j < n; j++) + a[i, j] = i == j ? 0.5 + rng.NextDouble() * 3 : rng.NextDouble() * 4 - 2; + var at = new double[n, n]; + for (int i = 0; i < n; i++) + for (int j = 0; j < n; j++) + at[i, j] = a[j, i]; + var b = new double[n]; + for (int i = 0; i < n; i++) + b[i] = rng.NextDouble() * 20 - 10; + + double[] actual = LinAlg.SolveTriangular(a, b, upper, transposeA: true); + double[] expected = OneTriSolve(at, b, !upper, transpose: false); + for (int i = 0; i < n; i++) + BitConverter.DoubleToInt64Bits(actual[i]).Should().Be(BitConverter.DoubleToInt64Bits(expected[i]), + $"n={n}, upper={upper}, element {i}"); + } + } + } + + /// <summary>Asserts two matrices have the same shape and the same bits in every element.</summary> + /// <param name="actual">The matrix under test.</param> + /// <param name="expected">The reference matrix.</param> + /// <param name="what">Names the case in failure messages.</param> + private static void AssertSameBits(double[,] actual, double[,] expected, string what) + { + actual.GetLength(0).Should().Be(expected.GetLength(0), what); + actual.GetLength(1).Should().Be(expected.GetLength(1), what); + for (int i = 0; i < expected.GetLength(0); i++) + for (int j = 0; j < expected.GetLength(1); j++) + BitConverter.DoubleToInt64Bits(actual[i, j]).Should().Be(BitConverter.DoubleToInt64Bits(expected[i, j]), + $"{what}, element [{i},{j}]"); + } + + /// <summary> + /// The matrix <c>SolveTriangular</c> before plan 15: each right-hand side copied out, solved by substitution + /// through an accessor that reads the coefficient matrix transposed for a right solve, and copied back. + /// </summary> + /// <param name="a">The triangular coefficient matrix.</param> + /// <param name="b">The right-hand sides: columns for a left solve, rows for a right solve.</param> + /// <param name="upper">Whether <paramref name="a" /> is upper triangular.</param> + /// <param name="left">Whether to solve <c>a X = b</c> (else <c>X a = b</c>).</param> + /// <returns>The solution.</returns> + private static double[,] OneAtATimeSolveTriangular(double[,] a, double[,] b, bool upper, bool left) + { + int rows = b.GetLength(0), cols = b.GetLength(1), n = a.GetLength(0); + var result = new double[rows, cols]; + if (left) + { + var column = new double[n]; + for (int c = 0; c < cols; c++) + { + for (int i = 0; i < n; i++) + column[i] = b[i, c]; + double[] solved = OneTriSolve(a, column, upper, transpose: false); + for (int i = 0; i < n; i++) + result[i, c] = solved[i]; + } + } + else + { + var rowVec = new double[n]; + for (int r = 0; r < rows; r++) + { + for (int j = 0; j < n; j++) + rowVec[j] = b[r, j]; + double[] solved = OneTriSolve(a, rowVec, upper, transpose: true); + for (int j = 0; j < n; j++) + result[r, j] = solved[j]; + } + } + return result; + } + + /// <summary>The replaced per-right-hand-side substitution, <c>op(a) x = b</c>.</summary> + /// <param name="a">The triangular coefficient matrix in its stored orientation.</param> + /// <param name="b">The right-hand side.</param> + /// <param name="upper">Whether <paramref name="a" /> is upper triangular as stored.</param> + /// <param name="transpose">Whether to solve with the transpose of <paramref name="a" />.</param> + /// <returns>The solution vector.</returns> + private static double[] OneTriSolve(double[,] a, double[] b, bool upper, bool transpose) + { + int n = b.Length; + var x = new double[n]; + bool effectiveUpper = upper ^ transpose; + double Get(int i, int j) => transpose ? a[j, i] : a[i, j]; + if (!effectiveUpper) + { + for (int i = 0; i < n; i++) + { + double s = b[i]; + for (int j = 0; j < i; j++) + s -= Get(i, j) * x[j]; + x[i] = s / Get(i, i); + } + } + else + { + for (int i = n - 1; i >= 0; i--) + { + double s = b[i]; + for (int j = i + 1; j < n; j++) + s -= Get(i, j) * x[j]; + x[i] = s / Get(i, i); + } + } + return x; + } } diff --git a/test/OptunaSharp.Tests/ConcurrentOrderedDictTests.cs b/test/OptunaSharp.Tests/NumSharpConcurrentOrderedDictionaryTests.cs similarity index 80% rename from test/OptunaSharp.Tests/ConcurrentOrderedDictTests.cs rename to test/OptunaSharp.Tests/NumSharpConcurrentOrderedDictionaryTests.cs index f959afd..776dcbf 100644 --- a/test/OptunaSharp.Tests/ConcurrentOrderedDictTests.cs +++ b/test/OptunaSharp.Tests/NumSharpConcurrentOrderedDictionaryTests.cs @@ -3,20 +3,21 @@ using System.Linq; using System.Threading.Tasks; using AwesomeAssertions; -using OptunaSharp.Collections; -using Clone = OptunaSharp.Collections.Concurrent; +using NumSharp.Collections; namespace OptunaSharp.Tests; /// <summary> -/// Pins the contract of <see cref="ConcurrentOrderedDict{TKey,TValue}" /> — the thread-safe, two-path -/// (key + insertion-order index) collection built on the vendored concurrent dictionary. These tests are the +/// Pins the contract OptunaSharp expects of NumSharp's <see cref="ConcurrentOrderedDictionary{TKey,TValue}" /> — the +/// thread-safe, two-path (key + insertion-order index) collection OptunaSharp vendored as <c>ConcurrentOrderedDictionary</c> +/// (over a vendored copy of dotnet's concurrent dictionary) until NumSharp 0.81.0 shipped it publicly; the copies are +/// gone, these tests stayed, pointed at NumSharp's type, as the owner's TODO asked. These tests are the /// guard rails for the load-bearing invariants: that the two paths observe one value, that enumeration is /// value-order like a list, that keys stay unique, that removal preserves order and re-indexes, and that /// concurrent use neither corrupts nor throws. /// </summary> [TestClass] -public class ConcurrentOrderedDictTests +public class NumSharpConcurrentOrderedDictionaryTests { /// <summary>A 16-byte value type that is not written atomically, so value replacement takes the clone-and-publish path.</summary> private struct Pair16 @@ -32,7 +33,7 @@ private struct Pair16 [TestMethod] public void TwoPaths_KeyAndIndex_SeeSameValues() { - var d = new ConcurrentOrderedDict<string, int>(); + var d = new ConcurrentOrderedDictionary<string, int>(); d.Add("x", 1); d.Add("y", 2); @@ -46,7 +47,7 @@ public void TwoPaths_KeyAndIndex_SeeSameValues() [TestMethod] public void Enumeration_ToArray_Values_AreValuesInInsertionOrder() { - var d = new ConcurrentOrderedDict<string, int>(); + var d = new ConcurrentOrderedDictionary<string, int>(); d.Add("a", 10); d.Add("b", 20); d.Add("c", 30); @@ -62,7 +63,7 @@ public void Enumeration_ToArray_Values_AreValuesInInsertionOrder() [TestMethod] public void Dedup_TryAddReturnsFalse_AddThrows() { - var d = new ConcurrentOrderedDict<string, int>(); + var d = new ConcurrentOrderedDictionary<string, int>(); d.TryAdd("k", 1).Should().BeTrue(); d.TryAdd("k", 2).Should().BeFalse(); d.Count.Should().Be(1); @@ -82,7 +83,7 @@ public void SourceCtor_LastValueWins_FirstPosition() new KeyValuePair<string, int>("b", 2), new KeyValuePair<string, int>("a", 9), }; - var d = new ConcurrentOrderedDict<string, int>(src); + var d = new ConcurrentOrderedDictionary<string, int>(src); d.Keys.Should().Equal("a", "b"); d["a"].Should().Be(9); @@ -93,7 +94,7 @@ public void SourceCtor_LastValueWins_FirstPosition() [TestMethod] public void KeySet_UpdatesInPlace_KeepsPosition_OnBothPaths() { - var d = new ConcurrentOrderedDict<string, int>(); + var d = new ConcurrentOrderedDictionary<string, int>(); d.Add("x", 1); d.Add("y", 2); @@ -108,7 +109,7 @@ public void KeySet_UpdatesInPlace_KeepsPosition_OnBothPaths() [TestMethod] public void IndexSet_ReplacesValue_KeepsKey_OnBothPaths() { - var d = new ConcurrentOrderedDict<string, int>(); + var d = new ConcurrentOrderedDictionary<string, int>(); d.Add("x", 1); d.Add("y", 2); @@ -123,7 +124,7 @@ public void IndexSet_ReplacesValue_KeepsKey_OnBothPaths() [TestMethod] public void IndexOf_TryGetIndex_GetKeyAt() { - var d = new ConcurrentOrderedDict<string, int>(); + var d = new ConcurrentOrderedDictionary<string, int>(); d.Add("a", 1); d.Add("b", 2); d.Add("c", 3); @@ -141,7 +142,7 @@ public void IndexOf_TryGetIndex_GetKeyAt() [TestMethod] public void Remove_ByKey_ShiftsAndReindexes() { - var d = new ConcurrentOrderedDict<string, int>(); + var d = new ConcurrentOrderedDictionary<string, int>(); d.Add("a", 1); d.Add("b", 2); d.Add("c", 3); @@ -160,7 +161,7 @@ public void Remove_ByKey_ShiftsAndReindexes() [TestMethod] public void RemoveAt_ShiftsAndReindexes() { - var d = new ConcurrentOrderedDict<string, int>(); + var d = new ConcurrentOrderedDictionary<string, int>(); d.Add("a", 1); d.Add("b", 2); d.Add("c", 3); @@ -177,7 +178,7 @@ public void RemoveAt_ShiftsAndReindexes() [TestMethod] public void IntKey_BracketIsIndex_MethodsForKey() { - var d = new ConcurrentOrderedDict<int, string>(); + var d = new ConcurrentOrderedDictionary<int, string>(); d.Add(5, "five"); d.Add(9, "nine"); @@ -195,7 +196,7 @@ public void IntKey_BracketIsIndex_MethodsForKey() [TestMethod] public void GetOrAdd_AddOrUpdate_TryUpdate() { - var d = new ConcurrentOrderedDict<string, int>(); + var d = new ConcurrentOrderedDictionary<string, int>(); d.GetOrAdd("a", 1).Should().Be(1); d.GetOrAdd("a", 99).Should().Be(1); @@ -215,7 +216,7 @@ public void GetOrAdd_AddOrUpdate_TryUpdate() [TestMethod] public void Clear_Count_IsEmpty() { - var d = new ConcurrentOrderedDict<string, int>(); + var d = new ConcurrentOrderedDictionary<string, int>(); d.IsEmpty.Should().BeTrue(); d.Add("a", 1); d.Add("b", 2); @@ -234,7 +235,7 @@ public void Clear_Count_IsEmpty() [TestMethod] public void CustomComparer_IsHonored() { - var d = new ConcurrentOrderedDict<string, int>(StringComparer.OrdinalIgnoreCase); + var d = new ConcurrentOrderedDictionary<string, int>(StringComparer.OrdinalIgnoreCase); d.Add("Key", 1); d.ContainsKey("KEY").Should().BeTrue(); @@ -249,7 +250,7 @@ public void CustomComparer_IsHonored() [TestMethod] public void NullKey_Throws() { - var d = new ConcurrentOrderedDict<string, int>(); + var d = new ConcurrentOrderedDictionary<string, int>(); ((Action)(() => d.Add(null!, 1))).Should().Throw<ArgumentNullException>(); ((Action)(() => d.TryAdd(null!, 1))).Should().Throw<ArgumentNullException>(); ((Action)(() => _ = d[null!])).Should().Throw<ArgumentNullException>(); @@ -261,7 +262,7 @@ public void NullKey_Throws() [TestMethod] public void IndexOutOfRange_Throws() { - var d = new ConcurrentOrderedDict<string, int>(); + var d = new ConcurrentOrderedDictionary<string, int>(); d.Add("a", 1); ((Action)(() => _ = d[1])).Should().Throw<ArgumentOutOfRangeException>(); @@ -279,7 +280,7 @@ public void IndexOutOfRange_Throws() [TestMethod] public void NonAtomicValueType_ReplacementWorks() { - var d = new ConcurrentOrderedDict<string, Pair16>(); + var d = new ConcurrentOrderedDictionary<string, Pair16>(); d.Add("a", new Pair16 { A = 1, B = 2 }); d.Add("b", new Pair16 { A = 3, B = 4 }); @@ -298,7 +299,7 @@ public void NonAtomicValueType_ReplacementWorks() [TestMethod] public void Enumerator_IsSnapshot() { - var d = new ConcurrentOrderedDict<int, int>(); + var d = new ConcurrentOrderedDictionary<int, int>(); for (int i = 0; i < 3; i++) { d.Add(i, i); @@ -323,7 +324,7 @@ public void Enumerator_IsSnapshot() public void Concurrent_Adds_AllPresent_And_Bijection() { const int n = 50_000; - var d = new ConcurrentOrderedDict<int, int>(); + var d = new ConcurrentOrderedDictionary<int, int>(); Parallel.For(0, n, i => d.TryAdd(i, i * 2).Should().BeTrue()); @@ -344,7 +345,7 @@ public void Concurrent_Adds_AllPresent_And_Bijection() [TestMethod] public void Concurrent_ReadDuringWrite_NoThrow() { - var d = new ConcurrentOrderedDict<int, int>(); + var d = new ConcurrentOrderedDictionary<int, int>(); for (int i = 0; i < 1_000; i++) { d.Add(i, i); @@ -387,7 +388,7 @@ public void Concurrent_AddOrUpdate_NoLostUpdates() { const int workers = 64; const int perWorker = 2_000; - var d = new ConcurrentOrderedDict<string, int>(); + var d = new ConcurrentOrderedDictionary<string, int>(); d.Add("k", 0); Parallel.For(0, workers, _ => @@ -407,7 +408,7 @@ public void Concurrent_AddOrUpdate_NoLostUpdates() public void Concurrent_GetOrAdd_Factory_SingleWinner() { const int workers = 64; - var d = new ConcurrentOrderedDict<int, string>(); + var d = new ConcurrentOrderedDictionary<int, string>(); var results = new string[workers]; Parallel.For(0, workers, w => results[w] = d.GetOrAdd(42, _ => "v" + Guid.NewGuid())); @@ -422,7 +423,7 @@ public void Concurrent_GetOrAdd_Factory_SingleWinner() public void Concurrent_AddOrUpdate_DistinctKeys_AllAdded() { const int n = 20_000; - var d = new ConcurrentOrderedDict<int, int>(); + var d = new ConcurrentOrderedDictionary<int, int>(); Parallel.For(0, n, i => d.AddOrUpdate(i, i, (_, v) => v + 1000)); @@ -434,51 +435,3 @@ public void Concurrent_AddOrUpdate_DistinctKeys_AllAdded() } } } - -/// <summary> -/// A focused smoke suite for the vendored <see cref="Clone.ConcurrentDictionary{TKey,TValue}" /> clone itself, -/// independent of the ordered wrapper, so a regression in the faithful port is caught directly rather than only -/// through its consumer. -/// </summary> -[TestClass] -public class VendoredConcurrentDictionaryTests -{ - /// <summary>The core key API (add/dedup/get/update/remove) behaves like the framework dictionary.</summary> - [TestMethod] - public void CoreKeyApi_Works() - { - var cd = new Clone.ConcurrentDictionary<string, int>(); - cd.TryAdd("a", 1).Should().BeTrue(); - cd.TryAdd("a", 2).Should().BeFalse(); - cd["b"] = 2; - cd["a"] = 10; - cd["a"].Should().Be(10); - cd.Count.Should().Be(2); - cd.ContainsKey("b").Should().BeTrue(); - - cd.GetOrAdd("c", 3).Should().Be(3); - cd.GetOrAdd("c", 99).Should().Be(3); - cd.AddOrUpdate("a", 0, (_, v) => v + 5).Should().Be(15); - - cd.TryRemove("b", out var bv).Should().BeTrue(); - bv.Should().Be(2); - cd.ContainsKey("b").Should().BeFalse(); - } - - /// <summary>The striped-lock write path stays correct under heavy parallel insertion (values survive resizes).</summary> - [TestMethod] - public void ConcurrentAdds_SurviveResizes() - { - const int n = 100_000; - var cd = new Clone.ConcurrentDictionary<int, int>(); - - Parallel.For(0, n, i => cd[i] = i * i); - - cd.Count.Should().Be(n); - for (int i = 0; i < n; i++) - { - cd.TryGetValue(i, out var v).Should().BeTrue(); - v.Should().Be(i * i); - } - } -} diff --git a/test/OptunaSharp.Tests/OptunaSharp.Tests.csproj b/test/OptunaSharp.Tests/OptunaSharp.Tests.csproj index 6662768..a3a289d 100644 --- a/test/OptunaSharp.Tests/OptunaSharp.Tests.csproj +++ b/test/OptunaSharp.Tests/OptunaSharp.Tests.csproj @@ -49,6 +49,16 @@ Copied next to the test assembly so Samplers/CmaPickleOracleTests checks OptunaSharp's pickle reader, writer and stored states byte for byte with NO Python. --> <None Include="oracle\cma_pickle_oracle.json" CopyToOutputDirectory="PreserveNewest" /> + <!-- Committed NumPy scalar-math oracle (bit patterns of NumPy 2.4.2's float64 log1p / expm1 / logaddexp on + win-amd64; regenerated on Windows by oracle/gen_numpy_scalar_math_oracle.py). Copied next to the test + assembly so Internal/MathUtilNumSharpModelTests replays it with NO Python. A Windows-only pin: NumPy's + log1p/expm1 call the platform libm. --> + <None Include="oracle\numpy_scalar_math.json" CopyToOutputDirectory="PreserveNewest" /> + <!-- Committed CPython order oracle (CPython 3.12's iteration order of GridSampler's int-set differences and the + order list.sort(reverse=True) leaves NSGA-III's NaN-bearing (distance, index) tuples in; regenerated by + oracle/gen_cpython_order_oracle.py). Copied next to the test assembly so Internal/CPythonOrderOracleTests + replays it with NO Python. --> + <None Include="oracle\cpython_order.json" CopyToOutputDirectory="PreserveNewest" /> </ItemGroup> </Project> diff --git a/test/OptunaSharp.Tests/Pruners/PrunerTests.cs b/test/OptunaSharp.Tests/Pruners/PrunerTests.cs index efc6742..9f6084b 100644 --- a/test/OptunaSharp.Tests/Pruners/PrunerTests.cs +++ b/test/OptunaSharp.Tests/Pruners/PrunerTests.cs @@ -143,8 +143,12 @@ public void NanPercentile_Matches_Numpy_Linear_Interpolation() /// 0.014999999999999902, 0.4760000000000001 and 0.2869999999999999; two ordinary rows; one value, where both /// neighbours clamp to it; an index past the end, clamped to the last element; then the NaN rows: an index /// landing on 2.0 whose next neighbour is inf, <c>inf * 0</c> at t = 0, <c>inf - inf</c> for a clamped - /// infinite last element, and single or paired infinities; last, the two branches that keep an infinite - /// neighbour infinite instead (<c>1 - inf * 0.25</c> and <c>1 + inf * 0.25</c>). + /// infinite last element, and single or paired infinities; then the two branches that keep an infinite + /// neighbour infinite instead (<c>1 - inf * 0.25</c> and <c>1 + inf * 0.25</c>); last, two rows whose result is a + /// zero whose sign NumPy's partition decides among tied <c>-0.0</c>/<c>0.0</c> neighbours (NumSharp's + /// <c>np.nanpercentile</c> partitions as NumPy does for these), and an all-NaN input. The one tie pattern NumSharp + /// 0.80.0 still resolved differently, fixed in NumSharp 0.81.0, is + /// <see cref="NanPercentile_TiedSignedZeros_KeepNumpysZeroSign" />. /// </remarks> /// <param name="values">The completed trials' reports at one step, NaNs included.</param> /// <param name="percentile">The percentile asked for, in [0, 100].</param> @@ -169,6 +173,9 @@ public void NanPercentile_Matches_Numpy_Linear_Interpolation() [DataRow(new[] { double.NegativeInfinity, double.PositiveInfinity }, 50.0, double.NaN)] [DataRow(new[] { double.NegativeInfinity, 1.0 }, 75.0, double.NegativeInfinity)] [DataRow(new[] { 1.0, double.PositiveInfinity }, 25.0, double.PositiveInfinity)] + [DataRow(new[] { -1.0, -0.0, 0.5, 0.0, -1.0, -1.0 }, 75.0, 0.0)] + [DataRow(new[] { 0.0, -0.0, -0.0, -0.0, 1.0, 0.0 }, 50.0, -0.0)] + [DataRow(new[] { double.NaN, double.NaN }, 50.0, double.NaN)] public void NanPercentile_IsBitIdenticalToNumpy(double[] values, double percentile, double expected) { double actual = PercentilePruner.NanPercentile(values, percentile); @@ -180,6 +187,23 @@ public void NanPercentile_IsBitIdenticalToNumpy(double[] values, double percenti $"numpy returns {expected:R} for {string.Join(", ", values)} at q={percentile}, not {actual:R}"); } + /// <summary> + /// QA-85, fixed by NumSharp 0.81.0: the median of <c>[0.0, -0.0, -0.0, -1.0]</c> is <c>-0.0</c> in NumPy (2.4.2 and + /// 2.5.4): its partition leaves the two <c>-0.0</c> as the interpolated neighbours. NumSharp 0.80.0's + /// <c>np.nanpercentile</c> and <c>np.percentile</c> returned <c>+0.0</c> (they interpolated between <c>0.0</c> and + /// <c>-0.0</c>, and <c>-0.0 - (-0.0 * 0.5)</c> is <c>+0.0</c>), as did the sort-based port before 2026-11-11. + /// NumSharp 0.81.0 partitions at several kth with NumPy's <c>introselect_</c> statement for statement (its QB43 + /// fix), so the sign is NumPy's. No comparison can observe the sign, so prune decisions never differed. + /// </summary> + [TestMethod] + public void NanPercentile_TiedSignedZeros_KeepNumpysZeroSign() + { + double actual = PercentilePruner.NanPercentile(new[] { 0.0, -0.0, -0.0, -1.0 }, 50.0); + + BitConverter.DoubleToInt64Bits(actual).Should().Be(BitConverter.DoubleToInt64Bits(-0.0), + $"numpy.nanpercentile([0.0, -0.0, -0.0, -1.0], 50) is -0.0, not {actual:R}"); + } + /// <summary> /// Pre-release review item H4 at the pruner level: a trial reporting exactly the interpolated cutoff (or /// a value between numpy's cutoff and the textbook one) gets Optuna's decision, as printed by live Optuna diff --git a/test/OptunaSharp.Tests/QA/DistributionParityBugTests.cs b/test/OptunaSharp.Tests/QA/DistributionParityBugTests.cs index 6af6c0c..150640e 100644 --- a/test/OptunaSharp.Tests/QA/DistributionParityBugTests.cs +++ b/test/OptunaSharp.Tests/QA/DistributionParityBugTests.cs @@ -12,8 +12,9 @@ namespace OptunaSharp.Tests.QA; /// <summary> /// Open parity bugs in the distribution classes, found by the 2026-11-02 parity QA run /// (<c>docs/qa/PARITY_QA_2026-11-02.md</c>, findings QA-1 to QA-10). Every expected value is what -/// Optuna 5.0.0 returns on CPython 3.12 for the same call; each test fails today and passes once the -/// divergence is fixed, at which point its <c>[OpenBugs]</c> attribute should be removed. +/// Optuna 5.0.0 returns on CPython 3.12 for the same call; each <c>[OpenBugs]</c> test fails today and passes +/// once the divergence is fixed, at which point the attribute should be removed. The <c>[Misaligned]</c> tests pin +/// a divergence the owner chose to keep (QA-3, 2026-11-12) and record Optuna's values beside the port's. /// </summary> /// <remarks> /// Most of these come from one root cause: <see cref="FloatDistribution" /> ports @@ -133,42 +134,45 @@ public void FromJson_PythonWrittenSteppedDistribution_ReadsLikePython() } /// <summary> - /// QA-3: magnitudes outside .NET decimal's range must follow Python's unbounded-exponent decimal; the - /// port silently treats values below <c>1e-28</c> as zero, which can even leave <c>high < low</c>. + /// QA-3: Python adjusts a stepped float range with its unbounded-exponent <c>Decimal</c>; the port uses .NET + /// <c>decimal</c>, which reads values below <c>1e-28</c> as zero. <b>Misaligned</b> by the owner's decision of + /// 2026-11-12 (question Q1, answered with QA-62): the port keeps .NET <c>decimal</c>, and this test pins its + /// values. /// </summary> /// <remarks> /// Python: <c>FloatDistribution(0.0, 5e-324, step=0.1).high</c> is <c>0.0</c> (with the "not divisible" /// warning) and <c>FloatDistribution(5e-324, 0.30000000000000004, step=1.0).high</c> is <c>5e-324</c>. - /// The port keeps <c>5e-324</c> in the first case and stores <c>high = 0.0 < low</c> in the second, - /// an invalid distribution that the constructor's own <c>low <= high</c> check forbids. + /// The port keeps <c>5e-324</c> in the first case and stores <c>high = 0.0</c> in the second, below its + /// <c>low</c> of <c>5e-324</c> (the denormal <c>low</c> reads as zero): the documented cost of the decision, + /// reached only by bounds or steps below <c>1e-28</c>. /// </remarks> [TestMethod] - [OpenBugs] - public void SteppedHigh_TinyMagnitudes_FollowPythonDecimal() + [Misaligned] + public void SteppedHigh_TinyMagnitudes_RoundLikeDotNetDecimal() { - new FloatDistribution(0.0, 5e-324, step: 0.1).High.Should().Be(0.0); + new FloatDistribution(0.0, 5e-324, step: 0.1).High.Should().Be(5e-324, "Optuna gives 0.0"); var inverted = new FloatDistribution(5e-324, 0.30000000000000004, step: 1.0); - inverted.High.Should().BeGreaterThanOrEqualTo(inverted.Low, "a distribution must never end below its start"); - inverted.High.Should().Be(5e-324); + inverted.High.Should().Be(0.0, "Optuna gives 5e-324; .NET decimal reads the denormal low as 0"); } /// <summary> /// QA-3 (Python raises): a stepped range whose quotient needs more than 28 digits makes Python's /// decimal raise <c>InvalidOperation</c> (<c>DivisionImpossible</c>); the port builds the distribution. + /// <b>Misaligned</b> by the owner's decision of 2026-11-12 (question Q1): the port keeps .NET <c>decimal</c> + /// and accepts the range. /// </summary> /// <remarks> /// Python: <c>FloatDistribution(0.0, 1e20, step=1e-09)</c> raises - /// <c>decimal.InvalidOperation: [<class 'decimal.DivisionImpossible'>]</c>; NaN or infinite steps - /// and bounds give <c>high=nan</c> or <c>InvalidOperation</c> where the port throws - /// <see cref="FormatException" />. Whether the port should copy this Python limitation is an open - /// question for the owner (see the QA journal); the test pins Optuna's observable behavior. + /// <c>decimal.InvalidOperation: [<class 'decimal.DivisionImpossible'>]</c>; the port keeps + /// <c>high = 1e20</c>. NaN or infinite steps and bounds give <c>high=nan</c> or <c>InvalidOperation</c> in + /// Python where the port throws <see cref="FormatException" />, which the same decision keeps. /// </remarks> [TestMethod] - [OpenBugs] - public void SteppedHigh_QuotientBeyondDecimalPrecision_RaisesLikePython() + [Misaligned] + public void SteppedHigh_QuotientBeyondDecimalPrecision_IsAccepted() { - var act = () => new FloatDistribution(0.0, 1e20, step: 1e-09); - act.Should().Throw<Exception>("Python's decimal context (prec=28) raises DivisionImpossible here"); + new FloatDistribution(0.0, 1e20, step: 1e-09).High.Should().Be(1e20, + "Python's decimal context (prec=28) raises DivisionImpossible here; the port's decimal computes the quotient"); } /// <summary> @@ -224,9 +228,10 @@ public void IntUntransform_SpanOf2Pow63OrMore_DoesNotOverflow() } /// <summary> - /// QA-30: clipping a sampled value to a bound must keep the value's own sign of zero, as - /// <c>np.clip</c> does; <c>MathUtil.Clip</c> is <c>Math.Min(Math.Max(x, low), high)</c>, whose IEEE - /// minimum and maximum order <c>-0.0</c> below <c>+0.0</c>. + /// QA-30 (fixed 2026-11-11): clipping a sampled value to a bound must keep the value's own sign of zero, as + /// <c>np.clip</c>'s const loop does. <c>MathUtil.Clip</c> was <c>Math.Min(Math.Max(x, low), high)</c>, whose IEEE + /// minimum and maximum order <c>-0.0</c> below <c>+0.0</c>; it is now NumPy's const loop (and + /// <c>MathUtil.ClipGeneral</c> NumPy's general loop, for TPE's multi-column discrete clip). /// </summary> /// <remarks> /// <c>np.clip(x, lo, hi)</c> returns <c>x</c> unless it lies strictly outside, so @@ -239,7 +244,6 @@ public void IntUntransform_SpanOf2Pow63OrMore_DoesNotOverflow() /// same helper. Unlike QA-1 the user has to pass a negative-zero bound, so it is rarer. /// </remarks> [TestMethod] - [OpenBugs] public void SteppedFloat_NegativeZeroHigh_TopGridPointIsPositiveZero() { BitConverter.DoubleToInt64Bits(MathUtil.Clip(0.0, -1.0, -0.0)).Should().Be(0L, "np.clip keeps +0.0"); @@ -268,7 +272,9 @@ public void SteppedFloat_NegativeZeroHigh_TopGridPointIsPositiveZero() public void IntToExternalRepr_NonFinite_RaisesLikePython() { var dist = new IntDistribution(0, 10); - ((Action)(() => dist.ToExternalRepr(double.PositiveInfinity))).Should().Throw<OverflowException>(); + // Python's class, which NumSharp provides since 0.81.0: the fix must raise OverflowError with CPython's text. + ((Action)(() => dist.ToExternalRepr(double.PositiveInfinity))).Should().ThrowExactly<OverflowError>() + .WithMessage("cannot convert float infinity to integer"); ((Action)(() => dist.ToExternalRepr(double.NaN))).Should().Throw<ValueError>() .WithMessage("cannot convert float NaN to integer"); } @@ -292,7 +298,9 @@ public void SuggestInt_EnqueuedInfinity_RaisesLikePython() study.EnqueueTrial(new Collections.OrderedDict<string, object?> { ["i"] = double.PositiveInfinity }); var trial = study.Ask(); - ((Action)(() => trial.SuggestInt("i", 0, 10))).Should().Throw<OverflowException>(); + // Python's class, which NumSharp provides since 0.81.0: the fix must raise OverflowError with CPython's text. + ((Action)(() => trial.SuggestInt("i", 0, 10))).Should().ThrowExactly<OverflowError>() + .WithMessage("cannot convert float infinity to integer"); } /// <summary> diff --git a/test/OptunaSharp.Tests/QA/ErrorContractParityBugTests.cs b/test/OptunaSharp.Tests/QA/ErrorContractParityBugTests.cs index 352f07b..104ee44 100644 --- a/test/OptunaSharp.Tests/QA/ErrorContractParityBugTests.cs +++ b/test/OptunaSharp.Tests/QA/ErrorContractParityBugTests.cs @@ -168,8 +168,9 @@ public void DeprecatedClasses_EmitRuntimeFutureWarningLikeOptuna() } /// <summary> - /// QA-17: a CMA-ES <c>x0</c> that misses a parameter of the search space must fail with Python's - /// message; the port throws a <see cref="KeyNotFoundException" /> naming the key. + /// QA-17 (fixed 2026-11-12 by <c>1e8aba6</c>, with run 2's QA-83): a CMA-ES <c>x0</c> that misses a parameter of + /// the search space must fail with Python's message; the port threw a <see cref="KeyNotFoundException" /> naming + /// the key. /// </summary> /// <remarks> /// Optuna 5.0.0 with <c>x0={"x": 1.0, "y": -1.0, "z": 1.0}</c> on a space that also has <c>li</c> @@ -179,7 +180,6 @@ public void DeprecatedClasses_EmitRuntimeFutureWarningLikeOptuna() /// the failure are identical. NIT: the C# text is arguably more helpful, but it is not Optuna's contract. /// </remarks> [TestMethod] - [OpenBugs] public void CmaEs_X0MissingParameter_FailsWithPythonsMessage() { var study = Optuna.CreateStudy(sampler: new CmaEsSampler( diff --git a/test/OptunaSharp.Tests/QA/NumPyReductionOrderTests.cs b/test/OptunaSharp.Tests/QA/NumPyReductionOrderTests.cs new file mode 100644 index 0000000..74305ca --- /dev/null +++ b/test/OptunaSharp.Tests/QA/NumPyReductionOrderTests.cs @@ -0,0 +1,261 @@ +using System; +using System.Collections.Generic; +using System.Reflection; +using AwesomeAssertions; +using OptunaSharp.Samplers; +using OptunaSharp.Samplers.AgeMoea; +using OptunaSharp.Samplers.Janus; +using OptunaSharp.Samplers.Nsgaiii; + +namespace OptunaSharp.Tests.QA; + +/// <summary> +/// Pins the reductions (and the argmax / max / isclose ports) moved onto NumSharp or onto NumPy's statements on +/// 2026-11-11 to NumPy 2.4.2's results for inputs where the replaced hand-written loops answered differently, so each +/// test fails on the old code and passes on NumPy's. NumPy's order +/// is not always a sequential sum: a contiguous run is summed pairwise (eight accumulators from eight elements on), +/// an outer axis of a matrix is summed row by row, and <c>np.linalg.norm(x, p, axis=1)</c> reduces each row pairwise. +/// Every expected value below was printed by NumPy itself (bit patterns, so signs and last bits are exact). +/// </summary> +[TestClass] +public class NumPyReductionOrderTests +{ + /// <summary>Asserts two doubles are the same bits, with a readable message naming both values.</summary> + /// <param name="actual">The value OptunaSharp computed.</param> + /// <param name="expectedBits">NumPy's result as its IEEE-754 bit pattern.</param> + /// <param name="what">What the value is, for the failure message.</param> + private static void ShouldBeBits(double actual, long expectedBits, string what) + => BitConverter.DoubleToInt64Bits(actual).Should().Be(expectedBits, + $"{what} must be NumPy's {BitConverter.Int64BitsToDouble(expectedBits):R}, not {actual:R}"); + + /// <summary> + /// GPSampler's <c>_standardize_values</c> over two objectives and ten trials: NumPy's <c>np.mean(values, axis=0)</c> + /// and <c>np.std(values, axis=0)</c> add the rows in order (a sequential sum per column). The former per-column + /// pairwise sums gave means of <c>100.420794</c> and <c>100.54714200000001</c> where NumPy gives + /// <c>100.42079399999999</c> and <c>100.547142</c>. + /// </summary> + [TestMethod] + public void GpStandardize_TwoObjectives_ColumnStatisticsFollowNumPysAxisZeroOrder() + { + double[,] values = + { + { 100.65128, 97.15331 }, { 104.6579, 104.64801 }, { 101.65433, 99.91153 }, { 100.57431, 96.71228 }, + { 99.28281, 99.6852 }, { 97.4433, 102.54764 }, { 95.72056, 98.63974 }, { 93.24137, 101.49046 }, + { 102.22782, 101.86388 }, { 108.75426, 102.81937 }, + }; + MethodInfo standardize = typeof(GPSampler).GetMethod("StandardizeValues", BindingFlags.NonPublic | BindingFlags.Static)!; + + var (standardized, means, stds) = ((double[,], double[], double[]))standardize.Invoke(null, new object[] { values })!; + + ShouldBeBits(means[0], unchecked((long)0x40591AEE49F51697UL), "np.mean(values, axis=0)[0]"); + ShouldBeBits(means[1], unchecked((long)0x405923045FE11127UL), "np.mean(values, axis=0)[1]"); + ShouldBeBits(stds[0], unchecked((long)0x4010C8A7C6404E4BUL), "np.std(values, axis=0)[0]"); + ShouldBeBits(stds[1], unchecked((long)0x4003887101742D6CUL), "np.std(values, axis=0)[1]"); + // (v - mean) / max(EPS, std), one subtraction and one division per element, as NumPy's broadcast ufuncs. + standardized[3, 1].Should().Be((values[3, 1] - means[1]) / stds[1]); + } + + /// <summary> + /// AGE-MOEA's survival norms over a ten-objective front: pymoo's <c>np.linalg.norm(front, 2, axis=1)</c> is + /// <c>sqrt(add.reduce(x * x, axis=1))</c>, a pairwise sum of the squares. The former left-to-right sum gave + /// <c>1.9441723203124253</c> where NumPy gives <c>1.9441723203124255</c>. + /// </summary> + [TestMethod] + public void AgeMoeaRowNorms_TenObjectives_FollowNumPysPairwiseRowSums() + { + double[][] front = + { + new[] { 0.207855, 0.335135, 0.567565, 0.957842, 0.936312, 0.073896, 0.853314, 0.167824, 0.811433, 0.296347 }, + }; + + double[] norms = AgeMoeaSurvival.RowNorms(front, 2.0); + + norms.Should().HaveCount(1); + ShouldBeBits(norms[0], unchecked((long)0x3FFF1B546F587C20UL), "np.linalg.norm(front, 2, axis=1)[0]"); + } + + /// <summary> + /// JANUS's fallback objective for a valueless trial, the reference's <c>float(np.mean(rae))</c> over ten component + /// losses: NumPy sums them pairwise. A LINQ <c>Average()</c> gave <c>0.738784</c> where NumPy gives + /// <c>0.7387840000000001</c>. + /// </summary> + [TestMethod] + public void JanusComponentMean_TenComponents_IsNumPysPairwiseMean() + { + double[] rae = { 0.41115, 1.10275, 0.52537, 0.83257, 0.04189, 0.56352, 0.54136, 1.83826, 1.17594, 0.35503 }; + MethodInfo componentMean = typeof(JanusOptimizer).GetMethod("ComponentMean", BindingFlags.NonPublic | BindingFlags.Static)!; + + double mean = (double)componentMean.Invoke(null, new object[] { rae })!; + + ShouldBeBits(mean, unchecked((long)0x3FE7A41E57D9DBAAUL), "np.mean(rae)"); + } + + /// <summary> + /// NSGA-III's reference-point association over eight objectives (Optuna's + /// <c>_associate_individuals_with_reference_points</c> with the default 120 reference points): + /// <c>np.linalg.norm(differences, axis=2)</c> sums each row's eight squares pairwise. The former left-to-right + /// sum gave the closest line (index 50) a distance of <c>0.8832043678688792</c> where NumPy gives + /// <c>0.8832043678688793</c>; with seven objectives or fewer the two orders agree. + /// </summary> + [TestMethod] + public void NsgaiiiAssociation_EightObjectives_DistanceIsNumPysPairwiseRowNorm() + { + double[,] objectives = { { 0.076308, 0.779919, 0.438409, 0.723465, 0.97799, 0.538496, 0.50112, 0.072051 } }; + double[,] referencePoints = NSGAIIIElitePopulationSelectionStrategy.GenerateDefaultReferencePoint(8, 3); + MethodInfo associate = typeof(NSGAIIIElitePopulationSelectionStrategy) + .GetMethod("AssociateIndividualsWithReferencePoints", BindingFlags.NonPublic | BindingFlags.Static)!; + + var (closest, distance) = ((int[], double[]))associate.Invoke(null, new object[] { objectives, referencePoints })!; + + closest.Should().Equal(50); + ShouldBeBits(distance[0], unchecked((long)0x3FEC4335CE75CC4FUL), "np.min(np.linalg.norm(..., axis=2), axis=1)[0]"); + } + + /// <summary> + /// Every port of Optuna's <c>np.argmax</c> calls follows NumPy's rule: a NaN is maximal, so the first NaN wins; + /// otherwise the first maximum wins, a tie keeping the earlier index (<c>-0.0</c> and <c>0.0</c> tie). The + /// expected indices are NumPy 2.4.2's. The strict <c>></c> loops these helpers used until 2026-11-11 skipped + /// NaNs (QA-29 for TPE's <c>_compare</c>, QA-53's class for the GP sampler, its optimizer and the EMMR terminator, + /// and the HSSP greedy step, whose contributions turn NaN once a <c>-inf</c> loss makes the volume infinite). The + /// TPE and HSSP helpers keep a loop (they run per parameter / per greedy step); the others call NumSharp's + /// <c>np.argmax</c>. + /// </summary> + /// <param name="values">The scores, as NumPy sees them.</param> + /// <param name="expected">NumPy's <c>np.argmax(values)</c>.</param> + [TestMethod] + [DataRow(new[] { 0.1, -0.2, double.NaN, 0.3, double.NaN }, 2)] + [DataRow(new[] { double.NaN, 5.0 }, 0)] + [DataRow(new[] { 0.0, -0.0, 1.0, 1.0 }, 2)] + [DataRow(new[] { -0.0, 0.0 }, 0)] + [DataRow(new[] { double.NegativeInfinity, double.NegativeInfinity }, 0)] + [DataRow(new[] { 1.0, double.PositiveInfinity, double.NaN }, 2)] + [DataRow(new[] { 2.0, 3.0, 3.0 }, 1)] + public void ArgMaxPorts_FirstNanThenFirstMaximum_LikeNumPysArgmax(double[] values, int expected) + { + const BindingFlags PrivateStatic = BindingFlags.NonPublic | BindingFlags.Static; + int Call(Type type, string name, params object[] arguments) + => (int)type.GetMethod(name, PrivateStatic)!.Invoke(null, arguments)!; + + Call(typeof(TPESampler), "ArgMax", values).Should().Be(expected, "TPESampler._compare's np.argmax"); + Call(typeof(GPSampler), "ArgMax", values).Should().Be(expected, "GPSampler's np.argmax(y_with_neginf)"); + Call(typeof(OptunaSharp.Internal.Hypervolume), "ArgMax", (IReadOnlyList<double>)values) + .Should().Be(expected, "hssp's np.argmax(contribs)"); + Call(typeof(OptunaSharp.Gp.OptimMixed), "Argmax", values).Should().Be(expected, "optim_mixed's np.argmax"); + Call(typeof(OptunaSharp.Terminator.EMMREvaluator), "ArgMax", values, values.Length) + .Should().Be(expected, "EMMREvaluator's np.argmax(standarized_score_vals)"); + + // GPSampler's single-objective np.argmax(standardized_score_vals) over the (n, 1) score matrix. + var column = new double[values.Length, 1]; + for (int i = 0; i < values.Length; i++) + column[i, 0] = values[i]; + Call(typeof(GPSampler), "ArgMaxColumn", column, 0).Should().Be(expected, "np.argmax(standardized_score_vals)"); + } + + /// <summary> + /// GPSampler's LogEI threshold, <c>standardized_score_vals[:, 0].max()</c>: NumPy's max propagates a NaN (QA-53: + /// overflowing objective values leave NaNs after standardization, and Optuna's line search then fails). The loop + /// used until 2026-11-11 skipped NaNs. + /// </summary> + [TestMethod] + public void GpColumnMax_ColumnWithNaN_IsNaNLikeNumPysMax() + { + double[,] scores = { { 1.0, 9.0 }, { double.NaN, 8.0 }, { 3.0, 7.0 } }; + MethodInfo columnMax = typeof(GPSampler).GetMethod("ColumnMax", BindingFlags.NonPublic | BindingFlags.Static)!; + + ((double)columnMax.Invoke(null, new object[] { scores, 0 })!).Should().Be(double.NaN); + ((double)columnMax.Invoke(null, new object[] { scores, 1 })!).Should().Be(9.0); + } + + /// <summary> + /// The regret bound's <c>np.max(lcb_acqf.eval_acqf_no_grad(...))</c> and <c>.max()</c> of the UCB values: NumPy's + /// max propagates a NaN acquisition value (QA-53's class); the loop used until 2026-11-11 skipped it. + /// </summary> + [TestMethod] + public void RegretBoundMax_ValuesWithNaN_IsNaNLikeNumPysMax() + { + MethodInfo max = typeof(OptunaSharp.Terminator.RegretBoundEvaluator) + .GetMethod("Max", BindingFlags.NonPublic | BindingFlags.Static)!; + + ((double)max.Invoke(null, new object[] { new[] { 0.5, double.NaN, 2.0 } })!).Should().Be(double.NaN); + ((double)max.Invoke(null, new object[] { new[] { 0.5, 2.0, -1.0 } })!).Should().Be(2.0); + } + + /// <summary> + /// <see cref="OptunaSharp.Internal.MathUtil.Clip" /> is NumPy's const clip loop (scalar bounds: a value on a bound + /// keeps its own zero sign, a NaN bound is the result) and <see cref="OptunaSharp.Internal.MathUtil.ClipGeneral" /> + /// its general loop (array bounds: a value on a bound becomes the bound). Each expected value is NumPy 2.4.2's, + /// and NumSharp's <c>np.clip</c> must give the same on the matching layout: a scalar call for the const loop, an + /// (n, 2) block against per-column bounds for the general loop. QA-30 is the const half: a stepped float with + /// the upper bound <c>-0.0</c>. + /// </summary> + /// <param name="value">The clipped value.</param> + /// <param name="low">The lower bound.</param> + /// <param name="high">The upper bound.</param> + /// <param name="constBits">NumPy's <c>np.clip(value, low, high)</c> on scalars, as IEEE bits.</param> + /// <param name="generalBits">NumPy's result for the same element in an (n, 2) block with per-column bounds, as IEEE bits.</param> + [TestMethod] + [DataRow(-0.0, 0.0, 1.0, long.MinValue, 0L)] + [DataRow(0.0, -0.0, 1.0, 0L, long.MinValue)] + [DataRow(0.0, -1.0, -0.0, 0L, long.MinValue)] + [DataRow(-0.0, -1.0, 0.0, long.MinValue, 0L)] + [DataRow(0.5, 0.0, 1.0, 0x3FE0000000000000L, 0x3FE0000000000000L)] + [DataRow(2.0, 0.0, 1.0, 0x3FF0000000000000L, 0x3FF0000000000000L)] + [DataRow(-3.0, 0.0, 1.0, 0L, 0L)] + public void MathUtilClip_ConstAndGeneralLoops_MatchNumPyAndNumSharp( + double value, double low, double high, long constBits, long generalBits) + { + BitConverter.DoubleToInt64Bits(OptunaSharp.Internal.MathUtil.Clip(value, low, high)) + .Should().Be(constBits, "NumPy's const loop (scalar bounds)"); + BitConverter.DoubleToInt64Bits(OptunaSharp.Internal.MathUtil.ClipGeneral(value, low, high)) + .Should().Be(generalBits, "NumPy's general loop (array bounds)"); + + using (NumSharp.NDArray scalar = NumSharp.NDArray.Scalar(value)) + using (NumSharp.NDArray lo = NumSharp.NDArray.Scalar(low)) + using (NumSharp.NDArray hi = NumSharp.NDArray.Scalar(high)) + using (NumSharp.NDArray clipped = NumSharp.np.clip(scalar, lo, hi)) + BitConverter.DoubleToInt64Bits((double)clipped).Should().Be(constBits, "NumSharp's np.clip on scalars"); + + // The element sits in column 0 of a (3, 2) block; column 1 is an unrelated parameter with bounds [0, 1]. + using (NumSharp.NDArray block = NumSharp.np.array(new[,] { { value, 0.3 }, { 0.5, 0.2 }, { 0.25, 0.1 } })) + using (NumSharp.NDArray lows = NumSharp.np.array(new[] { low, 0.0 })) + using (NumSharp.NDArray highs = NumSharp.np.array(new[] { high, 1.0 })) + using (NumSharp.NDArray clipped = NumSharp.np.clip(block, lows, highs)) + BitConverter.DoubleToInt64Bits(clipped.GetDouble(0, 0)).Should().Be(generalBits, "NumSharp's np.clip with array bounds"); + } + + /// <summary> + /// <see cref="OptunaSharp.Internal.MathUtil.IsClose" /> is NumPy's <c>np.isclose</c> for two floats: each case is + /// NumPy 2.4.2's answer, and NumSharp's <c>np.isclose</c> (which the helper does not call, for speed) must agree + /// on it too. The infinite rows are QA-50's: <c>enqueue_trial(skip_if_exists=True)</c> calls + /// <c>np.isclose(new, existing, atol=0.0, equal_nan=True)</c>, whose <c>isfinite(b)</c> and <c>a == b</c> terms the + /// former bare inequality lacked (it called a repeated <c>inf</c> new and a finite value over an <c>inf</c> a + /// repeat). + /// </summary> + /// <param name="a">NumPy's <c>a</c>.</param> + /// <param name="b">NumPy's <c>b</c>.</param> + /// <param name="atol">The absolute tolerance (NumPy's default <c>1e-8</c>, or the enqueue check's <c>0.0</c>).</param> + /// <param name="equalNan">Whether two NaNs are close.</param> + /// <param name="expected">NumPy's <c>np.isclose(a, b, atol=atol, equal_nan=equal_nan)</c>.</param> + [TestMethod] + [DataRow(double.PositiveInfinity, double.PositiveInfinity, 0.0, true, true)] + [DataRow(5.0, double.PositiveInfinity, 0.0, true, false)] + [DataRow(double.NegativeInfinity, double.PositiveInfinity, 0.0, true, false)] + [DataRow(double.PositiveInfinity, double.NegativeInfinity, 0.0, true, false)] + [DataRow(double.NaN, double.NaN, 0.0, true, true)] + [DataRow(double.NaN, double.NaN, 1e-8, false, false)] + [DataRow(1.0, 1.00001, 1e-8, false, true)] + [DataRow(1.0, 1.0000101, 1e-8, false, false)] + [DataRow(0.0, -0.0, 1e-8, false, true)] + [DataRow(1e-8, 0.0, 1e-8, false, true)] + [DataRow(0.0, 1e-8, 1e-8, false, true)] + [DataRow(2e-8, 0.0, 1e-8, false, false)] + public void MathUtilIsClose_EdgeCases_MatchNumPyAndNumSharp(double a, double b, double atol, bool equalNan, bool expected) + { + OptunaSharp.Internal.MathUtil.IsClose(a, b, atol: atol, equalNan: equalNan).Should().Be(expected, "NumPy's np.isclose"); + + using NumSharp.NDArray left = NumSharp.NDArray.Scalar(a); + using NumSharp.NDArray right = NumSharp.NDArray.Scalar(b); + using NumSharp.NDArray close = NumSharp.np.isclose(left, right, atol: atol, equal_nan: equalNan); + ((bool)close).Should().Be(expected, "NumSharp's np.isclose"); + } +} diff --git a/test/OptunaSharp.Tests/QA/PlotlyParityBugTests.cs b/test/OptunaSharp.Tests/QA/PlotlyParityBugTests.cs index 60f94b4..c636844 100644 --- a/test/OptunaSharp.Tests/QA/PlotlyParityBugTests.cs +++ b/test/OptunaSharp.Tests/QA/PlotlyParityBugTests.cs @@ -146,4 +146,25 @@ public void PlotContour_FourParameterGrid_BottomRowDomainStartsAtZeroLikePlotly( ((double)figure.SelectToken("layout.yaxis13.domain[0]")!).Should().Be(0.0); ((double)figure.SelectToken("layout.yaxis13.domain[1]")!).Should().Be(0.19375); } + + /// <summary> + /// QA-88: the rank plot's colorbar quantiles are <c>np.quantile(sorted_target_values, coloridxs)</c>, which + /// interpolates with NumPy's <c>_lerp</c>: <c>b - (b - a) * (1 - t)</c> from <c>t = 0.5</c> on. The 75% tick between + /// <c>-3.3</c> and <c>0.2</c> is <c>-0.675</c> in NumPy 2.4.2 (<c>0xBFE599999999999A</c>); the textbook + /// <c>a + (b - a) * t</c> the renderer used until 2026-11-11 gave <c>-0.6749999999999998</c>. It now calls + /// NumSharp's <c>np.quantile</c>. <c>PlotlyColors</c> is internal to the Plotly package, hence the reflection. + /// </summary> + [TestMethod] + public void RankColorbarQuantile_TopQuartileBetweenTwoValues_InterpolatesLikeNumPysLerp() + { + var plotlyColors = typeof(PlotlyVisualization).Assembly + .GetType("OptunaSharp.Visualization.Plotly.Internal.PlotlyColors", throwOnError: true)!; + var quantileSorted = plotlyColors.GetMethod("QuantileSorted", + System.Reflection.BindingFlags.Public | System.Reflection.BindingFlags.Static)!; + + double quantile = (double)quantileSorted.Invoke(null, new object[] { new[] { -3.3, 0.2 }, 0.75 })!; + + System.BitConverter.DoubleToInt64Bits(quantile).Should().Be(unchecked((long)0xBFE599999999999AUL), + $"np.quantile([-3.3, 0.2], 0.75) is -0.675, not {quantile:R}"); + } } diff --git a/test/OptunaSharp.Tests/QA/RealWorldExampleBugTests.cs b/test/OptunaSharp.Tests/QA/RealWorldExampleBugTests.cs index c7126ad..0275643 100644 --- a/test/OptunaSharp.Tests/QA/RealWorldExampleBugTests.cs +++ b/test/OptunaSharp.Tests/QA/RealWorldExampleBugTests.cs @@ -37,6 +37,60 @@ private static string CaptureStderr(Action action) return writer.ToString(); } + /// <summary>Log handler that keeps the text of every record it receives, in order.</summary> + /// <remarks>Registered for one test at a time; records from other threads' studies can interleave.</remarks> + private sealed class CollectingHandler : OptunaSharp.Logging.ILogHandler + { + /// <summary>The messages received so far, oldest first.</summary> + public System.Collections.Generic.List<string> Messages { get; } = new(); + + /// <summary>Stores the record's message; never throws, so it cannot disturb the code under test.</summary> + /// <param name="record">The log record delivered by <see cref="OptunaSharp.Logging.OptunaLogging" />.</param> + public void Emit(in OptunaSharp.Logging.LogRecord record) + { + lock (Messages) + Messages.Add(record.Message); + } + } + + /// <summary> + /// A single-objective objective that returns NaN must be logged with the value it returned, as + /// Optuna's <c>repr(value_or_values)</c> does: <c>Trial 0 failed with value nan.</c>; the port logs + /// <c>[nan]</c>. + /// </summary> + /// <remarks> + /// <c>optuna/study/_optimize.py</c> (<c>_log_failed_trial</c>) warns + /// <c>f"Trial {trial_number} failed with value {repr(value_or_values)}."</c> with the objective's own + /// return value — a float for a single-objective study. The single-objective <c>Study.Optimize</c> + /// overload wraps the scalar into a one-element array before the loop runs, and + /// <c>Internal/Optimize.cs</c> (<c>LogFailedTrial</c>) prints that array with <c>ListRepr</c>. The same + /// scalar-wrapping root cause as QA-12 (the skipped-tell message), on a different message. Found by + /// diffing the logs of a real-world run (<c>examples/0_GpuFineTunePlanner.cs</c> returns NaN for + /// diverged fp16 runs) against Optuna 5.0.0. + /// </remarks> + [TestMethod] + [OpenBugs] + public void Optimize_NaNScalarObjective_LogsScalarValueLikePython() + { + var handler = new CollectingHandler(); + int verbosity = OptunaSharp.Logging.OptunaLogging.GetVerbosity(); + OptunaSharp.Logging.OptunaLogging.SetVerbosity(OptunaSharp.Logging.LogLevel.Info); + OptunaSharp.Logging.OptunaLogging.AddHandler(handler); + try + { + var study = Optuna.CreateStudy(); + study.Optimize(_ => double.NaN, nTrials: 1); + } + finally + { + // Global logging state: always restore it, or later tests log at the wrong level. + OptunaSharp.Logging.OptunaLogging.RemoveHandler(handler); + OptunaSharp.Logging.OptunaLogging.SetVerbosity(verbosity); + } + + handler.Messages.Should().Contain("Trial 0 failed with value nan."); + } + /// <summary> /// The progress bar's running best must be formatted like Optuna's <c>f"{study.best_value:.6g}"</c> /// (six significant digits: <c>0.930382</c>, <c>1.23457e+06</c>); the port prints the full float repr. diff --git a/test/OptunaSharp.Tests/QA/Run2ArtifactParityBugTests.cs b/test/OptunaSharp.Tests/QA/Run2ArtifactParityBugTests.cs new file mode 100644 index 0000000..242fc55 --- /dev/null +++ b/test/OptunaSharp.Tests/QA/Run2ArtifactParityBugTests.cs @@ -0,0 +1,53 @@ +using System; +using System.IO; +using AwesomeAssertions; +using OptunaSharp.Artifacts; + +namespace OptunaSharp.Tests.QA; + +/// <summary> +/// Open parity bugs in the artifact functions found by the 2026-11-10 parity QA run +/// (<c>docs/qa/PARITY_QA_2026-11-10.md</c>). A test marked <c>[OpenBugs]</c> fails until its divergence is fixed. +/// </summary> +[TestClass] +public class Run2ArtifactParityBugTests +{ + /// <summary> + /// QA-78: <c>download_artifact</c> refuses any existing path with <c>os.path.exists(file_path)</c>, which is true for + /// a directory too, so Optuna raises <c>FileExistsError("File already exists: …")</c>. The port checks + /// <c>File.Exists</c>, false for a directory, then opens the directory as a file and fails with + /// <c>UnauthorizedAccessException("Access to the path '…' is denied.")</c> on Windows. The port's file case + /// already raises <c>IOException("File already exists: …")</c>, its mapping of <c>FileExistsError</c>. + /// <b>Fixed 2026-11-12:</b> the existence check covers directories too, as <c>os.path.exists</c> does; since + /// NumSharp 0.81.0 both cases raise Python's own class, <c>NumSharp.FileExistsError</c> (an <c>IOException</c>). + /// </summary> + [TestMethod] + public void DownloadOntoAnExistingDirectory_RaisesFileExistsLikeOptuna() + { + string root = Path.Combine(Path.GetTempPath(), "optunasharp-qa78-" + Guid.NewGuid().ToString("N")); + try + { + Directory.CreateDirectory(Path.Combine(root, "store")); + string target = Directory.CreateDirectory(Path.Combine(root, "target")).FullName; + var store = new FileSystemArtifactStore(Path.Combine(root, "store")); + string source = Path.Combine(root, "a.txt"); + File.WriteAllText(source, "x"); + string artifactId = ArtifactFunctions.UploadArtifact(store, source, Optuna.CreateStudy()); + + Action download = () => ArtifactFunctions.DownloadArtifact(store, target, artifactId); + + download.Should().ThrowExactly<NumSharp.FileExistsError>().WithMessage("File already exists: " + target); + } + finally + { + // Best effort: the temp folder is cleaned later if a handle is still open. + try + { + Directory.Delete(root, recursive: true); + } + catch (IOException) + { + } + } + } +} diff --git a/test/OptunaSharp.Tests/QA/Run2DistributionParityBugTests.cs b/test/OptunaSharp.Tests/QA/Run2DistributionParityBugTests.cs new file mode 100644 index 0000000..b18da54 --- /dev/null +++ b/test/OptunaSharp.Tests/QA/Run2DistributionParityBugTests.cs @@ -0,0 +1,51 @@ +using AwesomeAssertions; +using OptunaSharp.Distributions; +using OptunaSharp.Samplers; + +namespace OptunaSharp.Tests.QA; + +/// <summary> +/// Distribution parity findings of the 2026-11-10 parity QA run (<c>docs/qa/PARITY_QA_2026-11-10.md</c>). Optuna's +/// values are what Optuna 5.0.0 produces on CPython 3.12. A test marked <c>[OpenBugs]</c> fails until its divergence is +/// fixed; a test marked <c>[Misaligned]</c> pins a divergence the owner chose to keep. +/// </summary> +[TestClass] +public class Run2DistributionParityBugTests +{ + /// <summary> + /// QA-62 (the QA-3 root cause, beyond the range QA-3 describes): Python parses <c>str(x)</c> into a + /// <c>Decimal</c> exactly and computes in a 28-significant-digit context; .NET's <c>decimal</c> keeps at most 28 + /// digits after the decimal point. A value whose shortest repr needs more places (a 17-digit double below about + /// <c>1e-11</c>, such as <c>4.1271208719049127e-14</c>) is rounded on the way in, so the stepped-high adjustment + /// and BruteForce's candidate grid come out differently, even though the value is well inside decimal's range. + /// </summary> + /// <remarks> + /// <para> + /// Measured over 100,000 random stepped ranges after the QA-2 / QA-11 fix (<c>PyNumbers.DecimalToDouble</c>, + /// which made the final conversion correct): 1,439 adjusted <c>high</c>s differ by one ULP and 184 of 5,000 + /// candidate grids differ, every one among the 3,021 inputs whose repr needs more than 28 decimal places. + /// Optuna: <c>FloatDistribution(4.1271208719049127e-14, 4.085121318968367e-13, step=1e-15).high</c> is + /// <c>4.0827120871904913e-13</c> (the port: one ULP below); <c>_enumerate_candidates(2.942974008882182e-14, + /// 5.614297400888218e-13, 2e-15)</c> has 266 values ending at <c>5.594297400888218e-13</c> (the port: 267). + /// </para> + /// <para> + /// <b>Misaligned</b> by the owner's decision of 2026-11-12 (asked together with QA-3's question Q1): the port + /// keeps .NET <c>decimal</c>, and this test pins its values. The FloatDistribution and BruteForce docs state + /// the rounding. + /// </para> + /// </remarks> + [TestMethod] + [Misaligned] + public void SteppedHigh_ValuesBeyond28DecimalPlaces_RoundLikeDotNetDecimal() + { + var adjusted = new FloatDistribution(4.1271208719049127e-14, 4.085121318968367e-13, step: 1e-15); + adjusted.High.Should().Be(4.082712087190491e-13, "Optuna gives 4.0827120871904913e-13, one ULP above"); + + var grid = new FloatDistribution(2.942974008882182e-14, 5.615524728866719e-13, step: 2e-15); + grid.High.Should().Be(5.614297400888218e-13); + var candidates = BruteForceSampler.EnumerateCandidates( + new BruteForceSampler.ChoicesArgs(grid.Low, grid.High, grid.Step, isInt: false)); + candidates.Should().HaveCount(267, "Optuna lists 266 values"); + candidates[^1].Should().Be(5.614297400888218e-13, "Optuna's last value is 5.594297400888218e-13"); + } +} diff --git a/test/OptunaSharp.Tests/QA/Run2IntegrationParityBugTests.cs b/test/OptunaSharp.Tests/QA/Run2IntegrationParityBugTests.cs new file mode 100644 index 0000000..5da603b --- /dev/null +++ b/test/OptunaSharp.Tests/QA/Run2IntegrationParityBugTests.cs @@ -0,0 +1,50 @@ +using System.Collections.Generic; +using AwesomeAssertions; +using OptunaSharp.Distributions; +using OptunaSharp.Integration; +using OptunaSharp.Integration.Sklearn; + +namespace OptunaSharp.Tests.QA; + +/// <summary> +/// Open parity bugs in the integrations found by the 2026-11-10 parity QA run (<c>docs/qa/PARITY_QA_2026-11-10.md</c>). +/// Each test fails today and passes once fixed, at which point its <c>OpenBugs</c> category should be removed. +/// </summary> +[TestClass] +public class Run2IntegrationParityBugTests +{ + /// <summary> + /// QA-81: optuna-integration's <c>OptunaSearchCV.__init__</c> stores <c>self.n_jobs = n_jobs if n_jobs else 1</c>, + /// so <c>n_jobs=0</c> (falsy) runs sequentially like <c>None</c>. The port maps only <c>null</c> to 1 + /// (<c>nJobs ?? 1</c>) and hands 0 to <c>Study.Optimize</c>, which refuses it like <c>ThreadPoolExecutor</c>: + /// <c>ValueError("max_workers must be greater than 0")</c>. + /// </summary> + /// <remarks> + /// Measured with optuna-integration (vendored) and scikit-learn: <c>OptunaSearchCV(RandomForestRegressor( + /// n_estimators=5, random_state=0), {"max_depth": IntDistribution(1, 4)}, n_trials=2, n_jobs=0, + /// random_state=0).fit(X, y)</c> completes two trials and reports <c>n_jobs == 1</c>, the same as + /// <c>n_jobs=None</c> and <c>n_jobs=1</c>; the port's <c>Fit()</c> throws. + /// <b>Fixed 2026-11-12:</b> <c>nJobs: 0</c> maps to 1, optuna-integration's <c>n_jobs if n_jobs else 1</c>. + /// </remarks> + [TestMethod] + public void OptunaSearchCV_NJobsZero_RunsSequentiallyLikeOptunaIntegration() + { + // Any regression data will do: the defect is in argument handling, before the first fold is fitted. + var x = new double[30, 3]; + var y = new double[30]; + for (int i = 0; i < 30; i++) + { + for (int j = 0; j < 3; j++) + x[i, j] = ((i * 7 + j * 3) % 11) / 10.0; + y[i] = 2 * x[i, 0] + 0.1 * x[i, 2]; + } + var estimator = new SklearnEstimator(new RandomForestRegressor(nEstimators: 5, randomState: 0), x, y); + var search = new OptunaSearchCV(estimator, + new Dictionary<string, BaseDistribution> { ["max_depth"] = new IntDistribution(1, 4) }, + nTrials: 2, nJobs: 0, randomState: 0); + + search.Fit(); + + search.NTrials.Should().Be(2); + } +} diff --git a/test/OptunaSharp.Tests/QA/Run2SamplerParityBugTests.cs b/test/OptunaSharp.Tests/QA/Run2SamplerParityBugTests.cs new file mode 100644 index 0000000..0ea2261 --- /dev/null +++ b/test/OptunaSharp.Tests/QA/Run2SamplerParityBugTests.cs @@ -0,0 +1,502 @@ +using AwesomeAssertions; +using OptunaSharp.Samplers; + +namespace OptunaSharp.Tests.QA; + +/// <summary> +/// Sampler parity bugs found by the 2026-11-10 parity QA run (<c>docs/qa/PARITY_QA_2026-11-10.md</c>). Expected +/// values are what Optuna 5.0.0 produces on CPython 3.12 / NumPy 2.4.2. A test marked <c>[OpenBugs]</c> fails until +/// its divergence is fixed; the attribute is removed with the fix, and the test then guards against a regression. +/// </summary> +[TestClass] +public class Run2SamplerParityBugTests +{ + /// <summary> + /// Runs a three-trial NSGA-III study (population 2, two maximized objectives) whose first generation returns + /// <c>(+inf, +inf)</c> for both trials, so the second generation's parents come from a front whose normalized + /// objectives are all NaN. + /// </summary> + /// <param name="seed">The sampler seed; the same seed drives Optuna's run that produced the expected values.</param> + /// <returns>The finished study; its third trial is the first child of the all-infinite generation.</returns> + /// <remarks> + /// Both objectives are infinite for every member of the borderline front, so <c>_filter_inf</c> finds no finite + /// value in either column and returns NaN everywhere, and every distance to a reference line is NaN. + /// </remarks> + private static Study RunAllInfiniteFirstGeneration(int seed) + { + var study = Optuna.CreateStudy( + directions: new[] { StudyDirection.Maximize, StudyDirection.Maximize }, + sampler: new NSGAIIISampler(populationSize: 2, seed: seed)); + study.Optimize(t => + { + double x = t.SuggestFloat("x", 0, 1); + double y = t.SuggestFloat("y", 0, 1); + // Generation 0 (trials 0 and 1) is entirely infinite; later trials return their parameters. + return t.Number < 2 + ? new[] { double.PositiveInfinity, double.PositiveInfinity } + : new[] { x, y }; + }, nTrials: 3); + return study; + } + + /// <summary> + /// QA-56: NSGA-III's niche preservation sorts the borderline front's <c>(distance, index)</c> pairs with + /// Python's <c>list.sort(reverse=True)</c>, under which a pair holding a NaN distance is neither smaller nor larger + /// than another, so timsort keeps such pairs in their original order and <c>pop()</c> takes the last one first. + /// The port's comparer orders NaN as equal to NaN and then by index, which reverses them: the elite population + /// comes out as <c>[T0, T1]</c> where Optuna builds <c>[T1, T0]</c>, and the next child copies the other parent's + /// genes. + /// </summary> + /// <remarks> + /// Optuna 5.0.0, seed 0: the third trial is <c>x=0.4236547993389047, y=0.7151893663724195</c>; the port gives + /// <c>y=0.5448831829968969</c> (the other parent's value). Seed 3: Optuna <c>x=0.5507979025745755, + /// y=0.510827605197663</c>, the port <c>x=0.2909047389129443, y=0.7081478226181048</c>. Instrumenting Optuna's + /// <c>_preserve_niche_individuals</c> shows closest reference points <c>[0, 0]</c>, distances <c>[nan, nan]</c> + /// and the order <c>[1, 0]</c>. Any front whose members are all non-finite in one objective (an objective that + /// returns <c>inf</c> to signal a failed evaluation) reaches this path. Finite ties sort identically in both. + /// <b>Fixed 2026-11-12:</b> the borderline front is sorted by <c>PyListSort</c>, a port of CPython 3.12's + /// <c>list.sort</c>, with Python's tuple <c><</c> (<c>DistanceIndexLessThan</c>); checked against 353 recorded + /// CPython sorts in <c>oracle/cpython_order.json</c>. + /// </remarks> + [TestMethod] + public void Nsga3_AllInfiniteBorderlineFront_KeepsPythonsNichingOrder() + { + var seed0 = RunAllInfiniteFirstGeneration(0).Trials[2]; + ((double)seed0.Params["x"]!).Should().Be(0.4236547993389047); + ((double)seed0.Params["y"]!).Should().Be(0.7151893663724195); + + var seed3 = RunAllInfiniteFirstGeneration(3).Trials[2]; + ((double)seed3.Params["x"]!).Should().Be(0.5507979025745755); + ((double)seed3.Params["y"]!).Should().Be(0.510827605197663); + } + + /// <summary> + /// Runs 19 trials of a seeded genetic sampler through Optuna's documented batch pattern (ask five trials, evaluate + /// them, tell all five) on one thread, over a categorical and a log-scaled float parameter. + /// </summary> + /// <param name="sampler">A fresh NSGA-II or NSGA-III sampler (population 6, seed 311031104).</param> + /// <returns>The finished study; trials 15 to 18 form the last batch, all running while each is sampled.</returns> + /// <remarks>The objective is a fixed function of the two values, so both languages tell identical values.</remarks> + private static Study RunBatchedAskTell(BaseSampler sampler) + { + var study = Optuna.CreateStudy(direction: StudyDirection.Maximize, sampler: sampler); + var choices = new OptunaSharp.Distributions.CategoricalChoice[] { 1, "a" }; + int n = 0; + while (n < 19) + { + // Ask a whole batch before telling any of it, as Optuna's "Batch Optimization" tutorial does. + var batch = new System.Collections.Generic.List<(Trial Trial, double Value)>(); + for (int b = 0; b < 5 && n < 19; b++, n++) + { + var trial = study.Ask(); + var c = trial.SuggestCategorical("lr2", choices); + double v = trial.SuggestFloat("v5", 1e-05, 1.0, log: true); + double a = v * 0.37 - 1; + batch.Add((trial, (c.Equals(choices[0]) ? 0 : 1) * 0.5 + a * a)); + } + foreach (var (trial, value) in batch) + study.Tell(trial, value); + } + return study; + } + + /// <summary> + /// QA-57: the genetic samplers' running-trial redraw (plan 12, <c>HandedOutParams.Claim</c>) changes the seeded + /// trajectory of a single-threaded batched ask/tell, and it calls two children duplicates when mutation dropped a + /// parameter that each trial then samples on its own. Trial 18's child is <c>{lr2: 'a'}</c> (its <c>v5</c> was + /// mutated away, so <c>v5</c> comes from the random sampler); trial 15, still running, holds the same partial + /// child, so the port generates three more children and keeps the last one, whose <c>v5</c> is inherited from + /// trial 1. Optuna generates one child and samples <c>v5</c> independently. + /// </summary> + /// <remarks> + /// Optuna 5.0.0 (NSGA-II and NSGA-III alike): trial 18 is <c>lr2='a', v5=0.02621137972316322</c>; the port gave + /// <c>v5=0.00021556396515864647</c> (trial 1's value). Every random draw up to trial 18's mutation decisions is + /// identical (MT19937 states compared at every ask); the extra <c>_child_generation_strategy</c> calls were the + /// divergence. THREADING.md states that runs asking one trial at a time keep Optuna parity; this run asks on one + /// thread too, but keeps five trials running, which Optuna's ask-and-tell tutorial recommends for batch + /// evaluation. Even under real concurrency the two partial children are not one point. + /// <para> + /// Fixed 2026-11-12 (owner's decision): a child is redrawn only when a running trial asked on another thread + /// holds it (<c>HandedOutParams</c> records the claiming thread), so a batch asked on one thread draws exactly + /// what Optuna draws, while concurrent workers stay steered apart (<c>SamplerParallelReadTests</c>). + /// </para> + /// </remarks> + [TestMethod] + public void Nsga_BatchedAskTell_PartialChildIsNotRedrawn() + { + foreach (var sampler in new BaseSampler[] + { + new NSGAIISampler(populationSize: 6, seed: 311031104), + new NSGAIIISampler(populationSize: 6, seed: 311031104), + }) + { + var trial = RunBatchedAskTell(sampler).Trials[18]; + trial.Params["lr2"].Should().Be("a"); + ((double)trial.Params["v5"]!).Should().Be(0.02621137972316322, sampler.GetType().Name); + } + } + + /// <summary> + /// QA-60: CMA-ES with margin feeds <c>CMAwM.tell</c> the raw <c>x_for_tell</c> vectors the generation's trials + /// stored. When the search space loses a dimension before the first generation is told (here <c>y</c>'s range + /// changes on trial 2, so the intersection search space keeps only <c>x</c> and a new one-dimensional optimizer + /// starts at generation 0), that generation mixes two-element and one-element vectors. Optuna's + /// <c>np.array([s[0] for s in solutions])</c> refuses the ragged list and the trial fails with <c>ValueError: + /// setting an array element with a sequence. The requested array has an inhomogeneous shape after 1 dimensions. + /// …</c>; the port's <c>Cma.Tell</c> reads the first <c>n_dim</c> entries of each vector, so the old + /// two-dimensional points are told with their first coordinate standing for a different parameter, and the run + /// carries on. + /// </summary> + /// <remarks> + /// Optuna 5.0.0 / cmaes 0.13.1, seed 0, 12 trials (<c>x</c> int in [0, 10], <c>y</c> float in [0, 1], [0, 1.5] + /// on trial 2 only): population 3 raises at trial 4, population 4 at trial 5 (the inhomogeneous-shape error), + /// population 2 at trial 3 (<c>non-broadcastable output operand with shape (1,) doesn't match the broadcast + /// shape (2,)</c>, the uniform-length variant). The port finishes all 12 trials in each case. Optuna's crash is + /// arguably a defect of its own, but the port's silent misaligned update is no better; the owner decides whether + /// to raise as Optuna does or to guard the tell. Found by the dynamic-range program fuzz (11 of 68 CMA-ES + /// programs, all with margin), then by a log-stream comparison with a merely conditional parameter: any + /// parameter that only some trials suggest makes Optuna's CMA-ES-with-margin raise at the end of the first + /// generation, which makes this the common path, not an exotic one. + /// <para> + /// <b>Fixed 2026-11-12</b> (owner's decision to raise as Optuna does): <c>Cma.CheckTellShapes</c> raises + /// NumPy's <c>ValueError</c> before the optimizer changes. Every case below was re-measured that day (Optuna + /// 5.0.0, cmaes 0.13.1, the same ask / tell loop): population 2 / 3 / 4 fails at trial 3 / 4 / 5, with the + /// inhomogeneous-shape message except for population 2 with the range change, where the first generation + /// holds only the two long vectors and the update of the one-dimensional mean fails instead. + /// </para> + /// </remarks> + /// <param name="popsize">The CMA-ES population size.</param> + /// <param name="conditional"> + /// <c>y</c> suggested on even trials only (a conditional parameter) instead of <c>y</c>'s range changing on + /// trial 2. + /// </param> + /// <param name="message">Optuna's error message, NumPy's.</param> + [TestMethod] + [DataRow(2, false, "non-broadcastable output operand with shape (1,) doesn't match the broadcast shape (2,)")] + [DataRow(2, true, "setting an array element with a sequence. The requested array has an inhomogeneous shape after 1 dimensions. The detected shape was (2,) + inhomogeneous part.")] + [DataRow(3, false, "setting an array element with a sequence. The requested array has an inhomogeneous shape after 1 dimensions. The detected shape was (3,) + inhomogeneous part.")] + [DataRow(3, true, "setting an array element with a sequence. The requested array has an inhomogeneous shape after 1 dimensions. The detected shape was (3,) + inhomogeneous part.")] + [DataRow(4, false, "setting an array element with a sequence. The requested array has an inhomogeneous shape after 1 dimensions. The detected shape was (4,) + inhomogeneous part.")] + [DataRow(4, true, "setting an array element with a sequence. The requested array has an inhomogeneous shape after 1 dimensions. The detected shape was (4,) + inhomogeneous part.")] + public void CmaWithMargin_SearchSpaceShrinksInFirstGeneration_RaisesLikeOptuna(int popsize, bool conditional, string message) + { + var study = Optuna.CreateStudy(sampler: new CmaEsSampler(withMargin: true, seed: 0, popsize: popsize)); + System.Action run = () => + { + for (int i = 0; i < (conditional ? 20 : 12); i++) + { + var trial = study.Ask(); + long x = trial.SuggestInt("x", 0, 10); + // Either the range changes once, so `y` leaves the intersection search space from trial 2 on, or `y` + // exists on even trials only, so the intersection drops it once trial 1 completes. + double y = conditional + ? i % 2 == 0 ? trial.SuggestFloat("y", 0.0, 1.0) : 0.0 + : trial.SuggestFloat("y", 0.0, i == 2 ? 1.5 : 1.0); + study.Tell(trial, x + y); + } + }; + + run.Should().Throw<NumSharp.ValueError>().Which.Message.Should().Be(message); + study.Trials.Should().HaveCount(popsize + 2, "Optuna fails on the ask of trial popsize + 1, which stays running"); + } + + /// <summary> + /// QA-68: a trial numbered at or above the grid size picks its grid with + /// <c>rng.choice(list(set(range(n)) - set(visited) - set(running)))</c>, so the candidates come in CPython's + /// set-iteration order: the difference builds a fresh set whose small table makes values of 8 and more wrap onto + /// the slots of smaller ones, so <c>list(set(range(16)) - {0, 1, 2, 3, 5, 6, 7, 9, 10, 12, 13, 14, 15})</c> is + /// <c>[8, 11, 4]</c> in CPython 3.12. The port lists the candidates in ascending order, so the same random index + /// picks another grid. + /// </summary> + /// <remarks> + /// The port marks this <c>[Misaligned]</c> in <c>GridSampler.GetUnvisitedGridIds</c>, reasoning that only real + /// concurrency reaches the <c>choice</c> branch. A single-threaded <c>optimize</c> reaches it whenever the + /// study's numbering is shifted: earlier trials from <c>add_trial</c> / <c>enqueue_trial</c>, another sampler, + /// or a resumed study. Optuna 5.0.0, a 16-point grid (<c>GridSampler({"x": [0.0, …, 15.0]}, seed=0)</c>) on a + /// study that already holds 12 added trials, then <c>optimize(n_trials=16)</c>: <c>x</c> = <c>3, 0, 5, 12, 6, 14, + /// 7, 15, 10, 1, 9, 13, 11, 8, 2, 4</c>; the port's 13th value is <c>4</c> instead of <c>11</c>, once four + /// unvisited grids remain (seed 2 parts at the same trial, seed 1 happens to agree). Matching it means + /// reproducing CPython's set layout for small ints (hash = value, 8-slot minimum table, linear probing). + /// <b>Fixed 2026-11-12:</b> <c>GetUnvisitedGridIds</c> builds the differences with <c>PyIntSet</c>, a model of + /// CPython 3.12's set table, so the list comes in CPython's iteration order; checked against 271 recorded + /// differences in <c>oracle/cpython_order.json</c>. The <c>[Misaligned]</c> note in GridSampler is gone. + /// </remarks> + [TestMethod] + public void GridSampler_ShiftedNumbering_PicksUnvisitedGridsInCPythonSetOrder() + { + var space = new System.Collections.Generic.Dictionary<string, System.Collections.Generic.IReadOnlyList<OptunaSharp.Distributions.CategoricalChoice>> + { + ["x"] = System.Linq.Enumerable.ToList(System.Linq.Enumerable.Select( + System.Linq.Enumerable.Range(0, 16), i => (OptunaSharp.Distributions.CategoricalChoice)(double)i)), + }; + var study = Optuna.CreateStudy(sampler: new GridSampler(space, seed: 0)); + for (int i = 0; i < 12; i++) + study.AddTrial(FrozenTrial.CreateTrial(value: i, + @params: new OptunaSharp.Collections.OrderedDict<string, object?> { ["x"] = (double)i }, + distributions: new OptunaSharp.Collections.OrderedDict<string, OptunaSharp.Distributions.BaseDistribution> + { ["x"] = new OptunaSharp.Distributions.FloatDistribution(0, 15) })); + study.Optimize(t => t.SuggestFloat("x", 0, 15), nTrials: 16); + + var xs = System.Linq.Enumerable.ToArray(System.Linq.Enumerable.Select( + System.Linq.Enumerable.Skip(study.Trials, 12), t => (double)t.Params["x"]!)); + xs.Should().Equal(3.0, 0.0, 5.0, 12.0, 6.0, 14.0, 7.0, 15.0, 10.0, 1.0, 9.0, 13.0, 11.0, 8.0, 2.0, 4.0); + } + + /// <summary> + /// QA-79: multi-objective TPE ranks the PRUNED trials it puts in its "below" group by their last intermediate + /// value. Optuna's <c>_get_pruned_trial_score</c> reads <c>study.direction</c> for that, and on a multi-objective + /// study the property raises <c>RuntimeError("A single direction cannot be retrieved from a multi-objective + /// study. Consider using Study.directions to retrieve a list containing all directions.")</c>, so the first + /// TPE trial fails. The port's <c>TpeTrialSplit.GetPrunedTrialScore</c> reads <c>study.Directions[0]</c> + /// instead, ranks the pruned trials by the first objective's direction and samples on. + /// </summary> + /// <remarks> + /// <c>Trial.report</c> refuses multi-objective studies on both sides, so the history comes from + /// <c>add_trial</c> here; a journal or RDB written by another tool can hold the same records. Measured with + /// Optuna 5.0.0: two objectives, <c>TPESampler(n_startup_trials=0, seed=0)</c>, one COMPLETE trial and four + /// PRUNED trials with intermediate values added, then <c>optimize(n_trials=12)</c> raises the RuntimeError + /// from the first trial's <c>suggest_float</c>; the port completes all 12 trials. The single-objective path is + /// unaffected (<c>study.direction</c> is defined there). + /// <b>Fixed 2026-11-12:</b> <c>TpeTrialSplit.GetPrunedTrialScore</c> reads <c>study.Direction</c>, which raises on a + /// multi-objective study, as Optuna's property does. + /// </remarks> + [TestMethod] + public void MultiObjectiveTpe_PrunedTrialsWithIntermediateValues_RaisesLikeOptunasDirectionProperty() + { + var study = Optuna.CreateStudy(directions: new[] { StudyDirection.Minimize, StudyDirection.Minimize }, + sampler: new TPESampler(nStartupTrials: 0, seed: 0)); + var distributions = new OptunaSharp.Collections.OrderedDict<string, OptunaSharp.Distributions.BaseDistribution> + { ["x"] = new OptunaSharp.Distributions.FloatDistribution(0, 1) }; + study.AddTrial(FrozenTrial.CreateTrial(values: new[] { 0.5, 0.5 }, + @params: new OptunaSharp.Collections.OrderedDict<string, object?> { ["x"] = 0.5 }, distributions: distributions)); + study.AddTrial(FrozenTrial.CreateTrial(state: TrialState.Pruned, + @params: new OptunaSharp.Collections.OrderedDict<string, object?> { ["x"] = 0.2 }, distributions: distributions, + intermediateValues: new OptunaSharp.Collections.OrderedDict<long, double> { [0] = 0.3, [1] = 0.1 })); + for (int i = 0; i < 3; i++) + study.AddTrial(FrozenTrial.CreateTrial(state: TrialState.Pruned, + @params: new OptunaSharp.Collections.OrderedDict<string, object?> { ["x"] = 0.1 * i }, + distributions: distributions, + intermediateValues: new OptunaSharp.Collections.OrderedDict<long, double> { [0] = 0.3 + i })); + + System.Action optimize = () => study.Optimize(t => new[] { t.SuggestFloat("x", 0, 1), 1 - t.SuggestFloat("x", 0, 1) }, + nTrials: 12); + + optimize.Should().Throw<NumSharp.RuntimeError>().WithMessage( + "A single direction cannot be retrieved from a multi-objective study. Consider using Study.directions to " + + "retrieve a list containing all directions."); + } + + /// <summary> + /// QA-80: cmaes's <c>CMA</c> and <c>SepCMA</c> constructors assert <c>_is_valid_bounds(bounds, mean)</c> + /// ("invalid bounds"), so Optuna's first CMA-ES trial fails with <c>AssertionError</c> when the initial mean lies + /// outside the search space: an <c>x0</c> outside the ranges, or <c>source_trials</c> whose best solutions lie + /// outside the target's ranges (CmaEsSampler checks only parameter names). The port's <c>Cma</c> and + /// <c>SepCma</c> omit the assertion (only <c>CmaWm</c> keeps it, as <c>ArgumentException("invalid bounds")</c>), + /// so the study samples on around an out-of-bounds mean. + /// </summary> + /// <remarks> + /// Measured with Optuna 5.0.0 / cmaes 0.13.1: <c>CmaEsSampler(x0={"x": 12.0, "y": 0.5}, seed=0)</c> over + /// <c>x</c> in [0, 10], <c>y</c> in [0, 1], <c>optimize(n_trials=5)</c>: trial 0 (independent) COMPLETE, trial 1 + /// FAIL and <c>AssertionError: invalid bounds</c> raised, the same with <c>use_separable_cma=True</c> and + /// <c>lr_adapt=True</c>; <c>x0={"x": 10.0}</c> (on the bound) runs identically on both sides. The port completes + /// all five trials. The Warm-Starting fuzz (E51) hit it in 3 of 150 programs through <c>source_trials</c> + /// ranges. The expected exception type follows the port's own mapping of this assertion in <c>CmaWm</c>. + /// <b>Fixed 2026-11-12:</b> <c>Cma</c> and <c>SepCma</c> assert the bounds in their constructors, as cmaes does. + /// </remarks> + /// <param name="separable"><c>use_separable_cma=True</c>.</param> + /// <param name="lrAdapt"><c>lr_adapt=True</c>.</param> + /// <param name="withMargin"><c>with_margin=True</c>.</param> + [TestMethod] + [DataRow(false, false, false)] + [DataRow(true, false, false)] + [DataRow(false, true, false)] + [DataRow(false, false, true)] + public void CmaEs_InitialMeanOutsideTheBounds_FailsLikeCmaesInvalidBoundsAssertion( + bool separable, bool lrAdapt, bool withMargin) + { + // Optuna 5.0.0 / cmaes 0.13.1, all four variants re-measured 2026-11-12: AssertionError('invalid bounds'), + // states COMPLETE, FAIL. + var study = Optuna.CreateStudy(sampler: new CmaEsSampler( + x0: new System.Collections.Generic.Dictionary<string, object?> { ["x"] = 12.0, ["y"] = 0.5 }, + seed: 0, useSeparableCma: separable, lrAdapt: lrAdapt, withMargin: withMargin)); + + System.Action optimize = () => study.Optimize(t => t.SuggestFloat("x", 0, 10) + t.SuggestFloat("y", 0, 1), + nTrials: 5); + + optimize.Should().Throw<System.ArgumentException>().Which.Message.Should().Be("invalid bounds"); + System.Linq.Enumerable.Select(study.Trials, t => t.State).Should().Equal(TrialState.Complete, TrialState.Fail); + } + + /// <summary> + /// QA-80 (second assertion): cmaes' <c>CMA</c> constructor also asserts its learning rates + /// (<c>c1 <= 1 - cmu</c>, "invalid learning rate for the rank-one update", then <c>cmu</c>, <c>c_sigma</c>, + /// <c>cc</c>). With <c>popsize=1</c>, <c>mu = 0</c> makes <c>mu_eff</c> NaN, the comparison fails and Optuna's + /// first CMA-ES trial FAILs with <c>AssertionError</c>. The port's <c>Cma</c> has none of these assertions: it + /// builds the optimizer with NaN rates, completes trial 1, and fails trial 2 with + /// <c>ValueError("`nan` is invalid value.")</c> instead. + /// </summary> + /// <remarks> + /// Measured with Optuna 5.0.0 / cmaes 0.13.1: <c>CmaEsSampler(seed=0, popsize=1)</c> over a float and an int, + /// <c>optimize(n_trials=8)</c>: states COMPLETE, FAIL and <c>AssertionError: invalid learning rate for the + /// rank-one update</c>, the same with <c>with_margin=True</c> and <c>lr_adapt=True</c> + /// (<c>use_separable_cma=True</c> raises <c>ZeroDivisionError</c>); the port gives COMPLETE, COMPLETE, FAIL in + /// all four. <c>popsize=2</c> is identical on both sides. The expected type follows the port's mapping of + /// cmaes assertions (<c>ArgumentException</c>, as for "invalid bounds" in <c>CmaWm</c>). <b>Fixed + /// 2026-11-12:</b> <c>Cma</c> asserts its four learning rates as cmaes does, and <c>SepCma</c> raises + /// <c>DivideByZeroException("division by zero")</c> where cmaes divides the int 0; since NumSharp 0.81.0 it is + /// Python's own class, <c>NumSharp.ZeroDivisionError("division by zero")</c>. + /// </remarks> + /// <param name="variant"><c>plain</c>, <c>margin</c> (<c>with_margin=True</c>), <c>lr</c> (<c>lr_adapt=True</c>) or <c>separable</c>.</param> + [TestMethod] + [DataRow("plain")] + [DataRow("margin")] + [DataRow("lr")] + [DataRow("separable")] + public void CmaEs_PopulationOfOne_FailsLikeCmaesLearningRateAssertion(string variant) + { + // Optuna 5.0.0 / cmaes 0.13.1, re-measured 2026-11-12: AssertionError('invalid learning rate for the rank-one + // update') for plain, with_margin and lr_adapt; ZeroDivisionError('division by zero') for use_separable_cma (its + // builtin sum of an empty weight array is the int 0); states COMPLETE, FAIL in every case. + var study = Optuna.CreateStudy(sampler: new CmaEsSampler(seed: 0, popsize: 1, + withMargin: variant == "margin", lrAdapt: variant == "lr", useSeparableCma: variant == "separable")); + + System.Action optimize = () => study.Optimize(t => t.SuggestFloat("x", 0, 10) + t.SuggestInt("y", 0, 5), nTrials: 8); + + if (variant == "separable") + optimize.Should().ThrowExactly<NumSharp.ZeroDivisionError>().Which.Message.Should().Be("division by zero"); + else + optimize.Should().Throw<System.ArgumentException>().Which.Message.Should() + .Be("invalid learning rate for the rank-one update"); + System.Linq.Enumerable.Select(study.Trials, t => t.State).Should().Equal(TrialState.Complete, TrialState.Fail); + } + + /// <summary> + /// QA-83: an <c>x0</c> that lacks one of the search space's parameters fails CMA-ES's first trial on both sides, + /// but with different errors. Optuna's <c>_SearchSpaceTransform.transform</c> asserts <c>name in params</c> with + /// the message "Parameter configuration must contain all distributions."; the port's transform indexes the + /// dictionary and lets <c>KeyNotFoundException</c> ("The given key 'y' was not present in the dictionary.") + /// escape, which names the missing key but not the cause. + /// </summary> + /// <remarks> + /// Measured with Optuna 5.0.0: <c>CmaEsSampler(x0={"x": 5.0}, seed=0)</c> over <c>x</c> and <c>y</c>, + /// <c>optimize(n_trials=4)</c>: COMPLETE, FAIL and <c>AssertionError</c>; the port: COMPLETE, FAIL and the + /// <c>KeyNotFoundException</c>. An <c>x0</c> with an extra parameter is accepted and identical on both sides. The + /// expected type follows the port's mapping of Python assertions (<c>ArgumentException</c>, as in <c>CmaWm</c>). + /// <b>Fixed 2026-11-12:</b> the transform checks every parameter with Optuna's message (it was a + /// <c>Debug.Assert</c>, gone from Release builds). + /// </remarks> + [TestMethod] + public void CmaEs_X0MissingAParameter_FailsWithOptunasTransformAssertion() + { + var study = Optuna.CreateStudy(sampler: new CmaEsSampler( + x0: new System.Collections.Generic.Dictionary<string, object?> { ["x"] = 5.0 }, seed: 0)); + + System.Action optimize = () => study.Optimize(t => t.SuggestFloat("x", 0, 10) + t.SuggestFloat("y", 0, 1), nTrials: 4); + + optimize.Should().Throw<System.ArgumentException>().WithMessage("Parameter configuration must contain all distributions."); + System.Linq.Enumerable.Select(study.Trials, t => t.State).Should().Equal(TrialState.Complete, TrialState.Fail); + } + + /// <summary> + /// QA-84 (found 2026-11-11 by plan 15, after the run): Optuna sums a candidate's continuous log terms over the + /// dimensions with <c>_truncnorm.logpdf(...).sum(axis=-1)</c>, a reduction over a C-contiguous last axis, which + /// NumPy performs with its pairwise sum: from eight elements on, eight accumulators, then + /// <c>((r0 + r1) + (r2 + r3)) + ((r4 + r5) + (r6 + r7))</c>, then the remainder. The port added the terms left to + /// right from +0.0, so with eight or more continuous parameters many sums differed in their last bits. + /// <b>Fixed 2026-11-12</b> (owner's choice): the per-dimension terms are stored as NumPy's + /// <c>(n_samples, n_kernels, n_cont)</c> array and summed by NumSharp's <c>np.sum(axis=-1)</c> + /// (<c>MixtureOfProductDistribution.AddContinuousSums</c>). + /// </summary> + /// <remarks> + /// Measured with Optuna 5.0.0's own <c>_truncnorm.logpdf</c> on its own array layout and NumPy 2.4.2: the + /// pairwise model below matches NumPy in all 7,200 (candidate, kernel) entries for 8, 10 and 16 dimensions, and a + /// left-to-right sum differed in 31–54% of them; NumSharp's <c>np.sum(axis=-1)</c> matches live NumPy at every + /// width from 1 to 300. The test isolates the order: both sides sum the port's own per-dimension terms, so only the + /// summation can differ. + /// </remarks> + [TestMethod] + public void Tpe_ContinuousLogPdf_SumsTheDimensionsPairwiseLikeNumPy() + { + var rng = new System.Random(84); + const int nSamples = 24, nCont = 10, nKernels = 300; + int gridSize = nCont * nKernels; + var mu = new double[gridSize]; + var sigma = new double[gridSize]; + var a = new double[gridSize]; + var b = new double[gridSize]; + var logSigma = new double[gridSize]; + for (int g = 0; g < gridSize; g++) + { + mu[g] = rng.NextDouble() * 20 - 10; + sigma[g] = 0.2 + rng.NextDouble() * 5; + a[g] = (-10 - mu[g]) / sigma[g]; + b[g] = (10 - mu[g]) / sigma[g]; + logSigma[g] = System.Math.Log(sigma[g]); + } + double[] logGaussMass = OptunaSharp.Internal.TruncNorm.LogGaussMass(a, b); + var xCont = new double[nSamples * nCont]; + for (int i = 0; i < xCont.Length; i++) + xCont[i] = rng.NextDouble() * 20 - 10; + + var actual = new double[nSamples * nKernels]; + OptunaSharp.Samplers.Tpe.MixtureOfProductDistribution.AddContinuousSums( + xCont, nSamples, nCont, mu, sigma, a, b, logGaussMass, logSigma, actual, nKernels); + + int differing = 0; + var terms = new double[nCont]; + for (int s = 0; s < nSamples; s++) + { + for (int k = 0; k < nKernels; k++) + { + for (int c = 0; c < nCont; c++) + { + int g = c * nKernels + k; + double xstd = (xCont[s * nCont + c] - mu[g]) / sigma[g]; + double val = OptunaSharp.Internal.TruncNorm.NormLogPdf(xstd) - logGaussMass[g] - logSigma[g]; + if (a[g] == b[g]) + val = double.NaN; + else if (xstd < a[g] || xstd > b[g]) + val = double.NegativeInfinity; + terms[c] = val; + } + // weighted_log_pdf (zero here) += the row's NumPy sum. + double expected = 0.0 + NumPyPairwiseSum(terms); + if (System.BitConverter.DoubleToInt64Bits(actual[s * nKernels + k]) != System.BitConverter.DoubleToInt64Bits(expected)) + differing++; + } + } + + differing.Should().Be(0, "NumPy sums each (candidate, kernel) row of the dimensions pairwise"); + } + + /// <summary> + /// NumPy's <c>pairwise_sum</c> for a contiguous run of at most 128 elements (one block): left to right from 0.0 + /// below eight elements; from eight on, eight accumulators over whole groups of eight, combined as + /// <c>((r0 + r1) + (r2 + r3)) + ((r4 + r5) + (r6 + r7))</c>, then the remaining elements added left to right. + /// </summary> + /// <param name="x">The elements, at most 128 of them.</param> + /// <returns>Their sum in NumPy's order.</returns> + private static double NumPyPairwiseSum(double[] x) + { + int n = x.Length; + if (n < 8) + { + double res0 = 0.0; + for (int i = 0; i < n; i++) + res0 += x[i]; + return res0; + } + var r = new double[8]; + System.Array.Copy(x, r, 8); + int j = 8; + for (; j < n - n % 8; j += 8) + { + for (int l = 0; l < 8; l++) + r[l] += x[j + l]; + } + double res = ((r[0] + r[1]) + (r[2] + r[3])) + ((r[4] + r[5]) + (r[6] + r[7])); + for (; j < n; j++) + res += x[j]; + return res; + } +} diff --git a/test/OptunaSharp.Tests/QA/Run2StorageParityBugTests.cs b/test/OptunaSharp.Tests/QA/Run2StorageParityBugTests.cs new file mode 100644 index 0000000..e47acc3 --- /dev/null +++ b/test/OptunaSharp.Tests/QA/Run2StorageParityBugTests.cs @@ -0,0 +1,183 @@ +using System.IO; +using AwesomeAssertions; +using OptunaSharp.Samplers; +using OptunaSharp.Storages; +using OptunaSharp.Storages.Journal; + +namespace OptunaSharp.Tests.QA; + +/// <summary> +/// Storage parity bugs found by the 2026-11-10 parity QA run (<c>docs/qa/PARITY_QA_2026-11-10.md</c>). Expected +/// values are what Optuna 5.0.0 produces on CPython 3.12. A test marked <c>[OpenBugs]</c> fails until its divergence is +/// fixed; the attribute is removed with the fix, and the test then guards against a regression. +/// </summary> +[TestClass] +public class Run2StorageParityBugTests +{ + /// <summary> + /// Runs one trial that reads its own stored record with <c>get_trials(deepcopy=False)</c> after its first + /// suggestion, then suggests again, sets a user attribute, reports an intermediate value and sets a constraint. + /// </summary> + /// <param name="storage">The storage under test, or <see langword="null" /> for the default in-memory storage.</param> + /// <returns>The record obtained before the later writes, as the caller holds it after the trial finished.</returns> + /// <remarks>The record is read while the trial is RUNNING, the only time a write can still reach it.</remarks> + private static FrozenTrial HeldRecordAfterLaterWrites(BaseStorage? storage) + { + var study = Optuna.CreateStudy(storage: storage, sampler: new RandomSampler(0)); + FrozenTrial? held = null; + study.Optimize(t => + { + t.SuggestFloat("x", 0, 1); + held = study.GetTrials(deepcopy: false)[^1]; + t.SuggestFloat("y", 0, 1); + t.SetUserAttr("k", 1L); + t.Report(0.5, 0); + t.SetConstraint("c", 0.0); + return 1.0; + }, nTrials: 1); + return held!; + } + + /// <summary> + /// QA-58: in Optuna, a <c>FrozenTrial</c> a caller obtained with <c>deepcopy=False</c> while its trial runs keeps + /// receiving that trial's later user attributes, intermediate values and system attributes (but not its later + /// parameters), on the in-memory and the journal storage. The port's record never changes. + /// </summary> + /// <remarks> + /// <para> + /// Why Python behaves so: <c>Trial</c> keeps the record the storage returned when the trial was created + /// (<c>_cached_frozen_trial</c>) and, after each write, mutates that record's dictionary in place + /// (<c>user_attrs[key] = value</c>, <c>intermediate_values[step] = value</c>, the constraint's system + /// attribute). The storages copy a record shallowly on every write and replace only the dictionary being + /// written (<c>set_trial_param</c> copies <c>params</c> and <c>distributions</c>, <c>set_trial_user_attr</c> + /// copies <c>user_attrs</c>, ...), so every later record still shares the dictionaries no write has replaced + /// yet with the trial's cached record. A record read after the first suggestion therefore shares the cached + /// record's <c>user_attrs</c>, <c>intermediate_values</c> and <c>system_attrs</c> objects and sees the + /// trial's in-place updates to them; its <c>params</c> were replaced by that suggestion and stay as they were. + /// The SQLite storage hands out fresh objects and shows nothing, in both languages. + /// </para> + /// <para> + /// Optuna 5.0.0, measured (in-memory and journal alike): before the writes <c>params=['x'] ui=[] iv=[] + /// sys=[]</c>, after them <c>params=['x'] ui=['k'] iv=[0] sys=['constraints:c']</c>. The port: unchanged + /// (<c>InMemoryStorage</c> copies all five dictionaries before writing to a handed-out record, plan 13 S4, and + /// the port's <c>Trial</c> keeps a detached copy since <c>3a75811</c>). An aliasing artifact of Python's + /// copy-on-write rather than a designed contract, so LOW; the owner decides whether to copy it. + /// </para> + /// <para> + /// <b>Deferred</b> by the owner on 2026-11-12: the port keeps handing out snapshots for now and this repro + /// stays open. Copying the aliasing would undo the copy-before-write that keeps <c>n_jobs</c> readers safe, + /// unless the shared dictionaries became concurrent ones. + /// </para> + /// </remarks> + [TestMethod] + [OpenBugs] + public void HeldRunningRecord_SeesTheTrialsLaterAttributeWrites_LikeOptuna() + { + var memory = HeldRecordAfterLaterWrites(null); + memory.Params.Keys.Should().Equal("x"); + memory.UserAttrs.Keys.Should().Equal("k"); + memory.IntermediateValues.Keys.Should().Equal(0L); + memory.SystemAttrs.Keys.Should().Equal("constraints:c"); + + string file = Path.Combine(Path.GetTempPath(), "optunasharp-qa58-" + System.Guid.NewGuid().ToString("N") + ".log"); + try + { + var journal = HeldRecordAfterLaterWrites(new JournalStorage(new JournalFileBackend(file))); + journal.Params.Keys.Should().Equal("x"); + journal.UserAttrs.Keys.Should().Equal("k"); + journal.IntermediateValues.Keys.Should().Equal(0L); + journal.SystemAttrs.Keys.Should().Equal("constraints:c"); + } + finally + { + // The journal file and its lock directory are scratch state of this test only. + if (File.Exists(file)) + File.Delete(file); + } + } + + /// <summary> + /// QA-66: two storage-level exceptions differ from Optuna's. <c>get_trial_param</c> for a parameter the trial + /// does not have raises Python's <c>KeyError</c> (the record's own dictionary lookup) on the in-memory and the + /// journal storage; the port raises <see cref="System.Collections.Generic.KeyNotFoundException" />, which a + /// <c>catch (KeyError)</c> written against the port's other storage errors does not catch. And the storages raise + /// <c>DuplicatedStudyError</c> without a message (<c>raise DuplicatedStudyError</c>), so <c>str(e)</c> is empty; + /// the port's carries .NET's default text. + /// </summary> + /// <remarks> + /// Found by a storage API script (every <c>BaseStorage</c> method with valid and invalid ids, finished trials, + /// incompatible distributions) on memory / journal / SQLite in both languages: every other result and message + /// matched, storage by storage (<c>No study with study_id 999 exists.</c> in memory, <c>Record does not + /// exist.</c> in the journal and SQLite, the journal's bare <c>KeyError: 999</c>, the journal still returning a + /// deleted study's trial). Users reach these only by calling the storage directly: <c>create_study</c> replaces + /// the empty <c>DuplicatedStudyError</c> with its own message, which the port copies. NIT. + /// <b>Fixed 2026-11-12:</b> <c>GetTrialParam</c> raises <c>KeyError(paramName)</c> and the in-memory and journal + /// storages raise <c>DuplicatedStudyError("")</c>; GridSampler's missing <c>grid_id</c> is a <c>KeyError</c> too. + /// </remarks> + [TestMethod] + public void StorageLevelErrors_MissingParamAndDuplicatedStudy_MatchOptuna() + { + var storage = new InMemoryStorage(); + int studyId = storage.CreateNewStudy(new[] { StudyDirection.Minimize }, "a"); + int trialId = storage.CreateNewTrial(studyId); + + System.Action missingParam = () => storage.GetTrialParam(trialId, "missing"); + missingParam.Should().Throw<NumSharp.KeyError>("Optuna raises KeyError('missing')"); + + System.Action duplicate = () => storage.CreateNewStudy(new[] { StudyDirection.Minimize }, "a"); + duplicate.Should().Throw<DuplicatedStudyError>().Which.Message.Should().BeEmpty("str(DuplicatedStudyError()) is ''"); + } + + /// <summary> + /// Creates studies <c>a</c>, <c>b</c>, <c>c</c>, deletes <c>b</c>, creates <c>d</c>, deletes <c>a</c>, then creates + /// <c>e</c> and <c>f</c>, and lists the studies the way <c>get_all_study_names</c> does. + /// </summary> + /// <param name="storage">The storage under test.</param> + /// <returns>The study names in the storage's listing order.</returns> + /// <remarks>Each deletion frees a slot that a later creation can take, which is where the orders part.</remarks> + private static System.Collections.Generic.List<string> NamesAfterDeletions(BaseStorage storage) + { + foreach (string name in new[] { "a", "b", "c" }) + Optuna.CreateStudy(storage: storage, studyName: name); + Optuna.DeleteStudy("b", storage); + Optuna.CreateStudy(storage: storage, studyName: "d"); + Optuna.DeleteStudy("a", storage); + Optuna.CreateStudy(storage: storage, studyName: "e"); + Optuna.CreateStudy(storage: storage, studyName: "f"); + return Optuna.GetAllStudyNames(storage); + } + + /// <summary> + /// QA-67: after a study is deleted, the in-memory and journal storages list studies in a different order from + /// Optuna. Python keeps studies in a <c>dict</c>, which appends every new key after the existing ones; the port + /// keeps them in a <see cref="System.Collections.Generic.Dictionary{TKey, TValue}" />, which reuses a removed + /// entry's slot for the next insertion, so a study created after a deletion is listed where the deleted one was. + /// </summary> + /// <remarks> + /// Optuna 5.0.0 (in-memory and journal): <c>['c', 'd', 'e', 'f']</c>; the port: <c>[e, d, c, f]</c>. The SQLite + /// storage orders by study id in both. The order reaches <c>get_all_study_names</c>, + /// <c>get_all_study_summaries</c>, the CLI's <c>studies</c> command on a journal file, and the study list in + /// <c>load_study(study_name=None)</c>'s error message. The containers are <c>InMemoryStorage._studies</c> and + /// <c>JournalStorageReplayResult._studies</c>; an insertion-ordered dictionary (the repository's + /// <c>OrderedDict</c>) would keep Python's order. + /// <b>Fixed 2026-11-12:</b> the in-memory storage and the journal's replay result keep their studies in an + /// insertion-ordered <c>OrderedDict</c>, as Python's dicts do. + /// </remarks> + [TestMethod] + public void StudyListing_AfterDeletions_KeepsCreationOrderLikePythonDicts() + { + NamesAfterDeletions(new InMemoryStorage()).Should().Equal("c", "d", "e", "f"); + + string file = Path.Combine(Path.GetTempPath(), "optunasharp-qa67-" + System.Guid.NewGuid().ToString("N") + ".log"); + try + { + NamesAfterDeletions(new JournalStorage(new JournalFileBackend(file))).Should().Equal("c", "d", "e", "f"); + } + finally + { + // The journal file is scratch state of this test only. + if (File.Exists(file)) + File.Delete(file); + } + } +} diff --git a/test/OptunaSharp.Tests/QA/Run2WarningParityBugTests.cs b/test/OptunaSharp.Tests/QA/Run2WarningParityBugTests.cs new file mode 100644 index 0000000..831e3d2 --- /dev/null +++ b/test/OptunaSharp.Tests/QA/Run2WarningParityBugTests.cs @@ -0,0 +1,107 @@ +using System; +using System.IO; +using System.Text.RegularExpressions; +using AwesomeAssertions; +using OptunaSharp.Logging; +using OptunaSharp.Samplers; + +namespace OptunaSharp.Tests.QA; + +/// <summary> +/// How Optuna's warnings reach the user, found by the 2026-11-10 parity QA run (<c>docs/qa/PARITY_QA_2026-11-10.md</c>, +/// QA-77). Optuna raises them with Python's <c>warnings.warn</c>, which prints to stderr through +/// <c>warnings.showwarning</c>, outside <c>optuna.logging</c>, once per distinct message and call site under the default +/// filters. The port sends every warning through the <c>optuna</c> logger at WARNING level (<c>OptunaWarnings.Warn</c>). +/// The owner chose to keep the logger on 2026-11-12, so both tests are <c>[Misaligned]</c>: they pin the port's +/// behavior and record Optuna's. +/// </summary> +/// <remarks> +/// Both tests redirect stderr and rebuild the library logger around it, the way <c>LoggingTests</c> does, and put +/// both back afterwards; they do not run in parallel with other tests. +/// </remarks> +[TestClass] +[DoNotParallelize] +public class Run2WarningParityBugTests +{ + /// <summary>The step-divisibility warning's fixed part, the same in Optuna's and the port's text.</summary> + private const string StepWarning = "but the range is not divisible by `step`"; + + /// <summary> + /// QA-77: <c>optuna.logging.set_verbosity(optuna.logging.ERROR)</c>, the usual way to silence the per-trial log, + /// does not touch Python warnings, so Optuna still prints + /// <c>UserWarning: The distribution is specified by [0, 1] and step=0.3, but the range is not divisible by `step`. + /// It will be replaced with [0, 0.9].</c> The port routes the warning through the logger, whose level then drops + /// it: nothing reaches stderr. + /// </summary> + /// <remarks> + /// <b>Misaligned</b> by the owner's decision of 2026-11-12 ("Keep the logger"): warnings stay on the <c>optuna</c> + /// logger, so a log handler sees them and the verbosity governs them. This test pins that the port prints nothing + /// at ERROR, where Optuna prints the warning once. + /// </remarks> + [TestMethod] + [Misaligned] + public void Warnings_FollowTheLoggersVerbosity_SoErrorHidesThem() + { + string stderr = CaptureStderr(LogLevel.Error, () => + { + var study = Optuna.CreateStudy(sampler: new RandomSampler(seed: 0)); + study.Optimize(t => t.SuggestFloat("x", 0, 1, step: 0.3), nTrials: 3); + }); + + stderr.Should().NotContain(StepWarning, "the logger at ERROR drops WARNING records; Python's warnings.warn would print it"); + } + + /// <summary> + /// QA-77, repetition: under Python's default warning filters a warning with the same text from the same call site + /// is shown once, so five trials suggesting the same non-divisible float show it once (measured: two distinct + /// warnings, two lines, for a float and an int parameter over five trials). The port logs it on every trial. This + /// half was already listed in the 2026-10-26 release review's LOW notes ("OptunaWarnings logs every + /// occurrence"). + /// </summary> + /// <remarks> + /// <b>Misaligned</b> by the owner's decision of 2026-11-12 ("Keep the logger"): every occurrence is a log record. + /// This test pins five records for five trials, where Optuna prints one line. + /// </remarks> + [TestMethod] + [Misaligned] + public void RepeatedWarning_IsLoggedOnEveryOccurrence() + { + string stderr = CaptureStderr(LogLevel.Info, () => + { + var study = Optuna.CreateStudy(sampler: new RandomSampler(seed: 0)); + study.Optimize(t => t.SuggestFloat("x", 0, 1, step: 0.3), nTrials: 5); + }); + + Regex.Matches(stderr, Regex.Escape(StepWarning)).Count.Should().Be(5, "Python's default filter would show it once"); + } + + /// <summary> + /// Runs <paramref name="body" /> with stderr redirected to a buffer and the library logger rebuilt over it at + /// <paramref name="verbosity" />, then restores stderr, the logger and the previous verbosity. + /// </summary> + /// <param name="verbosity">The <c>optuna</c> logger level to run the body at.</param> + /// <param name="body">The code whose stderr output is wanted.</param> + /// <returns>Everything written to stderr while <paramref name="body" /> ran.</returns> + private static string CaptureStderr(int verbosity, Action body) + { + int previous = OptunaLogging.GetVerbosity(); + TextWriter original = Console.Error; + var buffer = new StringWriter(); + try + { + // The default handler binds Console.Error when it is created, so rebuild it after redirecting. + OptunaLogging.ResetLibraryRootLogger(); + Console.SetError(buffer); + OptunaLogging.SetVerbosity(verbosity); + body(); + } + finally + { + // Rebuild the default handler over the real stderr so later tests log normally. + Console.SetError(original); + OptunaLogging.ResetLibraryRootLogger(); + OptunaLogging.SetVerbosity(previous); + } + return buffer.ToString(); + } +} diff --git a/test/OptunaSharp.Tests/QA/SamplerParityBugTests.cs b/test/OptunaSharp.Tests/QA/SamplerParityBugTests.cs index 1358782..42aed20 100644 --- a/test/OptunaSharp.Tests/QA/SamplerParityBugTests.cs +++ b/test/OptunaSharp.Tests/QA/SamplerParityBugTests.cs @@ -74,7 +74,9 @@ public void ConstraintViolationSums_UseCompensatedSumLikeCPython() /// <summary> /// QA-29: TPE must pick the candidate with <c>np.argmax</c>'s semantics, where the first NaN acquisition - /// value wins; the port's <c>ArgMax</c> skips NaN (its comment assumes the values are finite). + /// value wins. The port's <c>ArgMax</c> skipped NaN until 2026-11-11; it now follows NumPy's rule (pinned by + /// <c>NumPyReductionOrderTests.ArgMaxPorts_FirstNanThenFirstMaximum_LikeNumPysArgmax</c>), but this run still + /// differs at trial 5 through the documented erf / UCRT tolerance (the last paragraph of the remarks). /// </summary> /// <remarks> /// The acquisition value is <c>log l(x) - log g(x)</c>. When a candidate's probability mass is zero under @@ -86,6 +88,15 @@ public void ConstraintViolationSums_UseCompensatedSumLikeCPython() /// (<c>235956546695320384</c>), the port index 11 (<c>114</c>). Replacing <c>np.argmax</c> with the port's /// loop in Python reproduces <c>114</c>, which isolates the cause. Only the first six trials are compared, /// because later ones also carry the documented erf ULP tolerance. + /// <para> + /// Since the argmax fix the port picks its first NaN, but its NaNs are not Optuna's: the candidates carry the + /// erf / UCRT ULP tolerance, and candidate 1 is <c>222479646760819</c> where Optuna draws + /// <c>222479646760813</c>. At that magnitude the bin <c>[log(x - 0.5), log(x + 0.5)]</c> spans about one + /// double, and for the port's value it collapses: both log densities are <c>-inf</c>, the acquisition is NaN + /// at index 1 (Optuna's is <c>-0.29165848147553675</c>), and the port picks <c>222479646760819</c> (measured + /// 2026-11-11; Optuna's NaNs are at 5, 6, 8, 9 and 21, the port's at 1, 5, 6, 8, 9 and 21). The remaining + /// difference is the erf class, so this reproduction passes only once that tolerance is closed. + /// </para> /// </remarks> [TestMethod] [OpenBugs] @@ -132,9 +143,10 @@ public void Qmc_BatchedAsk_UsesSearchSpaceOfRunningTrialsLikeOptuna() } /// <summary> - /// QA-34: CMA-ES must reject a mean outside the search-space bounds, as cmaes 0.13.1's <c>CMA.__init__</c> does - /// with <c>assert ... _is_valid_bounds(bounds, mean), "invalid bounds"</c>; the port's <c>Cma</c> and - /// <c>SepCma</c> constructors skip the check (only <c>CmaWm</c> has it) and optimize from the outside mean. + /// QA-34 (fixed 2026-11-12 by <c>1e8aba6</c>, with run 2's QA-80): CMA-ES must reject a mean outside the + /// search-space bounds, as cmaes 0.13.1's <c>CMA.__init__</c> does with + /// <c>assert ... _is_valid_bounds(bounds, mean), "invalid bounds"</c>; the port's <c>Cma</c> and <c>SepCma</c> + /// constructors skipped the check (only <c>CmaWm</c> had it) and optimized from the outside mean. /// </summary> /// <remarks> /// With <c>CmaEsSampler(seed=1, x0={"x": 5.0, "y": 0.0})</c> on <c>x, y ∈ [-1, 1]</c>, Optuna completes trial 0 @@ -144,7 +156,6 @@ public void Qmc_BatchedAsk_UsesSearchSpaceOfRunningTrialsLikeOptuna() /// since 4.9, but still accepted. /// </remarks> [TestMethod] - [OpenBugs] public void CmaEs_X0OutsideBounds_FailsTrialsLikeCmaes() { #pragma warning disable CS0618 // x0 is deprecated in Optuna 4.9, as in the port; the test needs it. @@ -160,9 +171,11 @@ public void CmaEs_X0OutsideBounds_FailsTrialsLikeCmaes() } /// <summary> - /// QA-41: sampling a float range whose span is not finite must fail without consuming the random stream, as - /// numpy's <c>RandomState.uniform</c> does with <c>OverflowError('Range exceeds valid bounds')</c>; the port - /// draws anyway, returns <c>inf</c> for <c>[1e-3, inf)</c> and shifts every later random value of the study. + /// QA-41 (fixed upstream in NumSharp 0.80.0): sampling a float range whose span is not finite must fail without + /// consuming the random stream, as numpy's <c>RandomState.uniform</c> does with + /// <c>OverflowError('Range exceeds valid bounds')</c>; the port drew anyway, returned <c>inf</c> for + /// <c>[1e-3, inf)</c> and shifted every later random value of the study, until NumSharp's legacy + /// <c>RandomState</c> became NumPy's <c>legacy-distributions.c</c> line for line (NumSharp <c>f87b4d04</c>). /// </summary> /// <remarks> /// <c>FloatDistribution</c> accepts infinite bounds in both languages, so the failure comes from the sampler: @@ -178,23 +191,24 @@ public void CmaEs_X0OutsideBounds_FailsTrialsLikeCmaes() /// state-machine fuzz. /// </remarks> [TestMethod] - [OpenBugs] public void RandomSampler_InfiniteRange_RaisesOverflowWithoutDrawingLikeNumpyUniform() { var study = Optuna.CreateStudy(sampler: new RandomSampler(seed: 0)); var trial = study.Ask(); - ((Action)(() => trial.SuggestFloat("x", 1e-3, double.PositiveInfinity))).Should().Throw<OverflowException>() + // NumPy's class: NumSharp.OverflowError since NumSharp 0.81.0 (it was .NET's OverflowException before). + ((Action)(() => trial.SuggestFloat("x", 1e-3, double.PositiveInfinity))).Should().ThrowExactly<NumSharp.OverflowError>() .WithMessage("Range exceeds valid bounds"); - ((Action)(() => trial.SuggestFloat("w", -1e308, 1e308))).Should().Throw<OverflowException>() + ((Action)(() => trial.SuggestFloat("w", -1e308, 1e308))).Should().ThrowExactly<NumSharp.OverflowError>() .WithMessage("Range exceeds valid bounds"); BitConverter.DoubleToInt64Bits(trial.SuggestFloat("y", 0, 1)).Should().Be(0x3fe18fe1565f12a8); } /// <summary> - /// QA-42 (root cause): <c>randint(low, low + 1)</c> must return <c>low</c> without consuming the stream, as - /// numpy's bounded-integer generator does (<c>random_bounded_uint64_fill</c> returns <c>off</c> when the range - /// is 0); NumSharp's <c>MT19937.Next(1)</c> draws a 32-bit word and masks it to 0. + /// QA-42 (root cause; fixed upstream in NumSharp 0.80.0): <c>randint(low, low + 1)</c> must return <c>low</c> + /// without consuming the stream, as numpy's bounded-integer generator does (<c>random_bounded_uint64_fill</c> + /// returns <c>off</c> when the range is 0); NumSharp's <c>MT19937.Next(1)</c> drew a 32-bit word and masked it to + /// 0 until its legacy <c>RandomState</c> rewrite (NumSharp <c>f87b4d04</c>). /// </summary> /// <remarks> /// numpy 2.4.2, <c>RandomState(0)</c>: after <c>randint(0, 1)</c> (or <c>choice(1)</c>) the next @@ -205,7 +219,6 @@ public void RandomSampler_InfiniteRange_RaisesOverflowWithoutDrawingLikeNumpyUni /// <c>Next(int)</c> / <c>NextLong(long)</c>), or in the call sites. /// </remarks> [TestMethod] - [OpenBugs] public void RandInt_SingleValueRange_DrawsNothingLikeNumpy() { var rng = new LazyRandomState(0).Rng; @@ -215,9 +228,10 @@ public void RandInt_SingleValueRange_DrawsNothingLikeNumpy() } /// <summary> - /// QA-42: NSGA-II's parent tournament over a single remaining candidate must leave the random stream - /// untouched, as Optuna's <c>_select_parent</c> does (<c>rng.choice(1)</c> draws nothing); the port consumes a - /// word per call, so with <c>population_size=2</c> every child after the first generation differs. + /// QA-42 (fixed upstream in NumSharp 0.80.0): NSGA-II's parent tournament over a single remaining candidate must + /// leave the random stream untouched, as Optuna's <c>_select_parent</c> does (<c>rng.choice(1)</c> draws nothing); + /// the port consumed a word per call, so with <c>population_size=2</c> every child after the first generation + /// differed. /// </summary> /// <remarks> /// <c>_select_parents</c> excludes the parents already chosen, so with a population of 2 the second parent is @@ -230,7 +244,6 @@ public void RandInt_SingleValueRange_DrawsNothingLikeNumpy() /// sampler-option fuzz (20 of 600 programs, all with population 2 or 3). /// </remarks> [TestMethod] - [OpenBugs] public void NsgaII_PopulationOfTwo_SecondParentDrawLeavesStreamLikeOptuna() { var study = Optuna.CreateStudy(sampler: new NSGAIISampler(populationSize: 2, mutationProb: 0.0, seed: 0)); @@ -275,9 +288,10 @@ public void GridSampler_AstralCharacterNames_EnumerateGridLikePython() } /// <summary> - /// QA-48 (a): the TPE <c>weights</c> validation errors must print the rejected array the way NumPy's - /// <c>str(ndarray)</c> does (<c>[ 0.5 -0.25]</c>, <c>[0.]</c>); the port joins Python float reprs with one - /// space (<c>[0.5 -0.25]</c>, <c>[0.0]</c>), so the exception text differs. + /// QA-48 (a) (fixed 2026-11-11): the TPE <c>weights</c> validation errors must print the rejected array the way + /// NumPy's <c>str(ndarray)</c> does (<c>[ 0.5 -0.25]</c>, <c>[0.]</c>). The port joined Python float reprs with + /// one space (<c>[0.5 -0.25]</c>, <c>[0.0]</c>); it now prints with NumSharp's <c>NDArray.ToString()</c>, a port of + /// NumPy's array printer. /// </summary> /// <remarks> /// <c>_ParzenEstimator._call_weights_func</c> formats the array with an f-string, i.e. NumPy's array printer: @@ -288,7 +302,6 @@ public void GridSampler_AstralCharacterNames_EnumerateGridLikePython() /// Optuna 5.0.0 raises the two messages below (found by the D92 TPE option probe). /// </remarks> [TestMethod] - [OpenBugs] public void Tpe_InvalidWeights_MessagePrintsArrayLikeNumpy() { static double Objective(Trial t) => @@ -374,10 +387,10 @@ public void Tpe_NegativeGammaSingleObjective_SplitsWithPythonSliceSemantics() } /// <summary> - /// QA-49: the GP search space must build a stepped parameter's grid exactly as <c>np.arange(low, high + step / 2, - /// step)</c> does — every value <c>low + i * ((low + step) - low)</c> — but the port's <c>GpSearchSpace.Arange</c> - /// computes <c>low + i * step</c>, so the normalized grid differs in its last bits whenever - /// <c>(low + step) - low != step</c>. + /// QA-49 (fixed 2026-11-11): the GP search space must build a stepped parameter's grid exactly as + /// <c>np.arange(low, high + step / 2, step)</c> does — every value <c>low + i * ((low + step) - low)</c>. The port's + /// <c>GpSearchSpace.Arange</c> computed <c>low + i * step</c>, so the normalized grid differed in its last bits + /// whenever <c>(low + step) - low != step</c>; it now calls NumSharp's <c>np.arange</c>, which fills NumPy's way. /// </summary> /// <remarks> /// NumPy's <c>arange</c> stores <c>start</c> and <c>start + step</c> and fills the rest with @@ -388,7 +401,6 @@ public void Tpe_NegativeGammaSingleObjective_SplitsWithPythonSliceSemantics() /// Optuna 5.0.0's <c>get_choices_of_discrete_params()</c> for that distribution is the grid asserted below. /// </remarks> [TestMethod] - [OpenBugs] public void GpSearchSpace_SteppedFloatGrid_UsesNumpyArangeStep() { var space = new OptunaSharp.Gp.GpSearchSpace(new Dictionary<string, BaseDistribution> @@ -401,9 +413,9 @@ public void GpSearchSpace_SteppedFloatGrid_UsesNumpyArangeStep() } /// <summary> - /// QA-49, the user-visible effect: <see cref="GPSampler" /> suggests a stepped float by unnormalizing the - /// grid point it picked, without rounding it again, so the port's <c>low + i * step</c> grid reaches - /// <c>trial.params</c> — <c>0.9999999999999998</c> where Optuna suggests <c>1.0</c>. + /// QA-49, the user-visible effect (fixed 2026-11-11): <see cref="GPSampler" /> suggests a stepped float by + /// unnormalizing the grid point it picked, without rounding it again, so the grid reaches <c>trial.params</c>; the + /// former <c>low + i * step</c> grid gave <c>0.9999999999999998</c> where Optuna suggests <c>1.0</c>. /// </summary> /// <remarks> /// <c>_get_unnormalized_param</c> only clips a float to <c>[low, high]</c>; the grid value @@ -412,11 +424,24 @@ public void GpSearchSpace_SteppedFloatGrid_UsesNumpyArangeStep() /// trials, <c>(x - 0.7) ** 2</c> over <c>[0.1, 1.0]</c> step <c>0.3</c>; the port matches every trial but the fourth. /// (With <c>[0.1, 2.5]</c> the same run suggests <c>1.9000000000000004</c> in Optuna and <c>1.9000000000000001</c> in /// the port.) + /// <para> + /// The expected trials are Optuna's on x64, so the test is pinned to x64, as the suite's other host-dependent + /// bit-exact oracles are (AGE-MOEA-2's operators, the CMA-ES state oracle, sklearn, SHAP, the ES digests). CI's + /// first macOS arm64 run of it (2026-11-14, net8.0) suggested <c>0.9999999999999998</c> for the fourth trial, the + /// former grid's value, with the same choice in every trial: the stepped grid itself is NumPy's there too + /// (<see cref="GpSearchSpace_SteppedFloatGrid_UsesNumpyArangeStep" /> passed), so the GP's last-bit arithmetic on + /// arm64 reached that grid point by another route. + /// </para> /// </remarks> [TestMethod] - [OpenBugs] public void GpSampler_SteppedFloat_SuggestsNumpyGridValues() { + // x64 only: the expected values are an x64 Optuna run's last bits (see remarks). + if (System.Runtime.InteropServices.RuntimeInformation.ProcessArchitecture != System.Runtime.InteropServices.Architecture.X64) + Assert.Inconclusive( + "The expected trials are Optuna 5.0.0's on x64; the GP's arithmetic differs in its last bits on " + + $"{System.Runtime.InteropServices.RuntimeInformation.ProcessArchitecture}, which moves the fourth trial's value."); + var study = Optuna.CreateStudy(sampler: new GPSampler(seed: 0, nStartupTrials: 2)); study.Optimize(t => Math.Pow(t.SuggestFloat("x", 0.1, 1.0, step: 0.3) - 0.7, 2), nTrials: 8); @@ -425,9 +450,30 @@ public void GpSampler_SteppedFloat_SuggestsNumpyGridValues() } /// <summary> - /// QA-53: when every GP acquisition value is NaN, Optuna's discrete line search hands scipy's Brent minimizer - /// the bracket <c>(inf, NaN, inf)</c> and fails the suggestion with scipy's bracket <c>ValueError</c>; the port - /// returns a parameter value (<c>16</c> here) instead. + /// The GP search space's discrete rounding, <c>_round_one_normalized_param</c>, takes + /// <c>(param_value - low + 0.5 * step) // step</c>: NumPy's <c>floor_divide</c> floors the EXACT quotient, so a point + /// on a grid midpoint rounds down where <c>Math.Floor(a / b)</c> (the port until 2026-11-11) rounded up a whole + /// grid step. The Sobol'-style dyadic point <c>0.75</c> on <c>[-7.82, -6.67]</c> step <c>0.05</c> unnormalizes to the + /// midpoint <c>-6.945</c>; <c>a = 0.9</c> and <c>0.9 // 0.05</c> is <c>17</c> (the double <c>0.05</c> is a little over + /// 1/20), but <c>0.9 / 0.05</c> rounds to <c>18.0</c>. Optuna 5.0.0 / NumPy 2.4.2 return the normalized + /// <c>0.7291666666666661</c> (grid point <c>-6.970000000000001</c>); the former rounding gave <c>0.7708333333333333</c> + /// (<c>-6.92</c>). About 1 in 800 random or dyadic points on stepped grids hit such a case. + /// </summary> + [TestMethod] + public void GpSearchSpace_RoundingAGridMidpoint_FloorsTheExactQuotientLikeNumpy() + { + double rounded = OptunaSharp.Gp.GpSearchSpace.RoundOneNormalizedParam( + 0.75, OptunaSharp.Gp.GpSearchSpace.ScaleType.Linear, (-7.82, -6.67), 0.05); + + BitConverter.DoubleToInt64Bits(rounded).Should().Be(0x3FE7555555555550L, + $"NumPy's floor_divide puts 0.75 on grid point 17 (0.7291666666666661), not {rounded:R}"); + } + + /// <summary> + /// QA-53 (fixed 2026-11-11): when every GP acquisition value is NaN, Optuna's discrete line search hands scipy's + /// Brent minimizer the bracket <c>(inf, NaN, inf)</c> and fails the suggestion with scipy's bracket + /// <c>ValueError</c>; the port returned a parameter value (<c>16</c> here) until <c>GPSampler.ColumnMax</c> became + /// NumSharp's NaN-propagating <c>np.amax</c>. /// </summary> /// <remarks> /// Objective values <c>1.7e308, 1.7e308, -1.7e308</c> overflow <c>_standardize_values</c> (the mean is @@ -435,13 +481,15 @@ public void GpSampler_SteppedFloat_SuggestsNumpyGridValues() /// Optuna: 2 of 2 start points NaN). For an <c>IntDistribution(0, 20)</c> (21 grid points, more than the 16 of /// the exhaustive search) <c>_discrete_line_search</c> calls <c>minimize_scalar(method="brent")</c>, whose bracket /// check raises the message below — its own comment says the bracket is valid only "if fval is finite". The - /// port's <c>BrentMinimizer.MinimizeScalar</c> has the same check, so a NaN does not reach it the same way; the - /// divergence's root cause in the port was not located during the run. With a float parameter both sides return - /// the same point (<c>0.7903830111026764</c>). Exotic input (values near the float maximum); found by the D94 - /// probe. + /// port's <c>BrentMinimizer.MinimizeScalar</c> has the same check, but the NaN never reaches it: the LogEI + /// threshold is <c>standardized_score_vals[:, 0].max()</c>, which NumPy returns as NaN when the column holds a + /// NaN, while the port's <c>GPSampler.ColumnMax</c> skips NaNs (<c>if (v > max)</c> from <c>-inf</c>) and returns + /// <c>-inf</c>, so its acquisition stays finite. Root cause located by the 2026-11-10 run (E12): patching Optuna's + /// <c>LogEI</c> to receive <c>-inf</c> for a NaN threshold makes Optuna return <c>16</c> too. With a float + /// parameter both sides return the same point (<c>0.7903830111026764</c>). Exotic input (values near the float + /// maximum); found by the D94 probe. /// </remarks> [TestMethod] - [OpenBugs] public void GpSampler_AllNaNAcquisition_IntLineSearchRaisesBracketErrorLikeScipy() { var study = Optuna.CreateStudy(sampler: new GPSampler(seed: 0, nStartupTrials: 3)); @@ -458,9 +506,10 @@ public void GpSampler_AllNaNAcquisition_IntLineSearchRaisesBracketErrorLikeScipy } /// <summary> - /// QA-55: a <see cref="GridSampler" /> whose search space has an empty value list must fail the first trial with - /// NumPy's <c>choice</c> error, <c>'a' cannot be empty unless no samples are taken</c>; the port's shortcut - /// <c>target_grids[randint(0, len)]</c> fails with NumSharp's <c>randint</c> message <c>low >= high</c> instead. + /// QA-55 (fixed 2026-11-11): a <see cref="GridSampler" /> whose search space has an empty value list must fail the + /// first trial with NumPy's <c>choice</c> error, <c>'a' cannot be empty unless no samples are taken</c>; the port's + /// shortcut <c>target_grids[randint(0, len)]</c> failed with NumSharp's <c>randint</c> message <c>low >= high</c> + /// until it became NumSharp's own <c>RandomState.choice</c>. /// </summary> /// <remarks> /// Optuna validates no grid's length, so <c>{"x": []}</c> builds an empty grid; <c>sample_relative</c> finds no @@ -471,7 +520,6 @@ public void GpSampler_AllNaNAcquisition_IntLineSearchRaisesBracketErrorLikeScipy /// unused and missing parameters, <c>True</c> / <c>1</c> choices) match Optuna 5.0.0. /// </remarks> [TestMethod] - [OpenBugs] public void GridSampler_EmptyValueList_FailsWithNumpyChoiceMessage() { var study = Optuna.CreateStudy(sampler: new GridSampler( diff --git a/test/OptunaSharp.Tests/QA/StudyParityBugTests.cs b/test/OptunaSharp.Tests/QA/StudyParityBugTests.cs index f3a6a8f..6559cf2 100644 --- a/test/OptunaSharp.Tests/QA/StudyParityBugTests.cs +++ b/test/OptunaSharp.Tests/QA/StudyParityBugTests.cs @@ -206,9 +206,10 @@ public void TrialsDataframe_AstralCharacterNames_SortByCodePointLikePython() } /// <summary> - /// QA-50: <c>enqueue_trial(..., skip_if_exists=True)</c> must compare infinite parameter values the way - /// <c>np.isclose</c> does — equal infinities are duplicates, nothing else is close to an infinity — but the - /// port evaluates <c>|a - b| <= 1e-5 * |b|</c> on them, which inverts both cases. + /// QA-50 (fixed 2026-11-11): <c>enqueue_trial(..., skip_if_exists=True)</c> must compare infinite parameter values + /// the way <c>np.isclose</c> does — equal infinities are duplicates, nothing else is close to an infinity. The port + /// evaluated <c>|a - b| <= 1e-5 * |b|</c> on them, which inverted both cases; it now calls + /// <c>MathUtil.IsClose</c>, NumPy's full formula. /// </summary> /// <remarks> /// <c>Study._should_skip_enqueue</c> calls <c>np.isclose(new, existing, atol=0.0, equal_nan=True)</c>; NumPy only @@ -219,7 +220,6 @@ public void TrialsDataframe_AstralCharacterNames_SortByCodePointLikePython() /// trials in the three studies below; the port keeps 2, 1 and 1. Found by the D95 probe of the duplicate check. /// </remarks> [TestMethod] - [OpenBugs] public void EnqueueTrial_SkipIfExists_ComparesInfinitiesLikeNumpyIsclose() { int TrialsAfter(double existing, double enqueued) diff --git a/test/OptunaSharp.Tests/QA/TerminatorParityBugTests.cs b/test/OptunaSharp.Tests/QA/TerminatorParityBugTests.cs index 5adb8bf..cf1c83f 100644 --- a/test/OptunaSharp.Tests/QA/TerminatorParityBugTests.cs +++ b/test/OptunaSharp.Tests/QA/TerminatorParityBugTests.cs @@ -13,19 +13,17 @@ namespace OptunaSharp.Tests.QA; public class TerminatorParityBugTests { /// <summary> - /// QA-22: <see cref="CrossValidationErrorEvaluator" /> must compute <c>np.var</c> with numpy's pairwise - /// summation; the port sums sequentially, which differs from 8 scores on (10-fold CV is the usual case). + /// QA-22 (fixed 2026-11-11): <see cref="CrossValidationErrorEvaluator" /> must compute <c>np.var</c> with numpy's + /// pairwise summation; the port summed sequentially, which differs from 8 scores on (10-fold CV is the usual case). /// </summary> /// <remarks> /// numpy's <c>add.reduce</c> on a contiguous float64 array uses 8 interleaved accumulators once /// <c>n >= 8</c> (<c>pairwise_sum</c>), both for the mean and for the sum of squared deviations; the - /// port's <c>NumpyVar</c> loops once. For these ten scores Optuna returns <c>0.03772062328635506</c> and - /// the port <c>0.03772062328635505</c>; 1,584 of 5,000 random 10-fold score sets differ. ULP-level, but it - /// is the error the terminator compares against the regret bound, and the port keeps numpy's reduction - /// order bit-exact elsewhere. + /// port's <c>NumpyVar</c> looped once. For these ten scores Optuna returns <c>0.03772062328635506</c> and + /// the old port <c>0.03772062328635505</c>; 1,584 of 5,000 random 10-fold score sets differed. Fixed by computing + /// the variance with NumSharp's <c>np.var</c>, which runs NumPy's <c>_var</c> and its pairwise sums. /// </remarks> [TestMethod] - [OpenBugs] public void CrossValidationError_TenScores_MatchesNumpyPairwiseVar() { var scores = new[] { 0.942, 0.9189, 0.7766, 0.9146, 0.7776, 0.9348, 0.886, 0.804, 0.7631, 0.7021 }; diff --git a/test/OptunaSharp.Tests/QA/VisualizationParityBugTests.cs b/test/OptunaSharp.Tests/QA/VisualizationParityBugTests.cs index 3859aaa..eb6e59c 100644 --- a/test/OptunaSharp.Tests/QA/VisualizationParityBugTests.cs +++ b/test/OptunaSharp.Tests/QA/VisualizationParityBugTests.cs @@ -133,9 +133,11 @@ public void Timeline_ReversedTimesWarning_FormatsDatetimesLikePython() } /// <summary> - /// QA-54: the EDF grid must be NumPy's <c>np.linspace</c>, which switches to <c>(i / div) * delta + start</c> when - /// the step <c>delta / div</c> underflows to zero; the port's <c>MathUtil.Linspace</c> always computes - /// <c>i * step + start</c>, so over a subnormal range every point but the last collapses onto <c>start</c>. + /// QA-54 (fixed 2026-11-11): the EDF grid must be NumPy's <c>np.linspace</c>, which switches to + /// <c>(i / div) * delta + start</c> when the step <c>delta / div</c> underflows to zero; the port's + /// <c>MathUtil.Linspace</c> always computed <c>i * step + start</c>, so over a subnormal range every point but the last + /// collapsed onto <c>start</c>. <c>MathUtil.Linspace</c> now delegates to NumSharp's <c>np.linspace</c>, which ports + /// that branch. /// </summary> /// <remarks> /// NumPy's linspace keeps a "denormal" branch (gh-5437): with objective values <c>0.0</c> and <c>5e-324</c> the @@ -147,7 +149,6 @@ public void Timeline_ReversedTimesWarning_FormatsDatetimesLikePython() /// Exotic input (a whole study inside the subnormal range). /// </remarks> [TestMethod] - [OpenBugs] public void Edf_SubnormalValueRange_GridFollowsNumpyLinspace() { var study = Optuna.CreateStudy(); diff --git a/test/OptunaSharp.Tests/QmcSamplerTests.cs b/test/OptunaSharp.Tests/QmcSamplerTests.cs index fe713ef..84f2e6d 100644 --- a/test/OptunaSharp.Tests/QmcSamplerTests.cs +++ b/test/OptunaSharp.Tests/QmcSamplerTests.cs @@ -344,4 +344,38 @@ List<double> Run() Run().Should().Equal(Run()); } + + /// <summary> + /// Plan 14: the sample-id attribute key is computed once per search space and reused while the same names come with + /// the very same distribution objects. A memoized key must always equal the key a fresh sampler computes: for the + /// same objects again (reused), for equal-by-value objects that print differently (Python equality makes + /// <c>True == 1</c>, but <c>str()</c> differs, and so must the key), for a reordered space, and back again. + /// </summary> + /// <param name="scramble">Whether the engine is scrambled (the seed then enters the key).</param> + [TestMethod] + [DataRow(false)] + [DataRow(true)] + public void QmcIdKey_Memoized_EqualsAFreshComputation(bool scramble) + { + var x = new FloatDistribution(-5, 5); + var flags = new CategoricalDistribution(new CategoricalChoice[] { true, false }); + var ints = new CategoricalDistribution(new CategoricalChoice[] { 1L, 0L }); + flags.Equals(ints).Should().BeTrue("Python equality: True == 1 and False == 0"); + var spaceFlags = new OrderedDict<string, BaseDistribution> { ["x"] = x, ["c"] = flags }; + var spaceInts = new OrderedDict<string, BaseDistribution> { ["x"] = x, ["c"] = ints }; + var reordered = new OrderedDict<string, BaseDistribution> { ["c"] = flags, ["x"] = x }; + + string Fresh(OrderedDict<string, BaseDistribution> space) => new QMCSampler(scramble: scramble, seed: 3).QmcIdKey(space); + + var memo = new QMCSampler(scramble: scramble, seed: 3); + string first = memo.QmcIdKey(spaceFlags); + first.Should().Be(Fresh(spaceFlags)); + memo.QmcIdKey(spaceFlags).Should().Be(first, "the same objects reuse the key"); + string ints2 = memo.QmcIdKey(spaceInts); + ints2.Should().Be(Fresh(spaceInts)); + ints2.Should().NotBe(first, "equal choices that print differently give a different key, as in Optuna"); + memo.QmcIdKey(reordered).Should().Be(Fresh(reordered)); + memo.QmcIdKey(spaceFlags).Should().Be(first); + first.Should().MatchRegex("^qmc:[0-9a-f]{64}$"); + } } diff --git a/test/OptunaSharp.Tests/Samplers/AgeMoea2OperatorParityTests.cs b/test/OptunaSharp.Tests/Samplers/AgeMoea2OperatorParityTests.cs index c9770ff..637b057 100644 --- a/test/OptunaSharp.Tests/Samplers/AgeMoea2OperatorParityTests.cs +++ b/test/OptunaSharp.Tests/Samplers/AgeMoea2OperatorParityTests.cs @@ -22,7 +22,8 @@ namespace OptunaSharp.Tests.Samplers; /// <para>The cases that pass through <c>np.linalg.solve</c> are host-pinned to x64 and report /// Inconclusive elsewhere: normalization, survival scores, <c>_do</c> and the full driver. That solve is /// the extreme-point hyperplane in <see cref="AgeMoeaSurvival" />. The committed oracle was generated -/// on OpenBLAS's x64 Haswell kernels, which CI selects with <c>OPENBLAS_CORETYPE=Haswell</c>, and arm64 +/// on OpenBLAS's x64 Haswell kernels, which CI selects with <c>OPENBLAS_CORETYPE=Haswell</c> (except on Windows +/// on AMD CPUs with AVX-512, where those cases report Inconclusive: see <c>RequireBitExactLinalgHost</c>), and arm64 /// OpenBLAS kernels land 1–2 ULP away; the macOS arm64 runner showed it on Normalize and Do. This is /// the same host-pin model as the sklearn, SHAP and interop parity suites. The pure-RNG operators /// (sampling, SBX, PM, tournament, mating) and the manifold geometry still run, and must hold @@ -35,10 +36,16 @@ public class AgeMoea2OperatorParityTests /// <summary> /// Skips (Inconclusive) a case whose oracle depends on the LAPACK solve in - /// <see cref="AgeMoeaSurvival" />'s normalization, unless the process runs on x64, the - /// architecture whose OpenBLAS kernels produced the oracle. + /// <see cref="AgeMoeaSurvival" />'s normalization, unless the process runs on x64 AND OpenBLAS runs its + /// Haswell kernels, the ones that produced the oracle. /// </summary> - /// <exception cref="AssertInconclusiveException">The process is not x64.</exception> + /// <remarks> + /// The kernel check matters on x64 too: CI pins <c>OPENBLAS_CORETYPE=Haswell</c> except on Windows on AMD CPUs + /// with AVX-512, where OpenBLAS 0.3.34's forced Haswell kernels fault (<c>.github/scripts/openblas_coretype.sh</c>), + /// and OpenBLAS's own choice there (Zen 4/5, 2026-11-14) put Normalize and Do a last bit away. The same holds for + /// a local run on any CPU whose default kernels are not Haswell. + /// </remarks> + /// <exception cref="AssertInconclusiveException">The process is not x64, or OpenBLAS is not running its Haswell kernels.</exception> private static void RequireBitExactLinalgHost() { if (RuntimeInformation.ProcessArchitecture != Architecture.X64) @@ -46,6 +53,13 @@ private static void RequireBitExactLinalgHost() "AGE-MOEA-2 normalization solves the extreme-point hyperplane with np.linalg.solve (OpenBLAS); " + "the committed oracle was captured on x64 Haswell kernels, which " + $"ProcessArchitecture={RuntimeInformation.ProcessArchitecture} does not reproduce bit-for-bit."); + // OpenBlasEngine.CoreName is OpenBLAS's openblas_get_corename(); null only when no OpenBLAS is loaded, which + // OptunaSharp's module initializer rules out, and then the case cannot be bit-exact either. + if (NumSharp.Interop.OpenBLAS.OpenBlasEngine.CoreName is not "Haswell") + Assert.Inconclusive( + "AGE-MOEA-2 normalization's oracle was captured on OpenBLAS's Haswell kernels; this process runs " + + $"'{NumSharp.Interop.OpenBLAS.OpenBlasEngine.CoreName}' (OPENBLAS_CORETYPE=" + + $"{Environment.GetEnvironmentVariable("OPENBLAS_CORETYPE") ?? "unset"}), whose last bits differ."); } [ClassInitialize] diff --git a/test/OptunaSharp.Tests/Samplers/BruteForceSamplerTests.cs b/test/OptunaSharp.Tests/Samplers/BruteForceSamplerTests.cs index 641e639..2d3c792 100644 --- a/test/OptunaSharp.Tests/Samplers/BruteForceSamplerTests.cs +++ b/test/OptunaSharp.Tests/Samplers/BruteForceSamplerTests.cs @@ -350,6 +350,56 @@ public void NonDivisibleStep_WithSuccessfulFallback_DoesNotThrow() act.Should().NotThrow(); } + /// <summary> + /// Plan 15: a tree rebuild enumerates each progression's candidates once, through <c>CandidatesFor</c>. The cached + /// list equals a fresh enumeration bit for bit and is returned again for the same progression; progressions that + /// <c>ChoicesArgs.Equals</c> calls equal but whose bits differ (-0.0 and 0.0) or whose kind differs (int and float) + /// get lists of their own. + /// </summary> + [TestMethod] + public void CandidatesFor_CachesPerExactProgression_AndMatchesAFreshEnumeration() + { + var cache = new Dictionary<(long, long, bool, long, bool), List<double>>(); + var cases = new[] + { + new BruteForceSampler.ChoicesArgs(0, 5, 1, isInt: true), + new BruteForceSampler.ChoicesArgs(-1.0, 1.0, 0.25, isInt: false), + new BruteForceSampler.ChoicesArgs(0.1, 0.7, 0.1, isInt: false), + new BruteForceSampler.ChoicesArgs(-0.0, 1.0, 0.5, isInt: false), + new BruteForceSampler.ChoicesArgs(0.0, 1.0, 0.5, isInt: false), + new BruteForceSampler.ChoicesArgs(0.0, 3.0, 1.0, isInt: false), + new BruteForceSampler.ChoicesArgs(0.0, 3.0, 1.0, isInt: true), + }; + var lists = new List<List<double>>(); + foreach (var args in cases) + { + List<double> cached = BruteForceSampler.CandidatesFor(args, cache); + List<double> fresh = BruteForceSampler.EnumerateCandidates(args); + cached.Select(BitConverter.DoubleToInt64Bits).Should().Equal(fresh.Select(BitConverter.DoubleToInt64Bits)); + BruteForceSampler.CandidatesFor(args, cache).Should().BeSameAs(cached, "the same progression is enumerated once"); + lists.Add(cached); + } + cache.Should().HaveCount(cases.Length, "-0.0 and 0.0, and int and float, are different keys"); + lists.Distinct().Should().HaveCount(cases.Length); + } + + /// <summary> + /// Plan 15: a float progression without a step cannot be enumerated; through the cache it throws Optuna's + /// <c>ValueError</c> on every call, as <c>EnumerateCandidates</c> does, and leaves nothing cached. + /// </summary> + [TestMethod] + public void CandidatesFor_AProgressionWithoutAStep_ThrowsEveryTime_AndCachesNothing() + { + var cache = new Dictionary<(long, long, bool, long, bool), List<double>>(); + var args = new BruteForceSampler.ChoicesArgs(0.0, 1.0, null, isInt: false); + for (int i = 0; i < 2; i++) + { + Action enumerate = () => BruteForceSampler.CandidatesFor(args, cache); + enumerate.Should().Throw<NumSharp.ValueError>().WithMessage("FloatDistribution.step must be given*"); + } + cache.Should().BeEmpty(); + } + /// <summary> /// A <see cref="Study" /> proxy that counts <see cref="Study.Stop" /> calls (Optuna's tests /// use <c>patch.object(study, "stop")</c>). It shares the underlying storage/sampler so the diff --git a/test/OptunaSharp.Tests/Samplers/CmaEsSamplerCacheTests.cs b/test/OptunaSharp.Tests/Samplers/CmaEsSamplerCacheTests.cs new file mode 100644 index 0000000..a597cd1 --- /dev/null +++ b/test/OptunaSharp.Tests/Samplers/CmaEsSamplerCacheTests.cs @@ -0,0 +1,353 @@ +using System; +using System.Collections.Generic; +using System.IO; +using System.Linq; +using AwesomeAssertions; +using OptunaSharp.Samplers; +using OptunaSharp.Storages; +using OptunaSharp.Storages.Journal; + +namespace OptunaSharp.Tests.Samplers; + +/// <summary> +/// The optimizer cache and incremental history of <see cref="CmaEsSampler" /> (Rustuna plan 13, phase 1), tested +/// through the sampler. That the trials themselves equal Optuna's is the live interop suite's job +/// (<c>CmaEsSamplerParityTests</c>); these pin the cache's contract (one restore per generation, a failed teller's +/// state restored again, nothing reused across storages) and the history read +/// (<c>Study.GetTrialsForSampler</c>). +/// </summary> +[TestClass] +public class CmaEsSamplerCacheTests +{ + /// <summary>A shifted sphere over <paramref name="dim" /> float parameters in [-5, 5].</summary> + /// <param name="dim">Number of parameters.</param> + /// <param name="shift">Where the optimum is, on every axis.</param> + /// <returns>The objective.</returns> + private static Func<Trial, double> Sphere(int dim, double shift) => t => + { + double v = 0; + for (int i = 0; i < dim; i++) + { + double x = t.SuggestFloat($"x{i}", -5, 5) - shift; + v += x * x; + } + return v; + }; + + /// <summary>Whether the trial stored an optimizer state, i.e. it told a generation.</summary> + /// <param name="trial">A finished trial.</param> + /// <returns>True when a <c>cma:optimizer:*</c> chunk is present.</returns> + private static bool HoldsState(FrozenTrial trial) + => trial.SystemAttrs.Keys.Any(k => k.StartsWith("cma:optimizer:", StringComparison.Ordinal)); + + /// <summary>The trial's stored optimizer state, chunks concatenated in order.</summary> + /// <param name="trial">A trial that told a generation.</param> + /// <returns>The stored hex pickle.</returns> + private static string StoredState(FrozenTrial trial) + => string.Concat(trial.SystemAttrs.Keys.Where(k => k.StartsWith("cma:optimizer:", StringComparison.Ordinal)) + .OrderBy(k => int.Parse(k["cma:optimizer:".Length..])) + .Select(k => (string)trial.SystemAttrs[k]!)); + + /// <summary> + /// In a sequential run each stored state is restored exactly once, at the ask after the tell that stored it; + /// every other ask of the generation reuses that object. Optuna restores on every ask (199 times here). + /// </summary> + [TestMethod] + public void ASequentialRun_RestoresEachStoredStateOnce_AtTheAskAfterItsTell() + { + var sampler = new CmaEsSampler(seed: 3, popsize: 8); + var study = Optuna.CreateStudy(sampler: sampler); + study.Optimize(Sphere(5, 0.7), nTrials: 200); + + int tellers = study.Trials.Count(HoldsState); + tellers.Should().BeGreaterThan(20); + int expected = HoldsState(study.Trials[^1]) ? tellers - 1 : tellers; + sampler.RestoreCount.Should().Be(expected); + } + + /// <summary> + /// A trial that told a generation and then failed never becomes the latest state holder, so the next ask + /// restores the previous state again (the cache was dropped at the tell) and tells the same solutions: the state + /// it stores equals the failed teller's, byte for byte. The restore count keeps its one-per-tell contract. + /// </summary> + /// <exception cref="InvalidOperationException"> + /// Thrown by the objective on purpose for every other trial that told a generation, and caught by + /// <c>Optimize</c>, so it never leaves the test. + /// </exception> + [TestMethod] + public void AFailedTeller_ItsGenerationIsToldAgainFromThePreviousState_IdenticalState() + { + var sampler = new CmaEsSampler(seed: 5, popsize: 6); + var study = Optuna.CreateStudy(sampler: sampler); + var sphere = Sphere(4, -1.2); + int tellersSeen = 0; + study.Optimize(t => + { + double v = sphere(t); + // The trial told a generation if its sampling stored a state; every other such trial fails afterwards, so + // the failed-teller path is exercised for sure (a fixed failure pattern can miss every teller). + bool told = study.Storage.GetTrialSystemAttrs(t.TrialId).ContainsKey("cma:optimizer:0"); + if (told && tellersSeen++ % 2 == 0) + throw new InvalidOperationException("planned failure"); + return v; + }, nTrials: 300, @catch: new[] { typeof(InvalidOperationException) }); + + var trials = study.Trials; + int failedTellers = 0; + for (int i = 0; i + 1 < trials.Count; i++) + { + if (trials[i].State != TrialState.Fail || !HoldsState(trials[i])) + continue; + failedTellers++; + HoldsState(trials[i + 1]).Should().BeTrue($"trial {i + 1} tells the generation trial {i} told before failing"); + StoredState(trials[i + 1]).Should().Be(StoredState(trials[i]), + $"the same previous state and the same solutions give the same state (trials {i} and {i + 1})"); + } + failedTellers.Should().BeGreaterThan(0, "the scenario must exercise a failed teller"); + + // One restore follows each tell, at the next ask, with one exception: when no completed trial holds a state yet + // (the very first teller failed), the next ask starts a fresh optimizer instead of restoring one. + int expected = 0; + bool holderExists = false; + for (int i = 0; i + 1 < trials.Count; i++) + { + if (!HoldsState(trials[i])) + continue; + if (trials[i].State == TrialState.Complete) + holderExists = true; + if (holderExists) + expected++; + } + sampler.RestoreCount.Should().Be(expected); + } + + /// <summary> + /// One sampler used for a second study on another in-memory storage. Trial ids restart at 0 there, so the second + /// study's state holders reuse the first study's ids; the history starts over on the new storage and drops the + /// cached optimizer, so every state is restored from the second study's own storage. A stale cache would answer + /// with the first study's optimizer once the ids collide, and the count would come out one short. + /// </summary> + [TestMethod] + public void ASecondStudyOnAnotherStorage_NeverReusesTheFirstStudysOptimizer() + { + var sampler = new CmaEsSampler(seed: 1, popsize: 6); + var first = Optuna.CreateStudy(storage: new InMemoryStorage(), sampler: sampler); + first.Optimize(Sphere(3, 1.0), nTrials: 30); + int afterFirst = sampler.RestoreCount; + + var second = Optuna.CreateStudy(storage: new InMemoryStorage(), sampler: sampler); + second.Optimize(Sphere(3, -2.0), nTrials: 80); + + int tellers = second.Trials.Count(HoldsState); + int expected = HoldsState(second.Trials[^1]) ? tellers - 1 : tellers; + (sampler.RestoreCount - afterFirst).Should().Be(expected); + second.Trials.Skip(1).Should().OnlyContain(t => t.SystemAttrs.ContainsKey("cma:generation"), + "every trial after the startup trial is sampled by CMA-ES from the second study's own state"); + } + + /// <summary> + /// <c>Study.GetTrialsForSampler</c> reads an in-memory study through its zero-copy view, and any other storage + /// through Optuna's read (here a journal file), so a database-backed storage gets no extra round trip. Both + /// return the same trials in the same order. + /// </summary> + [TestMethod] + public void GetTrialsForSampler_IsTheZeroCopyViewInMemory_AndOptunasReadElsewhere() + { + var inMemory = Optuna.CreateStudy(storage: new InMemoryStorage()); + inMemory.Optimize(t => t.SuggestFloat("x", 0, 1), nTrials: 5); + inMemory.Storage.HasZeroCopyTrialsView.Should().BeTrue(); + var view = inMemory.GetTrialsForSampler(useCache: false); + view.Should().BeOfType<TrialsPrefixView>(); + view.Select(t => t.Number).Should().Equal(Enumerable.Range(0, 5)); + + string path = Path.Combine(Path.GetTempPath(), $"optunasharp-sampler-read-{Guid.NewGuid():N}.log"); + try + { + var journal = Optuna.CreateStudy(storage: new JournalStorage(new JournalFileBackend(path))); + journal.Optimize(t => t.SuggestFloat("x", 0, 1), nTrials: 5); + journal.Storage.HasZeroCopyTrialsView.Should().BeFalse(); + var read = journal.GetTrialsForSampler(useCache: false); + read.Should().NotBeOfType<TrialsPrefixView>(); + read.Select(t => t.Number).Should().Equal(Enumerable.Range(0, 5)); + } + finally + { + File.Delete(path); + } + } + + /// <summary> + /// The default is Optuna's path: a sampler built without the opt-in produces the same trials as one built with + /// <c>reuseToldOptimizer: false</c>, and restores once per tell (the default-path contract above). + /// </summary> + [TestMethod] + public void ReuseToldOptimizer_IsOffByDefault() + { + var byDefault = new CmaEsSampler(seed: 21, popsize: 6); + var first = Optuna.CreateStudy(sampler: byDefault); + first.Optimize(Sphere(4, 0.4), nTrials: 120); + var second = Optuna.CreateStudy(sampler: new CmaEsSampler(seed: 21, popsize: 6, reuseToldOptimizer: false)); + second.Optimize(Sphere(4, 0.4), nTrials: 120); + + second.Trials.Select(t => (t.Params["x0"], t.Params["x3"], t.Value)) + .Should().Equal(first.Trials.Select(t => (t.Params["x0"], t.Params["x3"], t.Value))); + int tellers = first.Trials.Count(HoldsState); + byDefault.RestoreCount.Should().Be(HoldsState(first.Trials[^1]) ? tellers - 1 : tellers); + } + + /// <summary> + /// OptunaSharp 1.0.0's 14-parameter constructor still exists with its exact metadata signature, so an assembly + /// compiled against 1.0.0 binds to it at run time instead of failing with <see cref="MissingMethodException" />, + /// and it is Optuna's path: invoked as such a compiled call invokes it (by that signature, every argument + /// explicit, 1.0.0's defaults included), it produces the same trials as <c>reuseToldOptimizer: false</c>. + /// </summary> + [TestMethod] + public void TheVersion1_0_0Constructor_StillBinds_AndIsOptunasPath() + { + // The parameter types of 1.0.0's public constructor, in order: what a 1.0.0-compiled call site names. + Type[] signature = + [ + typeof(IReadOnlyDictionary<string, object?>), typeof(double?), typeof(int), typeof(BaseSampler), + typeof(bool), typeof(int?), typeof(bool), typeof(string), typeof(int?), typeof(int), typeof(bool), + typeof(bool), typeof(bool), typeof(List<FrozenTrial>), + ]; + var constructor = typeof(CmaEsSampler).GetConstructor(signature); + constructor.Should().NotBeNull("assemblies compiled against OptunaSharp 1.0.0 call this exact signature"); + + // A compiled call passes every argument, the defaults it left out included (x0, sigma0, nStartupTrials 1, ...). + var legacy = (CmaEsSampler)constructor!.Invoke( + [null, null, 1, null, true, 21, false, null, 6, -1, false, false, false, null]); + var first = Optuna.CreateStudy(sampler: legacy); + first.Optimize(Sphere(4, 0.4), nTrials: 120); + var second = Optuna.CreateStudy(sampler: new CmaEsSampler(seed: 21, popsize: 6, reuseToldOptimizer: false)); + second.Optimize(Sphere(4, 0.4), nTrials: 120); + + second.Trials.Select(t => (t.Params["x0"], t.Params["x3"], t.Value)) + .Should().Equal(first.Trials.Select(t => (t.Params["x0"], t.Params["x3"], t.Value))); + } + + /// <summary> + /// With the opt-in, the told optimizer keeps answering, so a sequential run restores a stored state only once: + /// after the first tell, whose optimizer was fresh rather than restored and so is not kept. + /// </summary> + [TestMethod] + public void ReuseToldOptimizer_RestoresOnlyOnce_InASequentialRun() + { + var sampler = new CmaEsSampler(seed: 3, popsize: 8, reuseToldOptimizer: true); + var study = Optuna.CreateStudy(sampler: sampler); + study.Optimize(Sphere(5, 0.7), nTrials: 200); + + study.Trials.Count(HoldsState).Should().BeGreaterThan(20, "the state is still stored every generation"); + sampler.RestoreCount.Should().Be(1); + } + + /// <summary> + /// With the opt-in, a failed teller never becomes the latest state holder, so its told object (cached under its + /// id) never answers: the next ask restores the previous holder's stored state, once per failed teller. + /// </summary> + /// <exception cref="InvalidOperationException"> + /// Thrown by the objective on purpose for every other trial that told a generation, and caught by + /// <c>Optimize</c>, so it never leaves the test. + /// </exception> + [TestMethod] + public void ReuseToldOptimizer_AFailedTeller_TheNextAskRestoresThePreviousState() + { + var sampler = new CmaEsSampler(seed: 5, popsize: 6, reuseToldOptimizer: true); + var study = Optuna.CreateStudy(sampler: sampler); + var sphere = Sphere(4, -1.2); + int tellersSeen = 0; + study.Optimize(t => + { + double v = sphere(t); + bool told = study.Storage.GetTrialSystemAttrs(t.TrialId).ContainsKey("cma:optimizer:0"); + if (told && tellersSeen++ % 2 == 0) + throw new InvalidOperationException("planned failure"); + return v; + }, nTrials: 300, @catch: new[] { typeof(InvalidOperationException) }); + + // One restore after the first completed tell (its optimizer was fresh, so it was not kept), then one after each + // later failed teller. + var trials = study.Trials; + int expected = 0; + bool holderExists = false; + for (int i = 0; i + 1 < trials.Count; i++) + { + if (!HoldsState(trials[i])) + continue; + if (trials[i].State == TrialState.Complete && !holderExists) + { + holderExists = true; + expected++; + } + else if (trials[i].State == TrialState.Fail && holderExists) + { + expected++; + } + } + expected.Should().BeGreaterThan(2, "the scenario must exercise failed tellers after the first holder"); + sampler.RestoreCount.Should().Be(expected); + } + + /// <summary> + /// With the opt-in, every generation still stores Optuna's state, so a default sampler (or a Python worker) + /// resumes the study from storage: the resumed trials continue the generations where the reusing sampler left + /// them. + /// </summary> + [TestMethod] + public void ReuseToldOptimizer_StoresOptunasState_SoADefaultSamplerResumesTheStudy() + { + var storage = new InMemoryStorage(); + var first = Optuna.CreateStudy(storage: storage, studyName: "resume", + sampler: new CmaEsSampler(seed: 8, popsize: 6, reuseToldOptimizer: true)); + first.Optimize(Sphere(3, 1.5), nTrials: 90); + long lastGeneration = first.Trials.Where(t => t.SystemAttrs.ContainsKey("cma:generation")) + .Max(t => Convert.ToInt64(t.SystemAttrs["cma:generation"])); + + var resumed = Optuna.LoadStudy("resume", storage, sampler: new CmaEsSampler(seed: 9, popsize: 6)); + resumed.Optimize(Sphere(3, 1.5), nTrials: 60); + + var added = resumed.Trials.Skip(90).ToList(); + added.Should().OnlyContain(t => t.State == TrialState.Complete && t.SystemAttrs.ContainsKey("cma:generation")); + Convert.ToInt64(added[0].SystemAttrs["cma:generation"]).Should().BeGreaterThanOrEqualTo(lastGeneration, + "the resumed sampler restores the stored state instead of starting over"); + added.Max(t => Convert.ToInt64(t.SystemAttrs["cma:generation"])).Should().BeGreaterThan(lastGeneration); + } + + /// <summary> + /// The opt-in changes the run but not its quality: on a 10-D sphere both paths reach the optimum to within 1e-6 + /// for every seed. (Measured on 40-D, 10 seeds: best-value ratio median 0.79, range 0.51-1.48.) + /// </summary> + /// <param name="seed">Sampler seed.</param> + [TestMethod] + [DataRow(1)] + [DataRow(2)] + [DataRow(3)] + public void ReuseToldOptimizer_ConvergesLikeTheDefault(int seed) + { + foreach (bool reuse in new[] { false, true }) + { + var study = Optuna.CreateStudy(sampler: new CmaEsSampler(seed: seed, reuseToldOptimizer: reuse)); + study.Optimize(Sphere(10, 0.25), nTrials: 1500); + study.BestValue.Should().BeLessThan(1e-6, $"reuseToldOptimizer: {reuse}, seed {seed}"); + } + } + + /// <summary> + /// Per-worker samplers (each with its own history and cache) and a shared sampler under eight workers both + /// finish a study and keep telling generations: the cache adds no state that crosses workers. + /// </summary> + /// <param name="concurrency">Shared (one sampler behind its lock) or per-worker instances.</param> + [TestMethod] + [DataRow(SamplerConcurrency.Shared)] + [DataRow(SamplerConcurrency.PerWorker)] + public void ParallelWorkers_CompleteAndKeepTellingGenerations(SamplerConcurrency concurrency) + { + var study = Optuna.CreateStudy(sampler: new CmaEsSampler(seed: 7, popsize: 8)); + study.Optimize(Sphere(6, 0.3), nTrials: 400, nJobs: 8, + executorOptions: new TrialExecutorOptions { SamplerConcurrency = concurrency }); + + study.Trials.Should().HaveCount(400); + study.Trials.Should().OnlyContain(t => t.State == TrialState.Complete); + study.Trials.Count(HoldsState).Should().BeGreaterThan(30, "generations keep being told under concurrency"); + } +} diff --git a/test/OptunaSharp.Tests/Samplers/CmaPickleOracleTests.cs b/test/OptunaSharp.Tests/Samplers/CmaPickleOracleTests.cs index 843d0ed..5cd4050 100644 --- a/test/OptunaSharp.Tests/Samplers/CmaPickleOracleTests.cs +++ b/test/OptunaSharp.Tests/Samplers/CmaPickleOracleTests.cs @@ -331,9 +331,17 @@ private static byte[] CodecCase(string name) /// </list> /// The same pinning rule as <c>AgeMoea2OperatorParityTests</c> and the NES digest tests. Cross-language /// storage of the state is checked live by the interop suite on every host where it is bit-exact. + /// <para> + /// The oracle was captured on OpenBLAS's Haswell kernels, so x64 alone is not enough: CI pins + /// <c>OPENBLAS_CORETYPE=Haswell</c> except on Windows on AMD CPUs with AVX-512, where OpenBLAS 0.3.34's forced + /// Haswell kernels fault (<c>.github/scripts/openblas_coretype.sh</c>), and with OpenBLAS's own kernels + /// there (Zen 4/5, 2026-11-14) <c>cma</c>, <c>cma_lr_adapt</c> and <c>cma_30d</c> stored states a last bit + /// away. Every variant is skipped on other kernels, the separable ones included: the states hold whatever + /// BLAS product the run made. + /// </para> /// </remarks> /// <param name="variant">The oracle variant about to run.</param> - /// <exception cref="AssertInconclusiveException">The host cannot reproduce this variant's oracle bit for bit.</exception> + /// <exception cref="AssertInconclusiveException">The host cannot reproduce this variant's oracle bit for bit: not x64, not Windows for <c>cma_30d</c>, or OpenBLAS not on its Haswell kernels.</exception> private static void RequireOracleHost(string variant) { if (System.Runtime.InteropServices.RuntimeInformation.ProcessArchitecture != System.Runtime.InteropServices.Architecture.X64) @@ -342,6 +350,12 @@ private static void RequireOracleHost(string variant) if (variant == "cma_30d" && !OperatingSystem.IsWindows()) Assert.Inconclusive( "The 30-dimensional CMA-ES state oracle was captured on Windows x64; Linux's libm/OpenBLAS differ in its last bits."); + // openblas_get_corename(); null only without a loaded OpenBLAS, which OptunaSharp's module initializer rules out. + if (NumSharp.Interop.OpenBLAS.OpenBlasEngine.CoreName is not "Haswell") + Assert.Inconclusive( + "The CMA-ES state oracle was captured on OpenBLAS's Haswell kernels; this process runs " + + $"'{NumSharp.Interop.OpenBLAS.OpenBlasEngine.CoreName}' (OPENBLAS_CORETYPE=" + + $"{Environment.GetEnvironmentVariable("OPENBLAS_CORETYPE") ?? "unset"}), whose last bits differ."); } /// <summary> diff --git a/test/OptunaSharp.Tests/Samplers/CmaTrialHistoryTests.cs b/test/OptunaSharp.Tests/Samplers/CmaTrialHistoryTests.cs new file mode 100644 index 0000000..6f2c11c --- /dev/null +++ b/test/OptunaSharp.Tests/Samplers/CmaTrialHistoryTests.cs @@ -0,0 +1,289 @@ +using System; +using System.Collections.Generic; +using System.Linq; +using AwesomeAssertions; +using OptunaSharp.Collections; +using OptunaSharp.Distributions; +using OptunaSharp.Samplers.CmaEs; +using OptunaSharp.Storages; + +namespace OptunaSharp.Tests.Samplers; + +/// <summary> +/// <see cref="CmaTrialHistory" />, the incremental history <c>CmaEsSampler</c> reads on every ask (Rustuna plan 13, +/// item S2). Every assertion compares it with a naive re-implementation of Optuna's per-ask scans +/// (<c>_get_trials</c>, <c>_restore_optimizer</c>'s backward scan, <c>_get_solution_trials</c>) over the same +/// history, so "same trials, same order" is checked at every step of randomly evolving studies: trials created, +/// finished out of order, failed, pruned with and without intermediate values, stuck running. +/// </summary> +[TestClass] +public class CmaTrialHistoryTests +{ + private const string GenerationKey = "cma:generation"; + private const string OptimizerPrefix = "cma:optimizer"; + + /// <summary>The sampler's completed-trial filter, as <c>CmaEsSampler.AsSamplerTrial</c> applies it.</summary> + /// <param name="considerPruned">Whether pruned trials with reported values count.</param> + /// <returns>The filter: the trial, a value-rewritten copy of a pruned trial, or null.</returns> + private static Func<FrozenTrial, FrozenTrial?> Filter(bool considerPruned) => t => + { + if (t.State == TrialState.Complete) + return t; + if (t.State == TrialState.Pruned && t.IntermediateValues.Count > 0 && considerPruned) + { + var copy = t.DeepCopy(); + copy.Value = t.IntermediateValues[t.IntermediateValues.Keys.Max()]; + return copy; + } + return null; + }; + + /// <summary>A trial snapshot with the given state, optional generation stamp and optional optimizer state.</summary> + /// <param name="number">Trial number (also its position).</param> + /// <param name="trialId">Storage id.</param> + /// <param name="state">Trial state.</param> + /// <param name="generation">Generation stamp, or null for none.</param> + /// <param name="holdsState">Whether to add an optimizer-state chunk.</param> + /// <param name="intermediate">Intermediate values (for pruned trials), or null.</param> + /// <returns>A new snapshot.</returns> + private static FrozenTrial Make(int number, int trialId, TrialState state, long? generation, bool holdsState, + OrderedDict<long, double>? intermediate = null) + { + var systemAttrs = new OrderedDict<string, object?>(); + if (generation is not null) + systemAttrs[GenerationKey] = generation.Value; + if (holdsState) + systemAttrs[OptimizerPrefix + ":0"] = $"state-of-{number}"; + double? value = state == TrialState.Complete ? number * 0.5 : null; + return new FrozenTrial(number, state, value, DateTime.Now, state.IsFinished() ? DateTime.Now : null, + new OrderedDict<string, object?> { ["x"] = (double)number }, + new OrderedDict<string, BaseDistribution> { ["x"] = new FloatDistribution(-1000, 1000) }, + new OrderedDict<string, object?>(), systemAttrs, + intermediate ?? new OrderedDict<long, double>(), trialId); + } + + /// <summary>The naive scans, from scratch, over the current history.</summary> + /// <param name="history">The history.</param> + /// <param name="filter">The completed-trial filter.</param> + /// <returns>The completed trials in order.</returns> + private static List<FrozenTrial> NaiveCompleted(IReadOnlyList<FrozenTrial> history, Func<FrozenTrial, FrozenTrial?> filter) + => history.Select(filter).Where(t => t is not null).Select(t => t!).ToList(); + + /// <summary>Asserts the history's three outputs equal the naive scans' (ids, values and order).</summary> + /// <param name="history">The incremental history after a refresh.</param> + /// <param name="list">The history list it was refreshed with.</param> + /// <param name="filter">The completed-trial filter.</param> + /// <param name="step">Step number, for the failure message.</param> + private static void AssertMatchesNaive(CmaTrialHistory history, IReadOnlyList<FrozenTrial> list, + Func<FrozenTrial, FrozenTrial?> filter, int step) + { + var completed = NaiveCompleted(list, filter); + history.CompletedCount.Should().Be(completed.Count, $"step {step}: the completed count"); + + FrozenTrial? naiveHolder = completed.LastOrDefault(t => t.SystemAttrs.Keys.Any(k => k.StartsWith(OptimizerPrefix, StringComparison.Ordinal))); + (history.LatestStateHolder?.TrialId).Should().Be(naiveHolder?.TrialId, $"step {step}: the latest state holder"); + + var generations = completed.Select(t => t.SystemAttrs.TryGetValue(GenerationKey, out var g) ? Convert.ToInt64(g) : -1) + .Distinct().ToList(); + generations.Add(999); // a generation nobody has + foreach (long g in generations) + { + if (g < int.MinValue || g > int.MaxValue) + continue; + var naive = completed.Where(t => (t.SystemAttrs.TryGetValue(GenerationKey, out var s) ? Convert.ToInt64(s) : -1) == g).ToList(); + var actual = history.SolutionTrials((int)g); + actual.Select(t => (t.TrialId, t.Value)).Should().Equal(naive.Select(t => (t.TrialId, t.Value)), + $"step {step}: generation {g}'s trials, in trial order, with pruned values rewritten"); + } + } + + /// <summary> + /// 600 random steps of a study: new trials, attributes written while running, trials finished out of order as + /// complete, failed or pruned. After each step the incremental history must equal the naive scans exactly. + /// </summary> + /// <param name="seed">Seed of the step generator.</param> + /// <param name="considerPruned">Whether pruned trials with reported values count, as with <c>considerPrunedTrials</c>.</param> + [TestMethod] + [DataRow(1, false)] + [DataRow(2, true)] + [DataRow(3, false)] + [DataRow(4, true)] + [DataRow(5, true)] + public void RandomlyEvolvingStudies_MatchOptunasPerAskScans_AtEveryStep(int seed, bool considerPruned) + { + var rng = new Random(seed); + var filter = Filter(considerPruned); + var history = new CmaTrialHistory(filter, GenerationKey, OptimizerPrefix); + var storage = new InMemoryStorage(); + var list = new List<FrozenTrial>(); + var unfinished = new List<int>(); + + for (int step = 0; step < 600; step++) + { + double roll = rng.NextDouble(); + if (roll < 0.45 || unfinished.Count == 0) + { + // A new trial: running (or occasionally waiting, as an enqueued trial). + int number = list.Count; + var state = rng.NextDouble() < 0.1 ? TrialState.Waiting : TrialState.Running; + list.Add(Make(number, 1000 + number, state, generation: rng.Next(0, 4), holdsState: false)); + unfinished.Add(number); + } + else if (roll < 0.55) + { + // A running trial gains attributes while running (in the tail, so re-read each refresh). + int number = unfinished[rng.Next(unfinished.Count)]; + list[number] = Make(number, 1000 + number, list[number].State, generation: rng.Next(0, 4), holdsState: rng.NextDouble() < 0.3); + } + else + { + // Finish an unfinished trial, not necessarily the oldest: out-of-order completion. + int index = rng.Next(unfinished.Count); + int number = unfinished[index]; + unfinished.RemoveAt(index); + double kind = rng.NextDouble(); + var state = kind < 0.6 ? TrialState.Complete : kind < 0.8 ? TrialState.Fail : TrialState.Pruned; + OrderedDict<long, double>? intermediate = null; + if (state == TrialState.Pruned && rng.NextDouble() < 0.7) + intermediate = new OrderedDict<long, double> { [1] = rng.NextDouble(), [rng.Next(2, 9)] = rng.NextDouble() }; + // Copy-on-write, as the storage does: a new snapshot replaces the old one. + list[number] = Make(number, 1000 + number, state, generation: rng.Next(0, 4), holdsState: rng.NextDouble() < 0.25, intermediate); + } + + history.Refresh(list, storage, studyId: 0); + AssertMatchesNaive(history, list, filter, step); + } + } + + /// <summary> + /// A trial left running by a dead worker stops the fold: everything after it stays in the per-refresh tail, with + /// correct results; once it is failed (as <c>fail_stale_trials</c> does), the fold takes everything. + /// </summary> + [TestMethod] + public void AStuckRunningTrial_KeepsLaterTrialsInTheTail_AndFoldsThemOnceItFinishes() + { + var filter = Filter(considerPruned: false); + var history = new CmaTrialHistory(filter, GenerationKey, OptimizerPrefix); + var storage = new InMemoryStorage(); + var list = new List<FrozenTrial> { Make(0, 0, TrialState.Running, generation: 0, holdsState: false) }; + for (int n = 1; n <= 40; n++) + list.Add(Make(n, n, TrialState.Complete, generation: n / 10, holdsState: n % 10 == 0)); + + history.Refresh(list, storage, 0); + AssertMatchesNaive(history, list, filter, step: 0); + + // The dead worker's trial is failed (as fail_stale_trials does); the fold then takes everything. + list[0] = Make(0, 0, TrialState.Fail, generation: 0, holdsState: false); + history.Refresh(list, storage, 0); + AssertMatchesNaive(history, list, filter, step: 1); + history.WasReset.Should().BeFalse(); + } + + /// <summary> + /// With <c>considerPrunedTrials</c>, a pruned trial's value-rewritten copy is made once, when the trial is folded, + /// and the same copy is returned afterwards; Optuna made a new one on every ask. + /// </summary> + [TestMethod] + public void APrunedTrialsCopy_IsMadeOnceWhenFolded_AndReusedByLaterRefreshes() + { + int copies = 0; + Func<FrozenTrial, FrozenTrial?> counting = t => + { + if (t.State == TrialState.Pruned) + copies++; + return Filter(considerPruned: true)(t); + }; + var history = new CmaTrialHistory(counting, GenerationKey, OptimizerPrefix); + var storage = new InMemoryStorage(); + var list = new List<FrozenTrial> + { + Make(0, 0, TrialState.Pruned, generation: 2, holdsState: false, new OrderedDict<long, double> { [3] = 7.5, [9] = 1.25 }), + }; + + history.Refresh(list, storage, 0); + var first = history.SolutionTrials(2).Single(); + first.Value.Should().Be(1.25, "the value at the largest step, as Optuna rewrites it"); + for (int i = 0; i < 5; i++) + history.Refresh(list, storage, 0); + + copies.Should().Be(1, "a folded trial is classified once"); + history.SolutionTrials(2).Single().Should().BeSameAs(first); + } + + /// <summary> + /// The fold starts over, and says so, whenever the history it describes is gone: first use, another storage + /// object, another study id, other trials at the folded positions, or a history shorter than the fold. The + /// sampler drops its optimizer cache on that signal, because trial ids from another storage can repeat. + /// </summary> + [TestMethod] + public void WasReset_IsTrueOnTheFirstRefresh_AnotherStorageOrStudy_OrAnotherHistory() + { + var filter = Filter(considerPruned: false); + var history = new CmaTrialHistory(filter, GenerationKey, OptimizerPrefix); + var storageA = new InMemoryStorage(); + var list = Enumerable.Range(0, 5).Select(n => Make(n, n, TrialState.Complete, 0, n == 4)).ToList(); + + history.Refresh(list, storageA, 0); + history.WasReset.Should().BeTrue("the first refresh folds from scratch"); + history.Refresh(list, storageA, 0); + history.WasReset.Should().BeFalse("the same history continues"); + + history.Refresh(list, new InMemoryStorage(), 0); + history.WasReset.Should().BeTrue("trial ids of another storage mean nothing here"); + history.Refresh(list, storageA, 0); + history.WasReset.Should().BeTrue("back to the first storage: the fold was replaced, so it starts over"); + history.Refresh(list, storageA, 7); + history.WasReset.Should().BeTrue("another study"); + + // Same storage and study id, but the folded positions now hold other trials (a new study under the id). + var other = Enumerable.Range(0, 5).Select(n => Make(n, 500 + n, TrialState.Complete, 1, false)).ToList(); + history.Refresh(other, storageA, 7); + history.WasReset.Should().BeTrue("the last folded trial's id changed"); + AssertMatchesNaive(history, other, filter, step: 0); + + // A shorter history than the fold (the study was replaced by a smaller one) also starts over. + history.Refresh(other.Take(2).ToList(), storageA, 7); + history.WasReset.Should().BeTrue(); + AssertMatchesNaive(history, other.Take(2).ToList(), filter, step: 1); + } + + /// <summary> + /// A state holder that finished after a still-running trial sits in the tail, and is the latest holder: Optuna's + /// backward scan over the completed trials finds it first. + /// </summary> + [TestMethod] + public void AHolderInTheTail_IsLaterThanEveryFoldedHolder() + { + var filter = Filter(considerPruned: false); + var history = new CmaTrialHistory(filter, GenerationKey, OptimizerPrefix); + var storage = new InMemoryStorage(); + var list = new List<FrozenTrial> + { + Make(0, 0, TrialState.Complete, 0, holdsState: true), + Make(1, 1, TrialState.Running, 1, holdsState: false), + Make(2, 2, TrialState.Complete, 1, holdsState: true), + }; + + history.Refresh(list, storage, 0); + history.LatestStateHolder!.TrialId.Should().Be(2, "trial 2 finished after the stuck trial 1 and holds a state"); + + list[2] = Make(2, 2, TrialState.Complete, 1, holdsState: true); + list[1] = Make(1, 1, TrialState.Complete, 1, holdsState: false); + history.Refresh(list, storage, 0); + history.LatestStateHolder!.TrialId.Should().Be(2); + AssertMatchesNaive(history, list, filter, step: 1); + } + + /// <summary>The constructor and <see cref="CmaTrialHistory.Refresh" /> reject null arguments up front.</summary> + [TestMethod] + public void NullArguments_AreRejected() + { + Action noFilter = () => _ = new CmaTrialHistory(null!, GenerationKey, OptimizerPrefix); + noFilter.Should().Throw<ArgumentNullException>(); + var history = new CmaTrialHistory(Filter(false), GenerationKey, OptimizerPrefix); + Action noHistory = () => history.Refresh(null!, new InMemoryStorage(), 0); + noHistory.Should().Throw<ArgumentNullException>(); + Action noStorage = () => history.Refresh(new List<FrozenTrial>(), null!, 0); + noStorage.Should().Throw<ArgumentNullException>(); + } +} diff --git a/test/OptunaSharp.Tests/Samplers/EvolutionStrategyExtraCandidateTests.cs b/test/OptunaSharp.Tests/Samplers/EvolutionStrategyExtraCandidateTests.cs index b3df0bb..a4a9358 100644 --- a/test/OptunaSharp.Tests/Samplers/EvolutionStrategyExtraCandidateTests.cs +++ b/test/OptunaSharp.Tests/Samplers/EvolutionStrategyExtraCandidateTests.cs @@ -113,6 +113,12 @@ public void Tell_AcceptsAGenerationThatIncludesExtraCandidates(string name) /// Pinned to Windows x64, where the digests were recorded. The samplers' updates call <c>Math.Exp</c> and /// <c>Math.Log</c>, which .NET takes from the platform's C library, and xNES decomposes through OpenBLAS; both /// can differ in the last bit on another OS or CPU, so elsewhere the case is inconclusive rather than red. + /// <para> + /// The xNES digest also needs OpenBLAS's Haswell kernels, the ones it was recorded on. CI pins them except on + /// Windows on AMD CPUs with AVX-512, where OpenBLAS 0.3.34's forced Haswell kernels fault + /// (<c>.github/scripts/openblas_coretype.sh</c>), and OpenBLAS's own kernels there (Zen 4/5, 2026-11-14) + /// changed the xNES digest; the OpenAI-ES and SNES digests, which never reach OpenBLAS, held. + /// </para> /// </remarks> [TestMethod] [DataRow("openaies", "015121A1E1D3C3FE7999286C8E9672EC4FEF4F89CC34029129D10412DF004B82")] @@ -122,6 +128,12 @@ public void SeededSequentialStudy_KeepsItsTrajectory(string name, string expecte { if (!OperatingSystem.IsWindows() || RuntimeInformation.ProcessArchitecture != Architecture.X64) Assert.Inconclusive("The recorded digests are for Windows x64; libm and OpenBLAS may differ in the last bit elsewhere."); + // Only xNES decomposes through OpenBLAS; openblas_get_corename() names the kernels this process runs. + if (name == "xnes" && NumSharp.Interop.OpenBLAS.OpenBlasEngine.CoreName is not "Haswell") + Assert.Inconclusive( + "The xNES digest was recorded on OpenBLAS's Haswell kernels; this process runs " + + $"'{NumSharp.Interop.OpenBLAS.OpenBlasEngine.CoreName}' (OPENBLAS_CORETYPE=" + + $"{Environment.GetEnvironmentVariable("OPENBLAS_CORETYPE") ?? "unset"}), whose last bits differ."); BaseSampler sampler = name switch { diff --git a/test/OptunaSharp.Tests/Samplers/JanusMooCmixSamplerTests.cs b/test/OptunaSharp.Tests/Samplers/JanusMooCmixSamplerTests.cs index 72678ac..2836b6c 100644 --- a/test/OptunaSharp.Tests/Samplers/JanusMooCmixSamplerTests.cs +++ b/test/OptunaSharp.Tests/Samplers/JanusMooCmixSamplerTests.cs @@ -172,7 +172,7 @@ double Run() /// <summary> /// ZDT1 over four parameters that stores its residual vector <c>[f1, f2]</c> under /// <paramref name="residualKey" />. The canonical key goes through the typed writer users are told to - /// call, any other key through <see cref="BaseTrial.SetUserAttr" />, and <c>null</c> stores nothing. + /// call, any other key through <see cref="BaseTrial.SetUserAttr(string, object?)" />, and <c>null</c> stores nothing. /// </summary> /// <param name="t">The trial being evaluated.</param> /// <param name="residualKey">User-attribute key for the residual vector, or null to store none.</param> diff --git a/test/OptunaSharp.Tests/Samplers/RandomEmbeddingSamplerTests.cs b/test/OptunaSharp.Tests/Samplers/RandomEmbeddingSamplerTests.cs index b053725..1fde1e5 100644 --- a/test/OptunaSharp.Tests/Samplers/RandomEmbeddingSamplerTests.cs +++ b/test/OptunaSharp.Tests/Samplers/RandomEmbeddingSamplerTests.cs @@ -1,4 +1,5 @@ using System; +using System.Globalization; using System.Linq; using AwesomeAssertions; using NumSharp; @@ -246,4 +247,67 @@ public void Constructor_RejectsInvalidDimensions() badDim.Should().Throw<ArgumentException>("the embedding dimension must be at least 1"); badK.Should().Throw<ArgumentException>("the number of embeddings must be at least 1"); } + + /// <summary> + /// One worker and a deterministic objective: REMBO must not evaluate a point twice, since the value is already + /// known and a repeat is a lost trial. Its paper-faithful optimizer does repeat, by two routes. With seed 95 on the + /// 16-worker test's objective it evaluates the parameter box's corner (10, 10, 0) at #7, #18 and #34 and the + /// corner (−10, −10, 1) at #19 and #45, each time from another latent point, and it proposes trial #35's latent + /// point again at #36 and #37, #40's at #41 to #44, and #46's at #47. + /// </summary> + /// <remarks> + /// <para> + /// <b>How often.</b> Over seeds 1 to 120 (60 trials each, measured 2026-11-14 on .NET 10), 82 runs evaluated a + /// point twice. Counting exact latent repeats only, 67 runs repeated 149 latent points, often over several + /// trials in a row: 138 of them at values of 2 or less (the objective's minimum is 0), near the best point + /// found, and 11 from 2.05 up, among them three corners of the latent box in seed 48 (values 67 and 122), the + /// kind of point the 16-worker failures repeated. Seed 1 repeats nothing with one worker; 16 workers reach + /// the same states through their interleavings + /// (<c>SamplerParallelReadTests.Optimize_SixteenWorkers_Rembo_EvaluatesNoPointTwice</c>, the row that + /// failed in CI). + /// </para> + /// <para> + /// <b>Route 1, clipping.</b> The projection <c>x = p_X(A·y)</c> clips onto the parameter box, so a whole region + /// of the latent box lands on one corner or edge of it. The low-dimensional kernel (the default) measures + /// distances between latent points, sees those points as far apart, and keeps proposing them: the waste + /// Wang et al. (2016, §3.2) name as the low-dimensional kernel's weakness, which their high-dimensional + /// kernel avoids by measuring distances in the parameter box. + /// </para> + /// <para> + /// <b>Route 2, the incumbent.</b> In seed 95 the GP interpolates: the Cholesky never needs more than its first + /// nugget (1e-6), and the posterior standard deviation at an evaluated point is 2e-4 to 5e-4 of the profiled + /// amplitude from trial 29 on. Expected improvement at the incumbent is therefore small but not zero (the mean + /// equals the incumbent, so it is that standard deviation times φ(0)), and once the GP is confident across + /// the box, DIRECT and CMA-ES find nothing larger and hand back the incumbent's own coordinates. + /// </para> + /// <para> + /// A fix keeps the acquisition's maximizer off points already evaluated or running, compared where the + /// objective sees them (the projected parameters), for example by taking the best candidate that lies farther + /// than a small distance from all of them. Then remove <c>[OpenBugs]</c> here and in the 16-worker test. + /// REMBO reproduces on one platform, not bit for bit across platforms (its Cholesky runs on OpenBLAS), so + /// another platform may repeat at other trials; the assertion holds on any platform once fixed. + /// </para> + /// </remarks> + /// <exception cref="AssertFailedException">A point was evaluated more than once (today, the repeats listed above).</exception> + [TestMethod] + [OpenBugs] + public void Optimize_OneWorker_EvaluatesNoPointTwice() + { + var study = Optuna.CreateStudy(sampler: new RandomEmbeddingSampler(2, seed: 95)); + study.Optimize(t => + { + double x = t.SuggestFloat("x", -10, 10), y = t.SuggestFloat("y", -10, 10), z = t.SuggestFloat("z", 0, 1); + return (x - 2) * (x - 2) + (y + 1) * (y + 1) + z; + }, nTrials: 60); + + // Points are compared by their exact coordinates, as the 16-worker test compares them: a repeat is + // bit-identical, because DIRECT and CMA-ES hand back the evaluated point itself. + string[] repeated = study.Trials + .GroupBy(t => string.Join("|", t.Params.OrderBy(p => p.Key, StringComparer.Ordinal) + .Select(p => p.Key + "=" + Convert.ToString(p.Value, CultureInfo.InvariantCulture))), StringComparer.Ordinal) + .Where(g => g.Count() > 1) + .Select(g => $"{g.Key} at #{string.Join(",#", g.Select(t => t.Number))}") + .ToArray(); + repeated.Should().BeEmpty("a deterministic objective gains nothing from evaluating a point again"); + } } diff --git a/test/OptunaSharp.Tests/Samplers/RandomSamplerTests.cs b/test/OptunaSharp.Tests/Samplers/RandomSamplerTests.cs index b7166a3..a945f55 100644 --- a/test/OptunaSharp.Tests/Samplers/RandomSamplerTests.cs +++ b/test/OptunaSharp.Tests/Samplers/RandomSamplerTests.cs @@ -130,4 +130,63 @@ public void IntersectionSearchSpace_Rejects_Second_Study() act.Should().Throw<NumSharp.ValueError>() .WithMessage("`IntersectionSearchSpace` cannot handle multiple studies."); } + + /// <summary> + /// Plan 14: <see cref="RandomSampler.SampleIndependent" /> now draws the transform's bound rows one at a time instead + /// of NumPy's array form <c>rng.uniform(trans.bounds[:, 0], trans.bounds[:, 1])</c>. This replays the array form it + /// replaced, on a generator seeded alike, for every distribution kind (one-hot categoricals with two and five choices + /// of mixed types included) and asserts every suggested value is identical, so the generator also stays in step from + /// one suggestion to the next across a whole study. + /// </summary> + /// <param name="seed">The sampler's seed, and the replay's.</param> + [TestMethod] + [DataRow(0)] + [DataRow(123)] + [DataRow(20260830)] + public void SampleIndependent_RowByRow_Equals_TheArrayDrawItReplaced(int seed) + { + var distributions = new (string Name, BaseDistribution Distribution)[] + { + ("f", new FloatDistribution(-10, 10)), + ("fl", new FloatDistribution(1e-5, 1e-1, log: true)), + ("fs", new FloatDistribution(0.1, 0.9, step: 0.2)), + ("i", new IntDistribution(1, 100)), + ("il", new IntDistribution(1, 128, log: true)), + ("is", new IntDistribution(0, 20, step: 5)), + ("c2", new CategoricalDistribution(new CategoricalChoice[] { true, false })), + ("c5", new CategoricalDistribution(new CategoricalChoice[] { "a", 1L, 2.5, CategoricalChoice.None, "e" })), + ("wide", new FloatDistribution(-1e300, 1e300)), + }; + var study = Optuna.CreateStudy(sampler: new RandomSampler(seed)); + study.Optimize(t => + { + foreach (var (name, distribution) in distributions) + t.Suggest(name, distribution); + return 0.0; + }, nTrials: 60); + + var replay = new LazyRandomState(seed); + foreach (var trial in study.Trials) + { + foreach (var (name, distribution) in distributions) + { + // The pre-plan-14 body of SampleIndependent, verbatim apart from disposing its arrays. + var trans = new OptunaSharp.Internal.SearchSpaceTransform( + new OrderedDict<string, BaseDistribution> { [name] = distribution }); + using NumSharp.NDArray bounds = trans.Bounds; + using NumSharp.NDArray lows = bounds[":,0"]; + using NumSharp.NDArray highs = bounds[":,1"]; + using NumSharp.NDArray draws = replay.Rng.uniform(lows, highs); + object? expected = trans.Untransform(draws)[name]; + if (expected is CategoricalChoice choice) + expected = choice.Value; + + object? actual = trial.Params[name]; + if (expected is double d) + BitConverter.DoubleToInt64Bits((double)actual!).Should().Be(BitConverter.DoubleToInt64Bits(d), $"trial {trial.Number} {name}"); + else + actual.Should().Be(expected, $"trial {trial.Number} {name}"); + } + } + } } diff --git a/test/OptunaSharp.Tests/Samplers/TpeBinnedSigmasTests.cs b/test/OptunaSharp.Tests/Samplers/TpeBinnedSigmasTests.cs new file mode 100644 index 0000000..73edcb2 --- /dev/null +++ b/test/OptunaSharp.Tests/Samplers/TpeBinnedSigmasTests.cs @@ -0,0 +1,188 @@ +using System; +using System.Collections.Generic; +using AwesomeAssertions; +using OptunaSharp.Internal; +using OptunaSharp.Samplers.Tpe; + +namespace OptunaSharp.Tests.Samplers; + +/// <summary> +/// Plan 14: TPE's kernel widths come from <see cref="ParzenEstimator.BinnedRawSigmas" /> whenever it can prove the result +/// equals Optuna's sort-based <c>compute_sigmas</c> (<see cref="ParzenEstimator.SortedRawSigmas" />). These tests compare +/// the two paths bit for bit, after the shared clip, over many generated center sets: uniform, tied (integer grids, +/// repeated values), clustered, on and next to bin edges, at the domain ends, tiny and huge domains, with and without +/// endpoints; and they check the binned path really runs on ordinary inputs (a fallback-only implementation would pass +/// the equality tests vacuously). +/// </summary> +[TestClass] +public class TpeBinnedSigmasTests +{ + /// <summary>The clip <see cref="ParzenEstimator.ComputeSigmas" /> applies to both paths' unclipped widths.</summary> + /// <param name="raw">Unclipped widths; clipped in place.</param> + /// <param name="minsigma">The magic-clip floor.</param> + /// <param name="maxsigma">The domain width.</param> + /// <returns>The same array, clipped.</returns> + private static double[] Clip(double[] raw, double minsigma, double maxsigma) + { + for (int i = 0; i < raw.Length; i++) + raw[i] = MathUtil.Clip(raw[i], minsigma, maxsigma); + return raw; + } + + /// <summary> + /// Compares both paths for one center set: when the binned path answers, its clipped widths must equal the sort's + /// bit for bit. + /// </summary> + /// <param name="mus">The centers.</param> + /// <param name="low">The domain's lower end.</param> + /// <param name="high">The domain's upper end.</param> + /// <param name="considerEndpoints">Whether the endpoints count as neighbors.</param> + /// <param name="label">Text identifying the case in a failure message.</param> + /// <returns>Whether the binned path answered (false when it fell back).</returns> + private static bool CompareOnce(double[] mus, double low, double high, bool considerEndpoints, string label) + { + int n = mus.Length; + double divisor = Math.Min(100.0, 1.0 + (n + 1)); + double minsigma = (high - low) / divisor; + double maxsigma = high - low; + double[] expected = Clip(ParzenEstimator.SortedRawSigmas(mus, low, high, considerEndpoints), minsigma, maxsigma); + double[]? binned = ParzenEstimator.BinnedRawSigmas(mus, low, high, minsigma, (int)divisor, considerEndpoints); + if (binned is null) + return false; + Clip(binned, minsigma, maxsigma); + for (int i = 0; i < n; i++) + { + if (BitConverter.DoubleToInt64Bits(binned[i]) != BitConverter.DoubleToInt64Bits(expected[i])) + Assert.Fail($"{label}: width {i} of {n} is {binned[i]:R} binned, {expected[i]:R} sorted (center {mus[i]:R})"); + } + return true; + } + + /// <summary>The domains TPE meets: plain floats, log-transformed bounds, step-widened ints, unit cubes, tiny and huge spans.</summary> + /// <returns>(low, high) pairs.</returns> + private static IEnumerable<(double Low, double High)> Domains() => new[] + { + (-10.0, 10.0), (0.0, 1.0), (Math.Log(1e-5), Math.Log(1e-1)), (0.5, 100.5), (-0.5, 20.5), (Math.Log(0.5), Math.Log(128.5)), + (-1e300, 1e300), (1e-300, 3e-300), (123456.789, 123456.791), (-3.0, -2.999999), + }; + + /// <summary> + /// Uniform, tied, clustered, edge and endpoint center sets of many sizes over every domain, both endpoint settings: + /// whenever the binned path answers it equals the sort, and on uniform inputs it answers almost always. + /// </summary> + /// <param name="seed">The generator seed for the center sets.</param> + [TestMethod] + [DataRow(1)] + [DataRow(2)] + [DataRow(3)] + public void BinnedWidths_EqualSortedWidths_BitForBit(int seed) + { + var rng = new Random(seed); + int uniformCases = 0, uniformAnswered = 0, answered = 0, cases = 0; + int[] sizes = { 2, 3, 4, 5, 10, 25, 26, 97, 98, 99, 150, 500, 975, 1500 }; + foreach (var (low, high) in Domains()) + { + foreach (int n in sizes) + { + double divisor = Math.Min(100.0, 1.0 + (n + 1)); + double binWidth = (high - low) / divisor; + for (int kind = 0; kind < 7; kind++) + { + var mus = new double[n]; + for (int i = 0; i < n; i++) + { + double u = rng.NextDouble(); + mus[i] = kind switch + { + // Uniform over the domain. + 0 => low + (high - low) * u, + // A coarse grid: many exact ties, like integer or stepped parameters. + 1 => low + (high - low) * (rng.Next(0, 9) / 8.0), + // Three tight clusters: wide gaps between, tiny gaps within. + 2 => low + (high - low) * (0.1 + 0.4 * rng.Next(0, 3)) + binWidth * 1e-3 * u, + // Exactly on bin edges. + 3 => Math.Min(high, low + binWidth * rng.Next(0, (int)divisor + 1)), + // One ulp either side of a bin edge. + 4 => Math.Clamp(Nudge(low + binWidth * rng.Next(1, (int)divisor), rng), low, high), + // The domain ends, often repeated. + 5 => rng.Next(0, 3) switch { 0 => low, 1 => high, _ => low + (high - low) * u }, + // Two values a bin width apart, repeated: neighbor distances at the floor. + _ => low + binWidth * (rng.Next(0, 2) + 0.5 * (n % 2)), + }; + } + foreach (bool considerEndpoints in new[] { false, true }) + { + cases++; + bool ok = CompareOnce(mus, low, high, considerEndpoints, $"seed {seed} domain [{low:R}, {high:R}] n {n} kind {kind} endpoints {considerEndpoints}"); + if (ok) + answered++; + if (kind == 0) + { + uniformCases++; + if (ok) + uniformAnswered++; + } + } + } + } + } + + // A fallback-only implementation would pass the comparisons above vacuously: the fast path must actually run. + uniformAnswered.Should().BeGreaterThan(uniformCases * 9 / 10, "uniform centers almost never need the sort"); + answered.Should().BeGreaterThan(cases / 2); + } + + /// <summary>Moves a value by one or two ulps up or down.</summary> + /// <param name="value">The value to move.</param> + /// <param name="rng">Chooses the direction and the distance.</param> + /// <returns>The neighboring double.</returns> + private static double Nudge(double value, Random rng) + { + double moved = rng.Next(0, 2) == 0 ? Math.BitDecrement(value) : Math.BitIncrement(value); + return rng.Next(0, 2) == 0 ? moved : (moved > value ? Math.BitIncrement(moved) : Math.BitDecrement(moved)); + } + + /// <summary> + /// The cases the binned path must hand back to the sort: fewer than two centers, a center outside the domain or NaN, + /// a degenerate domain, and a bin whose computed span exceeds the floor. + /// </summary> + [TestMethod] + public void BinnedWidths_FallBack_WhereTheProofDoesNotHold() + { + ParzenEstimator.BinnedRawSigmas(new[] { 0.5 }, 0.0, 1.0, 1.0 / 3.0, 3, false).Should().BeNull("one center"); + ParzenEstimator.BinnedRawSigmas(new[] { 0.5, 1.5 }, 0.0, 1.0, 0.25, 4, false).Should().BeNull("a center above the domain"); + ParzenEstimator.BinnedRawSigmas(new[] { -0.1, 0.5 }, 0.0, 1.0, 0.25, 4, false).Should().BeNull("a center below the domain"); + ParzenEstimator.BinnedRawSigmas(new[] { double.NaN, 0.5 }, 0.0, 1.0, 0.25, 4, false).Should().BeNull("NaN"); + ParzenEstimator.BinnedRawSigmas(new[] { 1.0, 1.0 }, 1.0, 1.0, 0.0, 4, false).Should().BeNull("an empty domain"); + // A bin can span a little more than its width only through rounding (or, as here, when the bins do not cover the + // domain and the last bin takes the rest); the guard refuses any span over the floor. Bins of width 0.1 but only + // four of them: 0.35 and 0.9 both land in the last bin, 0.55 apart. + ParzenEstimator.BinnedRawSigmas(new[] { 0.0, 0.35, 0.9 }, 0.0, 1.0, 0.1, 4, false).Should().BeNull("a bin spanning more than the floor"); + } + + /// <summary> + /// End to end through <see cref="ParzenEstimator.ComputeSigmas" />: the widths for a 975-center history (the size + /// of a 1,000-trial run's "above" group) equal the sort-based computation, with and without the magic clip (without + /// it the binned path is never used). + /// </summary> + /// <param name="considerMagicClip">Whether the magic clip is on (the only case the bins apply to).</param> + /// <param name="considerEndpoints">Whether the endpoints count as neighbors.</param> + [TestMethod] + [DataRow(true, false)] + [DataRow(true, true)] + [DataRow(false, false)] + public void ComputeSigmas_EqualsTheSortBasedComputation(bool considerMagicClip, bool considerEndpoints) + { + var rng = new Random(975); + var mus = new double[975]; + for (int i = 0; i < mus.Length; i++) + mus[i] = -5.0 + 10.0 * rng.NextDouble(); + var parameters = new ParzenEstimatorParameters(1.0, considerMagicClip, considerEndpoints, _ => Array.Empty<double>(), false); + double[] actual = ParzenEstimator.ComputeSigmas(mus, -5.0, 5.0, mus.Length, parameters); + + double minsigma = considerMagicClip ? 10.0 / Math.Min(100.0, 1.0 + (mus.Length + 1)) : 1e-12; + double[] expected = Clip(ParzenEstimator.SortedRawSigmas(mus, -5.0, 5.0, considerEndpoints), minsigma, 10.0); + for (int i = 0; i < mus.Length; i++) + BitConverter.DoubleToInt64Bits(actual[i]).Should().Be(BitConverter.DoubleToInt64Bits(expected[i]), $"width {i}"); + } +} diff --git a/test/OptunaSharp.Tests/Samplers/TpeDiscreteKernelTests.cs b/test/OptunaSharp.Tests/Samplers/TpeDiscreteKernelTests.cs new file mode 100644 index 0000000..70f0371 --- /dev/null +++ b/test/OptunaSharp.Tests/Samplers/TpeDiscreteKernelTests.cs @@ -0,0 +1,737 @@ +using System; +using System.Collections.Generic; +using System.Linq; +using AwesomeAssertions; +using OptunaSharp.Internal; +using OptunaSharp.Samplers.Tpe; + +namespace OptunaSharp.Tests.Samplers; + +/// <summary> +/// Plan 15 (docs/plans/15-performance-pass-3.md), step B: TPE's log density finds the unique candidate values, kernels +/// and cell bounds of a stepped coordinate by hashing instead of sorting with LINQ, and adds the continuous dimensions +/// with each candidate's sums held in registers and unchecked vector loads. Every bit must stay. Each test compares +/// the new code with the code it replaced, written out here: the discrete branch over the sorted dedups, the sorted +/// dedup itself, and the scalar accumulation the vector path reproduces. +/// </summary> +[TestClass] +public class TpeDiscreteKernelTests +{ + // ------------------------------------------------------------------ the discrete log-pdf + + /// <summary> + /// Mixtures of stepped dimensions (integers, log integers and stepped floats), from one kernel to four hundred, + /// with kernels that share centers and widths (as clipped TPE kernels do) and candidates that repeat, against the + /// replaced branch over sorted dedups: every candidate's log density has the same bits. + /// </summary> + /// <param name="seed">Seeds the random mixtures.</param> + [TestMethod] + [DataRow(1)] + [DataRow(2)] + [DataRow(3)] + public void DiscreteLogPdf_HashedDedups_MatchTheSortedCodeToTheBit(int seed) + { + var rng = new Random(seed); + foreach (int nKernels in new[] { 1, 2, 5, 26, 101, 400 }) + { + foreach (int nDims in new[] { 1, 3 }) + { + var mixture = RandomDiscreteMixture(rng, nKernels, nDims, distinctSigmas: rng.Next(2) == 0); + AssertSameBits(mixture, RandomDiscreteCandidates(rng, mixture, 24)); + } + } + } + + /// <summary> + /// The number of unique central cell bounds picks the <c>erf</c> path (exact below 2,000, Optuna's vectorized + /// approximation from there), so the hashed dedup must find exactly as many as the sorted one. One mixture whose + /// candidate-by-kernel grid has more than 2,000 unique central pairs and one with fewer, both checked to be on + /// their side of the switch with the sorted dedup, against the replaced branch. A cell is central only when a + /// kernel's center lies inside it, so the large case centers its 2,400 kernels on the candidates' values and gives + /// each its own width. + /// </summary> + [TestMethod] + public void DiscreteLogPdf_BothSidesOfTheErfSwitch_MatchTheSortedCodeToTheBit() + { + var rng = new Random(41); + const int nLarge = 2400; + var mu = new double[nLarge]; + var sigma = new double[nLarge]; + var weights = new double[nLarge]; + for (int k = 0; k < nLarge; k++) + { + mu[k] = -48 + 4 * (k % 24); + sigma[k] = 0.5 + rng.NextDouble() * 20; + weights[k] = 1.0 / nLarge; + } + var large = new MixtureOfProductDistribution( + weights, new List<BatchedDistributions> { new BatchedDiscreteTruncNormDistributions(mu, sigma, -50, 50, 1) }); + double[,] xLarge = DistinctCandidates(large, 24); + CentralUniqueCount(large, xLarge).Should().BeGreaterThanOrEqualTo(2000, "this case must take the vectorized erf"); + AssertSameBits(large, xLarge); + + // 24 distinct candidates x 30 kernels: at most 720 unique pairs. + var small = RandomDiscreteMixture(rng, 30, 1, distinctSigmas: true); + double[,] xSmall = DistinctCandidates(small, 24); + CentralUniqueCount(small, xSmall).Should().BeLessThan(2000, "this case must take the exact erf"); + AssertSameBits(small, xSmall); + } + + // ------------------------------------------------------------------ the hashed dedup + + /// <summary> + /// <see cref="MixtureOfProductDistribution.UniqueInverse" /> groups pairs exactly as the sorted dedup it replaced: + /// the same number of groups, the same positions in each group (the two inverses differ only by a renumbering), + /// and the same representative bits, the group's first occurrence. The pairs come from a small pool so they repeat, + /// and the pool holds both zeros (equal, so grouped), NaN (equal to nothing, so a group of its own each time), and + /// both infinities. + /// </summary> + /// <param name="n">The number of pairs.</param> + [TestMethod] + [DataRow(0)] + [DataRow(1)] + [DataRow(2)] + [DataRow(9)] + [DataRow(300)] + [DataRow(5000)] + public void UniqueInverse_GroupsAsTheSortedDedup_KeepingFirstOccurrences(int n) + { + var rng = new Random(n + 3); + double[] pool = { -0.0, 0.0, 1.5, -2.25, double.PositiveInfinity, double.NegativeInfinity, double.NaN, 3.0, 1e-300 }; + var a = new double[n]; + var b = new double[n]; + for (int i = 0; i < n; i++) + { + a[i] = pool[rng.Next(pool.Length)]; + b[i] = pool[rng.Next(pool.Length)]; + } + + var uniqueA = new double[n]; + var uniqueB = new double[n]; + var inverse = new int[n]; + int count = MixtureOfProductDistribution.UniqueInverse(a, b, uniqueA, uniqueB, inverse); + var (sortedA, sortedB, sortedInverse) = SortedUniqueInverse2d(a, b); + + count.Should().Be(sortedA.Length); + // The new numbering maps one-to-one onto the sorted numbering, and every position agrees with it. + var toSorted = Enumerable.Repeat(-1, count).ToArray(); + for (int i = 0; i < n; i++) + { + if (toSorted[inverse[i]] < 0) + { + toSorted[inverse[i]] = sortedInverse[i]; + // The first position of a group is its representative: same bits in both dedups. + BitConverter.DoubleToInt64Bits(uniqueA[inverse[i]]).Should().Be(BitConverter.DoubleToInt64Bits(a[i]), $"position {i}"); + BitConverter.DoubleToInt64Bits(uniqueB[inverse[i]]).Should().Be(BitConverter.DoubleToInt64Bits(b[i]), $"position {i}"); + BitConverter.DoubleToInt64Bits(sortedA[sortedInverse[i]]).Should().Be(BitConverter.DoubleToInt64Bits(a[i]), $"position {i}"); + BitConverter.DoubleToInt64Bits(sortedB[sortedInverse[i]]).Should().Be(BitConverter.DoubleToInt64Bits(b[i]), $"position {i}"); + } + toSorted[inverse[i]].Should().Be(sortedInverse[i], $"position {i} is grouped as the sorted dedup groups it"); + } + toSorted.Distinct().Count().Should().Be(count, "different groups stay different"); + } + + // ------------------------------------------------------------------ the continuous terms and their sums + + /// <summary> + /// <see cref="MixtureOfProductDistribution.ContinuousLogPdfTerms" />, on its vector branch (whole kernel blocks plus + /// the leftover kernels) and on its scalar branch (fewer kernels than a vector holds), against the term formula + /// written out: every kernel count from one to three vectors and three more, one to ten dimensions, candidates + /// outside some kernels' intervals (<c>-inf</c> terms) and empty intervals (NaN terms). Same bits, NaNs where the + /// formula gives NaN, every term in its <c>(n_samples, n_kernels, n_cont)</c> slot. + /// </summary> + /// <param name="seed">Seeds the random grids.</param> + [TestMethod] + [DataRow(1)] + [DataRow(2)] + public void ContinuousLogPdfTerms_BothBranches_MatchTheTermFormulaToTheBit(int seed) + { + var rng = new Random(seed); + int width = System.Numerics.Vector<double>.Count; + foreach (int nCont in new[] { 1, 3, 10 }) + { + for (int nKernels = 1; nKernels <= 3 * width + 3; nKernels++) + { + const int nSamples = 7; + var grids = RandomContinuousGrids(rng, nSamples, nCont, nKernels); + var actual = new double[nSamples * nKernels * nCont]; + MixtureOfProductDistribution.ContinuousLogPdfTerms( + grids.XCont, nSamples, nCont, grids.Mu, grids.Sigma, grids.A, grids.B, grids.LogGaussMass, grids.LogSigma, + actual, nKernels); + double[] expected = ReferenceTerms(grids, nSamples, nCont, nKernels); + AssertSameBitsOrNaN(actual, expected, $"{nKernels} kernels, {nCont} dims"); + } + } + } + + /// <summary> + /// QA-84 (owner's choice 2026-11-12): <see cref="MixtureOfProductDistribution.AddContinuousSums" /> adds to each row + /// NumPy's sum of its terms over the last axis, <c>0.0 + pairwise_sum(row)</c>, which is also what NumSharp's + /// <c>np.sum(axis=-1)</c> gives on the same terms, at widths on both sides of NumPy's eight-element switch and past + /// its 128-element block. Below eight dimensions that is the left-to-right sum the port used before, so nothing + /// changes there. + /// </summary> + /// <param name="seed">Seeds the random grids.</param> + [TestMethod] + [DataRow(1)] + [DataRow(2)] + public void AddContinuousSums_AreNumPysPairwiseSumsOfTheTerms(int seed) + { + var rng = new Random(seed); + int width = System.Numerics.Vector<double>.Count; + foreach (int nCont in new[] { 1, 7, 8, 9, 10, 17, 40, 129 }) + { + foreach (int nKernels in new[] { 1, width, 3 * width + 3, 40 }) + { + const int nSamples = 5; + var grids = RandomContinuousGrids(rng, nSamples, nCont, nKernels); + var start = new double[nSamples * nKernels]; + for (int i = 0; i < start.Length; i++) + start[i] = rng.NextDouble() * 10 - 5; + + var actual = (double[])start.Clone(); + MixtureOfProductDistribution.AddContinuousSums( + grids.XCont, nSamples, nCont, grids.Mu, grids.Sigma, grids.A, grids.B, grids.LogGaussMass, grids.LogSigma, + actual, nKernels); + + double[] terms = ReferenceTerms(grids, nSamples, nCont, nKernels); + var expected = new double[start.Length]; + for (int i = 0; i < expected.Length; i++) + expected[i] = start[i] + (0.0 + NumPyPairwiseSum(terms.AsSpan(i * nCont, nCont))); + string where = $"{nKernels} kernels, {nCont} dims"; + AssertSameBitsOrNaN(actual, expected, where); + + // The same sums straight from NumSharp, the reference the implementation calls (it equals live NumPy 2.4.2 + // bit for bit at widths 1-300, measured 2026-11-12). + double[] viaNumSharp; + using (var termArray = new NumSharp.NDArray(terms, new NumSharp.Shape(nSamples, nKernels, nCont))) + using (var sums = NumSharp.np.sum(termArray, axis: -1)) + viaNumSharp = sums.ToArray<double>(); + for (int i = 0; i < viaNumSharp.Length; i++) + viaNumSharp[i] = start[i] + viaNumSharp[i]; + AssertSameBitsOrNaN(actual, viaNumSharp, where + ", NumSharp"); + + if (nCont < 8) + { + double[] leftToRight = ReferenceAccumulate( + grids.XCont, nSamples, nCont, grids.Mu, grids.Sigma, grids.A, grids.B, grids.LogGaussMass, + grids.LogSigma, start, nKernels); + AssertSameBitsOrNaN(actual, leftToRight, where + ", below eight dims the order is unchanged"); + } + } + } + } + + /// <summary> + /// From eight dimensions on the pairwise order really is another order: over many random rows at 8, 10 and 16 + /// dimensions, some finite sums differ from the left-to-right ones the port used before QA-84. + /// </summary> + [TestMethod] + public void AddContinuousSums_FromEightDimensions_DifferFromTheLeftToRightSum() + { + var rng = new Random(84); + foreach (int nCont in new[] { 8, 10, 16 }) + { + const int nSamples = 24, nKernels = 60; + var grids = RandomContinuousGrids(rng, nSamples, nCont, nKernels, emptyIntervals: false, outsideCandidates: false); + var start = new double[nSamples * nKernels]; + var actual = (double[])start.Clone(); + MixtureOfProductDistribution.AddContinuousSums( + grids.XCont, nSamples, nCont, grids.Mu, grids.Sigma, grids.A, grids.B, grids.LogGaussMass, grids.LogSigma, + actual, nKernels); + double[] leftToRight = ReferenceAccumulate( + grids.XCont, nSamples, nCont, grids.Mu, grids.Sigma, grids.A, grids.B, grids.LogGaussMass, grids.LogSigma, + start, nKernels); + int differing = 0; + for (int i = 0; i < actual.Length; i++) + { + if (BitConverter.DoubleToInt64Bits(actual[i]) != BitConverter.DoubleToInt64Bits(leftToRight[i])) + differing++; + } + differing.Should().BeGreaterThan(0, $"{nCont} dims: the pairwise and left-to-right sums differ somewhere"); + } + } + + /// <summary> + /// The term computation's vector branch reads and writes without bounds checks, so both methods check every length + /// first: a grid one element short, a row or term buffer too short, or a short coordinate buffer is refused before + /// anything is touched. + /// </summary> + [TestMethod] + public void ContinuousMethods_ShortBuffers_AreRefusedUpFront() + { + const int nSamples = 3, nCont = 2, nKernels = 9; + var grid = new double[nCont * nKernels]; + var shortGrid = new double[nCont * nKernels - 1]; + var xCont = new double[nSamples * nCont]; + var rows = new double[nSamples * nKernels]; + var terms = new double[nSamples * nKernels * nCont]; + + Action shortSigma = () => MixtureOfProductDistribution.AddContinuousSums( + xCont, nSamples, nCont, grid, shortGrid, grid, grid, grid, grid, rows, nKernels); + shortSigma.Should().Throw<ArgumentException>(); + + Action shortRows = () => MixtureOfProductDistribution.AddContinuousSums( + xCont, nSamples, nCont, grid, grid, grid, grid, grid, grid, new double[nSamples * nKernels - 1], nKernels); + shortRows.Should().Throw<ArgumentException>(); + + Action shortX = () => MixtureOfProductDistribution.AddContinuousSums( + new double[nSamples * nCont - 1], nSamples, nCont, grid, grid, grid, grid, grid, grid, rows, nKernels); + shortX.Should().Throw<ArgumentException>(); + + Action shortTerms = () => MixtureOfProductDistribution.ContinuousLogPdfTerms( + xCont, nSamples, nCont, grid, grid, grid, grid, grid, grid, new double[terms.Length - 1], nKernels); + shortTerms.Should().Throw<ArgumentException>(); + + Action shortTermGrid = () => MixtureOfProductDistribution.ContinuousLogPdfTerms( + xCont, nSamples, nCont, grid, grid, shortGrid, grid, grid, grid, terms, nKernels); + shortTermGrid.Should().Throw<ArgumentException>(); + } + + /// <summary>Random continuous grids and candidates for the term and sum tests.</summary> + /// <param name="rng">The random source.</param> + /// <param name="nSamples">The number of candidates.</param> + /// <param name="nCont">The number of dimensions.</param> + /// <param name="nKernels">The number of kernels.</param> + /// <param name="emptyIntervals">Whether about one interval in twelve is empty (NaN terms).</param> + /// <param name="outsideCandidates">Whether some candidates fall outside the intervals (<c>-inf</c> terms).</param> + /// <returns>The grids, one row of n_kernels per dimension, and the candidates, one row of n_cont each.</returns> + private static ContinuousGrids RandomContinuousGrids( + Random rng, int nSamples, int nCont, int nKernels, bool emptyIntervals = true, bool outsideCandidates = true) + { + int gridSize = nCont * nKernels; + var grids = new ContinuousGrids( + new double[nSamples * nCont], new double[gridSize], new double[gridSize], new double[gridSize], + new double[gridSize], new double[gridSize], new double[gridSize]); + for (int g = 0; g < gridSize; g++) + { + grids.Mu[g] = rng.NextDouble() * 4 - 2; + grids.Sigma[g] = 0.05 + rng.NextDouble(); + double low = -3.0, high = emptyIntervals && rng.Next(12) == 0 ? -3.0 : 3.0; + grids.A[g] = (low - grids.Mu[g]) / grids.Sigma[g]; + grids.B[g] = (high - grids.Mu[g]) / grids.Sigma[g]; + grids.LogSigma[g] = Math.Log(grids.Sigma[g]); + } + TruncNorm.LogGaussMass(grids.A, grids.B).CopyTo(grids.LogGaussMass, 0); + for (int i = 0; i < grids.XCont.Length; i++) + grids.XCont[i] = outsideCandidates ? rng.NextDouble() * 8 - 4 : rng.NextDouble() * 4 - 2; + return grids; + } + + /// <summary>The inputs of the continuous term computation.</summary> + /// <param name="XCont">The candidates' coordinates, one row of n_cont per candidate.</param> + /// <param name="Mu">The kernels' centers, one row of n_kernels per dimension.</param> + /// <param name="Sigma">The kernels' widths, laid out as <paramref name="Mu" />.</param> + /// <param name="A">The standardized lower bounds, laid out as <paramref name="Mu" />.</param> + /// <param name="B">The standardized upper bounds, laid out as <paramref name="Mu" />.</param> + /// <param name="LogGaussMass">The log masses between the bounds, laid out as <paramref name="Mu" />.</param> + /// <param name="LogSigma">The kernels' log widths, laid out as <paramref name="Mu" />.</param> + private sealed record ContinuousGrids( + double[] XCont, double[] Mu, double[] Sigma, double[] A, double[] B, double[] LogGaussMass, double[] LogSigma); + + /// <summary> + /// The terms written out, one per (candidate, kernel, dimension): <c>_truncnorm.logpdf</c>'s formula with its NaN and + /// <c>-inf</c> selections, laid out as NumPy's <c>(n_samples, n_kernels, n_cont)</c> array. + /// </summary> + /// <param name="grids">The inputs.</param> + /// <param name="nSamples">The number of candidates.</param> + /// <param name="nCont">The number of dimensions.</param> + /// <param name="nKernels">The number of kernels.</param> + /// <returns>The terms.</returns> + private static double[] ReferenceTerms(ContinuousGrids grids, int nSamples, int nCont, int nKernels) + { + var terms = new double[nSamples * nKernels * nCont]; + for (int s = 0; s < nSamples; s++) + { + for (int k = 0; k < nKernels; k++) + { + for (int c = 0; c < nCont; c++) + { + int g = c * nKernels + k; + double xstd = (grids.XCont[s * nCont + c] - grids.Mu[g]) / grids.Sigma[g]; + double val = TruncNorm.NormLogPdf(xstd) - grids.LogGaussMass[g] - grids.LogSigma[g]; + if (grids.A[g] == grids.B[g]) + val = double.NaN; + else if (xstd < grids.A[g] || xstd > grids.B[g]) + val = double.NegativeInfinity; + terms[(s * nKernels + k) * nCont + c] = val; + } + } + } + return terms; + } + + /// <summary>NumPy's <c>pairwise_sum</c> (<c>loops_utils.h.src</c>, <c>PW_BLOCKSIZE</c> 128) over a contiguous run.</summary> + /// <param name="a">The run.</param> + /// <returns>Its sum in NumPy's order: left to right below eight, eight accumulators up to 128, halves above.</returns> + private static double NumPyPairwiseSum(ReadOnlySpan<double> a) + { + int n = a.Length; + if (n < 8) + { + double res = 0.0; + for (int i = 0; i < n; i++) + res += a[i]; + return res; + } + if (n <= 128) + { + double r0 = a[0], r1 = a[1], r2 = a[2], r3 = a[3], r4 = a[4], r5 = a[5], r6 = a[6], r7 = a[7]; + int i = 8; + for (; i < n - (n % 8); i += 8) + { + r0 += a[i]; r1 += a[i + 1]; r2 += a[i + 2]; r3 += a[i + 3]; + r4 += a[i + 4]; r5 += a[i + 5]; r6 += a[i + 6]; r7 += a[i + 7]; + } + double res = ((r0 + r1) + (r2 + r3)) + ((r4 + r5) + (r6 + r7)); + for (; i < n; i++) + res += a[i]; + return res; + } + int n2 = n / 2; + n2 -= n2 % 8; + return NumPyPairwiseSum(a[..n2]) + NumPyPairwiseSum(a[n2..]); + } + + /// <summary>Asserts two arrays are equal bit for bit, a NaN matching any NaN.</summary> + /// <param name="actual">The computed values.</param> + /// <param name="expected">The reference values.</param> + /// <param name="where">Names the case in a failure.</param> + private static void AssertSameBitsOrNaN(double[] actual, double[] expected, string where) + { + actual.Length.Should().BeGreaterThanOrEqualTo(expected.Length, where); + for (int i = 0; i < expected.Length; i++) + { + if (double.IsNaN(expected[i])) + double.IsNaN(actual[i]).Should().BeTrue($"element {i} is NaN in the reference ({where})"); + else + BitConverter.DoubleToInt64Bits(actual[i]).Should().Be(BitConverter.DoubleToInt64Bits(expected[i]), + $"element {i}: {actual[i]:R} vs {expected[i]:R} ({where})"); + } + } + + // ------------------------------------------------------------------ references: the replaced code + + /// <summary> + /// The accumulation as it was computed before QA-84's fix: per candidate, a buffer of one sum per kernel starts at + /// +0.0, receives each dimension's term in dimension order (left to right), and is then added to the candidate's + /// row. Below eight dimensions NumPy's pairwise sum is this order too. + /// </summary> + /// <param name="xCont">The candidates' coordinates, one row of <paramref name="nCont" /> per candidate.</param> + /// <param name="nSamples">The number of candidates.</param> + /// <param name="nCont">The number of dimensions.</param> + /// <param name="mu">The kernels' centers, one row per dimension.</param> + /// <param name="sigma">The kernels' widths, one row per dimension.</param> + /// <param name="a">The standardized lower bounds, one row per dimension.</param> + /// <param name="b">The standardized upper bounds, one row per dimension.</param> + /// <param name="logGaussMass">The log masses between the bounds, one row per dimension.</param> + /// <param name="logSigma">The kernels' log widths, one row per dimension.</param> + /// <param name="start">The rows before the accumulation; not modified.</param> + /// <param name="nKernels">The number of kernels.</param> + /// <returns>The rows after the accumulation.</returns> + private static double[] ReferenceAccumulate( + double[] xCont, int nSamples, int nCont, double[] mu, double[] sigma, double[] a, double[] b, + double[] logGaussMass, double[] logSigma, double[] start, int nKernels) + { + var rows = (double[])start.Clone(); + var sums = new double[nKernels]; + for (int s = 0; s < nSamples; s++) + { + Array.Clear(sums); + for (int c = 0; c < nCont; c++) + { + for (int k = 0; k < nKernels; k++) + { + int g = c * nKernels + k; + double xstd = (xCont[s * nCont + c] - mu[g]) / sigma[g]; + double val = TruncNorm.NormLogPdf(xstd) - logGaussMass[g] - logSigma[g]; + if (a[g] == b[g]) + val = double.NaN; + else if (xstd < a[g] || xstd > b[g]) + val = double.NegativeInfinity; + sums[k] += val; + } + } + for (int k = 0; k < nKernels; k++) + rows[s * nKernels + k] += sums[k]; + } + return rows; + } + + /// <summary> + /// The log-pdf of a mixture of stepped dimensions as computed before plan 15: the discrete branch over LINQ-sorted + /// dedups (<c>np.unique</c>, <c>_unique_inverse_2d</c>, <c>_log_gauss_mass_unique</c>), then the log mixture weights + /// and the log-sum-exp. + /// </summary> + /// <param name="mixture">A mixture of stepped dimensions only.</param> + /// <param name="x">The candidates, one row each.</param> + /// <returns>One log density per candidate.</returns> + private static double[] ReferenceDiscreteLogPdf(MixtureOfProductDistribution mixture, double[,] x) + { + int nSamples = x.GetLength(0), nKernels = mixture.Weights.Length; + var weighted = new double[nSamples * nKernels]; + for (int i = 0; i < mixture.Distributions.Count; i++) + { + var dtn = (BatchedNumericalDistributions)mixture.Distributions[i]; + bool isLog = dtn.IsLog; + double step = dtn.Step; + var xcol = new double[nSamples]; + for (int s = 0; s < nSamples; s++) + xcol[s] = x[s, i]; + + var (xiUniq, xiInv) = SortedUniqueInverse1d(xcol); + var (muUniq, sigmaUniq, msInv) = SortedUniqueInverse2d(dtn.Mu, dtn.Sigma); + int nXi = xiUniq.Length; + int nMs = muUniq.Length; + + var a = new double[nXi * nMs]; + var b = new double[nXi * nMs]; + for (int p = 0; p < nXi; p++) + { + double left = isLog ? Math.Log(xiUniq[p] - step / 2.0) : xiUniq[p] - step / 2.0; + double right = isLog ? Math.Log(xiUniq[p] + step / 2.0) : xiUniq[p] + step / 2.0; + for (int qi = 0; qi < nMs; qi++) + { + a[p * nMs + qi] = (left - muUniq[qi]) / sigmaUniq[qi]; + b[p * nMs + qi] = (right - muUniq[qi]) / sigmaUniq[qi]; + } + } + + var logMass = SortedLogGaussMassUnique(a, b); + for (int s = 0; s < nSamples; s++) + { + int row = xiInv[s] * nMs; + for (int k = 0; k < nKernels; k++) + weighted[s * nKernels + k] += logMass[row + msInv[k]]; + } + + var normLow = new double[nMs]; + var normHigh = new double[nMs]; + for (int qi = 0; qi < nMs; qi++) + { + normLow[qi] = (dtn.AdaptedLow - muUniq[qi]) / sigmaUniq[qi]; + normHigh[qi] = (dtn.AdaptedHigh - muUniq[qi]) / sigmaUniq[qi]; + } + var norm = TruncNorm.LogGaussMass(normLow, normHigh); + for (int s = 0; s < nSamples; s++) + { + for (int k = 0; k < nKernels; k++) + weighted[s * nKernels + k] -= norm[msInv[k]]; + } + } + + for (int s = 0; s < nSamples; s++) + for (int k = 0; k < nKernels; k++) + weighted[s * nKernels + k] += Math.Log(mixture.Weights[k]); + + var result = new double[nSamples]; + var expBuf = new double[nKernels]; + for (int s = 0; s < nSamples; s++) + { + double max = double.NegativeInfinity; + for (int k = 0; k < nKernels; k++) + max = Math.Max(max, weighted[s * nKernels + k]); + if (double.IsNegativeInfinity(max)) + max = 0.0; + for (int k = 0; k < nKernels; k++) + expBuf[k] = Math.Exp(weighted[s * nKernels + k] - max); + result[s] = Math.Log(MathUtil.PairwiseSum(expBuf)) + max; + } + return result; + } + + /// <summary>The replaced <c>_log_gauss_mass_unique</c>: the sorted dedup, the mass per unique pair, scattered back.</summary> + /// <param name="a">The lower bounds.</param> + /// <param name="b">The upper bounds.</param> + /// <returns>The log mass of every input pair.</returns> + private static double[] SortedLogGaussMassUnique(double[] a, double[] b) + { + var (aUniq, bUniq, inv) = SortedUniqueInverse2d(a, b); + var lgmUniq = TruncNorm.LogGaussMass(aUniq, bUniq); + var result = new double[a.Length]; + for (int j = 0; j < a.Length; j++) + result[j] = lgmUniq[inv[j]]; + return result; + } + + /// <summary>The replaced <c>np.unique(x, return_inverse=True)</c>: a stable LINQ sort, then neighbors compared with <c>!=</c>.</summary> + /// <param name="x">The values.</param> + /// <returns>The sorted unique values and each position's index among them.</returns> + private static (double[] Uniq, int[] Inv) SortedUniqueInverse1d(double[] x) + { + int n = x.Length; + var order = Enumerable.Range(0, n).OrderBy(i => x[i]).ToArray(); + var uniq = new List<double>(); + var inv = new int[n]; + for (int k = 0; k < n; k++) + { + int idx = order[k]; + if (k == 0 || x[idx] != x[order[k - 1]]) + uniq.Add(x[idx]); + inv[idx] = uniq.Count - 1; + } + return (uniq.ToArray(), inv); + } + + /// <summary>The replaced <c>_unique_inverse_2d(a, b)</c>: a stable LINQ sort by (a, b), then neighbors compared with <c>!=</c>.</summary> + /// <param name="a">The pairs' first components.</param> + /// <param name="b">The pairs' second components.</param> + /// <returns>The sorted unique pairs and each position's index among them.</returns> + private static (double[] AUniq, double[] BUniq, int[] Inv) SortedUniqueInverse2d(double[] a, double[] b) + { + int n = a.Length; + var order = Enumerable.Range(0, n).OrderBy(i => a[i]).ThenBy(i => b[i]).ToArray(); + var aUniq = new List<double>(); + var bUniq = new List<double>(); + var inv = new int[n]; + for (int k = 0; k < n; k++) + { + int idx = order[k]; + int prev = order[k - 1 < 0 ? 0 : k - 1]; + if (k == 0 || a[idx] != a[prev] || b[idx] != b[prev]) + { + aUniq.Add(a[idx]); + bUniq.Add(b[idx]); + } + inv[idx] = aUniq.Count - 1; + } + return (aUniq.ToArray(), bUniq.ToArray(), inv); + } + + // ------------------------------------------------------------------ helpers + + /// <summary>Compares the new <see cref="MixtureOfProductDistribution.LogPdf" /> with the replaced discrete code, bit for bit.</summary> + /// <param name="mixture">A mixture of stepped dimensions only.</param> + /// <param name="x">The candidates, one row each.</param> + private static void AssertSameBits(MixtureOfProductDistribution mixture, double[,] x) + { + double[] actual = mixture.LogPdf(x); + double[] expected = ReferenceDiscreteLogPdf(mixture, x); + actual.Length.Should().Be(expected.Length); + for (int s = 0; s < expected.Length; s++) + { + if (double.IsNaN(expected[s])) + double.IsNaN(actual[s]).Should().BeTrue($"candidate {s} was NaN before"); + else + BitConverter.DoubleToInt64Bits(actual[s]).Should().Be(BitConverter.DoubleToInt64Bits(expected[s]), + $"candidate {s}: {actual[s]:R} vs {expected[s]:R} ({mixture.Weights.Length} kernels, {x.GetLength(1)} dims)"); + } + } + + /// <summary> + /// A random mixture of stepped dimensions, cycling through integers on [-50, 50], log integers on [1, 1000] and + /// floats on [0, 10] with step 0.25. Centers are values of the domain, so many repeat; widths repeat a common + /// clipped value unless <paramref name="distinctSigmas" />, as TPE's clipped kernels do. + /// </summary> + /// <param name="rng">The source of randomness.</param> + /// <param name="nKernels">The number of kernels.</param> + /// <param name="nDims">The number of dimensions.</param> + /// <param name="distinctSigmas">Whether every kernel gets its own width.</param> + /// <returns>The mixture.</returns> + private static MixtureOfProductDistribution RandomDiscreteMixture(Random rng, int nKernels, int nDims, bool distinctSigmas) + { + var dims = new List<BatchedDistributions>(); + for (int d = 0; d < nDims; d++) + { + var mu = new double[nKernels]; + var sigma = new double[nKernels]; + switch (d % 3) + { + case 0: + for (int k = 0; k < nKernels; k++) + { + mu[k] = rng.Next(-50, 51); + sigma[k] = distinctSigmas ? 0.5 + rng.NextDouble() * 20 : (rng.Next(4) == 0 ? 7.0 : 1.01); + } + dims.Add(new BatchedDiscreteTruncNormDistributions(mu, sigma, -50, 50, 1)); + break; + case 1: + for (int k = 0; k < nKernels; k++) + { + mu[k] = Math.Log(rng.Next(1, 1001)); + sigma[k] = distinctSigmas ? 0.05 + rng.NextDouble() * 2 : (rng.Next(4) == 0 ? 1.3 : 0.069); + } + dims.Add(new BatchedDiscreteTruncLogNormDistributions(mu, sigma, 1, 1000, 1)); + break; + default: + for (int k = 0; k < nKernels; k++) + { + mu[k] = rng.Next(0, 41) * 0.25; + sigma[k] = distinctSigmas ? 0.1 + rng.NextDouble() * 5 : (rng.Next(4) == 0 ? 2.5 : 0.1); + } + dims.Add(new BatchedDiscreteTruncNormDistributions(mu, sigma, 0, 10, 0.25)); + break; + } + } + var weights = new double[nKernels]; + double sum = 0; + for (int k = 0; k < nKernels; k++) + sum += weights[k] = 0.1 + rng.NextDouble(); + for (int k = 0; k < nKernels; k++) + weights[k] /= sum; + return new MixtureOfProductDistribution(weights, dims); + } + + /// <summary>Candidates on each dimension's grid of values; with 24 draws from a narrow band, some repeat.</summary> + /// <param name="rng">The source of randomness.</param> + /// <param name="mixture">The mixture whose dimensions the candidates follow.</param> + /// <param name="nSamples">The number of candidates.</param> + /// <returns>The candidates, one row each.</returns> + private static double[,] RandomDiscreteCandidates(Random rng, MixtureOfProductDistribution mixture, int nSamples) + { + int nDims = mixture.Distributions.Count; + var x = new double[nSamples, nDims]; + for (int s = 0; s < nSamples; s++) + { + for (int d = 0; d < nDims; d++) + { + x[s, d] = (d % 3) switch + { + 0 => rng.Next(-12, 13), + 1 => rng.Next(1, 30), + _ => rng.Next(10, 31) * 0.25, + }; + } + } + return x; + } + + /// <summary>Distinct candidates spread over the first dimension's domain.</summary> + /// <param name="mixture">A one-dimensional integer mixture.</param> + /// <param name="nSamples">The number of candidates.</param> + /// <returns>The candidates, one row each.</returns> + private static double[,] DistinctCandidates(MixtureOfProductDistribution mixture, int nSamples) + { + var x = new double[nSamples, mixture.Distributions.Count]; + for (int s = 0; s < nSamples; s++) + x[s, 0] = -48 + 4 * s; + return x; + } + + /// <summary> + /// How many unique central cell bounds (<c>a <= 0 < b</c>) the sorted dedup finds for the first dimension: + /// the count that picks the <c>erf</c> path. + /// </summary> + /// <param name="mixture">A mixture whose first dimension is stepped and not log.</param> + /// <param name="x">The candidates.</param> + /// <returns>The number of unique central pairs.</returns> + private static int CentralUniqueCount(MixtureOfProductDistribution mixture, double[,] x) + { + var dtn = (BatchedNumericalDistributions)mixture.Distributions[0]; + var xcol = Enumerable.Range(0, x.GetLength(0)).Select(s => x[s, 0]).ToArray(); + var (xiUniq, _) = SortedUniqueInverse1d(xcol); + var (muUniq, sigmaUniq, _) = SortedUniqueInverse2d(dtn.Mu, dtn.Sigma); + var a = new List<double>(); + var b = new List<double>(); + foreach (double xi in xiUniq) + { + for (int q = 0; q < muUniq.Length; q++) + { + a.Add((xi - dtn.Step / 2.0 - muUniq[q]) / sigmaUniq[q]); + b.Add((xi + dtn.Step / 2.0 - muUniq[q]) / sigmaUniq[q]); + } + } + var (aUniq, bUniq, _) = SortedUniqueInverse2d(a.ToArray(), b.ToArray()); + return Enumerable.Range(0, aUniq.Length).Count(i => !(aUniq[i] > 0.0) && !(bUniq[i] <= 0.0)); + } +} diff --git a/test/OptunaSharp.Tests/Samplers/TpeExactKernelTests.cs b/test/OptunaSharp.Tests/Samplers/TpeExactKernelTests.cs new file mode 100644 index 0000000..c7961af --- /dev/null +++ b/test/OptunaSharp.Tests/Samplers/TpeExactKernelTests.cs @@ -0,0 +1,495 @@ +using System; +using System.Collections.Generic; +using System.Linq; +using AwesomeAssertions; +using OptunaSharp.Internal; +using OptunaSharp.Samplers.Tpe; + +namespace OptunaSharp.Tests.Samplers; + +/// <summary> +/// Plan 13 (docs/plans/13-rustuna-derived-performance.md), item S6: the TPE scoring kernel computes per (kernel, +/// dimension) what used to be computed per candidate, runs its kernel loop on vectors, rents its grids, and sorts the +/// kernels' centers without LINQ, all keeping every bit. Each test compares the new code with a straightforward copy +/// of the code it replaced, bit for bit, on inputs chosen to reach every branch: every vector-remainder size, the +/// exact and the vectorized <c>erf</c> paths, log dimensions, candidates outside a kernel's interval, empty intervals, +/// ties and NaNs in the sort. +/// </summary> +[TestClass] +public class TpeExactKernelTests +{ + // ------------------------------------------------------------------ the continuous log-pdf + + /// <summary> + /// Mixtures of continuous kernels (plain and log), with every kernel count from 1 to three vectors and a few more + /// (so every remainder the scalar tail handles), against the replaced scalar code: every candidate's log density + /// has the same bits. + /// </summary> + /// <param name="seed">Seeds the random mixtures.</param> + [TestMethod] + [DataRow(1)] + [DataRow(2)] + [DataRow(3)] + public void ContinuousLogPdf_EveryKernelCount_MatchesTheReplacedScalarCodeToTheBit(int seed) + { + var rng = new Random(seed); + int maxKernels = 3 * System.Numerics.Vector<double>.Count + 5; + foreach (int nCont in new[] { 1, 2, 3, 7, 40 }) + { + for (int nKernels = 1; nKernels <= maxKernels; nKernels++) + AssertSameBits(RandomMixture(rng, nKernels, nCont, logEvery: 3), RandomCandidates(rng, 24, nCont, 0.15)); + } + } + + /// <summary> + /// A study-sized mixture (1,000 kernels, 3 and 40 dimensions): the bounds grid has thousands of central + /// elements, so <see cref="TruncNorm.LogGaussMass(double[], double[])" /> takes Optuna's vectorized <c>erf</c>, + /// reached now through rented buffers cut to the logical length. Same bits. + /// </summary> + [TestMethod] + public void ContinuousLogPdf_LargeGrids_UseTheVectorizedErf_AndMatchToTheBit() + { + var rng = new Random(11); + AssertSameBits(RandomMixture(rng, 1000, 3, logEvery: 2), RandomCandidates(rng, 24, 3, 0.1)); + AssertSameBits(RandomMixture(rng, 1000, 40, logEvery: 5), RandomCandidates(rng, 24, 40, 0.1)); + } + + /// <summary> + /// A dimension whose bounds coincide (a single-value distribution) gives every kernel an empty interval, so its + /// term is NaN, as <c>np.select</c> makes it; the new kernel yields the same NaN densities. + /// </summary> + [TestMethod] + public void ContinuousLogPdf_AnEmptyInterval_IsNaN_AsBefore() + { + var rng = new Random(5); + int nKernels = 2 * System.Numerics.Vector<double>.Count + 1; + var dists = new List<BatchedNumericalDistributions> + { + RandomDimension(rng, nKernels, log: false), + new BatchedTruncNormDistributions(Fill(nKernels, 0.5), Fill(nKernels, 0.25), 0.5, 0.5), + }; + var mixture = new MixtureOfProductDistribution(RandomWeights(rng, nKernels), dists); + double[,] x = RandomCandidates(rng, 6, 2, 0.0); + for (int s = 0; s < 6; s++) + x[s, 1] = 0.5; + + AssertSameBits(mixture, x); + mixture.LogPdf(x).Should().OnlyContain(v => double.IsNaN(v)); + } + + /// <summary>Compares the new <see cref="MixtureOfProductDistribution.LogPdf" /> with the replaced code, bit for bit.</summary> + /// <param name="mixture">A mixture of continuous dimensions only.</param> + /// <param name="x">The candidates, one row each.</param> + private static void AssertSameBits(MixtureOfProductDistribution mixture, double[,] x) + { + double[] actual = mixture.LogPdf(x); + double[] expected = ReferenceLogPdf(mixture, x); + actual.Length.Should().Be(expected.Length); + for (int s = 0; s < expected.Length; s++) + { + if (double.IsNaN(expected[s])) + double.IsNaN(actual[s]).Should().BeTrue($"candidate {s} was NaN before"); + else + BitConverter.DoubleToInt64Bits(actual[s]).Should().Be(BitConverter.DoubleToInt64Bits(expected[s]), + $"candidate {s}: {actual[s]:R} vs {expected[s]:R} ({mixture.Weights.Length} kernels, {x.GetLength(1)} dims)"); + } + } + + /// <summary> + /// The log-pdf as it was computed before item S6, for mixtures of continuous dimensions: per candidate, per kernel, + /// per dimension, with <c>log(sigma)</c> taken in the innermost loop, the bounds grid kernel-major, then the log + /// weights per (candidate, kernel) and the log-sum-exp. + /// </summary> + /// <param name="mixture">A mixture of continuous dimensions only.</param> + /// <param name="x">The candidates, one row each.</param> + /// <returns>One log density per candidate.</returns> + private static double[] ReferenceLogPdf(MixtureOfProductDistribution mixture, double[,] x) + { + int nSamples = x.GetLength(0), nKernels = mixture.Weights.Length, nCont = mixture.Distributions.Count; + var weighted = new double[nSamples, nKernels]; + var dists = mixture.Distributions.Cast<BatchedNumericalDistributions>().ToList(); + + var xCont = new double[nCont][]; + for (int c = 0; c < nCont; c++) + { + xCont[c] = new double[nSamples]; + for (int s = 0; s < nSamples; s++) + xCont[c][s] = dists[c].IsLog ? Math.Log(x[s, c]) : x[s, c]; + } + + var aGrid = new double[nKernels * nCont]; + var bGrid = new double[nKernels * nCont]; + for (int k = 0; k < nKernels; k++) + { + for (int c = 0; c < nCont; c++) + { + aGrid[k * nCont + c] = (dists[c].AdaptedLow - dists[c].Mu[k]) / dists[c].Sigma[k]; + bGrid[k * nCont + c] = (dists[c].AdaptedHigh - dists[c].Mu[k]) / dists[c].Sigma[k]; + } + } + double[] logGaussMass = ReferenceLogGaussMass(aGrid, bGrid); + + for (int s = 0; s < nSamples; s++) + { + for (int k = 0; k < nKernels; k++) + { + double sum = 0.0; + for (int c = 0; c < nCont; c++) + { + double mu = dists[c].Mu[k], sigma = dists[c].Sigma[k]; + int gi = k * nCont + c; + double xstd = (xCont[c][s] - mu) / sigma; + double val = TruncNorm.NormLogPdf(xstd) - logGaussMass[gi] - Math.Log(sigma); + if (aGrid[gi] == bGrid[gi]) + val = double.NaN; + else if (xstd < aGrid[gi] || xstd > bGrid[gi]) + val = double.NegativeInfinity; + sum += val; + } + weighted[s, k] += sum; + } + } + + for (int s = 0; s < nSamples; s++) + { + for (int k = 0; k < nKernels; k++) + weighted[s, k] += Math.Log(mixture.Weights[k]); + } + + var result = new double[nSamples]; + var expBuf = new double[nKernels]; + for (int s = 0; s < nSamples; s++) + { + double max = double.NegativeInfinity; + for (int k = 0; k < nKernels; k++) + max = Math.Max(max, weighted[s, k]); + if (double.IsNegativeInfinity(max)) + max = 0.0; + for (int k = 0; k < nKernels; k++) + expBuf[k] = Math.Exp(weighted[s, k] - max); + result[s] = Math.Log(MathUtil.PairwiseSum(expBuf)) + max; + } + return result; + } + + // ------------------------------------------------------------------ the categorical log-pdf (plan 14) + + /// <summary> + /// Plan 14: a categorical dimension now takes the log of each (kernel, choice) weight once instead of once per + /// candidate and kernel. Mixtures of one to four categorical dimensions (two to seven choices, some weights zero, so + /// some terms are <c>-inf</c>), from one to forty kernels, against the per-candidate logs it replaced: every + /// candidate's log density has the same bits. + /// </summary> + /// <param name="seed">Seeds the random mixtures.</param> + [TestMethod] + [DataRow(1)] + [DataRow(2)] + public void CategoricalLogPdf_OneLogPerKernelAndChoice_MatchesThePerCandidateLogsToTheBit(int seed) + { + var rng = new Random(seed); + foreach (int nDims in new[] { 1, 2, 4 }) + { + for (int nKernels = 1; nKernels <= 40; nKernels += 3) + { + var dims = new List<BatchedDistributions>(); + var choices = new int[nDims]; + for (int d = 0; d < nDims; d++) + { + choices[d] = rng.Next(2, 8); + var weights = new double[nKernels, choices[d]]; + for (int k = 0; k < nKernels; k++) + for (int c = 0; c < choices[d]; c++) + weights[k, c] = rng.Next(0, 6) == 0 ? 0.0 : rng.NextDouble(); + dims.Add(new BatchedCategoricalDistributions(weights)); + } + var mixture = new MixtureOfProductDistribution(RandomWeights(rng, nKernels), dims); + var x = new double[24, nDims]; + for (int s = 0; s < 24; s++) + for (int d = 0; d < nDims; d++) + x[s, d] = rng.Next(0, choices[d]); + + double[] actual = mixture.LogPdf(x); + double[] expected = ReferenceCategoricalLogPdf(mixture, x); + for (int s = 0; s < 24; s++) + { + if (double.IsNaN(expected[s])) + double.IsNaN(actual[s]).Should().BeTrue($"candidate {s} was NaN before"); + else + BitConverter.DoubleToInt64Bits(actual[s]).Should().Be(BitConverter.DoubleToInt64Bits(expected[s]), + $"candidate {s}: {nKernels} kernels, {nDims} categorical dims"); + } + } + } + } + + /// <summary> + /// The log-pdf of a mixture of categorical dimensions as computed before plan 14: <c>log(weights[k, x])</c> taken + /// per candidate and kernel, then the log mixture weights and the log-sum-exp. + /// </summary> + /// <param name="mixture">A mixture of categorical dimensions only.</param> + /// <param name="x">The candidates' choice indices, one row each.</param> + /// <returns>One log density per candidate.</returns> + private static double[] ReferenceCategoricalLogPdf(MixtureOfProductDistribution mixture, double[,] x) + { + int nSamples = x.GetLength(0), nKernels = mixture.Weights.Length; + var weighted = new double[nSamples, nKernels]; + for (int d = 0; d < mixture.Distributions.Count; d++) + { + var cat = (BatchedCategoricalDistributions)mixture.Distributions[d]; + for (int s = 0; s < nSamples; s++) + { + long xi = (long)x[s, d]; + for (int k = 0; k < nKernels; k++) + weighted[s, k] += Math.Log(cat.Weights[k, xi]); + } + } + for (int s = 0; s < nSamples; s++) + for (int k = 0; k < nKernels; k++) + weighted[s, k] += Math.Log(mixture.Weights[k]); + + var result = new double[nSamples]; + var expBuf = new double[nKernels]; + for (int s = 0; s < nSamples; s++) + { + double max = double.NegativeInfinity; + for (int k = 0; k < nKernels; k++) + max = Math.Max(max, weighted[s, k]); + if (double.IsNegativeInfinity(max)) + max = 0.0; + for (int k = 0; k < nKernels; k++) + expBuf[k] = Math.Exp(weighted[s, k] - max); + result[s] = Math.Log(MathUtil.PairwiseSum(expBuf)) + max; + } + return result; + } + + // ------------------------------------------------------------------ the log Gaussian mass + + /// <summary> + /// <see cref="TruncNorm.LogGaussMass(double[], double[])" />, now over rented scratch memory, against the replaced + /// allocation-per-call code: the left, right and central cases, NaN bounds, and central counts on both sides of the + /// 2,000-element switch to the vectorized <c>erf</c>. + /// </summary> + /// <param name="n">The number of intervals.</param> + [TestMethod] + [DataRow(1)] + [DataRow(17)] + [DataRow(1999)] + [DataRow(2000)] + [DataRow(2001)] + [DataRow(6000)] + public void LogGaussMass_OverRentedScratch_MatchesTheReplacedCodeToTheBit(int n) + { + var rng = new Random(n); + var a = new double[n]; + var b = new double[n]; + for (int i = 0; i < n; i++) + { + // Mostly central intervals, so the central count crosses the switch with n; some left, some right. + double u = rng.NextDouble(); + double lo = u < 0.8 ? -rng.NextDouble() * 4 : (u < 0.9 ? -8 - rng.NextDouble() * 20 : rng.NextDouble() * 6); + a[i] = lo; + b[i] = lo + rng.NextDouble() * 5; + } + if (n > 3) + { + a[1] = double.NaN; + b[2] = double.NaN; + } + + double[] actual = TruncNorm.LogGaussMass(a, b); + double[] expected = ReferenceLogGaussMass(a, b); + for (int i = 0; i < n; i++) + { + if (double.IsNaN(expected[i])) + double.IsNaN(actual[i]).Should().BeTrue($"interval {i} was NaN before"); + else + BitConverter.DoubleToInt64Bits(actual[i]).Should().Be(BitConverter.DoubleToInt64Bits(expected[i]), $"interval {i}"); + } + } + + /// <summary> + /// The span overload of <see cref="Erf.ComputeArray(double[])" /> picks its path from the span's length, not from + /// the buffer behind it: 1,999 values inside a 5,000-element buffer take the exact path, as a 1,999-element array + /// does. A caller that passed a rented buffer whole would switch paths and change values; this pins the contract. + /// </summary> + [TestMethod] + public void ErfComputeArray_OverASpan_ChoosesThePathByTheSpansLength() + { + var rng = new Random(7); + var buffer = new double[5000]; + for (int i = 0; i < buffer.Length; i++) + buffer[i] = (rng.NextDouble() - 0.5) * 8; + + var exact = new double[1999]; + Array.Copy(buffer, exact, 1999); + double[] fromArray = Erf.ComputeArray(exact); + var fromSpan = new double[1999]; + Erf.ComputeArray(new ReadOnlySpan<double>(buffer, 0, 1999), fromSpan); + + for (int i = 0; i < 1999; i++) + { + BitConverter.DoubleToInt64Bits(fromSpan[i]).Should().Be(BitConverter.DoubleToInt64Bits(fromArray[i])); + BitConverter.DoubleToInt64Bits(fromSpan[i]).Should().Be(BitConverter.DoubleToInt64Bits(Erf.Compute(buffer[i])), + "below 2,000 elements every value is the exact erf"); + } + } + + /// <summary> + /// The log Gaussian mass as it was computed before item S6: the central intervals gathered into new arrays and + /// passed through the normal CDF, the tails through the scalar log CDF. + /// </summary> + /// <param name="a">The standardized lower bounds.</param> + /// <param name="b">The standardized upper bounds.</param> + /// <returns>One log mass per interval.</returns> + private static double[] ReferenceLogGaussMass(double[] a, double[] b) + { + int n = a.Length; + var result = new double[n]; + var central = new List<int>(); + for (int i = 0; i < n; i++) + { + if (!(a[i] > 0.0) && !(b[i] <= 0.0)) + central.Add(i); + } + if (central.Count > 0) + { + double[] ndtrA = ReferenceNdtr(central.Select(i => a[i]).ToArray()); + double[] ndtrNegB = ReferenceNdtr(central.Select(i => -b[i]).ToArray()); + for (int k = 0; k < central.Count; k++) + result[central[k]] = MathUtil.Log1p(-ndtrA[k] - ndtrNegB[k]); + } + for (int i = 0; i < n; i++) + { + if (a[i] > 0.0) + result[i] = LogDiff(LogNdtr(-a[i]), LogNdtr(-b[i])); + else if (b[i] <= 0.0) + result[i] = LogDiff(LogNdtr(b[i]), LogNdtr(a[i])); + } + return result; + } + + /// <summary>The normal CDF as before: <c>0.5 + 0.5 * erf(a / sqrt(2))</c> over a new array.</summary> + /// <param name="a">The arguments.</param> + /// <returns>One probability per argument.</returns> + private static double[] ReferenceNdtr(double[] a) + { + double sqrt2 = Math.Sqrt(2.0); + double[] erf = Erf.ComputeArray(a.Select(v => v / sqrt2).ToArray()); + return erf.Select(e => 0.5 + 0.5 * e).ToArray(); + } + + /// <summary>The scalar log normal CDF Optuna's <c>_log_ndtr_single</c> computes.</summary> + /// <param name="v">The argument.</param> + /// <returns>Its log CDF.</returns> + private static double LogNdtr(double v) => TruncNorm.LogNdtr(new[] { v })[0]; + + /// <summary>Optuna's <c>_log_diff(log_p, log_q) = log_p + log1p(-exp(log_q - log_p))</c>.</summary> + /// <param name="logP">The larger log term.</param> + /// <param name="logQ">The log term to subtract.</param> + /// <returns>The log of the difference.</returns> + private static double LogDiff(double logP, double logQ) => logP + MathUtil.Log1p(-Math.Exp(logQ - logP)); + + // ------------------------------------------------------------------ the stable argsort + + /// <summary> + /// <see cref="ParzenEstimator.StableArgsort" /> is exactly the permutation the replaced LINQ sort returned, over + /// arrays full of ties, NaNs, both zeros and both infinities, and the empty and one-element arrays. + /// </summary> + [TestMethod] + public void StableArgsort_IsTheStableOrderByPermutation_WithTiesNaNsAndSignedZeros() + { + var rng = new Random(13); + double[] specials = { double.NaN, 0.0, -0.0, double.PositiveInfinity, double.NegativeInfinity, 1.5, -1.5 }; + for (int round = 0; round < 300; round++) + { + int n = round % 50; + var values = new double[n]; + for (int i = 0; i < n; i++) + { + double u = rng.NextDouble(); + values[i] = u < 0.3 ? specials[rng.Next(specials.Length)] : Math.Round(rng.NextDouble() * 6) - 3; + } + double[] before = (double[])values.Clone(); + + int[] expected = Enumerable.Range(0, n).OrderBy(i => values[i]).ToArray(); + ParzenEstimator.StableArgsort(values).Should().Equal(expected, $"round {round}: [{string.Join(", ", values)}]"); + values.Select(BitConverter.DoubleToInt64Bits).Should().Equal(before.Select(BitConverter.DoubleToInt64Bits), + "the input is not reordered"); + } + } + + // ------------------------------------------------------------------ inputs + + /// <summary>A mixture of <paramref name="nCont" /> continuous dimensions with random kernels and weights.</summary> + /// <param name="rng">The generator.</param> + /// <param name="nKernels">Kernels per dimension, prior included.</param> + /// <param name="nCont">Continuous dimensions.</param> + /// <param name="logEvery">Every this-many-th dimension is a log dimension.</param> + /// <returns>The mixture.</returns> + private static MixtureOfProductDistribution RandomMixture(Random rng, int nKernels, int nCont, int logEvery) + { + var dists = new List<BatchedDistributions>(); + for (int c = 0; c < nCont; c++) + dists.Add(RandomDimension(rng, nKernels, log: c % logEvery == logEvery - 1)); + return new MixtureOfProductDistribution(RandomWeights(rng, nKernels), dists); + } + + /// <summary>One continuous dimension over [0.5, 3.5] (plain, or log so its kernels live in log space).</summary> + /// <param name="rng">The generator.</param> + /// <param name="nKernels">Kernels, prior included.</param> + /// <param name="log">Whether the dimension is logarithmic.</param> + /// <returns>The dimension's kernels.</returns> + private static BatchedNumericalDistributions RandomDimension(Random rng, int nKernels, bool log) + { + double low = 0.5, high = 3.5; + double lo = log ? Math.Log(low) : low, hi = log ? Math.Log(high) : high; + var mu = new double[nKernels]; + var sigma = new double[nKernels]; + for (int k = 0; k < nKernels; k++) + { + mu[k] = lo + rng.NextDouble() * (hi - lo); + sigma[k] = (hi - lo) * (0.01 + rng.NextDouble()); + } + return log + ? new BatchedTruncLogNormDistributions(mu, sigma, low, high) + : new BatchedTruncNormDistributions(mu, sigma, low, high); + } + + /// <summary>Positive weights summing to one.</summary> + /// <param name="rng">The generator.</param> + /// <param name="n">How many.</param> + /// <returns>The weights.</returns> + private static double[] RandomWeights(Random rng, int n) + { + var w = Enumerable.Range(0, n).Select(_ => 0.05 + rng.NextDouble()).ToArray(); + double sum = w.Sum(); + return w.Select(v => v / sum).ToArray(); + } + + /// <summary>Candidates in [0.5, 3.5], with a share outside it (their density is zero, -inf in log).</summary> + /// <param name="rng">The generator.</param> + /// <param name="nSamples">Candidates.</param> + /// <param name="nCont">Dimensions.</param> + /// <param name="outsideShare">The share of coordinates placed outside the bounds.</param> + /// <returns>The candidates, one row each.</returns> + private static double[,] RandomCandidates(Random rng, int nSamples, int nCont, double outsideShare) + { + var x = new double[nSamples, nCont]; + for (int s = 0; s < nSamples; s++) + { + for (int c = 0; c < nCont; c++) + { + double u = rng.NextDouble(); + x[s, c] = u < outsideShare ? (rng.Next(2) == 0 ? 0.4 : 3.6) : 0.5 + rng.NextDouble() * 3.0; + } + } + return x; + } + + /// <summary>An array of <paramref name="n" /> copies of <paramref name="value" />.</summary> + /// <param name="n">The length.</param> + /// <param name="value">The value.</param> + /// <returns>The array.</returns> + private static double[] Fill(int n, double value) => Enumerable.Repeat(value, n).ToArray(); +} diff --git a/test/OptunaSharp.Tests/Samplers/TpeExpUnderflowTests.cs b/test/OptunaSharp.Tests/Samplers/TpeExpUnderflowTests.cs new file mode 100644 index 0000000..7081c74 --- /dev/null +++ b/test/OptunaSharp.Tests/Samplers/TpeExpUnderflowTests.cs @@ -0,0 +1,49 @@ +using System; +using AwesomeAssertions; +using OptunaSharp.Samplers.Tpe; + +namespace OptunaSharp.Tests.Samplers; + +/// <summary> +/// Plan 14: TPE's log-sum-exp stores <c>0.0</c> instead of calling <see cref="Math.Exp" /> for every term below +/// <see cref="MixtureOfProductDistribution.ExpIsZeroBelow" />. That is exact only if <see cref="Math.Exp" /> itself +/// returns <c>+0.0</c> (the bits, not merely a value equal to zero) for every such input on the platform running the +/// sampler; this pins it on every platform CI runs the unit suite on. +/// </summary> +[TestClass] +public class TpeExpUnderflowTests +{ + /// <summary> + /// Every input from the bound down to -1e6, densely near the bound and spread below it, plus -inf, gives + /// <see cref="Math.Exp" /> bits <c>0</c> (+0.0). + /// </summary> + [TestMethod] + public void MathExp_IsPositiveZero_ForEveryInputBelowTheSkipBound() + { + double bound = MixtureOfProductDistribution.ExpIsZeroBelow; + // The first 100,000 doubles below the bound, one ulp apart. + double x = Math.BitDecrement(bound); + for (int i = 0; i < 100_000; i++, x = Math.BitDecrement(x)) + BitConverter.DoubleToInt64Bits(Math.Exp(x)).Should().Be(0L, $"exp({x:R})"); + // A spread of inputs down to -1e6. + var rng = new Random(746); + for (int i = 0; i < 200_000; i++) + { + double y = bound - Math.Pow(10, 6 * rng.NextDouble()); + BitConverter.DoubleToInt64Bits(Math.Exp(y)).Should().Be(0L, $"exp({y:R})"); + } + BitConverter.DoubleToInt64Bits(Math.Exp(double.NegativeInfinity)).Should().Be(0L); + BitConverter.DoubleToInt64Bits(Math.Exp(double.MinValue)).Should().Be(0L); + } + + /// <summary> + /// The bound sits below the underflow point, not above it: inputs just above -745.1332 still produce a nonzero + /// subnormal, and so must still go through <see cref="Math.Exp" />. + /// </summary> + [TestMethod] + public void TheSkipBound_IsBelowTheUnderflowPoint() + { + Math.Exp(-745.13).Should().BeGreaterThan(0.0, "exp still has a subnormal result here"); + (MixtureOfProductDistribution.ExpIsZeroBelow < -745.14).Should().BeTrue(); + } +} diff --git a/test/OptunaSharp.Tests/Samplers/TpeObservationCacheTests.cs b/test/OptunaSharp.Tests/Samplers/TpeObservationCacheTests.cs new file mode 100644 index 0000000..185142c --- /dev/null +++ b/test/OptunaSharp.Tests/Samplers/TpeObservationCacheTests.cs @@ -0,0 +1,405 @@ +using System; +using System.Collections.Generic; +using System.Linq; +using System.Runtime.CompilerServices; +using System.Text; +using AwesomeAssertions; +using OptunaSharp.Collections; +using OptunaSharp.Distributions; +using OptunaSharp.Samplers; +using OptunaSharp.Samplers.Tpe; +using OptunaSharp.Storages; + +namespace OptunaSharp.Tests.Samplers; + +/// <summary> +/// Plan 14: TPE keeps finished trials' internal parameter values in a <see cref="TpeObservationCache" /> instead of +/// converting the whole history on every ask. Each test runs the same seeded study twice, once with the cache warm +/// (as sampling uses it) and once with it emptied before every suggestion (so every observation is converted from the +/// trial again, as before the cache), and asserts every trial is identical to the bit: dynamic ranges (one name, many +/// distributions), conditional parameters (finished trials lacking a name), pruned trials, constant liar with trials +/// still running, both TPE modes, two objectives and compact storage. +/// </summary> +[TestClass] +public class TpeObservationCacheTests +{ + /// <summary>Every trial's number, state, parameters (value bits) and values (bits), one line per trial.</summary> + /// <param name="study">The finished study.</param> + /// <returns>The study's trials as text.</returns> + private static string Dump(Study study) + { + var sb = new StringBuilder(); + foreach (var t in study.Trials) + { + sb.Append(t.Number).Append(' ').Append(t.State).Append(' '); + foreach (var (k, v) in t.Params) + sb.Append(k).Append('=').Append(v is double d ? BitConverter.DoubleToInt64Bits(d).ToString("X16") : v?.ToString()).Append(';'); + if (t.Values is not null) + foreach (double v in t.Values) + sb.Append(' ').Append(BitConverter.DoubleToInt64Bits(v).ToString("X16")); + sb.Append('\n'); + } + return sb.ToString(); + } + + /// <summary> + /// The objective with a dynamic range, a conditional parameter and pruning; <paramref name="beforeSuggest" /> runs + /// before each suggestion (the cold run empties the cache there). + /// </summary> + /// <param name="t">The trial.</param> + /// <param name="beforeSuggest">Called before each suggestion.</param> + /// <returns>The objective value.</returns> + /// <exception cref="TrialPruned">Every seventh trial is pruned after reporting its value.</exception> + private static double Objective(Trial t, Action beforeSuggest) + { + double span = 5.0 + t.Number % 3; + beforeSuggest(); + double x = t.SuggestFloat("x", -span, span); + beforeSuggest(); + string c = t.SuggestCategorical("c", new[] { "a", "b", "c" }); + double y = 0.0; + if (c == "a") + { + beforeSuggest(); + y = t.SuggestFloat("y", 1e-3, 10.0, log: true); + } + beforeSuggest(); + long k = t.SuggestInt("k", 0, 20, step: 2); + double value = x * x + y + k / 10.0 + (c == "b" ? 0.0 : 1.0); + t.Report(value, 0); + if (t.Number % 7 == 3) + throw new TrialPruned(); + return value; + } + + /// <summary>The study run warm and cold must be identical, for both TPE modes, with plain and compact storage.</summary> + /// <param name="multivariate">Whether TPE models the parameters jointly.</param> + /// <param name="compact">Whether the storage keeps finished trials compact (plan 13, item S12).</param> + [TestMethod] + [DataRow(false, false)] + [DataRow(true, false)] + [DataRow(false, true)] + [DataRow(true, true)] + public void WarmCache_EqualsColdCache_DynamicConditionalPruned(bool multivariate, bool compact) + { + string Run(bool cold) + { + var sampler = new TPESampler(seed: 21, multivariate: multivariate, nStartupTrials: 5); + var study = Optuna.CreateStudy(storage: new InMemoryStorage(compactFinishedTrials: compact), sampler: sampler); + Action before = cold ? () => sampler.ObservationCache.Reset() : () => { }; + study.Optimize(t => Objective(t, before), nTrials: 120); + return Dump(study); + } + + Run(cold: false).Should().Be(Run(cold: true)); + } + + /// <summary>Two objectives (MOTPE), warm and cold, must be identical.</summary> + [TestMethod] + public void WarmCache_EqualsColdCache_MultiObjective() + { + string Run(bool cold) + { + var sampler = new TPESampler(seed: 5, nStartupTrials: 5); + var study = Optuna.CreateStudy(sampler: sampler, directions: new[] { StudyDirection.Minimize, StudyDirection.Minimize }); + study.Optimize(t => + { + double a = 0, b = 0; + for (int i = 0; i < 6; i++) + { + if (cold) + sampler.ObservationCache.Reset(); + double v = t.SuggestFloat("x" + i, -3, 3); + a += v * v; + b += (v - 1) * (v - 1); + } + return new[] { a, b }; + }, nTrials: 100); + return Dump(study); + } + + Run(cold: false).Should().Be(Run(cold: true)); + } + + /// <summary> + /// Constant liar with trials still running (ask three, then tell three): running trials must never be cached, and + /// warm and cold runs must be identical in both TPE modes. + /// </summary> + /// <param name="multivariate">Whether TPE models the parameters jointly.</param> + [TestMethod] + [DataRow(false)] + [DataRow(true)] + public void WarmCache_EqualsColdCache_ConstantLiarWithRunningTrials(bool multivariate) + { + string Run(bool cold) + { + var sampler = new TPESampler(seed: 9, multivariate: multivariate, constantLiar: true, nStartupTrials: 4); + var study = Optuna.CreateStudy(sampler: sampler); + for (int round = 0; round < 25; round++) + { + var batch = new List<Trial>(); + for (int i = 0; i < 3; i++) + { + var t = study.Ask(); + if (cold) + sampler.ObservationCache.Reset(); + t.SuggestFloat("x", -5, 5); + if (cold) + sampler.ObservationCache.Reset(); + t.SuggestCategorical("c", new[] { "u", "v", "w" }); + batch.Add(t); + } + foreach (var t in batch) + { + var p = study.Storage.GetTrial(t.TrialId).Params; + study.Tell(t, (double)p["x"]! * (double)p["x"]! + ((string)p["c"]! == "u" ? 0.0 : 1.0)); + } + } + return Dump(study); + } + + Run(cold: false).Should().Be(Run(cold: true)); + } + + /// <summary> + /// A range that changes on every trial makes a new column per distribution; the cache must stay within + /// <see cref="TpeObservationCache.MaxColumns" /> by starting over, and the study must equal the cold run. + /// </summary> + [TestMethod] + public void EverChangingRange_StaysBounded_AndEqualsColdCache() + { + int maxSeen = 0; + string Run(bool cold) + { + var sampler = new TPESampler(seed: 4, nStartupTrials: 3); + var study = Optuna.CreateStudy(sampler: sampler); + study.Optimize(t => + { + if (cold) + sampler.ObservationCache.Reset(); + double x = t.SuggestFloat("x", 0, 1 + t.Number); + maxSeen = Math.Max(maxSeen, sampler.ObservationCache.ColumnCount); + return x; + }, nTrials: 400); + return Dump(study); + } + + Run(cold: false).Should().Be(Run(cold: true)); + maxSeen.Should().BeLessThanOrEqualTo(TpeObservationCache.MaxColumns); + } + + /// <summary> + /// One sampler reused for a second study (trial numbers start over) gives the second study exactly what a new sampler + /// with the same seed state would: the cache must start over when the study changes. + /// </summary> + [TestMethod] + public void SecondStudy_StartsTheCacheOver() + { + var reused = new TPESampler(seed: 8, nStartupTrials: 3); + var first = Optuna.CreateStudy(sampler: reused); + first.Optimize(t => Math.Pow(t.SuggestFloat("x", -2, 2) - 1, 2), nTrials: 40); + var second = Optuna.CreateStudy(sampler: reused); + second.Optimize(t => Math.Pow(t.SuggestFloat("x", -2, 2) + 1, 2), nTrials: 40); + + // The same sequence with the cache emptied before every suggestion: identical, so nothing carried over. + var cold = new TPESampler(seed: 8, nStartupTrials: 3); + var coldFirst = Optuna.CreateStudy(sampler: cold); + coldFirst.Optimize(t => { cold.ObservationCache.Reset(); return Math.Pow(t.SuggestFloat("x", -2, 2) - 1, 2); }, nTrials: 40); + var coldSecond = Optuna.CreateStudy(sampler: cold); + coldSecond.Optimize(t => { cold.ObservationCache.Reset(); return Math.Pow(t.SuggestFloat("x", -2, 2) + 1, 2); }, nTrials: 40); + + Dump(first).Should().Be(Dump(coldFirst)); + Dump(second).Should().Be(Dump(coldSecond)); + } + + /// <summary> + /// A live study never makes the cache start over on a trial's identity: every finished trial it reads again is the + /// trial its row was read from. A false alarm would not change results, only throw the cache away, so this guards + /// the speed-up: both TPE modes, plain and compact storage, dynamic ranges, a conditional parameter, pruned trials, + /// then constant liar with trials still running (asked three at a time, told three at a time). + /// </summary> + /// <param name="multivariate">Whether TPE models the parameters jointly.</param> + /// <param name="compact">Whether the storage keeps finished trials compact (plan 13, item S12).</param> + [TestMethod] + [DataRow(false, false)] + [DataRow(true, false)] + [DataRow(false, true)] + [DataRow(true, true)] + public void LiveStudy_NeverStartsOverOnATrialsIdentity(bool multivariate, bool compact) + { + var sampler = new TPESampler(seed: 21, multivariate: multivariate, nStartupTrials: 5, constantLiar: true); + var study = Optuna.CreateStudy(storage: new InMemoryStorage(compactFinishedTrials: compact), sampler: sampler); + study.Optimize(t => Objective(t, () => { }), nTrials: 80); + for (int round = 0; round < 10; round++) + { + var batch = new List<Trial>(); + for (int i = 0; i < 3; i++) + { + var t = study.Ask(); + t.SuggestFloat("x", -5, 5); + t.SuggestCategorical("c", new[] { "a", "b", "c" }); + batch.Add(t); + } + foreach (var t in batch) + study.Tell(t, 1.0); + } + + sampler.ObservationCache.IdentityRestarts.Should().Be(0, "every trial number still carries the trial cached under it"); + sampler.ObservationCache.ColumnCount.Should().BeGreaterThan(0, "the run read its history through the cache"); + } + + /// <summary> + /// The identity rule on its own. The end-to-end case (a study deleted and recreated under a reused SQLite id behind + /// a gRPC proxy) is <c>GrpcStorageProxyTests.Tpe_ReusedOnARecreatedStudyUnderTheSameId_SamplesAsUnderANewId</c> in + /// the storage suite. With the same storage object and study id, a trial carrying a cached number must be the trial + /// the row was read from: the same storage id with a later start (SQLite reuses trial ids too) or another storage + /// id makes the cache start over before anything is read, while an unknown start time is not a difference. + /// </summary> + [TestMethod] + public void TrialNumbersCarryingOtherTrials_StartTheCacheOver() + { + var sampler = new TPESampler(seed: 3, nStartupTrials: 3, multivariate: false); + var study = Optuna.CreateStudy(sampler: sampler); + double Objective1(Trial t) => Math.Pow(t.SuggestFloat("x", -2, 2) - 1, 2); + study.Optimize(Objective1, nTrials: 30); + TpeObservationCache cache = sampler.ObservationCache; + var names = new[] { "x" }; + var distributions = new BaseDistribution[] { new FloatDistribution(-2, 2) }; + IReadOnlyList<FrozenTrial> live = study.GetTrials(deepcopy: false); + + TpeObservationCache.Column column = cache.ColumnsFor(study, live, names, distributions)[0]; + cache.IdentityRestarts.Should().Be(0, "the live trials are the ones the rows were read from"); + // The last trial finished after the last sampling, so no ask has read (or cached) it yet. + live.Where(t => t.Number < live.Count - 1).Should() + .OnlyContain(t => column.StateOf(t.Number) == TpeObservationCache.Present, "every row read stays cached"); + + cache.ColumnsFor(study, Rebuilt(live, idShift: 0, startShift: null), names, distributions); + cache.IdentityRestarts.Should().Be(0, "an unknown start time on one side is not a difference"); + + column = cache.ColumnsFor(study, Rebuilt(live, idShift: 0, startShift: TimeSpan.FromSeconds(5)), names, distributions)[0]; + cache.IdentityRestarts.Should().Be(1, "the same storage ids started later: a recreated study under reused ids"); + live.Should().OnlyContain(t => column.StateOf(t.Number) == TpeObservationCache.Unknown, "no old row may be read"); + + // Sampling fills the cache again from the live trials, which are consistent with it. + study.Optimize(Objective1, nTrials: 5); + cache.IdentityRestarts.Should().Be(1); + column = cache.ColumnsFor(study, Rebuilt(study.GetTrials(deepcopy: false), idShift: 1000, startShift: TimeSpan.Zero), names, distributions)[0]; + cache.IdentityRestarts.Should().Be(2, "other storage ids under the cached numbers: another study's trials"); + column.StateOf(0).Should().Be(TpeObservationCache.Unknown); + } + + /// <summary> + /// Copies of <paramref name="trials" /> with the same numbers and the storage ids and start times changed, the way + /// a study recreated under a reused id presents its own trials; parameters are left out (the identity check reads + /// only the number, the storage id and the start time). + /// </summary> + /// <param name="trials">The trials to copy.</param> + /// <param name="idShift">Added to each storage id.</param> + /// <param name="startShift">Added to each start time; <see langword="null" /> gives the copies no start time.</param> + /// <returns>The copies, in the same order.</returns> + private static List<FrozenTrial> Rebuilt(IReadOnlyList<FrozenTrial> trials, int idShift, TimeSpan? startShift) + => trials.Select(t => + { + DateTime? start = startShift is { } shift ? t.DatetimeStart!.Value + shift : null; + return new FrozenTrial( + t.Number, start is null ? TrialState.Waiting : TrialState.Complete, start is null ? null : 1.0, + start, start, new OrderedDict<string, object?>(), new OrderedDict<string, BaseDistribution>(), + new OrderedDict<string, object?>(), new OrderedDict<string, object?>(), new OrderedDict<long, double>(), + t.TrialId + idShift); + }).ToList(); + + /// <summary> + /// The cache holds the storage it answers for weakly, as <c>PerStudyState</c> holds its storages: a long-lived + /// sampler (a DI singleton, say) must not keep the last storage it served, and every trial in it, alive. + /// </summary> + [TestMethod] + public void Cache_DoesNotKeepTheStorageAlive() + { + var cache = new TpeObservationCache(); + WeakReference storage = AnswerForAStudyThatGoesAway(cache); + GC.Collect(); + GC.WaitForPendingFinalizers(); + GC.Collect(); + storage.IsAlive.Should().BeFalse("only the cache referred to the storage, and it holds it weakly"); + } + + /// <summary> + /// Makes <paramref name="cache" /> answer for a study whose storage nothing else keeps; not inlined, so no local of + /// this frame outlives the call. + /// </summary> + /// <param name="cache">The cache under test.</param> + /// <returns>A weak reference to the study's storage.</returns> + [MethodImpl(MethodImplOptions.NoInlining)] + private static WeakReference AnswerForAStudyThatGoesAway(TpeObservationCache cache) + { + var storage = new InMemoryStorage(); + var study = Optuna.CreateStudy(storage: storage); + cache.ColumnsFor(study, Array.Empty<FrozenTrial>(), new[] { "x" }, new BaseDistribution[] { new FloatDistribution(0, 1) }); + cache.ColumnCount.Should().Be(1); + return new WeakReference(storage); + } + + /// <summary> + /// <see cref="SamplerConcurrency.PerWorker" />: every worker instance owns its observation cache, so workers never + /// share one, and the study's own sampler (the prototype) samples nothing while the workers run, so its cache + /// stays empty (THREADING.md §6). + /// </summary> + [TestMethod] + public void WorkerInstances_OwnTheirCaches_AndThePrototypesStaysUnused() + { + var prototype = new TPESampler(seed: 2, nStartupTrials: 4, multivariate: false); + var a = (TPESampler)prototype.CreateWorkerInstance()!; + var b = (TPESampler)prototype.CreateWorkerInstance()!; + a.ObservationCache.Should().NotBeSameAs(b.ObservationCache); + a.ObservationCache.Should().NotBeSameAs(prototype.ObservationCache); + b.ObservationCache.Should().NotBeSameAs(prototype.ObservationCache); + + var study = Optuna.CreateStudy(sampler: prototype); + study.Optimize(t => Math.Pow(t.SuggestFloat("x", -2, 2), 2) + t.SuggestFloat("y", -2, 2), nTrials: 64, nJobs: 8, + executorOptions: new TrialExecutorOptions { SamplerConcurrency = SamplerConcurrency.PerWorker }); + study.Trials.Should().HaveCount(64).And.OnlyContain(t => t.State == TrialState.Complete); + prototype.ObservationCache.ColumnCount.Should().Be(0, "only the workers' own instances sampled"); + } + + /// <summary> + /// One TPE instance shared by eight workers (the default <see cref="SamplerConcurrency.Shared" />), constant liar + /// on, so each ask reads finished and running trials while other trials finish: afterwards every row the cache holds + /// is exactly the value its finished trial converts to, or that trial's lack of the parameter, and no identity + /// restart happened. Sampling runs under the sampler's monitor; a race on the cache would leave a torn or misplaced + /// row here. + /// </summary> + [TestMethod] + public void SharedByEightWorkers_EveryCachedRowIsItsTrialsOwnValue() + { + var sampler = new TPESampler(seed: 17, nStartupTrials: 6, multivariate: false, constantLiar: true); + var study = Optuna.CreateStudy(sampler: sampler); + study.Optimize(t => Objective(t, () => { }), nTrials: 240, nJobs: 8); + + TpeObservationCache cache = sampler.ObservationCache; + cache.IdentityRestarts.Should().Be(0); + List<FrozenTrial> finished = study.GetTrials(deepcopy: false).Where(t => t.State.IsFinished()).ToList(); + int checkedRows = 0; + foreach (var (name, distribution) in finished.SelectMany(t => t.Distributions).Select(kv => (kv.Key, kv.Value)).Distinct().ToList()) + { + TpeObservationCache.Column column = cache.ColumnsFor(study, finished, new[] { name }, new[] { distribution })[0]; + foreach (FrozenTrial trial in finished) + { + byte state = column.StateOf(trial.Number); + if (state == TpeObservationCache.Present) + { + trial.Params.ContainsKey(name).Should().BeTrue($"trial {trial.Number} has a cached {name}"); + BitConverter.DoubleToInt64Bits(column.ValueOf(trial.Number)).Should().Be( + BitConverter.DoubleToInt64Bits(distribution.ToInternalRepr(trial.Params[name])), + $"trial {trial.Number}'s {name} under {distribution}"); + checkedRows++; + } + else if (state == TpeObservationCache.Absent) + { + trial.Params.ContainsKey(name).Should().BeFalse($"trial {trial.Number} is cached as lacking {name}"); + checkedRows++; + } + } + } + checkedRows.Should().BeGreaterThan(500, "the run cached most of its history"); + } +} diff --git a/test/OptunaSharp.Tests/Samplers/TpeSplitCacheTests.cs b/test/OptunaSharp.Tests/Samplers/TpeSplitCacheTests.cs new file mode 100644 index 0000000..542b8b2 --- /dev/null +++ b/test/OptunaSharp.Tests/Samplers/TpeSplitCacheTests.cs @@ -0,0 +1,269 @@ +using System; +using System.Collections.Generic; +using System.Linq; +using AwesomeAssertions; +using OptunaSharp.Distributions; +using OptunaSharp.Internal; +using OptunaSharp.Samplers; +using OptunaSharp.Storages; + +namespace OptunaSharp.Tests.Samplers; + +/// <summary> +/// Plan 13 (docs/plans/13-rustuna-derived-performance.md), item S5: TPE reuses its last below/above split while the +/// same trial records are split again, which independent TPE does once per parameter; and item S3 for TPE: the +/// constant-liar history read skips the trial being sampled without reading its record. The cache returns exactly +/// what <see cref="TpeTrialSplit.SplitTrials" /> returns, and it is reused only for the very same records of the +/// same study with the same size of the preferred group. +/// </summary> +[TestClass] +public class TpeSplitCacheTests +{ + /// <summary> + /// One- and two-objective histories with completed, pruned, failed-constraint and running trials: the cache's + /// split equals <see cref="TpeTrialSplit.SplitTrials" /> for every size of the preferred group, and splitting the + /// same records again reuses it. + /// </summary> + /// <param name="seed">Seeds the history.</param> + /// <param name="objectives">The number of objectives of the history's study.</param> + [TestMethod] + [DataRow(1, 2)] + [DataRow(2, 2)] + [DataRow(3, 2)] + [DataRow(1, 1)] + [DataRow(2, 1)] + [DataRow(3, 1)] + public void TheCachedSplit_IsSplitTrials_AndTheSameRecordsReuseIt(int seed, int objectives) + { + Study study = History(seed, objectives, out List<FrozenTrial> trials); + var cache = new TpeSplitCache(); + int computed = 0; + for (int nBelow = 0; nBelow <= trials.Count(t => t.State != TrialState.Running); nBelow++) + { + var (below, above) = cache.Split(study, trials, nBelow); + cache.Computed.Should().Be(++computed, "a new size of the preferred group is a new split"); + var (expectedBelow, expectedAbove) = TpeTrialSplit.SplitTrials(study, trials, nBelow); + below.Select(t => t.Number).Should().Equal(expectedBelow.Select(t => t.Number), $"below, n_below={nBelow}"); + above.Select(t => t.Number).Should().Equal(expectedAbove.Select(t => t.Number), $"above, n_below={nBelow}"); + + var (againBelow, againAbove) = cache.Split(study, trials.ToList(), nBelow); + cache.Computed.Should().Be(computed, "the same records, in a new list, reuse the split"); + againBelow.Select(t => t.Number).Should().Equal(below.Select(t => t.Number)); + againAbove.Select(t => t.Number).Should().Equal(above.Select(t => t.Number)); + } + } + + /// <summary> + /// Anything but the very same records misses: one record more or less, the records in another order, a running + /// trial whose record was replaced by a write after it was read, the same history shape in another study. + /// </summary> + [TestMethod] + public void AnythingButTheSameRecords_SplitsAfresh() + { + Study study = History(4, 2, out List<FrozenTrial> trials); + var cache = new TpeSplitCache(); + int nBelow = 3; + cache.Split(study, trials, nBelow); + cache.Computed.Should().Be(1); + + cache.Split(study, trials.Take(trials.Count - 1).ToList(), nBelow); + cache.Computed.Should().Be(2, "one record fewer"); + cache.Split(study, Enumerable.Reverse(trials).ToList(), nBelow); + cache.Computed.Should().Be(3, "another order"); + cache.Split(study, trials, nBelow); + cache.Computed.Should().Be(4, "back to the original records: the cache holds the last split only"); + + // A running trial written after it was read gets a new record (in-memory item S4 copies a handed-out record). + FrozenTrial running = trials.First(t => t.State == TrialState.Running); + study.Storage.SetTrialUserAttr(running.TrialId, "written", 1L); + List<FrozenTrial> reread = study.GetTrials(deepcopy: false, + states: new[] { TrialState.Complete, TrialState.Pruned, TrialState.Running }); + reread.Should().NotContain(t => ReferenceEquals(t, running)); + cache.Split(study, reread, nBelow); + cache.Computed.Should().Be(5, "the running trial's record changed"); + + Study other = History(4, 2, out List<FrozenTrial> otherTrials); + cache.Split(other, otherTrials, nBelow); + cache.Computed.Should().Be(6, "another study's records, even with the same values"); + } + + /// <summary>The lists the cache returns are the caller's: changing them leaves the next reuse intact.</summary> + [TestMethod] + public void TheReturnedLists_AreCopies() + { + Study study = History(5, 2, out List<FrozenTrial> trials); + var cache = new TpeSplitCache(); + var (below, above) = cache.Split(study, trials, 4); + int[] belowNumbers = below.Select(t => t.Number).ToArray(); + int[] aboveNumbers = above.Select(t => t.Number).ToArray(); + below.Clear(); + above.Reverse(); + + var (againBelow, againAbove) = cache.Split(study, trials, 4); + cache.Computed.Should().Be(1); + againBelow.Select(t => t.Number).Should().Equal(belowNumbers); + againAbove.Select(t => t.Number).Should().Equal(aboveNumbers); + } + + /// <summary>Null arguments are refused before anything is cached.</summary> + [TestMethod] + public void NullArguments_AreRefused() + { + Study study = History(6, 2, out List<FrozenTrial> trials); + var cache = new TpeSplitCache(); + Action noStudy = () => cache.Split(null!, trials, 1); + Action noTrials = () => cache.Split(study, null!, 1); + noStudy.Should().Throw<ArgumentNullException>(); + noTrials.Should().Throw<ArgumentNullException>(); + cache.Computed.Should().Be(0); + } + + /// <summary> + /// A multi-objective study sampled by independent TPE splits its history once per trial, not once per parameter: + /// every parameter of a trial reads the same records. Constant liar is on (Optuna 5's default), so this also shows + /// the read leaves the trial being sampled out without touching its record: a read of it would change its record + /// at the next suggestion and make every parameter split afresh. + /// </summary> + [TestMethod] + public void IndependentMultiObjectiveTpe_SplitsOncePerTrial_NotOncePerParameter() + { + var sampler = new TPESampler(seed: 3, nStartupTrials: 5); + var storage = new InMemoryStorage(); + Study study = Optuna.CreateStudy(storage: storage, sampler: sampler, + directions: new[] { StudyDirection.Minimize, StudyDirection.Minimize }); + const int trials = 25, parameters = 8; + study.Optimize(t => + { + double a = 0, b = 0; + for (int i = 0; i < parameters; i++) + { + double v = t.SuggestFloat($"x{i}", -5, 5); + a += v * v; + b += (v - 1) * (v - 1); + } + return new[] { a, b }; + }, nTrials: trials); + + sampler.SplitCache.Computed.Should().Be(trials - 5, "one split per trial after the startup trials"); + study.Trials.Should().HaveCount(trials).And.OnlyContain(t => t.State == TrialState.Complete); + } + + /// <summary> + /// With another worker's trial running, constant liar still sees it, and still leaves out the trial being sampled: + /// the history the sampler splits is every finished trial plus the other running one. + /// </summary> + [TestMethod] + public void ConstantLiar_SeesOtherRunningTrials_AndLeavesOutTheCurrentOne() + { + var sampler = new TPESampler(seed: 4, nStartupTrials: 3); + Study study = Optuna.CreateStudy(storage: new InMemoryStorage(), sampler: sampler, + directions: new[] { StudyDirection.Minimize, StudyDirection.Minimize }); + study.Optimize(t => new[] { t.SuggestFloat("x", 0, 1), t.SuggestFloat("y", 0, 1) }, nTrials: 6); + + Trial otherWorker = study.Ask(); + otherWorker.SuggestFloat("x", 0, 1); + Trial current = study.Ask(); + int before = sampler.SplitCache.Computed; + current.SuggestFloat("x", 0, 1); + current.SuggestFloat("y", 0, 1); + + sampler.SplitCache.Computed.Should().Be(before + 1, "both parameters of the current trial split the same records"); + // The running trial the other worker holds is in the history; the current trial is not: 6 finished + 1 running. + var (below, above) = TpeTrialSplit.SplitTrials(study, + study.GetTrials(deepcopy: false, states: new[] { TrialState.Complete, TrialState.Pruned, TrialState.Running }) + .Where(t => t.Number != current.Number).ToList(), TpeTrialSplit.DefaultGammaMultiObjective(6)); + (below.Count + above.Count).Should().Be(7); + above.Should().Contain(t => t.Number == otherWorker.Number); + study.Tell(otherWorker, new[] { 0.5, 0.5 }); + study.Tell(current, new[] { 0.5, 0.5 }); + } + + /// <summary> + /// A two-objective history with a pruned trial that reported a number does not split, as Optuna's TPE fails on it: + /// the pruned-trial score reads <c>study.direction</c>, which raises for a multi-objective study (QA-79). The cache + /// stores nothing then, so its previous entry is still reused. + /// </summary> + [TestMethod] + public void AMultiObjectivePrunedReport_RaisesLikeOptuna_AndIsNotCached() + { + Study study = History(7, 2, out List<FrozenTrial> trials); + var cache = new TpeSplitCache(); + cache.Split(study, trials, 3); + cache.Computed.Should().Be(1); + + // A finished trial's reports cannot change, so a new pruned trial carries the report. + int id = study.Storage.CreateNewTrial(study.StudyId); + study.Storage.SetTrialParam(id, "x", 0.5, new FloatDistribution(0, 1)); + study.Storage.SetTrialIntermediateValue(id, 3, 0.25); + study.Storage.SetTrialStateValues(id, TrialState.Pruned); + List<FrozenTrial> reread = study.GetTrials(deepcopy: false, + states: new[] { TrialState.Complete, TrialState.Pruned, TrialState.Running }); + + Action split = () => cache.Split(study, reread, 3); + split.Should().ThrowExactly<NumSharp.RuntimeError>().WithMessage( + "A single direction cannot be retrieved from a multi-objective study. Consider using Study.directions to " + + "retrieve a list containing all directions."); + cache.Computed.Should().Be(1, "a split that throws is not stored"); + cache.Split(study, trials, 3); + cache.Computed.Should().Be(1, "the previous records still reuse their split"); + } + + /// <summary>A worker instance for <see cref="SamplerConcurrency.PerWorker" /> gets a split cache of its own.</summary> + [TestMethod] + public void AWorkerInstance_HasItsOwnSplitCache() + { + var sampler = new TPESampler(seed: 1); + var worker = (TPESampler)sampler.CreateWorkerInstance()!; + worker.SplitCache.Should().NotBeSameAs(sampler.SplitCache); + } + + /// <summary> + /// A one- or two-objective study on an in-memory storage with 14 finished trials (completed, pruned with and + /// without intermediate values, completed but infeasible) and 2 running ones, and the records TPE's constant-liar + /// read returns for it. + /// </summary> + /// <param name="seed">Seeds the values.</param> + /// <param name="objectives">1 (minimize) or 2 (minimize, maximize).</param> + /// <param name="trials">The study's completed, pruned and running records, by trial number.</param> + /// <returns>The study.</returns> + /// <remarks> + /// A two-objective history's pruned trials report NaN: it is the only report a multi-objective TPE split accepts, + /// because a number makes Optuna read <c>study.direction</c>, which raises (QA-79), while NaN scores + /// <c>(-step, inf)</c> before the direction is read. A one-objective history's reports are numbers. + /// </remarks> + private static Study History(int seed, int objectives, out List<FrozenTrial> trials) + { + var rng = new Random(seed); + Study study = Optuna.CreateStudy(storage: new InMemoryStorage(), + directions: objectives == 1 + ? new[] { StudyDirection.Minimize } + : new[] { StudyDirection.Minimize, StudyDirection.Maximize }); + var storage = study.Storage; + for (int n = 0; n < 16; n++) + { + int id = storage.CreateNewTrial(study.StudyId); + storage.SetTrialParam(id, "x", rng.NextDouble(), new FloatDistribution(0, 1)); + if (n % 8 == 7) + continue; // stays running + if (n % 5 == 4) + { + if (n % 2 == 0) + { + double report = rng.NextDouble(); // drawn either way, so both histories share their other values + storage.SetTrialIntermediateValue(id, n, objectives == 1 ? report : double.NaN); + } + storage.SetTrialStateValues(id, TrialState.Pruned); + continue; + } + if (n % 6 == 5) + storage.SetTrialSystemAttr(id, "constraints", new List<object?> { 0.5 + rng.NextDouble() }); + // Values on a small grid, so ranks and ties are plentiful. + double first = Math.Round(rng.NextDouble() * 4) / 4, second = Math.Round(rng.NextDouble() * 4) / 4; + storage.SetTrialStateValues(id, TrialState.Complete, + objectives == 1 ? new[] { first } : new[] { first, second }); + } + trials = study.GetTrials(deepcopy: false, + states: new[] { TrialState.Complete, TrialState.Pruned, TrialState.Running }); + return study; + } +} diff --git a/test/OptunaSharp.Tests/Samplers/TpeTrialSplitSortTests.cs b/test/OptunaSharp.Tests/Samplers/TpeTrialSplitSortTests.cs new file mode 100644 index 0000000..99788e4 --- /dev/null +++ b/test/OptunaSharp.Tests/Samplers/TpeTrialSplitSortTests.cs @@ -0,0 +1,112 @@ +using System; +using System.Collections.Generic; +using System.Linq; +using AwesomeAssertions; +using OptunaSharp.Collections; +using OptunaSharp.Distributions; +using OptunaSharp.Internal; + +namespace OptunaSharp.Tests.Samplers; + +/// <summary> +/// Plan 15 (docs/plans/15-performance-pass-3.md), step F: TPE's single-objective split sorts (value, position) structs +/// instead of LINQ's stable <c>OrderBy</c>, builds both sides at their final sizes, sorts them by number on primitive +/// keys, and scores a trial without constraints without building its constraints dictionary. The split must be the +/// same lists in the same order; each test compares it with the replaced code, written out here. +/// </summary> +[TestClass] +public class TpeTrialSplitSortTests +{ + /// <summary> + /// Shuffled histories whose values come from a small pool, so ties are everywhere, with both zeros, both + /// infinities and NaN in the pool: for both directions and every size of the preferred group, the split equals the + /// LINQ stable sort, cut in two and sorted by number, trial for trial. + /// </summary> + /// <param name="seed">Seeds the history.</param> + [TestMethod] + [DataRow(1)] + [DataRow(2)] + [DataRow(3)] + public void SingleObjectiveSplit_MatchesTheLinqStableSort_TrialForTrial(int seed) + { + var rng = new Random(seed); + double[] pool = { -1.0, -0.0, 0.0, 0.5, 2.0, double.PositiveInfinity, double.NegativeInfinity, double.NaN, 1e-300 }; + int n = 60; + var numbers = Enumerable.Range(0, n).OrderBy(_ => rng.Next()).ToArray(); + var trials = new List<FrozenTrial>(n); + foreach (int number in numbers) + trials.Add(Trial(number, pool[rng.Next(pool.Length)])); + + foreach (StudyDirection direction in new[] { StudyDirection.Minimize, StudyDirection.Maximize }) + { + Study study = Optuna.CreateStudy(direction: direction); + for (int nBelow = 0; nBelow <= n; nBelow += 7) + { + var (below, above) = TpeTrialSplit.SplitTrials(study, trials, nBelow); + var (expectedBelow, expectedAbove) = ReplacedSplit(trials, direction, nBelow); + below.Select(t => t.Number).Should().Equal(expectedBelow.Select(t => t.Number), $"{direction}, n_below={nBelow}"); + above.Select(t => t.Number).Should().Equal(expectedAbove.Select(t => t.Number), $"{direction}, n_below={nBelow}"); + } + } + } + + /// <summary> + /// A trial with a constraint, in the per-key format or the old list format, still scores as infeasible and goes + /// above; the fast path only skips trials that record no constraint at all. + /// </summary> + [TestMethod] + public void InfeasibleTrials_StillScoreThroughTheirConstraints() + { + Study study = Optuna.CreateStudy(); + var trials = new List<FrozenTrial> + { + Trial(0, 1.0), + Trial(1, 0.5, new OrderedDict<string, object?> { ["constraints:c"] = 2.0 }), + Trial(2, 0.25, new OrderedDict<string, object?> { ["constraints"] = new List<object?> { 3.0, -1.0 } }), + Trial(3, 2.0, new OrderedDict<string, object?> { ["constraints:c"] = -1.0 }), + }; + + var (below, above) = TpeTrialSplit.SplitTrials(study, trials, 2); + + // The feasible trials 0 and 3 are the preferred two (values 1.0 and 2.0); 1 and 2 violate a constraint. + below.Select(t => t.Number).Should().Equal(0, 3); + above.Select(t => t.Number).Should().Equal(1, 2); + } + + /// <summary> + /// The single-objective split before plan 15, for complete trials: LINQ's stable sort by value (descending for a + /// maximized objective), the first <paramref name="nBelow" /> below and the rest above, each sorted by number. + /// </summary> + /// <param name="trials">The complete trials.</param> + /// <param name="direction">The objective's direction.</param> + /// <param name="nBelow">The size of the preferred group.</param> + /// <returns>The two sides.</returns> + private static (List<FrozenTrial> Below, List<FrozenTrial> Above) ReplacedSplit( + List<FrozenTrial> trials, StudyDirection direction, int nBelow) + { + nBelow = Math.Min(nBelow, trials.Count); + var sorted = direction == StudyDirection.Minimize + ? trials.OrderBy(t => t.Value!.Value).ToList() + : trials.OrderByDescending(t => t.Value!.Value).ToList(); + var below = sorted.Take(nBelow).ToList(); + var above = sorted.Skip(nBelow).ToList(); + below.Sort((a, b) => a.Number.CompareTo(b.Number)); + above.Sort((a, b) => a.Number.CompareTo(b.Number)); + return (below, above); + } + + /// <summary>A complete trial with the given number, value and system attributes.</summary> + /// <param name="number">The trial number.</param> + /// <param name="value">The objective value.</param> + /// <param name="systemAttrs">The system attributes, where constraints are recorded; none when null.</param> + /// <returns>The trial.</returns> + private static FrozenTrial Trial(int number, double value, OrderedDict<string, object?>? systemAttrs = null) + { + var parameters = new OrderedDict<string, object?>(); + var distributions = new OrderedDict<string, BaseDistribution>(); + var userAttrs = new OrderedDict<string, object?>(); + var intermediateValues = new OrderedDict<long, double>(); + return new FrozenTrial(number, TrialState.Complete, value, DateTime.UnixEpoch, DateTime.UnixEpoch, parameters, + distributions, userAttrs, systemAttrs ?? new OrderedDict<string, object?>(), intermediateValues, number); + } +} diff --git a/test/OptunaSharp.Tests/Samplers/ZeroCopyHistoryReadTests.cs b/test/OptunaSharp.Tests/Samplers/ZeroCopyHistoryReadTests.cs new file mode 100644 index 0000000..c1fd305 --- /dev/null +++ b/test/OptunaSharp.Tests/Samplers/ZeroCopyHistoryReadTests.cs @@ -0,0 +1,151 @@ +using System.Collections.Generic; +using System.Linq; +using AwesomeAssertions; +using OptunaSharp.Collections; +using OptunaSharp.Distributions; +using OptunaSharp.Samplers; +using OptunaSharp.SearchSpace; +using OptunaSharp.Storages; + +namespace OptunaSharp.Tests.Samplers; + +/// <summary> +/// Plan 13 (docs/plans/13-rustuna-derived-performance.md), item S3 for the QMC sampler and the group-decomposed +/// search space: both now scan the history through <c>Study.GetTrialsForSampler</c> (the zero-copy view in memory) +/// instead of a copied, filtered list, and QMC stops at the first match instead of sorting. Each test builds a history +/// with trials finished out of order and in every state, and compares the result with Optuna's read, done the way +/// Optuna does it: copy, filter by state, sort by number. +/// </summary> +[TestClass] +public class ZeroCopyHistoryReadTests +{ + /// <summary> + /// QMC's relative search space is the distributions of the lowest-numbered COMPLETE or PRUNED trial, whatever + /// order the trials finished in and whatever states lie before it. + /// </summary> + /// <param name="firstFinishedState">The state the lowest-numbered finished trial ends in.</param> + [TestMethod] + [DataRow(TrialState.Complete)] + [DataRow(TrialState.Pruned)] + public void Qmc_TheSearchSpaceComesFromTheLowestNumberedFinishedTrial(TrialState firstFinishedState) + { + var sampler = new QMCSampler(seed: 1, warnIndependentSampling: false); + Study study = Optuna.CreateStudy(storage: new InMemoryStorage(), sampler: sampler); + BaseStorage storage = study.Storage; + + int running = storage.CreateNewTrial(study.StudyId); // number 0, never finishes + storage.SetTrialParam(running, "a", 0.5, new FloatDistribution(0, 1)); + int failed = storage.CreateNewTrial(study.StudyId); // number 1, fails + storage.SetTrialParam(failed, "b", 0.5, new FloatDistribution(0, 1)); + storage.SetTrialStateValues(failed, TrialState.Fail); + int late = storage.CreateNewTrial(study.StudyId); // number 2, finishes after number 3 + storage.SetTrialParam(late, "x", 0.5, new FloatDistribution(0, 1)); + storage.SetTrialParam(late, "y", 2, new IntDistribution(0, 5)); + int early = storage.CreateNewTrial(study.StudyId); // number 3, finishes first + storage.SetTrialParam(early, "z", 0.5, new FloatDistribution(0, 2)); + storage.SetTrialStateValues(early, TrialState.Complete, new[] { 1.0 }); + storage.SetTrialStateValues(late, firstFinishedState, firstFinishedState == TrialState.Complete ? new[] { 2.0 } : null); + + FrozenTrial current = storage.GetTrial(storage.CreateNewTrial(study.StudyId)); + OrderedDict<string, BaseDistribution> space = sampler.InferRelativeSearchSpace(study, current); + + // Optuna: sorted(study._get_trials(deepcopy=False, states=(COMPLETE, PRUNED)), key=number)[0].distributions. + FrozenTrial expected = study.GetTrials(deepcopy: false, states: new[] { TrialState.Complete, TrialState.Pruned }) + .OrderBy(t => t.Number).First(); + expected.TrialId.Should().Be(late); + space.Keys.Should().Equal(expected.Distributions.Keys); + foreach (var (name, distribution) in expected.Distributions) + space[name].Should().BeSameAs(distribution); + } + + /// <summary> + /// Before any trial finished, QMC still takes the union of the running trials' distributions, as Optuna does for + /// the initial trial, and an empty space when nothing is running either. + /// </summary> + [TestMethod] + public void Qmc_BeforeAnyTrialFinished_UsesTheRunningTrials() + { + // Two studies: the running-trial read uses the per-thread cache, which lives until the next Ask, so one study + // per question keeps each answer about the history built for it. + var empty = new QMCSampler(seed: 2, warnIndependentSampling: false); + Study bare = Optuna.CreateStudy(storage: new InMemoryStorage(), sampler: empty); + FrozenTrial nothing = bare.Storage.GetTrial(bare.Storage.CreateNewTrial(bare.StudyId)); + empty.InferRelativeSearchSpace(bare, nothing).Should().BeEmpty(); + + var sampler = new QMCSampler(seed: 2, warnIndependentSampling: false); + Study study = Optuna.CreateStudy(storage: new InMemoryStorage(), sampler: sampler); + BaseStorage storage = study.Storage; + int first = storage.CreateNewTrial(study.StudyId); + storage.SetTrialParam(first, "x", 0.5, new FloatDistribution(0, 1)); + int other = storage.CreateNewTrial(study.StudyId); + storage.SetTrialParam(other, "x", 0.5, new FloatDistribution(0, 1)); + storage.SetTrialParam(other, "y", 0.5, new FloatDistribution(0, 1)); + FrozenTrial current = storage.GetTrial(storage.CreateNewTrial(study.StudyId)); + sampler.InferRelativeSearchSpace(study, current).Keys.Should().Equal("x", "y"); + } + + /// <summary> + /// The group-decomposed search space over a history with every state, parameters that come and go, and trials + /// finished out of order equals Optuna's decomposition of the copied, filtered history: the same groups, in the + /// same order, holding the same distribution objects, with and without pruned trials and with and without the + /// per-trial cache. + /// </summary> + /// <param name="includePruned">Whether pruned trials count.</param> + /// <param name="useCache">Whether the read may use the per-thread cache.</param> + [TestMethod] + [DataRow(false, false)] + [DataRow(false, true)] + [DataRow(true, false)] + [DataRow(true, true)] + public void GroupDecomposed_EqualsOptunasDecompositionOfTheFilteredHistory(bool includePruned, bool useCache) + { + Study study = Optuna.CreateStudy(storage: new InMemoryStorage()); + BaseStorage storage = study.Storage; + string[][] paramSets = + { + new[] { "a", "b" }, new[] { "a", "c" }, new[] { "d" }, new[] { "a", "b", "e" }, new[] { "c" }, + new[] { "f", "a" }, new[] { "b" }, new[] { "e", "d" }, + }; + TrialState[] finalStates = + { + TrialState.Complete, TrialState.Pruned, TrialState.Fail, TrialState.Complete, TrialState.Running, + TrialState.Pruned, TrialState.Complete, TrialState.Complete, + }; + var ids = new List<int>(); + for (int n = 0; n < paramSets.Length; n++) + { + int id = storage.CreateNewTrial(study.StudyId); + ids.Add(id); + foreach (string name in paramSets[n]) + storage.SetTrialParam(id, name, 0.5, new FloatDistribution(0, 1)); + } + // Finish in reverse order, so the finishing order disagrees with the trial numbers. + for (int n = paramSets.Length - 1; n >= 0; n--) + { + if (finalStates[n] == TrialState.Running) + continue; + storage.SetTrialStateValues(ids[n], finalStates[n], finalStates[n] == TrialState.Complete ? new[] { 1.0 } : null); + } + + var space = new GroupDecomposedSearchSpace(includePruned); + SearchSpaceGroup actual = space.Calculate(study, useCache); + + var expected = new SearchSpaceGroup(); + TrialState[] states = includePruned ? new[] { TrialState.Complete, TrialState.Pruned } : new[] { TrialState.Complete }; + foreach (FrozenTrial trial in study.GetTrials(deepcopy: false, states: states)) + expected.AddDistributions(trial.DistributionsDict); + + actual.SearchSpaces.Should().HaveCount(expected.SearchSpaces.Count); + for (int g = 0; g < expected.SearchSpaces.Count; g++) + { + actual.SearchSpaces[g].Keys.Should().Equal(expected.SearchSpaces[g].Keys, $"group {g}"); + foreach (var (name, distribution) in expected.SearchSpaces[g]) + actual.SearchSpaces[g][name].Should().BeSameAs(distribution); + } + + // A second call over the same history is the same decomposition, as Optuna's re-adding every trial is. + SearchSpaceGroup again = space.Calculate(study, useCache); + again.SearchSpaces.Select(s => string.Join(",", s.Keys)) + .Should().Equal(expected.SearchSpaces.Select(s => string.Join(",", s.Keys))); + } +} diff --git a/test/OptunaSharp.Tests/Storages/BulkAttributeWritesTests.cs b/test/OptunaSharp.Tests/Storages/BulkAttributeWritesTests.cs new file mode 100644 index 0000000..ab88d0b --- /dev/null +++ b/test/OptunaSharp.Tests/Storages/BulkAttributeWritesTests.cs @@ -0,0 +1,464 @@ +using System; +using System.Collections.Generic; +using System.IO; +using System.Linq; +using AwesomeAssertions; +using NumSharp; +using OptunaSharp.Collections; +using OptunaSharp.Distributions; +using OptunaSharp.Internal; +using OptunaSharp.Storages; +using OptunaSharp.Storages.Journal; + +namespace OptunaSharp.Tests.Storages; + +/// <summary> +/// Plan 13 (docs/plans/13-rustuna-derived-performance.md), item S8, the owner's choice of 2026-11-09: bulk attribute +/// writes under Rustuna's names (<c>SetTrialUserAttrs</c>, <c>SetStudyUserAttrs</c>, ...) and Optuna's +/// (<c>SetUserAttr(IReadOnlyDictionary)</c> overloads). A batch leaves exactly what one single write per entry leaves; +/// the built-in storages write it in one step and check first, so an unknown or finished target gets nothing; a +/// journal batch is ordinary single-key records, which Python's journal reader requires. +/// </summary> +[TestClass] +public class BulkAttributeWritesTests +{ + private static readonly StudyDirection[] Minimize = { StudyDirection.Minimize }; + + private readonly List<string> _paths = new(); + + /// <summary>Deletes the journal files the tests made; a file still held open is left for the temp cleanup.</summary> + [TestCleanup] + public void TearDown() + { + foreach (string path in _paths) + { + foreach (string file in Directory.GetFiles(Path.GetDirectoryName(path)!, Path.GetFileName(path) + "*")) + { + try + { + File.Delete(file); + } + catch (IOException) + { + } + } + } + } + + /// <summary>Attribute values of every JSON kind, in an order the batch must keep.</summary> + /// <returns>The attributes.</returns> + private static OrderedDict<string, object?> SampleAttrs() => new() + { + ["seed"] = 7L, + ["ratio"] = 0.25, + ["name"] = "run-a", + ["flag"] = true, + ["missing"] = null, + ["list"] = new List<object?> { 1L, "two", 3.5 }, + ["nested"] = new OrderedDict<string, object?> { ["k"] = new List<object?> { false } }, + }; + + /// <summary>A fresh storage of the named kind: <c>memory</c>, <c>journal</c> (a file), or <c>default</c> (the base loop).</summary> + /// <param name="kind">The storage kind.</param> + /// <returns>The storage.</returns> + /// <exception cref="ArgumentOutOfRangeException"><paramref name="kind" /> is not a known kind.</exception> + private BaseStorage Open(string kind) + { + switch (kind) + { + case "memory": + return new InMemoryStorage(); + case "journal": + { + string path = Path.Combine(Path.GetTempPath(), $"optunasharp-bulk-{Guid.NewGuid():N}.log"); + _paths.Add(path); + return new JournalStorage(new JournalFileBackend(path)); + } + case "default": + return new DelegatingStorage(new InMemoryStorage()); + default: + throw new ArgumentOutOfRangeException(nameof(kind), kind, "Unknown storage kind."); + } + } + + // ------------------------------------------------------------------ same result as single writes + + /// <summary> + /// For trial user and system attributes and study user and system attributes, a batch over attributes that + /// partly overwrite earlier ones leaves the same keys, in the same order, with the same values, as one single + /// write per entry. + /// </summary> + /// <param name="kind">The storage kind.</param> + [TestMethod] + [DataRow("memory")] + [DataRow("journal")] + [DataRow("default")] + public void ABatch_LeavesWhatOneSingleWritePerEntryLeaves(string kind) + { + BaseStorage bulk = Open(kind), single = Open(kind); + int bulkStudy = bulk.CreateNewStudy(Minimize, "s"), singleStudy = single.CreateNewStudy(Minimize, "s"); + int bulkTrial = bulk.CreateNewTrial(bulkStudy), singleTrial = single.CreateNewTrial(singleStudy); + foreach (BaseStorage storage in new[] { bulk, single }) + { + int trialId = storage == bulk ? bulkTrial : singleTrial; + int studyId = storage == bulk ? bulkStudy : singleStudy; + storage.SetTrialUserAttr(trialId, "name", "earlier"); + storage.SetTrialSystemAttr(trialId, "seed", 1L); + storage.SetStudyUserAttr(studyId, "flag", false); + storage.SetStudySystemAttr(studyId, "ratio", 9.0); + } + + OrderedDict<string, object?> attrs = SampleAttrs(); + bulk.SetTrialUserAttrs(bulkTrial, attrs); + bulk.SetTrialSystemAttrs(bulkTrial, attrs); + bulk.SetStudyUserAttrs(bulkStudy, attrs); + bulk.SetStudySystemAttrs(bulkStudy, attrs); + foreach (var (key, value) in attrs) + { + single.SetTrialUserAttr(singleTrial, key, value); + single.SetTrialSystemAttr(singleTrial, key, value); + single.SetStudyUserAttr(singleStudy, key, value); + single.SetStudySystemAttr(singleStudy, key, value); + } + + Describe(bulk.GetTrial(bulkTrial).UserAttrs).Should().Be(Describe(single.GetTrial(singleTrial).UserAttrs)); + Describe(bulk.GetTrial(bulkTrial).SystemAttrs).Should().Be(Describe(single.GetTrial(singleTrial).SystemAttrs)); + Describe(bulk.GetStudyUserAttrs(bulkStudy)).Should().Be(Describe(single.GetStudyUserAttrs(singleStudy))); + Describe(bulk.GetStudySystemAttrs(bulkStudy)).Should().Be(Describe(single.GetStudySystemAttrs(singleStudy))); + bulk.GetTrial(bulkTrial).UserAttrs.Keys.Should().Equal( + "name", "seed", "ratio", "flag", "missing", "list", "nested"); + } + + /// <summary> + /// The Optuna-name overloads take the same path: <c>SetUserAttr(IReadOnlyDictionary)</c> on a trial and a study, + /// and <c>SetTrialUserAttr(int, IReadOnlyDictionary)</c> and its three siblings on a storage. + /// </summary> + [TestMethod] + public void TheOptunaNameOverloads_WriteTheBatch() + { + var storage = new InMemoryStorage(); + Study study = Optuna.CreateStudy(storage: storage); + Trial trial = study.Ask(); + var attrs = new Dictionary<string, object?> { ["a"] = 1L, ["b"] = "two" }; + + trial.SetUserAttr(attrs); + study.SetUserAttr(attrs); + storage.SetTrialSystemAttr(trial.TrialId, attrs); + storage.SetStudySystemAttr(study.StudyId, attrs); + + trial.UserAttrs.Should().Contain(attrs); + study.UserAttrs.Should().Contain(attrs); + storage.GetTrial(trial.TrialId).UserAttrs.Should().Contain(attrs); + storage.GetTrial(trial.TrialId).SystemAttrs.Should().Contain(attrs); + storage.GetStudySystemAttrs(study.StudyId).Should().Contain(attrs); + + storage.SetTrialUserAttr(trial.TrialId, new Dictionary<string, object?> { ["c"] = 3L }); + storage.SetStudyUserAttr(study.StudyId, new Dictionary<string, object?> { ["d"] = 4L }); + storage.GetTrial(trial.TrialId).UserAttrs["c"].Should().Be(3L); + storage.GetStudyUserAttrs(study.StudyId)["d"].Should().Be(4L); + } + + /// <summary> + /// <see cref="Trial.SetUserAttrs" /> updates the trial's own view at once, and a <see cref="FrozenTrial" /> and a + /// <see cref="FixedTrial" /> take the per-entry default; the Optuna-name overload works on every trial kind. + /// </summary> + [TestMethod] + public void EveryTrialKind_TakesABatch() + { + Study study = Optuna.CreateStudy(); + Trial trial = study.Ask(); + trial.SetUserAttrs(SampleAttrs()); + Describe(trial.UserAttrs).Should().Be(Describe(SampleAttrs())); + study.Tell(trial, 1.0); + Describe(study.Trials[0].UserAttrs).Should().Be(Describe(SampleAttrs())); + + FrozenTrial frozen = FrozenTrial.CreateTrial(state: TrialState.Complete, value: 1.0); + frozen.SetUserAttr(new Dictionary<string, object?> { ["x"] = 1L }); + frozen.UserAttrs["x"].Should().Be(1L); + + var fixedTrial = new FixedTrial(new OrderedDict<string, object?>()); + fixedTrial.SetUserAttrs(new Dictionary<string, object?> { ["y"] = 2L }); + fixedTrial.UserAttrs["y"].Should().Be(2L); + } + + // ------------------------------------------------------------------ nothing written on refusal + + /// <summary> + /// A finished trial refuses a batch with the single write's exception and message, and gets nothing written; on + /// a journal not even a record is appended. An unknown trial and an unknown study refuse with a key error. + /// </summary> + /// <param name="kind">The storage kind.</param> + [TestMethod] + [DataRow("memory")] + [DataRow("journal")] + public void AFinishedOrUnknownTarget_RefusesTheBatch_AndGetsNothingWritten(string kind) + { + BaseStorage storage = Open(kind); + int studyId = storage.CreateNewStudy(Minimize, "refuse"); + int trialId = storage.CreateNewTrial(studyId); + storage.SetTrialUserAttr(trialId, "kept", 1L); + storage.SetTrialStateValues(trialId, TrialState.Complete, new[] { 1.0 }); + long linesBefore = JournalLines(storage); + + Action single = () => storage.SetTrialUserAttr(trialId, "a", 1L); + string message = single.Should().Throw<UpdateFinishedTrialError>().Which.Message; + long linesAfterSingle = JournalLines(storage); + + Action batch = () => storage.SetTrialUserAttrs(trialId, SampleAttrs()); + Action systemBatch = () => storage.SetTrialSystemAttrs(trialId, SampleAttrs()); + batch.Should().Throw<UpdateFinishedTrialError>().WithMessage(message); + systemBatch.Should().Throw<UpdateFinishedTrialError>().WithMessage(message); + storage.GetTrial(trialId).UserAttrs.Keys.Should().Equal("kept"); + JournalLines(storage).Should().Be(linesAfterSingle, "a refused batch appends no record"); + _ = linesBefore; + + Action unknownTrial = () => storage.SetTrialUserAttrs(424242, SampleAttrs()); + Action unknownStudy = () => storage.SetStudyUserAttrs(424242, SampleAttrs()); + unknownTrial.Should().Throw<KeyError>(); + unknownStudy.Should().Throw<KeyError>(); + JournalLines(storage).Should().Be(linesAfterSingle); + } + + /// <summary>An empty batch writes and checks nothing; a null one is refused before anything happens.</summary> + /// <param name="kind">The storage kind.</param> + [TestMethod] + [DataRow("memory")] + [DataRow("journal")] + [DataRow("default")] + public void AnEmptyBatch_DoesNothing_AndANullOneIsRefused(string kind) + { + BaseStorage storage = Open(kind); + int studyId = storage.CreateNewStudy(Minimize, "empty"); + int trialId = storage.CreateNewTrial(studyId); + long lines = JournalLines(storage); + + storage.SetTrialUserAttrs(trialId, new Dictionary<string, object?>()); + storage.SetStudyUserAttrs(studyId, new Dictionary<string, object?>()); + storage.SetTrialUserAttrs(424242, new Dictionary<string, object?>()); // nothing to write, nothing checked + JournalLines(storage).Should().Be(lines); + + Action nullTrial = () => storage.SetTrialUserAttrs(trialId, null!); + Action nullStudy = () => storage.SetStudySystemAttrs(studyId, null!); + nullTrial.Should().Throw<ArgumentNullException>(); + nullStudy.Should().Throw<ArgumentNullException>(); + } + + // ------------------------------------------------------------------ one step + + /// <summary> + /// In memory, a batch of ten attributes on a trial a reader holds copies the record once, then writes every entry + /// into the copy; the reader's record keeps its contents. + /// </summary> + [TestMethod] + public void InMemory_ABatchCopiesAHeldRecordOnce() + { + var storage = new InMemoryStorage(); + int studyId = storage.CreateNewStudy(Minimize, "copy"); + int trialId = storage.CreateNewTrial(studyId); + FrozenTrial held = storage.GetTrial(trialId); + var attrs = Enumerable.Range(0, 10).ToDictionary(i => $"k{i}", i => (object?)(long)i); + + storage.SetTrialUserAttrs(trialId, attrs); + + storage.WriteCopyCount.Should().Be(1); + held.UserAttrs.Should().BeEmpty(); + storage.GetTrial(trialId).UserAttrs.Should().HaveCount(10); + } + + /// <summary> + /// On a journal, a batch is one record per entry, each the single-key record a single write appends (Python's + /// reader asserts one key per record), all appended in one call; another storage replaying the file sees the same + /// attributes. + /// </summary> + [TestMethod] + public void Journal_ABatchIsOrdinarySingleKeyRecords_AppendedTogether() + { + var storage = (JournalStorage)Open("journal"); + string path = _paths[^1]; + int studyId = storage.CreateNewStudy(Minimize, "records"); + int trialId = storage.CreateNewTrial(studyId); + string[] before = File.ReadAllLines(path); + + storage.SetTrialUserAttrs(trialId, SampleAttrs()); + + string[] added = File.ReadAllLines(path).Skip(before.Length).ToArray(); + added.Should().HaveCount(SampleAttrs().Count); + var keys = new List<string>(); + foreach (string line in added) + { + var record = (OrderedDict<string, object?>)PyJson.Loads(line)!; + Convert.ToInt32(record["op_code"]).Should().Be((int)JournalOperation.SetTrialUserAttr); + Convert.ToInt32(record["trial_id"]).Should().Be(trialId); + var userAttr = (OrderedDict<string, object?>)record["user_attr"]!; + userAttr.Should().HaveCount(1, "Python's replay asserts len(log['user_attr']) == 1"); + keys.Add(userAttr.Keys.Single()); + } + keys.Should().Equal(SampleAttrs().Keys); + + var replay = new JournalStorage(new JournalFileBackend(path)); + Describe(replay.GetTrial(trialId).UserAttrs).Should().Be(Describe(SampleAttrs())); + } + + /// <summary> + /// If another process finishes the trial between the batch's check and its append, the replay rejects every record + /// of the batch, one per synchronization. The batch write consumes them all and raises once; later, unrelated + /// calls of the storage do not raise for the batch's leftovers. + /// </summary> + [TestMethod] + public void Journal_ABatchRejectedAfterItsCheck_IsDrained_SoLaterCallsDoNotRaise() + { + var writer = (JournalStorage)Open("journal"); + string path = _paths[^1]; + int studyId = writer.CreateNewStudy(Minimize, "drain"); + int trialId = writer.CreateNewTrial(studyId); + int otherTrial = writer.CreateNewTrial(studyId); + + // Another worker finishes the trial; the writer has not synchronized since. + var otherProcess = new JournalStorage(new JournalFileBackend(path)); + otherProcess.SetTrialStateValues(trialId, TrialState.Fail); + + // The batch as WriteAttributeBatch builds it after a check that passed on the writer's stale state. + string workerId = writer.WorkerIdForTests; + var logs = SampleAttrs().Select(kv => new OrderedDict<string, object?> + { + ["op_code"] = (int)JournalOperation.SetTrialUserAttr, + ["worker_id"] = workerId, + ["trial_id"] = trialId, + ["user_attr"] = new OrderedDict<string, object?> { [kv.Key] = kv.Value }, + }).ToList(); + + Action batch = () => writer.AppendBatchAndSyncForTests(logs); + batch.Should().Throw<UpdateFinishedTrialError>(); + + // Every leftover was consumed: these would raise for the batch's remaining records otherwise. + Action read = () => writer.GetTrial(otherTrial); + read.Should().NotThrow(); + writer.SetTrialUserAttrs(otherTrial, new Dictionary<string, object?> { ["fine"] = 1L }); + writer.GetTrial(otherTrial).UserAttrs["fine"].Should().Be(1L); + writer.GetTrial(trialId).UserAttrs.Should().BeEmpty(); + } + + /// <summary> + /// The base implementation, which storages without an override (the gRPC client, third-party storages) use, makes + /// exactly one single-entry call per entry, in the dictionary's order. + /// </summary> + [TestMethod] + public void TheBaseImplementation_CallsTheSingleWriteOncePerEntry_InOrder() + { + var storage = new DelegatingStorage(new InMemoryStorage()); + int studyId = storage.CreateNewStudy(Minimize, "default"); + int trialId = storage.CreateNewTrial(studyId); + + storage.SetTrialUserAttrs(trialId, SampleAttrs()); + storage.SetStudySystemAttrs(studyId, new Dictionary<string, object?> { ["p"] = 1L, ["q"] = 2L }); + + storage.Calls.Should().Equal( + SampleAttrs().Keys.Select(k => $"trial-user:{k}").Concat(new[] { "study-system:p", "study-system:q" })); + } + + // ------------------------------------------------------------------ helpers + + /// <summary>Describes attributes as JSON in their order, so dictionaries of nested values compare by content.</summary> + /// <param name="attrs">The attributes.</param> + /// <returns>The description.</returns> + private static string Describe(IReadOnlyDictionary<string, object?> attrs) + => string.Join("; ", attrs.Select(kv => $"{kv.Key}={PyJson.Dumps(kv.Value)}")); + + /// <summary>The number of lines of a journal storage's file, or -1 for other storages.</summary> + /// <param name="storage">The storage.</param> + /// <returns>The line count.</returns> + private long JournalLines(BaseStorage storage) + => storage is JournalStorage ? File.ReadAllLines(_paths[^1]).LongLength : -1; + + /// <summary> + /// A storage that forwards every member to an in-memory storage and overrides none of the bulk writes, so they run + /// <see cref="BaseStorage" />'s per-entry default; it records the single attribute writes it receives. + /// </summary> + private sealed class DelegatingStorage : BaseStorage + { + private readonly InMemoryStorage _inner; + + /// <summary>Wraps <paramref name="inner" />.</summary> + /// <param name="inner">The storage every call goes to.</param> + internal DelegatingStorage(InMemoryStorage inner) => _inner = inner; + + /// <summary>The single attribute writes received, as <c>kind:key</c>.</summary> + internal List<string> Calls { get; } = new(); + + /// <inheritdoc /> + public override int CreateNewStudy(IReadOnlyList<StudyDirection> directions, string? studyName = null) + => _inner.CreateNewStudy(directions, studyName); + + /// <inheritdoc /> + public override void DeleteStudy(int studyId) => _inner.DeleteStudy(studyId); + + /// <inheritdoc /> + public override void SetStudyUserAttr(int studyId, string key, object? value) + { + Calls.Add($"study-user:{key}"); + _inner.SetStudyUserAttr(studyId, key, value); + } + + /// <inheritdoc /> + public override void SetStudySystemAttr(int studyId, string key, object? value) + { + Calls.Add($"study-system:{key}"); + _inner.SetStudySystemAttr(studyId, key, value); + } + + /// <inheritdoc /> + public override int GetStudyIdFromName(string studyName) => _inner.GetStudyIdFromName(studyName); + + /// <inheritdoc /> + public override string GetStudyNameFromId(int studyId) => _inner.GetStudyNameFromId(studyId); + + /// <inheritdoc /> + public override List<StudyDirection> GetStudyDirections(int studyId) => _inner.GetStudyDirections(studyId); + + /// <inheritdoc /> + public override OrderedDict<string, object?> GetStudyUserAttrs(int studyId) => _inner.GetStudyUserAttrs(studyId); + + /// <inheritdoc /> + public override OrderedDict<string, object?> GetStudySystemAttrs(int studyId) => _inner.GetStudySystemAttrs(studyId); + + /// <inheritdoc /> + public override List<FrozenStudy> GetAllStudies() => _inner.GetAllStudies(); + + /// <inheritdoc /> + public override int CreateNewTrial(int studyId, FrozenTrial? templateTrial = null) + => _inner.CreateNewTrial(studyId, templateTrial); + + /// <inheritdoc /> + public override void SetTrialParam(int trialId, string paramName, double paramValueInternal, BaseDistribution distribution) + => _inner.SetTrialParam(trialId, paramName, paramValueInternal, distribution); + + /// <inheritdoc /> + public override bool SetTrialStateValues(int trialId, TrialState state, IReadOnlyList<double>? values = null) + => _inner.SetTrialStateValues(trialId, state, values); + + /// <inheritdoc /> + public override void SetTrialIntermediateValue(int trialId, long step, double intermediateValue) + => _inner.SetTrialIntermediateValue(trialId, step, intermediateValue); + + /// <inheritdoc /> + public override void SetTrialUserAttr(int trialId, string key, object? value) + { + Calls.Add($"trial-user:{key}"); + _inner.SetTrialUserAttr(trialId, key, value); + } + + /// <inheritdoc /> + public override void SetTrialSystemAttr(int trialId, string key, object? value) + { + Calls.Add($"trial-system:{key}"); + _inner.SetTrialSystemAttr(trialId, key, value); + } + + /// <inheritdoc /> + public override FrozenTrial GetTrial(int trialId) => _inner.GetTrial(trialId); + + /// <inheritdoc /> + public override List<FrozenTrial> GetAllTrials(int studyId, bool deepcopy = true, IReadOnlyCollection<TrialState>? states = null) + => _inner.GetAllTrials(studyId, deepcopy, states); + } +} diff --git a/test/OptunaSharp.Tests/Storages/CachedStorageOrderedReadsTests.cs b/test/OptunaSharp.Tests/Storages/CachedStorageOrderedReadsTests.cs new file mode 100644 index 0000000..ad75b35 --- /dev/null +++ b/test/OptunaSharp.Tests/Storages/CachedStorageOrderedReadsTests.cs @@ -0,0 +1,206 @@ +using System; +using System.Collections.Generic; +using System.Linq; +using AwesomeAssertions; +using OptunaSharp.Distributions; +using OptunaSharp.Samplers; +using OptunaSharp.Storages; + +namespace OptunaSharp.Tests.Storages; + +/// <summary> +/// Plan 13 (docs/plans/13-rustuna-derived-performance.md), item S10: <see cref="CachedStorage" /> keeps its cached +/// trials in number order as well, so <see cref="CachedStorage.GetAllTrials" /> no longer sorts the cache on every read +/// and <see cref="CachedStorage.GetTrialsPrefixView" /> wraps it instead of copying. The backend here is a fake +/// database: an in-memory store that returns fresh records on every read, as a database does, and can hide trials +/// from a synchronization, as another worker's trial is hidden until a sync sees it. +/// </summary> +[TestClass] +public class CachedStorageOrderedReadsTests +{ + private static readonly StudyDirection[] Minimize = { StudyDirection.Minimize }; + + /// <summary> + /// Over a history finished out of order and in every state, every read returns the trials the backend holds, in + /// number order, with and without each state filter, and with deep copies. + /// </summary> + [TestMethod] + public void GetAllTrials_ReturnsTheBackendsTrialsInNumberOrder_ForEveryFilter() + { + var backend = new FakeDatabase(); + var cached = new CachedStorage(backend); + int studyId = cached.CreateNewStudy(Minimize, "ordered"); + var ids = new List<int>(); + for (int n = 0; n < 30; n++) + { + int id = cached.CreateNewTrial(studyId); + ids.Add(id); + cached.SetTrialParam(id, "x", n / 30.0, new FloatDistribution(0, 1)); + if (n % 3 == 0) + _ = cached.GetAllTrials(studyId, deepcopy: false); // syncs land between the creates + } + TrialState[] finals = { TrialState.Complete, TrialState.Pruned, TrialState.Fail, TrialState.Running }; + for (int n = 29; n >= 0; n--) + { + TrialState state = finals[n % finals.Length]; + if (state != TrialState.Running) + cached.SetTrialStateValues(ids[n], state, state == TrialState.Complete ? new[] { (double)n } : null); + } + + foreach (TrialState[]? states in new[] + { + null, new[] { TrialState.Complete }, new[] { TrialState.Complete, TrialState.Pruned }, + new[] { TrialState.Running }, new[] { TrialState.Waiting }, + }) + { + foreach (bool deepcopy in new[] { false, true }) + { + List<FrozenTrial> actual = cached.GetAllTrials(studyId, deepcopy, states); + List<FrozenTrial> expected = backend.GetAllTrials(studyId, deepcopy: true, states); + actual.Select(Describe).Should().Equal(expected.Select(Describe), + $"states [{(states is null ? "all" : string.Join(",", states))}], deepcopy {deepcopy}"); + } + } + } + + /// <summary> + /// With the cache contiguous, the view is a zero-copy window holding the very records the uncopied read returns; + /// a later synchronization that refreshes an unfinished trial is seen through it, as the view's contract says. + /// </summary> + [TestMethod] + public void TheView_IsZeroCopy_AndSeesARefreshedUnfinishedTrial() + { + var backend = new FakeDatabase(); + var cached = new CachedStorage(backend); + int studyId = cached.CreateNewStudy(Minimize, "view"); + int done = cached.CreateNewTrial(studyId); + cached.SetTrialStateValues(done, TrialState.Complete, new[] { 1.0 }); + int running = cached.CreateNewTrial(studyId); + + IReadOnlyList<FrozenTrial> view = cached.GetTrialsPrefixView(studyId); + view.Should().BeOfType<TrialsPrefixView>(); + List<FrozenTrial> list = cached.GetAllTrials(studyId, deepcopy: false); + view.Should().HaveCount(2); + view[0].Should().BeSameAs(list[0]); + view[1].Should().BeSameAs(list[1]); + + // Another worker writes the running trial; the next synchronization brings the fresher record in. + backend.SetTrialParam(running, "y", 0.5, new FloatDistribution(0, 1)); + _ = cached.GetAllTrials(studyId, deepcopy: false); + view[1].Params.Should().ContainKey("y"); + view[0].Should().BeSameAs(list[0], "a finished record is never replaced"); + } + + /// <summary> + /// A trial number not cached yet (another worker's trial a sync has not seen, while this process cached a later + /// one) leaves a gap: reads fall back to sorting the cache and the view to a copied list, both still in number + /// order; once a sync brings the missing trial in, the view is zero-copy again and holds every trial. + /// </summary> + [TestMethod] + public void AGap_FallsBackToTheSortedCopy_UntilASyncFillsIt() + { + var backend = new FakeDatabase(); + var cached = new CachedStorage(backend); + int studyId = cached.CreateNewStudy(Minimize, "gap"); + cached.CreateNewTrial(studyId); // number 0 + cached.CreateNewTrial(studyId); // number 1 + int other = backend.CreateNewTrial(studyId); // number 2, another worker's, not seen yet + backend.Hidden.Add(other); + cached.CreateNewTrial(studyId); // number 3, cached locally beside a gap at 2 + + cached.GetAllTrials(studyId, deepcopy: false).Select(t => t.Number).Should().Equal(0, 1, 3); + IReadOnlyList<FrozenTrial> fallback = cached.GetTrialsPrefixView(studyId); + fallback.Should().NotBeOfType<TrialsPrefixView>(); + fallback.Select(t => t.Number).Should().Equal(0, 1, 3); + + backend.Hidden.Remove(other); + IReadOnlyList<FrozenTrial> view = cached.GetTrialsPrefixView(studyId); + view.Should().BeOfType<TrialsPrefixView>(); + view.Select(t => t.Number).Should().Equal(0, 1, 2, 3); + cached.GetAllTrials(studyId, deepcopy: false).Select(t => t.Number).Should().Equal(0, 1, 2, 3); + } + + /// <summary> + /// The genetic samplers read this view on every ask: a seeded NSGA-II study on the cached fake database is the + /// same study, trial by trial, as on an in-memory storage, and so is CMA-ES, which reads through the per-trial + /// cached list on this storage. + /// </summary> + /// <param name="samplerName"><c>nsga2</c> or <c>cmaes</c>.</param> + [TestMethod] + [DataRow("nsga2")] + [DataRow("cmaes")] + public void SeededStudies_OnTheCachedStorage_MatchTheInMemoryRun(string samplerName) + { + string Run(BaseStorage storage) + { + BaseSampler sampler = samplerName == "nsga2" + ? new NSGAIISampler(populationSize: 10, seed: 7) + : new CmaEsSampler(seed: 7); + Study study = samplerName == "nsga2" + ? Optuna.CreateStudy(storage: storage, sampler: sampler, + directions: new[] { StudyDirection.Minimize, StudyDirection.Minimize }) + : Optuna.CreateStudy(storage: storage, sampler: sampler); + if (samplerName == "nsga2") + study.Optimize(t => new[] { t.SuggestFloat("x", -2, 2), 1 - t.SuggestFloat("y", -2, 2) }, nTrials: 120); + else + study.Optimize(t => Math.Pow(t.SuggestFloat("x", -2, 2), 2) + Math.Pow(t.SuggestFloat("y", -2, 2), 2), nTrials: 120); + return string.Join("\n", study.Trials.Select(Describe)); + } + + Run(new CachedStorage(new FakeDatabase())).Should().Be(Run(new InMemoryStorage())); + } + + /// <summary>A record's number, state, parameters (with value bits) and objective values, as one line.</summary> + /// <param name="trial">The record.</param> + /// <returns>The description.</returns> + private static string Describe(FrozenTrial trial) + => $"{trial.Number}|{trial.State}|" + + string.Join(",", trial.Params.Select(kv => $"{kv.Key}={(kv.Value is double d ? BitConverter.DoubleToInt64Bits(d) : kv.Value)}")) + + "|" + string.Join(",", (trial.Values ?? (IReadOnlyList<double>)Array.Empty<double>()).Select(BitConverter.DoubleToInt64Bits)); + + /// <summary> + /// A database stand-in for <see cref="CachedStorage" />: an in-memory store whose reads for the cache return + /// deep copies, as rows read from a database are new objects, and which can hide trials from a sync. + /// </summary> + private sealed class FakeDatabase : InMemoryStorage, ICachedStorageBackend + { + /// <summary>Trial ids a synchronization does not return yet, as another worker's uncommitted trials.</summary> + internal HashSet<int> Hidden { get; } = new(); + + /// <inheritdoc /> + public FrozenTrial CreateNewTrialFull(int studyId, FrozenTrial? templateTrial = null) + => GetTrial(CreateNewTrial(studyId, templateTrial)).DeepCopy(); + + /// <inheritdoc /> + public void SetTrialParamWithCachedDistribution( + int trialId, string paramName, double paramValueInternal, BaseDistribution distribution, + BaseDistribution? cachedDistribution) + => SetTrialParam(trialId, paramName, paramValueInternal, distribution); + + /// <inheritdoc /> + public int GetBestTrialId(int studyId, StudyDirection direction) => GetBestTrial(studyId).TrialId; + + /// <inheritdoc /> + public List<FrozenTrial> GetTrialsPartial( + int studyId, IReadOnlyCollection<TrialState>? states, IReadOnlyCollection<int> includedTrialIds, + int trialIdGreaterThan) + => GetAllTrials(studyId, deepcopy: true, states) + .Where(t => !Hidden.Contains(t.TrialId) + && (includedTrialIds.Contains(t.TrialId) || t.TrialId > trialIdGreaterThan)) + .ToList(); + + /// <inheritdoc /> + public void RecordHeartbeat(int trialId) + { + } + + /// <inheritdoc /> + public List<int> GetStaleTrialIds(int studyId) => new(); + + /// <inheritdoc /> + public int? GetHeartbeatInterval() => null; + + /// <inheritdoc /> + public Action<Study, FrozenTrial>? GetHeartbeatStaleTrialCallback() => null; + } +} diff --git a/test/OptunaSharp.Tests/Storages/CompactFinishedTrialsTests.cs b/test/OptunaSharp.Tests/Storages/CompactFinishedTrialsTests.cs new file mode 100644 index 0000000..77a5df9 --- /dev/null +++ b/test/OptunaSharp.Tests/Storages/CompactFinishedTrialsTests.cs @@ -0,0 +1,976 @@ +using System; +using System.Collections; +using System.Collections.Generic; +using System.Linq; +using System.Runtime.CompilerServices; +using System.Text; +using System.Text.RegularExpressions; +using System.Threading; +using System.Threading.Tasks; +using AwesomeAssertions; +using OptunaSharp.Collections; +using OptunaSharp.Distributions; +using OptunaSharp.Internal; +using OptunaSharp.Logging; +using OptunaSharp.Pruners; +using OptunaSharp.Samplers; +using OptunaSharp.Storages; + +namespace OptunaSharp.Tests.Storages; + +/// <summary> +/// Plan 13 (docs/plans/13-rustuna-derived-performance.md), item S12: <c>InMemoryStorage(compactFinishedTrials: true)</c> +/// stores each finished trial compactly (parameters as internal values against a schema the study's trials share, +/// attributes as arrays with long ASCII strings as bytes, nothing for empty dictionaries) while every API returns the +/// same contents. The tests compare a compact storage against Optuna's representation value by value (types and bits), +/// prove the read-only views refuse writes and the mutable accessors keep writes, pin the fallbacks that keep a +/// dictionary when a value would not read back identical, and run every sampler family twice (compact and not) to the +/// same seeded trials, with the records still compact afterwards. +/// </summary> +[TestClass] +public class CompactFinishedTrialsTests +{ + private static readonly StudyDirection[] Minimize = { StudyDirection.Minimize }; + + // ------------------------------------------------------------------ fixtures + + /// <summary> + /// A study's worth of trials written through the storage API with every kind of value: each float, integer and + /// categorical flavor (a -0.0 value, log and stepped ranges, choices of every JSON type), attributes with short, + /// long ASCII, long odd-length lowercase hexadecimal, uppercase hexadecimal and non-ASCII strings, nested + /// containers, intermediate values (and a trial without), a failed and a pruned trial. + /// </summary> + /// <param name="compact">Whether the storage compacts finished trials.</param> + /// <returns>The storage and the study it holds.</returns> + private static (InMemoryStorage Storage, int StudyId) WriteEveryKind(bool compact) + { + var storage = new InMemoryStorage(compactFinishedTrials: compact); + int studyId = storage.CreateNewStudy(Minimize, "every-kind"); + var categorical = new CategoricalDistribution( + new CategoricalChoice[] { "a", CategoricalChoice.None, true, 7L, 2.5, "z" }); + for (int k = 0; k < 4; k++) + { + int trialId = storage.CreateNewTrial(studyId); + storage.SetTrialParam(trialId, "x", 0.25 * k - 0.5, new FloatDistribution(-1, 1)); + storage.SetTrialParam(trialId, "neg0", -0.0, new FloatDistribution(-1, 1)); + storage.SetTrialParam(trialId, "lx", 0.01 * (k + 1), new FloatDistribution(1e-3, 1, log: true)); + storage.SetTrialParam(trialId, "sx", 0.25 * k, new FloatDistribution(0, 1, step: 0.25)); + storage.SetTrialParam(trialId, "n", k - 2, new IntDistribution(-3, 3)); + storage.SetTrialParam(trialId, "ln", 1 << k, new IntDistribution(1, 64, log: true)); + storage.SetTrialParam(trialId, "sn", 2 * k, new IntDistribution(0, 10, step: 2)); + // A new categorical distribution per trial, as every SuggestCategorical builds one. + var perTrialCategorical = new CategoricalDistribution( + new CategoricalChoice[] { "a", CategoricalChoice.None, true, 7L, 2.5, "z" }); + storage.SetTrialParam(trialId, "c", k, k % 2 == 0 ? categorical : perTrialCategorical); + storage.SetTrialParam(trialId, "c5", 5, perTrialCategorical); + + storage.SetTrialUserAttr(trialId, "short", "s"); + storage.SetTrialUserAttr(trialId, "ascii", new string('q', 100) + k); + storage.SetTrialUserAttr(trialId, "hex", LowerHex(65 + k)); + storage.SetTrialUserAttr(trialId, "upper-hex", LowerHex(80).ToUpperInvariant()); + storage.SetTrialUserAttr(trialId, "unicode", new string('é', 70)); + storage.SetTrialUserAttr(trialId, "nested", new List<object?> { 1L, "two", 3.5, null, true }); + storage.SetTrialUserAttr(trialId, "map", new OrderedDict<string, object?> { ["a"] = 1L, ["b"] = -0.0 }); + storage.SetTrialUserAttr(trialId, "none", null); + storage.SetTrialSystemAttr(trialId, "gen", (long)k); + storage.SetTrialSystemAttr(trialId, "chunk:0", LowerHex(2045)); + storage.SetTrialSystemAttr(trialId, "constraints", new List<object?> { 0.5 - k, -1.0 }); + if (k != 1) + { + storage.SetTrialIntermediateValue(trialId, 0, 1.5 * k); + storage.SetTrialIntermediateValue(trialId, 7, -0.0); + storage.SetTrialIntermediateValue(trialId, long.MaxValue, double.NegativeInfinity); + } + TrialState state = k switch { 2 => TrialState.Fail, 3 => TrialState.Pruned, _ => TrialState.Complete }; + storage.SetTrialStateValues(trialId, state, state == TrialState.Complete ? new[] { 1.0 / (k + 1) } : null); + } + return (storage, studyId); + } + + /// <summary>A lowercase hexadecimal string of the given length (odd lengths included).</summary> + /// <param name="length">Number of digits.</param> + /// <returns>Digits cycling through <c>0-9a-f</c>.</returns> + private static string LowerHex(int length) + { + var sb = new StringBuilder(length); + for (int i = 0; i < length; i++) + sb.Append("0123456789abcdef"[(i * 7 + 3) % 16]); + return sb.ToString(); + } + + /// <summary> + /// Everything a reader can learn from a trial except object identity and the clock: values with their runtime + /// types and bits, entries in order, the distributions' reprs and the trial's repr without its datetimes. + /// </summary> + /// <param name="trial">The trial to describe; read through the read-only accessors only.</param> + /// <returns>A string equal for two trials exactly when no read can tell them apart.</returns> + private static string Fingerprint(FrozenTrial trial) + { + var sb = new StringBuilder(); + sb.Append(trial.Number).Append('|').Append(trial.State).Append("|values="); + sb.Append(trial.Values is null + ? "None" + : string.Join(",", trial.Values.Select(v => BitConverter.DoubleToInt64Bits(v)))); + foreach (var (name, value) in trial.Params) + sb.Append("|p:").Append(name).Append('=').Append(Describe(value)); + foreach (var (name, distribution) in trial.Distributions) + sb.Append("|d:").Append(name).Append('=').Append(distribution.GetType().Name).Append(distribution); + foreach (var (key, value) in trial.UserAttrs) + sb.Append("|u:").Append(key).Append('=').Append(Describe(value)); + foreach (var (key, value) in trial.SystemAttrs) + sb.Append("|s:").Append(key).Append('=').Append(Describe(value)); + foreach (var (step, value) in trial.IntermediateValuesForRead) + sb.Append("|i:").Append(step).Append('=').Append(BitConverter.DoubleToInt64Bits(value)); + sb.Append("|last=").Append(trial.LastStep); + sb.Append("|constraints=").Append(string.Join(",", trial.Constraints.Select(kv => $"{kv.Key}:{BitConverter.DoubleToInt64Bits(kv.Value)}"))); + sb.Append("|repr=").Append(WithoutDatetimes(trial.ToString())); + return sb.ToString(); + } + + /// <summary>A value's runtime type and Python repr, with doubles by their bits so -0.0 and 0.0 differ.</summary> + /// <param name="value">The value to describe.</param> + /// <returns>Type name and representation.</returns> + private static string Describe(object? value) => value switch + { + null => "None", + double d => $"double:{BitConverter.DoubleToInt64Bits(d)}", + _ => $"{value.GetType().Name}:{PythonRepr.Repr(value)}", + }; + + /// <summary>A trial repr with its two datetimes blanked, the one thing two storages cannot agree on.</summary> + /// <param name="repr">The repr from <see cref="FrozenTrial.ToString" />.</param> + /// <returns>The repr with <c>datetime_start</c> and <c>datetime_complete</c> values removed.</returns> + private static string WithoutDatetimes(string repr) + => Regex.Replace(repr, @"datetime_(start|complete)=('[^']*'|None)", "datetime_$1=?"); + + // ------------------------------------------------------------------ the switch and what it touches + + /// <summary>The default storage keeps Optuna's representation: no record is ever compact, every dictionary an OrderedDict.</summary> + [TestMethod] + public void Default_IsOff_AndKeepsEveryDictionary() + { + new InMemoryStorage().CompactFinishedTrials.Should().BeFalse(); + new InMemoryStorage(compactFinishedTrials: false).CompactFinishedTrials.Should().BeFalse(); + new InMemoryStorage(compactFinishedTrials: true).CompactFinishedTrials.Should().BeTrue(); + + var (storage, studyId) = WriteEveryKind(compact: false); + foreach (FrozenTrial trial in storage.GetAllTrials(studyId, deepcopy: false)) + { + trial.IsCompact.Should().BeFalse(); + trial.Params.Should().BeOfType<OrderedDict<string, object?>>(); + trial.Distributions.Should().BeOfType<OrderedDict<string, BaseDistribution>>(); + trial.UserAttrs.Should().BeOfType<OrderedDict<string, object?>>(); + trial.SystemAttrs.Should().BeOfType<OrderedDict<string, object?>>(); + } + } + + /// <summary> + /// Only finished records are compacted: a running and a waiting trial keep their dictionaries (they are still + /// written), each finished state (complete, failed, pruned) is compact, and a trial added already finished is + /// compacted at creation. + /// </summary> + [TestMethod] + public void OnlyFinishedRecords_AreCompacted() + { + var storage = new InMemoryStorage(compactFinishedTrials: true); + var study = Optuna.CreateStudy(storage: storage, sampler: new RandomSampler(seed: 1)); + study.EnqueueTrial(new OrderedDict<string, object?> { ["x"] = 0.5 }); + Trial running = study.Ask(); // pops the enqueued trial + running.SuggestFloat("x", 0, 1); + study.EnqueueTrial(new OrderedDict<string, object?> { ["x"] = 0.25 }); + study.AddTrial(FrozenTrial.CreateTrial( + value: 3.0, + @params: new OrderedDict<string, object?> { ["x"] = 0.75 }, + distributions: new OrderedDict<string, BaseDistribution> { ["x"] = new FloatDistribution(0, 1) }, + userAttrs: new OrderedDict<string, object?> { ["added"] = true })); + study.Optimize(t => t.SuggestFloat("x", 0, 1), nTrials: 3); + + var records = storage.GetAllTrials(study.StudyId, deepcopy: false); + foreach (FrozenTrial record in records) + record.IsCompact.Should().Be(record.State.IsFinished(), $"trial {record.Number} is {record.State}"); + records.Count(r => r.State == TrialState.Running).Should().Be(1); + records.Single(r => r.UserAttrs.ContainsKey("added")).Params["x"].Should().Be(0.75); + } + + // ------------------------------------------------------------------ contents: identical to Optuna's representation + + /// <summary> + /// Every kind of value reads back from a compact record exactly as from Optuna's representation: same runtime + /// types, same bits (-0.0 stays -0.0), same order, same reprs and constraints, the same <c>LastStep</c>; and the + /// compact storage did compact every finished record, with the long strings stored as bytes (hexadecimal two to a + /// byte, odd length included) and the uppercase-hex and non-ASCII strings left as strings. + /// </summary> + [TestMethod] + public void EveryKindOfValue_ReadsBackIdentical() + { + var (plain, plainStudy) = WriteEveryKind(compact: false); + var (compact, compactStudy) = WriteEveryKind(compact: true); + var expected = plain.GetAllTrials(plainStudy, deepcopy: false); + var actual = compact.GetAllTrials(compactStudy, deepcopy: false); + + actual.Select(Fingerprint).Should().Equal(expected.Select(Fingerprint)); + actual.Should().OnlyContain(t => t.IsCompact); + actual.Select(t => t.Params).Should().AllBeOfType<CompactParams>(); + + var userAttrs = (CompactAttrs)actual[0].UserAttrs; + userAttrs.StoredValue("ascii").Should().BeOfType<CompactString>().Which.IsHex.Should().BeFalse(); + var hex = userAttrs.StoredValue("hex").Should().BeOfType<CompactString>().Which; + hex.IsHex.Should().BeTrue(); + hex.StoredBytes.Should().Be(32, "65 digits are 32 bytes and one spare digit"); + userAttrs.StoredValue("upper-hex").Should().BeOfType<CompactString>().Which.IsHex.Should().BeFalse(); + userAttrs.StoredValue("unicode").Should().BeOfType<string>(); + userAttrs.StoredValue("short").Should().BeOfType<string>(); + ((CompactAttrs)actual[0].SystemAttrs).StoredValue("chunk:0").Should().BeOfType<CompactString>() + .Which.StoredBytes.Should().Be(1022, "a 2,045-digit CMA-ES chunk is 1,022 bytes and one spare digit"); + actual[1].IntermediateValuesForRead.Should().BeEmpty(); + actual[1].LastStep.Should().BeNull(); + + // The storage's own internal-value read returns the stored value of a compact trial without converting it. + foreach (FrozenTrial trial in expected) + { + foreach (string name in trial.Params.Keys) + BitConverter.DoubleToInt64Bits(compact.GetTrialParam(trial.TrialId, name)) + .Should().Be(BitConverter.DoubleToInt64Bits(plain.GetTrialParam(trial.TrialId, name)), name); + // Both raise Optuna's KeyError(param_name), the compact record included (QA-66). + Assert.ThrowsExactly<NumSharp.KeyError>(() => plain.GetTrialParam(trial.TrialId, "missing")) + .Message.Should().Be("missing"); + Assert.ThrowsExactly<NumSharp.KeyError>(() => compact.GetTrialParam(trial.TrialId, "missing")) + .Message.Should().Be("missing"); + } + } + + /// <summary> + /// A compact record equals the same trial in Optuna's representation, both ways, and prints the same repr: the + /// equality and repr paths read the views, not the dictionaries. + /// </summary> + [TestMethod] + public void Equals_AndRepr_MatchOptunasRepresentation() + { + var (plain, plainStudy) = WriteEveryKind(compact: false); + var (compact, compactStudy) = WriteEveryKind(compact: true); + var expected = plain.GetAllTrials(plainStudy, deepcopy: false); + var actual = compact.GetAllTrials(compactStudy, deepcopy: false); + for (int i = 0; i < actual.Count; i++) + { + FrozenTrial twin = expected[i].DeepCopy(); + twin.SetDatetimeStart(actual[i].DatetimeStart); + twin.DatetimeComplete = actual[i].DatetimeComplete; + twin.TrialId = actual[i].TrialId; + + actual[i].Equals(twin).Should().BeTrue($"trial {i} compact equals the dictionary form"); + twin.Equals(actual[i]).Should().BeTrue($"trial {i} dictionary form equals the compact one"); + actual[i].ToString().Should().Be(twin.ToString()); + actual[i].IsCompact.Should().BeTrue("comparing and printing read the views only"); + } + } + + /// <summary> + /// A deep copy of a compact record holds real dictionaries with the same contents and leaves the record compact; + /// a shallow copy first gives the record dictionaries of its own and shares them, as Python's <c>copy.copy</c> + /// shares a trial's dicts. + /// </summary> + [TestMethod] + public void Copies_DeepHoldDictionaries_ShallowShareTheRecordsOwn() + { + var (compact, studyId) = WriteEveryKind(compact: true); + FrozenTrial record = compact.GetAllTrials(studyId, deepcopy: false)[0]; + + FrozenTrial deep = record.DeepCopy(); + deep.IsCompact.Should().BeFalse(); + deep.Params.Should().BeOfType<OrderedDict<string, object?>>(); + Fingerprint(deep).Should().Be(Fingerprint(record)); + record.IsCompact.Should().BeTrue(); + compact.GetAllTrials(studyId, deepcopy: true).Select(Fingerprint) + .Should().Equal(compact.GetAllTrials(studyId, deepcopy: false).Select(Fingerprint)); + + string before = Fingerprint(record); + FrozenTrial shallow = record.ShallowCopy(); + record.IsCompact.Should().BeFalse("a shallow copy shares real dictionaries"); + shallow.ParamsDict.Should().BeSameAs(record.ParamsDict); + shallow.DistributionsDict.Should().BeSameAs(record.DistributionsDict); + shallow.UserAttrsDict.Should().BeSameAs(record.UserAttrsDict); + shallow.SystemAttrsDict.Should().BeSameAs(record.SystemAttrsDict); + shallow.IntermediateValues.Should().BeSameAs(record.IntermediateValues); + Fingerprint(record).Should().Be(before); + shallow.ParamsDict["x"] = 0.125; + record.Params["x"].Should().Be(0.125, "the copy and the record share the dictionary"); + } + + // ------------------------------------------------------------------ the views and the mutable accessors + + /// <summary> + /// The read-only views behave as dictionaries for reads (indexer, lookups, ordered keys and values, the + /// non-generic interface PythonRepr and PyJson use, CopyTo) and refuse every write through + /// <see cref="IDictionary" />; a missing key throws the same exception, with the same message, as an + /// <see cref="OrderedDict{TKey,TValue}" />. + /// </summary> + [TestMethod] + public void Views_ReadLikeDictionaries_AndRefuseWrites() + { + var (plain, plainStudy) = WriteEveryKind(compact: false); + var (compact, compactStudy) = WriteEveryKind(compact: true); + FrozenTrial expected = plain.GetAllTrials(plainStudy, deepcopy: false)[0]; + FrozenTrial actual = compact.GetAllTrials(compactStudy, deepcopy: false)[0]; + + void CheckView<TValue>(IReadOnlyDictionary<string, TValue> view, IReadOnlyDictionary<string, TValue> reference) + { + view.Should().NotBeAssignableTo<OrderedDict<string, TValue>>(); + view.Count.Should().Be(reference.Count); + view.Keys.Should().Equal(reference.Keys); + view.Values.Select(v => Describe(v)).Should().Equal(reference.Values.Select(v => Describe(v))); + foreach (string key in reference.Keys) + { + view.ContainsKey(key).Should().BeTrue(); + view.TryGetValue(key, out TValue? value).Should().BeTrue(); + Describe(value).Should().Be(Describe(reference[key])); + Describe(view[key]).Should().Be(Describe(reference[key])); + } + view.ContainsKey("missing").Should().BeFalse(); + view.TryGetValue("missing", out _).Should().BeFalse(); + string expectedMessage = Assert.ThrowsExactly<KeyNotFoundException>(() => _ = reference["missing"]).Message; + Assert.ThrowsExactly<KeyNotFoundException>(() => _ = view["missing"]).Message.Should().Be(expectedMessage); + Assert.ThrowsExactly<ArgumentNullException>(() => view.ContainsKey(null!)); + + var nonGeneric = (IDictionary)view; + var referenceNonGeneric = (IDictionary)reference; + nonGeneric.IsReadOnly.Should().BeTrue(); + nonGeneric.IsFixedSize.Should().BeTrue(); + nonGeneric.Count.Should().Be(reference.Count); + nonGeneric.Keys.Cast<string>().Should().Equal(referenceNonGeneric.Keys.Cast<string>()); + nonGeneric.Values.Cast<object?>().Select(Describe).Should().Equal(referenceNonGeneric.Values.Cast<object?>().Select(Describe)); + nonGeneric.Contains(reference.Keys.First()).Should().BeTrue(); + nonGeneric.Contains(42).Should().BeFalse("a key of another type is absent, as in a dictionary"); + nonGeneric["missing"].Should().BeNull(); + nonGeneric[42].Should().BeNull(); + var entries = new List<string>(); + IDictionaryEnumerator enumerator = nonGeneric.GetEnumerator(); + while (enumerator.MoveNext()) + entries.Add($"{enumerator.Key}={Describe(enumerator.Value)}={Describe(enumerator.Entry.Value)}"); + entries.Should().Equal(reference.Select(kv => $"{kv.Key}={Describe(kv.Value)}={Describe(kv.Value)}")); + enumerator.MoveNext().Should().BeFalse(); + enumerator.Reset(); + enumerator.MoveNext().Should().BeTrue(); + enumerator.Key.Should().Be(reference.Keys.First()); + + var pairs = new KeyValuePair<string, TValue>[reference.Count + 1]; + nonGeneric.CopyTo(pairs, 1); + pairs.Skip(1).Select(kv => kv.Key).Should().Equal(reference.Keys); + var dictionaryEntries = new DictionaryEntry[reference.Count]; + nonGeneric.CopyTo(dictionaryEntries, 0); + dictionaryEntries.Select(e => (string)e.Key).Should().Equal(reference.Keys); + var objects = new object?[reference.Count]; + nonGeneric.CopyTo(objects, 0); + objects.Should().AllBeOfType<KeyValuePair<string, TValue>>(); + Assert.ThrowsExactly<ArgumentException>(() => nonGeneric.CopyTo(new int[reference.Count], 0)); + Assert.ThrowsExactly<ArgumentException>(() => nonGeneric.CopyTo(new object?[reference.Count - 1], 0)); + Assert.ThrowsExactly<ArgumentOutOfRangeException>(() => nonGeneric.CopyTo(objects, -1)); + nonGeneric.IsSynchronized.Should().BeFalse(); + nonGeneric.SyncRoot.Should().BeSameAs(view); + + Assert.ThrowsExactly<NotSupportedException>(() => nonGeneric["k"] = 1); + Assert.ThrowsExactly<NotSupportedException>(() => nonGeneric.Add("k", 1)); + Assert.ThrowsExactly<NotSupportedException>(() => nonGeneric.Remove(reference.Keys.First())); + Assert.ThrowsExactly<NotSupportedException>(() => nonGeneric.Clear()); + + PythonRepr.Repr(view).Should().Be(PythonRepr.Repr(reference)); + } + + CheckView(actual.Params, expected.Params); + CheckView(actual.Distributions, expected.Distributions); + CheckView(actual.UserAttrs, expected.UserAttrs); + CheckView(actual.SystemAttrs, expected.SystemAttrs); + PyJson.Dumps(actual.UserAttrs).Should().Be(PyJson.Dumps(expected.UserAttrs)); + PyJson.Dumps(actual.Params).Should().Be(PyJson.Dumps(expected.Params)); + actual.IsCompact.Should().BeTrue("every read above went through the views"); + } + + /// <summary> + /// Each mutable accessor gives a compact record a real dictionary of its own, returns that same dictionary on every + /// later read, and keeps a change made through it; the other dictionaries stay compact until their own accessor + /// is read. <see cref="FrozenTrial.SetUserAttr" /> and <see cref="FrozenTrial.SetConstraint" /> write through them. + /// </summary> + [TestMethod] + public void MutableAccessors_GiveTheRecordItsOwnDictionary_AndKeepWrites() + { + var (compact, studyId) = WriteEveryKind(compact: true); + var records = compact.GetAllTrials(studyId, deepcopy: false); + FrozenTrial trial = records[0]; + string before = Fingerprint(trial); + + OrderedDict<string, object?> @params = trial.ParamsDict; + Fingerprint(trial).Should().Be(before, "turning a dictionary back changes no content"); + trial.ParamsDict.Should().BeSameAs(@params); + trial.Params.Should().BeSameAs(@params); + trial.Distributions.Should().BeOfType<DistributionsView>("only the parameters were asked for"); + @params["x"] = 0.875; + trial.Params["x"].Should().Be(0.875); + + OrderedDict<string, BaseDistribution> distributions = trial.DistributionsDict; + trial.DistributionsDict.Should().BeSameAs(distributions); + distributions["y"] = new FloatDistribution(0, 2); + trial.Distributions["y"].Should().Be(new FloatDistribution(0, 2)); + + OrderedDict<string, object?> userAttrs = trial.UserAttrsDict; + trial.UserAttrsDict.Should().BeSameAs(userAttrs); + userAttrs["ascii"].Should().Be(new string('q', 100) + 0, "a compacted string comes back as the string"); + trial.SetUserAttr("added", 1L); + trial.UserAttrs["added"].Should().Be(1L); + + OrderedDict<string, object?> systemAttrs = trial.SystemAttrsDict; + trial.SystemAttrsDict.Should().BeSameAs(systemAttrs); + trial.SetConstraint("c", -2.0); + trial.SystemAttrs.Should().ContainKey("constraints:c"); + + FrozenTrial noReports = records[1]; + noReports.IntermediateValuesForRead.Should().BeEmpty(); + noReports.IsCompact.Should().BeTrue(); + OrderedDict<long, double> intermediate = noReports.IntermediateValues; + noReports.IntermediateValues.Should().BeSameAs(intermediate); + intermediate[3] = 1.0; + noReports.IntermediateValues[3].Should().Be(1.0); + noReports.LastStep.Should().Be(3); + + trial.IsCompact.Should().BeFalse(); + records[2].IsCompact.Should().BeTrue("no other record was touched"); + } + + /// <summary> + /// Many threads asking the same compact record for a mutable dictionary at once all get the one dictionary the + /// record keeps (the compare-exchange in <c>FrozenTrial.Decompact</c>), for every accessor, over many records. + /// </summary> + [TestMethod] + public void MutableAccessors_UnderContention_AllReturnTheOneDictionary() + { + var storage = new InMemoryStorage(compactFinishedTrials: true); + var study = Optuna.CreateStudy(storage: storage, sampler: new RandomSampler(seed: 3)); + study.Optimize(t => + { + t.SetUserAttr("u", 1L); + return t.SuggestFloat("x", 0, 1) + t.SuggestInt("n", 0, 3); + }, nTrials: 64); + var records = storage.GetAllTrials(study.StudyId, deepcopy: false); + records.Should().OnlyContain(r => r.IsCompact); + + const int threads = 8; + foreach (FrozenTrial record in records) + { + var seen = new object[threads][]; + using var start = new Barrier(threads); + Parallel.For(0, threads, new ParallelOptions { MaxDegreeOfParallelism = threads }, i => + { + start.SignalAndWait(); + seen[i] = new object[] + { + record.ParamsDict, record.DistributionsDict, record.UserAttrsDict, record.SystemAttrsDict, + record.IntermediateValues, + }; + }); + for (int i = 1; i < threads; i++) + for (int field = 0; field < seen[0].Length; field++) + seen[i][field].Should().BeSameAs(seen[0][field], $"trial {record.Number}, field {field}, thread {i}"); + ((object)record.ParamsDict).Should().BeSameAs(seen[0][0]); + ((object)record.IntermediateValues).Should().BeSameAs(seen[0][4]); + } + } + + // ------------------------------------------------------------------ fallbacks: keep the dictionary when not exact + + /// <summary> + /// A trial whose parameters would not read back identical keeps its parameter dictionary (while its attributes are + /// still compacted): an <c>int</c> under a float distribution (Optuna keeps it an <c>int</c>), an integer beyond + /// 2^53, a categorical choice Python-equal to an earlier one (<c>1.0</c> after <c>1</c>), a value its distribution + /// cannot convert, and names listed in another order than the distributions. + /// </summary> + /// <param name="case">Which inexact trial to add.</param> + [TestMethod] + [DataRow("int-under-float")] + [DataRow("beyond-2^53")] + [DataRow("python-equal-choice")] + [DataRow("unconvertible")] + [DataRow("order")] + public void InexactParameters_KeepTheirDictionary(string @case) + { + var storage = new InMemoryStorage(compactFinishedTrials: true); + int studyId = storage.CreateNewStudy(Minimize, "inexact"); + OrderedDict<string, object?> @params; + OrderedDict<string, BaseDistribution> distributions; + switch (@case) + { + case "int-under-float": + @params = new() { ["x"] = 1 }; + distributions = new() { ["x"] = new FloatDistribution(0, 2) }; + break; + case "beyond-2^53": + @params = new() { ["n"] = (1L << 53) + 1 }; + distributions = new() { ["n"] = new IntDistribution(0, long.MaxValue / 2) }; + break; + case "python-equal-choice": + @params = new() { ["c"] = 1.0 }; + distributions = new() { ["c"] = new CategoricalDistribution(new CategoricalChoice[] { 1L, 1.0 }) }; + break; + case "unconvertible": + @params = new() { ["x"] = "not a number" }; + distributions = new() { ["x"] = new FloatDistribution(0, 2) }; + break; + default: + @params = new() { ["x"] = 0.5, ["y"] = 0.25 }; + distributions = new() { ["y"] = new FloatDistribution(0, 1), ["x"] = new FloatDistribution(0, 1) }; + break; + } + // Built directly (CreateTrial would reject the unconvertible value); the storage adds it already finished. + var template = new FrozenTrial( + number: -1, state: TrialState.Complete, value: 1.0, datetimeStart: DateTime.Now, + datetimeComplete: DateTime.Now, @params: @params, distributions: distributions, + userAttrs: new OrderedDict<string, object?> { ["u"] = new string('a', 80) }, + systemAttrs: new OrderedDict<string, object?>(), intermediateValues: new OrderedDict<long, double>(), + trialId: -1); + int trialId = storage.CreateNewTrial(studyId, template); + + FrozenTrial record = storage.GetTrial(trialId); + record.Params.Should().BeOfType<OrderedDict<string, object?>>(); + record.Distributions.Should().BeOfType<OrderedDict<string, BaseDistribution>>(); + record.UserAttrs.Should().BeOfType<CompactAttrs>("the attributes compact independently"); + record.IsCompact.Should().BeTrue(); + foreach (var (name, value) in @params) + Describe(record.Params[name]).Should().Be(Describe(value), "the stored value, type and all"); + record.Params.Keys.Should().Equal(@params.Keys); + } + + /// <summary> + /// Trials of one search space share one schema, so one distributions view, even with a new categorical + /// distribution per trial; a dynamic space keeps one schema per shape; past <see cref="ParamSchemaCache.MaxSchemas" /> + /// shapes, new shapes keep their dictionaries. + /// </summary> + [TestMethod] + public void Schemas_AreSharedPerShape_AndBounded() + { + var storage = new InMemoryStorage(compactFinishedTrials: true); + var study = Optuna.CreateStudy(storage: storage, sampler: new RandomSampler(seed: 5)); + study.Optimize(t => + { + double x = t.SuggestFloat("x", 0, 1); + CategoricalChoice c = t.SuggestCategorical("c", new CategoricalChoice[] { "a", "b", 3L }); + // A conditional parameter: two shapes. + if (c.Equals((CategoricalChoice)"a")) + t.SuggestInt("only-a", 0, 5); + return x; + }, nTrials: 40); + var records = storage.GetAllTrials(study.StudyId, deepcopy: false); + records.Should().OnlyContain(r => r.Params is CompactParams); + var views = records.Select(r => r.Distributions).Distinct(ReferenceEqualityComparer.Instance).ToList(); + views.Should().HaveCount(2, "one schema per shape, shared across every trial of that shape"); + records.GroupBy(r => r.Params.ContainsKey("only-a")) + .Should().OnlyContain(g => g.Select(r => r.Distributions).Distinct(ReferenceEqualityComparer.Instance).Count() == 1); + + var cache = new ParamSchemaCache(); + var distribution = new FloatDistribution(0, 1); + for (int i = 0; i < ParamSchemaCache.MaxSchemas + 10; i++) + { + ParamSchema? schema = cache.FindOrAdd( + new OrderedDict<string, object?> { [$"p{i}"] = 0.5 }, + new OrderedDict<string, BaseDistribution> { [$"p{i}"] = distribution }); + if (i < ParamSchemaCache.MaxSchemas) + schema.Should().NotBeNull(); + else + schema.Should().BeNull("the cache is full"); + } + cache.Count.Should().Be(ParamSchemaCache.MaxSchemas); + cache.FindOrAdd(new OrderedDict<string, object?> { ["p3"] = 0.1 }, + new OrderedDict<string, BaseDistribution> { ["p3"] = new FloatDistribution(0, 1) }) + .Should().NotBeNull("a known shape is still found when the cache is full"); + } + + /// <summary> + /// The value and distribution identity rules: bits for floating point (-0.0 is not 0.0), type for numbers (1 is + /// not 1.0), characters for strings, the same instance for anything else; categoricals by identical choices, + /// float and integer distributions bitwise, a categorical subclass by reference only; hashes agree with matches. + /// </summary> + [TestMethod] + public void IdentityRules_MatchWhatAReaderCanSee() + { + DistributionIdentity.IsSameValue(0.0, -0.0).Should().BeFalse(); + DistributionIdentity.IsSameValue(1.5, 1.5).Should().BeTrue(); + DistributionIdentity.IsSameValue(1L, 1.0).Should().BeFalse(); + DistributionIdentity.IsSameValue(1L, 1).Should().BeFalse("long and int are different types"); + DistributionIdentity.IsSameValue(2f, 2f).Should().BeTrue(); + DistributionIdentity.IsSameValue(true, true).Should().BeTrue(); + DistributionIdentity.IsSameValue("ab", new string(new[] { 'a', 'b' })).Should().BeTrue(); + DistributionIdentity.IsSameValue(null, null).Should().BeTrue(); + DistributionIdentity.IsSameValue(null, "x").Should().BeFalse(); + DistributionIdentity.IsSameValue(1.0m, 1.00m).Should().BeFalse("decimals print their scale"); + DistributionIdentity.IsSameValue(new List<object?>(), new List<object?>()).Should().BeFalse(); + + CategoricalDistribution Categorical(params CategoricalChoice[] choices) => new(choices); + var pairs = new (BaseDistribution A, BaseDistribution B, bool Interchangeable)[] + { + (Categorical("a", 2L, 2.5), Categorical("a", 2L, 2.5), true), + (Categorical("a", CategoricalChoice.None), Categorical("a", CategoricalChoice.None), true), + (Categorical(1L), Categorical(1.0), false), + (Categorical("a"), Categorical("a", "b"), false), + (new FloatDistribution(0, 1), new FloatDistribution(0, 1), true), + (new FloatDistribution(-0.0, 1), new FloatDistribution(0, 1), false), + (new IntDistribution(0, 9, step: 3), new IntDistribution(0, 9, step: 3), true), + (new IntDistribution(0, 9), new FloatDistribution(0, 9), false), + (new EnumLikeCategorical("a"), new EnumLikeCategorical("a"), false), + }; + foreach (var (a, b, interchangeable) in pairs) + { + DistributionIdentity.AreInterchangeable(a, b).Should().Be(interchangeable, $"{a} vs {b}"); + DistributionIdentity.AreInterchangeable(b, a).Should().Be(interchangeable, $"{b} vs {a}"); + if (interchangeable) + DistributionIdentity.HashOf(a).Should().Be(DistributionIdentity.HashOf(b)); + } + var same = new EnumLikeCategorical("a"); + DistributionIdentity.AreInterchangeable(same, same).Should().BeTrue(); + } + + /// <summary> + /// The fast path's positions: a reader's distribution that converts as the schema's does gets the stored + /// internal value's position, a missing name <see cref="ParamSchema.Absent" />, and a Python-equal but not + /// identical categorical <see cref="ParamSchema.NotInterchangeable" />; at every position the stored value is + /// exactly what the reader's conversion of the external value returns. + /// </summary> + [TestMethod] + public void SchemaPositions_ReturnTheStoredValueOnlyWhereItIsExact() + { + var x = new FloatDistribution(0, 1); + var c = new CategoricalDistribution(new CategoricalChoice[] { 1L, 2L }); + var @params = new OrderedDict<string, object?> { ["x"] = 0.25, ["c"] = 2L }; + var cache = new ParamSchemaCache(); + ParamSchema schema = cache.FindOrAdd(@params, new OrderedDict<string, BaseDistribution> { ["x"] = x, ["c"] = c })!; + CompactParams compact = CompactParams.TryCreate(schema, @params)!; + + var readers = new BaseDistribution[] + { + new CategoricalDistribution(new CategoricalChoice[] { 1L, 2L }), new FloatDistribution(0, 1), + new FloatDistribution(0, 1), new CategoricalDistribution(new CategoricalChoice[] { 1.0, 2.0 }), + }; + int[] positions = schema.PositionsFor(new[] { "c", "x", "missing", "c" }, readers); + positions.Should().Equal(1, 0, ParamSchema.Absent, ParamSchema.NotInterchangeable); + compact.InternalAt(positions[0]).Should().Be(readers[0].ToInternalRepr(compact["c"])); + compact.InternalAt(positions[1]).Should().Be(readers[1].ToInternalRepr(compact["x"])); + readers[3].ToInternalRepr(compact["c"]).Should().Be(1.0, "the slow path still converts the Python-equal choice"); + compact.TryGetInternal("c", out double stored).Should().BeTrue(); + stored.Should().Be(1.0); + compact.TryGetInternal("missing", out _).Should().BeFalse(); + } + + /// <summary>A categorical subclass: only the same instance may stand for it.</summary> + private sealed class EnumLikeCategorical : CategoricalDistribution + { + /// <summary>Builds the subclass over the given choices.</summary> + /// <param name="choices">The choices.</param> + public EnumLikeCategorical(params CategoricalChoice[] choices) : base(choices) + { + } + } + + /// <summary> + /// Strings: shorter than the minimum or non-ASCII stay strings; ASCII becomes one byte a character; lowercase + /// hexadecimal two digits a byte at even and odd lengths; uppercase hexadecimal is only ASCII; every stored form + /// reads back as a new string with the same characters. + /// </summary> + [TestMethod] + public void CompactStrings_RoundTripExactly() + { + CompactString.TryCreate(new string('a', CompactString.MinLength - 1)).Should().BeNull(); + CompactString.TryCreate(new string('é', 100)).Should().BeNull(); + foreach (string text in new[] + { + new string('a', CompactString.MinLength), LowerHex(64), LowerHex(65), LowerHex(2045), + LowerHex(64).ToUpperInvariant(), "0123456789" + LowerHex(70) + " tail", new string('0', 99), + }) + { + CompactString compact = CompactString.TryCreate(text)!; + compact.Should().NotBeNull(text); + string back = compact.Materialize(); + back.Should().Be(text); + back.Should().NotBeSameAs(text); + bool hex = text.All(c => c is (>= '0' and <= '9') or (>= 'a' and <= 'f')); + compact.IsHex.Should().Be(hex, text); + compact.StoredBytes.Should().Be(hex ? text.Length / 2 : text.Length); + } + } + + // ------------------------------------------------------------------ samplers: same trials, records stay compact + + /// <summary> + /// Each sampler family runs the same seeded study on Optuna's representation and on the compact storage: every + /// trial's parameters, values, attributes, intermediate values and repr are identical, and every finished record + /// is still compact at the end, so no sampler read gave a record its dictionaries back. + /// </summary> + /// <param name="kind">The sampler (and pruner or constraint) under test.</param> + [TestMethod] + [DataRow("random")] + [DataRow("tpe")] + [DataRow("tpe-independent")] + [DataRow("tpe-group")] + [DataRow("tpe-equal-choices")] + [DataRow("tpe-pruned")] + [DataRow("motpe-constrained")] + [DataRow("cmaes")] + [DataRow("cmaes-separable")] + [DataRow("nsgaii-constrained")] + [DataRow("nsgaiii")] + [DataRow("qmc")] + [DataRow("gp")] + [DataRow("bruteforce")] + [DataRow("grid")] + public void Samplers_GiveTheSameTrials_AndLeaveRecordsCompact(string kind) + { + List<string> plain = RunStudy(kind, compact: false, out _); + List<string> compact = RunStudy(kind, compact: true, out List<FrozenTrial> records); + + compact.Should().Equal(plain); + records.Where(r => r.State.IsFinished()).Should().OnlyContain(r => r.IsCompact && r.Params is CompactParams, + "every sampler reads finished records through the read-only accessors"); + records.Should().Contain(r => r.State == TrialState.Complete); + } + + /// <summary>Runs one seeded study of a sampler family and describes its trials.</summary> + /// <param name="kind">The sampler (and pruner or constraint) to use.</param> + /// <param name="compact">Whether the storage compacts finished trials.</param> + /// <param name="records">The storage's records after the run.</param> + /// <returns>One fingerprint per trial, in number order.</returns> + /// <exception cref="ArgumentOutOfRangeException"><paramref name="kind" /> names no sampler family.</exception> + /// <exception cref="TrialPruned">Never escapes: the pruned objective throws it inside the optimize loop, which records the trial as pruned.</exception> + private static List<string> RunStudy(string kind, bool compact, out List<FrozenTrial> records) + { + var storage = new InMemoryStorage(compactFinishedTrials: compact); + Func<FrozenTrial, IEnumerable<double>> constraints = t => new[] { (double)t.Params["x"]! - 1.0 }; + bool twoObjectives = kind is "motpe-constrained" or "nsgaii-constrained" or "nsgaiii"; + BaseSampler sampler = kind switch + { + "random" => new RandomSampler(seed: 11), + "tpe" => new TPESampler(seed: 11, multivariate: true, nStartupTrials: 5), + "tpe-independent" => new TPESampler(seed: 11, nStartupTrials: 5), + "tpe-group" => new TPESampler(seed: 11, multivariate: true, group: true, nStartupTrials: 5), + "tpe-equal-choices" => new TPESampler(seed: 11, multivariate: true, nStartupTrials: 5), + "tpe-pruned" => new TPESampler(seed: 11, nStartupTrials: 5), + "motpe-constrained" => new TPESampler(seed: 11, nStartupTrials: 5, constraintsFunc: constraints), + "cmaes" => new CmaEsSampler(seed: 11), + "cmaes-separable" => new CmaEsSampler(seed: 11, useSeparableCma: true), + "nsgaii-constrained" => new NSGAIISampler(populationSize: 8, seed: 11, constraintsFunc: constraints), + "nsgaiii" => new NSGAIIISampler(populationSize: 8, seed: 11), + "qmc" => new QMCSampler(seed: 11), + "gp" => new GPSampler(seed: 11, nStartupTrials: 4), + "bruteforce" => new BruteForceSampler(seed: 11), + "grid" => new GridSampler(new Dictionary<string, IReadOnlyList<CategoricalChoice>> + { + ["x"] = new CategoricalChoice[] { -1.0, 0.0, 2.5 }, + ["c"] = new CategoricalChoice[] { "a", 3L }, + }, seed: 11), + _ => throw new ArgumentOutOfRangeException(nameof(kind)), + }; + BasePruner? pruner = kind == "tpe-pruned" ? new MedianPruner(nStartupTrials: 2) : null; + var study = Optuna.CreateStudy( + storage: storage, sampler: sampler, pruner: pruner, + directions: twoObjectives ? new[] { StudyDirection.Minimize, StudyDirection.Maximize } : Minimize); + int nTrials = kind switch + { + "gp" => 10, + "grid" => 6, + "bruteforce" => 12, + "tpe" or "tpe-independent" or "tpe-group" or "tpe-equal-choices" or "tpe-pruned" or "motpe-constrained" => 25, + _ => 40, + }; + + double[] Evaluate(Trial trial) + { + double x; + CategoricalChoice c; + if (kind == "bruteforce") + { + x = trial.SuggestFloat("x", -1, 1, step: 0.5); + trial.SuggestInt("n", 0, 1); + c = trial.SuggestCategorical("c", new CategoricalChoice[] { "a", true }); + } + else if (kind == "grid") + { + x = trial.SuggestFloat("x", -1, 3); + c = trial.SuggestCategorical("c", new CategoricalChoice[] { "a", 3L }); + } + else + { + x = trial.SuggestFloat("x", -5, 5); + if (kind != "gp") + { + trial.SuggestFloat("lx", 1e-3, 1e3, log: true); + trial.SuggestFloat("sx", -1, 1, step: 0.25); + trial.SuggestInt("ln", 1, 64, log: true); + } + trial.SuggestInt("n", -3, 3); + c = trial.SuggestCategorical("c", new CategoricalChoice[] { "a", "b", CategoricalChoice.None, 7L, 2.5 }); + if (kind == "tpe-group" && c.Equals((CategoricalChoice)"a")) + trial.SuggestFloat("only-a", 0, 1); + // Python-equal choices that are not identical (1 and 1.0): the search space keeps the first trial's + // distribution, which reads the other variant's compact trials through their external values. + if (kind == "tpe-equal-choices") + { + trial.SuggestCategorical("e", trial.Number % 2 == 0 + ? new CategoricalChoice[] { 1L, 2L } + : new CategoricalChoice[] { 1.0, 2.0 }); + } + } + trial.SetUserAttr("blob", new string('q', 90) + trial.Number); + trial.SetUserAttr("hex", LowerHex(65 + trial.Number % 3)); + trial.SetUserAttr("nested", new List<object?> { (long)trial.Number, "two", 3.5 }); + double value = x * x + (c.Value is string ? 0 : 1); + if (kind == "tpe-pruned") + { + for (int step = 0; step < 4; step++) + { + trial.Report(value + 1.0 / (step + 1), step); + if (trial.ShouldPrune()) + throw new TrialPruned(); + } + } + return twoObjectives ? new[] { value, -x } : new[] { value }; + } + + study.Optimize(t => (IReadOnlyList<double>)Evaluate(t), nTrials: nTrials); + records = storage.GetAllTrials(study.StudyId, deepcopy: false); + // Fingerprints read only through the read-only accessors, so they cannot undo compaction themselves. + return records.Select(Fingerprint).ToList(); + } + + /// <summary> + /// A CMA-ES study stores its optimizer state as 2,045-digit lowercase hexadecimal chunks in system attributes; + /// the compact storage keeps them as bytes (two digits a byte), the sampler restores from them, and a second + /// process-free reload of the same storage continues to the same trials. + /// </summary> + [TestMethod] + public void CmaEsOptimizerState_IsStoredAsBytes_AndRestores() + { + static List<string> Run(InMemoryStorage storage, int seed) + { + var study = Optuna.CreateStudy(storage: storage, sampler: new CmaEsSampler(seed: seed), studyName: "cma", + loadIfExists: true); + study.Optimize(t => Enumerable.Range(0, 6).Sum(i => Math.Pow(t.SuggestFloat($"x{i}", -3, 3) - 1, 2)), nTrials: 40); + return storage.GetAllTrials(study.StudyId, deepcopy: false).Select(Fingerprint).ToList(); + } + + var plain = new InMemoryStorage(); + var compact = new InMemoryStorage(compactFinishedTrials: true); + Run(compact, 2).Should().Equal(Run(plain, 2)); + // A new sampler over the same storage restores the optimizer from the stored chunks. + Run(compact, 3).Should().Equal(Run(plain, 3)); + + var holders = compact.GetAllTrials(0, deepcopy: false) + .Where(r => r.SystemAttrs.Keys.Any(k => k.StartsWith("cma:optimizer", StringComparison.Ordinal))) + .ToList(); + holders.Should().NotBeEmpty(); + foreach (FrozenTrial holder in holders) + { + var attrs = (CompactAttrs)holder.SystemAttrs; + foreach (string key in holder.SystemAttrs.Keys.Where(k => k.StartsWith("cma:optimizer", StringComparison.Ordinal))) + attrs.StoredValue(key).Should().BeOfType<CompactString>().Which.IsHex.Should().BeTrue(key); + } + } + + // ------------------------------------------------------------------ concurrency + + /// <summary> + /// Four workers optimize one compact study while other threads read every record through both kinds of + /// accessor: no read fails or sees a partial record, every finished record that only the read-only accessors + /// touched is still compact, and each record's contents never change between reads. + /// </summary> + [TestMethod] + public void ParallelWorkers_AndReaders_SeeConsistentRecords() + { + var storage = new InMemoryStorage(compactFinishedTrials: true); + var study = Optuna.CreateStudy(storage: storage, sampler: new TPESampler(seed: 7, nStartupTrials: 5)); + using var stop = new CancellationTokenSource(); + var failures = new List<Exception>(); + var firstSeen = new System.Collections.Concurrent.ConcurrentDictionary<int, string>(); + var readers = Enumerable.Range(0, 3).Select(r => Task.Run(() => + { + try + { + while (!stop.IsCancellationRequested) + { + foreach (FrozenTrial record in study.GetTrials(deepcopy: false)) + { + if (!record.State.IsFinished()) + continue; + string fingerprint = Fingerprint(record); + string first = firstSeen.GetOrAdd(record.Number, fingerprint); + if (first != fingerprint) + throw new InvalidOperationException($"trial {record.Number} changed between reads"); + // One reader also takes the mutable dictionaries of every third record. + if (r == 0 && record.Number % 3 == 0) + _ = record.ParamsDict.Count + record.UserAttrsDict.Count; + } + } + } + catch (Exception exception) + { + lock (failures) + failures.Add(exception); + } + })).ToArray(); + + study.Optimize(t => + { + t.SetUserAttr("blob", new string('w', 70)); + return Math.Pow(t.SuggestFloat("x", -2, 2), 2) + t.SuggestInt("n", 0, 3); + }, nTrials: 60, nJobs: 4); + stop.Cancel(); + Task.WaitAll(readers); + + failures.Should().BeEmpty(); + var records = storage.GetAllTrials(study.StudyId, deepcopy: false); + records.Should().HaveCount(60).And.OnlyContain(r => r.State == TrialState.Complete); + records.Where(r => r.Number % 3 != 0).Should().OnlyContain(r => r.IsCompact); + foreach (FrozenTrial record in records) + if (firstSeen.TryGetValue(record.Number, out string? seen)) + Fingerprint(record).Should().Be(seen); + } + + // ------------------------------------------------------------------ memory + + /// <summary> + /// What the switch is for: a finished 40-parameter random-search study retains at most a quarter of the memory + /// in the compact storage (measured about 0.76 KB against 6.8 KB a trial at 1,000 trials, 0.65 KB against + /// 6.7 KB at 5,000). + /// </summary> + [TestMethod] + [DoNotParallelize] + public void CompactStorage_RetainsAFractionOfTheMemory() + { + int verbosity = OptunaLogging.GetVerbosity(); + // Each finished trial logs a line with all its parameters at INFO, and the test host keeps every line it + // captures: about 2.3 KB a trial, more than the compact record itself, in both measurements. + OptunaLogging.SetVerbosity(LogLevel.Warning); + try + { + // A first study pays for the statics and the JIT of both paths outside the measurements. + RetainedBytes(compact: true, trials: 200); + long plain = RetainedBytes(compact: false, trials: 1000); + long compact = RetainedBytes(compact: true, trials: 1000); + compact.Should().BeLessThan(plain / 4, $"compact {compact / 1000.0:F0} KB against {plain / 1000.0:F0} KB"); + } + finally + { + OptunaLogging.SetVerbosity(verbosity); + } + } + + /// <summary>The heap a finished 40-parameter random-search study keeps alive.</summary> + /// <param name="compact">Whether the storage compacts finished trials.</param> + /// <param name="trials">Number of trials to run.</param> + /// <returns>Bytes retained by the storage and the study after a full collection.</returns> + [MethodImpl(MethodImplOptions.NoInlining)] + private static long RetainedBytes(bool compact, int trials) + { + string[] names = Enumerable.Range(0, 40).Select(i => "x" + i).ToArray(); + long before = GC.GetTotalMemory(forceFullCollection: true); + var storage = new InMemoryStorage(compactFinishedTrials: compact); + var study = Optuna.CreateStudy(storage: storage, sampler: new RandomSampler(seed: 0)); + study.Optimize(t => names.Sum(n => t.SuggestFloat(n, -10, 10)), nTrials: trials); + long after = GC.GetTotalMemory(forceFullCollection: true); + GC.KeepAlive(storage); + GC.KeepAlive(study); + return after - before; + } +} diff --git a/test/OptunaSharp.Tests/Storages/InMemoryStorageInPlaceWritesTests.cs b/test/OptunaSharp.Tests/Storages/InMemoryStorageInPlaceWritesTests.cs new file mode 100644 index 0000000..ac481e9 --- /dev/null +++ b/test/OptunaSharp.Tests/Storages/InMemoryStorageInPlaceWritesTests.cs @@ -0,0 +1,502 @@ +using System; +using System.Collections.Generic; +using System.Linq; +using AwesomeAssertions; +using NumSharp; +using OptunaSharp.Collections; +using OptunaSharp.Distributions; +using OptunaSharp.Samplers; +using OptunaSharp.Storages; + +namespace OptunaSharp.Tests.Storages; + +/// <summary> +/// Plan 13 (docs/plans/13-rustuna-derived-performance.md), phase 2. Item S4: <see cref="InMemoryStorage" /> writes a +/// running trial's record in place while no reader holds it, and copies it first otherwise, so a record any read +/// returned never changes under its reader (Optuna's copy-on-write contract). Item S7: bitwise-identical float and +/// integer distributions and the parameter names are shared across a study's trials, never a categorical, a -0.0 +/// bound or a distribution of another runtime type. +/// </summary> +[TestClass] +public class InMemoryStorageInPlaceWritesTests +{ + private static readonly StudyDirection[] Minimize = { StudyDirection.Minimize }; + + // ------------------------------------------------------------------ S4: snapshots never change + + /// <summary> + /// Every way a caller can receive a stored record (or one of its dictionaries) is read, and then each kind of write + /// lands twice in a row: a parameter, an intermediate value, a user attribute, a system attribute. What the reader + /// holds stays exactly as it was read through every write, while a fresh read sees every write. + /// </summary> + /// <param name="readPath">The read under test; see <see cref="Snapshot" /> for the list.</param> + [TestMethod] + [DataRow("get-trial")] + [DataRow("all-trials")] + [DataRow("all-trials-running")] + [DataRow("all-trials-waiting")] + [DataRow("view-indexer")] + [DataRow("view-enumerator")] + [DataRow("trial-params")] + [DataRow("trial-user-attrs")] + [DataRow("trial-system-attrs")] + [DataRow("best-trial-of-another")] + public void EveryReadPath_KeepsItsSnapshot_ThroughEveryKindOfWrite(string readPath) + { + var storage = new InMemoryStorage(); + int studyId = storage.CreateNewStudy(Minimize, "snapshots"); + // A completed trial first, so the best-trial path has something to return and the view is longer than one. + int done = storage.CreateNewTrial(studyId); + storage.SetTrialParam(done, "x", 0.5, new FloatDistribution(0, 1)); + storage.SetTrialStateValues(done, TrialState.Complete, new[] { 1.0 }); + + int trialId = readPath == "all-trials-waiting" + ? storage.CreateNewTrial(studyId, FrozenTrial.CreateTrial(state: TrialState.Waiting)) + : storage.CreateNewTrial(studyId); + storage.SetTrialParam(trialId, "x", 0.25, new FloatDistribution(0, 1)); + storage.SetTrialUserAttr(trialId, "seed", 1L); + + var held = new List<(Func<string> Fingerprint, string Expected)>(); + var writes = new (string Name, Action<int> Write)[] + { + ("param", k => storage.SetTrialParam(trialId, $"p{k}", 0.125 * k, new FloatDistribution(0, 10))), + ("intermediate", k => storage.SetTrialIntermediateValue(trialId, k, k * 1.5)), + ("user attr", k => storage.SetTrialUserAttr(trialId, $"u{k}", k)), + ("system attr", k => storage.SetTrialSystemAttr(trialId, $"s{k}", $"v{k}")), + }; + + int step = 0; + foreach (var (name, write) in writes) + { + Func<string> fingerprint = Snapshot(storage, studyId, trialId, done, readPath); + held.Add((fingerprint, fingerprint())); + // Two in a row: the first copies (the reader holds the record), the second goes in place on the copy. + write(step++); + write(step++); + + foreach (var (heldFingerprint, expected) in held) + heldFingerprint().Should().Be(expected, $"a {readPath} snapshot must not see the {name} writes after it"); + } + + // Every write landed on the stored record. + FrozenTrial current = storage.GetTrial(trialId); + current.Params.Keys.Should().Contain(new[] { "x", "p0", "p1" }); + current.IntermediateValues.Keys.Should().Equal(2L, 3L); + current.UserAttrs.Keys.Should().Equal("seed", "u4", "u5"); + current.SystemAttrs.Keys.Should().Contain(new[] { "s6", "s7" }); + } + + /// <summary> + /// Reads a stored record, or one of its dictionaries, through <paramref name="readPath" /> and returns a function + /// that fingerprints what the reader holds, so a later call shows whether it changed. + /// </summary> + /// <param name="storage">The storage under test.</param> + /// <param name="studyId">The study holding both trials.</param> + /// <param name="trialId">The running (or waiting) trial being written.</param> + /// <param name="doneId">A completed trial of the same study.</param> + /// <param name="readPath"> + /// <c>get-trial</c>, <c>all-trials</c> (no state filter), <c>all-trials-running</c>, <c>all-trials-waiting</c>, + /// <c>view-indexer</c>, <c>view-enumerator</c>, <c>trial-params</c>, <c>trial-user-attrs</c>, + /// <c>trial-system-attrs</c>, or <c>best-trial-of-another</c> (the completed trial, held while the other is + /// written, together with the running record read through <c>GetTrial</c>). + /// </param> + /// <returns>A function returning the fingerprint of what was read.</returns> + /// <exception cref="ArgumentOutOfRangeException"><paramref name="readPath" /> is not one of the listed reads.</exception> + private static Func<string> Snapshot(InMemoryStorage storage, int studyId, int trialId, int doneId, string readPath) + { + switch (readPath) + { + case "get-trial": + return FingerprintOf(storage.GetTrial(trialId)); + case "all-trials": + return FingerprintOf(storage.GetAllTrials(studyId, deepcopy: false).Single(t => t.TrialId == trialId)); + case "all-trials-running": + return FingerprintOf(storage.GetAllTrials(studyId, deepcopy: false, states: new[] { TrialState.Running }).Single()); + case "all-trials-waiting": + return FingerprintOf(storage.GetAllTrials(studyId, deepcopy: false, states: new[] { TrialState.Waiting }).Single()); + case "view-indexer": + return FingerprintOf(storage.GetTrialsPrefixView(studyId)[1]); + case "view-enumerator": + return FingerprintOf(storage.GetTrialsPrefixView(studyId).Single(t => t.TrialId == trialId)); + case "trial-params": + return FingerprintOf(storage.GetTrialParams(trialId)); + case "trial-user-attrs": + return FingerprintOf(storage.GetTrialUserAttrs(trialId)); + case "trial-system-attrs": + return FingerprintOf(storage.GetTrialSystemAttrs(trialId)); + case "best-trial-of-another": + { + Func<string> best = FingerprintOf(storage.GetBestTrial(studyId)); + storage.GetBestTrial(studyId).TrialId.Should().Be(doneId); + Func<string> running = FingerprintOf(storage.GetTrial(trialId)); + return () => best() + "|" + running(); + } + default: + throw new ArgumentOutOfRangeException(nameof(readPath), readPath, "Unknown read path."); + } + } + + /// <summary>Fingerprints a record by its Python repr, which prints every dictionary, its state and values.</summary> + /// <param name="trial">The record a reader holds.</param> + /// <returns>A function returning the record's repr at the time of the call.</returns> + private static Func<string> FingerprintOf(FrozenTrial trial) => () => trial.ToString(); + + /// <summary>Fingerprints a dictionary a reader holds, its keys and values in order.</summary> + /// <param name="dictionary">The dictionary a read returned.</param> + /// <returns>A function returning the dictionary's entries at the time of the call.</returns> + private static Func<string> FingerprintOf(IReadOnlyDictionary<string, object?> dictionary) + => () => string.Join(";", dictionary.Select(kv => $"{kv.Key}={kv.Value}")); + + /// <summary> + /// A deep copy taken by the caller holds nothing of the storage's, so the stored record stays writable in place; + /// the copy itself never sees a later write. + /// </summary> + [TestMethod] + public void DeepCopiedReads_LeaveTheStoredRecordWritableInPlace_AndNeverChange() + { + var storage = new InMemoryStorage(); + int studyId = storage.CreateNewStudy(Minimize, "deep"); + int trialId = storage.CreateNewTrial(studyId); + storage.SetTrialParam(trialId, "x", 0.25, new FloatDistribution(0, 1)); + + FrozenTrial copy = storage.GetAllTrials(studyId, deepcopy: true).Single(); + string before = copy.ToString(); + storage.SetTrialParam(trialId, "y", 0.5, new FloatDistribution(0, 1)); + storage.SetTrialUserAttr(trialId, "k", 1L); + + copy.ToString().Should().Be(before); + storage.WriteCopyCount.Should().Be(0, "a deep copy holds none of the stored record's dictionaries"); + } + + // ------------------------------------------------------------------ S4: in place when nobody holds the record + + /// <summary> + /// A running trial that nobody read is written in place however many writes land, and a read that does not hand out + /// the stored record (a deep copy, the internal-repr parameter, a state filter that skips the trial, making a view) + /// keeps it that way. Each read that hands the record out makes exactly the next write copy it, once; that includes + /// a count, which Optuna's base storage takes through <c>GetAllTrials(deepcopy: false)</c>. + /// </summary> + [TestMethod] + public void WritesNobodyReadsBetween_GoInPlace_AndEachHandOutCostsOneCopy() + { + var storage = new InMemoryStorage(); + int studyId = storage.CreateNewStudy(Minimize, "in-place"); + int trialId = storage.CreateNewTrial(studyId); + + // A trial's suggestions and attributes, nobody reading between: Optuna copied the record for each of these. + for (int i = 0; i < 20; i++) + storage.SetTrialParam(trialId, $"x{i}", 0.5, new FloatDistribution(0, 1)); + storage.SetTrialUserAttr(trialId, "u", 1L); + storage.SetTrialSystemAttr(trialId, "s", 1L); + storage.SetTrialIntermediateValue(trialId, 0, 0.5); + storage.WriteCopyCount.Should().Be(0); + + // Reads that do not hand the stored record out. + _ = storage.GetAllTrials(studyId, deepcopy: true); + _ = storage.GetTrialParam(trialId, "x0"); + _ = storage.GetAllTrials(studyId, deepcopy: false, states: new[] { TrialState.Complete }); + _ = storage.GetTrialsPrefixView(studyId); // a view hands a record out when it is read, not when it is made + WriteThrice(storage, trialId, "a"); + storage.WriteCopyCount.Should().Be(0); + + // Each read that hands it out: exactly one copy on the next write, then in place again. + int expected = 0; + foreach (Action read in new Action[] + { + () => storage.GetTrial(trialId), + () => storage.GetAllTrials(studyId, deepcopy: false), + () => storage.GetAllTrials(studyId, deepcopy: false, states: new[] { TrialState.Running }), + () => _ = storage.GetTrialsPrefixView(studyId)[0], + () => _ = storage.GetTrialsPrefixView(studyId).ToList(), + () => storage.GetTrialParams(trialId), + () => storage.GetTrialUserAttrs(trialId), + () => storage.GetTrialSystemAttrs(trialId), + () => storage.GetNTrials(studyId), + }) + { + read(); + WriteThrice(storage, trialId, $"r{expected}"); + storage.WriteCopyCount.Should().Be(++expected); + } + } + + /// <summary>Writes a parameter, a user attribute and a system attribute named after <paramref name="tag" />.</summary> + /// <param name="storage">The storage under test.</param> + /// <param name="trialId">The running trial to write.</param> + /// <param name="tag">Makes the names unique per call.</param> + private static void WriteThrice(InMemoryStorage storage, int trialId, string tag) + { + storage.SetTrialParam(trialId, $"p_{tag}", 0.5, new FloatDistribution(0, 1)); + storage.SetTrialUserAttr(trialId, $"u_{tag}", 1L); + storage.SetTrialSystemAttr(trialId, $"s_{tag}", 1L); + } + + /// <summary> + /// A state change publishes a new record that shares the old one's dictionaries, so its first write copies; a trial + /// created from a template owns deep copies, so its writes go in place and never reach the template. + /// </summary> + [TestMethod] + public void AStateChange_MakesTheNextWriteCopy_AndATemplatedTrialNeverWritesItsTemplate() + { + var storage = new InMemoryStorage(); + int studyId = storage.CreateNewStudy(Minimize, "states"); + var template = FrozenTrial.CreateTrial(state: TrialState.Waiting); + template.UserAttrsDict["from"] = "template"; + string templateBefore = template.ToString(); + + int trialId = storage.CreateNewTrial(studyId, template); + storage.SetTrialUserAttr(trialId, "k", 1L); + storage.SetTrialParam(trialId, "x", 0.5, new FloatDistribution(0, 1)); + storage.WriteCopyCount.Should().Be(0); + template.ToString().Should().Be(templateBefore, "the stored record owns copies of the template's dictionaries"); + + FrozenTrial waiting = storage.GetAllTrials(studyId, deepcopy: false, states: new[] { TrialState.Waiting }).Single(); + storage.SetTrialStateValues(trialId, TrialState.Running).Should().BeTrue(); + storage.SetTrialUserAttr(trialId, "after", 2L); + storage.SetTrialUserAttr(trialId, "after2", 3L); + storage.WriteCopyCount.Should().Be(1, "the running record shares the waiting record's dictionaries, once"); + waiting.UserAttrs.Keys.Should().Equal("from", "k"); + waiting.State.Should().Be(TrialState.Waiting); + } + + /// <summary> + /// The view keeps its documented liveness: each read returns the trial's current record, whether the write after + /// the previous read went in place or through a copy; a finished record is returned as stored, without a copy. + /// </summary> + [TestMethod] + public void TheView_ReturnsTheCurrentRecordOnEveryRead_AndFinishedRecordsAsStored() + { + var storage = new InMemoryStorage(); + int studyId = storage.CreateNewStudy(Minimize, "view"); + int trialId = storage.CreateNewTrial(studyId); + IReadOnlyList<FrozenTrial> view = storage.GetTrialsPrefixView(studyId); + + storage.SetTrialParam(trialId, "x", 0.25, new FloatDistribution(0, 1)); + view[0].Params.Keys.Should().Equal("x"); // written in place before this first read + storage.SetTrialParam(trialId, "y", 0.25, new FloatDistribution(0, 1)); + view[0].Params.Keys.Should().Equal("x", "y"); // written through a copy after the read + view.Single().Params.Keys.Should().Equal("x", "y"); + + storage.SetTrialStateValues(trialId, TrialState.Complete, new[] { 2.0 }); + FrozenTrial finished = view[0]; + finished.State.Should().Be(TrialState.Complete); + view[0].Should().BeSameAs(finished, "a finished record is never written again, so it is returned as stored"); + storage.GetTrial(trialId).Should().BeSameAs(finished); + } + + /// <summary>A finished trial still refuses every write, so its record is never changed in place.</summary> + [TestMethod] + public void AFinishedTrial_RefusesWrites_SoItsRecordNeverChanges() + { + var storage = new InMemoryStorage(); + int studyId = storage.CreateNewStudy(Minimize, "finished"); + int trialId = storage.CreateNewTrial(studyId); + storage.SetTrialStateValues(trialId, TrialState.Complete, new[] { 1.0 }); + FrozenTrial record = storage.GetTrialsPrefixView(studyId)[0]; + string before = record.ToString(); + + Action param = () => storage.SetTrialParam(trialId, "x", 0.5, new FloatDistribution(0, 1)); + Action attr = () => storage.SetTrialUserAttr(trialId, "k", 1L); + Action report = () => storage.SetTrialIntermediateValue(trialId, 0, 1.0); + param.Should().Throw<UpdateFinishedTrialError>(); + attr.Should().Throw<UpdateFinishedTrialError>(); + report.Should().Throw<UpdateFinishedTrialError>(); + record.ToString().Should().Be(before); + storage.WriteCopyCount.Should().Be(0); + } + + /// <summary> + /// A study driven through ask/suggest/tell costs about one copy per trial instead of one per write: the trial's + /// own read when it starts is the only hand-out between its suggestions. + /// </summary> + [TestMethod] + public void AnAskTellLoop_CopiesAboutOncePerTrial_NotOncePerWrite() + { + var storage = new InMemoryStorage(); + Study study = Optuna.CreateStudy(storage: storage, sampler: new RandomSampler(3)); + const int trials = 25, parameters = 12; + for (int n = 0; n < trials; n++) + { + Trial trial = study.Ask(); + double sum = 0; + for (int i = 0; i < parameters; i++) + sum += trial.SuggestFloat($"x{i}", -1, 1); + trial.SetUserAttr("sum", sum); + study.Tell(trial, sum * sum); + } + + // Optuna copies per write: 25 x 13. One copy per trial is the trial's own read at Ask. + storage.WriteCopyCount.Should().BeLessThanOrEqualTo(trials); + study.Trials.Should().HaveCount(trials); + study.Trials.Should().OnlyContain(t => t.Params.Count == parameters && t.UserAttrs.ContainsKey("sum")); + } + + // ------------------------------------------------------------------ S7: shared distributions and names + + /// <summary> + /// Float and integer distributions identical to the bit are shared across the study's trials, so the second + /// trial's record holds the first trial's instance; a compatible but different one keeps the caller's instance. + /// </summary> + [TestMethod] + public void BitwiseIdenticalFloatAndIntDistributions_AreShared_AndOthersKeepTheCallersInstance() + { + var storage = new InMemoryStorage(); + int studyId = storage.CreateNewStudy(Minimize, "shared"); + int first = storage.CreateNewTrial(studyId); + storage.SetTrialParam(first, "f", 0.5, new FloatDistribution(0, 1)); + storage.SetTrialParam(first, "s", 0.5, new FloatDistribution(0, 1, step: 0.25)); + storage.SetTrialParam(first, "i", 3, new IntDistribution(1, 9)); + + int second = storage.CreateNewTrial(studyId); + storage.SetTrialParam(second, "f", 0.25, new FloatDistribution(0, 1)); + storage.SetTrialParam(second, "s", 0.25, new FloatDistribution(0, 1, step: 0.25)); + storage.SetTrialParam(second, "i", 5, new IntDistribution(1, 9)); + + FrozenTrial a = storage.GetTrial(first), b = storage.GetTrial(second); + b.Distributions["f"].Should().BeSameAs(a.Distributions["f"]); + b.Distributions["s"].Should().BeSameAs(a.Distributions["s"]); + b.Distributions["i"].Should().BeSameAs(a.Distributions["i"]); + b.Params["f"].Should().Be(0.25); + b.Params["i"].Should().Be(5L); + + // Compatible (same kind and log flag) but not identical: the trial keeps what the caller passed. + var wider = new FloatDistribution(0, 2); + var stepped = new IntDistribution(1, 9, step: 2); + int third = storage.CreateNewTrial(studyId); + storage.SetTrialParam(third, "f", 1.5, wider); + storage.SetTrialParam(third, "i", 3, stepped); + FrozenTrial c = storage.GetTrial(third); + c.Distributions["f"].Should().BeSameAs(wider); + c.Distributions["i"].Should().BeSameAs(stepped); + } + + /// <summary> + /// A -0.0 bound equals 0.0 but prints differently, so a trial given one keeps its own instance and its repr shows + /// Python's <c>-0.0</c>. + /// </summary> + [TestMethod] + public void ANegativeZeroBound_KeepsTheCallersInstance_AndItsRepr() + { + var storage = new InMemoryStorage(); + int studyId = storage.CreateNewStudy(Minimize, "negative-zero"); + int first = storage.CreateNewTrial(studyId); + storage.SetTrialParam(first, "x", 0.5, new FloatDistribution(0.0, 1)); + + var negativeZero = new FloatDistribution(-0.0, 1); + int second = storage.CreateNewTrial(studyId); + storage.SetTrialParam(second, "x", 0.5, negativeZero); + + FrozenTrial b = storage.GetTrial(second); + b.Distributions["x"].Should().BeSameAs(negativeZero); + b.Distributions["x"].ToString().Should().Contain("low=-0.0"); + storage.GetTrial(first).Distributions["x"].ToString().Should().Contain("low=0.0"); + } + + /// <summary> + /// Categorical distributions are never shared: equal choices may be different objects (Python calls 1 and 1.0 + /// equal), and each trial must report the choice object of the distribution it was given. + /// </summary> + [TestMethod] + public void CategoricalDistributions_AreNeverShared_SoEachTrialReportsItsOwnChoices() + { + var storage = new InMemoryStorage(); + int studyId = storage.CreateNewStudy(Minimize, "categorical"); + var ints = new CategoricalDistribution(new CategoricalChoice[] { 1, 2 }); + var sameInts = new CategoricalDistribution(new CategoricalChoice[] { 1, 2 }); + var doubles = new CategoricalDistribution(new CategoricalChoice[] { 1.0, 2.0 }); + + int first = storage.CreateNewTrial(studyId); + storage.SetTrialParam(first, "c", 0, ints); + int second = storage.CreateNewTrial(studyId); + storage.SetTrialParam(second, "c", 0, sameInts); + int third = storage.CreateNewTrial(studyId); + storage.SetTrialParam(third, "c", 0, doubles); // compatible: Python equality + + storage.GetTrial(second).Distributions["c"].Should().BeSameAs(sameInts); + storage.GetTrial(third).Distributions["c"].Should().BeSameAs(doubles); + storage.GetTrial(first).Params["c"].Should().Be(1L); + storage.GetTrial(third).Params["c"].Should().BeOfType<double>().And.Be(1.0); + } + + /// <summary> + /// Parameter names built per suggestion are stored once per study: every trial's dictionaries key on the first + /// trial's string instance, and the names still compare and print as given. + /// </summary> + [TestMethod] + public void ParameterNamesBuiltPerSuggestion_AreStoredOncePerStudy() + { + var storage = new InMemoryStorage(); + int studyId = storage.CreateNewStudy(Minimize, "names"); + var trialIds = new List<int>(); + for (int n = 0; n < 3; n++) + { + int trialId = storage.CreateNewTrial(studyId); + trialIds.Add(trialId); + // A new string instance per call, as $"x{i}" in an objective makes one. + storage.SetTrialParam(trialId, new string("lr".ToCharArray()), 0.5, new FloatDistribution(0, 1)); + } + + string key = storage.GetTrial(trialIds[0]).Params.Keys.Single(); + foreach (int trialId in trialIds) + { + FrozenTrial trial = storage.GetTrial(trialId); + trial.Params.Keys.Single().Should().BeSameAs(key); + trial.Distributions.Keys.Single().Should().BeSameAs(key); + trial.Params.Keys.Single().Should().Be("lr"); + } + } + + /// <summary> + /// The rule behind S7, case by case: the same instance, or the same runtime type with identical bits; never a + /// categorical pair, a deprecated subclass against its base, two kinds, or bounds that differ only in the sign of + /// zero. + /// </summary> + [TestMethod] + public void IsBitwiseIdentical_TheSameInstanceOrTheSameTypeAndBits_NeverCategoricals() + { + var categorical = new CategoricalDistribution(new CategoricalChoice[] { "a", "b" }); + Distribution.IsBitwiseIdentical(categorical, categorical).Should().BeTrue(); + Distribution.IsBitwiseIdentical(categorical, new CategoricalDistribution(new CategoricalChoice[] { "a", "b" })) + .Should().BeFalse(); + + Distribution.IsBitwiseIdentical(new FloatDistribution(0, 1), new FloatDistribution(0, 1)).Should().BeTrue(); + Distribution.IsBitwiseIdentical(new FloatDistribution(1e-3, 1, log: true), new FloatDistribution(1e-3, 1, log: true)) + .Should().BeTrue(); + Distribution.IsBitwiseIdentical(new FloatDistribution(0, 1, step: 0.1), new FloatDistribution(0, 1, step: 0.1)) + .Should().BeTrue(); + Distribution.IsBitwiseIdentical(new FloatDistribution(0, 1), new FloatDistribution(-0.0, 1)).Should().BeFalse(); + Distribution.IsBitwiseIdentical(new FloatDistribution(0, 1), new FloatDistribution(0, 1, step: 0.5)).Should().BeFalse(); + Distribution.IsBitwiseIdentical(new FloatDistribution(0, 1, step: 0.5), new FloatDistribution(0, 1, step: 0.25)) + .Should().BeFalse(); + Distribution.IsBitwiseIdentical(new FloatDistribution(0.1, 1), new FloatDistribution(0.1, 1, log: true)).Should().BeFalse(); + Distribution.IsBitwiseIdentical(new FloatDistribution(0, 1), new FloatDistribution(0, 2)).Should().BeFalse(); +#pragma warning disable CS0618 // the deprecated family is the point of this case + Distribution.IsBitwiseIdentical(new FloatDistribution(0, 1), new UniformDistribution(0, 1)).Should().BeFalse(); +#pragma warning restore CS0618 + + Distribution.IsBitwiseIdentical(new IntDistribution(1, 9), new IntDistribution(1, 9)).Should().BeTrue(); + Distribution.IsBitwiseIdentical(new IntDistribution(1, 9), new IntDistribution(1, 9, step: 2)).Should().BeFalse(); + Distribution.IsBitwiseIdentical(new IntDistribution(1, 9), new IntDistribution(1, 9, log: true)).Should().BeFalse(); + Distribution.IsBitwiseIdentical(new IntDistribution(0, 1), new FloatDistribution(0, 1)).Should().BeFalse(); + } + + /// <summary> + /// A parameter's compatibility is still checked before anything is shared: another kind or another log flag is + /// refused with Optuna's message, exactly as before. + /// </summary> + [TestMethod] + public void IncompatibleDistributions_AreStillRefused_WithOptunasMessages() + { + var storage = new InMemoryStorage(); + int studyId = storage.CreateNewStudy(Minimize, "compat"); + int first = storage.CreateNewTrial(studyId); + storage.SetTrialParam(first, "x", 0.5, new FloatDistribution(0.1, 1)); + int second = storage.CreateNewTrial(studyId); + + Action kind = () => storage.SetTrialParam(second, "x", 1, new IntDistribution(0, 1)); + Action log = () => storage.SetTrialParam(second, "x", 0.5, new FloatDistribution(0.1, 1, log: true)); + kind.Should().Throw<ValueError>().WithMessage("Cannot set different distribution kind to the same parameter name."); + log.Should().Throw<ValueError>().WithMessage("Cannot set different log configuration to the same parameter name."); + storage.GetTrial(second).Params.Should().BeEmpty(); + } +} diff --git a/test/OptunaSharp.Tests/Storages/JournalConcurrencyTests.cs b/test/OptunaSharp.Tests/Storages/JournalConcurrencyTests.cs index 5995b1d..66eecd4 100644 --- a/test/OptunaSharp.Tests/Storages/JournalConcurrencyTests.cs +++ b/test/OptunaSharp.Tests/Storages/JournalConcurrencyTests.cs @@ -240,12 +240,146 @@ public void Lock_WithoutAGracePeriod_WaitsForALeftBehindLockUntilItIsRemoved() var acquire = Task.Run(() => lockObj.Acquire()); ((IAsyncResult)acquire).AsyncWaitHandle.WaitOne(TimeSpan.FromSeconds(1.5)).Should().BeFalse("no grace period means no forced release"); - File.Delete(_path + ".lock"); + // Removed the way a release removes a lock, renamed away and then deleted, so the lock path is free at once. + // Deleting it in place leaves the name "delete pending" for a moment on Windows, and the waiter's create used to + // land in that window now and then (2 of about 8 full runs on a loaded machine); that case has its own test, + // Lock_DeletedInPlace_IsWaitedOutOnWindows. + string removed = _path + ".lock." + Guid.NewGuid().ToString("N") + ".removed"; + File.Move(_path + ".lock", removed); + File.Delete(removed); + ((IAsyncResult)acquire).AsyncWaitHandle.WaitOne(TimeSpan.FromSeconds(10)).Should().BeTrue(); + acquire.Result.Should().BeTrue(); + lockObj.Release(); + } + + /// <summary> + /// A lock path held "delete pending" (deleted in place, its deleting handle still open: the window an in-place + /// delete opens on Windows) is waited out. While the name is pending a plain exclusive create is denied, the + /// waiter keeps waiting instead of failing, and it takes the lock once the name is gone. Optuna's waiter raises + /// <c>PermissionError</c> in that window, hence <c>[Misaligned]</c> (owner's choice, 2026-11-12). + /// </summary> + /// <exception cref="System.ComponentModel.Win32Exception">The test cannot put the lock path in the delete-pending state.</exception> + [TestMethod] + [WindowsOnly] + [Misaligned] + public void Lock_DeletedInPlace_IsWaitedOutOnWindows() + { + if (!OperatingSystem.IsWindows()) + { + Assert.Inconclusive("The delete-pending state is Windows'."); + return; + } + + string lockPath = _path + ".lock"; + File.WriteAllText(lockPath, ""); + var lockObj = new JournalFileOpenLock(_path, gracePeriod: null); + Task<bool> acquire; + using (DeletePending.Hold(lockPath)) + { + // The window is real: an exclusive create is denied while the name is pending (else this test proves nothing). + Action create = () => new FileStream(lockPath, FileMode.CreateNew, FileAccess.Write, FileShare.None).Dispose(); + create.Should().Throw<UnauthorizedAccessException>(); + + acquire = Task.Run(() => lockObj.Acquire()); + // A waiter that failed on the denial would have completed (faulted) by now. + ((IAsyncResult)acquire).AsyncWaitHandle.WaitOne(TimeSpan.FromMilliseconds(300)).Should() + .BeFalse("the waiter waits out a pending name instead of failing"); + } + ((IAsyncResult)acquire).AsyncWaitHandle.WaitOne(TimeSpan.FromSeconds(10)).Should().BeTrue(); acquire.Result.Should().BeTrue(); lockObj.Release(); } + /// <summary> + /// A denial that does not pass (a directory standing at the lock path denies every create) is still reported, as + /// the <see cref="UnauthorizedAccessException" /> it is, once the run of denials outlasts + /// <see cref="JournalFileLockProtocol.MaxDeniedStreakMilliseconds" />: the wait for a pending name is bounded. + /// </summary> + /// <exception cref="UnauthorizedAccessException">Never escapes: the assertion expects it.</exception> + [TestMethod] + [WindowsOnly] + public void Lock_PersistentlyDenied_IsReportedAfterTheBound() + { + if (!OperatingSystem.IsWindows()) + { + Assert.Inconclusive("The waited-out denial is Windows-only; elsewhere a denial is reported at once."); + return; + } + + string lockPath = _path + ".lock"; + Directory.CreateDirectory(lockPath); + try + { + var lockObj = new JournalFileOpenLock(_path, gracePeriod: null); + var watch = Stopwatch.StartNew(); + Action acquire = () => lockObj.Acquire(); + acquire.Should().Throw<UnauthorizedAccessException>(); + watch.Elapsed.Should().BeGreaterThanOrEqualTo(TimeSpan.FromMilliseconds(JournalFileLockProtocol.MaxDeniedStreakMilliseconds)); + watch.Elapsed.Should().BeLessThan(TimeSpan.FromSeconds(10)); + } + finally + { + Directory.Delete(lockPath); + } + } + + /// <summary>Holds a file "delete pending" on Windows: the classic delete disposition, set on a handle kept open.</summary> + /// <remarks> + /// <c>File.Delete</c> cannot do this on current Windows: it deletes with POSIX semantics, so the name is gone as soon + /// as the call returns, and the window it opens lasts only while <c>DeleteFile</c> holds its own handle (measured + /// 2026-11-12). The classic disposition keeps the name until the handle that set it is closed. + /// </remarks> + private static class DeletePending + { + private const uint DeleteAccess = 0x00010000; + private const uint ShareReadWriteDelete = 0x7; + private const uint OpenExisting = 3; + private const int FileDispositionInfo = 4; + + /// <summary>Marks <paramref name="path" /> for deletion and keeps its name pending until the returned handle is disposed.</summary> + /// <param name="path">An existing file.</param> + /// <returns>The handle that holds the pending deletion; disposing it removes the name.</returns> + /// <exception cref="System.ComponentModel.Win32Exception">The file cannot be opened for deletion, or the disposition cannot be set.</exception> + internal static Microsoft.Win32.SafeHandles.SafeFileHandle Hold(string path) + { + var handle = CreateFileW(path, DeleteAccess, ShareReadWriteDelete, IntPtr.Zero, OpenExisting, 0, IntPtr.Zero); + if (handle.IsInvalid) + throw new System.ComponentModel.Win32Exception(System.Runtime.InteropServices.Marshal.GetLastWin32Error()); + byte deleteFile = 1; + if (!SetFileInformationByHandle(handle, FileDispositionInfo, ref deleteFile, 1)) + { + int error = System.Runtime.InteropServices.Marshal.GetLastWin32Error(); + handle.Dispose(); + throw new System.ComponentModel.Win32Exception(error); + } + return handle; + } + + /// <summary>Win32 <c>CreateFileW</c>, here to open a file with DELETE access.</summary> + /// <param name="name">The file path.</param> + /// <param name="access">The requested access rights.</param> + /// <param name="share">The share mode.</param> + /// <param name="security">Security attributes; none.</param> + /// <param name="disposition">The creation disposition.</param> + /// <param name="flags">Flags and attributes; none.</param> + /// <param name="template">A template file; none.</param> + /// <returns>The handle; invalid on failure (see the last Win32 error).</returns> + [System.Runtime.InteropServices.DllImport("kernel32.dll", SetLastError = true, CharSet = System.Runtime.InteropServices.CharSet.Unicode)] + private static extern Microsoft.Win32.SafeHandles.SafeFileHandle CreateFileW( + string name, uint access, uint share, IntPtr security, uint disposition, uint flags, IntPtr template); + + /// <summary>Win32 <c>SetFileInformationByHandle</c>, here with the one-byte <c>FILE_DISPOSITION_INFO</c>.</summary> + /// <param name="handle">A handle opened with DELETE access.</param> + /// <param name="infoClass">The information class (<c>FileDispositionInfo</c>).</param> + /// <param name="info">The structure: one byte, nonzero to delete.</param> + /// <param name="size">The structure's size in bytes.</param> + /// <returns>True on success (see the last Win32 error otherwise).</returns> + [System.Runtime.InteropServices.DllImport("kernel32.dll", SetLastError = true)] + private static extern bool SetFileInformationByHandle( + Microsoft.Win32.SafeHandles.SafeFileHandle handle, int infoClass, ref byte info, uint size); + } + /// <summary> /// A left-behind lock blocks writers, never readers: journal readers take no lock, as in Optuna, so a study can /// still be loaded and inspected while a dead holder's lock waits out its grace period. diff --git a/test/OptunaSharp.Tests/Storages/JournalOffsetCheckpointTests.cs b/test/OptunaSharp.Tests/Storages/JournalOffsetCheckpointTests.cs new file mode 100644 index 0000000..1724206 --- /dev/null +++ b/test/OptunaSharp.Tests/Storages/JournalOffsetCheckpointTests.cs @@ -0,0 +1,247 @@ +using System; +using System.Collections.Generic; +using System.IO; +using System.Linq; +using System.Text; +using System.Threading; +using System.Threading.Tasks; +using AwesomeAssertions; +using OptunaSharp.Collections; +using OptunaSharp.Internal; +using OptunaSharp.Storages.Journal; + +namespace OptunaSharp.Tests.Storages; + +/// <summary> +/// Plan 14: <see cref="JournalFileBackend" /> keeps the start offset of the furthest line read and one checkpoint every +/// <see cref="JournalFileBackend.OffsetCheckpointInterval" /> lines instead of Python's offset per line. A read must +/// still yield exactly the records of a full read from the file's start, from any position, on a backend that has read +/// nothing, everything, or part of the file, while other readers share it; and an undecodable line must still never +/// become a place a later read starts after. +/// </summary> +[TestClass] +public class JournalOffsetCheckpointTests +{ + private string _path = null!; + + /// <summary>Creates a fresh journal path in the temporary folder.</summary> + [TestInitialize] + public void SetUp() + => _path = Path.Combine(Path.GetTempPath(), $"optunasharp-offsets-{Guid.NewGuid():N}.log"); + + /// <summary>Deletes the journal and its lock files.</summary> + [TestCleanup] + public void TearDown() + { + foreach (var f in Directory.GetFiles(Path.GetDirectoryName(_path)!, Path.GetFileName(_path) + "*")) + { + try + { + File.Delete(f); + } + catch (IOException) + { + // Best effort: a lock file another test process still holds is cleaned up by the next run. + } + } + } + + /// <summary> + /// Appends <paramref name="count" /> records of varied lengths (so line starts are not a regular grid), numbered from + /// <paramref name="first" />, in batches like a study's writes. + /// </summary> + /// <param name="backend">The backend to append through.</param> + /// <param name="first">The number of the first record.</param> + /// <param name="count">How many records to append.</param> + private static void Append(JournalFileBackend backend, int first, int count) + { + var batch = new List<OrderedDict<string, object?>>(); + for (int i = first; i < first + count; i++) + { + batch.Add(new OrderedDict<string, object?> + { + ["op_code"] = 5L, + ["i"] = (long)i, + ["pad"] = new string('x', (i * 7919) % 97), + ["v"] = i * 0.1, + }); + if (batch.Count == 37) + { + backend.AppendLogs(batch); + batch.Clear(); + } + } + if (batch.Count > 0) + backend.AppendLogs(batch); + } + + /// <summary>Every record a read yields, as JSON text, to compare reads by value.</summary> + /// <param name="backend">The backend to read through.</param> + /// <param name="from">The first log number to read.</param> + /// <returns>The records' JSON, in order.</returns> + private static List<string> Read(JournalFileBackend backend, int from) + => backend.ReadLogs(from).Select(log => PyJson.Dumps(log)).ToList(); + + /// <summary> + /// A read from any position equals the matching slice of a full read, on a backend that has read nothing (cold) and + /// on one that has read the whole file (warm); and the warm backend kept only the sparse offsets. + /// </summary> + [TestMethod] + public void ReadLogs_FromAnyPosition_EqualsTheSliceOfAFullRead_ColdAndWarm() + { + int interval = JournalFileBackend.OffsetCheckpointInterval; + int total = 2 * interval + 500; + var writer = new JournalFileBackend(_path, new JournalFileOpenLock(_path)); + Append(writer, 0, total); + List<string> reference = Read(new JournalFileBackend(_path, new JournalFileOpenLock(_path)), 0); + reference.Should().HaveCount(total); + + var warm = new JournalFileBackend(_path, new JournalFileOpenLock(_path)); + Read(warm, 0).Should().Equal(reference); + warm.OffsetCheckpointCount.Should().Be(3, "checkpoints at 0, 4096 and 8192 only"); + + int[] froms = { 0, 1, 2, interval - 1, interval, interval + 1, 5000, 2 * interval - 1, 2 * interval, 2 * interval + 1, total - 1, total, total + 5 }; + foreach (int from in froms) + { + List<string> expected = from >= total ? new List<string>() : reference.GetRange(from, total - from); + Read(warm, from).Should().Equal(expected, $"warm read from {from}"); + Read(new JournalFileBackend(_path, new JournalFileOpenLock(_path)), from).Should().Equal(expected, $"cold read from {from}"); + } + } + + /// <summary> + /// Two storages sharing one backend: one read stops half way, the file grows, another read reaches the new end, and a + /// read resuming from the first one's position (behind the furthest) starts at a checkpoint and yields exactly the + /// records after it. + /// </summary> + [TestMethod] + public void SharedBackend_AReaderBehindTheFurthest_ResumesExactly() + { + int interval = JournalFileBackend.OffsetCheckpointInterval; + var backend = new JournalFileBackend(_path, new JournalFileOpenLock(_path)); + Append(backend, 0, interval + 2000); + // A reader that stops after 5,000 records, as a sync of a storage that was behind would. + var firstPart = backend.ReadLogs(0).Take(5000).Select(log => PyJson.Dumps(log)).ToList(); + firstPart.Should().HaveCount(5000); + + Append(backend, interval + 2000, interval + 300); + int total = 2 * interval + 2300; + List<string> reference = Read(new JournalFileBackend(_path, new JournalFileOpenLock(_path)), 0); + reference.Should().HaveCount(total); + Read(backend, 0).Should().Equal(reference, "a full read through the shared backend"); + + Read(backend, 5000).Should().Equal(reference.GetRange(5000, total - 5000), "the behind reader resumes at its own position"); + firstPart.Should().Equal(reference.GetRange(0, 5000)); + } + + /// <summary> + /// Concurrent readers of one backend, from scattered positions, while the file is static: every read equals its + /// slice of the reference, and the bookkeeping stays consistent (one checkpoint per interval). + /// </summary> + [TestMethod] + public void ConcurrentReaders_FromScatteredPositions_AllReadExactly() + { + int interval = JournalFileBackend.OffsetCheckpointInterval; + int total = 3 * interval + 77; + Append(new JournalFileBackend(_path, new JournalFileOpenLock(_path)), 0, total); + List<string> reference = Read(new JournalFileBackend(_path, new JournalFileOpenLock(_path)), 0); + + var shared = new JournalFileBackend(_path, new JournalFileOpenLock(_path)); + var froms = new[] { 0, 9000, 4096, 100, 12000, 8191, 3, 6000, 12364, 4097, 2, 11111 }; + Parallel.ForEach(froms, new ParallelOptions { MaxDegreeOfParallelism = 6 }, from => + { + List<string> expected = from >= total ? new List<string>() : reference.GetRange(from, total - from); + Read(shared, from).Should().Equal(expected, $"read from {from}"); + }); + shared.OffsetCheckpointCount.Should().Be(4, "checkpoints at 0, 4096, 8192 and 12288"); + } + + /// <summary> + /// One backend shared by a writer and six readers at once, as <see cref="JournalStorage" /> instances share a + /// singleton backend: the writer appends past three checkpoint intervals in batches while each reader syncs the way + /// a storage does, reading from the next log it has not seen, again and again, from its own starting position + /// (two from the start, others inside and beyond intervals the writer has not reached yet). Each read races the + /// appends and the other readers' bookkeeping, and may meet a batch half written. Every reader must end with exactly + /// its slice of a full read, and the backend must hold one checkpoint per interval. + /// </summary> + [TestMethod] + public void ReadersSyncingWhileOneWriterAppends_AcrossCheckpoints_AllReadExactly() + { + int interval = JournalFileBackend.OffsetCheckpointInterval; + int total = 3 * interval + 211; + var shared = new JournalFileBackend(_path, new JournalFileOpenLock(_path)); + var froms = new[] { 0, 0, 100, interval, 2 * interval + 5, 3 * interval + 12 }; + int writerDone = 0; + Task<List<string>>[] readers = froms.Select(from => Task.Run(() => + { + var seen = new List<string>(); + int next = from; + while (true) + { + // Read whether the writer had finished before this sync starts: a sync that starts after it has + // finished sees the whole file, so it is the last one this reader needs. + bool finalSync = Volatile.Read(ref writerDone) == 1; + int before = next; + foreach (var log in shared.ReadLogs(next)) + { + seen.Add(PyJson.Dumps(log)); + next++; + } + if (finalSync) + return seen; + if (next == before) + Thread.Sleep(1); + } + })).ToArray(); + + Append(shared, 0, total); + Volatile.Write(ref writerDone, 1); + Task.WaitAll(readers); + + List<string> reference = Read(new JournalFileBackend(_path, new JournalFileOpenLock(_path)), 0); + reference.Should().HaveCount(total); + for (int r = 0; r < froms.Length; r++) + readers[r].Result.Should().Equal(reference.GetRange(froms[r], total - froms[r]), $"reader {r}, from {froms[r]}"); + shared.OffsetCheckpointCount.Should().Be(4, "checkpoints at 0, 4096, 8192 and 12288, each recorded once"); + } + + /// <summary> + /// A record that does not decode, followed by another record, fails the read with Python's error; its successor + /// never becomes a start position, so a later read from it, or from anywhere before it, fails the same way instead of + /// skipping it. + /// </summary> + [TestMethod] + public void UndecodableRecord_FollowedByAnother_FailsEveryReadThatReachesIt() + { + int interval = JournalFileBackend.OffsetCheckpointInterval; + var backend = new JournalFileBackend(_path, new JournalFileOpenLock(_path)); + Append(backend, 0, interval + 10); + File.AppendAllText(_path, "{\"op_code\": 5, broken\n", Encoding.UTF8); + Append(backend, interval + 11, 20); + + Action full = () => Read(backend, 0); + full.Should().Throw<NumSharp.ValueError>(); + Action fromBefore = () => Read(backend, interval + 5); + fromBefore.Should().Throw<NumSharp.ValueError>("the read must reach the bad record again, not start after it"); + Action fromIt = () => Read(backend, interval + 10); + fromIt.Should().Throw<NumSharp.ValueError>(); + // Stops after one record, before the bad one: the record before it still reads. + backend.ReadLogs(interval + 9).Take(1).Count().Should().Be(1); + } + + /// <summary> + /// A last line still being written (no newline yet) is left for the next read, as in Python; once completed, the next + /// read from the furthest position yields it. + /// </summary> + [TestMethod] + public void PartialLastLine_IsLeftForTheNextRead() + { + var backend = new JournalFileBackend(_path, new JournalFileOpenLock(_path)); + Append(backend, 0, 10); + File.AppendAllText(_path, "{\"op_code\": 5, \"i\": 10", Encoding.UTF8); + Read(backend, 0).Should().HaveCount(10); + File.AppendAllText(_path, "}\n", Encoding.UTF8); + var rest = Read(backend, 10); + rest.Should().ContainSingle().Which.Should().Contain("\"i\": 10"); + } +} diff --git a/test/OptunaSharp.Tests/StudyTrialFilterTests.cs b/test/OptunaSharp.Tests/StudyTrialFilterTests.cs new file mode 100644 index 0000000..28b7b63 --- /dev/null +++ b/test/OptunaSharp.Tests/StudyTrialFilterTests.cs @@ -0,0 +1,174 @@ +using System; +using System.Collections.Generic; +using System.Linq; +using AwesomeAssertions; +using OptunaSharp.Collections; +using OptunaSharp.Distributions; +using OptunaSharp.Internal; +using OptunaSharp.Samplers; + +namespace OptunaSharp.Tests; + +/// <summary> +/// Plan 15 (docs/plans/15-performance-pass-3.md), step K: the cached history read filters by state through a bit mask +/// into a list allocated at its final size, TPE shares one read-only filtered list per trial snapshot +/// (<see cref="Study.GetTrialsCachedReadOnly" />), and TPE reads its split groups without copies +/// (<see cref="TpeSplitCache.SplitShared" />). Each must return exactly the records, in exactly the order, of the code it +/// replaces: <c>Where(t => states.Contains(t.State)).ToList()</c> and <see cref="TpeSplitCache.Split" />. +/// </summary> +[TestClass] +public class StudyTrialFilterTests +{ + /// <summary> + /// Histories mixing every state, and values outside the enum, filtered by every kind of state set (arrays and + /// other collections, duplicates, empty, a value a mask cannot hold): the same references in the same order as the + /// LINQ filter, in a new list on every call. + /// </summary> + /// <param name="seed">Seeds the history.</param> + [TestMethod] + [DataRow(1)] + [DataRow(2)] + [DataRow(3)] + public void FilterByState_ReturnsTheLinqFiltersRecords_InOrder(int seed) + { + var rng = new Random(seed); + TrialState[] pool = + { + TrialState.Running, TrialState.Complete, TrialState.Pruned, TrialState.Fail, TrialState.Waiting, + (TrialState)7, (TrialState)30, (TrialState)31, (TrialState)40, + }; + var trials = new List<FrozenTrial>(); + for (int i = 0; i < 200; i++) + trials.Add(Trial(i, pool[rng.Next(pool.Length)])); + + var sets = new List<IReadOnlyCollection<TrialState>> + { + Array.Empty<TrialState>(), + new[] { TrialState.Complete }, + new[] { TrialState.Complete, TrialState.Pruned }, + new[] { TrialState.Pruned, TrialState.Complete, TrialState.Complete }, + new[] { TrialState.Running }, + new[] { TrialState.Complete, TrialState.Pruned, TrialState.Running }, + new[] { TrialState.Running, TrialState.Complete, TrialState.Pruned, TrialState.Fail, TrialState.Waiting }, + new[] { (TrialState)7, (TrialState)30 }, + new[] { (TrialState)31 }, + new[] { (TrialState)40, TrialState.Complete }, + new[] { (TrialState)(-1), TrialState.Pruned }, + new List<TrialState> { TrialState.Fail, TrialState.Waiting }, + new HashSet<TrialState> { TrialState.Complete, (TrialState)40 }, + }; + + foreach (IReadOnlyCollection<TrialState> states in sets) + { + string label = string.Join(",", states.Select(s => (int)s)); + List<FrozenTrial> expected = trials.Where(t => states.Contains(t.State)).ToList(); + List<FrozenTrial> actual = Study.FilterByState(trials, states); + + actual.Should().HaveCount(expected.Count, label); + for (int i = 0; i < expected.Count; i++) + ReferenceEquals(actual[i], expected[i]).Should().BeTrue($"{label}: position {i}"); + ReferenceEquals(actual, trials).Should().BeFalse(label); + ReferenceEquals(Study.FilterByState(trials, states), actual).Should().BeFalse($"{label}: a new list per call"); + } + } + + /// <summary> + /// Within one trial snapshot, read-only reads of the same states share one list, whose records are those of the + /// copying read; a read of other states, or a snapshot dropped as a tell drops it, gives a fresh list with the + /// current records; a state set no mask can hold is filtered every time. + /// </summary> + /// <exception cref="TrialPruned">Never escapes: the objective raises it for every fifth trial, and the optimize loop records that trial as pruned.</exception> + [TestMethod] + public void GetTrialsCachedReadOnly_SharesOneListPerSnapshotAndStateSet() + { + OptunaSharp.Logging.OptunaLogging.SetVerbosity(OptunaSharp.Logging.LogLevel.Error); + Study study = Optuna.CreateStudy(sampler: new RandomSampler(seed: 0)); + study.Optimize(t => + { + double x = t.SuggestFloat("x", -1, 1); + if (t.Number % 5 == 1) + throw new TrialPruned(); + if (t.Number % 7 == 3) + return double.NaN; // a failed trial + return x * x; + }, nTrials: 40); + + var completeOrPruned = new[] { TrialState.Complete, TrialState.Pruned }; + study.ThreadLocal.CachedAllTrials = null; + + IReadOnlyList<FrozenTrial> first = study.GetTrialsCachedReadOnly(completeOrPruned); + List<FrozenTrial> copying = study.GetTrialsInternal(deepcopy: false, states: completeOrPruned, useCache: true); + first.Should().HaveCount(copying.Count); + for (int i = 0; i < copying.Count; i++) + ReferenceEquals(first[i], copying[i]).Should().BeTrue($"position {i}"); + first.Select(t => t.State).Should().Contain(TrialState.Pruned).And.Contain(TrialState.Complete); + + // The same set, in any order: the same list. + ReferenceEquals(study.GetTrialsCachedReadOnly(completeOrPruned), first).Should().BeTrue(); + ReferenceEquals(study.GetTrialsCachedReadOnly(new[] { TrialState.Pruned, TrialState.Complete }), first).Should().BeTrue(); + + // Another set: its own list, and the memo then answers for that set. + IReadOnlyList<FrozenTrial> complete = study.GetTrialsCachedReadOnly(new[] { TrialState.Complete }); + complete.Should().OnlyContain(t => t.State == TrialState.Complete); + complete.Should().HaveCount(study.GetTrials(deepcopy: false).Count(t => t.State == TrialState.Complete)); + IReadOnlyList<FrozenTrial> again = study.GetTrialsCachedReadOnly(completeOrPruned); + ReferenceEquals(again, first).Should().BeFalse("the memo holds the last set only"); + again.Should().Equal(first, ReferenceEquals); + + // A set no mask can hold: filtered every time, never memoized. + var odd = new[] { (TrialState)40 }; + IReadOnlyList<FrozenTrial> oddFirst = study.GetTrialsCachedReadOnly(odd); + oddFirst.Should().BeEmpty(); + ReferenceEquals(study.GetTrialsCachedReadOnly(odd), oddFirst).Should().BeFalse(); + + // A tell drops the snapshot, and with it the memo: the next read sees the new trial. + IReadOnlyList<FrozenTrial> before = study.GetTrialsCachedReadOnly(completeOrPruned); + Trial asked = study.Ask(); + asked.SuggestFloat("x", -1, 1); + study.Tell(asked, 0.25); + IReadOnlyList<FrozenTrial> after = study.GetTrialsCachedReadOnly(completeOrPruned); + ReferenceEquals(after, before).Should().BeFalse(); + after.Should().HaveCount(before.Count + 1); + after[^1].Number.Should().Be(asked.Number); + } + + /// <summary> + /// The copy-free split returns the very groups <see cref="TpeSplitCache.Split" /> returns, computing the split once + /// and handing the same lists out again while the same records are split. + /// </summary> + [TestMethod] + public void SplitShared_ReturnsSplitsGroups_AndReusesThem() + { + Study study = Optuna.CreateStudy(); + var rng = new Random(5); + var trials = new List<FrozenTrial>(); + for (int i = 0; i < 50; i++) + trials.Add(Trial(i, TrialState.Complete, rng.Next(10) * 0.5)); + + var cache = new TpeSplitCache(); + var (sharedBelow, sharedAbove) = cache.SplitShared(study, trials, 12); + var (copiedBelow, copiedAbove) = new TpeSplitCache().Split(study, trials, 12); + sharedBelow.Should().Equal(copiedBelow, ReferenceEquals); + sharedAbove.Should().Equal(copiedAbove, ReferenceEquals); + + var (againBelow, againAbove) = cache.SplitShared(study, trials, 12); + ReferenceEquals(againBelow, sharedBelow).Should().BeTrue(); + ReferenceEquals(againAbove, sharedAbove).Should().BeTrue(); + var (splitBelow, _) = cache.Split(study, trials, 12); + ReferenceEquals(splitBelow, sharedBelow).Should().BeFalse("Split still copies"); + splitBelow.Should().Equal(sharedBelow, ReferenceEquals); + cache.Computed.Should().Be(1); + } + + /// <summary>A finished-looking trial record with the given number, state and value, and nothing else.</summary> + /// <param name="number">The trial number, also used as its id.</param> + /// <param name="state">The state to record; values outside the enum are allowed, the filter must cope with them.</param> + /// <param name="value">The objective value.</param> + /// <returns>The record.</returns> + private static FrozenTrial Trial(int number, TrialState state, double value = 1.0) + { + return new FrozenTrial(number, state, value, DateTime.UnixEpoch, DateTime.UnixEpoch, + new OrderedDict<string, object?>(), new OrderedDict<string, BaseDistribution>(), + new OrderedDict<string, object?>(), new OrderedDict<string, object?>(), new OrderedDict<long, double>(), number); + } +} diff --git a/test/OptunaSharp.Tests/TrialsByNumberTests.cs b/test/OptunaSharp.Tests/TrialsByNumberTests.cs new file mode 100644 index 0000000..511018f --- /dev/null +++ b/test/OptunaSharp.Tests/TrialsByNumberTests.cs @@ -0,0 +1,117 @@ +using System; +using System.Collections.Generic; +using System.Linq; +using AwesomeAssertions; +using OptunaSharp.Collections; +using OptunaSharp.Distributions; +using OptunaSharp.Internal; + +namespace OptunaSharp.Tests; + +/// <summary> +/// Plan 15 (docs/plans/15-performance-pass-3.md), step L: SMS-EMOA and MOEA/D find their population members by trial +/// number through <see cref="TrialsByNumber" /> instead of dictionaries over the whole history rebuilt per ask. Every +/// lookup must answer as the dictionary it replaces (<c>byNumber[t.Number] = t</c> over the list, in list order) would. +/// </summary> +[TestClass] +public class TrialsByNumberTests +{ + /// <summary> + /// Ascending histories with gaps (as a filtered history has): every number from below the first to above the last + /// is answered as the dictionary answers it, hits by reference and misses as misses. + /// </summary> + /// <param name="seed">Seeds the gaps.</param> + [TestMethod] + [DataRow(1)] + [DataRow(2)] + [DataRow(3)] + public void AscendingHistory_AnswersAsTheDictionary(int seed) + { + var rng = new Random(seed); + foreach (int size in new[] { 0, 1, 2, 3, 7, 64, 257 }) + { + var trials = new List<FrozenTrial>(); + int number = rng.Next(3); + for (int i = 0; i < size; i++) + { + trials.Add(Trial(number)); + number += 1 + rng.Next(3); + } + + var lookup = TrialsByNumber.Over(trials); + lookup.IsAscending.Should().BeTrue(); + AssertSameAnswers(lookup, Dictionary(trials), -2, number + 2, $"size {size}"); + } + } + + /// <summary> + /// Histories out of order, or repeating a number: the lookup reports them as not ascending and answers from the + /// dictionary itself, the later record winning a repeated number. + /// </summary> + [TestMethod] + public void OutOfOrderOrRepeatedHistory_UsesTheDictionaryItself() + { + var shuffled = new List<FrozenTrial> { Trial(4), Trial(1), Trial(9), Trial(0), Trial(5) }; + var outOfOrder = TrialsByNumber.Over(shuffled); + outOfOrder.IsAscending.Should().BeFalse(); + AssertSameAnswers(outOfOrder, Dictionary(shuffled), -1, 11, "shuffled"); + + FrozenTrial early = Trial(3); + FrozenTrial late = Trial(3); + var repeated = new List<FrozenTrial> { Trial(1), early, late, Trial(6) }; + var withRepeat = TrialsByNumber.Over(repeated); + withRepeat.IsAscending.Should().BeFalse(); + withRepeat.TryGetValue(3, out FrozenTrial found).Should().BeTrue(); + ReferenceEquals(found, late).Should().BeTrue("the dictionary keeps the later record"); + AssertSameAnswers(withRepeat, Dictionary(repeated), 0, 8, "repeated"); + } + + /// <summary>A null history is refused.</summary> + /// <exception cref="ArgumentNullException">Expected: thrown by <see cref="TrialsByNumber.Over" /> and asserted.</exception> + [TestMethod] + public void Over_RefusesANullHistory() + { + Action act = () => TrialsByNumber.Over(null!); + act.Should().Throw<ArgumentNullException>(); + } + + /// <summary>Asserts that the lookup and the dictionary agree on every number in a range.</summary> + /// <param name="lookup">The lookup under test.</param> + /// <param name="expected">The dictionary the replaced code built.</param> + /// <param name="from">The first number to ask for.</param> + /// <param name="to">The last number to ask for.</param> + /// <param name="label">Names the case in a failure.</param> + private static void AssertSameAnswers(TrialsByNumber lookup, Dictionary<int, FrozenTrial> expected, int from, int to, string label) + { + for (int n = from; n <= to; n++) + { + bool hit = lookup.TryGetValue(n, out FrozenTrial actual); + hit.Should().Be(expected.TryGetValue(n, out FrozenTrial? want), $"{label}: number {n}"); + if (hit) + ReferenceEquals(actual, want).Should().BeTrue($"{label}: number {n}"); + else + actual.Should().BeNull($"{label}: number {n}"); + } + } + + /// <summary>The dictionary the replaced code built: every record by number, a later one replacing an earlier one.</summary> + /// <param name="trials">The history, in list order.</param> + /// <returns>The dictionary.</returns> + private static Dictionary<int, FrozenTrial> Dictionary(List<FrozenTrial> trials) + { + var byNumber = new Dictionary<int, FrozenTrial>(); + foreach (FrozenTrial t in trials) + byNumber[t.Number] = t; + return byNumber; + } + + /// <summary>A completed trial record with this number and nothing else.</summary> + /// <param name="number">The trial number, also used as its id.</param> + /// <returns>The record.</returns> + private static FrozenTrial Trial(int number) + { + return new FrozenTrial(number, TrialState.Complete, 1.0, DateTime.UnixEpoch, DateTime.UnixEpoch, + new OrderedDict<string, object?>(), new OrderedDict<string, BaseDistribution>(), + new OrderedDict<string, object?>(), new OrderedDict<string, object?>(), new OrderedDict<long, double>(), number); + } +} diff --git a/test/OptunaSharp.Tests/oracle/cma_pickle_oracle.json b/test/OptunaSharp.Tests/oracle/cma_pickle_oracle.json index bf16cc6..a86819f 100644 --- a/test/OptunaSharp.Tests/oracle/cma_pickle_oracle.json +++ b/test/OptunaSharp.Tests/oracle/cma_pickle_oracle.json @@ -2,7 +2,7 @@ "generator": "test/OptunaSharp.Tests/oracle/gen_cma_pickle_oracle.py", "optuna": "5.0.0", "cmaes": "0.13.1", - "numpy": "2.4.2", + "numpy": "2.5.4", "variants": { "cma": { "prefix": "cma:", @@ -10,22 +10,22 @@ { "trial": 8, "chunks": 2, - "hex": "800495f6060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594681189433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b03859468118943187b56d8278f9bf43fda5b953be034a23fda0d7c66e3bdfc3f947494628c035f706394682f68314b008594683387945294284b014b0385946811894318bb578cd3e2cdf63f309002deae25a43fbff4e82b2cceff3f947494628c055f6d65616e94682f68314b008594683387945294284b014b03859468118943184481feec11a4e53f2047a482de27e03f1f7f4aff0fdee73f947494628c055f635f316494682f68314b008594683387945294284b014b06859468118943306c11c0ca2eb0f23f5d83d4638cd5b2bfbe65f980b26ddf3f680cde6f0c82ef3facbff8f1d824b53fd5f1a3f76804f43f947494628c065f7369676d6194680b681143081d6e74b1ede0c73f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468118943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b0186946811894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b094b0186946811894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e85946811894270010000c03a89ff9f01000060eed4af9f010000686f4df520b71040bad725942cdf44406d696e5f64656c74613a0a202020202020202020202020546f6c6572616e63652076616c756520746f20636865636b2077686574686572206f72206e6f7420746865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e9474946275622e" + "hex": "800495f6060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594681189433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b03859468118943187b56d8278f9bf43fda5b953be034a23fda0d7c66e3bdfc3f947494628c035f706394682f68314b008594683387945294284b014b0385946811894318bb578cd3e2cdf63f309002deae25a43fbff4e82b2cceff3f947494628c055f6d65616e94682f68314b008594683387945294284b014b03859468118943184481feec11a4e53f2047a482de27e03f1f7f4aff0fdee73f947494628c055f635f316494682f68314b008594683387945294284b014b06859468118943306c11c0ca2eb0f23f5d83d4638cd5b2bfbe65f980b26ddf3f680cde6f0c82ef3facbff8f1d824b53fd5f1a3f76804f43f947494628c065f7369676d6194680b681143081d6e74b1ede0c73f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468118943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b0186946811894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b094b0186946811894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e8594681189427001000030ff86d10a020000c09cacd00a020000686f4df520b71040bad725942cdf44400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009474946275622e" }, { "trial": 15, "chunks": 2, - "hex": "80049518070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0385946811894318f082cce76a4dacbf48ee618de9c3dfbffe4e03a4ed87f63f947494628c035f706394682f68314b008594683387945294284b014b0385946811894318ec1dc840c8d2c9bf63b30d1155b4dfbf0d128825e142f13f947494628c055f6d65616e94682f68314b008594683387945294284b014b038594683989431829d9ab5623f6e13f157aeac8c1c4db3fac4224c5eac2e83f947494628c065f7369676d6194680b6811430803ae4580a86ec73f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468398943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b0186946839894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b094b0186946839894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e85946839894270010000c03a89ff9f01000060eed4af9f010000686f4df520b71040bad725942cdf444099e1777dd527ce3f9661b2af5cd2254020202020202020546f6c6572616e63652076616c756520746f20636865636b2077686574686572206f72206e6f7420746865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e947494628c055f635f316494682f68314b008594683387945294284b014b068594681189433018ea7fb784e0f03fd2a708505dbba43f7fd7055ca4bcde3fb67d1f27d139ed3fbdaffb6cf409adbf007b144ee1a1f23f9474946275622e" + "hex": "80049518070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0385946811894318f082cce76a4dacbf48ee618de9c3dfbffe4e03a4ed87f63f947494628c035f706394682f68314b008594683387945294284b014b0385946811894318ec1dc840c8d2c9bf63b30d1155b4dfbf0d128825e142f13f947494628c055f6d65616e94682f68314b008594683387945294284b014b038594683989431829d9ab5623f6e13f157aeac8c1c4db3fac4224c5eac2e83f947494628c065f7369676d6194680b6811430803ae4580a86ec73f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468398943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b0186946839894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b094b0186946839894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e8594683989427001000030ff86d10a020000c09cacd00a020000686f4df520b71040bad725942cdf444099e1777dd527ce3f9661b2af5cd225400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494682f68314b008594683387945294284b014b068594681189433018ea7fb784e0f03fd2a708505dbba43f7fd7055ca4bcde3fb67d1f27d139ed3fbdaffb6cf409adbf007b144ee1a1f23f9474946275622e" }, { "trial": 22, "chunks": 2, - "hex": "80049518070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0385946811894318b01656c6a1b86c3f2096865cdd16d8bf6ab850fdd659d53f947494628c035f706394682f68314b008594683387945294284b014b03859468118943189baeafd500e4c6bf643dfe964aa9d2bf982f36de9c42b5bf947494628c055f6d65616e94682f68314b008594683387945294284b014b03859468398943180e2d69e62c92e13ff043add63a22db3f78582823ca54e63f947494628c065f7369676d6194680b68114308ba1b1099f92ac33f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468398943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b038c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b0186946839894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b094b0186946839894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e85946839894270010000c03a89ff9f01000060eed4af9f010000686f4df520b71040bad725942cdf444099e1777dd527ce3f9661b2af5cd22540713c28581910de3fd28492cb61842e402076616c756520746f20636865636b2077686574686572206f72206e6f7420746865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e947494628c055f635f316494682f68314b008594683387945294284b014b0685946811894330e1ca6ba757aaee3fc09c8915afc6633f1c36aa99f2cbd83f95d0794951efe73f0e6efcfe9d10c2bfdc525b92aee9ef3f9474946275622e" + "hex": "80049518070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0385946811894318b01656c6a1b86c3f2096865cdd16d8bf6ab850fdd659d53f947494628c035f706394682f68314b008594683387945294284b014b03859468118943189baeafd500e4c6bf643dfe964aa9d2bf982f36de9c42b5bf947494628c055f6d65616e94682f68314b008594683387945294284b014b03859468398943180e2d69e62c92e13ff043add63a22db3f78582823ca54e63f947494628c065f7369676d6194680b68114308ba1b1099f92ac33f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468398943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b038c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b0186946839894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b094b0186946839894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e8594683989427001000030ff86d10a020000c09cacd00a020000686f4df520b71040bad725942cdf444099e1777dd527ce3f9661b2af5cd22540713c28581910de3fd28492cb61842e4000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494682f68314b008594683387945294284b014b0685946811894330e1ca6ba757aaee3fc09c8915afc6633f1c36aa99f2cbd83f95d0794951efe73f0e6efcfe9d10c2bfdc525b92aee9ef3f9474946275622e" }, { "trial": 29, "chunks": 2, - "hex": "80049518070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b03859468118943182e2187b1116ad83f7cdbc8fb7230e5bfc4886f231ebdefbf947494628c035f706394682f68314b008594683387945294284b014b0385946811894318e2e55479bd02ac3fe690dd810d5fdcbfa11e9c34151ff3bf947494628c055f6d65616e94682f68314b008594683387945294284b014b038594683989431840a4af74ce0be23f1fa0e44f56e5d83f934f4aaf3236e23f947494628c065f7369676d6194680b6811430850983d88ebfdc13f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468398943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b048c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b0186946839894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b094b0186946839894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e85946839894270010000c03a89ff9f01000060eed4af9f010000686f4df520b71040bad725942cdf444099e1777dd527ce3f9661b2af5cd22540713c28581910de3fd28492cb61842e405813e0a992961640d5c42e832d14224077686574686572206f72206e6f7420746865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e947494628c055f635f316494682f68314b008594683387945294284b014b0685946811894330fbe70561b2f4eb3f1b030339b6749fbf181df9bacf15d93ffaedb67863a6e73fe222efc2d079b0bffec3b654d9baef3f9474946275622e" + "hex": "80049518070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b03859468118943182e2187b1116ad83f7cdbc8fb7230e5bfc4886f231ebdefbf947494628c035f706394682f68314b008594683387945294284b014b0385946811894318e2e55479bd02ac3fe690dd810d5fdcbfa11e9c34151ff3bf947494628c055f6d65616e94682f68314b008594683387945294284b014b038594683989431840a4af74ce0be23f1fa0e44f56e5d83f934f4aaf3236e23f947494628c065f7369676d6194680b6811430850983d88ebfdc13f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468398943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b048c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b0186946839894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b094b0186946839894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e8594683989427001000030ff86d10a020000c09cacd00a020000686f4df520b71040bad725942cdf444099e1777dd527ce3f9661b2af5cd22540713c28581910de3fd28492cb61842e405813e0a992961640d5c42e832d142240000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494682f68314b008594683387945294284b014b0685946811894330fbe70561b2f4eb3f1b030339b6749fbf181df9bacf15d93ffaedb67863a6e73fe222efc2d079b0bffec3b654d9baef3f9474946275622e" } ] }, @@ -35,22 +35,22 @@ { "trial": 8, "chunks": 2, - "hex": "8004950a070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594681189433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b03859468118943187b56d8278f9bf43fda5b953be034a23fda0d7c66e3bdfc3f947494628c035f706394682f68314b008594683387945294284b014b0385946811894318bb578cd3e2cdf63f309002deae25a43fbff4e82b2cceff3f947494628c055f6d65616e94682f68314b008594683387945294284b014b03859468118943180e99b1ee911fe53f69dd46043624e03f55f7e75b4325e73f947494628c055f635f316494682f68314b008594683387945294284b014b0685946811894330ba868aaefd9df13f17c9b9a18d65b1bf12226816a007dd3f9f46388753d0ed3f0ceed8f9b887b33f3e48d84240d8f23f947494628c065f7369676d6194680b681143081cdf1309e5f3ca3f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468118943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b018c095f6c725f616461707494888c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b018694681189431847395f3e8913bb3fcdac2afce7eb673f4b644cfebfe1c23f947494628c075f455369676d6194682f68314b008594683387945294284b014b094b0186946811894348a6ca97d85421843faaa9fe6d910460bf9c9073ba99ba8a3faaa9fe6d910460bfff18667bfa4b743f58662ecd72fb613f9c9073ba99ba8a3f58662ecd72fb613fadcab25cbda6883f947494628c065f566d65616e94473fd517737c539f348c075f565369676d6194473f954ca1c9c9f5d38c095f6574615f6d65616e94680b6811430832e5dfca5810ed3f94869452948c0a5f6574615f5369676d6194680b6811430895eb2f067c10ef3f94869452948c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e85946811894270010000c03a89ff9f01000060eed4af9f010000686f4df520b71040bad725942cdf444099e1777dd527ce3f9661b2af5cd22540713c28581910de3fd28492cb61842e405813e0a992961640d5c42e832d142240d0c1bd7421d10740928703da14e623406865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e9474946275622e" + "hex": "8004950a070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594681189433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b03859468118943187b56d8278f9bf43fda5b953be034a23fda0d7c66e3bdfc3f947494628c035f706394682f68314b008594683387945294284b014b0385946811894318bb578cd3e2cdf63f309002deae25a43fbff4e82b2cceff3f947494628c055f6d65616e94682f68314b008594683387945294284b014b03859468118943180e99b1ee911fe53f69dd46043624e03f55f7e75b4325e73f947494628c055f635f316494682f68314b008594683387945294284b014b0685946811894330ba868aaefd9df13f17c9b9a18d65b1bf12226816a007dd3f9f46388753d0ed3f0ceed8f9b887b33f3e48d84240d8f23f947494628c065f7369676d6194680b681143081cdf1309e5f3ca3f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468118943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b018c095f6c725f616461707494888c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b018694681189431847395f3e8913bb3fcdac2afce7eb673f4b644cfebfe1c23f947494628c075f455369676d6194682f68314b008594683387945294284b014b094b0186946811894348a6ca97d85421843faaa9fe6d910460bf9c9073ba99ba8a3faaa9fe6d910460bfff18667bfa4b743f58662ecd72fb613f9c9073ba99ba8a3f58662ecd72fb613fadcab25cbda6883f947494628c065f566d65616e94473fd517737c539f348c075f565369676d6194473f954ca1c9c9f5d38c095f6574615f6d65616e94680b6811430832e5dfca5810ed3f94869452948c0a5f6574615f5369676d6194680b6811430895eb2f067c10ef3f94869452948c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e8594681189427001000030ff86d10a020000c09cacd00a020000686f4df520b71040bad725942cdf444099e1777dd527ce3f9661b2af5cd22540713c28581910de3fd28492cb61842e405813e0a992961640d5c42e832d142240d0c1bd7421d10740928703da14e6234000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009474946275622e" }, { "trial": 15, "chunks": 2, - "hex": "8004952c070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b038594681189431865a4e47691cad13faabe1587956ec5bf86a13289b9d1f33f947494628c035f706394682f68314b008594683387945294284b014b0385946811894318d03b6fcede38c23f49bff8ba51bfc3bfeb49d7ba972cef3f947494628c055f6d65616e94682f68314b008594683387945294284b014b0385946839894318a87112fb011ae33fb149600a34dbde3f76f1a03aa38ce73f947494628c065f7369676d6194680b681143087733aed28d6dca3f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468398943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b028c095f6c725f616461707494888c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b0186946811894318723c8b7fb8bdac3f5e4100bdae468abf41ad5f5c5df7c23f947494628c075f455369676d6194682f68314b008594683387945294284b014b094b0186946811894348e20a4e4667de713f60a4e983b5e2003f5b792354fbb88a3fe0a4e983b5e2003f66556f740f3f543f8e1451189084433f5b792354fbb88a3f8e1451189084433f66c6b152dc4a7f3f947494628c065f566d65616e94473fd44379b9ad2f1c8c075f565369676d6194473f96fd4b21333f448c095f6574615f6d65616e94680b68114308305f6382b698ea3f94869452948c0a5f6574615f5369676d6194680b681143085f2c64e50e26ee3f94869452948c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e85946839894270010000c03a89ff9f01000060eed4af9f010000686f4df520b71040bad725942cdf4440f6c0b5ec736bce3f9cddf6baea552a40713c28581910de3fd28492cb61842e405813e0a992961640d5c42e832d142240d0c1bd7421d10740928703da14e623406865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e947494628c055f635f316494682f68314b008594683387945294284b014b068594681189433033d444a11df2f03f07146a13bb2c953f110efc4447a9de3f6502b99440adee3ff1517f81a9d78c3fa4207c89a73bf33f9474946275622e" + "hex": "8004952c070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b038594681189431865a4e47691cad13faabe1587956ec5bf86a13289b9d1f33f947494628c035f706394682f68314b008594683387945294284b014b0385946811894318d03b6fcede38c23f49bff8ba51bfc3bfeb49d7ba972cef3f947494628c055f6d65616e94682f68314b008594683387945294284b014b0385946839894318a87112fb011ae33fb149600a34dbde3f76f1a03aa38ce73f947494628c065f7369676d6194680b681143087733aed28d6dca3f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468398943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b028c095f6c725f616461707494888c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b0186946811894318723c8b7fb8bdac3f5e4100bdae468abf41ad5f5c5df7c23f947494628c075f455369676d6194682f68314b008594683387945294284b014b094b0186946811894348e20a4e4667de713f60a4e983b5e2003f5b792354fbb88a3fe0a4e983b5e2003f66556f740f3f543f8e1451189084433f5b792354fbb88a3f8e1451189084433f66c6b152dc4a7f3f947494628c065f566d65616e94473fd44379b9ad2f1c8c075f565369676d6194473f96fd4b21333f448c095f6574615f6d65616e94680b68114308305f6382b698ea3f94869452948c0a5f6574615f5369676d6194680b681143085f2c64e50e26ee3f94869452948c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e8594683989427001000030ff86d10a020000c09cacd00a020000686f4df520b71040bad725942cdf4440f6c0b5ec736bce3f9cddf6baea552a40713c28581910de3fd28492cb61842e405813e0a992961640d5c42e832d142240d0c1bd7421d10740928703da14e623400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494682f68314b008594683387945294284b014b068594681189433033d444a11df2f03f07146a13bb2c953f110efc4447a9de3f6502b99440adee3ff1517f81a9d78c3fa4207c89a73bf33f9474946275622e" }, { "trial": 22, "chunks": 2, - "hex": "8004952c070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b038594681189431819c1d43d99c0cb3f0b31ccee90e7c0bfae45c6b5dc69cd3f947494628c035f706394682f68314b008594683387945294284b014b0385946811894318f030f1132d0970bfbe0901abb58abbbff4296bca7c61c2bf947494628c055f6d65616e94682f68314b008594683387945294284b014b03859468398943180749d9a0f3d9e23ffea3417e538fde3f78e71f9d2766e53f947494628c065f7369676d6194680b68114308568fafd401f1c53f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468398943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b038c095f6c725f616461707494888c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b01869468118943187f03721df724ac3f58e0f17f2e628dbf6c699543ebbbb73f947494628c075f455369676d6194682f68314b008594683387945294284b014b094b018694681189434827dc88a37d5b78bf4297943b0e3a3cbf9ed1ede3cf81893f3497943b0e3a3cbf62e178b9415e7fbfe80a09e7a2073cbf9fd1ede3cf81893fec0a09e7a2073cbf787ae4606eb063bf947494628c065f566d65616e94473fd34fed13d067a88c075f565369676d6194473f9fe329c7e853008c095f6574615f6d65616e94680b68114308fe5b47fcb079e83f94869452948c0a5f6574615f5369676d6194680b68114308a61c2b81f441ed3f94869452948c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e85946839894270010000c03a89ff9f01000060eed4af9f010000686f4df520b71040bad725942cdf4440f6c0b5ec736bce3f9cddf6baea552a400cc2abc8c66f0240a09614d12e1232405813e0a992961640d5c42e832d142240d0c1bd7421d10740928703da14e623406865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e947494628c055f635f316494682f68314b008594683387945294284b014b0685946811894330143f5aa80531f03f813a25655a419ebf3df0298b5cc2dc3f3455426bc338f03ff8565eb6fe4fb2bf9dfb706cbddaf23f9474946275622e" + "hex": "8004952c070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b038594681189431819c1d43d99c0cb3f0b31ccee90e7c0bfae45c6b5dc69cd3f947494628c035f706394682f68314b008594683387945294284b014b0385946811894318f030f1132d0970bfbe0901abb58abbbff4296bca7c61c2bf947494628c055f6d65616e94682f68314b008594683387945294284b014b03859468398943180749d9a0f3d9e23ffea3417e538fde3f78e71f9d2766e53f947494628c065f7369676d6194680b68114308568fafd401f1c53f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468398943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b038c095f6c725f616461707494888c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b01869468118943187f03721df724ac3f58e0f17f2e628dbf6c699543ebbbb73f947494628c075f455369676d6194682f68314b008594683387945294284b014b094b018694681189434827dc88a37d5b78bf4297943b0e3a3cbf9ed1ede3cf81893f3497943b0e3a3cbf62e178b9415e7fbfe80a09e7a2073cbf9fd1ede3cf81893fec0a09e7a2073cbf787ae4606eb063bf947494628c065f566d65616e94473fd34fed13d067a88c075f565369676d6194473f9fe329c7e853008c095f6574615f6d65616e94680b68114308fe5b47fcb079e83f94869452948c0a5f6574615f5369676d6194680b68114308a61c2b81f441ed3f94869452948c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e8594683989427001000030ff86d10a020000c09cacd00a020000686f4df520b71040bad725942cdf4440f6c0b5ec736bce3f9cddf6baea552a400cc2abc8c66f0240a09614d12e1232405813e0a992961640d5c42e832d142240d0c1bd7421d10740928703da14e623400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494682f68314b008594683387945294284b014b0685946811894330143f5aa80531f03f813a25655a419ebf3df0298b5cc2dc3f3455426bc338f03ff8565eb6fe4fb2bf9dfb706cbddaf23f9474946275622e" }, { "trial": 29, "chunks": 2, - "hex": "8004952c070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b03859468118943181e130643f82becbf80a24755e8c6f03fbe96365c91a1f13f947494628c035f706394682f68314b008594683387945294284b014b038594681189431818f110f6c8fcebbf6c5fbf5f34edf23f236ed1160236e93f947494628c055f6d65616e94682f68314b008594683387945294284b014b0385946839894318929b1c84a054e03f8743da9249d5e23f4132b04773dbe73f947494628c065f7369676d6194680b6811430850d3be82c74ec83f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468398943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b048c095f6c725f616461707494888c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b01869468118943183918b2e2b804a1bf5a3496f2aa5cb43f3875fca08ed9c43f947494628c075f455369676d6194682f68314b008594683387945294284b014b094b01869468118943480d0806cafad96fbf13fdc041bc7277bf457cfdcea29a843f12fdc041bc7277bf17f73f1558aa78bf17c9792be49e633f457cfdcea29a843f16c9792be49e633f2038596dce3616bf947494628c065f566d65616e94473fdf44fb1352245f8c075f565369676d6194473fa104081d0330418c095f6574615f6d65616e94680b681143082475647cdab3e63f94869452948c0a5f6574615f5369676d6194680b68114308366c9bed9764ec3f94869452948c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e85946839894270010000c03a89ff9f01000060eed4af9f010000686f4df520b71040bad725942cdf4440f6c0b5ec736bce3f9cddf6baea552a400cc2abc8c66f0240a09614d12e1232406263e2644cfa1840b75b2e2521254340d0c1bd7421d10740928703da14e623406865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e947494628c055f635f316494682f68314b008594683387945294284b014b0685946811894330175f47392d10f03f9c037dd588eacabf55f70de94057d83f204a1874b138f03f9f6ade41b751533f9ed6df0db3d8f23f9474946275622e" + "hex": "8004952c070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b078594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b03859468118943181e130643f82becbf80a24755e8c6f03fbe96365c91a1f13f947494628c035f706394682f68314b008594683387945294284b014b038594681189431818f110f6c8fcebbf6c5fbf5f34edf23f236ed1160236e93f947494628c055f6d65616e94682f68314b008594683387945294284b014b0385946839894318929b1c84a054e03f8743da9249d5e23f4132b04773dbe73f947494628c065f7369676d6194680b6811430850d3be82c74ec83f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b034b02869468398943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b048c095f6c725f616461707494888c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b034b01869468118943183918b2e2b804a1bf5a3496f2aa5cb43f3875fca08ed9c43f947494628c075f455369676d6194682f68314b008594683387945294284b014b094b01869468118943480d0806cafad96fbf13fdc041bc7277bf457cfdcea29a843f12fdc041bc7277bf17f73f1558aa78bf17c9792be49e633f457cfdcea29a843f16c9792be49e633f2038596dce3616bf947494628c065f566d65616e94473fdf44fb1352245f8c075f565369676d6194473fa104081d0330418c095f6574615f6d65616e94680b681143082475647cdab3e63f94869452948c0a5f6574615f5369676d6194680b68114308366c9bed9764ec3f94869452948c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2e8594683989427001000030ff86d10a020000c09cacd00a020000686f4df520b71040bad725942cdf4440f6c0b5ec736bce3f9cddf6baea552a400cc2abc8c66f0240a09614d12e1232406263e2644cfa1840b75b2e2521254340d0c1bd7421d10740928703da14e623400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494682f68314b008594683387945294284b014b0685946811894330175f47392d10f03f9c037dd588eacabf55f70de94057d83f204a1874b138f03f9f6ade41b751533f9ed6df0db3d8f23f9474946275622e" } ] }, @@ -60,22 +60,22 @@ { "trial": 7, "chunks": 2, - "hex": "800495f0040000000000008c0d636d6165732e5f736570636d61948c06536570434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394473fe55555555555558c035f633194680b68114308ea57eb29b179c33f94869452948c045f636d7594680b68114308cd519e35113fcf3f94869452948c085f635f7369676d6194680b68114308af9a51ec74c4e23f94869452948c085f645f7369676d6194680b6811430858cd28763a62f93f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b038594681189431839b370ce9abde23f39b370ce9abdd23f5b99b752be1cbf3f947494628c085f705f7369676d6194682c682e4b008594683087945294284b014b0285946811894310bb9046014a66f23fb3a71a86eac98d3f947494628c035f706394682c682e4b008594683087945294284b014b0285946811894310148d45cf740df33f4d1a8aee8ed88e3f947494628c055f6d65616e94682c682e4b008594683087945294284b014b028594681189431046b2dd39667ce43fc8a51e7f860ee03f947494628c065f7369676d6194680b68114308a7c3c8a025b0c43f94869452948c025f44944e8c025f4394682c682e4b008594683087945294284b014b02859468118943106f2c6b4e4e14f13f07e74ef3083ce53f947494628c075f626f756e647394682c682e4b008594683087945294284b014b024b02869468118943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b018c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682c682e4b008594683087945294284b014b2885946811894240010000000000000000000000000000000000006ffd82dfd23ae33f5cb22198496c2a400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009474946275622e" + "hex": "800495f0040000000000008c0d636d6165732e5f736570636d61948c06536570434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394473fe55555555555558c035f633194680b68114308ea57eb29b179c33f94869452948c045f636d7594680b68114308cd519e35113fcf3f94869452948c085f635f7369676d6194680b68114308af9a51ec74c4e23f94869452948c085f645f7369676d6194680b6811430858cd28763a62f93f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b038594681189431839b370ce9abde23f39b370ce9abdd23f5b99b752be1cbf3f947494628c085f705f7369676d6194682c682e4b008594683087945294284b014b0285946811894310bb9046014a66f23fb3a71a86eac98d3f947494628c035f706394682c682e4b008594683087945294284b014b0285946811894310148d45cf740df33f4d1a8aee8ed88e3f947494628c055f6d65616e94682c682e4b008594683087945294284b014b028594681189431046b2dd39667ce43fc8a51e7f860ee03f947494628c065f7369676d6194680b68114308a7c3c8a025b0c43f94869452948c025f44944e8c025f4394682c682e4b008594683087945294284b014b02859468118943106f2c6b4e4e14f13f07e74ef3083ce53f947494628c075f626f756e647394682c682e4b008594683087945294284b014b024b02869468118943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b018c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682c682e4b008594683087945294284b014b2885946811894240010000756d656e74732e0a20202020657870656ffd82dfd23ae33f5cb22198496c2a40287368617065735f2973292c206c6f633d302c207363616c653d312c206c623d4e6f6e652c2075623d4e6f6e652c20636f6e646974696f6e616c3d46616c73652c202a2a6b776473290a202020202020202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e209474946275622e" }, { "trial": 13, "chunks": 2, - "hex": "80049512050000000000008c0d636d6165732e5f736570636d61948c06536570434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394473fe55555555555558c035f633194680b68114308ea57eb29b179c33f94869452948c045f636d7594680b68114308cd519e35113fcf3f94869452948c085f635f7369676d6194680b68114308af9a51ec74c4e23f94869452948c085f645f7369676d6194680b6811430858cd28763a62f93f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b038594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289431839b370ce9abde23f39b370ce9abdd23f5b99b752be1cbf3f947494628c085f705f7369676d6194682c682e4b008594683087945294284b014b02859468118943103443ac3a9644ca3fa3861a35e879b03f947494628c035f706394682c682e4b008594683087945294284b014b0285946811894310706ff98d4294bb3f2e50cad2c5c4ab3f947494628c055f6d65616e94682c682e4b008594683087945294284b014b0285946836894310a955f886ee6de33f496429988d3ce03f947494628c065f7369676d6194680b6811430820404689cc75be3f94869452948c025f44944e8c025f4394682c682e4b008594683087945294284b014b02859468118943100c79f4f2f074e73fb9b3eb57b918da3f947494628c075f626f756e647394682c682e4b008594683087945294284b014b024b02869468368943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b028c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682c682e4b008594683087945294284b014b2885946836894240010000000000000000000000000000000000006ffd82dfd23ae33f5cb22198496c2a406c467a6fb487eb3f593eb163514b254000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009474946275622e" + "hex": "80049512050000000000008c0d636d6165732e5f736570636d61948c06536570434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394473fe55555555555558c035f633194680b68114308ea57eb29b179c33f94869452948c045f636d7594680b68114308cd519e35113fcf3f94869452948c085f635f7369676d6194680b68114308af9a51ec74c4e23f94869452948c085f645f7369676d6194680b6811430858cd28763a62f93f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b038594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289431839b370ce9abde23f39b370ce9abdd23f5b99b752be1cbf3f947494628c085f705f7369676d6194682c682e4b008594683087945294284b014b02859468118943103443ac3a9644ca3fa3861a35e879b03f947494628c035f706394682c682e4b008594683087945294284b014b0285946811894310706ff98d4294bb3f2e50cad2c5c4ab3f947494628c055f6d65616e94682c682e4b008594683087945294284b014b0285946836894310a955f886ee6de33f496429988d3ce03f947494628c065f7369676d6194680b6811430820404689cc75be3f94869452948c025f44944e8c025f4394682c682e4b008594683087945294284b014b02859468118943100c79f4f2f074e73fb9b3eb57b918da3f947494628c075f626f756e647394682c682e4b008594683087945294284b014b024b02869468368943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b028c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682c682e4b008594683087945294284b014b2885946836894240010000756d656e74732e0a20202020657870656ffd82dfd23ae33f5cb22198496c2a406c467a6fb487eb3f593eb163514b25403d302c207363616c653d312c206c623d4e6f6e652c2075623d4e6f6e652c20636f6e646974696f6e616c3d46616c73652c202a2a6b776473290a202020202020202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e209474946275622e" }, { "trial": 19, "chunks": 2, - "hex": "80049512050000000000008c0d636d6165732e5f736570636d61948c06536570434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394473fe55555555555558c035f633194680b68114308ea57eb29b179c33f94869452948c045f636d7594680b68114308cd519e35113fcf3f94869452948c085f635f7369676d6194680b68114308af9a51ec74c4e23f94869452948c085f645f7369676d6194680b6811430858cd28763a62f93f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b038594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289431839b370ce9abde23f39b370ce9abdd23f5b99b752be1cbf3f947494628c085f705f7369676d6194682c682e4b008594683087945294284b014b02859468118943102cccaa9b7241d53fb4f351bf4a6ae1bf947494628c035f706394682c682e4b008594683087945294284b014b02859468118943100e93efa4da53d03f93eb9f5ef8ffd6bf947494628c055f6d65616e94682c682e4b008594683087945294284b014b02859468368943104f035c1adb04e43f6bd584435b71de3f947494628c065f7369676d6194680b68114308ae233e2fc965b93f94869452948c025f44944e8c025f4394682c682e4b008594683087945294284b014b02859468118943101fb675a5b9ebe03ff2e3b16d706ed33f947494628c075f626f756e647394682c682e4b008594683087945294284b014b024b02869468368943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b038c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682c682e4b008594683087945294284b014b2885946836894240010000000000000000000000000000000000006ffd82dfd23ae33f5cb22198496c2a406c467a6fb487eb3f593eb163514b254090ad58038fb6d63f2d0a5ba7f6c31240000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009474946275622e" + "hex": "80049512050000000000008c0d636d6165732e5f736570636d61948c06536570434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394473fe55555555555558c035f633194680b68114308ea57eb29b179c33f94869452948c045f636d7594680b68114308cd519e35113fcf3f94869452948c085f635f7369676d6194680b68114308af9a51ec74c4e23f94869452948c085f645f7369676d6194680b6811430858cd28763a62f93f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b038594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289431839b370ce9abde23f39b370ce9abdd23f5b99b752be1cbf3f947494628c085f705f7369676d6194682c682e4b008594683087945294284b014b02859468118943102cccaa9b7241d53fb4f351bf4a6ae1bf947494628c035f706394682c682e4b008594683087945294284b014b02859468118943100e93efa4da53d03f93eb9f5ef8ffd6bf947494628c055f6d65616e94682c682e4b008594683087945294284b014b02859468368943104f035c1adb04e43f6bd584435b71de3f947494628c065f7369676d6194680b68114308ae233e2fc965b93f94869452948c025f44944e8c025f4394682c682e4b008594683087945294284b014b02859468118943101fb675a5b9ebe03ff2e3b16d706ed33f947494628c075f626f756e647394682c682e4b008594683087945294284b014b024b02869468368943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b038c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682c682e4b008594683087945294284b014b2885946836894240010000756d656e74732e0a20202020657870656ffd82dfd23ae33f5cb22198496c2a406c467a6fb487eb3f593eb163514b254090ad58038fb6d63f2d0a5ba7f6c312404e6f6e652c2075623d4e6f6e652c20636f6e646974696f6e616c3d46616c73652c202a2a6b776473290a202020202020202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e209474946275622e" }, { "trial": 25, "chunks": 2, - "hex": "80049512050000000000008c0d636d6165732e5f736570636d61948c06536570434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394473fe55555555555558c035f633194680b68114308ea57eb29b179c33f94869452948c045f636d7594680b68114308cd519e35113fcf3f94869452948c085f635f7369676d6194680b68114308af9a51ec74c4e23f94869452948c085f645f7369676d6194680b6811430858cd28763a62f93f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b038594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289431839b370ce9abde23f39b370ce9abdd23f5b99b752be1cbf3f947494628c085f705f7369676d6194682c682e4b008594683087945294284b014b02859468118943106cca3af7f37dc0bf30e02af64c1df3bf947494628c035f706394682c682e4b008594683087945294284b014b028594681189431083f7d4b4208abdbf2894922b5d89e5bf947494628c055f6d65616e94682c682e4b008594683087945294284b014b028594683689431028a2dedfcb91e33faea32e2d2df6db3f947494628c065f7369676d6194680b68114308c9b079169801b93f94869452948c025f44944e8c025f4394682c682e4b008594683087945294284b014b02859468118943100e2af52933aed53fd6f17286ebcdd33f947494628c075f626f756e647394682c682e4b008594683087945294284b014b024b02869468368943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b048c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682c682e4b008594683087945294284b014b2885946836894240010000000000000000000000000000000000006ffd82dfd23ae33f5cb22198496c2a406c467a6fb487eb3f593eb163514b254090ad58038fb6d63f2d0a5ba7f6c31240d2929d6243fa8f3fe6d0605ce4a0f93f0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009474946275622e" + "hex": "80049512050000000000008c0d636d6165732e5f736570636d61948c06536570434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394473fe55555555555558c035f633194680b68114308ea57eb29b179c33f94869452948c045f636d7594680b68114308cd519e35113fcf3f94869452948c085f635f7369676d6194680b68114308af9a51ec74c4e23f94869452948c085f645f7369676d6194680b6811430858cd28763a62f93f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b038594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b0074946289431839b370ce9abde23f39b370ce9abdd23f5b99b752be1cbf3f947494628c085f705f7369676d6194682c682e4b008594683087945294284b014b02859468118943106cca3af7f37dc0bf30e02af64c1df3bf947494628c035f706394682c682e4b008594683087945294284b014b028594681189431083f7d4b4208abdbf2894922b5d89e5bf947494628c055f6d65616e94682c682e4b008594683087945294284b014b028594683689431028a2dedfcb91e33faea32e2d2df6db3f947494628c065f7369676d6194680b68114308c9b079169801b93f94869452948c025f44944e8c025f4394682c682e4b008594683087945294284b014b02859468118943100e2af52933aed53fd6f17286ebcdd33f947494628c075f626f756e647394682c682e4b008594683087945294284b014b024b02869468368943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b048c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682c682e4b008594683087945294284b014b2885946836894240010000756d656e74732e0a20202020657870656ffd82dfd23ae33f5cb22198496c2a406c467a6fb487eb3f593eb163514b254090ad58038fb6d63f2d0a5ba7f6c31240d2929d6243fa8f3fe6d0605ce4a0f93f6f6e646974696f6e616c3d46616c73652c202a2a6b776473290a202020202020202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e209474946275622e" } ] }, @@ -85,17 +85,17 @@ { "trial": 5, "chunks": 2, - "hex": "800495c6050000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b018c085f706f7073697a65944b048c035f6d75944b028c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b0074946243080c747aa44c5bf73f94869452948c035f636394680b6811430836793cf4980fe63f94869452948c035f633194680b6811430820290b6dabf6d23f94869452948c045f636d7594680b68114308f962e030fa5a9c3f94869452948c085f635f7369676d6194680b6811430887988116c4aedd3f94869452948c085f645f7369676d6194680b681143082266a005b16bf73f94869452948c035f636d944b018c065f6368695f6e94473fe98618618618628c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b0485946811894320723402c0b3bbe93f3a2ef7ff3011c93fa81cb8c0bb99e1bf4610736aa0aff6bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0185946811894308a8aa718d2e33f33f947494628c035f706394682f68314b008594683387945294284b014b018594681189430855ef36d1159ff53f947494628c055f6d65616e94682f68314b008594683387945294284b014b01859468118943089ea78f868546e63f947494628c055f635f316494682f68314b008594683387945294284b014b018594681189430835bd9cae831df43f947494628c065f7369676d6194680b6811430836e976dfe507c93f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b014b02869468118943100000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b0a8c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b014b01869468118943080000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b014b01869468118943080000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b128c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b24859468118942200100007075746174696f6e616c205374617469f357a4350123e23f187fb320d38529406c7973697320313232202832303138292039322d3130302e0a20202020202020202020203a646f693a6031302e313031362f6a2e637364612e323031382e30312e303037600a0a2020202025286578616d706c6529730a0a202020206170657329732c206c6f633d30290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d30290a20202020202020204d65616e206f662074686520646973747269627574696f6e2e0a2020202076617228252873686170657329732c206c6f633d30290a202020202020202056617269616e6365206f6620746865209474946275622e" + "hex": "800495c6050000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b018c085f706f7073697a65944b048c035f6d75944b028c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b0074946243080c747aa44c5bf73f94869452948c035f636394680b6811430836793cf4980fe63f94869452948c035f633194680b6811430820290b6dabf6d23f94869452948c045f636d7594680b68114308f962e030fa5a9c3f94869452948c085f635f7369676d6194680b6811430887988116c4aedd3f94869452948c085f645f7369676d6194680b681143082266a005b16bf73f94869452948c035f636d944b018c065f6368695f6e94473fe98618618618628c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b0485946811894320723402c0b3bbe93f3a2ef7ff3011c93fa81cb8c0bb99e1bf4610736aa0aff6bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0185946811894308a8aa718d2e33f33f947494628c035f706394682f68314b008594683387945294284b014b018594681189430855ef36d1159ff53f947494628c055f6d65616e94682f68314b008594683387945294284b014b01859468118943089ea78f868546e63f947494628c055f635f316494682f68314b008594683387945294284b014b018594681189430835bd9cae831df43f947494628c065f7369676d6194680b6811430836e976dfe507c93f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b014b02869468118943100000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b0a8c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b014b01869468118943080000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b014b01869468118943080000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b128c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b24859468118942200100006c617469766520646973747269627574f357a4350123e23f187fb320d385294020207366286b2c20252873686170657329732c206c6f633d30290a2020202020202020537572766976616c2066756e6374696f6e202028616c736f20646566696e656420617320606031202d2063646660602c20627574206073666020697320736f6d6574696d6573206d6f7265206163637572617465292e0a202020206c6f677366286b2c20252873686170657329732c206c6f633d30290a20202020202020204c6f67206f662074686520737572766976616c2066756e6374696f6e2e0a2020202070706628712c20252873686170657329732c206c6f633d30290a202020202020202050657263656e7420706f696e742066756e6374696f6e2028696e9474946275622e" }, { "trial": 9, "chunks": 2, - "hex": "800495e8050000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b018c085f706f7073697a65944b048c035f6d75944b028c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b0074946243080c747aa44c5bf73f94869452948c035f636394680b6811430836793cf4980fe63f94869452948c035f633194680b6811430820290b6dabf6d23f94869452948c045f636d7594680b68114308f962e030fa5a9c3f94869452948c085f635f7369676d6194680b6811430887988116c4aedd3f94869452948c085f645f7369676d6194680b681143082266a005b16bf73f94869452948c035f636d944b018c065f6368695f6e94473fe98618618618628c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b048594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b00749462894320723402c0b3bbe93f3a2ef7ff3011c93fa81cb8c0bb99e1bf4610736aa0aff6bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b018594681189430811855539b7edd63f947494628c035f706394682f68314b008594683387945294284b014b0185946811894308a0fd2c4ff586ae3f947494628c055f6d65616e94682f68314b008594683387945294284b014b0185946839894308750530063a50e43f947494628c065f7369676d6194680b68114308841332baaf05c53f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b014b02869468398943100000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b0a8c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b014b01869468398943080000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b014b01869468398943080000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b128c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b24859468398942200100007075746174696f6e616c205374617469f357a4350123e23f187fb320d385294043dd4bbd7cdca03fd35a503b827910402039322d3130302e0a20202020202020202020203a646f693a6031302e313031362f6a2e637364612e323031382e30312e303037600a0a2020202025286578616d706c6529730a0a202020206170657329732c206c6f633d30290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d30290a20202020202020204d65616e206f662074686520646973747269627574696f6e2e0a2020202076617228252873686170657329732c206c6f633d30290a202020202020202056617269616e6365206f662074686520947494628c055f635f316494682f68314b008594683387945294284b014b01859468118943087fc96ea6dc57eb3f9474946275622e" + "hex": "800495e8050000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b018c085f706f7073697a65944b048c035f6d75944b028c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b0074946243080c747aa44c5bf73f94869452948c035f636394680b6811430836793cf4980fe63f94869452948c035f633194680b6811430820290b6dabf6d23f94869452948c045f636d7594680b68114308f962e030fa5a9c3f94869452948c085f635f7369676d6194680b6811430887988116c4aedd3f94869452948c085f645f7369676d6194680b681143082266a005b16bf73f94869452948c035f636d944b018c065f6368695f6e94473fe98618618618628c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b048594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b00749462894320723402c0b3bbe93f3a2ef7ff3011c93fa81cb8c0bb99e1bf4610736aa0aff6bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b018594681189430811855539b7edd63f947494628c035f706394682f68314b008594683387945294284b014b0185946811894308a0fd2c4ff586ae3f947494628c055f6d65616e94682f68314b008594683387945294284b014b0185946839894308750530063a50e43f947494628c065f7369676d6194680b68114308841332baaf05c53f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b014b02869468398943100000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b0a8c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b014b01869468398943080000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b014b01869468398943080000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b128c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b24859468398942200100006c617469766520646973747269627574f357a4350123e23f187fb320d385294043dd4bbd7cdca03fd35a503b8279104029732c206c6f633d30290a2020202020202020537572766976616c2066756e6374696f6e202028616c736f20646566696e656420617320606031202d2063646660602c20627574206073666020697320736f6d6574696d6573206d6f7265206163637572617465292e0a202020206c6f677366286b2c20252873686170657329732c206c6f633d30290a20202020202020204c6f67206f662074686520737572766976616c2066756e6374696f6e2e0a2020202070706628712c20252873686170657329732c206c6f633d30290a202020202020202050657263656e7420706f696e742066756e6374696f6e2028696e947494628c055f635f316494682f68314b008594683387945294284b014b01859468118943087fc96ea6dc57eb3f9474946275622e" }, { "trial": 13, "chunks": 2, - "hex": "800495e8050000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b018c085f706f7073697a65944b048c035f6d75944b028c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b0074946243080c747aa44c5bf73f94869452948c035f636394680b6811430836793cf4980fe63f94869452948c035f633194680b6811430820290b6dabf6d23f94869452948c045f636d7594680b68114308f962e030fa5a9c3f94869452948c085f635f7369676d6194680b6811430887988116c4aedd3f94869452948c085f645f7369676d6194680b681143082266a005b16bf73f94869452948c035f636d944b018c065f6368695f6e94473fe98618618618628c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b048594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b00749462894320723402c0b3bbe93f3a2ef7ff3011c93fa81cb8c0bb99e1bf4610736aa0aff6bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0185946811894308aee873452b75b4bf947494628c035f706394682f68314b008594683387945294284b014b0185946811894308a6af21f4d1efd0bf947494628c055f6d65616e94682f68314b008594683387945294284b014b018594683989430890e773688204e33f947494628c065f7369676d6194680b6811430893372b90699dbf3f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b014b02869468398943100000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b0a8c025f67944b038c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b014b01869468398943080000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b014b01869468398943080000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b128c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b24859468398942200100007075746174696f6e616c205374617469f357a4350123e23f187fb320d385294043dd4bbd7cdca03fd35a503b82791040e564f7c96dba543f3de33db3ac851440202020203a646f693a6031302e313031362f6a2e637364612e323031382e30312e303037600a0a2020202025286578616d706c6529730a0a202020206170657329732c206c6f633d30290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d30290a20202020202020204d65616e206f662074686520646973747269627574696f6e2e0a2020202076617228252873686170657329732c206c6f633d30290a202020202020202056617269616e6365206f662074686520947494628c055f635f316494682f68314b008594683387945294284b014b0185946811894308fa8dadb3df33e33f9474946275622e" + "hex": "800495e8050000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b018c085f706f7073697a65944b048c035f6d75944b028c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b0074946243080c747aa44c5bf73f94869452948c035f636394680b6811430836793cf4980fe63f94869452948c035f633194680b6811430820290b6dabf6d23f94869452948c045f636d7594680b68114308f962e030fa5a9c3f94869452948c085f635f7369676d6194680b6811430887988116c4aedd3f94869452948c085f645f7369676d6194680b681143082266a005b16bf73f94869452948c035f636d944b018c065f6368695f6e94473fe98618618618628c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b048594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b00749462894320723402c0b3bbe93f3a2ef7ff3011c93fa81cb8c0bb99e1bf4610736aa0aff6bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0185946811894308aee873452b75b4bf947494628c035f706394682f68314b008594683387945294284b014b0185946811894308a6af21f4d1efd0bf947494628c055f6d65616e94682f68314b008594683387945294284b014b018594683989430890e773688204e33f947494628c065f7369676d6194680b6811430893372b90699dbf3f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b014b02869468398943100000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b0a8c025f67944b038c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b014b01869468398943080000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b014b01869468398943080000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b128c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b24859468398942200100006c617469766520646973747269627574f357a4350123e23f187fb320d385294043dd4bbd7cdca03fd35a503b82791040e564f7c96dba543f3de33db3ac851440202020537572766976616c2066756e6374696f6e202028616c736f20646566696e656420617320606031202d2063646660602c20627574206073666020697320736f6d6574696d6573206d6f7265206163637572617465292e0a202020206c6f677366286b2c20252873686170657329732c206c6f633d30290a20202020202020204c6f67206f662074686520737572766976616c2066756e6374696f6e2e0a2020202070706628712c20252873686170657329732c206c6f633d30290a202020202020202050657263656e7420706f696e742066756e6374696f6e2028696e947494628c055f635f316494682f68314b008594683387945294284b014b0185946811894308fa8dadb3df33e33f9474946275622e" } ] }, @@ -105,22 +105,22 @@ { "trial": 8, "chunks": 3, - "hex": "8004959c090000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f6363946811681743083e39d84fb3e1e13f94869452948c035f6331946811681743088785f23a4daeb83f94869452948c045f636d75946811681743089026bdad883caa3f94869452948c085f635f7369676d61946811681743089c0fa27bde8dda3f94869452948c085f645f7369676d6194681168174308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f7765696768747394680f8c0c5f7265636f6e73747275637494939468128c076e6461727261799493944b0085944301629487945294284b014b078594681789433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194683568374b008594683987945294284b014b038594681789431871cdd9983c77e53f49154fb3725ddc3fd31c1347e599e93f947494628c035f706394683568374b008594683987945294284b014b03859468178943181b9d77abfac0e73fccde38e17363df3fd3863b467b54ec3f947494628c055f6d65616e94683568374b008594683987945294284b014b038594681789431801f478da19f0e23fe0760980eaf0e13fc03a4e53fe80e33f947494628c055f635f316494683568374b008594683987945294284b014b0685946817894330bce904a6165bef3f06f0582e834c99bf2a6512770bdcce3ffec9fb236fe5ef3f091321d7669cbb3f7e543a353cf3eb3f947494628c065f7369676d6194681168174308fcb932638298c33f94869452948c025f44944e8c025f42944e8c075f626f756e647394683568374b008594683987945294284b014b034b02869468178943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683568374b008594683987945294284b014b034b0186946817894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194683568374b008594683987945294284b014b094b0186946817894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394683568374b008594683987945294284b014b2e85946817894270010000c03a89ff9f01000060eed4af9f0100004cbd040524700340d48fcb2292ab3740f6c0b5ec736bce3f9cddf6baea552a400cc2abc8c66f0240a09614d12e1232406263e2644cfa1840b75b2e25212543403d1daf09e40b0040aabef6d1702d41406865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e94749462756268684b1e8c0d5f64697363726574655f69647894683568374b008594683987945294284b014b02859468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b0074946289431000000000000000000100000000000000947494628c135f64697363726574655f73706163655f6c6f7794683568374b008594683987945294284b014b028594681789431000000000000000000000000000000000947494628c145f64697363726574655f73706163655f73697a6594683568374b008594683987945294284b014b028594689789431007000000000000000500000000000000947494628c145f64697363726574655f73706163655f7374657094683568374b008594683987945294284b014b0285946817894310555555555555c53f000000000000d03f947494628c0f5f636f6e74696e756f75735f69647894683568374b008594683987945294284b014b01859468978943080200000000000000947494628c115f636f6e74696e756f75735f737061636594683568374b008594683987945294284b014b014b02869468178943100000000000000000000000000000f03f947494628c075f6e5f7a64696d944b028c066d617267696e94473fa86186186186188c0b6d5f7a5f6c696d5f6c6f7794683568374b008594683987945294284b014b0285946817894310aaaaaaaaaaaae23f000000000000d83f947494628c0a6d5f7a5f6c696d5f757094683568374b008594683987945294284b014b0285946817894310000000000000e83f000000000000e43f947494628c025f4194683568374b008594683987945294284b014b0385946817894318ffffffffffffef3f020000000000f03f000000000000f03f9474946275622e" + "hex": "8004959c090000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f6363946811681743083e39d84fb3e1e13f94869452948c035f6331946811681743088785f23a4daeb83f94869452948c045f636d75946811681743089026bdad883caa3f94869452948c085f635f7369676d61946811681743089c0fa27bde8dda3f94869452948c085f645f7369676d6194681168174308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f7765696768747394680f8c0c5f7265636f6e73747275637494939468128c076e6461727261799493944b0085944301629487945294284b014b078594681789433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194683568374b008594683987945294284b014b038594681789431871cdd9983c77e53f49154fb3725ddc3fd31c1347e599e93f947494628c035f706394683568374b008594683987945294284b014b03859468178943181b9d77abfac0e73fccde38e17363df3fd3863b467b54ec3f947494628c055f6d65616e94683568374b008594683987945294284b014b038594681789431801f478da19f0e23fe0760980eaf0e13fc03a4e53fe80e33f947494628c055f635f316494683568374b008594683987945294284b014b0685946817894330bce904a6165bef3f06f0582e834c99bf2a6512770bdcce3ffec9fb236fe5ef3f091321d7669cbb3f7e543a353cf3eb3f947494628c065f7369676d6194681168174308fcb932638298c33f94869452948c025f44944e8c025f42944e8c075f626f756e647394683568374b008594683987945294284b014b034b02869468178943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683568374b008594683987945294284b014b034b0186946817894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194683568374b008594683987945294284b014b094b0186946817894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394683568374b008594683987945294284b014b2e8594681789427001000030ff86d10a020000c09cacd00a0200004cbd040524700340d48fcb2292ab3740f6c0b5ec736bce3f9cddf6baea552a400cc2abc8c66f0240a09614d12e1232406263e2644cfa1840b75b2e25212543403d1daf09e40b0040aabef6d1702d4140000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000094749462756268684b1e8c0d5f64697363726574655f69647894683568374b008594683987945294284b014b02859468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b0074946289431000000000000000000100000000000000947494628c135f64697363726574655f73706163655f6c6f7794683568374b008594683987945294284b014b028594681789431000000000000000000000000000000000947494628c145f64697363726574655f73706163655f73697a6594683568374b008594683987945294284b014b028594689789431007000000000000000500000000000000947494628c145f64697363726574655f73706163655f7374657094683568374b008594683987945294284b014b0285946817894310555555555555c53f000000000000d03f947494628c0f5f636f6e74696e756f75735f69647894683568374b008594683987945294284b014b01859468978943080200000000000000947494628c115f636f6e74696e756f75735f737061636594683568374b008594683987945294284b014b014b02869468178943100000000000000000000000000000f03f947494628c075f6e5f7a64696d944b028c066d617267696e94473fa86186186186188c0b6d5f7a5f6c696d5f6c6f7794683568374b008594683987945294284b014b0285946817894310aaaaaaaaaaaae23f000000000000d83f947494628c0a6d5f7a5f6c696d5f757094683568374b008594683987945294284b014b0285946817894310000000000000e83f000000000000e43f947494628c025f4194683568374b008594683987945294284b014b0385946817894318ffffffffffffef3f020000000000f03f000000000000f03f9474946275622e" }, { "trial": 15, "chunks": 3, - "hex": "800495be090000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f6363946811681743083e39d84fb3e1e13f94869452948c035f6331946811681743088785f23a4daeb83f94869452948c045f636d75946811681743089026bdad883caa3f94869452948c085f635f7369676d61946811681743089c0fa27bde8dda3f94869452948c085f645f7369676d6194681168174308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f7765696768747394680f8c0c5f7265636f6e73747275637494939468128c076e6461727261799493944b0085944301629487945294284b014b07859468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194683568374b008594683987945294284b014b0385946817894318bc6fd5b69744f03fe0bdcf4767a19e3f9cf5949f5b21e53f947494628c035f706394683568374b008594683987945294284b014b038594681789431858f08d1e4e96f03ff0d7c4d6643aa2bf2284fc9bdb21e53f947494628c055f6d65616e94683568374b008594683987945294284b014b038594683f894318f763d28b1f84e53f72436f996606e13fc1b23ace127ce43f947494628c065f7369676d61946811681743086e84386cd142c23f94869452948c025f44944e8c025f42944e8c075f626f756e647394683568374b008594683987945294284b014b034b028694683f8943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683568374b008594683987945294284b014b034b018694683f894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194683568374b008594683987945294284b014b094b018694683f894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394683568374b008594683987945294284b014b2e8594683f894270010000c03a89ff9f01000060eed4af9f0100004cbd040524700340d48fcb2292ab3740f5da124e0163e93fcf38f50b609223400cc2abc8c66f0240a09614d12e1232406263e2644cfa1840b75b2e25212543403d1daf09e40b0040aabef6d1702d41406865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e947494628c055f635f316494683568374b008594683987945294284b014b0685946817894330dff1a71c1e25ee3f39c3d295fd70a1bf707d30d2c41ad43f32a15abf8a6cef3f50fa6ecbb6cab13fdac02b5d3839e83f94749462756268654b1e8c0d5f64697363726574655f69647894683568374b008594683987945294284b014b02859468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b0074946289431000000000000000000100000000000000947494628c135f64697363726574655f73706163655f6c6f7794683568374b008594683987945294284b014b028594683f89431000000000000000000000000000000000947494628c145f64697363726574655f73706163655f73697a6594683568374b008594683987945294284b014b028594689b89431007000000000000000500000000000000947494628c145f64697363726574655f73706163655f7374657094683568374b008594683987945294284b014b028594683f894310555555555555c53f000000000000d03f947494628c0f5f636f6e74696e756f75735f69647894683568374b008594683987945294284b014b018594689b8943080200000000000000947494628c115f636f6e74696e756f75735f737061636594683568374b008594683987945294284b014b014b028694683f8943100000000000000000000000000000f03f947494628c075f6e5f7a64696d944b028c066d617267696e94473fa86186186186188c0b6d5f7a5f6c696d5f6c6f7794683568374b008594683987945294284b014b028594683f894310aaaaaaaaaaaae23f000000000000d83f947494628c0a6d5f7a5f6c696d5f757094683568374b008594683987945294284b014b028594683f894310000000000000e83f000000000000e43f947494628c025f4194683568374b008594683987945294284b014b038594683f894318ffffffffffffef3f050000000000f03f000000000000f03f9474946275622e" + "hex": "800495be090000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f6363946811681743083e39d84fb3e1e13f94869452948c035f6331946811681743088785f23a4daeb83f94869452948c045f636d75946811681743089026bdad883caa3f94869452948c085f635f7369676d61946811681743089c0fa27bde8dda3f94869452948c085f645f7369676d6194681168174308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f7765696768747394680f8c0c5f7265636f6e73747275637494939468128c076e6461727261799493944b0085944301629487945294284b014b07859468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194683568374b008594683987945294284b014b0385946817894318bc6fd5b69744f03fe0bdcf4767a19e3f9cf5949f5b21e53f947494628c035f706394683568374b008594683987945294284b014b038594681789431858f08d1e4e96f03ff0d7c4d6643aa2bf2284fc9bdb21e53f947494628c055f6d65616e94683568374b008594683987945294284b014b038594683f894318f763d28b1f84e53f72436f996606e13fc1b23ace127ce43f947494628c065f7369676d61946811681743086e84386cd142c23f94869452948c025f44944e8c025f42944e8c075f626f756e647394683568374b008594683987945294284b014b034b028694683f8943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683568374b008594683987945294284b014b034b018694683f894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194683568374b008594683987945294284b014b094b018694683f894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394683568374b008594683987945294284b014b2e8594683f89427001000030ff86d10a020000c09cacd00a0200004cbd040524700340d48fcb2292ab3740f5da124e0163e93fcf38f50b609223400cc2abc8c66f0240a09614d12e1232406263e2644cfa1840b75b2e25212543403d1daf09e40b0040aabef6d1702d41400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494683568374b008594683987945294284b014b0685946817894330dff1a71c1e25ee3f39c3d295fd70a1bf707d30d2c41ad43f32a15abf8a6cef3f50fa6ecbb6cab13fdac02b5d3839e83f94749462756268654b1e8c0d5f64697363726574655f69647894683568374b008594683987945294284b014b02859468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b0074946289431000000000000000000100000000000000947494628c135f64697363726574655f73706163655f6c6f7794683568374b008594683987945294284b014b028594683f89431000000000000000000000000000000000947494628c145f64697363726574655f73706163655f73697a6594683568374b008594683987945294284b014b028594689b89431007000000000000000500000000000000947494628c145f64697363726574655f73706163655f7374657094683568374b008594683987945294284b014b028594683f894310555555555555c53f000000000000d03f947494628c0f5f636f6e74696e756f75735f69647894683568374b008594683987945294284b014b018594689b8943080200000000000000947494628c115f636f6e74696e756f75735f737061636594683568374b008594683987945294284b014b014b028694683f8943100000000000000000000000000000f03f947494628c075f6e5f7a64696d944b028c066d617267696e94473fa86186186186188c0b6d5f7a5f6c696d5f6c6f7794683568374b008594683987945294284b014b028594683f894310aaaaaaaaaaaae23f000000000000d83f947494628c0a6d5f7a5f6c696d5f757094683568374b008594683987945294284b014b028594683f894310000000000000e83f000000000000e43f947494628c025f4194683568374b008594683987945294284b014b038594683f894318ffffffffffffef3f050000000000f03f000000000000f03f9474946275622e" }, { "trial": 22, "chunks": 3, - "hex": "800495be090000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f6363946811681743083e39d84fb3e1e13f94869452948c035f6331946811681743088785f23a4daeb83f94869452948c045f636d75946811681743089026bdad883caa3f94869452948c085f635f7369676d61946811681743089c0fa27bde8dda3f94869452948c085f645f7369676d6194681168174308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f7765696768747394680f8c0c5f7265636f6e73747275637494939468128c076e6461727261799493944b0085944301629487945294284b014b07859468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194683568374b008594683987945294284b014b03859468178943184ccb74edfe16c3bfd3644847d1c0e5bf6a835237c00fc33f947494628c035f706394683568374b008594683987945294284b014b03859468178943181d3d58e3cfead6bf81819be075b9e8bfb0b939078a4abbbf947494628c055f6d65616e94683568374b008594683987945294284b014b038594683f894318ba266514e2c0e23fe5bf2633dcebdc3f4ae90d05ed22e33f947494628c065f7369676d6194681168174308c972cef5f70abf3f94869452948c025f44944e8c025f42944e8c075f626f756e647394683568374b008594683987945294284b014b034b028694683f8943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b038c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683568374b008594683987945294284b014b034b018694683f894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194683568374b008594683987945294284b014b094b018694683f894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394683568374b008594683987945294284b014b2e8594683f894270010000c03a89ff9f01000060eed4af9f0100004cbd040524700340d48fcb2292ab3740f5da124e0163e93fcf38f50b60922340a2de69e90362f43f6cad6426a38e07406263e2644cfa1840b75b2e25212543403d1daf09e40b0040aabef6d1702d41406865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e947494628c055f635f316494683568374b008594683987945294284b014b0685946817894330ac4605fddbdce93f5237eca0d3b6b63fda026ae1052ccd3f68855f89ff10ef3f54dc2ed8e8cac03fb54040dc0a1de53f94749462756268654b1e8c0d5f64697363726574655f69647894683568374b008594683987945294284b014b02859468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b0074946289431000000000000000000100000000000000947494628c135f64697363726574655f73706163655f6c6f7794683568374b008594683987945294284b014b028594683f89431000000000000000000000000000000000947494628c145f64697363726574655f73706163655f73697a6594683568374b008594683987945294284b014b028594689b89431007000000000000000500000000000000947494628c145f64697363726574655f73706163655f7374657094683568374b008594683987945294284b014b028594683f894310555555555555c53f000000000000d03f947494628c0f5f636f6e74696e756f75735f69647894683568374b008594683987945294284b014b018594689b8943080200000000000000947494628c115f636f6e74696e756f75735f737061636594683568374b008594683987945294284b014b014b028694683f8943100000000000000000000000000000f03f947494628c075f6e5f7a64696d944b028c066d617267696e94473fa86186186186188c0b6d5f7a5f6c696d5f6c6f7794683568374b008594683987945294284b014b028594683f894310aaaaaaaaaaaae23f000000000000d83f947494628c0a6d5f7a5f6c696d5f757094683568374b008594683987945294284b014b028594683f894310000000000000e83f000000000000e43f947494628c025f4194683568374b008594683987945294284b014b038594683f894318050000000000f03f260000000000f03f000000000000f03f9474946275622e" + "hex": "800495be090000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f6363946811681743083e39d84fb3e1e13f94869452948c035f6331946811681743088785f23a4daeb83f94869452948c045f636d75946811681743089026bdad883caa3f94869452948c085f635f7369676d61946811681743089c0fa27bde8dda3f94869452948c085f645f7369676d6194681168174308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f7765696768747394680f8c0c5f7265636f6e73747275637494939468128c076e6461727261799493944b0085944301629487945294284b014b07859468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194683568374b008594683987945294284b014b03859468178943184ccb74edfe16c3bfd3644847d1c0e5bf6a835237c00fc33f947494628c035f706394683568374b008594683987945294284b014b03859468178943181d3d58e3cfead6bf81819be075b9e8bfb0b939078a4abbbf947494628c055f6d65616e94683568374b008594683987945294284b014b038594683f894318ba266514e2c0e23fe5bf2633dcebdc3f4ae90d05ed22e33f947494628c065f7369676d6194681168174308c972cef5f70abf3f94869452948c025f44944e8c025f42944e8c075f626f756e647394683568374b008594683987945294284b014b034b028694683f8943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b038c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683568374b008594683987945294284b014b034b018694683f894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194683568374b008594683987945294284b014b094b018694683f894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394683568374b008594683987945294284b014b2e8594683f89427001000030ff86d10a020000c09cacd00a0200004cbd040524700340d48fcb2292ab3740f5da124e0163e93fcf38f50b60922340a2de69e90362f43f6cad6426a38e07406263e2644cfa1840b75b2e25212543403d1daf09e40b0040aabef6d1702d41400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494683568374b008594683987945294284b014b0685946817894330ac4605fddbdce93f5237eca0d3b6b63fda026ae1052ccd3f68855f89ff10ef3f54dc2ed8e8cac03fb54040dc0a1de53f94749462756268654b1e8c0d5f64697363726574655f69647894683568374b008594683987945294284b014b02859468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b0074946289431000000000000000000100000000000000947494628c135f64697363726574655f73706163655f6c6f7794683568374b008594683987945294284b014b028594683f89431000000000000000000000000000000000947494628c145f64697363726574655f73706163655f73697a6594683568374b008594683987945294284b014b028594689b89431007000000000000000500000000000000947494628c145f64697363726574655f73706163655f7374657094683568374b008594683987945294284b014b028594683f894310555555555555c53f000000000000d03f947494628c0f5f636f6e74696e756f75735f69647894683568374b008594683987945294284b014b018594689b8943080200000000000000947494628c115f636f6e74696e756f75735f737061636594683568374b008594683987945294284b014b014b028694683f8943100000000000000000000000000000f03f947494628c075f6e5f7a64696d944b028c066d617267696e94473fa86186186186188c0b6d5f7a5f6c696d5f6c6f7794683568374b008594683987945294284b014b028594683f894310aaaaaaaaaaaae23f000000000000d83f947494628c0a6d5f7a5f6c696d5f757094683568374b008594683987945294284b014b028594683f894310000000000000e83f000000000000e43f947494628c025f4194683568374b008594683987945294284b014b038594683f894318050000000000f03f260000000000f03f000000000000f03f9474946275622e" }, { "trial": 29, "chunks": 3, - "hex": "800495be090000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f6363946811681743083e39d84fb3e1e13f94869452948c035f6331946811681743088785f23a4daeb83f94869452948c045f636d75946811681743089026bdad883caa3f94869452948c085f635f7369676d61946811681743089c0fa27bde8dda3f94869452948c085f645f7369676d6194681168174308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f7765696768747394680f8c0c5f7265636f6e73747275637494939468128c076e6461727261799493944b0085944301629487945294284b014b07859468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194683568374b008594683987945294284b014b03859468178943180bae53bfb40fd5bf9afdc71a9d1acfbf9ae8f3aee5dcd03f947494628c035f706394683568374b008594683987945294284b014b0385946817894318b2daff796f30d7bfad46fc740bcec5bff9bdbce960c9b53f947494628c055f6d65616e94683568374b008594683987945294284b014b038594683f89431848eff6013f2ae23f9c3880ca49e7dd3f4c322e7b5584e33f947494628c065f7369676d61946811681743088026fc193051b93f94869452948c025f44944e8c025f42944e8c075f626f756e647394683568374b008594683987945294284b014b034b028694683f8943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b048c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683568374b008594683987945294284b014b034b018694683f894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194683568374b008594683987945294284b014b094b018694683f894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394683568374b008594683987945294284b014b2e8594683f894270010000c03a89ff9f01000060eed4af9f0100004cbd040524700340d48fcb2292ab3740f5da124e0163e93fcf38f50b60922340a2de69e90362f43f6cad6426a38e0740d8cdeee49e55f63f2903d371d5d923403d1daf09e40b0040aabef6d1702d41406865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e947494628c055f635f316494683568374b008594683987945294284b014b0685946817894330520fa3f122e3e43fb7633131ca96bb3f12cb4868877cc13f50c4959d2eddf03faa0ece3a6e1cc23f2181882a3cc6e13f94749462756268654b1e8c0d5f64697363726574655f69647894683568374b008594683987945294284b014b02859468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b0074946289431000000000000000000100000000000000947494628c135f64697363726574655f73706163655f6c6f7794683568374b008594683987945294284b014b028594683f89431000000000000000000000000000000000947494628c145f64697363726574655f73706163655f73697a6594683568374b008594683987945294284b014b028594689b89431007000000000000000500000000000000947494628c145f64697363726574655f73706163655f7374657094683568374b008594683987945294284b014b028594683f894310555555555555c53f000000000000d03f947494628c0f5f636f6e74696e756f75735f69647894683568374b008594683987945294284b014b018594689b8943080200000000000000947494628c115f636f6e74696e756f75735f737061636594683568374b008594683987945294284b014b014b028694683f8943100000000000000000000000000000f03f947494628c075f6e5f7a64696d944b028c066d617267696e94473fa86186186186188c0b6d5f7a5f6c696d5f6c6f7794683568374b008594683987945294284b014b028594683f894310aaaaaaaaaaaada3f000000000000d83f947494628c0a6d5f7a5f6c696d5f757094683568374b008594683987945294284b014b028594683f894310aaaaaaaaaaaae23f000000000000e43f947494628c025f4194683568374b008594683987945294284b014b038594683f894318020000000000f03f2e0000000000f03f000000000000f03f9474946275622e" + "hex": "800495be090000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f6363946811681743083e39d84fb3e1e13f94869452948c035f6331946811681743088785f23a4daeb83f94869452948c045f636d75946811681743089026bdad883caa3f94869452948c085f635f7369676d61946811681743089c0fa27bde8dda3f94869452948c085f645f7369676d6194681168174308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f7765696768747394680f8c0c5f7265636f6e73747275637494939468128c076e6461727261799493944b0085944301629487945294284b014b07859468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b0074946289433838b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf947494628c085f705f7369676d6194683568374b008594683987945294284b014b03859468178943180bae53bfb40fd5bf9afdc71a9d1acfbf9ae8f3aee5dcd03f947494628c035f706394683568374b008594683987945294284b014b0385946817894318b2daff796f30d7bfad46fc740bcec5bff9bdbce960c9b53f947494628c055f6d65616e94683568374b008594683987945294284b014b038594683f89431848eff6013f2ae23f9c3880ca49e7dd3f4c322e7b5584e33f947494628c065f7369676d61946811681743088026fc193051b93f94869452948c025f44944e8c025f42944e8c075f626f756e647394683568374b008594683987945294284b014b034b028694683f8943300000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b048c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683568374b008594683987945294284b014b034b018694683f894318000000000000000000000000000000000000000000000000947494628c075f455369676d6194683568374b008594683987945294284b014b094b018694683f894348000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394683568374b008594683987945294284b014b2e8594683f89427001000030ff86d10a020000c09cacd00a0200004cbd040524700340d48fcb2292ab3740f5da124e0163e93fcf38f50b60922340a2de69e90362f43f6cad6426a38e0740d8cdeee49e55f63f2903d371d5d923403d1daf09e40b0040aabef6d1702d41400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494683568374b008594683987945294284b014b0685946817894330520fa3f122e3e43fb7633131ca96bb3f12cb4868877cc13f50c4959d2eddf03faa0ece3a6e1cc23f2181882a3cc6e13f94749462756268654b1e8c0d5f64697363726574655f69647894683568374b008594683987945294284b014b02859468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b0074946289431000000000000000000100000000000000947494628c135f64697363726574655f73706163655f6c6f7794683568374b008594683987945294284b014b028594683f89431000000000000000000000000000000000947494628c145f64697363726574655f73706163655f73697a6594683568374b008594683987945294284b014b028594689b89431007000000000000000500000000000000947494628c145f64697363726574655f73706163655f7374657094683568374b008594683987945294284b014b028594683f894310555555555555c53f000000000000d03f947494628c0f5f636f6e74696e756f75735f69647894683568374b008594683987945294284b014b018594689b8943080200000000000000947494628c115f636f6e74696e756f75735f737061636594683568374b008594683987945294284b014b014b028694683f8943100000000000000000000000000000f03f947494628c075f6e5f7a64696d944b028c066d617267696e94473fa86186186186188c0b6d5f7a5f6c696d5f6c6f7794683568374b008594683987945294284b014b028594683f894310aaaaaaaaaaaada3f000000000000d83f947494628c0a6d5f7a5f6c696d5f757094683568374b008594683987945294284b014b028594683f894310aaaaaaaaaaaae23f000000000000e43f947494628c025f4194683568374b008594683987945294284b014b038594683f894318020000000000f03f2e0000000000f03f000000000000f03f9474946275622e" } ] }, @@ -130,17 +130,17 @@ { "trial": 7, "chunks": 3, - "hex": "80049505080000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394681168174308cf08f6cc59fce33f94869452948c035f633194681168174308f572bcb3fdd0c33f94869452948c045f636d7594681168174308031b52bcb49fad3f94869452948c085f635f7369676d61946811681743089886065d9f8edc3f94869452948c085f645f7369676d6194681168174308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f7765696768747394680f8c0c5f7265636f6e73747275637494939468128c076e6461727261799493944b0085944301629487945294284b014b06859468178943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194683568374b008594683987945294284b014b0285946817894310cb65c9712c1cef3fa189e38646aaa03f947494628c035f706394683568374b008594683987945294284b014b0285946817894310194d6b7c8c50f13fbce3e4aee28ca23f947494628c055f6d65616e94683568374b008594683987945294284b014b0285946817894310fc38be3e3f5fe43f3d9729fe7825e03f947494628c055f635f316494683568374b008594683987945294284b014b0385946817894318ee3f659e763fef3ffcf7734ef794b9bf25f21c3ddd18eb3f947494628c065f7369676d6194681168174308f1d19b9de8e7c33f94869452948c025f44944e8c025f42944e8c075f626f756e647394683568374b008594683987945294284b014b024b02869468178943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683568374b008594683987945294284b014b024b018694681789431000000000000000000000000000000000947494628c075f455369676d6194683568374b008594683987945294284b014b044b01869468178943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394683568374b008594683987945294284b014b2885946817894240010000000000000000000000000000000000006ffd82dfd23ae33f5cb22198496c2a406c467a6fb487eb3f593eb163514b254090ad58038fb6d63f2d0a5ba7f6c31240d2929d6243fa8f3fe6d0605ce4a0f93f488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000094749462756268684b148c0d5f64697363726574655f69647894683568374b008594683987945294284b014b00859468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b00749462894300947494628c135f64697363726574655f73706163655f6c6f7794683568374b008594683987945294284b014b00859468178968997494628c145f64697363726574655f73706163655f73697a6594683568374b008594683987945294284b014b00859468978968997494628c145f64697363726574655f73706163655f7374657094683568374b008594683987945294284b014b00859468178968997494628c0f5f636f6e74696e756f75735f69647894683568374b008594683987945294284b014b028594689789431000000000000000000100000000000000947494628c115f636f6e74696e756f75735f737061636594683568374b008594683987945294284b014b024b02869468178943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c075f6e5f7a64696d944b0075622e" + "hex": "80049505080000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394681168174308cf08f6cc59fce33f94869452948c035f633194681168174308f572bcb3fdd0c33f94869452948c045f636d7594681168174308031b52bcb49fad3f94869452948c085f635f7369676d61946811681743089886065d9f8edc3f94869452948c085f645f7369676d6194681168174308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f7765696768747394680f8c0c5f7265636f6e73747275637494939468128c076e6461727261799493944b0085944301629487945294284b014b06859468178943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194683568374b008594683987945294284b014b0285946817894310cb65c9712c1cef3fa189e38646aaa03f947494628c035f706394683568374b008594683987945294284b014b0285946817894310194d6b7c8c50f13fbce3e4aee28ca23f947494628c055f6d65616e94683568374b008594683987945294284b014b0285946817894310fc38be3e3f5fe43f3d9729fe7825e03f947494628c055f635f316494683568374b008594683987945294284b014b0385946817894318ee3f659e763fef3ffcf7734ef794b9bf25f21c3ddd18eb3f947494628c065f7369676d6194681168174308f1d19b9de8e7c33f94869452948c025f44944e8c025f42944e8c075f626f756e647394683568374b008594683987945294284b014b024b02869468178943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683568374b008594683987945294284b014b024b018694681789431000000000000000000000000000000000947494628c075f455369676d6194683568374b008594683987945294284b014b044b01869468178943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394683568374b008594683987945294284b014b2885946817894240010000756d656e74732e0a20202020657870656ffd82dfd23ae33f5cb22198496c2a406c467a6fb487eb3f593eb163514b254090ad58038fb6d63f2d0a5ba7f6c31240d2929d6243fa8f3fe6d0605ce4a0f93f488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e2094749462756268684b148c0d5f64697363726574655f69647894683568374b008594683987945294284b014b00859468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b00749462894300947494628c135f64697363726574655f73706163655f6c6f7794683568374b008594683987945294284b014b00859468178968997494628c145f64697363726574655f73706163655f73697a6594683568374b008594683987945294284b014b00859468978968997494628c145f64697363726574655f73706163655f7374657094683568374b008594683987945294284b014b00859468178968997494628c0f5f636f6e74696e756f75735f69647894683568374b008594683987945294284b014b028594689789431000000000000000000100000000000000947494628c115f636f6e74696e756f75735f737061636594683568374b008594683987945294284b014b024b02869468178943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c075f6e5f7a64696d944b0075622e" }, { "trial": 13, "chunks": 3, - "hex": "80049527080000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394681168174308cf08f6cc59fce33f94869452948c035f633194681168174308f572bcb3fdd0c33f94869452948c045f636d7594681168174308031b52bcb49fad3f94869452948c085f635f7369676d61946811681743089886065d9f8edc3f94869452948c085f645f7369676d6194681168174308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f7765696768747394680f8c0c5f7265636f6e73747275637494939468128c076e6461727261799493944b0085944301629487945294284b014b06859468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b007494628943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194683568374b008594683987945294284b014b028594681789431030ba7edbe777ac3f7e9208894287ddbf947494628c035f706394683568374b008594683987945294284b014b02859468178943104c4c3eb41795b8bf2cd08d1bceb3dcbf947494628c055f6d65616e94683568374b008594683987945294284b014b028594683f8943101151955a7a7ae23f8a4d8f2114cfdc3f947494628c065f7369676d6194681168174308cce640885c64c03f94869452948c025f44944e8c025f42944e8c075f626f756e647394683568374b008594683987945294284b014b024b028694683f8943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683568374b008594683987945294284b014b024b018694683f89431000000000000000000000000000000000947494628c075f455369676d6194683568374b008594683987945294284b014b044b018694683f8943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394683568374b008594683987945294284b014b288594683f894240010000000000000000000000000000000000006ffd82dfd23ae33f5cb22198496c2a40041a711d25dabf3f0b2cc86201062a4090ad58038fb6d63f2d0a5ba7f6c31240d2929d6243fa8f3fe6d0605ce4a0f93f488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494683568374b008594683987945294284b014b0385946817894318a1adf4de218eec3fa8494e5b8106c0bf1aba6f385e3ae43f94749462756268654b148c0d5f64697363726574655f69647894683568374b008594683987945294284b014b00859468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b00749462894300947494628c135f64697363726574655f73706163655f6c6f7794683568374b008594683987945294284b014b008594683f89689d7494628c145f64697363726574655f73706163655f73697a6594683568374b008594683987945294284b014b008594689b89689d7494628c145f64697363726574655f73706163655f7374657094683568374b008594683987945294284b014b008594683f89689d7494628c0f5f636f6e74696e756f75735f69647894683568374b008594683987945294284b014b028594689b89431000000000000000000100000000000000947494628c115f636f6e74696e756f75735f737061636594683568374b008594683987945294284b014b024b028694683f8943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c075f6e5f7a64696d944b0075622e" + "hex": "80049527080000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394681168174308cf08f6cc59fce33f94869452948c035f633194681168174308f572bcb3fdd0c33f94869452948c045f636d7594681168174308031b52bcb49fad3f94869452948c085f635f7369676d61946811681743089886065d9f8edc3f94869452948c085f645f7369676d6194681168174308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f7765696768747394680f8c0c5f7265636f6e73747275637494939468128c076e6461727261799493944b0085944301629487945294284b014b06859468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b007494628943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194683568374b008594683987945294284b014b028594681789431030ba7edbe777ac3f7e9208894287ddbf947494628c035f706394683568374b008594683987945294284b014b02859468178943104c4c3eb41795b8bf2cd08d1bceb3dcbf947494628c055f6d65616e94683568374b008594683987945294284b014b028594683f8943101151955a7a7ae23f8a4d8f2114cfdc3f947494628c065f7369676d6194681168174308cce640885c64c03f94869452948c025f44944e8c025f42944e8c075f626f756e647394683568374b008594683987945294284b014b024b028694683f8943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683568374b008594683987945294284b014b024b018694683f89431000000000000000000000000000000000947494628c075f455369676d6194683568374b008594683987945294284b014b044b018694683f8943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394683568374b008594683987945294284b014b288594683f894240010000756d656e74732e0a20202020657870656ffd82dfd23ae33f5cb22198496c2a40041a711d25dabf3f0b2cc86201062a4090ad58038fb6d63f2d0a5ba7f6c31240d2929d6243fa8f3fe6d0605ce4a0f93f488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e20947494628c055f635f316494683568374b008594683987945294284b014b0385946817894318a1adf4de218eec3fa8494e5b8106c0bf1aba6f385e3ae43f94749462756268654b148c0d5f64697363726574655f69647894683568374b008594683987945294284b014b00859468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b00749462894300947494628c135f64697363726574655f73706163655f6c6f7794683568374b008594683987945294284b014b008594683f89689d7494628c145f64697363726574655f73706163655f73697a6594683568374b008594683987945294284b014b008594689b89689d7494628c145f64697363726574655f73706163655f7374657094683568374b008594683987945294284b014b008594683f89689d7494628c0f5f636f6e74696e756f75735f69647894683568374b008594683987945294284b014b028594689b89431000000000000000000100000000000000947494628c115f636f6e74696e756f75735f737061636594683568374b008594683987945294284b014b024b028694683f8943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c075f6e5f7a64696d944b0075622e" }, { "trial": 19, "chunks": 3, - "hex": "80049527080000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394681168174308cf08f6cc59fce33f94869452948c035f633194681168174308f572bcb3fdd0c33f94869452948c045f636d7594681168174308031b52bcb49fad3f94869452948c085f635f7369676d61946811681743089886065d9f8edc3f94869452948c085f645f7369676d6194681168174308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f7765696768747394680f8c0c5f7265636f6e73747275637494939468128c076e6461727261799493944b0085944301629487945294284b014b06859468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b007494628943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194683568374b008594683987945294284b014b028594681789431040511cdaf9d7c13f1ef63763f75fe0bf947494628c035f706394683568374b008594683987945294284b014b0285946817894310b988c56da731b93fa5055bf551c9d9bf947494628c055f6d65616e94683568374b008594683987945294284b014b028594683f8943109bf21ec556e5e23fcd3d4f524e5adb3f947494628c065f7369676d6194681168174308c36e337ab76fbb3f94869452948c025f44944e8c025f42944e8c075f626f756e647394683568374b008594683987945294284b014b024b028694683f8943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b038c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683568374b008594683987945294284b014b024b018694683f89431000000000000000000000000000000000947494628c075f455369676d6194683568374b008594683987945294284b014b044b018694683f8943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394683568374b008594683987945294284b014b288594683f894240010000000000000000000000000000000000006ffd82dfd23ae33f5cb22198496c2a40041a711d25dabf3f0b2cc86201062a40c8778e014e0db53fe40448134a5f1040d2929d6243fa8f3fe6d0605ce4a0f93f488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494683568374b008594683987945294284b014b038594681789431817fd1b0111aee83f3912fa8882e4babfa221a338a7a3df3f94749462756268654b148c0d5f64697363726574655f69647894683568374b008594683987945294284b014b00859468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b00749462894300947494628c135f64697363726574655f73706163655f6c6f7794683568374b008594683987945294284b014b008594683f89689d7494628c145f64697363726574655f73706163655f73697a6594683568374b008594683987945294284b014b008594689b89689d7494628c145f64697363726574655f73706163655f7374657094683568374b008594683987945294284b014b008594683f89689d7494628c0f5f636f6e74696e756f75735f69647894683568374b008594683987945294284b014b028594689b89431000000000000000000100000000000000947494628c115f636f6e74696e756f75735f737061636594683568374b008594683987945294284b014b024b028694683f8943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c075f6e5f7a64696d944b0075622e" + "hex": "80049527080000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394681168174308cf08f6cc59fce33f94869452948c035f633194681168174308f572bcb3fdd0c33f94869452948c045f636d7594681168174308031b52bcb49fad3f94869452948c085f635f7369676d61946811681743089886065d9f8edc3f94869452948c085f645f7369676d6194681168174308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f7765696768747394680f8c0c5f7265636f6e73747275637494939468128c076e6461727261799493944b0085944301629487945294284b014b06859468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b007494628943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194683568374b008594683987945294284b014b028594681789431040511cdaf9d7c13f1ef63763f75fe0bf947494628c035f706394683568374b008594683987945294284b014b0285946817894310b988c56da731b93fa5055bf551c9d9bf947494628c055f6d65616e94683568374b008594683987945294284b014b028594683f8943109bf21ec556e5e23fcd3d4f524e5adb3f947494628c065f7369676d6194681168174308c36e337ab76fbb3f94869452948c025f44944e8c025f42944e8c075f626f756e647394683568374b008594683987945294284b014b024b028694683f8943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b038c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683568374b008594683987945294284b014b024b018694683f89431000000000000000000000000000000000947494628c075f455369676d6194683568374b008594683987945294284b014b044b018694683f8943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394683568374b008594683987945294284b014b288594683f894240010000756d656e74732e0a20202020657870656ffd82dfd23ae33f5cb22198496c2a40041a711d25dabf3f0b2cc86201062a40c8778e014e0db53fe40448134a5f1040d2929d6243fa8f3fe6d0605ce4a0f93f488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e20947494628c055f635f316494683568374b008594683987945294284b014b038594681789431817fd1b0111aee83f3912fa8882e4babfa221a338a7a3df3f94749462756268654b148c0d5f64697363726574655f69647894683568374b008594683987945294284b014b00859468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b00749462894300947494628c135f64697363726574655f73706163655f6c6f7794683568374b008594683987945294284b014b008594683f89689d7494628c145f64697363726574655f73706163655f73697a6594683568374b008594683987945294284b014b008594689b89689d7494628c145f64697363726574655f73706163655f7374657094683568374b008594683987945294284b014b008594683f89689d7494628c0f5f636f6e74696e756f75735f69647894683568374b008594683987945294284b014b028594689b89431000000000000000000100000000000000947494628c115f636f6e74696e756f75735f737061636594683568374b008594683987945294284b014b024b028694683f8943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c075f6e5f7a64696d944b0075622e" } ] }, @@ -150,17 +150,17 @@ { "trial": 10, "chunks": 2, - "hex": "8004952c060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b098c035f6d75944b048c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308717d02f691b9064094869452948c035f636394680b681143080a992c02a29ee33f94869452948c035f633194680b68114308268b4f34fca4c23f94869452948c045f636d7594680b68114308c123988a8e34c03f94869452948c085f635f7369676d6194680b6811430898c5322c507bdf3f94869452948c085f645f7369676d6194680b6811430866b10c0bd4def73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b09859468118943487cd204da6899df3f10dea0917dfdd13fa0cb3a960e0fc43f8ca6f3244986b13f0000000000000000cc4406102dd5cfbf70322a649a5fddbf196b3ecbe783e4bf0c12c6cb08a8e9bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0285946811894310c6235afef84fab3f8439ec84e80de13f947494628c035f706394682f68314b008594683387945294284b014b02859468118943101d81bee3c63dad3f886328893f42e23f947494628c055f6d65616e94682f68314b008594683387945294284b014b02859468118943108402560bed05e43f56210e3f1806e53f947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318dc4ca03403fbe63f5b8ebfe90735ab3f3a3f53268af5e93f947494628c065f7369676d6194680b68114308519ce1fd408be23f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468118943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694681189431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468118943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894473d68a10a1b4047b18c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b118c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b22859468118942100100007000740075006e006100530068006100ed00580ea184124066c56a674ba846405c006f007200610063006c0065005c00670065006e005f0063006d0061005f007000690063006b006c0065005f006f007200610063006c0065002e0070007900000064206e6f7420f8045778652300800a20202020746f20746865207265616c2076616c75652e20546f20757365207072756e6572732073756368206173203a636c6173733a607e6f7074756e612e7072756e6572732e5375636365737369766548616c76696e675072756e6572600a20202020696e207468652073616d652073657474696e672c20796f75206d7573742070726f7669646520652e672e2c2074686520686973746f726963616c20619474946275622e" + "hex": "8004952c060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b098c035f6d75944b048c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308717d02f691b9064094869452948c035f636394680b681143080a992c02a29ee33f94869452948c035f633194680b68114308268b4f34fca4c23f94869452948c045f636d7594680b68114308c123988a8e34c03f94869452948c085f635f7369676d6194680b6811430898c5322c507bdf3f94869452948c085f645f7369676d6194680b6811430866b10c0bd4def73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b09859468118943487cd204da6899df3f10dea0917dfdd13fa0cb3a960e0fc43f8ca6f3244986b13f0000000000000000cc4406102dd5cfbf70322a649a5fddbf196b3ecbe783e4bf0c12c6cb08a8e9bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0285946811894310c6235afef84fab3f8439ec84e80de13f947494628c035f706394682f68314b008594683387945294284b014b02859468118943101d81bee3c63dad3f886328893f42e23f947494628c055f6d65616e94682f68314b008594683387945294284b014b02859468118943108402560bed05e43f56210e3f1806e53f947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318dc4ca03403fbe63f5b8ebfe90735ab3f3a3f53268af5e93f947494628c065f7369676d6194680b68114308519ce1fd408be23f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468118943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694681189431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468118943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894473d68a10a1b4047b18c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b118c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b22859468118942100100005c003f003f005c0043003a005c005500ed00580ea184124066c56a674ba846405c0041007000700044006100740061005c004c006f00630061006c005c00540065006d0070005c0063006c0061007500640065005c0062003300390034006500660061006400350064006200620065006600380034005c00360037006100370037003600340036002d0064003800390066002d0034003700630031002d0039003200660032002d003400320066003200650035003100320065006100620064005c0073006300720061007400630068007000610064005c00760065006e0076003200350034005c004c00690062005c0073006900740065002d007000610063006b0061006700650073000000000000009474946275622e" }, { "trial": 19, "chunks": 2, - "hex": "8004954e060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b098c035f6d75944b048c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308717d02f691b9064094869452948c035f636394680b681143080a992c02a29ee33f94869452948c035f633194680b68114308268b4f34fca4c23f94869452948c045f636d7594680b68114308c123988a8e34c03f94869452948c085f635f7369676d6194680b6811430898c5322c507bdf3f94869452948c085f645f7369676d6194680b6811430866b10c0bd4def73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b098594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494628943487cd204da6899df3f10dea0917dfdd13fa0cb3a960e0fc43f8ca6f3244986b13f0000000000000000cc4406102dd5cfbf70322a649a5fddbf196b3ecbe783e4bf0c12c6cb08a8e9bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0285946811894310de0cba54d18ed5bfcca9f43f7441b2bf947494628c035f706394682f68314b008594683387945294284b014b02859468118943107f6910480b6bd4bff4a2ba7480ecbebf947494628c055f6d65616e94682f68314b008594683387945294284b014b02859468398943103e2a270bdee7df3fa0db12add2f2e03f947494628c065f7369676d6194680b681143082ec56e179532dd3f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468398943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694683989431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468398943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894473d68a10a1b4047b18c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b118c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b22859468398942100100007000740075006e006100530068006100ed00580ea184124066c56a674ba846406cc2ac8fb86eff3f42035fca44244640670065006e005f0063006d0061005f007000690063006b006c0065005f006f007200610063006c0065002e0070007900000064206e6f7420f8045778652300800a20202020746f20746865207265616c2076616c75652e20546f20757365207072756e6572732073756368206173203a636c6173733a607e6f7074756e612e7072756e6572732e5375636365737369766548616c76696e675072756e6572600a20202020696e207468652073616d652073657474696e672c20796f75206d7573742070726f7669646520652e672e2c2074686520686973746f726963616c2061947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318185cd8b024ebd93f656e0b354ce3a13fee8477d75554e83f9474946275622e" + "hex": "8004954e060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b098c035f6d75944b048c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308717d02f691b9064094869452948c035f636394680b681143080a992c02a29ee33f94869452948c035f633194680b68114308268b4f34fca4c23f94869452948c045f636d7594680b68114308c123988a8e34c03f94869452948c085f635f7369676d6194680b6811430898c5322c507bdf3f94869452948c085f645f7369676d6194680b6811430866b10c0bd4def73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b098594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494628943487cd204da6899df3f10dea0917dfdd13fa0cb3a960e0fc43f8ca6f3244986b13f0000000000000000cc4406102dd5cfbf70322a649a5fddbf196b3ecbe783e4bf0c12c6cb08a8e9bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0285946811894310de0cba54d18ed5bfcca9f43f7441b2bf947494628c035f706394682f68314b008594683387945294284b014b02859468118943107f6910480b6bd4bff4a2ba7480ecbebf947494628c055f6d65616e94682f68314b008594683387945294284b014b02859468398943103e2a270bdee7df3fa0db12add2f2e03f947494628c065f7369676d6194680b681143082ec56e179532dd3f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468398943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694683989431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468398943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894473d68a10a1b4047b18c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b118c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b22859468398942100100005c003f003f005c0043003a005c005500ed00580ea184124066c56a674ba846406cc2ac8fb86eff3f42035fca442446405c004c006f00630061006c005c00540065006d0070005c0063006c0061007500640065005c0062003300390034006500660061006400350064006200620065006600380034005c00360037006100370037003600340036002d0064003800390066002d0034003700630031002d0039003200660032002d003400320066003200650035003100320065006100620064005c0073006300720061007400630068007000610064005c00760065006e0076003200350034005c004c00690062005c0073006900740065002d007000610063006b006100670065007300000000000000947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318185cd8b024ebd93f656e0b354ce3a13fee8477d75554e83f9474946275622e" }, { "trial": 28, "chunks": 2, - "hex": "8004954e060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b098c035f6d75944b048c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308717d02f691b9064094869452948c035f636394680b681143080a992c02a29ee33f94869452948c035f633194680b68114308268b4f34fca4c23f94869452948c045f636d7594680b68114308c123988a8e34c03f94869452948c085f635f7369676d6194680b6811430898c5322c507bdf3f94869452948c085f645f7369676d6194680b6811430866b10c0bd4def73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b098594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494628943487cd204da6899df3f10dea0917dfdd13fa0cb3a960e0fc43f8ca6f3244986b13f0000000000000000cc4406102dd5cfbf70322a649a5fddbf196b3ecbe783e4bf0c12c6cb08a8e9bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b02859468118943107245c2cc7a04bebf36a928248257dfbf947494628c035f706394682f68314b008594683387945294284b014b0285946811894310ebace135a615b9bf3ba5736556fdddbf947494628c055f6d65616e94682f68314b008594683387945294284b014b02859468398943105b9eb3b31d31e03f009b7214caf8d93f947494628c065f7369676d6194680b68114308b01abb59f4f7d73f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468398943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b038c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694683989431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468398943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894473d68a10a1b4047b18c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b118c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b22859468398942100100007000740075006e006100530068006100ed00580ea184124066c56a674ba846406cc2ac8fb86eff3f42035fca44244640582a238397cbf43f2b5548152bd245407000690063006b006c0065005f006f007200610063006c0065002e0070007900000064206e6f7420f8045778652300800a20202020746f20746865207265616c2076616c75652e20546f20757365207072756e6572732073756368206173203a636c6173733a607e6f7074756e612e7072756e6572732e5375636365737369766548616c76696e675072756e6572600a20202020696e207468652073616d652073657474696e672c20796f75206d7573742070726f7669646520652e672e2c2074686520686973746f726963616c2061947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318b6cf13ab0b5ed73f4c8db37f3a75b03fc646b664fbb1de3f9474946275622e" + "hex": "8004954e060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b098c035f6d75944b048c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308717d02f691b9064094869452948c035f636394680b681143080a992c02a29ee33f94869452948c035f633194680b68114308268b4f34fca4c23f94869452948c045f636d7594680b68114308c123988a8e34c03f94869452948c085f635f7369676d6194680b6811430898c5322c507bdf3f94869452948c085f645f7369676d6194680b6811430866b10c0bd4def73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b098594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494628943487cd204da6899df3f10dea0917dfdd13fa0cb3a960e0fc43f8ca6f3244986b13f0000000000000000cc4406102dd5cfbf70322a649a5fddbf196b3ecbe783e4bf0c12c6cb08a8e9bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b02859468118943107245c2cc7a04bebf36a928248257dfbf947494628c035f706394682f68314b008594683387945294284b014b0285946811894310ebace135a615b9bf3ba5736556fdddbf947494628c055f6d65616e94682f68314b008594683387945294284b014b02859468398943105b9eb3b31d31e03f009b7214caf8d93f947494628c065f7369676d6194680b68114308b01abb59f4f7d73f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468398943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b038c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694683989431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468398943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894473d68a10a1b4047b18c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b118c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b22859468398942100100005c003f003f005c0043003a005c005500ed00580ea184124066c56a674ba846406cc2ac8fb86eff3f42035fca44244640582a238397cbf43f2b5548152bd2454065006d0070005c0063006c0061007500640065005c0062003300390034006500660061006400350064006200620065006600380034005c00360037006100370037003600340036002d0064003800390066002d0034003700630031002d0039003200660032002d003400320066003200650035003100320065006100620064005c0073006300720061007400630068007000610064005c00760065006e0076003200350034005c004c00690062005c0073006900740065002d007000610063006b006100670065007300000000000000947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318b6cf13ab0b5ed73f4c8db37f3a75b03fc646b664fbb1de3f9474946275622e" } ] }, @@ -170,17 +170,17 @@ { "trial": 7, "chunks": 2, - "hex": "80049544060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394680b68114308cf08f6cc59fce33f94869452948c035f633194680b68114308f572bcb3fdd0c33f94869452948c045f636d7594680b68114308031b52bcb49fad3f94869452948c085f635f7369676d6194680b681143089886065d9f8edc3f94869452948c085f645f7369676d6194680b68114308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b06859468118943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0285946811894310fcc9ba8551d0e9bf46daf1a2e4dce0bf947494628c035f706394682f68314b008594683387945294284b014b02859468118943106c4be37eddbbecbf2d8723a43ac5e2bf947494628c055f6d65616e94682f68314b008594683387945294284b014b028594681189431040bb59c0a876e33f2932fbc3577ce13f947494628c055f635f316494682f68314b008594683387945294284b014b038594681189431840249ed1b458f03f701fc1c752efaf3f66edf12e1a77eb3f947494628c065f7369676d6194680b68114308d9f8348649d5b73f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468118943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694681189431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468118943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894473d3c25c2684976838c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b288594681189424001000000000000000000000000000000000000a115778f68bbf13fb427fb65ec472840041a711d25dabf3f0b2cc86201062a40c8778e014e0db53fe40448134a5f10406c4b05617efbb23f9899e7065494fe3f488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009474946275622e" + "hex": "80049544060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394680b68114308cf08f6cc59fce33f94869452948c035f633194680b68114308f572bcb3fdd0c33f94869452948c045f636d7594680b68114308031b52bcb49fad3f94869452948c085f635f7369676d6194680b681143089886065d9f8edc3f94869452948c085f645f7369676d6194680b68114308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b06859468118943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0285946811894310fcc9ba8551d0e9bf46daf1a2e4dce0bf947494628c035f706394682f68314b008594683387945294284b014b02859468118943106c4be37eddbbecbf2d8723a43ac5e2bf947494628c055f6d65616e94682f68314b008594683387945294284b014b028594681189431040bb59c0a876e33f2932fbc3577ce13f947494628c055f635f316494682f68314b008594683387945294284b014b038594681189431840249ed1b458f03f701fc1c752efaf3f66edf12e1a77eb3f947494628c065f7369676d6194680b68114308d9f8348649d5b73f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468118943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694681189431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468118943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894473d3c25c2684976838c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2885946811894240010000756d656e74732e0a2020202065787065a115778f68bbf13fb427fb65ec472840041a711d25dabf3f0b2cc86201062a40c8778e014e0db53fe40448134a5f10406c4b05617efbb23f9899e7065494fe3f488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e209474946275622e" }, { "trial": 13, "chunks": 2, - "hex": "80049566060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394680b68114308cf08f6cc59fce33f94869452948c035f633194680b68114308f572bcb3fdd0c33f94869452948c045f636d7594680b68114308031b52bcb49fad3f94869452948c085f635f7369676d6194680b681143089886065d9f8edc3f94869452948c085f645f7369676d6194680b68114308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b068594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494628943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0285946811894310a59be658356be4bf5be7d5d1edaafabf947494628c035f706394682f68314b008594683387945294284b014b02859468118943109854239f6440e3bf1e34a4142a4efabf947494628c055f6d65616e94682f68314b008594683387945294284b014b0285946839894310dc9f0897dbdde23fd4f28ce8798bdc3f947494628c065f7369676d6194680b68114308c87816c4a327bb3f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468398943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694683989431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468398943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894473d3c25c2684976838c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b288594683989424001000000000000000000000000000000000000a115778f68bbf13fb427fb65ec47284095cfe12c28deab3f5134da8466f11c40c8778e014e0db53fe40448134a5f10406c4b05617efbb23f9899e7065494fe3f488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318a3c0dcbe3bf3ed3f9820239dc7e2d33f6a7639d212e8f13f9474946275622e" + "hex": "80049566060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394680b68114308cf08f6cc59fce33f94869452948c035f633194680b68114308f572bcb3fdd0c33f94869452948c045f636d7594680b68114308031b52bcb49fad3f94869452948c085f635f7369676d6194680b681143089886065d9f8edc3f94869452948c085f645f7369676d6194680b68114308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b068594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494628943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0285946811894310a59be658356be4bf5be7d5d1edaafabf947494628c035f706394682f68314b008594683387945294284b014b02859468118943109854239f6440e3bf1e34a4142a4efabf947494628c055f6d65616e94682f68314b008594683387945294284b014b0285946839894310dc9f0897dbdde23fd4f28ce8798bdc3f947494628c065f7369676d6194680b68114308c87816c4a327bb3f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468398943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694683989431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468398943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894473d3c25c2684976838c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2885946839894240010000756d656e74732e0a2020202065787065a115778f68bbf13fb427fb65ec47284095cfe12c28deab3f5134da8466f11c40c8778e014e0db53fe40448134a5f10406c4b05617efbb23f9899e7065494fe3f488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e20947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318a3c0dcbe3bf3ed3f9820239dc7e2d33f6a7639d212e8f13f9474946275622e" }, { "trial": 19, "chunks": 2, - "hex": "80049566060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394680b68114308cf08f6cc59fce33f94869452948c035f633194680b68114308f572bcb3fdd0c33f94869452948c045f636d7594680b68114308031b52bcb49fad3f94869452948c085f635f7369676d6194680b681143089886065d9f8edc3f94869452948c085f645f7369676d6194680b68114308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b068594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494628943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b028594681189431028bf20977d1fe4bf97c4fc060acceebf947494628c035f706394682f68314b008594683387945294284b014b02859468118943105b503d58c7d0e0bf47bbd06463bee6bf947494628c055f6d65616e94682f68314b008594683387945294284b014b02859468398943103aa4ee10a318e23fa76418d66910dc3f947494628c065f7369676d6194680b68114308581527d2ff76ba3f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468398943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b038c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694683989431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468398943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894473d3c25c2684976838c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b288594683989424001000000000000000000000000000000000000a115778f68bbf13fb427fb65ec47284095cfe12c28deab3f5134da8466f11c40a03d2ead94a3b73f8c2dd0dd54350e406c4b05617efbb23f9899e7065494fe3f488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318cb946a6c5365e73f1f4d79df4a30d33f7dfdbedae1c0f03f9474946275622e" + "hex": "80049566060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394680b68114308cf08f6cc59fce33f94869452948c035f633194680b68114308f572bcb3fdd0c33f94869452948c045f636d7594680b68114308031b52bcb49fad3f94869452948c085f635f7369676d6194680b681143089886065d9f8edc3f94869452948c085f645f7369676d6194680b68114308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b068594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494628943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b028594681189431028bf20977d1fe4bf97c4fc060acceebf947494628c035f706394682f68314b008594683387945294284b014b02859468118943105b503d58c7d0e0bf47bbd06463bee6bf947494628c055f6d65616e94682f68314b008594683387945294284b014b02859468398943103aa4ee10a318e23fa76418d66910dc3f947494628c065f7369676d6194680b68114308581527d2ff76ba3f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468398943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b038c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694683989431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468398943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894473d3c25c2684976838c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2885946839894240010000756d656e74732e0a2020202065787065a115778f68bbf13fb427fb65ec47284095cfe12c28deab3f5134da8466f11c40a03d2ead94a3b73f8c2dd0dd54350e406c4b05617efbb23f9899e7065494fe3f488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e20947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318cb946a6c5365e73f1f4d79df4a30d33f7dfdbedae1c0f03f9474946275622e" } ] }, @@ -190,17 +190,17 @@ { "trial": 7, "chunks": 2, - "hex": "8004954e060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394680b68114308cf08f6cc59fce33f94869452948c035f633194680b68114308f572bcb3fdd0c33f94869452948c045f636d7594680b68114308031b52bcb49fad3f94869452948c085f635f7369676d6194680b681143089886065d9f8edc3f94869452948c085f645f7369676d6194680b68114308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b06859468118943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0285946811894310cb65c9712c1cef3f7b89e38646aaa03f947494628c035f706394682f68314b008594683387945294284b014b0285946811894310194d6b7c8c50f13f92e3e4aee28ca23f947494628c055f6d65616e94682f68314b008594683387945294284b014b0285946811894310fc38be3e3f5fe43f3d9729fe7825e03f947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318bcf919567569ef3f6e83ef005771babf3c2b6285deeeea3f947494628c065f7369676d6194680b68114308f1d19b9de8e7c33f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468118943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694681189431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468118943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2885946811894240010000000000000000000000000000000000009ff85b01cc50e53f000000000000f07f95cfe12c28deab3f5134da8466f11c40a03d2ead94a3b73f8c2dd0dd54350e4037abab71d222d83fb635a96780390e40488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009474946275622e" + "hex": "8004954e060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394680b68114308cf08f6cc59fce33f94869452948c035f633194680b68114308f572bcb3fdd0c33f94869452948c045f636d7594680b68114308031b52bcb49fad3f94869452948c085f635f7369676d6194680b681143089886065d9f8edc3f94869452948c085f645f7369676d6194680b68114308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b06859468118943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b0285946811894310cb65c9712c1cef3f7b89e38646aaa03f947494628c035f706394682f68314b008594683387945294284b014b0285946811894310194d6b7c8c50f13f92e3e4aee28ca23f947494628c055f6d65616e94682f68314b008594683387945294284b014b0285946811894310fc38be3e3f5fe43f3d9729fe7825e03f947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318bcf919567569ef3f6e83ef005771babf3c2b6285deeeea3f947494628c065f7369676d6194680b68114308f1d19b9de8e7c33f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468118943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694681189431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468118943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2885946811894240010000756d656e74732e0a20202020657870659ff85b01cc50e53f000000000000f07f95cfe12c28deab3f5134da8466f11c40a03d2ead94a3b73f8c2dd0dd54350e4037abab71d222d83fb635a96780390e40488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e209474946275622e" }, { "trial": 13, "chunks": 2, - "hex": "80049570060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394680b68114308cf08f6cc59fce33f94869452948c035f633194680b68114308f572bcb3fdd0c33f94869452948c045f636d7594680b68114308031b52bcb49fad3f94869452948c085f635f7369676d6194680b681143089886065d9f8edc3f94869452948c085f645f7369676d6194680b68114308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b068594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494628943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b02859468118943105c7ae8c2d125cebf9cdea498616280bf947494628c035f706394682f68314b008594683387945294284b014b0285946811894310ef78c9e6a170dcbf32f40ea68e4ba13f947494628c055f6d65616e94682f68314b008594683387945294284b014b02859468398943107fc754864c2ae13f0945afc8f138e03f947494628c065f7369676d6194680b681143082314f172eafcbe3f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468398943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694683989431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468398943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2885946839894240010000000000000000000000000000000000009ff85b01cc50e53f000000000000f07f167e8c365d19fb3f000000000000f07fa03d2ead94a3b73f8c2dd0dd54350e4037abab71d222d83fb635a96780390e40488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318d4e44277d31aee3fc3efb7bb3efac0bf5f1a36832f81e33f9474946275622e" + "hex": "80049570060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394680b68114308cf08f6cc59fce33f94869452948c035f633194680b68114308f572bcb3fdd0c33f94869452948c045f636d7594680b68114308031b52bcb49fad3f94869452948c085f635f7369676d6194680b681143089886065d9f8edc3f94869452948c085f645f7369676d6194680b68114308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b068594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494628943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b02859468118943105c7ae8c2d125cebf9cdea498616280bf947494628c035f706394682f68314b008594683387945294284b014b0285946811894310ef78c9e6a170dcbf32f40ea68e4ba13f947494628c055f6d65616e94682f68314b008594683387945294284b014b02859468398943107fc754864c2ae13f0945afc8f138e03f947494628c065f7369676d6194680b681143082314f172eafcbe3f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468398943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694683989431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468398943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2885946839894240010000756d656e74732e0a20202020657870659ff85b01cc50e53f000000000000f07f167e8c365d19fb3f000000000000f07fa03d2ead94a3b73f8c2dd0dd54350e4037abab71d222d83fb635a96780390e40488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e20947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318d4e44277d31aee3fc3efb7bb3efac0bf5f1a36832f81e33f9474946275622e" }, { "trial": 19, "chunks": 2, - "hex": "80049570060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394680b68114308cf08f6cc59fce33f94869452948c035f633194680b68114308f572bcb3fdd0c33f94869452948c045f636d7594680b68114308031b52bcb49fad3f94869452948c085f635f7369676d6194680b681143089886065d9f8edc3f94869452948c085f645f7369676d6194680b68114308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b068594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494628943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b028594681189431019245a2f3065c13f1690417b8e9fd0bf947494628c035f706394682f68314b008594683387945294284b014b0285946811894310cf196083bd1ac23fec90ae5ef786cdbf947494628c055f6d65616e94682f68314b008594683387945294284b014b02859468398943105baf0649de11e23f8c5ef4784604df3f947494628c065f7369676d6194680b68114308583087169976b83f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468398943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b038c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694683989431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468398943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2885946839894240010000000000000000000000000000000000009ff85b01cc50e53f000000000000f07f167e8c365d19fb3f000000000000f07f96c0e688c5e2d43f000000000000f07f37abab71d222d83fb635a96780390e40488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318af2f34ec581eeb3f9b8d674f71e2c0bfd5b9409fdca1dc3f9474946275622e" + "hex": "80049570060000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394680b68114308cf08f6cc59fce33f94869452948c035f633194680b68114308f572bcb3fdd0c33f94869452948c045f636d7594680b68114308031b52bcb49fad3f94869452948c085f635f7369676d6194680b681143089886065d9f8edc3f94869452948c085f645f7369676d6194680b68114308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b068594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494628943303d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b028594681189431019245a2f3065c13f1690417b8e9fd0bf947494628c035f706394682f68314b008594683387945294284b014b0285946811894310cf196083bd1ac23fec90ae5ef786cdbf947494628c055f6d65616e94682f68314b008594683387945294284b014b02859468398943105baf0649de11e23f8c5ef4784604df3f947494628c065f7369676d6194680b68114308583087169976b83f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b024b02869468398943200000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b038c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b024b018694683989431000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014b044b01869468398943200000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b2885946839894240010000756d656e74732e0a20202020657870659ff85b01cc50e53f000000000000f07f167e8c365d19fb3f000000000000f07f96c0e688c5e2d43f000000000000f07f37abab71d222d83fb635a96780390e40488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e20947494628c055f635f316494682f68314b008594683387945294284b014b0385946811894318af2f34ec581eeb3f9b8d674f71e2c0bfd5b9409fdca1dc3f9474946275622e" } ] }, @@ -210,12 +210,12 @@ { "trial": 15, "chunks": 15, - "hex": "800495ba390000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b1e8c085f706f7073697a65944b0e8c035f6d75944b078c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308a34b1bbc0626114094869452948c035f636394680b681143086a92e28100efbe3f94869452948c035f633194680b681143082434ad659aa6603f94869452948c045f636d7594680b6811430845615b913d14743f94869452948c085f635f7369676d6194680b681143082b69721be07bc43f94869452948c085f645f7369676d6194680b68114308254d6e037c8ff23f94869452948c035f636d944b018c065f6368695f6e94474015ba3c9bd48c6b8c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b0e859468118943706e9a37f80c1dd73fc66a35c10c53ce3f37efc329a305c53f6341f723ffd7bc3f1ef7e22ed39ab23f8b9428ea577aa43fcffb020a7053893f5a71963c4b3fa2bf95808b0b36c6b9bf69da5d339a55c4bf98c4ab0c3d12cbbf56cd919c5a9cd0bf5268fa288a70d3bf8c3990ec070fd6bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b1e859468118943f081900e84011ed03f2608c5496d32c6bf978db1bc8f42d63fa4a9add1464ac8bff5c2abc129e1d83f5ef9c2873b80d0bfd6e52261bc25de3fb54a46fa073d903f57d842e14e4fcbbfe88c24e246d5da3f1d9d0b17057adabfefa503f0b92bb13f90c0bc492d77c5bf509aee7ecc17efbf930e4224ac70c2bfd729000ccd78e33fe3d44dc25641d73f91858390c8cae6bffee6aa663547d5bf5cffc6218f91e1bfe26b67fc2ca69a3fdd667c0ccc26f63f0bd8039a4a029fbfc42afce5c35fdd3f12b731b05df6c63f4a01d080178fe23faa4903a2b9fbe03faec0f8face9ad03fbb05f3a08c4e7ebf8cbb0a81fe6ce53f947494628c035f706394682f68314b008594683387945294284b014b1e859468118943f0079e2eef8b4ecc3f8aacfa690d7ec3bfbd5fc496388cd33fe9f860919c54c5bf8b3af7021dd9d53f9bd7562310fbccbf514302925e79da3f7cb4915c09858c3f1876d10274fbc7bf9ad48b724a90d73f8195242b2740d7bffe5d21634228ae3f3872472b9ed9c2bffa4bb730f04debbf672a1a967b31c0bfbe3621b86d19e13f9eeb5985f46bd43f75d97257d803e4bfd5b8ee857eafd2bf115039fb1bdbdebfab312bbeed66973f1f9b97efd673f33f0b0d37290d3b9bbfb991d13e85cbd93f13b0f4061e2ac43f57411019324ce03f4861b54ff4d3dd3f1391771bbd29cd3fd11110c1359d7abfe92f2102add0e23f947494628c055f6d65616e94682f68314b008594683387945294284b014b1e859468118943f0d6f5e0ae0632e13fa6e0ecb7885ade3fb5931ea3a9a6e13f74b5b640ca32de3f481da0b566d8e13fd32e9178608ddd3f2ee037c86c3ce23f38706a3c4513e03faa2b454a74f9dd3fe52d31a37efde13ff4375e378c12dc3fd4568e008251e03fa89a6b226c68de3f6d4bef277cc6d63f54e9c910dea1de3f6da22c2b72e3e23f17158d3b8fb9e13fa5a15a5fef3cd93f2e966adef5d7dc3f06ab1bc0a9c9da3fb006d704a01fe03f34f18bd66992e63ffb042bed66b6df3f6c6bcbcebd2de23f03aa38d7ffd9e03f77eb060cc7c0e23ff4a6352bf184e23fe0db7660483be13f093d2a6204eedf3f26a85a0aa52de33f947494628c055f635f316494682f68314b008594683387945294284b014dd101859468118942880e0000573b54e39fdfef3fc128697a5dfe66bf4d31efb2b3778a3ff94aeafcc24279bf927c35831324613f9d3e4012cd81763f251bf4ae5a13753f62f0bdce482406bff7c377ccac5665bf2a40b7442a21493fecf12a08cf1f4fbfb46d49daca8f84bff7f32713aee14e3f55db765d77667cbf5f838db6a949773f607242ad97246f3f586da8a18f4b703f861115679c1d6ebf50e63a581eb25b3f38077e1380a5303f6058f52afb80713f88d3e713831254bf6a2d26ccb5206dbf4eb165886cfd783fd0854d9dde72703f15aafffaca787dbf9f939a5b5ab54e3fde31e30cc847463fcd7b36bfb94d7bbf1d8ceebc042c51bf030967ef02c8ef3f61e9ff6b725d6c3f658ca8475b4968bfa6a933b1944b6ebfca7096129d9075bf03c6f966b536623fda4fad05705d2ebf0e7c1064226c65bf6584fc7e06cf5b3fbe6b439f15a0323ff204bff9a8d0413f8ae14801008c5cbf38609c148ccd493fe057be3048c24c3fa83316d361a973bf0fb95db0ab7b5d3fb799566c159f613f6e91c8cf5c45583f475bdd25b92562bf8799d58f79d472bf60c64c2b7283593f0d8b1847caa5673f2a7d52f2f0896dbfd2037e9263405bbf46679bd25d6643bf56af9fedf3fd723fbb0cf69c722137bf8e69b4ffdc38753f67441fbcb91f7ebf1cc9328264c5ef3f870daff5f44b733ffb8b70b5cb746dbfd4b55986804458bf31753c462f2d7dbfbbac4b77676277bf04cf80296b0b3ebf4d00781e941d62bfbb019d87ed47403f6755eba6afbf673f0a54cb9bccac543fc5674a8a36a8703fd66e7cb853f16ebff8e3011cc68f74bfe8e544516c597ebf376df960cb873d3f68f8dcd158c01dbfda55f5d5491a683facbb94d2eb90113f99eff75c2423683fb771e07351b34a3f814469affeef773f6a6109e2ad2a3a3fce88b65aa96c763f08b70fe8f5915fbfd8eae066faff6abfbd072daa76ac643f2a959a1f3a91863f55a0f485b0bcef3feed685e8946952bf5e05e4b00fe262bfc9f65e3290c75b3fd5f080ab91c9623f37254b9724df713f4ec9f280a99f4a3f2fd3190d1d805fbfd85212398455603f8865be4d26475bbf0d2593b5de8b33bfb8f247110f6f743fef3618463803793f70a49520fbb3593fc8d49b5e70b7553f0f6a9e01195d613ffa56efc9857e683f79793d19e45c61bfa136b09f24e47f3ff7b47692f5ed673f94a676bed75d75bffe0d49a225ee643ff6b0a5434d9b52bfa9a3ad4f4887713f1ddd606f45e9753f55a293d6e5bb49bfe86407e3306084bff72d704d62e8ef3fa5d042a12ee471bf7f9b9b1cf4f65f3f10eb94e95bfc643f7eee225598c93d3f1d143da96c95673f183ea7c4248c39bff01b5a562aad7b3f7ccb8c4173465ebfc84bf382e11e573f35e2b2fc759765bfed2a495c69e6323f0ed9b3b80203513fd13b7ddb817856bf462aa60ec41c543f1ad2f9f7019e51bf65b0d3b7bf9072bf0c90fe55b4b4803f26850026c2b36f3fd0f6da759b1678bfcffcbd4cd46b4abf4abd8e14e529783f93903fa8c0c7693fba7f55a0a250673f6040d203d5f6793f9e194afe0a8d76bf07a5e72ab900f03fc0cab7dadb3f0f3fde4558db0a975dbf92fc33f1532155bf4287df4dfd2d5abf6d01aa086d1e5a3f52bcc19d170a683f10923c68469160bfe5d2c58cb547763fd895f1d0eaaa4e3f8f994559ff3965bf0a08243fb88f653f49a89527dec0663f709fcd9779f6513f0d0442e6d08a753f4f611a7d68e665bf76a2c75bb03e6f3f275a036600ae6c3f56e31b9e60ca41bf86c5d50a256f633f2be596c837684abf5e5ed72e38f15bbfc8f379cf2eec57bf8c36830d2461763f7fce380b4bd977bf5714712e92f3ef3f0d946a923e536dbf85549ab7b3fe593f0d9e0fad38734d3fe31391ec067d3dbf9d0756f3b4cd733f898066c5223a54bf10ef6e7c56ff473f1f09e4f756a064bf9699272789a140bf8d725c64764b68bfd58afb299786473f135db9360e5e72bf3d2c2fa3987749bfc6c39059680f603f980db009db816e3f6a0ae9a9d56e50bf8e3da296d10e2c3fecea8f222a9b513ffab3e01e54217d3fee851bd7dd244cbf991f33ea751f51bf0af4c53cbc38543ffa97d6fa3d0a7c3faee5c98aafe3ef3f4281008f9b08503f356ac1552f17603f5c9d700b301844bf1aa32de3203f783f76e0e9aab2ac55bf246841a1055e663f7857586649bd66bf12f43099f72f69bf237251f2359d6bbfb780b903a77d6f3fd771b60fd43567bfee0d706ed0b42cbfc1e036f0f90d3abff70895307203593f3c5417ab9faa54bff136c8f334f361bf9823d1bc1fa544bf7db43eba1ec7703f971cb6840062643fb51b0fc50b2d58bfaae02e0ed2434e3f1061033e40e75a3f48e9306a39d8ef3f88b4734be3b9503f6dc3c01e0e14503fa0876bfbd99a39bf7df48049788a21bf2435eaf6dad11bbf5261f60ee82667bf2ced4c3ccb577cbf1689c6e06b78633f69eb4e8b0edd463fc389be7b796151bfe498a62ffe9774bfdcbbd7b5235b5fbf6a97917af30d80bf51b01233f6a753bfd4543a43fa0458bff8780dfc9fff72bf75868924a6a262bfd32d59c386df3c3f39728e9dac0b6cbfe7440f2332986a3fc3d87c1e432f5fbf156aac1a55e6ef3fddf38349cfa647bfc2a032b03c9f623f3c90fd2fa8b363bf52f962ea9f0f63bff7e550e2a3123a3f0e5d36684800743fc506cdeb03eb773f361e6a29a45532bf2b86a4a15a7070bf78fd6fcbd82e4abf7c76d4b464c649bfc3cf1fa38a33733ff96bae140225653f3f6c1bb0a56b613f2271fefcd43024bf5c71887e541427bfccca8b4db14b64bf65fcb19e7a032c3f4e86b3a4fb4d563f5f5c16842eef643f411762cc98e8ef3feb8195c4025e533f1513dbd336d7593fc019daddf1015d3fd3efc701f388613fe5924a43c11a56bf063bf084fb5c4abfe6f036461034533fcd6cd6397a644d3f2f9856d13446713f00bfb3685042583fa9fb3153217362bf215aa650ed636bbffd3cabd77c635abfa3d323827f453fbf6565b7a6216972bf6443414d2bfa57bf4400c35cd90555bf8e55ed44f74f6abfe049f68f59b875bfa76053eedce7ef3f5ee2e19ea8494cbf55badefef36374bff153af308f554abf88fd8c0c9c207e3f800e01cea2fb793ff1537f107a3265bfbfaaa5e6669c59bf4981dd907f4b75bfb62a4533569c313f312bdc28489f6abfcbbfe6a1365a40bfd1dcc591b60466bf9cc3f55a7e2234bfe92266093e0f54bf2902e41d8d964e3fab4acdad6c82693f3f37d7ff9f7260bf804c9ee4cf2754bfed6834b144f3ef3f62235bdd2c13533fddb8378f71e05e3fea4350378bb15fbff42d891a3e18523f377efada05d1663ffa0889d0183d13bf7a8b1f68eba0473f78f2f226beb352bfd88877a76717443fb82eb99fe0c4653ff9e1cf2a48a5623f280aba50643c353f8e853ac6cb1a5dbf58d5cbe67e7e36bf987cc24607e84fbfa1e22de59df65a3fbe2ec5b52ba73fbf337db157bb03f03fa80531ddb801693f55e79dabd4113ebf14814b08b1bb643f34b349bb44bb5f3fa51abb830c3e503f908cc9e23db94e3faaf7d3ded004623fe8778c264b0c88bfcb658f4e09ec61bf9a8b315d412f3dbfd62f99ea00834bbf57fcf3497d7b82bfa80018971e386ebf4bb1b217ef8532bf6a81f3c7404871bfef61c8cf161978bfc5493d199ae3ef3f2c037d41da4c79bfe4b7a634f75571bf1b6e6aed984623bf3d3aad6f57fb533f92c4925c8021443f5989e0f882da373fa2e60ca20d9d75bf3d6df9d391b557bfd78bb51d1a075b3f90cf59f3afe049bfe287ab251a6f5d3fea5eabaa720055bfecd17c27a80c6fbff53450e8088e613fe7da74633f6b753fb4e95b0182d8ef3f77c0a353868155bf4c84c969e15157bf742f18d1de126dbf2d02cfdad1d76abf3e662675b7db76bffe1f21f5135d6e3fc93f8ff6f333313f5f7626830a0967bf5851f2576f45363f4e18078606987c3f9be4c525d634823f4ec92709f34867bfdec46d8b87ba863fee7b9f429fb3733fa89b37fba9baef3f3a499b5545cf4abfb611c9d7e90041bfd8bb458955345f3fab7d29749d70683f1decd610f548653f6c200fb2de1e72bf1626bda192a66bbfa23754a624ea623f7a4a549cec36813f3ab1719c0e16693f6dfb9501ad5a4f3f44c68007c69e54bfe51b673af87d6d3fb1623259dbfaef3f3ba48d1888426a3f30b3e27b07fb00bfca406622e7b0513ffd8e9a0b8d2f83bfbf40041eacf85cbfe44e58ccbc766bbf8bd57fa8de5567bf7d579037432a70bfec12ed63f6686bbfe5a007c502ef493ff5f481b2d88c66bfbc0bdf0690af75bfdf12cb614af6ef3fb4ef162e0d3d633f3f1612a0f31e583f69448d47c9f874bf71760ef8326e56bf3f6a345b6ba9783f995c8fbeb16720bf2c91ac4b070e75bf10f955f1373661bf505ca8fcda1471bfa3baec2725e95bbf0ac838274466713fe7319af0ba0ef03f2aefd357236a413fadd73834d0ef83bf6f0c0bf3b1545bbfcf0ce312204d703f7a6f0339393c643f665cd0e77f987dbff89b1af6787f0e3ff337eb062ff76fbf92be1636f703553fd0f316f747644f3f6c9d11da09f5ef3fe79e10ed725b503fc986a7b188945f3fec24c8fd50d3493f339bac1d9a4d58bf640ea1b1bf9b57bf17c0d8d02c9562bf9e10989d356b62bf063e8ff7efd66a3f5a3d56b8ff2474bf8ad720fdc7f4ef3fe02b81fb267b72bfc8a9f4862d6e763f12c75660ecea313f36a0137a0dcd673f7b37846e8430783ffe15ee22e41939bf07ac473e2f014c3f7914132c936a8c3f29be027db5d3ef3f887c9fb8672a54bf5df316d02acd37bf0a07c6c0c8282b3f1236d22ac44f673fc57deee2d7ed1dbf1b862f65de9f6cbff642bb4534556b3f22388ed1cd0ff03f50f8aab9e873603faa9b49f1e15e51bfe35ea2ddffe2633fe6b64c61524e3b3f516141fbdd8461bf56cda9c8c14464bf778047dc9e09f03fbacb9e43878756bfb741225e745a503fbb016e7b218d64bfde4a06f8c6d6703fa29b007a79c5653f4c6ad3a5b6f3ef3fa2a70c4672725f3fe6a57cc675f55e3fe4d4389ce3e14a3f0e0fc3060c323bbf16bf63aa9301f03f5a0935a57968513f09df36aee6a25b3f3000f061b50b813f327681932aecef3f1a6f1d48b6056d3fc90a76ec91b06e3f4920538d97ceef3f013c1804f3316e3f9617b84395bdef3f947494628c065f7369676d6194680b68114308d686a15e3fdbc33f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b1e4b02869468118942e00100000000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944d2c018c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b1e4b01869468118943f0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014d84034b01869468118942201c0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b4b8c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b96859468118942b0040000c0edd3939f010000401792929f010000a78deae325484f4057dbd7dd163f6240800ae2939f010000804ee3939f010000c04fe3939f01000080f9e5939f010000b0332fe29f0100000073e3939f010000208c68929f010000c0fee5939f010000c0f6e5939f010000f05483929f010000c03591929f01000040c2dc939f010000601249929f0100004050e3939f010000006ee3939f010000c030d5939f010000c07ae3939f0100004040e3939f010000007bde939f010000c071e3939f010000107ade939f0100004066e3939f010000c062e3939f0100009075de939f01000040cbe6ff9f010000405de9ff9f010000403846929f0100000072e3939f01000080e4e5939f01000000e1e5939f010000407be3939f0100000064e3939f010000c07ed9939f010000004ae3939f010000e07f98929f01000040d8e5939f01000000cee5939f010000203c46929f010000008ce6ff9f010000a0639d929f0100002044e4939f01000000d5e5939f01000040fde5939f01000040fee9ff9f010000c0eae5939f0100008063e3939f010000d059e4939f010000c00ae2939f010000407dde939f0100004006e2939f01000040cfe5939f0100004041e4939f01000040aecd939f010000402349929f010000003346929f01000080d9e5939f01000080ebe5939f010000c0c2e5939f01000040efe5939f01000000ffe5939f0100005049e4939f0100000075e3939f010000606ce4939f010000c0d8e5939f01000040dde5939f010000f060e4939f0100000031e5ff9f010000708273929f010000b041e4939f01000040d2e5939f01000080c8e5939f01000080a1c7939f010000c0c5e5939f01000000c5e5939f0100007041e4939f010000801c91929f010000107de4939f0100000079e3939f010000c0c6e5939f010000b079e4939f010000007cdf939f010000d04ee4939f010000f049e4939f01000000c1e5939f01000000ece5939f01000080cee5939f01000080fce5939f01000080e6e5939f010000e058e4939f010000c0e6e5939f010000d056e4939f01000080cfe5939f01000000dae5939f010000e064e6939f010000809c9f939f010000b068e4939f010000c06ae6939f01000000d0e5939f010000c0f5e5939f01000040f3e5939f01000000f1e5939f010000c0e1e5939f0100006075e6939f0100000089cd939f010000d0816e929f01000040dbe5939f010000c0f9e5939f0100009078e6939f010000807f4f929f010000706fe4939f010000807ade939f010000c0c4e5939f010000c0d0e5939f010000c0bee6ff9f01000000e2e5939f01000040c7e5939f0100005079e6939f010000406cdf939f010000f091a7939f010000c0dbe5939f01000080f6e5939f010000506de6939f010000c07adf939f010000904ce4939f0100003055e6939f0100000013e2939f01000000fae5939f010000c05ce3939f01000080f8e5939f010000c0dfe5939f0100000063e6939f0100004033e5ff9f010000a053e6939f010000c033e2939f0100000042c5939f010000f0cbe6939f0100000025e2939f010000c05ee6939f01000050e5e6939f0100008022e2939f01000040eae5939f010000c01ae2939f01000080e3e5939f01000040c2e5939f0100006976652066756e6374696f6e2e008ce29474946275622e" + "hex": "800495ba390000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b1e8c085f706f7073697a65944b0e8c035f6d75944b078c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308a34b1bbc0626114094869452948c035f636394680b681143086a92e28100efbe3f94869452948c035f633194680b681143082434ad659aa6603f94869452948c045f636d7594680b6811430845615b913d14743f94869452948c085f635f7369676d6194680b681143082b69721be07bc43f94869452948c085f645f7369676d6194680b68114308254d6e037c8ff23f94869452948c035f636d944b018c065f6368695f6e94474015ba3c9bd48c6b8c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b0e859468118943706e9a37f80c1dd73fc66a35c10c53ce3f37efc329a305c53f6341f723ffd7bc3f1ef7e22ed39ab23f8b9428ea577aa43fcffb020a7053893f5a71963c4b3fa2bf95808b0b36c6b9bf69da5d339a55c4bf98c4ab0c3d12cbbf56cd919c5a9cd0bf5268fa288a70d3bf8c3990ec070fd6bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b1e859468118943f081900e84011ed03f2608c5496d32c6bf978db1bc8f42d63fa4a9add1464ac8bff5c2abc129e1d83f5ef9c2873b80d0bfd6e52261bc25de3fb54a46fa073d903f57d842e14e4fcbbfe88c24e246d5da3f1d9d0b17057adabfefa503f0b92bb13f90c0bc492d77c5bf509aee7ecc17efbf930e4224ac70c2bfd729000ccd78e33fe3d44dc25641d73f91858390c8cae6bffee6aa663547d5bf5cffc6218f91e1bfe26b67fc2ca69a3fdd667c0ccc26f63f0bd8039a4a029fbfc42afce5c35fdd3f12b731b05df6c63f4a01d080178fe23faa4903a2b9fbe03faec0f8face9ad03fbb05f3a08c4e7ebf8cbb0a81fe6ce53f947494628c035f706394682f68314b008594683387945294284b014b1e859468118943f0079e2eef8b4ecc3f8aacfa690d7ec3bfbd5fc496388cd33fe9f860919c54c5bf8b3af7021dd9d53f9bd7562310fbccbf514302925e79da3f7cb4915c09858c3f1876d10274fbc7bf9ad48b724a90d73f8195242b2740d7bffe5d21634228ae3f3872472b9ed9c2bffa4bb730f04debbf672a1a967b31c0bfbe3621b86d19e13f9eeb5985f46bd43f75d97257d803e4bfd5b8ee857eafd2bf115039fb1bdbdebfab312bbeed66973f1f9b97efd673f33f0b0d37290d3b9bbfb991d13e85cbd93f13b0f4061e2ac43f57411019324ce03f4861b54ff4d3dd3f1391771bbd29cd3fd11110c1359d7abfe92f2102add0e23f947494628c055f6d65616e94682f68314b008594683387945294284b014b1e859468118943f0d6f5e0ae0632e13fa6e0ecb7885ade3fb5931ea3a9a6e13f74b5b640ca32de3f481da0b566d8e13fd32e9178608ddd3f2ee037c86c3ce23f38706a3c4513e03faa2b454a74f9dd3fe52d31a37efde13ff4375e378c12dc3fd4568e008251e03fa89a6b226c68de3f6d4bef277cc6d63f54e9c910dea1de3f6da22c2b72e3e23f17158d3b8fb9e13fa5a15a5fef3cd93f2e966adef5d7dc3f06ab1bc0a9c9da3fb006d704a01fe03f34f18bd66992e63ffb042bed66b6df3f6c6bcbcebd2de23f03aa38d7ffd9e03f77eb060cc7c0e23ff4a6352bf184e23fe0db7660483be13f093d2a6204eedf3f26a85a0aa52de33f947494628c055f635f316494682f68314b008594683387945294284b014dd101859468118942880e0000573b54e39fdfef3fc128697a5dfe66bf4d31efb2b3778a3ff94aeafcc24279bf927c35831324613f9d3e4012cd81763f251bf4ae5a13753f62f0bdce482406bff7c377ccac5665bf2a40b7442a21493fecf12a08cf1f4fbfb46d49daca8f84bff7f32713aee14e3f55db765d77667cbf5f838db6a949773f607242ad97246f3f586da8a18f4b703f861115679c1d6ebf50e63a581eb25b3f38077e1380a5303f6058f52afb80713f88d3e713831254bf6a2d26ccb5206dbf4eb165886cfd783fd0854d9dde72703f15aafffaca787dbf9f939a5b5ab54e3fde31e30cc847463fcd7b36bfb94d7bbf1d8ceebc042c51bf030967ef02c8ef3f61e9ff6b725d6c3f658ca8475b4968bfa6a933b1944b6ebfca7096129d9075bf03c6f966b536623fda4fad05705d2ebf0e7c1064226c65bf6584fc7e06cf5b3fbe6b439f15a0323ff204bff9a8d0413f8ae14801008c5cbf38609c148ccd493fe057be3048c24c3fa83316d361a973bf0fb95db0ab7b5d3fb799566c159f613f6e91c8cf5c45583f475bdd25b92562bf8799d58f79d472bf60c64c2b7283593f0d8b1847caa5673f2a7d52f2f0896dbfd2037e9263405bbf46679bd25d6643bf56af9fedf3fd723fbb0cf69c722137bf8e69b4ffdc38753f67441fbcb91f7ebf1cc9328264c5ef3f870daff5f44b733ffb8b70b5cb746dbfd4b55986804458bf31753c462f2d7dbfbbac4b77676277bf04cf80296b0b3ebf4d00781e941d62bfbb019d87ed47403f6755eba6afbf673f0a54cb9bccac543fc5674a8a36a8703fd66e7cb853f16ebff8e3011cc68f74bfe8e544516c597ebf376df960cb873d3f68f8dcd158c01dbfda55f5d5491a683facbb94d2eb90113f99eff75c2423683fb771e07351b34a3f814469affeef773f6a6109e2ad2a3a3fce88b65aa96c763f08b70fe8f5915fbfd8eae066faff6abfbd072daa76ac643f2a959a1f3a91863f55a0f485b0bcef3feed685e8946952bf5e05e4b00fe262bfc9f65e3290c75b3fd5f080ab91c9623f37254b9724df713f4ec9f280a99f4a3f2fd3190d1d805fbfd85212398455603f8865be4d26475bbf0d2593b5de8b33bfb8f247110f6f743fef3618463803793f70a49520fbb3593fc8d49b5e70b7553f0f6a9e01195d613ffa56efc9857e683f79793d19e45c61bfa136b09f24e47f3ff7b47692f5ed673f94a676bed75d75bffe0d49a225ee643ff6b0a5434d9b52bfa9a3ad4f4887713f1ddd606f45e9753f55a293d6e5bb49bfe86407e3306084bff72d704d62e8ef3fa5d042a12ee471bf7f9b9b1cf4f65f3f10eb94e95bfc643f7eee225598c93d3f1d143da96c95673f183ea7c4248c39bff01b5a562aad7b3f7ccb8c4173465ebfc84bf382e11e573f35e2b2fc759765bfed2a495c69e6323f0ed9b3b80203513fd13b7ddb817856bf462aa60ec41c543f1ad2f9f7019e51bf65b0d3b7bf9072bf0c90fe55b4b4803f26850026c2b36f3fd0f6da759b1678bfcffcbd4cd46b4abf4abd8e14e529783f93903fa8c0c7693fba7f55a0a250673f6040d203d5f6793f9e194afe0a8d76bf07a5e72ab900f03fc0cab7dadb3f0f3fde4558db0a975dbf92fc33f1532155bf4287df4dfd2d5abf6d01aa086d1e5a3f52bcc19d170a683f10923c68469160bfe5d2c58cb547763fd895f1d0eaaa4e3f8f994559ff3965bf0a08243fb88f653f49a89527dec0663f709fcd9779f6513f0d0442e6d08a753f4f611a7d68e665bf76a2c75bb03e6f3f275a036600ae6c3f56e31b9e60ca41bf86c5d50a256f633f2be596c837684abf5e5ed72e38f15bbfc8f379cf2eec57bf8c36830d2461763f7fce380b4bd977bf5714712e92f3ef3f0d946a923e536dbf85549ab7b3fe593f0d9e0fad38734d3fe31391ec067d3dbf9d0756f3b4cd733f898066c5223a54bf10ef6e7c56ff473f1f09e4f756a064bf9699272789a140bf8d725c64764b68bfd58afb299786473f135db9360e5e72bf3d2c2fa3987749bfc6c39059680f603f980db009db816e3f6a0ae9a9d56e50bf8e3da296d10e2c3fecea8f222a9b513ffab3e01e54217d3fee851bd7dd244cbf991f33ea751f51bf0af4c53cbc38543ffa97d6fa3d0a7c3faee5c98aafe3ef3f4281008f9b08503f356ac1552f17603f5c9d700b301844bf1aa32de3203f783f76e0e9aab2ac55bf246841a1055e663f7857586649bd66bf12f43099f72f69bf237251f2359d6bbfb780b903a77d6f3fd771b60fd43567bfee0d706ed0b42cbfc1e036f0f90d3abff70895307203593f3c5417ab9faa54bff136c8f334f361bf9823d1bc1fa544bf7db43eba1ec7703f971cb6840062643fb51b0fc50b2d58bfaae02e0ed2434e3f1061033e40e75a3f48e9306a39d8ef3f88b4734be3b9503f6dc3c01e0e14503fa0876bfbd99a39bf7df48049788a21bf2435eaf6dad11bbf5261f60ee82667bf2ced4c3ccb577cbf1689c6e06b78633f69eb4e8b0edd463fc389be7b796151bfe498a62ffe9774bfdcbbd7b5235b5fbf6a97917af30d80bf51b01233f6a753bfd4543a43fa0458bff8780dfc9fff72bf75868924a6a262bfd32d59c386df3c3f39728e9dac0b6cbfe7440f2332986a3fc3d87c1e432f5fbf156aac1a55e6ef3fddf38349cfa647bfc2a032b03c9f623f3c90fd2fa8b363bf52f962ea9f0f63bff7e550e2a3123a3f0e5d36684800743fc506cdeb03eb773f361e6a29a45532bf2b86a4a15a7070bf78fd6fcbd82e4abf7c76d4b464c649bfc3cf1fa38a33733ff96bae140225653f3f6c1bb0a56b613f2271fefcd43024bf5c71887e541427bfccca8b4db14b64bf65fcb19e7a032c3f4e86b3a4fb4d563f5f5c16842eef643f411762cc98e8ef3feb8195c4025e533f1513dbd336d7593fc019daddf1015d3fd3efc701f388613fe5924a43c11a56bf063bf084fb5c4abfe6f036461034533fcd6cd6397a644d3f2f9856d13446713f00bfb3685042583fa9fb3153217362bf215aa650ed636bbffd3cabd77c635abfa3d323827f453fbf6565b7a6216972bf6443414d2bfa57bf4400c35cd90555bf8e55ed44f74f6abfe049f68f59b875bfa76053eedce7ef3f5ee2e19ea8494cbf55badefef36374bff153af308f554abf88fd8c0c9c207e3f800e01cea2fb793ff1537f107a3265bfbfaaa5e6669c59bf4981dd907f4b75bfb62a4533569c313f312bdc28489f6abfcbbfe6a1365a40bfd1dcc591b60466bf9cc3f55a7e2234bfe92266093e0f54bf2902e41d8d964e3fab4acdad6c82693f3f37d7ff9f7260bf804c9ee4cf2754bfed6834b144f3ef3f62235bdd2c13533fddb8378f71e05e3fea4350378bb15fbff42d891a3e18523f377efada05d1663ffa0889d0183d13bf7a8b1f68eba0473f78f2f226beb352bfd88877a76717443fb82eb99fe0c4653ff9e1cf2a48a5623f280aba50643c353f8e853ac6cb1a5dbf58d5cbe67e7e36bf987cc24607e84fbfa1e22de59df65a3fbe2ec5b52ba73fbf337db157bb03f03fa80531ddb801693f55e79dabd4113ebf14814b08b1bb643f34b349bb44bb5f3fa51abb830c3e503f908cc9e23db94e3faaf7d3ded004623fe8778c264b0c88bfcb658f4e09ec61bf9a8b315d412f3dbfd62f99ea00834bbf57fcf3497d7b82bfa80018971e386ebf4bb1b217ef8532bf6a81f3c7404871bfef61c8cf161978bfc5493d199ae3ef3f2c037d41da4c79bfe4b7a634f75571bf1b6e6aed984623bf3d3aad6f57fb533f92c4925c8021443f5989e0f882da373fa2e60ca20d9d75bf3d6df9d391b557bfd78bb51d1a075b3f90cf59f3afe049bfe287ab251a6f5d3fea5eabaa720055bfecd17c27a80c6fbff53450e8088e613fe7da74633f6b753fb4e95b0182d8ef3f77c0a353868155bf4c84c969e15157bf742f18d1de126dbf2d02cfdad1d76abf3e662675b7db76bffe1f21f5135d6e3fc93f8ff6f333313f5f7626830a0967bf5851f2576f45363f4e18078606987c3f9be4c525d634823f4ec92709f34867bfdec46d8b87ba863fee7b9f429fb3733fa89b37fba9baef3f3a499b5545cf4abfb611c9d7e90041bfd8bb458955345f3fab7d29749d70683f1decd610f548653f6c200fb2de1e72bf1626bda192a66bbfa23754a624ea623f7a4a549cec36813f3ab1719c0e16693f6dfb9501ad5a4f3f44c68007c69e54bfe51b673af87d6d3fb1623259dbfaef3f3ba48d1888426a3f30b3e27b07fb00bfca406622e7b0513ffd8e9a0b8d2f83bfbf40041eacf85cbfe44e58ccbc766bbf8bd57fa8de5567bf7d579037432a70bfec12ed63f6686bbfe5a007c502ef493ff5f481b2d88c66bfbc0bdf0690af75bfdf12cb614af6ef3fb4ef162e0d3d633f3f1612a0f31e583f69448d47c9f874bf71760ef8326e56bf3f6a345b6ba9783f995c8fbeb16720bf2c91ac4b070e75bf10f955f1373661bf505ca8fcda1471bfa3baec2725e95bbf0ac838274466713fe7319af0ba0ef03f2aefd357236a413fadd73834d0ef83bf6f0c0bf3b1545bbfcf0ce312204d703f7a6f0339393c643f665cd0e77f987dbff89b1af6787f0e3ff337eb062ff76fbf92be1636f703553fd0f316f747644f3f6c9d11da09f5ef3fe79e10ed725b503fc986a7b188945f3fec24c8fd50d3493f339bac1d9a4d58bf640ea1b1bf9b57bf17c0d8d02c9562bf9e10989d356b62bf063e8ff7efd66a3f5a3d56b8ff2474bf8ad720fdc7f4ef3fe02b81fb267b72bfc8a9f4862d6e763f12c75660ecea313f36a0137a0dcd673f7b37846e8430783ffe15ee22e41939bf07ac473e2f014c3f7914132c936a8c3f29be027db5d3ef3f887c9fb8672a54bf5df316d02acd37bf0a07c6c0c8282b3f1236d22ac44f673fc57deee2d7ed1dbf1b862f65de9f6cbff642bb4534556b3f22388ed1cd0ff03f50f8aab9e873603faa9b49f1e15e51bfe35ea2ddffe2633fe6b64c61524e3b3f516141fbdd8461bf56cda9c8c14464bf778047dc9e09f03fbacb9e43878756bfb741225e745a503fbb016e7b218d64bfde4a06f8c6d6703fa29b007a79c5653f4c6ad3a5b6f3ef3fa2a70c4672725f3fe6a57cc675f55e3fe4d4389ce3e14a3f0e0fc3060c323bbf16bf63aa9301f03f5a0935a57968513f09df36aee6a25b3f3000f061b50b813f327681932aecef3f1a6f1d48b6056d3fc90a76ec91b06e3f4920538d97ceef3f013c1804f3316e3f9617b84395bdef3f947494628c065f7369676d6194680b68114308d686a15e3fdbc33f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b1e4b02869468118942e00100000000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944d2c018c025f67944b018c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b1e4b01869468118943f0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014d84034b01869468118942201c0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b4b8c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b96859468118942b0040000808551d20a02000000edbed30a020000a78deae325484f4057dbd7dd163f62400021d5d30a020000401cd5d30a020000403bd5d30a020000809fd7d30a020000d05945d20a02000000e4d8d30a020000c02c08d20a02000080ead8d30a02000040f2d8d30a02000090666cd20a020000c0b2d3d10a020000e08d7ad20a020000b0904bd20a02000000d4d8d30a020000000cd5d30a02000040ebd8d30a020000c005d5d30a02000040ccd8d30a020000b0bccdd30a02000040e6d8d30a020000705f37d20a02000080f4d8d30a020000c0d8d8d30a020000303293d30a0200004019d0d10a020000007948d20a020000d09455d20a020000c0cdd8d30a02000040ded8d30a020000c0f7a9d10a020000c0f9d8d30a020000002bd5d30a02000080b055d20a020000c0ebd8d30a0200005024cbd30a02000080e0d8d30a02000080d1d8d30a02000000b8cfd30a020000807532a20a020000b0935ad20a02000040becfd30a02000000a1d7d30a02000040efd8d30a02000080e3d8d30a020000c0d2d8d30a02000080e9d8d30a0200004093cfd30a020000c0eed8d30a020000f0bbcfd30a02000000b9d7d30a020000008bd7d30a0200009097cfd30a020000803eceff0a02000080e89ad30a02000020bacfd30a020000408ed7d30a020000c0c4d8d30a0200004024cfd30a02000000f5d8d30a02000040f5d8d30a020000c0fe9fd30a020000c0c4bbd30a02000080bfd6d30a02000080abd7d30a02000080b3d7d30a020000d0f12ed20a02000040a9d0d10a020000a0d12ed20a020000a0becfd30a02000040a4d7d30a02000000aad7d30a02000040b6d7d30a020000c0f8d8d30a02000080f2d8d30a02000080cf9fd30a02000080d7d8d30a020000f0a0d6d30a0200004088d7d30a02000040a0d7d30a02000020d8d6d30a020000c0bbd3d30a020000a0a3e3d10a02000060ccd6d30a02000000bed7d30a020000c09ed7d30a020000001ed4d10a02000040a7d7d30a02000000b8d7d30a02000090e3d6d30a020000c00ed0d10a0200005095d6d30a02000080a6d7d30a0200000095d7d30a020000d0e8d6d30a0200000011d2d10a020000405190d30a020000e0fdd6d30a02000040abd7d30a02000080add7d30a0200004092d7d30a020000008ed7d30a0200004084d7d30a02000010cdd6d30a020000c08fd7d30a02000050edd6d30a02000000bad7d30a0200004086d7d30a020000f0d1d6d30a020000c002d5d10a02000060b9cfd30a02000040fbd6d10a020000803bd5d30a020000c0b3d7d30a020000c075b3d30a020000c080d7d30a02000000b6d7d30a02000040e5d6d30a02000080a9d7d30a02000010d0d6d30a020000c039d5d30a0200008008d5d30a0200009054d5d30a0200008064b5d30a020000a0cbd6d30a020000a06cd5d30a02000080cacfd30a020000c025d5d30a0200004032d5d30a02000080e8d8d30a02000000bbd7d30a020000506ad5d30a020000c09ad7d30a0200003054d5d30a02000040e1cfd30a02000080e6cfd30a020000105cd5d30a02000000decfd30a02000050c4d6d30a020000c058d5d30a02000000e8cfd30a02000000accbd30a020000c0dbcfd30a020000002dd5d30a02000080b7d7d30a0200006976652066756e6374696f6e2e008ce29474946275622e" }, { "trial": 29, "chunks": 15, - "hex": "800495dc390000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b1e8c085f706f7073697a65944b0e8c035f6d75944b078c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308a34b1bbc0626114094869452948c035f636394680b681143086a92e28100efbe3f94869452948c035f633194680b681143082434ad659aa6603f94869452948c045f636d7594680b6811430845615b913d14743f94869452948c085f635f7369676d6194680b681143082b69721be07bc43f94869452948c085f645f7369676d6194680b68114308254d6e037c8ff23f94869452948c035f636d944b018c065f6368695f6e94474015ba3c9bd48c6b8c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b0e8594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494628943706e9a37f80c1dd73fc66a35c10c53ce3f37efc329a305c53f6341f723ffd7bc3f1ef7e22ed39ab23f8b9428ea577aa43fcffb020a7053893f5a71963c4b3fa2bf95808b0b36c6b9bf69da5d339a55c4bf98c4ab0c3d12cbbf56cd919c5a9cd0bf5268fa288a70d3bf8c3990ec070fd6bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b1e859468118943f0c58dafa6154adbbfd4ad7f44d17795bf212b46a9373fd03f7513df563cf5e5bf2a2864a6213aca3fa4af6382eb65e0bffb68b20aeb29d93fc160145ff50ed93f823877656074dabf203ac8bbc05ea13f2538f6755b27d43f808a31081da638bff59d523e3e17c63f584a588661edcbbf4eea5eb793f6e83f40517942f5aee73fb48a000fe028d53fe8c958319ae1ccbf28565446e1afd23ffc2b69a00448e7bfdaa872cb8f34e93fb40bd9d49438e73f62d2805ea610e1bfed49b71abd87d6bfd8b88fa18153e33f40562be7132ba03f08d66ed99f6fef3fd6fdf6a3411ed13f80121daed8a5d63f948f16e07e5bb13f947494628c035f706394682f68314b008594683387945294284b014b1e859468118943f07294f97c181fd7bfd410fefd690694bf4627f218f389cc3f10eb1a844838e3bff29cec26d79ac83f086d0d061e50ddbfd659bb0ff3a7d63f843a9e3994ded53f1c042a45eb9fd7bfe0176fb6656ba43fc5452285380dd13f40948392777e773f0786fd3f42c4c23fe0bc82fe8191cbbf55f2e6e3e4a3e53f9ac2a9e9d337e53ff6fc6cc9a31dd33f22bdc7e8dfa3cbbf227e097b6631cf3f8da0bed69bede4bf5d9eee4c8c2de63faa694d7c6390e53f16c46d663911debff1e1dc1640d0d2bf24965ca56411e13f98d13ee40e2ca83f37e5e1897bf5eb3f6a5aabd6c172ce3f391aa8e3fefdd33f68a96344df13b63f947494628c055f6d65616e94682f68314b008594683387945294284b014b1e859468398943f0ee27e6b48fccdc3fd9fd8c510b81df3fddcf24e4f86be13f1c1d2768fca0d93f49ffd7576c4de13f1a1cef3049f2da3ff160f853f72fe23ff60b90cfa0bbe13fcef89aebe0eadb3f545a0e5df18fe03f4132bca6d2fbe03faf771e9c3216e03f4a11c818d097e03f280731d01828dc3fe2af25a03747e33fa97b995164dce33fd985917df0d0e13f4a4f0b783499dc3ff9e666ea78f0e03fc057ae01d278d83f53dc59776a82e33feefb04eba695e43ff0bd8b736838db3f3ca947a56ed5dd3f06027eea99d6e23f619af899ddbce03f0985c9bb8adae43ff7ab42cdac6be13f541e2c62b690e13faedd0ecfea02e13f947494628c065f7369676d6194680b681143080189b5730979c23f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b1e4b02869468398942e00100000000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944d2c018c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b1e4b01869468398943f0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014d84034b01869468398942201c0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b4b8c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b96859468398942b0040000c0edd3939f010000401792929f010000a78deae325484f4057dbd7dd163f6240132d089b72204540f3d7b24d1e2c5c40c04fe3939f01000080f9e5939f010000b0332fe29f0100000073e3939f010000208c68929f010000c0fee5939f010000c0f6e5939f010000f05483929f010000c03591929f01000040c2dc939f010000601249929f0100004050e3939f010000006ee3939f010000c030d5939f010000c07ae3939f0100004040e3939f010000007bde939f010000c071e3939f010000107ade939f0100004066e3939f010000c062e3939f0100009075de939f01000040cbe6ff9f010000405de9ff9f010000403846929f0100000072e3939f01000080e4e5939f01000000e1e5939f010000407be3939f0100000064e3939f010000c07ed9939f010000004ae3939f010000e07f98929f01000040d8e5939f01000000cee5939f010000203c46929f010000008ce6ff9f010000a0639d929f0100002044e4939f01000000d5e5939f01000040fde5939f01000040fee9ff9f010000c0eae5939f0100008063e3939f010000d059e4939f010000c00ae2939f010000407dde939f0100004006e2939f01000040cfe5939f0100004041e4939f01000040aecd939f010000402349929f010000003346929f01000080d9e5939f01000080ebe5939f010000c0c2e5939f01000040efe5939f01000000ffe5939f0100005049e4939f0100000075e3939f010000606ce4939f010000c0d8e5939f01000040dde5939f010000f060e4939f0100000031e5ff9f010000708273929f010000b041e4939f01000040d2e5939f01000080c8e5939f01000080a1c7939f010000c0c5e5939f01000000c5e5939f0100007041e4939f010000801c91929f010000107de4939f0100000079e3939f010000c0c6e5939f010000b079e4939f010000007cdf939f010000d04ee4939f010000f049e4939f01000000c1e5939f01000000ece5939f01000080cee5939f01000080fce5939f01000080e6e5939f010000e058e4939f010000c0e6e5939f010000d056e4939f01000080cfe5939f01000000dae5939f010000e064e6939f010000809c9f939f010000b068e4939f010000c06ae6939f01000000d0e5939f010000c0f5e5939f01000040f3e5939f01000000f1e5939f010000c0e1e5939f0100006075e6939f0100000089cd939f010000d0816e929f01000040dbe5939f010000c0f9e5939f0100009078e6939f010000807f4f929f010000706fe4939f010000807ade939f010000c0c4e5939f010000c0d0e5939f010000c0bee6ff9f01000000e2e5939f01000040c7e5939f0100005079e6939f010000406cdf939f010000f091a7939f010000c0dbe5939f01000080f6e5939f010000506de6939f010000c07adf939f010000904ce4939f0100003055e6939f0100000013e2939f01000000fae5939f010000c05ce3939f01000080f8e5939f010000c0dfe5939f0100000063e6939f0100004033e5ff9f010000a053e6939f010000c033e2939f0100000042c5939f010000f0cbe6939f0100000025e2939f010000c05ee6939f01000050e5e6939f0100008022e2939f01000040eae5939f010000c01ae2939f01000080e3e5939f01000040c2e5939f0100006976652066756e6374696f6e2e008ce2947494628c055f635f316494682f68314b008594683387945294284b014dd101859468118942880e000067c0838763d3ef3f4010d24cfa84453f2c42ad4e177a893ffefbaa1add6469bfeea294634378633ff581ac06795f793f3a581430adb1703f09163f1acea43a3fa456788556f039bf799de5cfe97c683fa7bfca3076b7583faaea9a52c76680bf247971f694566cbf2fc0e33e29be82bf98059d26bec151bf2b237655f20a753f10c6d1eadd8e733f2465cc4f04b877bf6c85193279e639bf40d483fdae984abfa66308da968f50bf3114676e7e115cbfeaf80e187f3a573fddf329720bbb6b3ff05cadd74e9d29bf4a02ebc8744f62bf116302a906db613fcfb85cd47b5c633f54967ac3b38574bfacc5a3de36645b3f673f67c9e09bef3f000d69b77536803f272aab8110de59bff9821b01d5c564bff76c55f146517fbf481f34854d0e743fdd042f7ecdf76bbf3c6b2ca6efa576bfd0edbf993cdb733f913a6885879e6fbf1a52868ff75c623f3e25bc02826a773ff2977be93c2c603f5e606c73bb7b643ff54548964f3e76bf554d2d872c7e763f10357e5b9436333f12d2e6a57f5f643fc0feb5f5e2c9173f510fd1ccfcfa75bf253b6a2db9a4713f3be2c426d23668bff880f334aa2e71bfe568eb9c2c46773f80145157155f74bfef4dee674aae783fcc27af6b0f042abf46ad565baff5693f060b121e135a87bf43327f5de992ef3f86691e16cdf56ebf0c9b7b9d905e6b3fe3f060e8cf657a3fa73090c98b786cbf5f852ec6a12463bf2440f42963fc4c3fdcd31b809b2c583fd859cccd8faa79bfc84e049fd43c36bf85a11244955469bfaf373f812a19713f4b867dfdb85281bf7e7119d39b3976bfff83bc5c526882bff0975bcf559f60bf677abc69da726ebf5265cb27971c783fc96eac38854d7a3f2c42b8147f31873f5844ad78c7ee603f436b6852a9d7743fddf01f4f98566a3fd26dbb8dc27b5c3f530dce2bc6fe5cbfa8a992e7cdb583bfe779cedafd2e7e3f0ce0cd4b17b3873fbc1f4df7d172ef3f84a962f9b519823f26d3f838aebd753fb40af50cc869703f7c2bda507b13623f7ea9f977796f7b3f9f90b83d8bbd62bfc2a77cb68a5182bfa8a074da4bbe55bf4fe2ae73c0d664bf4f5a0e7126bf67bf38e60441b3e752bfb4370ee08135743f55f919128f4281bf7850ae4d49e24ebf380fbae12988593fef1f31670137803fa43eeb82aa83783f082206cde669883f9085a747f03a853ff88a6995f95372bfe2ec23e1ed17743f0cfd1994238e6c3fc845af558077333f6f2825e0e89079bf70c1b2238067333fd788db410dff86bfd63359a8d56fef3f42866d217ab97dbfb7fd9a0dc4bb543f69ee369480306a3fe28ecae4db0175bfa755eb45a14a823f6ad323984d5e713f443268cd62f86a3fd97fa85f626b73bfb0233cd2de7e6e3f43c61f2a491a663f5af0cb29499e60bf5cca698fba69813fcfff9dd91013593f4146448c91374e3fc88de816ed0e7fbfbcd3b7c2ef6290bfbfc6c40369d3793fc980d3975e3e643fdeb6a5cdef79633fd7397bca921d84bfa4a4e9873377703ff6f4c1c6ba2a713fb8ed588fdd537a3fa86510e112895c3f66cd3c0470176ebf2981f987d4faef3f2233cfe124ba65bfa012ea70cad010bfb336e846ace655bf1c612041f9dd3ebf499ba337900a703f46ed1633f85b7e3f6009231607a221bfc6c373b89e25793ff4ad2468be041bbf18ebea867e1272bff0a6118f71b06c3f31a528d9c4b86a3fc094e60118e653bf634b554ad38a743f52d700f5555786bf8a5ef448b831623ff0660ace1c0f253f96a6ea209d16483fd3e449284ec0733f38a2452c89816cbfb4220c7c9f9d61bf9204de9c22b3823f007c1a345144553f73d23fcd577371bf1f04acbfcf00f03ff75d3c5650b562bf1288bed66b8044bff71b88366d60693fd8a2cd751d28583f60ee8e62c07f703f503d1b836f81123fb9bbbbd4c4644c3fd6687976ac4970bf951cb950973553bf34ae3475b2f36fbfc84a8d1fd33344bfd0ae1f09a4545ebf4a73a35fe46561bf5076b199427c343f049396c64b1e783fce546c491dbe583fdcdecd4498c21bbfc8f964db6a1a55bf3a4ef4e248a8813fd0d024c631b4563f720bfef444cb71bf202c50a89801243f52449a83a5a3763f8e230e9a57d5ef3faf9e9017a3826c3f7cfdc4111915373f4e80183ab5d4613f72bf264d4b46813f7502fa8dbc4d663f8e1dc35a9cbe793f5252e6494780523f007197ab04c337bfe757dea3f39568bfd917dfa5772c733f507696e8493974bf265ffad2a513573f66e7d321eab85d3fac61d2924e9c673f9db07278338580bf650835a2616e68bf8bbb508bfd00813f8073eb4529a917bf9a950982d5e5663fc3094e791384563f64241854cd985d3f74af4aa84c15523f6a926021a695ef3f3646cc9ba04f683f350727ada87546bf1a23b2dbf6e069bf221b6b5684014bbf9c4cd1c737a148bf12e7a2d2178355bfc057384e689886bf402a24a71bae323f2eb3e6d5dca3593f90254e73ff53513fdc59cbffa5e482bf585fa6c20ba57cbfcc1421f2fb1887bfeea0f160813d6e3f74de50e765b2713fdeec73b97bd381bfa066c61929c03d3f36524ad7458e413f4c3e3f7cb9ec59bfca30831e3ba96bbf8dfd8f211cfb68bf06fe8cb4d6e4ef3f9831b4388493133fdd057c0aebde633fa878f385e4be38bf0090af4681de56bf0410104fe33d73bf2a51d294f52b763fcd30717ef8ef623ff53a36a0e4ad71bfb59798d1adf574bfa092aea84d12653fc2bf11eb75e5663f42d8ddc43a92813f28e21e1cf2c5743f380e7c8e115e3bbf7b98b16347d66f3fc060a8e4d0a34c3fdb50d4559ddc52bff83303d673e176bf6ec3df0f1bbb4f3f47d78a1b2526613fcb54819dc798ef3f14a037512e75473fd664a9132f91653fd989f643ee9b613ff452e89487e67a3f0c70ac02928b71bfa89e78c47dfe64bfe5ccd818fc8e613fa674c91f7bcc5a3f3236ff26c5067d3f4d55213d2b0a7f3f1bbf409372495c3f92561bccf5f67dbf2fbf9ce666b65dbfce25070f39907c3fd9d58c94d71584bfd1fad352bfdc56bff07888cfe0345fbf241ad12cee1f64bf065756ff41737fbf422665fce9bfef3f6ab469d3e6807bbf5ef4d60de7d86fbf791bd5f955c15e3fe22fa9d40339743f90895ede32b46b3fd738778479e052bf8eee48fce65e6abf7c4c29790e057ebf09f6a9a6b5fb533f083f5b46284d6dbf34b3846dc8456c3f7784adf4274c693f55937e2c28526ebf02648f11ed0333bf509789d1cd7d26bfc4c5579721634b3ff67279bf2b4f70bf4656c8423b15423fab2bb9afe0beef3f8db102da5ecb533fa1ffb2d1b130543f64ec2be1de6163bf79af894b8285533fef41377a6a3c6e3fbc790804e4f4363f96604bc16a685bbf94649049c0f129bf859fb477f9dd6a3f4a36eac9fdd77a3fe453f40f7724723f18e8b5475b3d82bf96df2985086b55bf438c01ea9ec341bf5a106827dc2f7ebfc0dda415a3e8773f62c2131d1c24243f6c8e9f1d660ff03f25de336e6b5e623f6bcdc1e37e5055bfa4d24b05f5ce55bf0bcd7c83cd6c613fde4da72806f7633f43bdda8957064b3f4741702011de733f24bdb8b7f95c87bf204981979c04153fd669616afd5971bfe2021778f391623f0a9275b0a49684bf809782417b020dbf167f1fa731442cbfaaa14571269271bfa644283105377bbf82da9a33efe6ef3fd40a8d73b87864bf82a09d603d7e81bfea3635094b664b3f4d6ad74d69e4743f94a50c1c7ad956bfb345468699617f3fbc6a27e545a081bf40b8be09cb3b3c3f463436a992fb7abfb7222184d9814b3f715a9ae2021f733f928723794f92593f77c741f8b01e5ebf940111615f417b3fb2db7cfa2351733f887307e68fc2ef3fdbf579fa8d8150bfc4122f9d9d7333bf5eb7dd6129905bbfa22be3d39a1d76bf0b4e549574c677bf6a8e11c536836c3f94f1c75518a115bf400d2ff7d07524bf2c8035af771153bfd67d9a39805c793f6911d55fd133843fe21c3bbecf4b60bfb24aa7dbed17813fb2615c9e7adf713fdb732b9761b1ef3f44724e7da7ac71bfa0dcc51794d2493f505b3bfd2077653f5068fc74ef19853f70d60885c5b1553fd0eb5970b4615ebf9375fdaec6597abf446e18c37a2b603f94afc4eeb980843f4edbaa439ba8633ff2486e55519d6abf90b8116f446e51bf3a4903440b0f633f8a9389b2baffef3fea08e86ac6b5703f36426908fa5d4e3f384b51f89226763fb853f4d8d01f87bf3e61f64298fb5fbf55a22a401d9c76bfd4bd045853c242bfd2497b6df4346ebf663daad5ba2172bfc07e70a42fd1633f54ed36c859c94abfe8950aba2b717abf7764c91b4b02f03fd5e39053a2f66e3fb1001b20bb6a793ffa035515fbe667bfe2b3bcf1165f6dbff5c82a3ac427753f8ce0114964805cbff7016932f2af79bff9542763b5c464bf6af818e175eb84bf068028d32ab36b3f3f8960957aac633fca6f5c89f6f8ef3f7e656ebb49f07bbfb6e12084907f8abf7774e9415d7f6d3f843afadba11f7e3f734d35dc58fa75bf1ce10eaa461c72bfd467fc550b3a3b3fec96331a2d716ebfb245a5eeee0d65bf02ace8ce4f6e5a3fdeee375d0dbcef3f314450acfe1c70bf72cb2b7c7e015ebf080cab53adf7543fe71f30fabd887ebf5548ee5f170673bf6e2f01a6caa6623f648fd7399e8e763f2c666ab251a54d3fe5f93458c7d573bfbed5af69a804f03fa00af821d5614cbf0194b73d87ec793f2cebd1a241164ebf592e5d67a5ac763f9a85b2157c3d833fe4e3b8f14a4766bffc5fef9057056bbf4762527312568b3f4dc7dbc48fb1ef3f7859fab9ebc22fbfd789490b490b713f2639c1e3bc4954bfa38fb4128b3f653fe84e0c5a75a848bfddcc10e3b5046ebf66a3f4af2daa6a3fe40db0fb05f6ef3f5ed70b43f8ad733fd3164a92c5ed553f803b67c80b8717bf38e1e12b1bc5673f488128c5fdf8483f7670f5bd58c159bfbe59973568d8ef3ff085de5cd2b64dbf88c73770ac7e773f596de5a43155633f1c441c1c9a58663f48ceec57ab5c7b3f095807871d03f03f00b7b35212c3523f50be54726ec3163f24a0adfd97e3523f24048df7cfca35bf5a63cec81818f03f36cfa5c93acc64bf443c60a2d90f673f04c59047623c803f7714c0bd1c06f03f70360f0d9d91713ff8e256b30bfe7f3fa99d25633596ef3f50f16c4897e7553fd7de810dffc2ef3f9474946275622e" + "hex": "800495dc390000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b1e8c085f706f7073697a65944b0e8c035f6d75944b078c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308a34b1bbc0626114094869452948c035f636394680b681143086a92e28100efbe3f94869452948c035f633194680b681143082434ad659aa6603f94869452948c045f636d7594680b6811430845615b913d14743f94869452948c085f635f7369676d6194680b681143082b69721be07bc43f94869452948c085f645f7369676d6194680b68114308254d6e037c8ff23f94869452948c035f636d944b018c065f6368695f6e94474015ba3c9bd48c6b8c085f776569676874739468098c0c5f7265636f6e737472756374949394680c8c076e6461727261799493944b0085944301629487945294284b014b0e8594680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494628943706e9a37f80c1dd73fc66a35c10c53ce3f37efc329a305c53f6341f723ffd7bc3f1ef7e22ed39ab23f8b9428ea577aa43fcffb020a7053893f5a71963c4b3fa2bf95808b0b36c6b9bf69da5d339a55c4bf98c4ab0c3d12cbbf56cd919c5a9cd0bf5268fa288a70d3bf8c3990ec070fd6bf947494628c085f705f7369676d6194682f68314b008594683387945294284b014b1e859468118943f071c37b211384dbbf1ce16b7a2de7a4bf3cae86cd0b3de63f203ab3359c51ecbffc2ee428f8fed83fb0ab72a30b6d9c3f0b36ca6f2238d43f04f62adb04df91bf4ae720cbdff7e5bf8a4f430acccace3f3edb41bc2b2dcabf8dd8c005ffadc03f5a0f01b6e7f1bcbfe6b72031eab2d03f945a2d4315f9c43fa27a7b6bfeb9f33f90cdb613a015a1bfa1c0006d162fd0bfc67400c2d33dca3fb6a23db5dcbef0bfa5f2db6f8065de3fb4279846f62ee23f52c8a30a31dc97bfd4afcd2e965abf3f48d15330eef9c53f8a59c3bca1f8c7bfaab9d9eef37de33fe93af25d5187e43fce4d5211014cdd3ff698e185d78cd4bf947494628c035f706394682f68314b008594683387945294284b014b1e859468118943f0ce6e5459c83ed7bf84d8255fc6c1a2bffa546a46a87ce33fbce20893a3c7e8bfff4b58f94ebdd63fd8fb88ca7895913f2ee8283c2737d23f82b3e0b861a192bf04e9879cbd7ae3bfe2661ba66950cc3f3a6cba0aa63fc8bf50a88cde6920bf3f5c2d5bab75afbabf8406b39ac27fca3fa079cdac8e26c13fe3ef716fd284f13f1014ec9d891297bf345d59bf8197cebfe0d598eb385ec53fa6d87d3068e7edbf341ec9e7a3c5da3fea6f246d9724e13fc2c83a5710fd95bf2819e43b4471bf3f600ac02ec6a9c33f7cf10a709e63c2bfdc8943e51873e13f2fc372c7bb24e23f32263f9d05d7d93ff29250432852d0bf947494628c055f6d65616e94682f68314b008594683387945294284b014b1e859468398943f0d8df784b94c7dc3ff18e5c6b0c55df3fd3e88b69275de33f50cda23567e1d73f26f70698781fe23fb61206d660badf3fa1b7961799d6e13f0a9d25a322d8df3f381cfb91ab81d93fa8515fe67c79e13f52d170724d61dd3f6bacf6c66aabe03f3c6f10636ba9de3fcd8d63751b34e03f54f10636c58ce03f912697bea208e63f5b9889b03533e03f8e97e83acd5ddc3fb4afccb39b8de03fc7f1d58743a6d53f50df8ad38920e23f3dab5da9b3e3e33f984778db4fbbdf3f984c5b828903e13fee151b0879ede03f24a04b89078edf3fdc7b09b88933e33f8e13c7969113e33fb7d01d516606e23fda640cbcc096de3f947494628c065f7369676d6194680b68114308653df0e7847cc23f94869452948c025f44944e8c025f42944e8c075f626f756e647394682f68314b008594683387945294284b014b1e4b02869468398942e00100000000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f947494628c115f6e5f6d61785f726573616d706c696e67944d2c018c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94682f68314b008594683387945294284b014b1e4b01869468398943f0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c075f455369676d6194682f68314b008594683387945294284b014d84034b01869468398942201c0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000947494628c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b4b8c0f5f66756e686973745f76616c75657394682f68314b008594683387945294284b014b96859468398942b0040000808551d20a02000000edbed30a020000a78deae325484f4057dbd7dd163f6240692ef1aceb9b46407a852fa0e4096140403bd5d30a020000809fd7d30a020000d05945d20a02000000e4d8d30a020000c02c08d20a02000080ead8d30a02000040f2d8d30a02000090666cd20a020000c0b2d3d10a020000e08d7ad20a020000b0904bd20a02000000d4d8d30a020000000cd5d30a02000040ebd8d30a020000c005d5d30a02000040ccd8d30a020000b0bccdd30a02000040e6d8d30a020000705f37d20a02000080f4d8d30a020000c0d8d8d30a020000303293d30a0200004019d0d10a020000007948d20a020000d09455d20a020000c0cdd8d30a02000040ded8d30a020000c0f7a9d10a020000c0f9d8d30a020000002bd5d30a02000080b055d20a020000c0ebd8d30a0200005024cbd30a02000080e0d8d30a02000080d1d8d30a02000000b8cfd30a020000807532a20a020000b0935ad20a02000040becfd30a02000000a1d7d30a02000040efd8d30a02000080e3d8d30a020000c0d2d8d30a02000080e9d8d30a0200004093cfd30a020000c0eed8d30a020000f0bbcfd30a02000000b9d7d30a020000008bd7d30a0200009097cfd30a020000803eceff0a02000080e89ad30a02000020bacfd30a020000408ed7d30a020000c0c4d8d30a0200004024cfd30a02000000f5d8d30a02000040f5d8d30a020000c0fe9fd30a020000c0c4bbd30a02000080bfd6d30a02000080abd7d30a02000080b3d7d30a020000d0f12ed20a02000040a9d0d10a020000a0d12ed20a020000a0becfd30a02000040a4d7d30a02000000aad7d30a02000040b6d7d30a020000c0f8d8d30a02000080f2d8d30a02000080cf9fd30a02000080d7d8d30a020000f0a0d6d30a0200004088d7d30a02000040a0d7d30a02000020d8d6d30a020000c0bbd3d30a020000a0a3e3d10a02000060ccd6d30a02000000bed7d30a020000c09ed7d30a020000001ed4d10a02000040a7d7d30a02000000b8d7d30a02000090e3d6d30a020000c00ed0d10a0200005095d6d30a02000080a6d7d30a0200000095d7d30a020000d0e8d6d30a0200000011d2d10a020000405190d30a020000e0fdd6d30a02000040abd7d30a02000080add7d30a0200004092d7d30a020000008ed7d30a0200004084d7d30a02000010cdd6d30a020000c08fd7d30a02000050edd6d30a02000000bad7d30a0200004086d7d30a020000f0d1d6d30a020000c002d5d10a02000060b9cfd30a02000040fbd6d10a020000803bd5d30a020000c0b3d7d30a020000c075b3d30a020000c080d7d30a02000000b6d7d30a02000040e5d6d30a02000080a9d7d30a02000010d0d6d30a020000c039d5d30a0200008008d5d30a0200009054d5d30a0200008064b5d30a020000a0cbd6d30a020000a06cd5d30a02000080cacfd30a020000c025d5d30a0200004032d5d30a02000080e8d8d30a02000000bbd7d30a020000506ad5d30a020000c09ad7d30a0200003054d5d30a02000040e1cfd30a02000080e6cfd30a020000105cd5d30a02000000decfd30a02000050c4d6d30a020000c058d5d30a02000000e8cfd30a02000000accbd30a020000c0dbcfd30a020000002dd5d30a02000080b7d7d30a0200006976652066756e6374696f6e2e008ce2947494628c055f635f316494682f68314b008594683387945294284b014dd101859468118942880e00008d9a057b7cebef3f050cf25ac8795dbf96bc3c0fb868833f3e2f96840a4b60bf8804e476edfd443f712902cbe366763f92f29618eaf06b3f993a792329bf493f4866524686983a3f48551ac2163b23bf06de27f699bb393f7a00b7ccb13987bf6025dcde7d72133fb9acb72e6bd283bfd38a81857ff3713fb450dbf07a824d3f9848ba46f2c27c3f2f126a0c30ce69bf2f9865b7fb0260bfba7ec281d38948bf17aba4f14112603fc6796ae54f1b563f325dd9d3280860bf1172f6c7086f6a3f3e82cf340dd8643f5aa638202e3364bf448374a8c2cf653fbc73ba9f151b233f4e1d965fda6279bf665b2f162431643f8059317c3d81ef3fea377a717ed57a3f1e87ff13245b4fbff1b3c56d669274bf7cde9690e1218dbf5e08fdc28460713fa2b0c3bb274d7fbf3216d80c001d6dbfc87a9f115a14743f90cd07c2bdf478bfeee4ade04fd3613f2e9080cf53af41bf924dff4fb3ba6a3f6b5ea6e8c13570bf00f4c2b20334f13e2fda7ac894f16c3fe7698fafd8fc703fffd0048e180d5a3f18b3257bffba6fbf6cecb14ec8916fbfd07168757dca393f84d64b5441e27bbfbcebfd61de8276bf509da62067fe25bf76d55e8c158c72bfec49458ec9a86c3f65e0f1123372493f061112a960767b3fbd10e2e3fa0785bfd7b5d8422abbef3f6ac12bd50cea783f942f7d4e1a8e483f5052042ab6441ebfe7d831f8ec5576bfa44b45e258915dbf4650a33abce669bf19358cb55f4764bf368f38618c4f5cbf55317ebb87cc66bfc071896e27ad693f908ae6ce0417793f68575846b07d79bf708da0d07f3975bf04893346a22484bf039a6321164c303ffa45ec00b32141bfe8e2e65e0cd622bfbb4ae1aeac49773f9c9f6b2c7888883ffc25042be66d23bfefa2f467986d743ffc1091afaff73bbf3f57ea8cfd60703fe2347cf51349703fc9d1eb9181db75bff84f97c805a7763f4e949235ca74813fcb10e3e750b0ef3f8a8567a775a9403f28cb5a84690e61bf5d50efa532c7653f1d31f4afbd0e663fec539a65d12c6e3f0cbf549d3c3c51bf6a15a8d2e47954bfcc002b0261e8503f32a83f8a94c1693f0329a164c1c66bbf2fbe274cf2c36b3fe05f8dab4f8946bf8b9df2025ebd5dbf7009cff6591116bf13ab5e0d2817773f76e6f326002c773f34838ac4b82a6cbf390ef1678f5c813fc370fb7d0b59893f8a4892761a8874bf8e62b607f61f683fe5455b096ce5783fa0d74f0f3b154ebf6f4d7b00a98772bfe3a8b48d152173bf7ca54e10ebc686bf00d33e20c379ef3f564f08cb8d6b88bf9ccb5c5bd0b85c3f98060eb1a616753fc819b03f0b8f71bf5a105de6f0287a3fcf6b8de2d007623f874aa2de3473713fde452757c4a074bf5e34316f68f3753f68013488aa6034bf72ba8203533f74bff22a7e61ed3c833f842eb0b170967f3fa6b9aa319ce7603f65d966a808c588bfc6aeeab1765c86bfc6327e17cafb7b3fba01c9b847f9693f8c0c4fd8a90c79bf0392786cd62573bf5829cf77abf77e3f320216d94fcf72bf681aa67c990e733f4a945f3323aa843f06e06a16f4576fbf19399c50989aef3f6e7060df2def51bfb60b2f453a2d81bff0d14582f9a915bf4dc7b434994d513f8da1577219675bbfd662365b92b46d3fe891ef14278869bf1a033fc9df70813f16e67b9ce0b15cbf60b13651cee9383ffa82735cb95b7e3fcc5c6046dcea863fd8dd75e9e3bd603fec236d54704f61bf2b4e1afc7aea70bff2112e21e46e58bfb85ab06c377172bf06c4520456ad65bfde7e65d7fa7c603ff975f4edf56b5fbf1e55f3d37c1b7cbf0c744ad73169623f5b085952e2f9863fe36d9fcede117bbfe4d864785d07f03f685d2136e002373f98a8cd34081d5d3f1e731cdb45f1623f76ac4dbfb08c583fc1738c2444d3703f8009c5cb59df453f8c4d175d37c7663fd258c1b943326ebfe95e0d42606660bf842ae3df40b774bff4cae41c3034623f8db611fee01670bf9aa325c377565fbf46ba4134ffdb5c3f6e69b32f3a70803f0ee77e48a3ff503f4864a1e88c4d453f6c8128b17bb5673f714e39cabf817f3f381e00f4c74954bfacc4abf27f7b70bf8f956acf5a0b673fd3461bf29ce87b3f03b027cb34afef3ffa8e5e5517c4633f0acc182ea6fd743fae670db16ba274bf3e5f355e4d3b853fd0573ade1f75243f26e7093b9c3e733f091408ee926b80bf963c563ec2d96e3fd0e93f84720677bf62f0f8995689643fe79508d2868f69bf9cb245cdac3c6d3f07714325b1bd5f3f80d0077626b711bfc9d3327e08c086bf75ff5f0720d866bf4b6ae6566460733f2804ee2b0b415cbf5af21a75acf7643fa3a477d3a5dc42bf23f7f259da793d3fe00f72146f020fbf497e48d22ee0ef3f48aef2974b2a5a3f42f9b0b59e8b633ff8681b79151a3d3f63053127e8b071bf6d3bc8aae18a6bbfe495cadb197551bf005418b43c2684bf2bbc535105d8653f32490f66f495563f63608aadf4916abfaf5208c258d068bf90f36084bc0473bf66155c47b9ad86bf7bb84ec2768240bf87cc3ff875b447bfbe3cbedfb3a777bfca52e74ad3b652bf2dabf35b7f626bbf50cd7d3862f97bbf96e8cbba243f59bfb7b44a702a90623fa62279dc77d1ef3fbfe87119db3c693f9cd5112c4629413ff829e2c4611f70bffaa29f9f71b762bf847496a5c6d566bfd7fedc88a79f773ff8396bee6644513f100d20893f8460bfcb81c5dbb8277cbf4e95683e576a45bf0ad7ebc80569723fdafc92766341803f7b82d33202b3693f64671e4a55e355bf46656d5bbbc75c3f579074ed5e405a3f14c629d66787483fc94281ad8b8f6ebfe0215a2cd3b20f3f7e6d43afb51a733fbffa06185eabef3f5e1e885294d5663f21fc65fbd347533f0221765d2fcc5e3f40d61a8fbf85363fdae60e462dff683fc8a3ef43bbb36cbf5249c0a6511048bf69e709ea818e413fc4c848361db0823f1a47df54639b713f6e3cf5d9f18862bf142b9e7937e586bfbc8ec1eb3edf483f7eea1af7b787603f040811c1dd6386bfa8fe5a5839265b3fac23d36798543fbf232fd49635886fbf5bf68b78cb3a7cbfd80547bd65bbef3fd66c519f825b75bfa8c8b5ac0a4178bf88e658217c5041bf74815c4b9d08773f3e0e87dfb315713fe893fb1d9410503f620f56473e8871bf8a0797d8a42582bf5a9e1536cd56713f80d9a7a41f9e4abf3e1e0a0ad44054bfe46d65b60eea67bf8a92d31dfc0c6bbfa0856135d0c12abf59ba7364a4115e3f601f8a0bc6a125bfb755be4fe4cf4fbfac80e64e84cb5c3f38c9fb3cc707f03ffead8ca57b84633f62c9de1becd9453ff2d90f4221c774bfb736e8b7d75e6d3fd96c7c39fbf7793f8d743c7a5cbe313fcaa343c021c874bfd25b2548561069bf9d0f6c417de4763ff44c47aabe2c6d3f27fe96527e78523f0203c050081e73bf94a22c7dc200363f84433a25b0c36ebf406bc0e63f6579bf790d3e1c24d0613f46137f4293d26cbf47d7ef97d81cf03f8aa8a42aac65653f38f0f9789dda613f4de9d6c089816abfead0da15c87a523fd177e3ca7a9e673f248e3909336838bf58d51c269d4f7c3fc1f9cf99971183bf804a8d84ad5500bff677630b22e362bfb284413e9ac8573f4c95d33647ee86bf141615f04911513f79165692b6d361bf147edcd12fa86abfe33cdc43a38585bf9869654472c3ef3fb04f2f207e2a3e3fb9c5c36d89677ebf559c57a4020d573f270f755103ac4d3f29923385070c59bf948e4964d2a9773f537b795825d680bf9d1a44faca807cbf409b88ee96f85fbf3cc65694e77f58bf97d23f390a5a5f3f86505da5b61a4ebfa67d7103dda16cbf729e83622bae703f061abc2b6b5a6f3f61c5b5d356c4ef3f2c5f93bc7ca437bf0ed703d0273c673f2cadbaf1663b4cbf3e7ed5b0533f84bf6a57782bba867cbfe2415be464945c3fefc1e6105d4a7f3f30eb230adaf441bf130a0b34d58a59bf0b02c10335777e3f06a32df0291c7c3fde5ae2ce5c3755bf1ca4f64614428c3f13f63dce66f0743f215ec4fcceb4ef3f3ce295fe1f8679bf161ee7da33c864bf3054c1a8b660753f603b1ddeb242813f81e52385290e6f3fd824f66bd0e372bfbb55f7eb926278bf7614af7dd80f5f3fe6fbb6b5db37823f9e04d99d830b7a3fc2ce8ace6a7960bf50ea1907f78f75bf10d2e420a78b683f45dc46b988bfef3f6f8a68dd033b723fe3b1d1505366823f7880032292116a3fe753199b0b3384bfa8dbf616702b40bf50ca97bbe75f46bf3825e13f439934bfc0ce6f41c00181bfa8bb05f8862a483f7e5aefe9d0f2413f556fffd40d327ebfb4426122972c82bf596706f310faef3f70ccc6e9cf8435bf883bd36cb7cb713fa4c12bdc8ce964bf3a7301765cff72bf62e6ab5624037a3ffbf1880a09ae6fbff1683584772079bf87daaa35eb8056bfe5bf5a917de070bff0e6c177a627263fc2d1b5a61fe5573fecdc23bd4fe7ef3fc481f517247a5bbf165676aac91587bf3ecac82961e66fbf6eebeb18b860513fb40d11181d8e4bbfb41fd140d91562bf40b4e05270ba7ebfedc1a99fae4c7bbf1c513d4c88c76f3fa7c2a25fb8d97f3f04bdffedd6beef3f331c294552886abf1ea8eaca05566c3fc671691c2d706c3f784f320a4e362e3ff02f84e6592972bf52267f7209d074bf3d4f420c849f773f10a927614963773f77766d52033972bfba887524a804f03fe48a39244d0746bf3d6a213a7287713f310a57f384346f3f3a6afc331a427a3fb2a2e2b45c59613f7c59d79649d572bfa0b073fcb63a20bf70e61e18950d883fade23ed2557aef3f4c309ee905da6ebf0a90b843263a67bf6a2687bfca484abf1c85c7ed89067a3f927ab487219253bf58d0943e8fce58bfc835d86b754c36bf5e85576afa04f03f6062672eacc6273fb50def89a8af5e3fcee3ef2366b05cbfc068ddf7ce3f59bf960434b1e68f4abfef3b7ec6772259bf8fa95d777d0bf03f699f70e3c8ac61bfea16b0d1f3ab683f907f6be0658870bfc01aa96333e9703fb4b08dd2e5d87a3f74aabff217feef3f668ccb9c5789763ff8c80cb95700553f66db0cc1c3e058bf482deaaf53aa5abfe251089d87e9ef3fc0f331d7673f4f3f548bd117ac25643f4e3b0fd4ed82833fee73c90ef3e3ef3f808900e78315533f8350f5af6e8a733f81fd61cf78a8ef3f8019bb19a0ce0a3f65dc9b9cd7e7ef3f9474946275622e" } ] } @@ -227,27 +227,27 @@ { "variant": "cma", "index": 1, - "hex": "80059511070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f77656967687473948c136e756d70792e5f636f72652e6e756d65726963948c0b5f66726f6d6275666665729493942896380000000000000038b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf94680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494624b0785948c014394749452948c085f705f7369676d6194683028961800000000000000f082cce76a4dacbf48ee618de9c3dfbffe4e03a4ed87f63f94680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494624b0385946837749452948c035f706394683028961800000000000000ec1dc840c8d2c9bf63b30d1155b4dfbf0d128825e142f13f94683e4b0385946837749452948c055f6d65616e9468302896180000000000000029d9ab5623f6e13f157aeac8c1c4db3fac4224c5eac2e83f9468344b0385946837749452948c065f7369676d6194680b6811430803ae4580a86ec73f94869452948c025f44944e8c025f42944e8c075f626f756e6473946830289630000000000000000000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f9468344b034b0286946837749452948c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e946830289618000000000000000000000000000000000000000000000000000000000000009468344b034b0186946837749452948c075f455369676d61946830289648000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009468344b094b0186946837749452948c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394683028967001000000000000c03a89ff9f01000060eed4af9f010000686f4df520b71040bad725942cdf444099e1777dd527ce3f9661b2af5cd2254020202020202020546f6c6572616e63652076616c756520746f20636865636b2077686574686572206f72206e6f7420746865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e9468344b2e85946837749452948c055f635f31649468302896300000000000000018ea7fb784e0f03fd2a708505dbba43f7fd7055ca4bcde3fb67d1f27d139ed3fbdaffb6cf409adbf007b144ee1a1f23f9468114b06859468377494529475622e" + "hex": "80059511070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f77656967687473948c136e756d70792e5f636f72652e6e756d65726963948c0b5f66726f6d6275666665729493942896380000000000000038b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf94680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494624b0785948c014394749452948c085f705f7369676d6194683028961800000000000000f082cce76a4dacbf48ee618de9c3dfbffe4e03a4ed87f63f94680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494624b0385946837749452948c035f706394683028961800000000000000ec1dc840c8d2c9bf63b30d1155b4dfbf0d128825e142f13f94683e4b0385946837749452948c055f6d65616e9468302896180000000000000029d9ab5623f6e13f157aeac8c1c4db3fac4224c5eac2e83f9468344b0385946837749452948c065f7369676d6194680b6811430803ae4580a86ec73f94869452948c025f44944e8c025f42944e8c075f626f756e6473946830289630000000000000000000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f9468344b034b0286946837749452948c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e946830289618000000000000000000000000000000000000000000000000000000000000009468344b034b0186946837749452948c075f455369676d61946830289648000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009468344b094b0186946837749452948c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c7565739468302896700100000000000030ff86d10a020000c09cacd00a020000686f4df520b71040bad725942cdf444099e1777dd527ce3f9661b2af5cd2254000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009468344b2e85946837749452948c055f635f31649468302896300000000000000018ea7fb784e0f03fd2a708505dbba43f7fd7055ca4bcde3fb67d1f27d139ed3fbdaffb6cf409adbf007b144ee1a1f23f9468114b06859468377494529475622e" }, { "variant": "cma_lr_adapt", "index": 1, - "hex": "80059525070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f77656967687473948c136e756d70792e5f636f72652e6e756d65726963948c0b5f66726f6d6275666665729493942896380000000000000038b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf94680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494624b0785948c014394749452948c085f705f7369676d619468302896180000000000000065a4e47691cad13faabe1587956ec5bf86a13289b9d1f33f94680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494624b0385946837749452948c035f706394683028961800000000000000d03b6fcede38c23f49bff8ba51bfc3bfeb49d7ba972cef3f94683e4b0385946837749452948c055f6d65616e94683028961800000000000000a87112fb011ae33fb149600a34dbde3f76f1a03aa38ce73f9468344b0385946837749452948c065f7369676d6194680b681143087733aed28d6dca3f94869452948c025f44944e8c025f42944e8c075f626f756e6473946830289630000000000000000000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f9468344b034b0286946837749452948c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b028c095f6c725f616461707494888c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683028961800000000000000723c8b7fb8bdac3f5e4100bdae468abf41ad5f5c5df7c23f94683e4b034b0186946837749452948c075f455369676d6194683028964800000000000000e20a4e4667de713f60a4e983b5e2003f5b792354fbb88a3fe0a4e983b5e2003f66556f740f3f543f8e1451189084433f5b792354fbb88a3f8e1451189084433f66c6b152dc4a7f3f94683e4b094b0186946837749452948c065f566d65616e94473fd44379b9ad2f1c8c075f565369676d6194473f96fd4b21333f448c095f6574615f6d65616e94680b68114308305f6382b698ea3f94869452948c0a5f6574615f5369676d6194680b681143085f2c64e50e26ee3f94869452948c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394683028967001000000000000c03a89ff9f01000060eed4af9f010000686f4df520b71040bad725942cdf4440f6c0b5ec736bce3f9cddf6baea552a40713c28581910de3fd28492cb61842e405813e0a992961640d5c42e832d142240d0c1bd7421d10740928703da14e623406865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e9468344b2e85946837749452948c055f635f31649468302896300000000000000033d444a11df2f03f07146a13bb2c953f110efc4447a9de3f6502b99440adee3ff1517f81a9d78c3fa4207c89a73bf33f9468114b06859468377494529475622e" + "hex": "80059525070000000000008c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394680b681143083e39d84fb3e1e13f94869452948c035f633194680b681143088785f23a4daeb83f94869452948c045f636d7594680b681143089026bdad883caa3f94869452948c085f635f7369676d6194680b681143089c0fa27bde8dda3f94869452948c085f645f7369676d6194680b68114308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f77656967687473948c136e756d70792e5f636f72652e6e756d65726963948c0b5f66726f6d6275666665729493942896380000000000000038b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf94680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494624b0785948c014394749452948c085f705f7369676d619468302896180000000000000065a4e47691cad13faabe1587956ec5bf86a13289b9d1f33f94680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494624b0385946837749452948c035f706394683028961800000000000000d03b6fcede38c23f49bff8ba51bfc3bfeb49d7ba972cef3f94683e4b0385946837749452948c055f6d65616e94683028961800000000000000a87112fb011ae33fb149600a34dbde3f76f1a03aa38ce73f9468344b0385946837749452948c065f7369676d6194680b681143087733aed28d6dca3f94869452948c025f44944e8c025f42944e8c075f626f756e6473946830289630000000000000000000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f9468344b034b0286946837749452948c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b028c095f6c725f616461707494888c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e94683028961800000000000000723c8b7fb8bdac3f5e4100bdae468abf41ad5f5c5df7c23f94683e4b034b0186946837749452948c075f455369676d6194683028964800000000000000e20a4e4667de713f60a4e983b5e2003f5b792354fbb88a3fe0a4e983b5e2003f66556f740f3f543f8e1451189084433f5b792354fbb88a3f8e1451189084433f66c6b152dc4a7f3f94683e4b094b0186946837749452948c065f566d65616e94473fd44379b9ad2f1c8c075f565369676d6194473f96fd4b21333f448c095f6574615f6d65616e94680b68114308305f6382b698ea3f94869452948c0a5f6574615f5369676d6194680b681143085f2c64e50e26ee3f94869452948c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c7565739468302896700100000000000030ff86d10a020000c09cacd00a020000686f4df520b71040bad725942cdf4440f6c0b5ec736bce3f9cddf6baea552a40713c28581910de3fd28492cb61842e405813e0a992961640d5c42e832d142240d0c1bd7421d10740928703da14e6234000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009468344b2e85946837749452948c055f635f31649468302896300000000000000033d444a11df2f03f07146a13bb2c953f110efc4447a9de3f6502b99440adee3ff1517f81a9d78c3fa4207c89a73bf33f9468114b06859468377494529475622e" }, { "variant": "sepcma", "index": 1, - "hex": "80059515050000000000008c0d636d6165732e5f736570636d61948c06536570434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394473fe55555555555558c035f633194680b68114308ea57eb29b179c33f94869452948c045f636d7594680b68114308cd519e35113fcf3f94869452948c085f635f7369676d6194680b68114308af9a51ec74c4e23f94869452948c085f645f7369676d6194680b6811430858cd28763a62f93f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f77656967687473948c136e756d70792e5f636f72652e6e756d65726963948c0b5f66726f6d6275666665729493942896180000000000000039b370ce9abde23f39b370ce9abdd23f5b99b752be1cbf3f94680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494624b0385948c014394749452948c085f705f7369676d6194682d289610000000000000003443ac3a9644ca3fa3861a35e879b03f94680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494624b0285946834749452948c035f706394682d28961000000000000000706ff98d4294bb3f2e50cad2c5c4ab3f94683b4b0285946834749452948c055f6d65616e94682d28961000000000000000a955f886ee6de33f496429988d3ce03f9468314b0285946834749452948c065f7369676d6194680b6811430820404689cc75be3f94869452948c025f44944e8c025f4394682d289610000000000000000c79f4f2f074e73fb9b3eb57b918da3f94683b4b0285946834749452948c075f626f756e647394682d289620000000000000000000000000000000000000000000f03f0000000000000000000000000000f03f9468314b024b0286946834749452948c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b028c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682d28964001000000000000000000000000000000000000000000006ffd82dfd23ae33f5cb22198496c2a406c467a6fb487eb3f593eb163514b254000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009468314b28859468347494529475622e" + "hex": "80059515050000000000008c0d636d6165732e5f736570636d61948c06536570434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f636394473fe55555555555558c035f633194680b68114308ea57eb29b179c33f94869452948c045f636d7594680b68114308cd519e35113fcf3f94869452948c085f635f7369676d6194680b68114308af9a51ec74c4e23f94869452948c085f645f7369676d6194680b6811430858cd28763a62f93f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f77656967687473948c136e756d70792e5f636f72652e6e756d65726963948c0b5f66726f6d6275666665729493942896180000000000000039b370ce9abde23f39b370ce9abdd23f5b99b752be1cbf3f94680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494624b0385948c014394749452948c085f705f7369676d6194682d289610000000000000003443ac3a9644ca3fa3861a35e879b03f94680e8c02663894898887945294284b0368124e4e4e4affffffff4affffffff4b007494624b0285946834749452948c035f706394682d28961000000000000000706ff98d4294bb3f2e50cad2c5c4ab3f94683b4b0285946834749452948c055f6d65616e94682d28961000000000000000a955f886ee6de33f496429988d3ce03f9468314b0285946834749452948c065f7369676d6194680b6811430820404689cc75be3f94869452948c025f44944e8c025f4394682d289610000000000000000c79f4f2f074e73fb9b3eb57b918da3f94683b4b0285946834749452948c075f626f756e647394682d289620000000000000000000000000000000000000000000f03f0000000000000000000000000000f03f9468314b024b0286946834749452948c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b028c055f746f6c7894680b6811430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394682d28964001000000000000756d656e74732e0a20202020657870656ffd82dfd23ae33f5cb22198496c2a406c467a6fb487eb3f593eb163514b25403d302c207363616c653d312c206c623d4e6f6e652c2075623d4e6f6e652c20636f6e646974696f6e616c3d46616c73652c202a2a6b776473290a202020202020202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e209468314b28859468347494529475622e" }, { "variant": "cmawm", "index": 1, - "hex": "8005958a090000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f6363946811681743083e39d84fb3e1e13f94869452948c035f6331946811681743088785f23a4daeb83f94869452948c045f636d75946811681743089026bdad883caa3f94869452948c085f635f7369676d61946811681743089c0fa27bde8dda3f94869452948c085f645f7369676d6194681168174308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f77656967687473948c136e756d70792e5f636f72652e6e756d65726963948c0b5f66726f6d6275666665729493942896380000000000000038b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf9468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b007494624b0785948c014394749452948c085f705f7369676d6194683628961800000000000000bc6fd5b69744f03fe0bdcf4767a19e3f9cf5949f5b21e53f9468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b007494624b038594683d749452948c035f70639468362896180000000000000058f08d1e4e96f03ff0d7c4d6643aa2bf2284fc9bdb21e53f9468444b038594683d749452948c055f6d65616e94683628961800000000000000f763d28b1f84e53f72436f996606e13fc1b23ace127ce43f94683a4b038594683d749452948c065f7369676d61946811681743086e84386cd142c23f94869452948c025f44944e8c025f42944e8c075f626f756e6473946836289630000000000000000000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f94683a4b034b028694683d749452948c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e9468362896180000000000000000000000000000000000000000000000000000000000000094683a4b034b018694683d749452948c075f455369676d619468362896480000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000094683a4b094b018694683d749452948c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c75657394683628967001000000000000c03a89ff9f01000060eed4af9f0100004cbd040524700340d48fcb2292ab3740f5da124e0163e93fcf38f50b609223400cc2abc8c66f0240a09614d12e1232406263e2644cfa1840b75b2e25212543403d1daf09e40b0040aabef6d1702d41406865206f626a65637469766520696d70726f7665732e0a202020202020202020202020546869732076616c75652073686f756c64206265206e6f6e2d6e656761746976652e0a0a202020202e2e206e6f74653a3a0a2020202020202020416464656420696e2076322e382e3020617320616e206578706572696d656e74616c20666561747572652e2054686520696e74657266616365206d6179206368616e676520696e206e657765722076657273696f6e730a2020202020202020776974686f7574207072696f72206e6f746963652e205365652068747470733a2f2f6769746875622e636f6d2f6f7074756e612f6f7074756e612f72656c65617365732f7461672f76322e382e302e0a00616c2e94683a4b2e8594683d749452948c055f635f316494683628963000000000000000dff1a71c1e25ee3f39c3d295fd70a1bf707d30d2c41ad43f32a15abf8a6cef3f50fa6ecbb6cab13fdac02b5d3839e83f9468174b068594683d749452947562685e4b1e8c0d5f64697363726574655f69647894683628961000000000000000000000000000000001000000000000009468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b007494624b028594683d749452948c135f64697363726574655f73706163655f6c6f77946836289610000000000000000000000000000000000000000000000094683a4b028594683d749452948c145f64697363726574655f73706163655f73697a6594683628961000000000000000070000000000000005000000000000009468894b028594683d749452948c145f64697363726574655f73706163655f7374657094683628961000000000000000555555555555c53f000000000000d03f94683a4b028594683d749452948c0f5f636f6e74696e756f75735f6964789468362896080000000000000002000000000000009468894b018594683d749452948c115f636f6e74696e756f75735f7370616365946836289610000000000000000000000000000000000000000000f03f94683a4b014b028694683d749452948c075f6e5f7a64696d944b028c066d617267696e94473fa86186186186188c0b6d5f7a5f6c696d5f6c6f7794683628961000000000000000aaaaaaaaaaaae23f000000000000d83f94683a4b028594683d749452948c0a6d5f7a5f6c696d5f757094683628961000000000000000000000000000e83f000000000000e43f94683a4b028594683d749452948c025f4194683628961800000000000000ffffffffffffef3f050000000000f03f000000000000f03f94683a4b038594683d7494529475622e" + "hex": "8005958a090000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b038c085f706f7073697a65944b078c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308e4aa647ddc09024094869452948c035f6363946811681743083e39d84fb3e1e13f94869452948c035f6331946811681743088785f23a4daeb83f94869452948c045f636d75946811681743089026bdad883caa3f94869452948c085f635f7369676d61946811681743089c0fa27bde8dda3f94869452948c085f645f7369676d6194681168174308e783e89e77a3f63f94869452948c035f636d944b018c065f6368695f6e94473ff98ccf7402d8f78c085f77656967687473948c136e756d70792e5f636f72652e6e756d65726963948c0b5f66726f6d6275666665729493942896380000000000000038b370ce9abde23f38b370ce9abdd23f5a99b752be1cbf3f00000000000000004c692454e524dbbf45162a4f47a9e8bf0a807be2bc04f1bf9468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b007494624b0785948c014394749452948c085f705f7369676d6194683628961800000000000000bc6fd5b69744f03fe0bdcf4767a19e3f9cf5949f5b21e53f9468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b007494624b038594683d749452948c035f70639468362896180000000000000058f08d1e4e96f03ff0d7c4d6643aa2bf2284fc9bdb21e53f9468444b038594683d749452948c055f6d65616e94683628961800000000000000f763d28b1f84e53f72436f996606e13fc1b23ace127ce43f94683a4b038594683d749452948c065f7369676d61946811681743086e84386cd142c23f94869452948c025f44944e8c025f42944e8c075f626f756e6473946836289630000000000000000000000000000000000000000000f03f0000000000000000000000000000f03f0000000000000000000000000000f03f94683a4b034b028694683d749452948c115f6e5f6d61785f726573616d706c696e67944b1e8c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e9468362896180000000000000000000000000000000000000000000000000000000000000094683a4b034b018694683d749452948c075f455369676d619468362896480000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000094683a4b094b018694683d749452948c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b178c0f5f66756e686973745f76616c7565739468362896700100000000000030ff86d10a020000c09cacd00a0200004cbd040524700340d48fcb2292ab3740f5da124e0163e93fcf38f50b609223400cc2abc8c66f0240a09614d12e1232406263e2644cfa1840b75b2e25212543403d1daf09e40b0040aabef6d1702d4140000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000094683a4b2e8594683d749452948c055f635f316494683628963000000000000000dff1a71c1e25ee3f39c3d295fd70a1bf707d30d2c41ad43f32a15abf8a6cef3f50fa6ecbb6cab13fdac02b5d3839e83f9468174b068594683d749452947562685e4b1e8c0d5f64697363726574655f69647894683628961000000000000000000000000000000001000000000000009468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b007494624b028594683d749452948c135f64697363726574655f73706163655f6c6f77946836289610000000000000000000000000000000000000000000000094683a4b028594683d749452948c145f64697363726574655f73706163655f73697a6594683628961000000000000000070000000000000005000000000000009468894b028594683d749452948c145f64697363726574655f73706163655f7374657094683628961000000000000000555555555555c53f000000000000d03f94683a4b028594683d749452948c0f5f636f6e74696e756f75735f6964789468362896080000000000000002000000000000009468894b018594683d749452948c115f636f6e74696e756f75735f7370616365946836289610000000000000000000000000000000000000000000f03f94683a4b014b028694683d749452948c075f6e5f7a64696d944b028c066d617267696e94473fa86186186186188c0b6d5f7a5f6c696d5f6c6f7794683628961000000000000000aaaaaaaaaaaae23f000000000000d83f94683a4b028594683d749452948c0a6d5f7a5f6c696d5f757094683628961000000000000000000000000000e83f000000000000e43f94683a4b028594683d749452948c025f4194683628961800000000000000ffffffffffffef3f050000000000f03f000000000000f03f94683a4b038594683d7494529475622e" }, { "variant": "cmawm_continuous", "index": 1, - "hex": "80059505080000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394681168174308cf08f6cc59fce33f94869452948c035f633194681168174308f572bcb3fdd0c33f94869452948c045f636d7594681168174308031b52bcb49fad3f94869452948c085f635f7369676d61946811681743089886065d9f8edc3f94869452948c085f645f7369676d6194681168174308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f77656967687473948c136e756d70792e5f636f72652e6e756d65726963948c0b5f66726f6d627566666572949394289630000000000000003d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf9468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b007494624b0685948c014394749452948c085f705f7369676d619468362896100000000000000030ba7edbe777ac3f7e9208894287ddbf9468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b007494624b028594683d749452948c035f7063946836289610000000000000004c4c3eb41795b8bf2cd08d1bceb3dcbf9468444b028594683d749452948c055f6d65616e946836289610000000000000001151955a7a7ae23f8a4d8f2114cfdc3f94683a4b028594683d749452948c065f7369676d6194681168174308cce640885c64c03f94869452948c025f44944e8c025f42944e8c075f626f756e6473946836289620000000000000000000000000000000000000000000f03f0000000000000000000000000000f03f94683a4b024b028694683d749452948c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e946836289610000000000000000000000000000000000000000000000094683a4b024b018694683d749452948c075f455369676d6194683628962000000000000000000000000000000000000000000000000000000000000000000000000000000094683a4b044b018694683d749452948c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394683628964001000000000000000000000000000000000000000000006ffd82dfd23ae33f5cb22198496c2a40041a711d25dabf3f0b2cc86201062a4090ad58038fb6d63f2d0a5ba7f6c31240d2929d6243fa8f3fe6d0605ce4a0f93f488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000094683a4b288594683d749452948c055f635f316494683628961800000000000000a1adf4de218eec3fa8494e5b8106c0bf1aba6f385e3ae43f9468174b038594683d749452947562685e4b148c0d5f64697363726574655f696478946836289600000000000000009468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b007494624b008594683d749452948c135f64697363726574655f73706163655f6c6f779468362896000000000000000094683a4b008594683d749452948c145f64697363726574655f73706163655f73697a65946836289600000000000000009468894b008594683d749452948c145f64697363726574655f73706163655f737465709468362896000000000000000094683a4b008594683d749452948c0f5f636f6e74696e756f75735f69647894683628961000000000000000000000000000000001000000000000009468894b028594683d749452948c115f636f6e74696e756f75735f7370616365946836289620000000000000000000000000000000000000000000f03f0000000000000000000000000000f03f94683a4b024b028694683d749452948c075f6e5f7a64696d944b0075622e" + "hex": "80059505080000000000008c0c636d6165732e5f636d61776d948c05434d41774d9493942981947d94288c045f636d61948c0a636d6165732e5f636d61948c03434d419493942981947d94288c065f6e5f64696d944b028c085f706f7073697a65944b068c035f6d75944b038c075f6d755f656666948c166e756d70792e5f636f72652e6d756c74696172726179948c067363616c61729493948c056e756d7079948c0564747970659493948c02663894898887945294284b038c013c944e4e4e4affffffff4affffffff4b007494624308b753c6a5983a004094869452948c035f636394681168174308cf08f6cc59fce33f94869452948c035f633194681168174308f572bcb3fdd0c33f94869452948c045f636d7594681168174308031b52bcb49fad3f94869452948c085f635f7369676d61946811681743089886065d9f8edc3f94869452948c085f645f7369676d6194681168174308a6a141d7a723f73f94869452948c035f636d944b018c065f6368695f6e94473ff411804baabfb48c085f77656967687473948c136e756d70792e5f636f72652e6e756d65726963948c0b5f66726f6d627566666572949394289630000000000000003d81341aa762e43fed14472b6636d23f67a23f812e11b43f94d816a51c54d2bfe3fe9c65897ae8bf916ebfbfe67ef2bf9468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b007494624b0685948c014394749452948c085f705f7369676d619468362896100000000000000030ba7edbe777ac3f7e9208894287ddbf9468148c02663894898887945294284b0368184e4e4e4affffffff4affffffff4b007494624b028594683d749452948c035f7063946836289610000000000000004c4c3eb41795b8bf2cd08d1bceb3dcbf9468444b028594683d749452948c055f6d65616e946836289610000000000000001151955a7a7ae23f8a4d8f2114cfdc3f94683a4b028594683d749452948c065f7369676d6194681168174308cce640885c64c03f94869452948c025f44944e8c025f42944e8c075f626f756e6473946836289620000000000000000000000000000000000000000000f03f0000000000000000000000000000f03f94683a4b024b028694683d749452948c115f6e5f6d61785f726573616d706c696e67944b148c025f67944b028c095f6c725f616461707494898c065f616c70686194473ff66666666666668c0a5f626574615f6d65616e94473fb999999999999a8c0b5f626574615f5369676d6194473f9eb851eb851eb88c065f67616d6d6194473fb999999999999a8c065f456d65616e946836289610000000000000000000000000000000000000000000000094683a4b024b018694683d749452948c075f455369676d6194683628962000000000000000000000000000000000000000000000000000000000000000000000000000000094683a4b044b018694683d749452948c065f566d65616e944700000000000000008c075f565369676d61944700000000000000008c095f6574615f6d65616e94473ff00000000000008c0a5f6574615f5369676d6194473ff00000000000008c055f746f6c789468116817430816383daccc74473d94869452948c075f746f6c787570944740c38800000000008c075f746f6c66756e94473d719799812dea118c105f746f6c636f6e646974696f6e636f76944742d6bcc41e9000008c0d5f66756e686973745f7465726d944b148c0f5f66756e686973745f76616c75657394683628964001000000000000756d656e74732e0a20202020657870656ffd82dfd23ae33f5cb22198496c2a40041a711d25dabf3f0b2cc86201062a4090ad58038fb6d63f2d0a5ba7f6c31240d2929d6243fa8f3fe6d0605ce4a0f93f488976a5782fb33fd6681cf58152e13ff4bb1b00a72e8c3f183c06de66e7d03f202045787065637465642076616c7565206f6620612066756e6374696f6e20286f66206f6e6520617267756d656e74292077697468207265737065637420746f2074686520646973747269627574696f6e2e0a202020206d656469616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d656469616e206f662074686520646973747269627574696f6e2e0a202020206d65616e28252873686170657329732c206c6f633d302c207363616c653d31290a20202020202020204d65616e2094683a4b288594683d749452948c055f635f316494683628961800000000000000a1adf4de218eec3fa8494e5b8106c0bf1aba6f385e3ae43f9468174b038594683d749452947562685e4b148c0d5f64697363726574655f696478946836289600000000000000009468148c02693894898887945294284b0368184e4e4e4affffffff4affffffff4b007494624b008594683d749452948c135f64697363726574655f73706163655f6c6f779468362896000000000000000094683a4b008594683d749452948c145f64697363726574655f73706163655f73697a65946836289600000000000000009468894b008594683d749452948c145f64697363726574655f73706163655f737465709468362896000000000000000094683a4b008594683d749452948c0f5f636f6e74696e756f75735f69647894683628961000000000000000000000000000000001000000000000009468894b028594683d749452948c115f636f6e74696e756f75735f7370616365946836289620000000000000000000000000000000000000000000f03f0000000000000000000000000000f03f94683a4b024b028694683d749452948c075f6e5f7a64696d944b0075622e" } ] } \ No newline at end of file diff --git a/test/OptunaSharp.Tests/oracle/cpython_order.json b/test/OptunaSharp.Tests/oracle/cpython_order.json new file mode 100644 index 0000000..23dba4a --- /dev/null +++ b/test/OptunaSharp.Tests/oracle/cpython_order.json @@ -0,0 +1 @@ +{"python":"3.12.12","set_difference":[{"n":16,"visited":"7/Y=","running":"AAA=","unvisited":{"count":3,"items":[8,11,4]},"unfinished":{"count":3,"items":[8,11,4]}},{"n":0,"visited":"","running":"","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":0,"visited":"","running":"","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":1,"visited":"AA==","running":"AA==","unvisited":{"count":1,"items":[0]},"unfinished":{"count":1,"items":[0]}},{"n":1,"visited":"AQ==","running":"AA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":2,"visited":"AA==","running":"AA==","unvisited":{"count":2,"items":[0,1]},"unfinished":{"count":2,"items":[0,1]}},{"n":2,"visited":"AQ==","running":"Ag==","unvisited":{"count":0,"items":[]},"unfinished":{"count":1,"items":[1]}},{"n":5,"visited":"AA==","running":"AA==","unvisited":{"count":5,"items":[0,1,2,3,4]},"unfinished":{"count":5,"items":[0,1,2,3,4]}},{"n":5,"visited":"FQ==","running":"Eg==","unvisited":{"count":1,"items":[3]},"unfinished":{"count":2,"items":[1,3]}},{"n":7,"visited":"AA==","running":"AA==","unvisited":{"count":7,"items":[0,1,2,3,4,5,6]},"unfinished":{"count":7,"items":[0,1,2,3,4,5,6]}},{"n":7,"visited":"VQ==","running":"Eg==","unvisited":{"count":2,"items":[3,5]},"unfinished":{"count":3,"items":[1,3,5]}},{"n":8,"visited":"AA==","running":"AA==","unvisited":{"count":8,"items":[0,1,2,3,4,5,6,7]},"unfinished":{"count":8,"items":[0,1,2,3,4,5,6,7]}},{"n":8,"visited":"VQ==","running":"kg==","unvisited":{"count":2,"items":[3,5]},"unfinished":{"count":4,"items":[1,3,5,7]}},{"n":9,"visited":"AAA=","running":"AAA=","unvisited":{"count":9,"items":[0,1,2,3,4,5,6,7,8]},"unfinished":{"count":9,"items":[0,1,2,3,4,5,6,7,8]}},{"n":9,"visited":"VQE=","running":"kgA=","unvisited":{"count":2,"items":[3,5]},"unfinished":{"count":4,"items":[1,3,5,7]}},{"n":31,"visited":"AAAAAA==","running":"AAAAAA==","unvisited":{"count":31,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30]},"unfinished":{"count":31,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30]}},{"n":31,"visited":"VVVVVQ==","running":"kiRJEg==","unvisited":{"count":10,"items":[3,5,9,11,15,17,21,23,27,29]},"unfinished":{"count":15,"items":[1,3,5,7,9,11,13,15,17,19,21,23,25,27,29]}},{"n":32,"visited":"AAAAAA==","running":"AAAAAA==","unvisited":{"count":32,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31]},"unfinished":{"count":32,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31]}},{"n":32,"visited":"VVVVVQ==","running":"kiRJkg==","unvisited":{"count":10,"items":[3,5,9,11,15,17,21,23,27,29]},"unfinished":{"count":16,"items":[1,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31]}},{"n":33,"visited":"AAAAAAA=","running":"AAAAAAA=","unvisited":{"count":33,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32]},"unfinished":{"count":33,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32]}},{"n":33,"visited":"VVVVVQE=","running":"kiRJkgA=","unvisited":{"count":10,"items":[3,5,9,11,15,17,21,23,27,29]},"unfinished":{"count":16,"items":[1,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31]}},{"n":64,"visited":"AAAAAAAAAAA=","running":"AAAAAAAAAAA=","unvisited":{"count":64,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63]},"unfinished":{"count":64,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63]}},{"n":64,"visited":"VVVVVVVVVVU=","running":"kiRJkiRJkiQ=","unvisited":{"count":21,"items":[3,5,9,11,15,17,21,23,27,29,33,35,39,41,45,47,51,53,57,59,63]},"unfinished":{"count":32,"items":[1,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,43,45,47,49,51,53,55,57,59,61,63]}},{"n":100,"visited":"AAAAAAAAAAAAAAAAAA==","running":"AAAAAAAAAAAAAAAAAA==","unvisited":{"count":100,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99]},"unfinished":{"count":100,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99]}},{"n":100,"visited":"VVVVVVVVVVVVVVVVBQ==","running":"kiRJkiRJkiRJkiRJAg==","unvisited":{"count":33,"items":[3,5,9,11,15,17,21,23,27,29,33,35,39,41,45,47,51,53,57,59,63,65,69,71,75,77,81,83,87,89,93,95,99]},"unfinished":{"count":50,"items":[1,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,43,45,47,49,51,53,55,57,59,61,63,65,67,69,71,73,75,77,79,81,83,85,87,89,91,93,95,97,99]}},{"n":259,"visited":"BGCkKI0CHzaQAwwwsAAFJFQQEC4hUYSKkcxhBBFgSIAE","running":"H5mDiqWRSUSyJ/8UXwj6TvSRjBDNZuJ1gqOmj5Km/wgB","unvisited":{"count":93,"items":[5,6,7,9,10,19,20,22,24,26,28,30,33,36,38,42,43,45,46,53,55,56,59,63,64,66,67,70,75,76,78,79,88,89,91,94,95,104,105,106,108,109,110,111,120,124,127,128,129,131,137,138,139,141,142,144,145,149,150,152,158,159,161,164,171,175,176,179,180,194,195,197,198,204,211,212,220,221,222,226,227,229,230,232,235,236,248,249,250,252,253,254,257]},"unfinished":{"count":184,"items":[0,1,3,4,5,6,7,8,9,10,11,12,15,16,17,19,20,22,24,25,26,28,30,31,33,36,37,38,40,42,43,44,45,46,47,53,54,55,56,59,62,63,64,65,66,67,69,70,74,75,76,77,78,79,80,81,84,85,86,87,88,89,90,91,94,95,96,97,98,99,102,104,105,106,107,108,109,110,111,113,115,116,117,118,119,120,121,123,124,126,127,128,129,131,133,135,136,137,138,139,141,142,143,144,145,146,147,149,150,151,152,156,158,159,161,162,163,164,166,167,169,170,171,173,175,176,177,179,180,181,182,184,186,188,189,190,193,194,195,197,198,200,201,204,205,209,210,211,212,215,216,217,219,220,221,222,223,225,226,227,229,230,231,232,233,234,235,236,239,240,241,242,244,245,247,248,249,250,251,252,253,254,256,257]}},{"n":28,"visited":"AAAAAA==","running":"AEAcAA==","unvisited":{"count":24,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,15,16,17,21,22,23,24,25,26,27]},"unfinished":{"count":28,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27]}},{"n":170,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","running":"AABAAAAAYRggCAAABCQAAAAAACAIAQ==","unvisited":{"count":156,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,49,50,51,52,55,56,57,58,61,62,63,64,65,66,67,68,70,71,72,73,74,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,99,100,101,102,103,104,105,107,108,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,158,159,160,161,162,164,165,166,167,169]},"unfinished":{"count":170,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169]}},{"n":16,"visited":"//8=","running":"AAA=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":6,"visited":"AA==","running":"AA==","unvisited":{"count":6,"items":[0,1,2,3,4,5]},"unfinished":{"count":6,"items":[0,1,2,3,4,5]}},{"n":2759,"visited":"MetFNN/ti/RL0yx4Z7l2AVF653zJdKTC8erzL7t1t8DY//P5Snn5g/bf3MeA2dI31R99WO1RpbfvuBc+wEH+8zvyNn/oMzGVS6Zr+/v6Pe/dwwNf+G+cftvM/9OPhvGi/ImXLj2/t3Xud12/rd3XTKSEn+/rfDQ5XE1hGz96PjmH/3719vzOM+9d6vLl6Pfk99kF+5UlbrTfPyDrOze8N/72K753ttN9qqef0K58Tmu387vddOB39XIska49iHafrVp+VDNLKfla+P7rRmjw7T79Of9i7rkbHt8f+id2n8st681+vgZufAMK1z9vPPnhy+nr/GsKUx/dzt/vz+V9qdrDXWs227Nbrc63PXli9p1viX97xpreO2eK5w9jP+rM33Hy5JEa6P/naoaciU4xyw+o78Z9jylP/W3S1pv536//kwzj9eLz5u/UJzK3+HpjWt9bHDPfa7NG","running":"1cyCuvIC8nsqrNd22uMUsg+YBfVF8uTFxz39sffCqi0D3y2zKHSP2sYDcGsHIPGGwMF4N4zViPR6tIJWxhFfuRqkqSweaiWgiVv/7Km7JkCUj52YI/rvyLOhQmgGuvXdmJmycRQ293cyTKmfKUKXvF6N3/gHfEZyQSXO7+Whwn2Vtbjzo1AS3TMVi5gEGXxyCSp4pZDbqYs/AIHNCN7fXVjJb0YWqziZikkF06VPaLrE/YXY9GpkzchQWAnXGDdlBFUgD1s/5PJGFwvCPHuCQijds+O/CoRwj0sJGixaM0j4qudFQEwdzU1voXje/vKucc25+xlKBkZjkAH1yNJYt333zQG7XLKPvEzzUtWG3RHSIwSW8arOvOT0jDuPFMAPvZupNJ43AQtKJA3wUfYmJNv1WLQ9y31y2YcItjsM3hssZEA5GCEvxSXkkJqqXBbSd3zq91FYCCV2","unvisited":{"count":557,"head":[1,3,2059,12,2065,19,20,21,2069,24,2074,2076,30,2079,2086,44,2093,50,2098,2099,2102,2109,2113,66,68,2118,71,2120,2124,2125,2131,88],"tail":[1868,1871,1875,1887,1896,1906,1916,1922,1929,1932,1938,1954,1959,1960,1962,1964,1965,1967,1971,1973,1975,1981,1983,1992,1997,2005,2020,2021,2027,2033,2039,2046],"sha256":"2d596ad3f75d05e09694d0dad37b87382e32dd7d7ef2acebe47768bf06e498e3"},"unfinished":{"count":1080,"head":[2048,1,2,3,2050,2053,6,7,10,2058,12,2059,2060,2061,17,2065,19,20,21,2069,23,24,25,2071,27,2074,2076,30,31,2079,2080,2083],"tail":[1959,1960,1962,1964,1965,1966,1967,1970,1971,1973,1975,1981,1982,1983,1985,1989,1992,1996,1997,2005,2012,2020,2021,2025,2027,2028,2033,2039,2041,2042,2044,2046],"sha256":"6032df9971dc49b0ce857de91dd78a4d0aa90269cd4fc2d1b0d31fa4549e183b"}},{"n":45,"visited":"AAAAAgQQ","running":"75fozbQQ","unvisited":{"count":18,"items":[32,33,35,4,38,40,41,42,11,43,13,14,16,17,18,20,28,29]},"unfinished":{"count":42,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,26,27,28,29,30,31,32,33,35,36,37,38,39,40,41,42,43]}},{"n":96,"visited":"fe//r//u//79u//W","running":"ABAEEAgAiAAAEAAA","unvisited":{"count":12,"items":[65,1,7,40,88,74,44,78,56,91,93,30]},"unfinished":{"count":14,"items":[1,65,7,40,74,91,12,44,78,56,88,28,93,30]}},{"n":17,"visited":"qasA","running":"AAAA","unvisited":{"count":8,"items":[1,2,4,6,10,12,14,16]},"unfinished":{"count":8,"items":[1,2,4,6,10,12,14,16]}},{"n":38,"visited":"a3zXnBc=","running":"AAABAAA=","unvisited":{"count":14,"items":[2,35,4,37,7,8,9,15,19,21,24,25,29,30]},"unfinished":{"count":14,"items":[2,35,4,37,7,8,9,15,19,21,24,25,29,30]}},{"n":878,"visited":"/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////z8=","running":"ACQAAAQAAAAAABAABIAAAAAiAgAEAAgAAAAEAAECoAIIA5CAAgCAAgAAAAEBAAACABgABACIIABACAAIUUAAASAAAAAAAEASAIBAEMAgAAQAAEAAAAAAADAAQABgAAEQAAIAAQQACAAAQA4AAgA=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":26,"visited":"f/b/Aw==","running":"IAAAAA==","unvisited":{"count":3,"items":[8,11,7]},"unfinished":{"count":3,"items":[8,11,7]}},{"n":183,"visited":"REQAgJACjIAAIAAgKQwEEAQiAAAAgEo=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":155,"items":[0,1,3,4,5,7,8,9,11,12,13,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,32,33,34,35,37,38,40,42,43,44,45,46,47,48,49,52,53,54,56,57,58,59,60,61,62,64,65,66,67,68,69,70,71,72,73,74,75,76,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,94,95,97,98,100,102,103,104,105,108,109,110,111,112,113,115,116,117,118,119,120,121,122,123,125,126,127,128,129,131,132,133,134,135,136,138,139,140,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,176,178,180,181]},"unfinished":{"count":155,"items":[0,1,3,4,5,7,8,9,11,12,13,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,32,33,34,35,37,38,40,42,43,44,45,46,47,48,49,52,53,54,56,57,58,59,60,61,62,64,65,66,67,68,69,70,71,72,73,74,75,76,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,94,95,97,98,100,102,103,104,105,108,109,110,111,112,113,115,116,117,118,119,120,121,122,123,125,126,127,128,129,131,132,133,134,135,136,138,139,140,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,176,178,180,181]}},{"n":229,"visited":"//u//////////f/3////////////////////vx8=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":5,"items":[22,73,10,91,222]},"unfinished":{"count":5,"items":[73,10,22,91,222]}},{"n":252,"visited":"ShCkAhGAEc4iKgImEAMwQmkwKPYUBIDBGgKGYxdhQAM=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":176,"items":[0,2,4,5,7,8,9,10,11,13,14,15,16,17,19,20,22,24,26,27,28,29,30,31,33,34,35,37,38,39,40,41,42,43,44,45,46,49,50,51,53,54,55,56,60,61,64,66,67,68,70,71,72,74,76,78,79,80,82,83,84,85,86,87,88,91,92,94,95,96,97,98,99,101,102,103,106,107,108,109,110,111,112,113,114,115,118,119,120,122,123,124,125,127,129,130,132,135,136,137,138,139,142,143,144,145,146,148,150,151,152,155,160,161,163,165,166,167,168,169,171,172,173,174,175,176,177,178,179,180,181,182,185,186,187,188,189,192,194,197,198,199,200,202,203,204,205,206,207,208,211,212,213,214,218,219,220,223,227,229,230,231,233,234,235,236,239,240,241,242,243,244,245,247,250,251]},"unfinished":{"count":176,"items":[0,2,4,5,7,8,9,10,11,13,14,15,16,17,19,20,22,24,26,27,28,29,30,31,33,34,35,37,38,39,40,41,42,43,44,45,46,49,50,51,53,54,55,56,60,61,64,66,67,68,70,71,72,74,76,78,79,80,82,83,84,85,86,87,88,91,92,94,95,96,97,98,99,101,102,103,106,107,108,109,110,111,112,113,114,115,118,119,120,122,123,124,125,127,129,130,132,135,136,137,138,139,142,143,144,145,146,148,150,151,152,155,160,161,163,165,166,167,168,169,171,172,173,174,175,176,177,178,179,180,181,182,185,186,187,188,189,192,194,197,198,199,200,202,203,204,205,206,207,208,211,212,213,214,218,219,220,223,227,229,230,231,233,234,235,236,239,240,241,242,243,244,245,247,250,251]}},{"n":2085,"visited":"YMXWEagQIMWSVEUJCRsiABJYBKk40YORmISA3sjgQRKSUegsQaQKNiMREiELEACqiERABdgBQWIkVAIrAas6AJAOAQUDBQrAOAgJIQJgACIBGeBNkXgWEYgBliEiRIQwAp4M/AUqBF7qHRtQLpJAJUAANGgRoEgFgYI8ADhCySAZMAm0GIkYIaxBYQARIhQM0wgCCIcUlBACEEgQgjABZEl1IBkBRTBpcEAStVmkVEAZAqCYN1M4GHTQCKUCcBODmDYJKAAOAUMnwJgEwNRqcw0Fy3gQEWDgESLRScCpAjJRQGGQET1D0wgWiuEmhEFSgFhMBIMChshgaIKzQEAQKJEODIgI","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":1434,"head":[0,1,2,3,4,7,9,11,12,13,16,19,21,25,26,27,29,30,31,32,33,34,36,38,40,41,42,43,45,46,47,48],"tail":[2040,2041,2042,2044,2046,2047,2049,2050,2051,2053,2054,2056,2060,2061,2062,2063,2064,2065,2068,2069,2070,2071,2072,2073,2074,2076,2077,2078,2080,2081,2082,2084],"sha256":"efe68257e02e9a4a4cba3b1724d0726bbceee5f593e877866310cb1333d948fc"},"unfinished":{"count":1434,"head":[0,1,2,3,4,7,9,11,12,13,16,19,21,25,26,27,29,30,31,32,33,34,36,38,40,41,42,43,45,46,47,48],"tail":[2040,2041,2042,2044,2046,2047,2049,2050,2051,2053,2054,2056,2060,2061,2062,2063,2064,2065,2068,2069,2070,2071,2072,2073,2074,2076,2077,2078,2080,2081,2082,2084],"sha256":"efe68257e02e9a4a4cba3b1724d0726bbceee5f593e877866310cb1333d948fc"}},{"n":230,"visited":"AwECAAEDOBkBAEAAAlQEAAoQAAIQAAAAAEQAQBg=","running":"AAAAAAAAAAAAAAQAAAAABCAAAAAAAAAkCAAAAAA=","unvisited":{"count":194,"items":[2,3,4,5,6,7,9,10,11,12,13,14,15,16,18,19,20,21,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38,39,42,43,44,45,46,47,48,49,50,54,55,57,58,61,62,63,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,83,84,85,87,88,89,90,91,92,93,94,95,96,98,99,100,101,102,103,104,105,107,109,111,112,113,115,116,117,118,119,120,121,123,124,125,126,127,128,130,132,134,135,136,137,138,139,141,142,143,144,145,146,147,148,149,150,151,152,154,155,156,157,158,159,160,161,162,163,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,187,188,190,191,192,193,194,196,197,198,199,200,201,203,204,205,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,223,224,225,226,229]},"unfinished":{"count":200,"items":[2,3,4,5,6,7,9,10,11,12,13,14,15,16,18,19,20,21,22,23,24,25,26,27,28,29,30,31,33,34,35,36,37,38,39,42,43,44,45,46,47,48,49,50,54,55,57,58,61,62,63,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,87,88,89,90,91,92,93,94,95,96,98,99,100,101,102,103,104,105,107,109,111,112,113,115,116,117,118,119,120,121,122,123,124,125,126,127,128,130,132,133,134,135,136,137,138,139,141,142,143,144,145,146,147,148,149,150,151,152,154,155,156,157,158,159,160,161,162,163,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,203,204,205,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,223,224,225,226,229]}},{"n":139,"visited":"//////////////////////8H","running":"AAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":20,"visited":"AAkE","running":"nEoN","unvisited":{"count":9,"items":[0,1,5,6,10,12,13,15,17]},"unfinished":{"count":17,"items":[0,1,2,3,4,5,6,7,9,10,12,13,14,15,16,17,19]}},{"n":152,"visited":"AAAAAAAAAAAAAAAAAAAAAIAAAA==","running":"AAAAAAREgAAAAAAAQCAIDgAghA==","unvisited":{"count":138,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,35,36,37,38,39,40,41,43,44,45,47,48,49,50,51,52,53,54,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,103,104,105,106,107,108,110,111,112,113,114,116,117,118,119,120,124,125,126,127,128,129,130,131,132,133,134,136,137,138,139,140,142,143,144,145,147,148,149,150]},"unfinished":{"count":151,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151]}},{"n":17,"visited":"AAAA","running":"AAAA","unvisited":{"count":17,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]},"unfinished":{"count":17,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]}},{"n":207,"visited":"gAAAAAAAAAAgAAAAAAAAAAAACAAAAAAAAAA=","running":"AAACBAAAABQGIAAAAQAAAEAAAAQQAAAEAQA=","unvisited":{"count":191,"items":[0,1,2,3,4,5,6,8,9,10,11,12,13,14,15,16,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,59,61,62,63,64,67,68,70,71,72,73,74,75,76,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,135,136,137,138,139,140,141,142,143,144,145,146,148,149,150,151,152,153,155,156,157,158,159,160,161,162,163,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,187,188,189,190,191,193,194,195,196,197,198,199,200,201,202,203,204,205,206]},"unfinished":{"count":204,"items":[0,1,2,3,4,5,6,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206]}},{"n":12,"visited":"AAA=","running":"IAA=","unvisited":{"count":11,"items":[0,1,2,3,4,6,7,8,9,10,11]},"unfinished":{"count":12,"items":[0,1,2,3,4,5,6,7,8,9,10,11]}},{"n":2144,"visited":"sf//l+v//9+6f/7///vf//9////9n/339/7/33//75/v3/////y1r//3r/v77r//+7a+///933v//f////+vf///v9b//v//f/f//v2////t////157/73/+/9+//7/7/nd///////ffv/9/n/99/7//f/////v//f////19Wf//X/f77/9/7//v9//33/v33//////1/7/v/f/bz////fN7o32ev+///+f/7+zf/7/3/+73/7f7/bP/X//v///////q9//Xb//+////v/V////3/+/8f73//////73/3/+//9/5/9/9f//v3X/X///f////////+39//X/9/v//3973/99v//+/////+w==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":222,"items":[2048,1,2,3,2053,6,2059,1037,1039,1552,1554,1043,1556,534,536,1050,27,539,29,30,541,1563,2077,34,36,1060,2084,2087,552,1579,1581,1588,1079,1591,1084,61,2110,64,1600,66,70,583,587,1100,79,80,1107,600,2138,609,1123,1638,1641,106,1643,1133,622,1138,117,1655,1147,641,644,1157,1675,143,1692,1696,161,1697,675,677,680,1193,1195,173,174,685,686,177,1711,1713,1718,187,700,1214,195,1220,711,200,712,1225,1242,221,733,1245,1761,1252,1253,742,231,1766,244,1781,758,1273,762,253,254,768,1282,1283,260,1798,1290,779,269,783,1295,1298,1299,1300,1813,1302,791,1305,1817,1818,1311,1312,1317,1318,296,297,1837,1326,305,1841,307,1332,310,827,316,318,1855,837,331,1355,1356,846,1868,1873,340,1877,342,346,1372,863,1376,1377,354,1887,1380,869,870,1891,360,1893,364,1389,881,374,887,1917,1406,386,1411,902,392,395,398,400,1424,1428,406,919,1435,425,1451,1454,946,1458,1970,437,1465,442,447,1983,961,1474,1475,1478,1991,457,1993,1493,1495,2007,2009,2016,993,1508,1001,1007,1009,1010,500,1013,502,1015,2045,511]},"unfinished":{"count":222,"items":[2048,1,2,3,2053,6,2059,1037,1039,1552,1554,1043,1556,534,536,1050,27,539,29,30,541,1563,2077,34,36,1060,2084,2087,552,1579,1581,1588,1079,1591,1084,61,2110,64,1600,66,70,583,587,1100,79,80,1107,600,2138,609,1123,1638,1641,106,1643,1133,622,1138,117,1655,1147,641,644,1157,1675,143,1692,1696,161,1697,675,677,680,1193,1195,173,174,685,686,177,1711,1713,1718,187,700,1214,195,1220,711,200,712,1225,1242,221,733,1245,1761,1252,1253,742,231,1766,244,1781,758,1273,762,253,254,768,1282,1283,260,1798,1290,779,269,783,1295,1298,1299,1300,1813,1302,791,1305,1817,1818,1311,1312,1317,1318,296,297,1837,1326,305,1841,307,1332,310,827,316,318,1855,837,331,1355,1356,846,1868,1873,340,1877,342,346,1372,863,1376,1377,354,1887,1380,869,870,1891,360,1893,364,1389,881,374,887,1917,1406,386,1411,902,392,395,398,400,1424,1428,406,919,1435,425,1451,1454,946,1458,1970,437,1465,442,447,1983,961,1474,1475,1478,1991,457,1993,1493,1495,2007,2009,2016,993,1508,1001,1007,1009,1010,500,1013,502,1015,2045,511]}},{"n":117,"visited":"///////////9//////sf","running":"AAAAAAAAAAAAAAAAAAAA","unvisited":{"count":2,"items":[65,106]},"unfinished":{"count":2,"items":[65,106]}},{"n":291,"visited":"RAxIIAqYAAAAQAAABEAUAAGIAIQgAARIABARAACAQMCAxgASAA==","running":"UUCiOoOGA+g/BFDQxh127AYkKjO6LcskWf3aeAk4X380hWsHBw==","unvisited":{"count":131,"items":[1,3,5,7,8,9,12,13,15,16,18,20,24,26,30,31,34,36,37,38,40,45,46,50,51,52,53,54,55,56,57,58,60,70,71,72,73,75,76,77,79,80,81,82,83,85,87,88,89,90,91,93,96,99,100,101,105,109,111,112,115,119,120,121,124,131,132,133,134,135,136,137,140,142,144,146,148,150,151,155,158,160,162,166,169,172,174,175,180,181,184,185,188,191,193,194,197,199,201,210,213,216,217,218,223,225,226,228,229,230,231,232,233,234,238,245,247,256,257,259,262,267,268,269,274,276,279,283,285,286,287]},"unfinished":{"count":251,"items":[0,1,3,4,5,7,8,9,12,13,14,15,16,17,18,20,21,23,24,25,26,27,28,30,31,32,34,36,37,38,39,40,41,42,45,46,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,99,100,101,102,103,104,105,106,107,108,109,111,112,113,115,117,118,119,120,121,122,123,124,125,126,127,129,130,131,132,133,134,135,136,137,138,140,141,142,144,145,146,147,148,149,150,151,152,153,155,156,157,158,160,161,162,163,164,166,167,168,169,170,171,172,173,174,175,176,177,179,180,181,182,183,184,185,186,188,189,191,192,193,194,195,196,197,198,199,200,201,202,203,205,206,207,209,210,211,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,240,241,242,243,244,245,247,248,249,250,251,252,253,256,257,258,259,260,261,262,264,267,268,269,272,273,274,275,276,277,278,279,280,282,283,285,286,287,288,289,290]}},{"n":159,"visited":"/////f///////////////////38=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":1,"items":[25]},"unfinished":{"count":1,"items":[25]}},{"n":37,"visited":"AAAAAAA=","running":"AAAAAAA=","unvisited":{"count":37,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36]},"unfinished":{"count":37,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36]}},{"n":21,"visited":"//8f","running":"AAAA","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":841,"visited":"UQIAJAEgAgBAAAABACCgAhgAAAAAABQAAGABACAAIAIgCQgAAACABAAoVUEAQACwAAAgAEAQAAogAQEIkAAAAYAAAAAEAAAAQAABAChCAAAgAAAQAICBABAgAAEAAAkAAAEwKAAAAgAEAA==","running":"jCTeulK+UbKxs4LrhFlgNk8kd1FfAX6dZMb9KVvoDcxcXZ89YhnPFmvJZAqlSU3KE2pnMlQDiPLbRKteXa01pNJgRVzlu/jFMA76/XKe1e/28jRffwp6BuDolw3gqQtKQXQFWtxYOWZFAQ==","unvisited":{"count":377,"items":[1,5,8,11,12,14,15,16,21,24,30,34,35,37,39,40,46,50,51,53,55,56,58,59,62,65,66,67,74,75,78,80,82,83,84,85,86,90,92,96,97,99,100,101,102,105,106,111,112,113,114,115,116,120,123,126,127,133,135,136,137,139,140,142,143,147,151,153,154,155,157,159,165,167,169,170,171,172,173,174,175,176,183,185,189,190,192,193,195,196,199,200,203,204,209,217,218,220,222,223,226,231,232,233,234,236,241,244,246,247,248,252,253,256,257,263,265,269,271,277,278,281,286,287,288,290,291,292,295,297,298,301,302,303,308,309,312,315,317,318,319,322,324,327,329,330,332,337,339,343,346,348,349,351,353,355,356,358,361,362,364,365,367,369,372,373,375,376,378,386,387,389,390,391,392,394,396,399,403,404,407,408,410,411,414,415,416,417,419,421,423,426,427,429,430,431,432,433,434,436,437,438,440,442,450,457,459,460,461,463,466,468,470,472,477,479,481,485,489,492,494,497,499,502,503,505,507,508,510,512,514,515,517,520,521,522,523,524,527,529,531,532,533,535,536,537,541,543,545,547,548,554,558,560,561,562,569,571,572,573,576,577,578,579,583,584,588,589,590,591,594,601,608,610,615,616,621,625,627,629,636,640,643,648,650,651,656,657,659,662,663,669,671,679,680,682,684,685,686,690,696,699,700,701,702,703,704,705,706,707,712,713,714,716,723,725,726,729,732,733,734,735,736,737,738,739,740,745,746,748,750,754,756,757,758,759,760,762,764,765,767,769,770,771,772,773,775,777,779,783,785,787,790,791,792,794,799,800,801,805,808,809,810,813,815,818,822,823,824,827,828,831,833,835,836,837,839]},"unfinished":{"count":761,"head":[1,2,3,5,7,8,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,27,28,30,31,33,34,35,36,37,38],"tail":[807,808,809,810,811,812,813,814,815,816,818,819,820,821,822,823,824,825,826,827,828,829,830,831,832,833,835,836,837,838,839,840],"sha256":"30f0074506cee77dc4b87ece5f7b2bc65de5833b0bcf623a2a9648b4181c4df7"}},{"n":1994,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":1994,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[1962,1963,1964,1965,1966,1967,1968,1969,1970,1971,1972,1973,1974,1975,1976,1977,1978,1979,1980,1981,1982,1983,1984,1985,1986,1987,1988,1989,1990,1991,1992,1993],"sha256":"cb544a1c018cc105a7c6baab2ddbb7622af5e03b836a4ccab53e86bc7b6299e4"},"unfinished":{"count":1994,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[1962,1963,1964,1965,1966,1967,1968,1969,1970,1971,1972,1973,1974,1975,1976,1977,1978,1979,1980,1981,1982,1983,1984,1985,1986,1987,1988,1989,1990,1991,1992,1993],"sha256":"cb544a1c018cc105a7c6baab2ddbb7622af5e03b836a4ccab53e86bc7b6299e4"}},{"n":31,"visited":"AwSJMg==","running":"AAAAAA==","unvisited":{"count":22,"items":[2,3,4,5,6,7,8,9,11,12,13,14,15,17,18,20,21,22,24,26,27,30]},"unfinished":{"count":22,"items":[2,3,4,5,6,7,8,9,11,12,13,14,15,17,18,20,21,22,24,26,27,30]}},{"n":30,"visited":"696mPw==","running":"AAAAAA==","unvisited":{"count":8,"items":[2,4,8,13,16,19,20,22]},"unfinished":{"count":8,"items":[2,4,8,13,16,19,20,22]}},{"n":2280,"visited":"aAzeymTuy4rbzvnrPr5r7HaKfpbO++2Hf8ute8J9/Tlx1pQv/tIKf3oih1fFl2TCClrfe0FH56Kna2CsJtc/zmptcMpJvkXbfWX9eMteF0382Yvvvd9iP532aHvq2V97fbR/7f7z8/zWzKbp+5qvRv/n2e+sUUt+Y/fkfvTrhc6PdifNxsLPXx2B1f/8vT4/FK3PrzH36M82qWrvv9ob/7aPXafTNWb2S2f9kBUS/3K/Uns8rGnqOt+VLvRn2/WBPvlWczfr//O7s0mc5c9u8/97Pz1v3//Vf0zf56Wip7/7ljPzWGQ8i60DfoB8e/cvMQpB/F0hSwR+WPbj+sfy2VEz2y4Nu3PZe5erTGqYM7t+3vb83l44/yQlh5iB","running":"XKra/2kFbLRxBCqWQ1CVf9/Zl3VwHx92Sf23r8HW99ry4ji5Cz7HpOB90n8grw5SUrE8mDHCdMsesPqicg6re8aEslh79q0XnACNV83OSrwKspD+fwahmAeIi2lsVURFS6+HLo4BnCODDImH1WqUi/HiLluhQO3dUtB/+cFcwoYKWrDKqSDDLrnMupyGnAP3Xb6yC7TaifgJJz5wI0Ts7j0Cppgy2Q1wDcJEoslxyud+72vzAHkl0C/+to8aaSElu5LJIXlKrQRu4W0zAsPVlPeNOslcz64mTJ3aW1OFVhE7ZZfwiKCArSqrC4p9gzUD9ydnSjbLqmqGIrORMvGV5fNzYLAjiJhgmgz0775D8BUx/FwjAF2l9IULB7/U","unvisited":{"count":437,"head":[0,1,2050,2051,7,8,2058,2059,12,14,2063,16,2066,21,2072,2078,33,36,2084,2086,39,2087,2090,44,2094,2098,52,56,2105,2106,62,66],"tail":[1907,1916,1918,1919,1923,1932,1934,1935,1939,1940,1943,1944,1959,1962,1964,1970,1972,1976,1980,1983,1984,1992,1994,1999,2003,2010,2011,2016,2018,2027,2035,2041],"sha256":"37d4e55ef77614d0743a928e635b811ea560504070074c222b54c0bc8b42e45c"},"unfinished":{"count":895,"head":[0,1,2,2049,4,2050,2051,7,8,9,2053,2055,12,13,14,15,16,2058,2059,2062,2063,21,2066,2069,24,2072,26,28,29,2076,2078,32],"tail":[1973,1975,1976,1977,1979,1980,1981,1982,1983,1984,1991,1992,1993,1994,1997,1999,2000,2003,2010,2011,2012,2016,2018,2027,2028,2029,2032,2034,2035,2041,2042,2045],"sha256":"91a1a6c1161bde996499cd836f8c9ef5e3403106adccb45a2948eeb3b2e5f38f"}},{"n":97,"visited":"98zDGw/njpy/uau8AA==","running":"AggACAQIAAEEAEEgAA==","unvisited":{"count":35,"items":[3,8,9,12,13,18,19,20,21,26,29,30,31,36,37,38,39,44,48,52,53,54,57,61,62,70,73,74,78,82,84,88,89,94,96]},"unfinished":{"count":38,"items":[3,8,9,12,13,18,19,20,21,26,29,30,31,36,37,38,39,43,44,48,52,53,54,56,57,61,62,70,73,74,78,82,84,86,88,89,94,96]}},{"n":29,"visited":"AAAAAA==","running":"ARIAAA==","unvisited":{"count":26,"items":[1,2,3,4,5,6,7,8,10,11,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28]},"unfinished":{"count":29,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28]}},{"n":34,"visited":"VF1+LAM=","running":"gEYAQAA=","unvisited":{"count":12,"items":[0,1,3,5,13,15,16,23,24,25,28,31]},"unfinished":{"count":15,"items":[0,1,3,5,7,9,13,15,16,23,24,25,28,30,31]}},{"n":1928,"visited":"/////////9/////////////////////////f//////7/++/////////////////////////v///////7///////v////////////////////////////9///////////////////////////////////////////3////////////////////v/////+//////////////////////////7/////////////////////////////////f//3///f/////+////////3///////////////////////7////3//////+//////////////w==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":21,"items":[1280,1795,965,266,524,1617,276,213,1495,474,1120,1760,248,1507,1572,1533,428,1846,1080,699,61]},"unfinished":{"count":21,"items":[1280,1795,266,524,276,1572,428,1846,1080,699,61,965,1617,213,1495,474,1120,1760,1507,248,1533]}},{"n":8,"visited":"/w==","running":"AA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":9,"visited":"/QE=","running":"AAA=","unvisited":{"count":1,"items":[1]},"unfinished":{"count":1,"items":[1]}},{"n":11,"visited":"6AQ=","running":"AAA=","unvisited":{"count":6,"items":[0,1,2,4,8,9]},"unfinished":{"count":6,"items":[0,1,2,4,8,9]}},{"n":13,"visited":"Gw8=","running":"BAA=","unvisited":{"count":4,"items":[12,5,6,7]},"unfinished":{"count":5,"items":[2,5,6,7,12]}},{"n":1862,"visited":"+///fvbv///v/9+///v////3//v3f//3v/ef//3//33/////99/5//+//39fvfv///f///f//2/////9P/1f9//x+v/23+/9///t87/b//fv3/e/+9+f1e//////79//+3f/9z////nv/rf/v//f////1//+//7v/+31+////X8//9/9/+53/79v7j9/f6//////3b////f//7//r/v//f/+f5/+/7//97//19/3/9+6////7//+9/////Vv/92/9//+b+3v9/9/+//v3/f3f/////3/1/3/////+///3///9/u//v9v+z0=","running":"EQAAAAAAAABAAIABAAABAAAAAAQAQQAAAAAAAAAAAJAAAAAAAAAAAAAAAAAAAAAAAAAAAABCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAIAAAAAAAAAAAAIEAgAAAAAAAEAAAIAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAABIAAAIAAQAAAAAAAAAAAAAAAAAAAAAABAAAAAAgAAIAAAAAAAAAACABAAEAAAAAAAAAAAAAAAAAAAAAAIAgAAAAAAAAAAAAAAAgAAEAAABAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":181,"items":[2,1539,1030,1031,521,522,523,528,1552,530,1045,24,1049,1564,31,32,544,1567,35,547,1572,1064,44,557,1068,1580,1075,564,1587,1079,569,68,1094,1607,1610,1100,1103,1104,593,596,85,1108,602,603,1628,94,1118,1119,1637,614,1127,106,618,1643,621,1135,1651,1140,1142,635,1663,644,139,653,659,1177,1689,1181,670,674,163,1190,1707,685,1709,175,1713,693,694,697,187,699,701,1211,708,198,203,213,214,1238,1754,225,1252,1254,1258,748,757,1781,249,1273,770,1288,779,1803,783,1810,1303,795,1309,1310,1822,1312,1824,291,806,807,301,305,306,1844,1334,1847,825,826,1850,1857,1347,836,840,334,1358,851,854,1371,1373,351,357,870,359,1381,361,1387,366,370,885,1405,1408,1410,1414,395,915,917,928,419,1444,944,1456,1467,444,956,447,972,977,979,473,986,1497,1499,1508,486,487,1511,489,1009,1521,501,1525,503,507,1534,1023]},"unfinished":{"count":185,"items":[2,1539,1030,1031,521,522,523,528,1552,530,1045,24,1049,1564,31,32,544,1567,35,547,1569,1572,1064,44,557,1068,1580,1075,564,1587,1079,569,68,1094,1607,1610,1100,1103,1104,593,596,85,1108,602,603,1628,94,1118,1119,1637,614,1127,106,618,1643,621,1135,1651,1140,1142,635,1663,644,139,653,659,1177,154,1689,1181,670,674,163,1190,1707,685,1709,175,1713,693,694,697,187,699,701,1211,708,198,203,213,214,1238,1754,225,1252,1254,1258,748,757,1781,249,1273,255,770,1288,779,1803,783,1810,1303,795,1309,1310,1822,1312,1824,291,806,807,301,305,306,1844,1334,1847,825,826,1850,1857,1347,836,840,334,1358,851,854,1371,1373,351,357,870,359,1381,361,1387,366,370,885,1405,1408,1410,1414,395,915,917,928,419,1444,944,1456,1467,444,956,447,969,972,977,979,473,986,1497,1499,1508,486,487,1511,489,1009,1521,501,1525,503,507,1534,1023]}},{"n":1665,"visited":"///////////////////////////7f////////////X//////////////////////+////+/////////////+/f//////////////8////7///////////////////////////////3////////////v/////////3/7////////////9/////9////////////+///////////9+////////////////////////////////v9/////////z//////+///7////////9/////wE=","running":"AAEAAAAAAAAAgAEAAAAAAAAAAAQAAAAAAAAAAAIAgIAAAAAAAAAAAAAAAAAAAAAAAAAEAgAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAQEAAAAAAAABAAAAAAAAAAAAAAAAYAAAAIAEgAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAABAABAAgAAAAAAAAAAAAAAAAEAAAAAAABAAAAAAIAgAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAA=","unvisited":{"count":26,"items":[386,898,1558,1174,1049,1568,162,420,1446,1453,175,831,965,1093,968,1240,1625,602,603,1247,1506,1507,496,241,505,638]},"unfinished":{"count":27,"items":[386,898,1174,1558,1049,1568,162,420,1446,1453,175,831,965,1093,968,1240,1625,602,603,1247,1506,1507,496,241,505,638,255]}},{"n":165,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAA","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":165,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164]},"unfinished":{"count":165,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164]}},{"n":22,"visited":"//8/","running":"WEEy","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":2313,"visited":"bdkabvf7u5rzZp+sn9OGvOdL6ebn+53Dd0SozrXwnX69suJRfZr2rXHVT6+/8nPaxQ9LfLCamkP4811Y/OF+d+xtTNRV1itfavviaa9M7+vlvxX/8xSqX4/+EzLo/iaqn6fDiO3leh7/39pqanK92/PYOsWbwZiypMb8Y6idJWpk9yvX5xOvyvt4cCVVn200rJS/q6Y8aZ++6pebU08ZvH+/dr461+xftsc/uiPt/r+wK7u+G4fOVmVO+Nc3bX8mdyp+WbzP0tvzGzJYPqMN2+Mr/5YOYtZcUV/sT4PlW9Ld/yttyrahbmMWV8oo17L07z3t789Q77q4vmz3f3ngztmpY5eJU99P0l5slqqs8z8f7iwE6nOx2D8urcNopJ1rtwA=","running":"hGqs0l5WYUbliYRHiykSSkxplWYOkLR5MLeE7m/74wCMLJAc8M3G6dGezY6L9mUyBuSCFNcwgJvnyRSv08EfpoGMZo91BBblHodQddZpDz6rayM2tOqnk/lb6cy72D7P2gBnozthf4qifyHSZNhGx4hMWjgfbLVJLFufaiKiuMP4BxhANVUJBs5Ceu6yK3neoYzUo22x8Rx0m1wPMLskOjXkuTKGcAcvetNyf5Teap+F6VmODcJwqNlIWukkWDpQI514QGZK/CeBcMJUaSCWIV9enV9J10eRGOq/nEMjRa4uHOqF2KdG8qD9+nq2SIKYtQLHlRKm+vaQuZs6RIhzVQEifHijTIlazK0GBxrLjJXi0cTCzQSBVvnHxuFfkqt+rwE=","unvisited":{"count":472,"head":[1,2050,2049,4,2053,10,2058,2060,2062,16,22,2071,24,2082,2084,2086,2093,2095,50,2101,56,61,2109,2111,2112,67,2117,76,2128,2132,85,86],"tail":[1858,1859,1860,1880,1882,1888,1894,1901,1904,1906,1907,1910,1912,1913,1934,1935,1940,1957,1960,1963,1976,1984,1985,1986,1990,1998,2023,2025,2026,2034,2035,2045],"sha256":"4331009be7278b9e2f3ac0260a973f64e85479cdd7474390180936132c9247b1"},"unfinished":{"count":935,"head":[1,2049,2050,4,2053,7,9,10,2057,2058,13,2060,2062,16,18,2066,2067,21,22,23,24,2068,2071,2075,28,2077,2078,31,2081,2082,35,2084],"tail":[1961,1962,1963,1965,1967,1972,1976,1978,1982,1984,1985,1986,1990,1992,1998,2000,2001,2004,2007,2011,2023,2025,2026,2031,2032,2033,2034,2035,2036,2040,2044,2045],"sha256":"c66c599fd86ceece3fc225ec18d7c9c4d1da9c8ac773dca0498b924e86ea692f"}},{"n":23,"visited":"AAAA","running":"AAAA","unvisited":{"count":23,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22]},"unfinished":{"count":23,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22]}},{"n":1,"visited":"AQ==","running":"AA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":143,"visited":"AAAAAAAAAAAAAAAAAAAAAAAA","running":"AAACASAABAACEAAAAAARQoAg","unvisited":{"count":131,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,18,19,20,21,22,23,25,26,27,28,29,30,31,32,33,34,35,36,38,39,40,41,42,43,44,45,46,47,48,49,51,52,53,54,55,56,57,58,59,60,61,62,63,64,66,67,68,69,70,71,72,73,74,75,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,113,114,115,117,118,119,120,122,123,124,125,127,128,129,130,131,132,133,134,136,137,138,139,140,142]},"unfinished":{"count":143,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142]}},{"n":24,"visited":"AqMs","running":"AAAA","unvisited":{"count":16,"items":[0,2,3,4,5,6,7,10,11,12,14,16,17,20,22,23]},"unfinished":{"count":16,"items":[0,2,3,4,5,6,7,10,11,12,14,16,17,20,22,23]}},{"n":273,"visited":"wIiSJBAACAIAQwABEQSCwAREAYBAIAFAAAkQAAAEABgAAAA=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":235,"items":[0,1,2,3,4,5,8,9,10,12,13,14,16,18,19,21,22,24,25,27,28,30,31,32,33,34,35,37,38,39,40,41,42,43,44,45,46,47,48,49,50,52,53,54,55,56,58,59,60,61,62,63,64,65,66,67,68,69,70,71,74,75,76,77,79,80,81,82,83,84,85,86,87,89,90,91,92,93,94,95,97,98,99,101,102,103,104,105,107,108,109,110,111,112,114,115,116,117,118,120,121,122,123,124,125,128,129,131,132,133,134,135,136,137,139,140,141,143,145,146,147,148,149,150,151,152,153,154,155,156,157,158,160,161,162,163,164,165,167,168,169,170,171,172,174,175,177,178,179,180,181,182,183,184,185,186,187,188,189,191,192,193,194,195,196,197,198,199,201,202,204,205,206,207,208,209,210,211,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272]},"unfinished":{"count":235,"items":[0,1,2,3,4,5,8,9,10,12,13,14,16,18,19,21,22,24,25,27,28,30,31,32,33,34,35,37,38,39,40,41,42,43,44,45,46,47,48,49,50,52,53,54,55,56,58,59,60,61,62,63,64,65,66,67,68,69,70,71,74,75,76,77,79,80,81,82,83,84,85,86,87,89,90,91,92,93,94,95,97,98,99,101,102,103,104,105,107,108,109,110,111,112,114,115,116,117,118,120,121,122,123,124,125,128,129,131,132,133,134,135,136,137,139,140,141,143,145,146,147,148,149,150,151,152,153,154,155,156,157,158,160,161,162,163,164,165,167,168,169,170,171,172,174,175,177,178,179,180,181,182,183,184,185,186,187,188,189,191,192,193,194,195,196,197,198,199,201,202,204,205,206,207,208,209,210,211,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272]}},{"n":356,"visited":"///f///////////+//////////////////7///////////////v//////v8P","running":"5fjEr42Zlcv2T/BZ9tlCvRBaf4K2qdt8p2l4bbjOZSkzJCCousPFALvKUKcH","unvisited":{"count":3,"items":[336,298,21]},"unfinished":{"count":5,"items":[200,298,336,21,88]}},{"n":1956,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","running":"i/i8ZzazPpJ/AaZfNndiiMi90HsesDByJaUCaZSgXYb+BfK3MIdjUZfPvO/fMw+Dbq8dZKfiZCE9yV6dk7VYg4rAUpvAHs9kfm/a3Egyh3GgkQBagJ3oWGXz0H8W2gM65o4CG+fPq5/ZMsOlhZnHf/YnS+qX+/P5TdyNffJTpH35JsGhcPH4XQSPgXzEfDiE/hTQBrc9g1WHdDUPEs6UCKUw7kw9H59y+ko0QtbZ07z33QyS4HXoV0PqR0WWqb3x+GJYfL0vHk/6DPmouSPp9+E6kSliFkcvLNufslCg2Qk4VUIkl/Xx5KJiPMdaMDoO6SLgiAw=","unvisited":{"count":959,"head":[2,4,5,6,8,9,10,16,17,22,27,28,31,32,35,38,39,42,43,46,48,54,55,56,58,59,61,62,71,73,74,75],"tail":[1903,1904,1906,1910,1911,1912,1916,1917,1918,1919,1921,1922,1924,1928,1930,1931,1932,1934,1935,1936,1937,1938,1939,1940,1944,1945,1946,1948,1949,1950,1952,1953],"sha256":"b5af44478486f7c5063b0ea3182ac24778af49388b0120edec89a1b05737e4d4"},"unfinished":{"count":1956,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[1924,1925,1926,1927,1928,1929,1930,1931,1932,1933,1934,1935,1936,1937,1938,1939,1940,1941,1942,1943,1944,1945,1946,1947,1948,1949,1950,1951,1952,1953,1954,1955],"sha256":"331f40b2bfc5ab081460ee3f1efef25cb6f2ef7b2cdef155c72db25e09f8d256"}},{"n":11,"visited":"AAA=","running":"BAA=","unvisited":{"count":10,"items":[0,1,3,4,5,6,7,8,9,10]},"unfinished":{"count":11,"items":[0,1,2,3,4,5,6,7,8,9,10]}},{"n":12,"visited":"/w8=","running":"yQ0=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":237,"visited":"QBQggCEABAQBIAAAAAAQBgAEBABAAIEAAIAFCAAB","running":"xCGTkgtbVfmrPy9oSn2Nm1eNr0eRiJGMJno234UA","unvisited":{"count":107,"items":[0,1,3,4,5,9,11,14,15,18,19,22,24,26,27,29,30,34,36,38,39,42,45,47,49,51,53,55,57,66,68,70,78,79,84,86,87,88,89,90,92,95,96,98,100,101,103,105,111,113,117,118,125,126,131,133,135,137,140,141,142,148,150,155,156,157,159,161,162,163,165,168,169,170,172,173,174,177,178,179,181,182,184,185,188,189,190,192,195,196,198,199,200,202,211,214,215,221,225,227,228,229,230,233,234,235,236]},"unfinished":{"count":213,"items":[0,1,2,3,4,5,7,8,9,11,13,14,15,16,17,18,19,20,22,23,24,25,26,27,28,29,30,33,34,35,36,38,39,40,41,42,43,44,45,46,47,48,49,51,52,53,54,55,56,57,59,60,61,62,63,65,66,67,68,69,70,71,72,73,74,75,76,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,117,118,119,120,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,139,140,141,142,143,144,145,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,167,168,169,170,171,172,173,174,175,177,178,179,180,181,182,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,209,211,212,213,214,215,216,217,218,220,221,222,223,224,225,226,227,228,229,230,231,233,234,235,236]}},{"n":19,"visited":"AAAA","running":"AIAA","unvisited":{"count":18,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,16,17,18]},"unfinished":{"count":19,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18]}},{"n":245,"visited":"////////////////////////////////////////Hw==","running":"AAAAAAgQAgAAAAAIAAAAAAAAAAAAAAAAAIAAAAAAAA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":2617,"visited":"////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////AQ==","running":"AAAAAAAABAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAABAAAAAAIAIAAAQAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAABAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAACAAAAAAAAAAAgAAAQAAAAAAAAAAAAAAAABAAAAAAAAAAAIAgAAAAAAAAAAAAAAAACAgAAAIAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAQAAAIAAAAAAAQAAAAABAAAgAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAEAAAABAAAEAAAAAAAAAAAAA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":6,"visited":"Pw==","running":"AA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":2513,"visited":"AAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAEAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAEAAAAAABAAAAAAAAEAAAAAAAAAAgEAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAIAAAAAAAEgAAAAAAAAAAAAAAAAAAAAAUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAABAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAA","running":"AFgcAeKZX5KetVROxuaZC6jcxiiCVh0A8VyO7qJqZiYMnyULZ2aZ764cTo4ocIRL47mzyDHoaRlevfP8KNHTBdhDVipzFagyvyWoIpAGD5EZiRstosNQzNsr8fulLsSiwAHFPIKXYmzdBSSl4/d3xSfA2tAyXJ7x2T/+HsXA+XvyhwsFcJevNGAaxC3UzwLyma5v7E7g0Mrf0AtZan8SkkbirYeGgpvm3DLsdzKtetBT0v0J0iDFhVvHzd9YWJ3epmpztO2PLYEDYhJNxPcUy/z+q7TRlaDYXueFAp+4rP9UA0yS1T5KnLtDyJTiXnDzLQxesxB7cfDsLtdT+DOR+PfB1OeJz7hgBU5ak/R7QY4TiWFtSMo0xRQ6SIvyAx8BDEcB92QLXb85FA3ELRkA2io6ou7Pv1SDEkAB","unvisited":{"count":1275,"head":[0,1,2,3,4,5,6,7,8,9,10,13,15,16,17,21,22,23,25,26,27,28,29,30,31,32,34,35,36,41,42,45],"tail":[2450,2451,2452,2454,2456,2460,2468,2469,2478,2480,2481,2483,2485,2487,2490,2491,2492,2493,2494,2496,2498,2499,2501,2502,2503,2504,2505,2506,2507,2508,2509,2511],"sha256":"e2c1dd2c78bc349dd0cb44247375f80132877db646c97408bb705314fb0c2650"},"unfinished":{"count":2490,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[2481,2482,2483,2484,2485,2486,2487,2488,2489,2490,2491,2492,2493,2494,2495,2496,2497,2498,2499,2500,2501,2502,2503,2504,2505,2506,2507,2508,2509,2510,2511,2512],"sha256":"a38c728cf05a642cc0fa393465c8fe74187bbc461963aaef619867ebfee74408"}},{"n":1953,"visited":"c4zqvQqp73q7c8X7/t1NON39r97RtVja7wR5rfVNMc9d7u034QCgDXF5bhy6siRV2u/KaqLyjKDn0us+4t41u939e318QZ57dOn66W/Sq/nZ12R/dr23n+i3q/fytps698oKe3srvyn2fNXvD10vKDNl/q7vLgvqX+E0vibxJIjxzd2tk3tqP7jK0rsRJfab2vW0yXaGyuK1upNs2o1f+fkmY/ruEy6wuYaAfrn7tFHmtAFrm5ZJnP/7Y76b38ItlFGf/+ufgz9wcKi2U/Tc6HtWlviX7N6tV7Tnbva3V8naFxeZV13eV/krXU9lr6oLzt89agA=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":798,"head":[2,3,7,8,9,12,13,14,16,18,20,25,30,32,34,36,37,38,39,41,42,44,46,52,56,58,63,66,70,74,75,79],"tail":[1877,1879,1884,1885,1887,1889,1891,1892,1895,1900,1902,1904,1906,1908,1910,1914,1916,1917,1918,1919,1920,1924,1925,1933,1937,1942,1943,1944,1946,1948,1951,1952],"sha256":"da7dee1844b347cf511ccc6983015de04583baeafcbda64cacb0a371d45ed7aa"},"unfinished":{"count":798,"head":[2,3,7,8,9,12,13,14,16,18,20,25,30,32,34,36,37,38,39,41,42,44,46,52,56,58,63,66,70,74,75,79],"tail":[1877,1879,1884,1885,1887,1889,1891,1892,1895,1900,1902,1904,1906,1908,1910,1914,1916,1917,1918,1919,1920,1924,1925,1933,1937,1942,1943,1944,1946,1948,1951,1952],"sha256":"da7dee1844b347cf511ccc6983015de04583baeafcbda64cacb0a371d45ed7aa"}},{"n":127,"visited":"gQgCAAAICBACABAAAAAAAA==","running":"3V3aw1dzvS3Eto7/0GFmXw==","unvisited":{"count":47,"items":[1,5,9,13,15,16,18,21,26,27,28,29,35,37,39,42,47,49,54,57,62,63,64,67,68,69,72,75,78,80,85,86,96,97,98,99,101,105,106,107,108,111,112,115,116,119,125]},"unfinished":{"count":118,"items":[1,2,3,4,5,6,8,9,10,12,13,14,15,16,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,44,45,46,47,48,49,50,52,53,54,55,56,57,58,59,61,62,63,64,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126]}},{"n":63,"visited":"7nn5+bM97zg=","running":"AAAAAAAAAAA=","unvisited":{"count":20,"items":[0,4,9,10,15,17,18,25,26,34,35,38,41,46,47,52,56,57,58,62]},"unfinished":{"count":20,"items":[0,4,9,10,15,17,18,25,26,34,35,38,41,46,47,52,56,57,58,62]}},{"n":37,"visited":"AAAAAAA=","running":"AAAAAAA=","unvisited":{"count":37,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36]},"unfinished":{"count":37,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36]}},{"n":154,"visited":"/////////9///////////9///wM=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":2,"items":[61,133]},"unfinished":{"count":2,"items":[61,133]}},{"n":22,"visited":"KAAA","running":"AAAA","unvisited":{"count":20,"items":[0,1,2,4,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21]},"unfinished":{"count":20,"items":[0,1,2,4,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21]}},{"n":19,"visited":"CAAA","running":"AAAA","unvisited":{"count":18,"items":[0,1,2,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18]},"unfinished":{"count":18,"items":[0,1,2,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18]}},{"n":19,"visited":"//8H","running":"AAAA","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":48,"visited":"IAAAAAAA","running":"CAAgAUCI","unvisited":{"count":41,"items":[0,1,2,4,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,22,23,25,26,27,28,29,30,31,32,33,34,35,36,37,39,40,41,42,44,45,46]},"unfinished":{"count":47,"items":[0,1,2,3,4,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47]}},{"n":1164,"visited":"v//////3///+/v3/2////37/////////vX//f/7Pf/ff+////b///P+u/v/f7/Oev//v//v//v//n+//t9/v///n377f////7P/9//n3/3+7/v//3//u7///+/+L////3///7//2f////b9//////9/3//u//39///+9/7/+5//b/f/7////9tv/b//1/vf//w8=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":106,"items":[1026,1029,6,261,773,1033,266,523,524,533,536,1050,796,542,289,549,808,43,811,302,823,1080,312,313,1083,64,576,577,1090,580,1093,72,328,841,332,334,336,81,593,1108,854,1111,863,609,98,610,1121,101,1123,357,1128,619,364,370,1139,371,376,381,382,639,128,642,901,646,135,648,390,907,404,922,418,677,934,688,432,692,951,700,959,193,198,461,462,207,977,722,468,982,223,224,738,483,740,741,742,486,998,1000,236,237,493,1011,500,1012,247,251]},"unfinished":{"count":106,"items":[1026,1029,6,1033,523,524,533,536,1050,542,549,43,1080,1083,64,576,577,1090,580,1093,72,81,593,1108,1111,609,98,610,1121,101,1123,1128,619,1139,639,128,642,646,135,648,677,688,692,700,193,198,207,722,223,224,738,740,741,742,236,237,247,251,261,773,266,796,289,808,811,302,823,312,313,328,841,332,334,336,854,863,357,364,370,371,376,381,382,901,390,907,404,922,418,934,432,951,959,461,462,977,468,982,483,486,998,1000,493,1011,500,1012]}},{"n":751,"visited":"9s35u1l4C+zsTZZH6YXYd5aZ/P8+ff9u/u9M/yipxcWjM31qj1aKu3nJPYPsPe/suHzrbj+/3d2uV6E9Vf2CTf/fcL+t87ze1b9Y95u+eNllvXuTqcZuCv+yfcfiew==","running":"AAAQIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAABAAABgAAAAIAAAAQAAAAAABAAAAAAAQAAAACAAAAAAAAAAA==","unvisited":{"count":276,"items":[0,3,9,12,13,17,18,26,30,33,34,37,39,40,41,42,47,50,52,53,54,55,56,57,60,64,65,68,73,76,77,79,80,83,85,86,91,92,93,95,97,98,100,105,107,108,109,110,112,113,114,117,123,127,128,131,133,134,137,138,141,142,144,145,160,166,167,169,175,184,188,191,192,204,208,209,212,213,215,224,225,226,228,230,231,233,234,236,238,241,243,244,245,249,251,252,253,258,259,260,262,266,267,270,271,273,279,280,282,284,287,292,293,294,296,299,301,303,304,306,308,309,310,314,318,321,322,327,329,330,332,333,337,342,343,346,347,348,349,350,352,353,356,361,366,367,372,376,377,380,384,385,390,392,393,399,402,404,408,412,415,422,423,430,433,437,441,445,448,452,454,459,461,463,465,466,467,468,470,473,478,479,481,483,485,487,489,498,499,500,501,502,505,508,509,525,528,529,530,531,535,542,545,548,550,554,555,560,561,566,568,573,577,579,581,590,592,593,594,597,599,603,610,613,614,616,622,624,625,626,631,633,634,637,641,643,644,647,649,654,658,663,666,667,669,670,673,674,676,678,680,683,684,685,688,692,696,698,700,701,702,703,712,714,715,718,721,727,731,732,733,736,738,739,740,746]},"unfinished":{"count":280,"items":[0,3,9,12,13,525,528,17,18,529,530,531,535,26,30,542,33,34,545,548,37,550,39,40,41,42,554,555,47,560,561,50,52,53,54,55,56,57,566,568,60,573,64,65,577,579,68,581,73,76,77,590,79,80,592,593,83,594,85,86,597,599,91,92,93,603,95,97,98,610,100,613,614,616,105,107,108,109,110,622,112,113,114,624,625,117,626,631,633,634,123,637,127,128,641,131,643,133,134,644,647,137,138,649,141,142,654,144,145,658,663,666,667,669,670,160,673,674,676,166,167,678,169,680,683,684,685,175,688,692,695,184,696,698,188,700,701,191,192,702,703,712,714,715,204,718,208,209,721,212,213,215,727,731,732,733,224,225,226,736,228,738,230,231,739,233,234,740,236,746,238,241,243,244,245,249,251,252,253,258,259,260,262,266,267,270,271,273,279,280,282,284,287,292,293,294,296,299,301,303,304,306,308,309,310,314,318,321,322,327,329,330,332,333,337,342,343,346,347,348,349,350,352,353,356,361,366,367,372,376,377,380,384,385,386,390,392,393,399,402,404,408,412,415,422,423,430,433,437,441,445,448,452,454,459,461,463,465,466,467,468,470,473,478,479,481,483,485,487,489,496,498,499,500,501,502,505,508,509,511]}},{"n":437,"visited":"3/vf7v//uf////9/r///ff///+9///3f3/39/z9zX//+3/////3//7//3b3//9////////9/Dw==","running":"ACAAABEBAMGUAAAAgBQBAAAMAIACABAhAAAAAQBAgAAgEEAoAACEEAAAwCAAABAAEoAQAADkAg==","unvisited":{"count":35,"items":[256,5,10,269,21,24,28,156,167,297,49,50,177,436,54,197,326,201,209,337,341,345,350,95,100,102,230,231,234,235,239,245,373,121,127]},"unfinished":{"count":38,"items":[256,5,10,269,21,24,156,28,167,297,431,49,50,177,436,54,189,197,326,201,209,337,341,345,350,95,100,102,230,231,234,235,239,245,373,247,121,127]}},{"n":267,"visited":"AAAAAAAAAAAABEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","running":"AIIAABEAkAgAGIUgACEAAAAQAAFQwAAAAhcAAEAAAAAAAA==","unvisited":{"count":238,"items":[0,1,2,3,4,5,6,7,8,10,11,12,13,14,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,33,34,35,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,53,54,56,57,58,60,61,62,63,64,65,66,67,68,69,70,71,72,73,77,78,79,81,83,84,85,88,89,90,91,92,94,95,96,97,98,99,100,101,102,103,105,106,107,108,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,141,142,143,144,145,146,147,148,149,150,151,153,154,155,156,157,158,159,160,161,162,163,165,167,168,169,170,171,172,173,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,194,195,196,197,198,199,203,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266]},"unfinished":{"count":265,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,75,76,77,78,79,80,81,82,83,84,85,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266]}},{"n":1499,"visited":"AAAgAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAIAAAAAAAAAAAAAAAAAAAACAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAACAAACAAAAAAAAAAAACAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAEAAAAAAA=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":1486,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,22,23,24,25,26,27,28,29,30,31,32],"tail":[1467,1468,1469,1470,1471,1472,1473,1474,1475,1476,1477,1478,1479,1480,1481,1482,1483,1484,1485,1486,1487,1488,1489,1490,1491,1492,1493,1494,1495,1496,1497,1498],"sha256":"4e386d2e49eb30cb878bb9f370b48163d59797ca7fae3740aa9078da53a87f43"},"unfinished":{"count":1486,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,22,23,24,25,26,27,28,29,30,31,32],"tail":[1467,1468,1469,1470,1471,1472,1473,1474,1475,1476,1477,1478,1479,1480,1481,1482,1483,1484,1485,1486,1487,1488,1489,1490,1491,1492,1493,1494,1495,1496,1497,1498],"sha256":"4e386d2e49eb30cb878bb9f370b48163d59797ca7fae3740aa9078da53a87f43"}},{"n":8,"visited":"MA==","running":"AA==","unvisited":{"count":6,"items":[0,1,2,3,6,7]},"unfinished":{"count":6,"items":[0,1,2,3,6,7]}},{"n":243,"visited":"xlJK18tpM97T6e/7yRx9qv/h4/yv7AbR65qNqF97Ag==","running":"AAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAg==","unvisited":{"count":97,"items":[0,3,4,5,8,10,11,13,15,16,18,20,21,23,27,29,34,36,37,41,42,44,47,50,51,54,55,56,61,66,67,69,73,74,76,84,90,97,98,100,101,104,105,109,110,111,113,119,120,122,124,126,137,138,139,140,146,147,148,152,153,164,166,168,169,172,176,179,180,181,182,183,185,186,187,189,194,196,200,202,205,206,209,212,213,214,216,217,218,220,222,229,231,234,239,240,242]},"unfinished":{"count":97,"items":[0,3,4,5,8,10,11,13,15,16,18,20,21,23,27,29,34,36,37,41,42,44,47,50,51,54,55,56,61,66,67,69,73,74,76,84,90,97,98,100,101,104,105,109,110,111,113,119,120,122,124,126,137,138,139,140,146,147,148,152,153,164,166,168,169,172,176,179,180,181,182,183,185,186,187,189,194,196,200,202,205,206,209,212,213,214,216,217,218,220,222,229,231,234,239,240,242]}},{"n":15,"visited":"AAA=","running":"AAA=","unvisited":{"count":15,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14]},"unfinished":{"count":15,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14]}},{"n":243,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","running":"AAAAKAAAhEBCAQEACAJaBAAAAAAEAAAJECANCQgIAA==","unvisited":{"count":215,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,28,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,51,52,53,54,56,57,58,59,60,61,63,64,66,67,68,69,71,73,74,75,76,77,78,79,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,100,101,102,103,104,106,107,108,109,110,111,112,114,117,119,120,121,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,185,186,188,189,190,191,192,193,194,195,197,198,199,200,201,202,203,204,206,207,209,212,213,214,215,217,218,220,221,222,223,224,225,226,228,229,230,231,232,233,234,236,237,238,239,240,241,242]},"unfinished":{"count":243,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242]}},{"n":74,"visited":"AAAAAAAAAAAAAA==","running":"kt/MUa+stufOAw==","unvisited":{"count":29,"items":[0,2,3,5,6,13,16,17,20,21,25,26,27,29,31,36,38,40,41,44,46,48,51,54,59,60,64,68,69]},"unfinished":{"count":74,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73]}},{"n":785,"visited":"Z/178u1mcs+yrGrh123RuZurmhJKapnz685xfur3e/Eymjzq1L/XSry1Ijcvk70HjrYJPf69y/+aK7dvz6gz96fZ+k9ZJSciW6VXMv+WV172v8fftTlvVfC2oKGuMoGYrasA","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":322,"items":[3,4,7,9,18,23,24,26,27,33,36,40,43,44,47,48,50,51,55,60,61,64,66,67,70,72,73,76,78,80,82,84,87,89,90,91,92,99,101,105,108,111,113,114,115,117,121,122,126,130,133,134,138,140,142,144,146,149,150,152,154,155,157,158,159,160,162,164,165,167,168,170,172,175,177,178,181,182,186,187,194,196,200,204,205,209,210,211,215,216,223,224,226,228,235,242,247,249,250,251,256,258,259,262,263,264,266,269,270,272,273,278,279,280,282,284,288,289,291,293,302,307,309,312,314,316,317,319,320,321,326,329,331,334,336,338,339,340,342,343,347,350,351,356,358,359,362,363,365,366,369,374,379,380,381,382,383,384,388,389,390,392,395,398,401,402,404,405,406,407,409,414,415,416,425,430,434,436,437,448,450,453,454,458,460,462,463,467,470,476,479,484,485,488,489,490,492,494,498,499,502,503,507,515,516,518,521,522,525,528,530,540,541,543,545,546,549,551,553,555,556,558,559,563,564,566,567,568,570,571,572,574,575,578,581,583,585,587,588,590,595,597,599,600,602,603,606,607,616,619,621,622,627,629,631,632,637,639,640,643,654,659,660,661,669,673,675,678,681,682,686,687,692,695,697,699,701,703,704,705,706,707,712,715,718,720,721,722,723,724,726,729,730,731,732,734,736,740,742,744,746,747,750,751,753,754,755,756,757,758,760,761,762,765,766,769,772,774,778,780,782,784]},"unfinished":{"count":322,"items":[3,4,7,9,18,23,24,26,27,33,36,40,43,44,47,48,50,51,55,60,61,64,66,67,70,72,73,76,78,80,82,84,87,89,90,91,92,99,101,105,108,111,113,114,115,117,121,122,126,130,133,134,138,140,142,144,146,149,150,152,154,155,157,158,159,160,162,164,165,167,168,170,172,175,177,178,181,182,186,187,194,196,200,204,205,209,210,211,215,216,223,224,226,228,235,242,247,249,250,251,256,258,259,262,263,264,266,269,270,272,273,278,279,280,282,284,288,289,291,293,302,307,309,312,314,316,317,319,320,321,326,329,331,334,336,338,339,340,342,343,347,350,351,356,358,359,362,363,365,366,369,374,379,380,381,382,383,384,388,389,390,392,395,398,401,402,404,405,406,407,409,414,415,416,425,430,434,436,437,448,450,453,454,458,460,462,463,467,470,476,479,484,485,488,489,490,492,494,498,499,502,503,507,515,516,518,521,522,525,528,530,540,541,543,545,546,549,551,553,555,556,558,559,563,564,566,567,568,570,571,572,574,575,578,581,583,585,587,588,590,595,597,599,600,602,603,606,607,616,619,621,622,627,629,631,632,637,639,640,643,654,659,660,661,669,673,675,678,681,682,686,687,692,695,697,699,701,703,704,705,706,707,712,715,718,720,721,722,723,724,726,729,730,731,732,734,736,740,742,744,746,747,750,751,753,754,755,756,757,758,760,761,762,765,766,769,772,774,778,780,782,784]}},{"n":599,"visited":"/////////9////////f//f//////////+///9/+/////////////////////////////////v/////////////////+///////9/","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":8,"items":[194,550,107,238,438,121,219,61]},"unfinished":{"count":8,"items":[194,550,107,238,438,121,219,61]}},{"n":33,"visited":"/+///wE=","running":"asaNGAE=","unvisited":{"count":1,"items":[12]},"unfinished":{"count":1,"items":[12]}},{"n":24,"visited":"o04R","running":"AAAA","unvisited":{"count":14,"items":[2,3,4,6,8,12,13,15,17,18,19,21,22,23]},"unfinished":{"count":14,"items":[2,3,4,6,8,12,13,15,17,18,19,21,22,23]}},{"n":259,"visited":"////////////////+///////////3/////////////8H","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":2,"items":[98,173]},"unfinished":{"count":2,"items":[98,173]}},{"n":14,"visited":"AAA=","running":"AAA=","unvisited":{"count":14,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13]},"unfinished":{"count":14,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13]}},{"n":939,"visited":"////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////Bw==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":34,"visited":"/////wM=","running":"AAAAAAA=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":1816,"visited":"gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAICAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","running":"ybiqdlddToOdUzNi5+m7B/J4Xo8buivEHybeibV4bE0g/VPE4GOI2fL25UtAaoLw7ICeLsVx06hY+twgtTuSW8UySmN+B+gtf/DZtvGUGIwdP+IMvk+zfh9+XmcHg1R/l0HxKKOmnQz7FGAsL9fzAYtqFxcAIhRbdGblHb/oDHzRJy94N36FiEeTStLcCGM9yt4/b30SyDn1bphMbeZ9cPOafGrKMPQ8i+6pLvQX2yVNPqMLfvUACi3/3d6aJElGBNNvzM27pS6TIuQGbyeMnclP1/5rCBkJUv0Eh0fWh/rdM74=","unvisited":{"count":867,"head":[1,2,4,5,8,9,10,14,16,18,20,22,24,27,31,35,37,39,41,45,47,48,52,53,55,58,59,60,61,62,65,69],"tail":[1744,1745,1747,1748,1749,1750,1751,1755,1756,1757,1758,1763,1764,1765,1767,1768,1771,1773,1779,1780,1781,1782,1784,1786,1793,1797,1802,1803,1806,1807,1808,1814],"sha256":"894c4242364759eddb0958c48a417f4a053d5693376f71fdd1f465f8c7ab97c6"},"unfinished":{"count":1806,"head":[0,1,2,3,4,5,6,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32],"tail":[1784,1785,1786,1787,1788,1789,1790,1791,1792,1793,1794,1795,1796,1797,1798,1799,1800,1801,1802,1803,1804,1805,1806,1807,1808,1809,1810,1811,1812,1813,1814,1815],"sha256":"0a0ef6d8b1eb8c97176368be62af3f6be5ea49e48a377ace5c4fac9452365ba1"}},{"n":2310,"visited":"76oHIWXvHCj8Mo07rN3p/Wj272Rkpo0p+lO/5sl75bX755F6I02daC+skqz4UfwrWmSrjFn+KGqr92jccvnWya+YamiWfW/F6rXnYRGim0fTLmLO+tGsK7/fnHxMYjLnXtP+5ddf9qZCgjJXCOf7U57o+hT8+H2wssy3zlZydW2XvzWb+n+p+l6wJln8o9X3Vsb7htwkC761x/lc76fqK+/PadeFFO4Cnb6OxyttqGbGfweFqn1q0/t/seIxTRlL/jrTOHlbKPLjX4uur4Tvwz+9q//Xvnb/o1/vd9Fa5aS8T0N5J7uwr57fZm/zulG9zvyI9NPYUyH4rT5O/L78vmrT5N/K1hg7PFFHe+RzF8nuB3ie+7+Gz3TKcuL+leccJw==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":963,"head":[2048,2050,4,2052,2055,8,10,2058,12,2059,14,2061,2064,2065,19,20,21,22,23,2067,25,26,27,28,2068,30,31,2077,33,2080,35,36],"tail":[1965,1970,1971,1973,1975,1977,1978,1979,1980,1982,1983,1984,1985,1986,1993,1996,1998,2000,2006,2007,2008,2012,2013,2015,2016,2017,2024,2030,2032,2033,2040,2046],"sha256":"4fa53b634abb6974e104766b57049d22fb31cf736443b1e2a92605817de01e56"},"unfinished":{"count":963,"head":[2048,2050,4,2052,2055,8,10,2058,12,2059,14,2061,2064,2065,19,20,21,22,23,2067,25,26,27,28,2068,30,31,2077,33,2080,35,36],"tail":[1965,1970,1971,1973,1975,1977,1978,1979,1980,1982,1983,1984,1985,1986,1993,1996,1998,2000,2006,2007,2008,2012,2013,2015,2016,2017,2024,2030,2032,2033,2040,2046],"sha256":"4fa53b634abb6974e104766b57049d22fb31cf736443b1e2a92605817de01e56"}},{"n":892,"visited":"P+rv0H93Nj0Z5e5tJeT0c3+mHfViW3sOI/5GnD74zzcmWbb+da6RY/6O6fw/2fU/u9184ubjZfaG96Dbk+88qv3tNmeFK3iao93aVboTfHPSODge+b7V5+Ht88tZN/e3l8c/ueQX/dXnAKr76ZYNAw==","running":"AEAAQAAAEAAAEAAAAAACBAGAIAAABAEAIAJAAABAIAgCAIQAEAAABCBQhAAAAAEAgAAEBhAHABAAAAQIBAIBAAAAABAAABAABAiAAIBBCAACAQICAAgAAAAAMAAAIAAQAEAIAAAAgAAACAIEgAAEAA==","unvisited":{"count":328,"items":[6,7,8,10,12,20,24,25,26,27,29,39,43,47,48,51,54,55,57,62,63,65,66,69,70,71,73,75,80,84,89,92,95,97,99,100,102,103,104,105,107,108,112,115,123,127,135,136,139,140,142,145,150,151,153,155,160,162,163,164,167,173,175,178,183,184,188,189,190,191,194,195,196,198,199,200,208,211,212,213,215,216,217,221,222,224,230,231,232,233,234,244,254,255,256,259,260,262,263,265,266,269,271,272,275,278,280,289,291,295,296,300,302,305,306,307,309,310,315,316,319,320,328,333,337,340,344,345,358,359,361,362,365,369,371,382,383,386,390,393,397,400,401,407,408,411,412,416,419,427,428,433,435,436,439,440,443,448,451,452,453,454,459,464,465,467,468,470,474,477,483,485,486,492,497,502,503,504,506,508,510,513,521,524,528,531,534,535,539,543,545,547,548,549,550,554,556,558,559,560,561,562,567,568,570,573,574,579,580,582,585,589,592,594,597,601,603,605,607,608,610,614,618,619,621,623,624,625,631,634,635,639,640,642,643,645,649,650,654,655,656,658,662,663,664,669,670,671,673,674,680,686,689,691,693,699,700,705,706,707,708,713,716,722,723,730,732,733,737,738,741,743,747,750,751,755,763,766,771,773,774,779,780,781,790,791,793,794,798,800,801,803,804,811,813,814,815,817,825,827,829,835,836,840,841,842,844,845,846,847,848,850,852,854,865,866,868,872,875,877,878,881,884,885,886,887,890,891]},"unfinished":{"count":352,"items":[6,7,8,10,12,20,24,25,26,27,29,39,43,47,48,51,54,55,57,62,63,65,66,69,70,71,73,75,76,80,84,89,92,95,97,99,100,102,103,104,105,107,108,112,113,115,122,123,127,135,136,139,140,142,145,149,150,151,153,155,160,162,163,164,167,170,173,175,178,183,184,188,189,190,191,194,195,196,198,199,200,208,211,212,213,215,216,217,221,222,224,230,231,232,233,234,244,245,251,254,255,256,259,260,262,263,265,266,269,271,272,275,278,280,289,291,295,296,300,302,305,306,307,309,310,314,315,316,319,320,328,332,333,334,337,338,340,344,345,358,359,361,362,365,369,371,382,383,386,390,393,397,400,401,407,408,410,411,412,416,419,420,426,427,428,433,435,436,439,440,443,448,451,452,453,454,459,464,465,466,467,468,470,474,477,482,483,485,486,492,496,497,502,503,504,506,508,510,513,521,524,528,531,534,535,539,540,543,545,547,548,549,550,554,556,558,559,560,561,562,567,568,570,573,574,578,579,580,582,585,589,592,594,597,601,603,605,607,608,610,614,618,619,621,622,623,624,625,631,634,635,639,640,642,643,645,648,649,650,654,655,656,657,658,662,663,664,669,670,671,673,674,680,686,689,691,693,699,700,705,706,707,708,713,716,722,723,730,732,733,737,738,741,743,747,750,751,755,763,766,771,773,774,779,780,781,790,791,793,794,798,800,801,803,804,811,813,814,815,817,825,827,829,835,836,840,841,842,843,844,845,846,847,848,850,852,854,858,865,866,868,872,875,877,878,881,884,885,886,887,890,891]}},{"n":10,"visited":"AAA=","running":"AAA=","unvisited":{"count":10,"items":[0,1,2,3,4,5,6,7,8,9]},"unfinished":{"count":10,"items":[0,1,2,3,4,5,6,7,8,9]}},{"n":1,"visited":"AQ==","running":"AA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":4,"visited":"AA==","running":"AQ==","unvisited":{"count":3,"items":[1,2,3]},"unfinished":{"count":4,"items":[0,1,2,3]}},{"n":260,"visited":"7///////3////////////////9////////////////8P","running":"CAEgAAQAAAIAFAAEgQAAAIIAAAIgAAkIAAEAYQAAIBAA","unvisited":{"count":3,"items":[4,53,157]},"unfinished":{"count":3,"items":[4,53,157]}},{"n":2,"visited":"Aw==","running":"Ag==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":254,"visited":"///+///v7P//v///+3/vvfb///193/v/t/vp/fP//z0=","running":"AAIAAAAAAABAAEAAAAAAAAAAAAAAAAAAACAAAAAEAAA=","unvisited":{"count":28,"items":[128,131,195,198,202,78,16,209,210,212,153,217,161,98,226,227,121,167,44,173,111,48,49,178,52,116,249,126]},"unfinished":{"count":28,"items":[128,131,16,153,161,167,44,173,48,49,178,52,195,198,202,78,209,210,212,217,98,226,227,249,111,116,121,126]}},{"n":173,"visited":"ugIIAZMJCeEWxAJgCwQdNCMBLFChCw==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":118,"items":[0,2,6,8,10,11,12,13,14,15,16,17,18,20,21,22,23,25,26,27,28,29,30,31,34,35,37,38,41,42,44,45,46,47,49,50,52,53,54,55,57,58,59,60,64,67,69,70,71,72,73,75,76,77,80,82,83,84,85,86,87,88,89,90,91,92,95,98,100,101,102,103,104,105,107,108,109,110,111,113,117,118,119,120,121,123,126,127,130,131,132,134,135,137,138,139,140,141,142,143,144,145,148,150,151,152,153,154,155,157,159,161,162,163,164,166,170,172]},"unfinished":{"count":118,"items":[0,2,6,8,10,11,12,13,14,15,16,17,18,20,21,22,23,25,26,27,28,29,30,31,34,35,37,38,41,42,44,45,46,47,49,50,52,53,54,55,57,58,59,60,64,67,69,70,71,72,73,75,76,77,80,82,83,84,85,86,87,88,89,90,91,92,95,98,100,101,102,103,104,105,107,108,109,110,111,113,117,118,119,120,121,123,126,127,130,131,132,134,135,137,138,139,140,141,142,143,144,145,148,150,151,152,153,154,155,157,159,161,162,163,164,166,170,172]}},{"n":293,"visited":"AIiEOHESm4HUgIAUtY88LCAEMkEKIJHjWIRggGElJAbAIIFCCQ==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":203,"items":[0,1,2,3,4,5,6,7,8,9,10,12,13,14,16,17,19,20,21,22,24,25,26,30,31,33,34,35,39,40,42,43,45,46,47,50,53,54,57,58,59,60,61,62,64,65,67,69,72,73,74,75,76,77,78,80,81,82,83,84,85,86,88,89,91,93,94,95,97,99,102,108,109,110,112,113,118,119,120,121,124,126,127,128,129,130,131,132,134,135,136,137,139,140,141,142,143,144,146,147,150,151,153,154,155,156,157,159,160,162,164,165,166,167,168,169,170,171,172,174,175,177,178,179,181,182,186,187,188,192,193,194,197,199,200,201,203,204,205,206,208,209,210,211,212,215,216,217,218,219,220,221,222,225,226,227,228,231,233,235,236,238,239,240,241,243,244,246,247,248,251,252,253,254,255,256,257,258,259,260,261,264,265,266,267,268,270,271,273,274,275,276,277,278,280,282,283,284,285,287,289,290,292]},"unfinished":{"count":203,"items":[0,1,2,3,4,5,6,7,8,9,10,12,13,14,16,17,19,20,21,22,24,25,26,30,31,33,34,35,39,40,42,43,45,46,47,50,53,54,57,58,59,60,61,62,64,65,67,69,72,73,74,75,76,77,78,80,81,82,83,84,85,86,88,89,91,93,94,95,97,99,102,108,109,110,112,113,118,119,120,121,124,126,127,128,129,130,131,132,134,135,136,137,139,140,141,142,143,144,146,147,150,151,153,154,155,156,157,159,160,162,164,165,166,167,168,169,170,171,172,174,175,177,178,179,181,182,186,187,188,192,193,194,197,199,200,201,203,204,205,206,208,209,210,211,212,215,216,217,218,219,220,221,222,225,226,227,228,231,233,235,236,238,239,240,241,243,244,246,247,248,251,252,253,254,255,256,257,258,259,260,261,264,265,266,267,268,270,271,273,274,275,276,277,278,280,282,283,284,285,287,289,290,292]}},{"n":270,"visited":"+/////////v/////////////////////////////////Pw==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":2,"items":[2,58]},"unfinished":{"count":2,"items":[2,58]}},{"n":1650,"visited":"////f//9/3/ff/7+/f5/vv/7/77//77////v/3f///////d/f86//7/////+////71/v+e///////+////n/4f//+b///fvfv//f+/f///////////+z/3P/+/v/7f7+/9///2/f+/1v//nv//f7v/////22v/90d/9/+/////1///v//7v/9///v+779///7///f//+//+9v///////ff/37a//////8//fe/v///Z/8///7///f99f+/5//X//fv+/////v/+f///7/+8D","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":145,"items":[1536,1031,1543,529,530,1042,1558,542,31,41,553,1066,1070,562,1590,1083,573,63,69,582,1605,1606,79,80,597,1110,88,1112,602,1626,1116,97,1122,611,104,1131,1644,119,120,126,1156,138,152,158,1183,1192,176,690,691,182,694,1217,706,707,1222,711,1230,722,212,730,227,231,745,748,752,760,1273,1279,1291,781,1297,275,1300,1308,1310,287,804,295,296,807,300,301,813,818,310,825,1346,1347,836,326,839,849,850,1365,1370,860,1375,352,1378,875,882,1400,1403,894,388,1415,1418,1419,397,399,404,409,410,921,928,931,420,1444,934,942,952,953,955,959,1471,963,1477,967,1485,1487,1490,468,983,1496,986,1511,489,490,1513,1527,505,506,507,508,1017]},"unfinished":{"count":145,"items":[1536,1031,1543,529,530,1042,1558,542,31,41,553,1066,1070,562,1590,1083,573,63,69,582,1605,1606,79,80,597,1110,88,1112,602,1626,1116,97,1122,611,104,1131,1644,119,120,126,1156,138,152,158,1183,1192,176,690,691,182,694,1217,706,707,1222,711,1230,722,212,730,227,231,745,748,752,760,1273,1279,1291,781,1297,275,1300,1308,1310,287,804,295,296,807,300,301,813,818,310,825,1346,1347,836,326,839,849,850,1365,1370,860,1375,352,1378,875,882,1400,1403,894,388,1415,1418,1419,397,399,404,409,410,921,928,931,420,1444,934,942,952,953,955,959,1471,963,1477,967,1485,1487,1490,468,983,1496,986,1511,489,490,1513,1527,505,506,507,508,1017]}},{"n":9,"visited":"wwA=","running":"QAA=","unvisited":{"count":5,"items":[2,3,4,5,8]},"unfinished":{"count":5,"items":[2,3,4,5,8]}},{"n":289,"visited":"n6Du7DfK1U79TszVyJdZOn2H12+P9WR+PcIr0NCy3aW5Cs8/AA==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":123,"items":[257,258,5,6,262,8,9,10,11,12,264,14,266,16,268,269,270,20,271,276,277,24,25,28,286,287,288,35,38,39,40,42,44,45,49,51,53,56,60,61,63,65,72,76,77,79,80,81,84,85,89,91,93,96,97,98,100,101,107,109,110,113,114,117,119,120,122,126,127,129,135,139,140,141,142,147,149,156,159,164,165,166,169,171,176,177,179,180,183,184,191,193,198,199,200,202,203,204,205,210,212,214,215,216,217,218,219,221,224,225,226,227,229,232,234,235,238,241,245,249,251,252,254]},"unfinished":{"count":123,"items":[5,6,8,9,10,11,12,14,16,20,24,25,28,35,38,39,40,42,44,45,49,51,53,56,60,61,63,65,72,76,77,79,80,81,84,85,89,91,93,96,97,98,100,101,107,109,110,113,114,117,119,120,122,126,127,129,135,139,140,141,142,147,149,156,159,164,165,166,169,171,176,177,179,180,183,184,191,193,198,199,200,202,203,204,205,210,212,214,215,216,217,218,219,221,224,225,226,227,229,232,234,235,238,241,245,249,251,252,254,257,258,262,264,266,268,269,270,271,276,277,286,287,288]}},{"n":1574,"visited":"/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////z8=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":2356,"visited":"AQAgCCAAAIABIAIAAAAEoAAAAAAIEAQJAQIAIAAIAQAQCEDQAowAAwABiKEQAAIAAQAIEKgAAAQQpQQCAABAAoACIAIAAAEAEAAQAACAAAwYEAIMAICAAAAAIAABAakgAEAIABQAggACAAAAAAAAAgCgAAAACwAFQAhACArACAAgWAAIAhIBAAABCAEEEBCAAAIAFAAAAAAYAQAAECQAAQjAgAABAAAAgAgQBCAEQADAIAIAAEAAEAgECIIAAAAAAIAgGAAAAAAAAgBAAAAAgAQCGAAABAgEJECAiIAIQAAIAASAAAABAAAcgAAAAAIAAAAUBABBKEAACIIUDoEAAICAgBABEEYBARQAQLAACRBCgQQACAgAKEAAAQAAAAkAAIgA4gAgAA==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":2110,"head":[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,22,23,24,25,26,28,29,30,31,32,33,34],"tail":[2318,2320,2321,2322,2323,2324,2325,2326,2327,2328,2330,2331,2332,2336,2337,2338,2339,2340,2341,2342,2343,2344,2345,2346,2347,2348,2350,2351,2352,2353,2354,2355],"sha256":"eccd0ef6fed4a90ae92aea8e6abdc97044ccd0288437c270583d2beb36166534"},"unfinished":{"count":2110,"head":[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,22,23,24,25,26,28,29,30,31,32,33,34],"tail":[2318,2320,2321,2322,2323,2324,2325,2326,2327,2328,2330,2331,2332,2336,2337,2338,2339,2340,2341,2342,2343,2344,2345,2346,2347,2348,2350,2351,2352,2353,2354,2355],"sha256":"eccd0ef6fed4a90ae92aea8e6abdc97044ccd0288437c270583d2beb36166534"}},{"n":3,"visited":"AA==","running":"AA==","unvisited":{"count":3,"items":[0,1,2]},"unfinished":{"count":3,"items":[0,1,2]}},{"n":2911,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","running":"AAAACAAAAAgAACACAAAAAAAAAAAAgAAIAIBAAAAAAAAAAAAQAAACAAAAAAAAAEEAAAAAAAAAQAAAIAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAQAAAAAAIABAAAAAAAAECAAAAAAAAAAAAAAAIAAAACAAAAAAAAAgAEAAAQAAAQAAAAAAAAACAAAAAAAAAAAAAAAAAAACAAAAAAAAAACAAAAAAAAAAAiABAAAAAAAAAAAAAAAAAAAAEAAAgAAAAAAAAAAAgABAAAAAIAAAAAAAAAAAABAAIAIAAAAAAAAAAAAAAAAEAAAAAAEACAAAAAAAABAAAAAAAACAAAAAAAAAAAAAAAAQAAAAAAAAAIAAAAAAAAAAAAAQAAAAAAAACAAAQQAgAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAABAAAAAAAAACABAQIAEAAAAAAAAA==","unvisited":{"count":2850,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,28,29,30,31,32],"tail":[2879,2880,2881,2882,2883,2884,2885,2886,2887,2888,2889,2890,2891,2892,2893,2894,2895,2896,2897,2898,2899,2900,2901,2902,2903,2904,2905,2906,2907,2908,2909,2910],"sha256":"d215d09d1f5c09f1615889d2e8b9f334be8df5cdee9ceb322fd6108ddaa4d841"},"unfinished":{"count":2911,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[2879,2880,2881,2882,2883,2884,2885,2886,2887,2888,2889,2890,2891,2892,2893,2894,2895,2896,2897,2898,2899,2900,2901,2902,2903,2904,2905,2906,2907,2908,2909,2910],"sha256":"8a5cce37b44e413cf00d58b499217b6fb4cc89b6153ed814e10ba547a078415c"}},{"n":6,"visited":"AA==","running":"AA==","unvisited":{"count":6,"items":[0,1,2,3,4,5]},"unfinished":{"count":6,"items":[0,1,2,3,4,5]}},{"n":38,"visited":"/9/v/z4=","running":"AAAAAAA=","unvisited":{"count":3,"items":[32,20,13]},"unfinished":{"count":3,"items":[32,20,13]}},{"n":192,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","running":"RfeolSlR0gv5jBlQSub7wHrYCHGMvW71","unvisited":{"count":97,"items":[1,3,4,5,7,11,16,17,18,20,22,25,27,29,30,33,34,36,38,39,41,42,43,45,47,48,50,51,53,58,60,61,62,63,65,66,72,73,76,77,78,81,82,85,86,87,88,89,90,91,93,95,96,98,100,101,103,104,107,108,114,120,121,122,123,124,125,128,130,135,136,137,138,141,144,145,146,148,149,150,151,153,154,155,159,160,161,164,165,166,169,174,176,180,183,185,187]},"unfinished":{"count":192,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191]}},{"n":32,"visited":"AAAAAA==","running":"ubSJfQ==","unvisited":{"count":14,"items":[1,2,6,8,9,11,14,17,18,20,21,22,25,31]},"unfinished":{"count":32,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31]}},{"n":12,"visited":"/w8=","running":"AAA=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":7,"visited":"Ag==","running":"Ww==","unvisited":{"count":2,"items":[2,5]},"unfinished":{"count":6,"items":[0,2,3,4,5,6]}},{"n":873,"visited":"+//f/f+///7v//7//+/f//u/X//1+/9/f/v/f/3/P+v///v/33v79//76fXv+/ez/+/+//e/97f/+///9u/79+//+//v///9u3/fv/3/f///f/7///7//v1P++1//32/f//7r/v/9/+f9/f/+wE=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":93,"items":[2,516,775,530,274,786,21,25,796,798,802,548,293,298,46,303,306,819,56,569,315,578,68,837,582,838,330,843,591,80,337,338,851,340,597,345,347,606,609,866,356,362,108,371,117,631,378,379,382,130,396,142,655,656,400,149,151,161,163,419,680,170,430,435,696,443,446,191,705,199,202,458,716,717,719,722,729,732,223,480,225,483,743,759,492,753,498,246,247,250,507,252,766]},"unfinished":{"count":93,"items":[2,516,530,21,25,548,46,56,569,578,68,582,591,80,597,606,609,108,117,631,130,142,655,656,149,151,161,163,680,170,696,191,705,199,202,716,717,719,722,729,732,223,225,743,753,246,247,759,250,252,766,775,274,786,796,798,802,293,298,303,306,819,315,837,838,330,843,337,338,851,340,345,347,866,356,362,371,378,379,382,396,400,419,430,435,443,446,458,480,483,492,498,507]}},{"n":77,"visited":"f3///6t7/vf/Hw==","running":"AAAAAAAAAAAAAA==","unvisited":{"count":9,"items":[34,36,38,7,42,15,47,48,59]},"unfinished":{"count":9,"items":[34,36,38,7,42,15,47,48,59]}},{"n":1151,"visited":"a2B/P5/XByj9/u+dYchPahdLRz0232sdnx5Q+e+FR/x7Z1i3b1mlfODPirO9SZ6NSx3fa4z2NP3Vma4dzKnKnb976i892Lc7Z3ubcP+FGrx/Gvd/O310BuSfXPkp/ij7mi7dvIjr77nCTa/lXC3uhw3/ieXLuH+0dvr1C6+nWV1u5LT+nHFtTf7+n0P7j0U4","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":457,"head":[1024,2,4,1028,7,8,9,10,11,12,1031,1032,15,1033,1035,1036,1040,1041,1043,1046,23,1048,30,31,1056,1057,37,38,1061,1062,1065,1066],"tail":[937,938,942,951,952,953,955,958,960,963,967,968,970,977,979,986,988,989,990,991,996,998,1003,1004,1006,1009,1010,1013,1015,1017,1021,1023],"sha256":"02d90087ddc2306879b615cf23dea43df772797ae5e2af2111776ae5c7fa474d"},"unfinished":{"count":457,"head":[2,4,7,8,9,10,11,12,15,23,30,31,37,38,43,45,51,52,53,54,55,56,57,58,60,62,63,65,72,84,89,93],"tail":[1066,1067,1071,1073,1076,1079,1081,1084,1085,1087,1088,1096,1109,1110,1114,1115,1116,1117,1119,1122,1132,1133,1134,1137,1139,1140,1141,1143,1144,1145,1146,1150],"sha256":"520ced18b4e5a3f841c0086259c90fdaebb67fa96a582803eba3af60fc9f098b"}},{"n":291,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","running":"AAAQAAAAAAAAAAAAAASAAAAAAAAAAAAAAAAAAAAIMAEAAAAAAQ==","unvisited":{"count":283,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,107,108,109,110,111,112,113,114,115,116,117,118,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,236,237,238,239,240,241,242,243,246,247,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273,274,275,276,277,278,279,280,281,282,283,284,285,286,287,289,290]},"unfinished":{"count":291,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273,274,275,276,277,278,279,280,281,282,283,284,285,286,287,288,289,290]}},{"n":835,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":835,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[803,804,805,806,807,808,809,810,811,812,813,814,815,816,817,818,819,820,821,822,823,824,825,826,827,828,829,830,831,832,833,834],"sha256":"f566c5666af82ff7f4977ad4fefcad3cb3b02a14cf3277939574e5d040fe296f"},"unfinished":{"count":835,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[803,804,805,806,807,808,809,810,811,812,813,814,815,816,817,818,819,820,821,822,823,824,825,826,827,828,829,830,831,832,833,834],"sha256":"f566c5666af82ff7f4977ad4fefcad3cb3b02a14cf3277939574e5d040fe296f"}},{"n":14,"visited":"/z8=","running":"AAA=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":164,"visited":"//////////////////////////8P","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":244,"visited":"////9//7///////////////////+/////+//////Dw==","running":"EACASBEAQhgAAAYAACAACAGAAAIAgAgAhCAACMAAAQ==","unvisited":{"count":3,"items":[160,42,204]},"unfinished":{"count":4,"items":[160,42,27,204]}},{"n":2694,"visited":"AAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAABAAAAAAEAAAAAAAABAAIAAAAAAQAAAAACAAAAAAABCAAAAIAAAAAAAAAAAIAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgEAAAAAAABAAAAABAAAAAAAAAAAAEIAAAAAAAAAAAAAAAAAAAAAAAAAAAEAIAAAAQAQAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAgAAAAACAAAACAAAAAAA==","running":"AACAAAAAAAIAAAAAAAAAAAAAAABAAAAIAAAQACAAAAAAAAQAAAAAAAAAAAAAgQAAAABIAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAhAAAAAAAAAACAAAAAAAgAAAABAAAAAAAQAAAABAgECAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAABAAAAAAAAABAgAAAAAAAAAgAQAAAAAAAAAAAAAAgAAAAAAAAAAAAIAACAgAAAAAACAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAgAAAAgAAAAAMABAAAAAAAICAAAAAAAIAQAAAgACIAAAAACAgAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAIBAAAAAAAAA==","unvisited":{"count":2612,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,24,25,26,27,28,29,30,31,32],"tail":[2661,2662,2664,2665,2666,2667,2668,2669,2670,2671,2672,2673,2674,2675,2676,2677,2678,2679,2680,2681,2682,2683,2684,2685,2686,2687,2688,2689,2690,2691,2692,2693],"sha256":"75c951964d0fe26e1cc6043d1ce6d0cf177021949c365619c184d28a2a232c4d"},"unfinished":{"count":2664,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[2661,2662,2664,2665,2666,2667,2668,2669,2670,2671,2672,2673,2674,2675,2676,2677,2678,2679,2680,2681,2682,2683,2684,2685,2686,2687,2688,2689,2690,2691,2692,2693],"sha256":"c6e9c19613c600bba973482da69eaabcfe7e44f7e2ebfc054fe4dc80f0c1de31"}},{"n":26,"visited":"YwkAAA==","running":"QAABAA==","unvisited":{"count":19,"items":[2,3,4,7,9,10,12,13,14,15,17,18,19,20,21,22,23,24,25]},"unfinished":{"count":20,"items":[2,3,4,7,9,10,12,13,14,15,16,17,18,19,20,21,22,23,24,25]}},{"n":714,"visited":"//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////8D","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":2470,"visited":"812IW/2jfTP+r/zawCVHaU+u2p3s8up9e1psvZfDOLP/PLXrbUcqTa7GtO9v3ZrbXSy7hEy0qOGtrID7nbrft8Yb7aou392kLw3dv5dW/FrcMFLze4gF38hHtPl38/71d5inBffxqUlWt2KHbf/83fgGX954urhHa/mG7tb83147/M/vTvT6Fd34kyePP+8cblLvthrvG+Abo8zYLelRbXXwbfMP1o/I09atvybaT9QnE6v7719q+l2ucBfNRWNi5/TV737HHnq8qi/3WRq26qseE1+9sn+Te0daVw0GcH73vw9+NWMcbSeLL/z/oMv999C768c9cf/aF10ezr/hhx7X1N9PAsdwyb299OK3w1Bsrvzjb+mf9YOJt1rfnVcPcfg1tPfH6y78X/9QqCTibzPad388","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":984,"head":[2048,2,3,2053,2054,2055,9,2059,13,2061,15,16,17,18,2064,20,21,22,2065,2067,2069,26,29,2077,31,33,2084,2085,2087,2088,42,43],"tail":[1966,1967,1969,1970,1971,1975,1984,1986,1989,1995,1997,1998,1999,2001,2005,2007,2008,2013,2014,2015,2016,2020,2021,2030,2033,2034,2035,2036,2043,2044,2045,2046],"sha256":"f8cbcc13a04c7a5d177eb4cb996a1d29e32426f59c188c3856209d1f27f88907"},"unfinished":{"count":984,"head":[2048,2,3,2053,2054,2055,9,2059,13,2061,15,16,17,18,2064,20,21,22,2065,2067,2069,26,29,2077,31,33,2084,2085,2087,2088,42,43],"tail":[1966,1967,1969,1970,1971,1975,1984,1986,1989,1995,1997,1998,1999,2001,2005,2007,2008,2013,2014,2015,2016,2020,2021,2030,2033,2034,2035,2036,2043,2044,2045,2046],"sha256":"f8cbcc13a04c7a5d177eb4cb996a1d29e32426f59c188c3856209d1f27f88907"}},{"n":1292,"visited":"///v/f//////////////////7/////////////////////////////////+////////////////////////3///////////////7//v/////////93////////////////////////////9///f////////////////9///////////////f///////+///////7//////3///////////8P","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":16,"items":[977,594,1170,20,148,25,863,1120,610,675,358,875,687,499,1077,1209]},"unfinished":{"count":16,"items":[1120,610,675,1209,358,875,687,977,594,499,20,148,1077,1170,25,863]}},{"n":2971,"visited":"//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////8H","running":"AAAAABAAAAAAAAABAAIAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAQCAAAAIAFAAAAAACAAAQAAAAAAgAAAAAAAAAAAAAAAAABAAIAAAACCEAAAAAEEAAAAAAQAAAEAAAAAAAAAAABAAAAAAEAAAAAAFAgAQAAAAAAAAAAAABIAAIAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAEAAAAAAAgAAAAAAAAAAAAAAAAAAAAAgAAAAAUAAAAAAAAAAAIAAAAAAAAAAAAAAAgAAAAAAIACAAAACAAEAAAAABAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAACAgAAAAAAAAAAIAAAAAACAAAAAACAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAEAQAAAAAAAAAgAAAAAAAAAQAAAAAAAAAAAAAAAAABAAAAAAAAA","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":2060,"visited":"///v39/+7/737/////b+//7ze99/fv///+/f///9//f//f7/v/v/v3///77/+f5+/7/////3//7/vP//3+v///e7//r///v/7/3//////v///7/75/f///Xd////7/////z////vT7////7vv//7/v/fv7////H/3X//de36/////v///99/////b3///9+//ffX///f137/9f/v3//f5/+/f//fv/+X/uf//7/3//vn7//+/7f82/////f//v76f37/3/++f//+/f7/9//739+f/0///v6//+/f/////b7v7/v93/1////3/d+/7//+99/v79/7f////f3r/7/3//8N","running":"AkBgAAQEAABAkEAACBAAAAEhACAACEQJAAAwAAAIAANIAAAAAAAAKAQAJAAAADAAgAAgAACQQCAIAEAAEAAAAAQAAAxBACAQJAAgAgCAAAAAAEAEoAICAAAAIIAEAAECBAAQEiABAAAQAACAAkAIAEABQCAAggAAAESAAQQQAgAQAAAIAAAEAAAAAIAABAAAACIAAIIARIABACAgIAAEABCAAQAAAIAQgIAAEECAIAAQAQAAAIAkIAAAjABAAAAAgAAEBgAAxARAkBABAAAAACAMABAAIAgAFgQEEAYBAAQYIAVCAAQAAAIAAACgAAIAIQAAQEQAGEAIAEAAAEgAAAsD","unvisited":{"count":176,"items":[515,1032,1544,522,526,1551,20,536,1565,29,37,40,1576,1069,1582,562,52,1079,56,1600,67,580,585,1609,1616,1108,1111,1635,104,107,112,624,1650,1141,1661,1150,1153,138,139,1163,1677,1678,146,1171,1173,151,1693,1695,675,676,167,168,1704,683,1197,175,1712,1203,1205,1208,1726,705,707,713,1225,1227,204,717,1740,1749,1244,233,748,1777,1269,1784,251,1275,1276,1790,776,265,777,1804,1294,272,1303,1317,294,1829,1833,298,812,1326,820,821,823,1847,1339,1341,318,830,1342,1344,327,1355,1356,1867,848,1873,344,860,1885,350,870,1894,361,362,1387,1900,368,882,888,376,1402,1912,383,1411,1923,1420,909,398,1933,1940,1432,1948,926,1957,1962,427,1451,1454,1456,945,946,947,1457,1975,440,1466,961,965,456,457,1993,462,975,2001,985,2010,987,1499,2012,991,993,996,485,1000,1512,490,1002,492,1520,2035,1528,1530]},"unfinished":{"count":199,"items":[515,1543,1032,1544,522,2057,526,1551,20,536,538,29,1565,37,40,1576,1069,1582,562,52,1079,56,1591,1600,67,580,585,1609,76,1616,1108,1111,1119,1635,104,107,112,624,1650,1141,1661,1150,128,1153,1669,138,139,1163,1677,1678,146,1171,1173,662,151,666,1692,157,1693,1695,675,676,167,168,1704,683,1197,175,1712,1203,1205,1208,1726,1215,705,707,713,1225,1227,204,717,1740,213,1749,1244,1253,233,748,1777,1269,1784,251,1275,1276,1790,1796,776,265,777,1804,1294,272,1810,1303,1817,1317,294,1829,1833,298,812,1326,820,821,823,1847,1339,1341,318,830,1342,1344,327,1355,1356,1867,848,1873,344,860,1885,350,870,1382,1894,361,362,1387,1900,368,882,888,376,1402,1912,383,1411,1412,1923,1420,909,398,1933,1940,918,1432,1948,926,1957,1962,427,1451,1454,1456,945,946,947,1457,1975,440,1466,1469,961,965,456,457,1993,462,975,2001,985,2010,987,1499,2012,991,993,996,485,1000,1512,490,1002,492,2030,1520,2035,1528,1530]}},{"n":548,"visited":"0gYBqjAgIIEOBCAk0BWMJCM3oBPsKDaHAtThIkyMCAIYSYAAeLNI1QAAhJ4cSRbgASAFcQYggEQCVCTMeRMIAAJGFSAE","running":"AQQAAAAEAAAAAIACAQAQAAAAAAAAAQAAAAIAAAAAAAAAAQAAAAAAAAIAAAAAAAAAAAAAAgACAAAAAAAAAAAAAAAAIIAA","unvisited":{"count":370,"items":[2,3,5,8,11,12,13,14,15,17,18,19,20,21,22,23,24,26,28,30,32,33,34,35,38,39,40,41,43,44,46,47,48,49,50,51,52,54,55,57,58,59,60,61,62,64,68,69,70,71,72,73,75,76,77,78,79,80,81,82,83,84,86,88,91,92,94,95,97,98,99,101,105,107,109,110,111,112,113,117,118,120,121,123,124,126,127,130,131,132,134,135,139,142,143,144,145,146,147,148,150,154,155,157,158,159,160,161,164,169,170,172,174,175,176,179,182,183,187,188,189,190,192,194,195,196,197,198,199,200,203,205,209,210,211,212,216,218,219,220,222,223,224,225,228,229,231,232,233,236,237,238,240,241,242,244,245,246,247,248,250,251,252,253,254,255,256,257,258,261,262,263,265,266,268,269,271,272,273,274,275,276,277,278,280,281,282,283,284,285,286,287,288,289,290,295,298,299,302,304,305,306,308,309,311,313,315,317,320,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,339,340,341,342,344,349,350,352,353,357,358,359,361,362,364,365,367,368,371,373,374,375,376,377,378,379,380,385,386,387,388,389,390,391,392,393,394,395,396,398,399,401,403,404,405,406,407,410,411,415,416,419,420,421,422,423,424,426,427,428,430,431,432,433,434,435,436,437,438,440,441,443,444,445,447,448,450,451,452,453,454,455,456,457,459,461,463,464,465,467,468,470,471,472,473,476,477,481,482,487,490,491,493,494,495,496,497,498,500,501,502,503,504,505,506,507,508,509,510,511,512,514,515,516,517,518,519,520,523,524,525,527,529,531,534,535,536,537,538,539,540,542,544,545,547]},"unfinished":{"count":383,"items":[0,2,3,5,8,11,12,13,14,15,17,18,19,20,21,22,23,24,26,28,30,32,33,34,35,38,39,40,41,42,43,44,46,47,48,49,50,51,52,54,55,57,58,59,60,61,62,64,68,69,70,71,72,73,75,76,77,78,79,80,81,82,83,84,86,87,88,89,91,92,94,95,96,97,98,99,101,105,107,109,110,111,112,113,116,117,118,120,121,123,124,126,127,130,131,132,134,135,139,142,143,144,145,146,147,148,150,154,155,157,158,159,160,161,164,168,169,170,172,174,175,176,179,182,183,187,188,189,190,192,194,195,196,197,198,199,200,201,203,205,209,210,211,212,216,218,219,220,222,223,224,225,228,229,231,232,233,236,237,238,240,241,242,244,245,246,247,248,250,251,252,253,254,255,256,257,258,261,262,263,265,266,268,269,271,272,273,274,275,276,277,278,280,281,282,283,284,285,286,287,288,289,290,295,298,299,302,304,305,306,308,309,311,313,315,317,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,339,340,341,342,344,349,350,352,353,357,358,359,361,362,364,365,367,368,371,373,374,375,376,377,378,379,380,385,386,387,388,389,390,391,392,393,394,395,396,398,399,401,403,404,405,406,407,409,410,411,415,416,419,420,421,422,423,424,425,426,427,428,430,431,432,433,434,435,436,437,438,440,441,443,444,445,447,448,450,451,452,453,454,455,456,457,459,461,463,464,465,467,468,470,471,472,473,476,477,481,482,487,490,491,493,494,495,496,497,498,500,501,502,503,504,505,506,507,508,509,510,511,512,514,515,516,517,518,519,520,523,524,525,527,529,531,533,534,535,536,537,538,539,540,542,543,544,545,547]}},{"n":15,"visited":"AAA=","running":"AAA=","unvisited":{"count":15,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14]},"unfinished":{"count":15,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14]}},{"n":317,"visited":"////////////////////////////////////////////////////Hw==","running":"AIBAAQAABGEIEAAAAQAIYQABAAQACAABAAgAEAQQBBAgAAMIICAQAA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":2359,"visited":"////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////fw==","running":"AAAAggBAIAAAAAAADQEAAEAAAIwAEAJBAEIIAAAZAAgIECAIEAAAAAAgAABhQAAEAEACAA0QBkAAAAAZAMgAAQAAQAAIIIgAAkQARABBCgAwAGgBABQCAEQkEAAAQAQAAAgAAAiEgAAIIAECAAIAAgABAAQAAgIAIEgABAAQgBA0CRCQAAAAQKAACACAQgiAQUAMmGOEAAAAgIACAAIWRGBAIAAIAgAgAAAAgAEBBgAAAIAMAAhAoAgAAACIAAAIAgJAAIBIQogAAACAAACAAIASQEAAIBAABCAwAFACAOBABAAGAABAAAAAAAIgAIAAAAABQCAgABAAgAAAIyAYEgAAQAAAIMBQCUAAAAAImACEAIIAYgEgDAFAgIQACAHIRECAAAAQAA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":93,"visited":"AAAAJAAABAIAAIAA","running":"gb8jSeS+Vhim4iQS","unvisited":{"count":46,"items":[1,2,3,4,5,6,14,18,19,20,22,23,25,28,31,32,33,35,36,40,46,48,51,53,55,56,58,61,62,63,64,67,68,70,72,74,75,76,80,81,83,84,86,88,90,91]},"unfinished":{"count":88,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,27,28,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,51,52,53,54,55,56,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,88,89,90,91,92]}},{"n":37,"visited":"AAAAAAA=","running":"AAAAAAA=","unvisited":{"count":37,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36]},"unfinished":{"count":37,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36]}},{"n":134,"visited":"AIUBAAAQKzAMBCEEAkAAEAA=","running":"EQgAgAoAAFAAQAAAIBAAAgA=","unvisited":{"count":103,"items":[1,2,3,5,6,7,9,12,13,14,17,18,19,20,21,22,23,24,25,26,27,28,29,30,32,34,36,37,38,39,40,41,42,43,45,46,47,50,52,54,55,56,57,58,59,63,64,65,68,69,70,71,72,73,75,76,77,79,81,82,83,84,86,87,88,89,91,92,93,94,95,96,98,99,100,102,103,104,105,106,107,109,111,112,113,114,115,116,117,118,119,120,122,123,125,126,127,128,129,130,131,132,133]},"unfinished":{"count":114,"items":[0,1,2,3,4,5,6,7,9,11,12,13,14,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,45,46,47,50,52,54,55,56,57,58,59,62,63,64,65,68,69,70,71,72,73,75,76,77,78,79,81,82,83,84,86,87,88,89,91,92,93,94,95,96,98,99,100,101,102,103,104,105,106,107,108,109,111,112,113,114,115,116,117,118,119,120,121,122,123,125,126,127,128,129,130,131,132,133]}},{"n":6,"visited":"Pw==","running":"AA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":18,"visited":"AAAA","running":"AAEA","unvisited":{"count":17,"items":[0,1,2,3,4,5,6,7,9,10,11,12,13,14,15,16,17]},"unfinished":{"count":18,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17]}},{"n":17,"visited":"AAAA","running":"AAAA","unvisited":{"count":17,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]},"unfinished":{"count":17,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]}},{"n":202,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","running":"ywZ5zIfyZZlfMVB8Gw5tN3klJel8PD8mXgA=","unvisited":{"count":97,"items":[2,4,5,8,11,12,13,14,15,17,18,23,24,25,28,29,35,36,37,38,40,42,43,49,51,52,55,57,58,61,62,69,71,73,74,75,78,79,80,81,82,83,85,87,88,89,95,98,101,102,103,104,108,109,110,111,113,116,119,123,126,127,129,130,135,137,139,140,142,143,145,147,148,150,151,153,154,156,160,161,167,168,169,174,175,182,183,184,187,188,190,191,192,197,199,200,201]},"unfinished":{"count":202,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201]}},{"n":249,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABABAAAAAAA=","running":"es4dN4yZqVMQT0g8jJUSV6koVVzxpiPHzSd1bSb30gE=","unvisited":{"count":123,"items":[0,2,7,8,12,13,17,21,22,23,27,30,31,32,33,36,37,38,41,42,45,46,49,50,52,54,58,59,61,63,64,65,66,67,69,70,71,76,77,79,80,81,82,84,85,87,88,89,94,95,96,97,100,101,102,105,107,109,110,112,114,115,117,118,119,123,125,127,129,130,132,134,136,137,138,140,142,143,145,147,149,151,152,153,157,159,161,162,163,168,171,172,174,178,179,180,182,183,187,188,189,193,196,197,203,206,207,209,211,215,217,220,223,224,227,228,230,231,235,240,242,243,245]},"unfinished":{"count":247,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,205,206,207,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248]}},{"n":31,"visited":"AAAAAA==","running":"AAAAAA==","unvisited":{"count":31,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30]},"unfinished":{"count":31,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30]}},{"n":37,"visited":"/////xs=","running":"AAAAAAA=","unvisited":{"count":1,"items":[34]},"unfinished":{"count":1,"items":[34]}},{"n":24,"visited":"////","running":"AkEQ","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":20,"visited":"AAEM","running":"AAAA","unvisited":{"count":17,"items":[0,1,2,3,4,5,6,7,9,10,11,12,13,14,15,16,17]},"unfinished":{"count":17,"items":[0,1,2,3,4,5,6,7,9,10,11,12,13,14,15,16,17]}},{"n":1254,"visited":"e+/5//9f/7/7/3ve/v/+/////9/////X/tMvb/////7f3/////v//8/97+93t//77//1u6/f//83v//////8//3///////e33/f+/3///f5f+//9793+//2v///79/vvv//3/zR6L/9+f3f3////v//v///v9/f2////6/3/l79/f9d///7///99fv///fff////9393/r393373Pw==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":138,"items":[513,2,7,1031,12,1039,17,18,1043,1045,1055,1064,45,47,563,571,62,574,66,581,1097,587,1103,592,1104,82,87,88,1111,93,96,615,1129,112,625,1139,632,1149,645,647,650,665,1179,157,676,1191,681,1195,685,1199,688,1200,1209,187,189,1214,192,705,1217,202,203,716,205,718,1229,1232,212,214,215,1239,1243,220,223,738,747,754,248,764,261,774,269,787,800,801,803,806,807,808,298,810,815,820,822,823,832,324,325,839,329,847,851,340,855,859,348,355,359,363,366,378,894,388,908,401,403,410,414,420,932,422,939,429,947,952,955,451,454,455,462,986,988,993,496,497,1011,1013,1014,1022]},"unfinished":{"count":138,"items":[513,2,7,1031,12,1039,17,18,1043,1045,1055,1064,45,47,563,571,62,574,66,581,1097,587,1103,592,1104,82,87,88,1111,93,96,615,1129,112,625,1139,632,1149,645,647,650,665,1179,157,676,1191,681,1195,685,1199,688,1200,1209,187,189,1214,192,705,1217,202,203,716,205,718,1229,1232,212,214,215,1239,1243,220,223,738,747,754,248,764,261,774,269,787,800,801,803,806,807,808,298,810,815,820,822,823,832,324,325,839,329,847,851,340,855,859,348,355,359,363,366,378,894,388,908,401,403,410,414,420,932,422,939,429,947,952,955,451,454,455,462,986,988,993,496,497,1011,1013,1014,1022]}},{"n":181,"visited":"pUlt4rjHZoD4rWnOuP8uFH/PWcpofBI=","running":"mHc2uhefUESR5SMvmGHAqH542cn0UgA=","unvisited":{"count":47,"items":[1,6,135,15,145,146,149,23,24,26,154,156,157,160,161,38,168,45,175,48,176,178,51,179,55,56,57,59,60,61,65,66,73,76,82,84,87,92,96,97,98,102,112,116,120,121,126]},"unfinished":{"count":83,"items":[1,3,4,6,9,10,12,13,15,17,20,23,24,26,27,28,32,33,34,38,43,44,45,48,51,52,55,56,57,58,59,60,61,62,64,65,66,73,76,78,81,82,84,87,88,92,93,96,97,98,102,112,116,118,119,120,121,123,125,126,127,135,140,141,145,146,149,151,152,154,156,157,160,161,162,164,167,168,169,175,176,178,179]}},{"n":25,"visited":"AAKAAA==","running":"H9wtAA==","unvisited":{"count":9,"items":[5,6,7,8,13,17,20,22,24]},"unfinished":{"count":23,"items":[0,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,21,22,24]}},{"n":257,"visited":"//////////////////////////////////////////8B","running":"c3gFNQ2LdKctgCOFpgTkNMUL9UjMf6FCR+gcoWqLPyQB","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":12,"visited":"/w8=","running":"gAA=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":113,"visited":"3/v/85f////9////2/8B","running":"AAAAAAAAAAAAAAAAAAAA","unvisited":{"count":10,"items":[65,98,35,5,37,38,101,10,26,27]},"unfinished":{"count":10,"items":[65,98,35,5,37,38,101,10,26,27]}},{"n":32,"visited":"AAAAAA==","running":"AAAAAA==","unvisited":{"count":32,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31]},"unfinished":{"count":32,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31]}},{"n":135,"visited":"AAAAAAQAAAAAAAAAAAAAAAA=","running":"AAAAAAAAAAAAAAIAAAAAAAA=","unvisited":{"count":133,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134]},"unfinished":{"count":134,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134]}},{"n":2506,"visited":"AAIAAAAAgUCAAAgEAEBAAAEQACCAAKAACQAAAAAEAAAAEBAACgAAAABDAAAAAACQIAgAAQAYCAEMAIAIIQAAAACBgQAAASAiEAABCAgCAgAAQAAAIAIAAQQAAIQgAQAAIAKAUAAECAEAAGAqgIAAAgAAABAAAAAAAAEACAIBCA0AAAAAAAAoJAgAQQQBAAACAAAEAIAOCAQAAAEAAAAAAAAgQAgAQAIAAIAISAQAAAAACAQBAiCAAgBAAAEACAAAAEUAEEMQQAAgAAYgCIIoAIBEIAIEACAAAgASgApAAQAAAQAQAEAIAIAAAABQADAAAEAAAAABSAABAAAAIAACAqAAAgAAAgAAAIAQBAogIAAAKQAgIAAAGAZQCQAAAhAQAAAAAINAgABIQwEIAAAIAAQgQAAAQEAIQAI=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":2282,"head":[0,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32],"tail":[2469,2470,2471,2472,2473,2474,2475,2476,2477,2479,2480,2481,2482,2483,2484,2485,2487,2488,2489,2490,2492,2493,2494,2495,2496,2497,2498,2499,2500,2501,2503,2504],"sha256":"0d12f42419c6d11a104725b35e27a287df2f49db3aee0897b489725964fb6312"},"unfinished":{"count":2282,"head":[0,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32],"tail":[2469,2470,2471,2472,2473,2474,2475,2476,2477,2479,2480,2481,2482,2483,2484,2485,2487,2488,2489,2490,2492,2493,2494,2495,2496,2497,2498,2499,2500,2501,2503,2504],"sha256":"0d12f42419c6d11a104725b35e27a287df2f49db3aee0897b489725964fb6312"}},{"n":241,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","running":"BAAAAAAAACAAACAAAAAgCAAAAAAAAAgAABAAAAAAAA==","unvisited":{"count":234,"items":[0,1,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,118,119,120,121,122,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240]},"unfinished":{"count":241,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240]}},{"n":1576,"visited":"////////////////////////////////////f//99///////v/////////////////f/////////////9//7////////////////7///////////////////v//////////////7///////3//////////7////v//////////+///+////////////////////////f////////////////////////////////+////9////////////////9///////8=","running":"8w2+cvx/uqfM6Hg57QLJIt+6W3X3TfUH9MWZ0KSYck8mqlYZRTF9nrpcTUCaHHGBBrY2QvSeNuKAIIQg+5ZaIV5P5weJzSXAUhs50Fq98lX4qKflvBKkGmodybbjiXF/HQrrd3wziTpzZzpuBhyD1QwLKZjcIdoBAeBy0eTfUZ/DlJVhT1/0aDlYLSu0j9SnqJ4WNektde6BaKH17EtEBmamYgqf7ab+71AdvbFCwR+DpQXA6TcZcpBfUKsgfs3ZWpe/yDE=","unvisited":{"count":9,"items":[233,810,395,498,243,1394,1429,920,956]},"unfinished":{"count":19,"items":[1030,395,1429,920,1054,294,810,1197,956,726,859,604,223,483,233,498,243,1394,1535]}},{"n":1802,"visited":"gCDCDMRJ6DGIIxYHA59hENhSKQI4IIE0BysKBBKSAE4BjDGCAcUwDCAIkKEglMEACUAJkVAYvmDQXIVRChCEIHBiIkkAQRCoKAJARbAYAmCyFEIA4iEsACc3AQAMCAVTpcBBlCgRMBhVFoRAKApMAyc4EIQAwQXJUQrBdBAITgEIDKJqFekZ0wkogQgPCBCYUoSHJigAGWYZENA1MiENBEAEQYCUUUkBCABjhQEACxxH0CEAEgIIWQACFkJ4gAISDiCooJrWF4IrY0JCRCYoIHASWBeEbiNEA8CHggsAGzCoAA==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":1271,"head":[0,1,2,3,4,5,6,8,9,10,11,12,14,15,16,18,19,20,21,24,25,28,29,30,31,32,33,35,36,37,41,42],"tail":[1757,1758,1762,1764,1765,1766,1767,1768,1769,1770,1771,1772,1773,1774,1775,1778,1781,1782,1783,1784,1785,1786,1787,1790,1791,1792,1793,1794,1796,1798,1800,1801],"sha256":"da6fe153722892c4a60a24c41bc15f97467a3298e8cb63b5c83700357c7637ae"},"unfinished":{"count":1271,"head":[0,1,2,3,4,5,6,8,9,10,11,12,14,15,16,18,19,20,21,24,25,28,29,30,31,32,33,35,36,37,41,42],"tail":[1757,1758,1762,1764,1765,1766,1767,1768,1769,1770,1771,1772,1773,1774,1775,1778,1781,1782,1783,1784,1785,1786,1787,1790,1791,1792,1793,1794,1796,1798,1800,1801],"sha256":"da6fe153722892c4a60a24c41bc15f97467a3298e8cb63b5c83700357c7637ae"}},{"n":19,"visited":"AAAB","running":"AAAA","unvisited":{"count":18,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,17,18]},"unfinished":{"count":18,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,17,18]}},{"n":934,"visited":"AAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAIAAAAAAAAAAACAAAAAAAAAAAAAACAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAgAAAAAAAAA","running":"BEVgAAAIAiAAEAgDAAQAAIBAAQQAYVAEAwgIQASBABAAABAAgAAAgAIAAAQAKAKgFoAEABLAABgAAIkEgAhQAgAAAAEAGAAEBCAAAAhAAAJAgAAhAAAAgAAlAgEQBIASCIACBAhAQIEECgAAQEiAggQRACAQ","unvisited":{"count":818,"head":[0,1,3,4,5,6,7,9,11,12,13,15,16,17,18,19,20,23,24,25,26,27,28,29,31,32,33,34,35,36,37,38],"tail":[897,899,900,901,902,903,905,906,907,909,910,911,912,913,914,915,916,917,918,919,920,921,922,923,924,926,927,928,929,930,931,933],"sha256":"756aa8179d21d443349dadbb12d6e5f572fef07573c79a2dbd899052571ff2f6"},"unfinished":{"count":926,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,31,32],"tail":[902,903,904,905,906,907,908,909,910,911,912,913,914,915,916,917,918,919,920,921,922,923,924,925,926,927,928,929,930,931,932,933],"sha256":"ad046ebaec5d2701632a85c226f0cac9ff0ef29d8ee2ac5a6d132f10b5caf363"}},{"n":296,"visited":"/////////////////////////////////////////////////w==","running":"Ktakzi+JdkWIm4pXenRI2a5mTUg67mSa5GYpqerc0a552ddFqw==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":19,"visited":"QkEC","running":"AAAA","unvisited":{"count":14,"items":[0,2,3,4,5,7,9,10,11,12,13,15,16,18]},"unfinished":{"count":14,"items":[0,2,3,4,5,7,9,10,11,12,13,15,16,18]}},{"n":245,"visited":"///////////////////////////7/////////7//Hw==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":2,"items":[162,230]},"unfinished":{"count":2,"items":[162,230]}},{"n":5,"visited":"AA==","running":"AA==","unvisited":{"count":5,"items":[0,1,2,3,4]},"unfinished":{"count":5,"items":[0,1,2,3,4]}},{"n":256,"visited":"////////9////////////////////////////7////8=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":2,"items":[51,230]},"unfinished":{"count":2,"items":[51,230]}},{"n":12,"visited":"BAA=","running":"9AE=","unvisited":{"count":6,"items":[0,1,3,9,10,11]},"unfinished":{"count":11,"items":[0,1,3,4,5,6,7,8,9,10,11]}},{"n":27,"visited":"////Bw==","running":"AAAAAA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":2780,"visited":"oAAABAAQAAAIAEAAAEAAAAkRJRgAAAEwAISACIACQAAEAAAQAwIAMBCACYAEAAEChACkAAgAMAAAAAgCADAAQQiCAQHECARAAABAAEAQAAAAAACAIAMCgAAgAAAAAAAAABCAAAAgEBAgADAAEIAAAAIAQBBEgBggAAAQAAgIEAAGcgjAkAAIwCAQBAQABAAFAACAAABBAAYAUEAAQAAkAAAAsIhAQAAAFACgABAAAAACIEAQAEAQCCAgAASAAEAAAEQCAQgAgACAAAAAggASAAGAAAASCAAQAAihCRAASAQUAAAEIICAAaAgAEACAAABCAACAEIABAAAAACAAAQBABAAAgAAAACFQQIAgAhAAIxCIkAAEIhSBAgEABCACEAAAAMAECAAAgyQoAAAIACBAABAGQBBBAIAYAQAACEDGIQABAACAAEACAAYEAgAAAAgBAAAgIABAEQACCIA","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":2494,"head":[0,1,2,3,4,6,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,34],"tail":[2743,2744,2745,2747,2748,2749,2751,2752,2753,2754,2755,2756,2757,2758,2759,2760,2761,2762,2764,2765,2766,2767,2768,2770,2771,2772,2774,2775,2776,2777,2778,2779],"sha256":"83daa6ad4cd0b6cf40f03e5f619cc47d1b81d9f926adb313080782bea82dac04"},"unfinished":{"count":2494,"head":[0,1,2,3,4,6,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,34],"tail":[2743,2744,2745,2747,2748,2749,2751,2752,2753,2754,2755,2756,2757,2758,2759,2760,2761,2762,2764,2765,2766,2767,2768,2770,2771,2772,2774,2775,2776,2777,2778,2779],"sha256":"83daa6ad4cd0b6cf40f03e5f619cc47d1b81d9f926adb313080782bea82dac04"}},{"n":154,"visited":"AAAAAAAAAAAAAAAAAAAAAAAEAAA=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":153,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153]},"unfinished":{"count":153,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153]}},{"n":2,"visited":"AA==","running":"Ag==","unvisited":{"count":1,"items":[0]},"unfinished":{"count":2,"items":[0,1]}},{"n":213,"visited":"//////////////////////////////////8f","running":"GAAAAAAAAAABAAgAQAEgAFAEAIhAYAAAAIQA","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":976,"visited":"//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////8=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":878,"visited":"JFgAjoVyBArAcxDg7F3UEXRSZlkAsE8AoQIFgMEMsJwIhRQMCJCAsKMwAQgGIESm+EsofAQQoCSEICOJCGIKIAIST4gB88AAOuKLowTRYmgGSiGAABSFyQ/FEFoAFAIMMmXGAZkRABAEBGRIMCk=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":608,"head":[0,1,3,4,6,7,8,9,10,13,15,16,17,18,19,20,21,22,23,24,28,29,30,33,35,36,37,38,40,42,43,47],"tail":[835,836,837,838,839,840,841,843,844,845,846,847,848,849,851,852,855,856,857,858,860,861,863,864,865,866,867,870,871,873,874,876],"sha256":"8763ef9c7b04d316dae3bddb6a33258f5fe4cec5e0a7b6df306c5775bb3fb903"},"unfinished":{"count":608,"head":[0,1,3,4,6,7,8,9,10,13,15,16,17,18,19,20,21,22,23,24,28,29,30,33,35,36,37,38,40,42,43,47],"tail":[835,836,837,838,839,840,841,843,844,845,846,847,848,849,851,852,855,856,857,858,860,861,863,864,865,866,867,870,871,873,874,876],"sha256":"8763ef9c7b04d316dae3bddb6a33258f5fe4cec5e0a7b6df306c5775bb3fb903"}},{"n":274,"visited":"AAAAAAAAAAAAAAAAAACQAAAAAAAAAAAAAAAAAAAAAAAAAAA=","running":"AIAAAAAIACABAAwAAAApgAEVBkCEIIAAAABAAiABAAABAAA=","unvisited":{"count":246,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,62,63,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,113,114,118,120,121,122,123,124,125,126,129,130,131,132,133,134,135,137,139,141,142,143,144,147,148,149,150,151,152,153,154,155,156,157,159,160,161,163,164,165,166,168,169,170,171,172,174,175,176,177,178,179,180,181,182,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,215,216,218,219,220,221,222,223,224,225,226,227,228,230,231,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273]},"unfinished":{"count":272,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,117,118,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273]}},{"n":14,"visited":"/z8=","running":"AAA=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":1308,"visited":"/Sx3bWt/TskiN6uey8v3CiV7Yrq92b6bO3mc/2Ev5S+10djn/JDW8+nuucGHPmLJtrY5/vcmm4cz5bce2t6D+PpHvr7neqbmujeTNdH+edv+qsft0Wa0rD6U63YeurQ1/vP/fhPdvuBN/t/bH03weW5si/1VgvnUzpul/pFIO+eWM2hcjS/jm9pZvQPOg9vcTjXZp4nxDqXoddtfL+/94XyiBQU=","running":"c0Pl2kuGzg7nmC5tKtWmIeekyRY6of0TpPw80/f2uKGmn0EA0gs0V8dPGTeOTujuBVgY2WbNgZyxODP7psqfiSq2ORQ6aG2MilDF8JFchW+2/vo2j81JQV9yrBSH60tnvVDkcgHoU0qPa6XCUInAhNV5uH0GVwStcfECgrUvkIP5K/I8nlBAIiay5bts62/6sAmoh8gxZfuROClkGNdLun5nLgA=","unvisited":{"count":263,"items":[512,514,1034,523,12,1038,15,1039,1040,1042,19,534,536,1048,1049,542,1055,34,36,1061,1062,39,552,554,559,48,1071,1074,1075,52,53,564,1076,568,1082,60,61,572,1086,576,1088,578,67,68,582,1098,587,78,591,1105,595,84,597,86,601,1114,603,1118,1120,609,98,610,100,611,613,1124,616,1130,1132,109,625,115,1144,122,124,126,127,640,1152,131,132,648,1161,1166,1167,1169,146,1170,148,152,1179,1180,158,1182,1185,1186,1188,677,166,1189,169,170,1193,684,1194,1195,689,1204,1207,697,186,700,189,190,1217,1218,198,711,712,201,1225,715,1231,208,209,1234,724,214,728,731,735,1247,227,741,742,1254,1255,746,241,1274,763,252,254,767,1280,259,262,1287,778,779,1291,269,1292,273,274,1300,277,1302,1303,792,1305,283,284,1307,799,288,802,803,805,806,807,809,298,301,302,304,307,824,826,315,828,324,836,837,332,337,338,342,858,347,861,356,357,358,869,360,871,873,876,877,367,368,880,370,881,372,882,883,889,380,387,390,392,905,911,401,402,914,406,407,918,921,419,931,933,935,939,428,941,945,434,437,438,953,445,446,450,451,454,457,970,467,979,980,470,982,984,480,993,995,998,488,1004,493,1007,1010,501,502,1014,505,506,1019,1020]},"unfinished":{"count":526,"head":[1,8,9,12,14,15,19,23,25,28,31,34,36,39,47,48,52,53,55,57,58,60,61,64,66,67,68,70,71,75,78,79],"tail":[1225,1227,1231,1234,1237,1245,1247,1252,1254,1255,1260,1265,1273,1274,1275,1276,1280,1281,1287,1288,1290,1291,1292,1294,1297,1299,1300,1301,1302,1303,1305,1307],"sha256":"a3fd10844e2d4994f118e4a64a563be049bcc53b361d3a5bd531dcc7305af0b1"}},{"n":235,"visited":"139lf///v/e//99/+/////97/7/9///f///7Vn8H","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","unvisited":{"count":25,"items":[3,5,70,138,15,143,17,210,19,20,85,23,216,219,221,158,31,95,161,223,98,231,54,59,189]},"unfinished":{"count":25,"items":[3,5,138,15,143,17,19,20,23,158,31,161,54,59,189,70,210,85,216,219,221,95,223,98,231]}},{"n":129,"visited":"AAAAAAAAAAAAAAAAAAAAAAA=","running":"QIAAAAAAAIEiQAgAAoAggAE=","unvisited":{"count":116,"items":[0,1,2,3,4,5,7,8,9,10,11,12,13,14,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,57,58,59,60,61,62,64,66,67,68,70,71,72,73,74,75,76,77,79,80,81,82,84,85,86,87,88,89,90,91,92,93,94,95,96,98,99,100,101,102,103,104,105,106,107,108,109,110,112,113,114,115,116,118,119,120,121,122,123,124,125,126]},"unfinished":{"count":129,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128]}},{"n":879,"visited":"AAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAhAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAEAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAEAAAAAAAAAAAA=","running":"AAAIgAAAQQAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAACAAAAQCAAAIQAAAAACAIAAAAAAAAAAAAAAAAAEAAACAAAACCICAAAAAAAIAIAAAAAAAQUAAEAAAAAAAAAAACAAAAAAoAAgAAAECAAAAAA=","unvisited":{"count":841,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,20,21,22,23,24,25,26,27,28,29,30,32,33],"tail":[847,848,849,850,851,852,853,854,855,856,857,858,859,860,861,862,863,864,865,866,867,868,869,870,871,872,873,874,875,876,877,878],"sha256":"c11482cc5999fc48f13c6a1f93a3b1abe5f136fda6838bf88f3a6486f9f04dc6"},"unfinished":{"count":871,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[847,848,849,850,851,852,853,854,855,856,857,858,859,860,861,862,863,864,865,866,867,868,869,870,871,872,873,874,875,876,877,878],"sha256":"f6b3d641ade0b9696b0e0cede36b23ee74e7fb03b551260aa685103ab86083fd"}},{"n":144,"visited":"/////////////////////9//","running":"BMuAAAABCAQQGgQAAAAAAQAA","unvisited":{"count":1,"items":[133]},"unfinished":{"count":1,"items":[133]}},{"n":1734,"visited":"AAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAEAAAAAAABAAAAAAAAAAAAAAAAAIAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAABAIAAAAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAIAAAAAIAAAAAAAAAAAAAAAAABAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAA==","running":"IAIAiAAAAAAAAAAQCBCBAIAEECAAEEWAASAAEFAEAAoIAAAAAoAEFAJACgAAAHBAgAgYRAEEAQBBBKAEABAACJASAEAAQIBACIAISIAAECAAAIBJAAIBIAgMAEIAEgAAAAAAghAAIAgAABIiBAAAEADAAAARAJABAACAAAwAgSAAABABABCgAABgQIIAIIAIEAAQgKAggBAOAAAAjCAEAAAAGAAgJAAA2QAEAAGQAkBAAAgoBqcAAAGAAAAAAAQQEEgoBAAAAAwAQAAIEggAgAAAAYBEAQIkAA==","unvisited":{"count":1524,"head":[0,1,2,3,4,6,7,8,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,28,29,30,32,33,34,35],"tail":[1696,1697,1699,1700,1701,1703,1705,1706,1707,1708,1709,1710,1711,1712,1714,1715,1716,1717,1718,1719,1720,1721,1723,1724,1726,1727,1728,1729,1730,1731,1732,1733],"sha256":"091043637823203c5798b2f70184266b5e8eae47e288cd9e69f42a517697036c"},"unfinished":{"count":1717,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[1702,1703,1704,1705,1706,1707,1708,1709,1710,1711,1712,1713,1714,1715,1716,1717,1718,1719,1720,1721,1722,1723,1724,1725,1726,1727,1728,1729,1730,1731,1732,1733],"sha256":"fabcecc02a7cb88aabdec62da9b24ec1de97058cd3933470b07e81db3809b732"}},{"n":289,"visited":"////////////////////////////////////////////////AQ==","running":"AAAoAKAAAAIACgAAAAAJQAABAACAABAEACAAEEAAiIgAFIAAAA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":976,"visited":"z9s1/dz++nvz/Ad3afZb1z8zcuq/DLdxHfWQ3dwyp73/kk9HA+N/elmu383/er3UeVd3T9r2/4N/+q5rvJP7qQ8K5Tt1fSQub/i0LtF/Pggld/1f53/w/y5f+E6Nm+J5r2120aWNz2/F4uGMn9rp6affvSD02V8syfA=","running":"AAAAAAAIAAQAAAAAAAAAAAAAgAAgAAACAAAAAAAIAAAAAAAAAAAQAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAABAAAABAAAAAAAEQAAAAAAAAAAAEAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAA=","unvisited":{"count":362,"items":[4,5,10,13,17,19,22,23,25,32,33,37,40,48,50,63,66,67,72,73,83,84,85,86,87,91,95,97,98,100,103,104,107,114,117,119,123,125,134,135,138,139,142,143,144,146,147,152,154,156,166,168,169,172,173,174,175,179,182,186,187,191,193,197,198,199,201,203,208,209,210,211,213,214,217,221,224,225,229,232,234,238,239,243,244,246,249,254,264,266,267,269,270,276,277,279,283,284,285,287,290,291,292,293,294,295,298,299,300,311,312,314,319,321,322,325,327,328,332,334,341,345,348,349,360,362,367,369,374,376,377,379,381,385,386,391,395,397,399,403,407,412,413,415,416,418,421,424,427,442,443,444,445,446,455,456,458,464,468,470,474,476,479,480,481,486,490,491,493,494,498,505,506,508,510,516,517,518,519,520,522,524,525,526,527,529,531,532,538,542,543,545,547,551,553,559,560,561,563,564,566,567,572,574,575,580,583,584,585,586,592,593,595,598,600,604,606,607,609,610,611,613,623,624,631,632,633,634,636,637,638,639,641,643,644,646,647,651,655,657,669,671,675,676,687,688,689,690,691,704,708,710,711,717,719,720,721,722,728,732,733,735,737,740,741,742,746,749,750,752,754,755,756,761,762,767,772,774,777,780,783,784,787,791,793,794,795,797,801,803,804,806,809,812,813,814,820,821,828,831,833,835,836,837,840,842,843,844,849,850,851,852,856,857,860,861,862,869,870,872,874,877,881,882,884,889,890,892,899,900,902,909,913,918,920,921,922,923,924,926,927,928,929,931,937,938,941,949,951,952,953,956,958,959,961,962,964,965,968,969,970,971]},"unfinished":{"count":368,"items":[4,5,10,13,17,19,22,23,25,32,33,37,40,48,50,58,63,66,67,72,73,83,84,85,86,87,91,95,97,98,100,103,104,107,114,117,119,123,125,134,135,138,139,142,143,144,146,147,151,152,154,156,166,168,169,172,173,174,175,179,182,185,186,187,191,193,197,198,199,201,203,208,209,210,211,213,214,217,221,224,225,229,232,234,235,238,239,243,244,246,249,254,264,266,267,269,270,276,277,279,283,284,285,287,290,291,292,293,294,295,298,299,300,311,312,314,319,321,322,325,327,328,332,334,341,345,348,349,360,362,367,369,374,376,377,379,381,385,386,391,395,397,399,403,407,412,413,415,416,418,421,424,427,442,443,444,445,446,455,456,458,464,468,470,474,476,479,480,481,486,490,491,493,494,498,505,506,508,510,516,517,518,519,520,522,524,525,526,527,529,531,532,538,542,543,545,547,551,553,559,560,561,563,564,566,567,568,572,574,575,580,583,584,585,586,592,593,595,598,600,604,606,607,609,610,611,613,623,624,630,631,632,633,634,636,637,638,639,641,643,644,646,647,651,655,657,669,671,675,676,687,688,689,690,691,704,708,710,711,717,719,720,721,722,728,732,733,735,737,740,741,742,746,749,750,752,754,755,756,761,762,767,772,774,777,780,783,784,787,791,793,794,795,797,801,803,804,806,809,812,813,814,820,821,828,831,833,835,836,837,840,842,843,844,849,850,851,852,856,857,860,861,862,869,870,872,874,877,881,882,884,889,890,892,899,900,902,909,913,918,920,921,922,923,924,926,927,928,929,931,937,938,941,949,951,952,953,956,958,959,961,962,964,965,968,969,970,971]}},{"n":85,"visited":"/////////////x8=","running":"AAAAAAAAAAAAAAA=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":1439,"visited":"/P//v9/9e/u99/6X3/Z/7//v/f/f/////+/Z9/f//1///pb//93///ved/3/2///fv7Pz//7+qf7f/v/u/3v+//f7/7/v/9//f/3/////z9+////+f//f/v//8t/v9f///2v9/+3///e/93//+/////t+3/9f7///+/9///+/////f/33///1/+/f77/d/////uvfn//f/+/v/fv/93/2/9r///7//9/53/7///9e/+//s9/","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAIAAAAAIAAAAACAACAAAAAAAIAAAAAAAAAAAAAAgEAAAAAAAAAAAAAAAAACgAAAAAAAAAAAAAAAAAAACAAAAAAAAAQAAAAAAAAIAAAAAAAAAAAAAAAQAAgAAAAAAIAAAAAAAAAAAAAABAAAACAAAAgQAAAAAAAQAAIAAAAAQAAAAAABAIAAAAAgAEAAAAABAAAAAAAAAAAAAAAAAAA","unvisited":{"count":151,"items":[0,1,1033,525,532,536,1051,30,37,1061,41,558,50,55,58,1083,1085,575,65,577,70,75,1102,80,595,1111,1112,91,93,94,1118,101,104,107,1131,1135,119,124,638,639,640,647,1162,140,145,1172,1174,1183,673,674,165,1191,1207,703,706,1222,204,1230,209,210,1235,213,730,219,732,733,1244,227,743,1257,1261,750,755,757,1274,253,1277,255,264,777,1290,1292,1295,272,275,788,277,278,790,795,1314,297,811,301,814,1343,832,322,1347,1348,837,328,333,1359,849,1362,339,853,343,345,1385,362,876,365,1394,1399,384,1414,391,392,905,1416,908,914,404,405,1428,1429,412,413,927,929,426,943,432,434,950,443,444,446,450,972,463,977,466,482,486,1000,489,500,506]},"unfinished":{"count":152,"items":[0,1,1033,525,532,536,1051,30,37,1061,41,558,50,55,58,1083,1085,575,65,577,70,75,1102,80,595,1111,1112,91,93,94,1118,101,104,107,1131,1135,119,124,638,639,640,647,1162,140,145,1172,1174,1176,1183,673,674,165,1191,1207,703,706,1222,204,1230,209,210,1235,213,730,219,732,733,1244,227,743,1257,1261,750,755,757,1274,253,1277,255,264,777,1290,1292,1295,272,275,788,277,278,790,795,1314,297,811,301,814,1343,832,322,1347,1348,837,328,333,1359,849,1362,339,853,343,345,1385,362,876,365,1394,1399,384,1414,391,392,905,1416,908,914,404,405,1428,1429,412,413,927,929,426,943,432,434,950,443,444,446,450,972,463,977,466,482,486,1000,489,500,506]}},{"n":38,"visited":"/df/3z8=","running":"ACAAAAg=","unvisited":{"count":3,"items":[1,11,29]},"unfinished":{"count":4,"items":[1,29,11,13]}},{"n":242,"visited":"FJBWAiWAJEB3iCuDm0AgnEGDQkYKNSA1SXEaAEFoAg==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":163,"items":[0,1,3,5,6,7,8,9,10,11,13,14,16,19,21,23,24,26,27,28,29,30,31,33,35,36,38,39,40,41,42,43,44,45,46,48,49,51,52,54,55,56,57,58,59,60,61,63,67,71,72,73,74,76,77,78,82,84,86,87,90,91,92,93,94,98,101,102,104,105,106,107,108,109,111,112,113,114,115,116,118,119,120,121,125,126,129,130,131,132,133,135,138,139,140,141,142,144,146,147,148,149,151,152,155,156,157,159,160,162,164,165,166,167,169,171,174,175,176,177,178,179,180,182,183,185,187,190,191,193,194,196,197,199,201,202,203,207,208,210,213,214,215,216,217,218,219,220,221,222,223,225,226,227,228,229,231,232,233,234,236,239,240]},"unfinished":{"count":163,"items":[0,1,3,5,6,7,8,9,10,11,13,14,16,19,21,23,24,26,27,28,29,30,31,33,35,36,38,39,40,41,42,43,44,45,46,48,49,51,52,54,55,56,57,58,59,60,61,63,67,71,72,73,74,76,77,78,82,84,86,87,90,91,92,93,94,98,101,102,104,105,106,107,108,109,111,112,113,114,115,116,118,119,120,121,125,126,129,130,131,132,133,135,138,139,140,141,142,144,146,147,148,149,151,152,155,156,157,159,160,162,164,165,166,167,169,171,174,175,176,177,178,179,180,182,183,185,187,190,191,193,194,196,197,199,201,202,203,207,208,210,213,214,215,216,217,218,219,220,221,222,223,225,226,227,228,229,231,232,233,234,236,239,240]}},{"n":153,"visited":"3///////79//v8f+///v/3///wE=","running":"JABCCGAAAECAhAAQAAAAAgACAAA=","unvisited":{"count":9,"items":[135,78,83,52,84,85,116,88,61]},"unfinished":{"count":10,"items":[5,135,78,83,52,84,85,116,88,61]}},{"n":8,"visited":"9w==","running":"AA==","unvisited":{"count":1,"items":[3]},"unfinished":{"count":1,"items":[3]}},{"n":12,"visited":"AAA=","running":"xwQ=","unvisited":{"count":6,"items":[3,4,5,8,9,11]},"unfinished":{"count":12,"items":[0,1,2,3,4,5,6,7,8,9,10,11]}},{"n":1276,"visited":"AAACAAAAAgAABAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAABAAAAAAAAAAAAAAAACAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAgAAAAAAAAAAQAAAAAAAAAAAgAgAAAACAAAAABAAEAAAAAAAAAAAAAAAAAAAAAAAAAgAAAA==","running":"AAAEgCACAAgAAAAAAAAIAAAAAAAAAAAAAAABAAAgAAAAAAAAAABAAAIQAAAAAAAQAAAAAAAAAAAAABAAAAAAAAAAAAAQAAAAAAIAAAAAACAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAEAAA==","unvisited":{"count":1239,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,19,20,21,22,23,24,25,26,27,28,29,30,32,33,34],"tail":[1242,1243,1244,1245,1246,1247,1248,1250,1251,1252,1253,1254,1255,1257,1258,1259,1260,1261,1262,1263,1264,1265,1266,1267,1268,1269,1270,1271,1272,1273,1274,1275],"sha256":"dcdf2c759a587eeadfcf394f91d3970781e43595fac42f44baa0bde7bc73d178"},"unfinished":{"count":1259,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32],"tail":[1243,1244,1245,1246,1247,1248,1250,1251,1252,1253,1254,1255,1256,1257,1258,1259,1260,1261,1262,1263,1264,1265,1266,1267,1268,1269,1270,1271,1272,1273,1274,1275],"sha256":"7d9f02772a1ec1ca6cdb46211158b96313a54f32df4690edbbbd1cd142d98073"}},{"n":32,"visited":"/////w==","running":"AAACEA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":1137,"visited":"/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////wE=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":159,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAA=","running":"CSAAAAAAAAACAAAAAAAAAQMQAGA=","unvisited":{"count":149,"items":[1,2,4,5,6,7,8,9,10,11,12,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,121,122,123,124,125,126,127,130,131,132,133,134,135,136,137,138,139,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156]},"unfinished":{"count":159,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158]}},{"n":79,"visited":"7b/+///5/7vffw==","running":"4A/vP7DXOEw8fA==","unvisited":{"count":3,"items":[1,4,14]},"unfinished":{"count":9,"items":[1,4,69,41,42,14,16,58,62]}},{"n":18,"visited":"3/8D","running":"1v4A","unvisited":{"count":1,"items":[5]},"unfinished":{"count":1,"items":[5]}},{"n":106,"visited":"//7/////9////////wM=","running":"IAAAAAAEAAAAAAAAAAE=","unvisited":{"count":2,"items":[8,51]},"unfinished":{"count":2,"items":[8,51]}},{"n":238,"visited":"AgAAEAAAAAACAgAAAAAAAAAAAAAAAAAAAAAAAAAA","running":"EAAAAAAAAAAAAAAAAAAAQAEAAAAIAAAACIAAACAA","unvisited":{"count":227,"items":[0,2,3,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,66,67,68,69,70,71,72,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,127,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,196,197,198,199,200,201,202,203,204,205,206,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,230,231,232,233,234,235,236,237]},"unfinished":{"count":234,"items":[0,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,66,67,68,69,70,71,72,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237]}},{"n":999,"visited":"/////////////////////v///////7v//f////////////////////3////////f/////////////////////////////////7//////////////////////////9////////////////////////////////////////38=","running":"cXSh1DflotqCma6YZ4hEByyFebTResBHhoigRgYOCxXWaPcnfdDasyXqKK6yFmMqmTZzB4+Ae2lNZVcyQIj+KUK7gCDl3fvTvbQdo0zvuutWG1qUdVdMZWN7znbipMLgtCQ8V22P5adbaVOEaaKATIdO4L6j/XE4l7srtG0=","unvisited":{"count":4,"items":[321,178,747,590]},"unfinished":{"count":8,"items":[193,321,747,590,178,182,120,381]}},{"n":29,"visited":"AAAAAA==","running":"AAAgAA==","unvisited":{"count":28,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,22,23,24,25,26,27,28]},"unfinished":{"count":29,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28]}},{"n":306,"visited":"JAAAIAACAQEAAAAAAAAAAIAARCAAAQAoIQGDAFAEIIIAowACASEA","running":"UC0XeQTHRiNpgf2KSlqjdQN8p1l/ksqsfNN5gUnvO0Q6gWsM1UUA","unvisited":{"count":141,"items":[0,1,3,7,9,12,14,15,19,21,22,23,25,26,31,32,33,35,36,37,38,39,43,44,45,51,52,53,55,58,59,60,62,63,65,66,68,71,73,74,75,76,77,78,81,88,90,92,93,94,96,98,100,101,103,104,106,109,111,114,115,116,118,121,123,127,130,131,132,133,134,136,137,143,147,148,153,154,159,167,170,171,173,174,176,178,180,181,184,185,188,190,193,199,202,203,205,210,217,218,219,220,221,222,225,226,229,231,236,242,246,247,248,251,252,253,256,258,262,263,266,267,268,270,274,276,279,280,284,285,286,287,289,291,293,297,299,300,303,304,305]},"unfinished":{"count":273,"items":[0,1,3,4,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,30,31,32,33,34,35,36,37,38,39,40,42,43,44,45,46,47,49,50,51,52,53,54,55,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,136,137,138,139,140,141,142,143,144,145,147,148,149,151,152,153,154,155,156,158,159,160,161,162,163,164,165,166,167,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,188,190,191,193,194,195,196,198,199,201,202,203,204,205,206,207,210,211,212,213,214,216,217,218,219,220,221,222,223,224,225,226,227,229,231,232,233,235,236,237,238,239,240,241,242,243,244,246,247,248,250,251,252,253,254,256,257,258,259,260,261,262,263,266,267,268,270,272,273,274,275,276,277,278,279,280,282,283,284,285,286,287,289,290,291,292,293,294,295,297,298,299,300,302,303,304,305]}},{"n":134,"visited":"QSAkBEAABAIAAIoogAAgAAA=","running":"UHgb4Sef66xzYiagAsmOmAU=","unvisited":{"count":61,"items":[1,2,3,129,5,131,7,8,9,10,132,133,15,22,23,25,27,28,35,36,39,45,46,52,56,60,62,66,67,71,72,74,75,76,79,80,84,86,88,89,90,92,94,96,98,99,100,101,102,105,106,108,109,112,116,118,120,121,122,125,126]},"unfinished":{"count":118,"items":[1,2,3,4,5,7,8,9,10,11,12,14,15,16,17,19,20,22,23,24,25,27,28,29,30,31,32,33,34,35,36,37,39,40,41,42,43,44,45,46,47,48,49,51,52,53,54,55,56,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,82,84,85,86,88,89,90,92,94,95,96,97,98,99,100,101,102,104,105,106,107,108,109,110,111,112,113,114,115,116,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133]}},{"n":18,"visited":"r20C","running":"AAAA","unvisited":{"count":6,"items":[16,4,6,9,12,15]},"unfinished":{"count":6,"items":[4,6,9,12,15,16]}},{"n":24,"visited":"/d//","running":"AAAA","unvisited":{"count":2,"items":[1,13]},"unfinished":{"count":2,"items":[1,13]}},{"n":23,"visited":"AAAI","running":"AAAA","unvisited":{"count":22,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,20,21,22]},"unfinished":{"count":22,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,20,21,22]}},{"n":211,"visited":"Sc69+o++WaZKav4frbJY19GWTeYU2dpz84kB","running":"LDUu6NxS768sIFlZputBbtVb6VR3qAvxXzkH","unvisited":{"count":45,"items":[1,129,131,4,133,7,141,145,148,22,24,152,26,155,163,37,167,40,169,170,178,181,186,187,60,62,64,68,71,72,201,74,202,76,206,79,93,95,100,102,106,113,114,117,119]},"unfinished":{"count":91,"items":[1,2,4,5,7,8,12,13,17,22,24,26,36,37,38,40,46,49,50,53,55,56,59,60,62,64,66,68,69,71,72,74,76,79,80,93,94,95,97,100,102,104,106,107,110,112,113,114,117,119,123,125,129,130,131,133,136,139,141,142,145,148,149,151,152,155,156,160,161,163,165,166,167,169,170,173,176,178,181,186,187,191,194,195,201,202,204,205,206,209,210]}},{"n":1549,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":1549,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[1517,1518,1519,1520,1521,1522,1523,1524,1525,1526,1527,1528,1529,1530,1531,1532,1533,1534,1535,1536,1537,1538,1539,1540,1541,1542,1543,1544,1545,1546,1547,1548],"sha256":"53dee081e414ae6aacd290838fa24f86fe0012ce581318169e8664718df2bf76"},"unfinished":{"count":1549,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[1517,1518,1519,1520,1521,1522,1523,1524,1525,1526,1527,1528,1529,1530,1531,1532,1533,1534,1535,1536,1537,1538,1539,1540,1541,1542,1543,1544,1545,1546,1547,1548],"sha256":"53dee081e414ae6aacd290838fa24f86fe0012ce581318169e8664718df2bf76"}},{"n":250,"visited":"/////////////////////////////////////////wM=","running":"ruA3aLwJAcQOPgKqZvrK52+h9CUfK4QgClEQGpq8gQI=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":247,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","running":"AAAAAAAQIAAAAAACAAAAAAAAACAAAKAAAAAAAAAAAA==","unvisited":{"count":241,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,45,46,47,48,49,50,51,52,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,182,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246]},"unfinished":{"count":247,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246]}},{"n":830,"visited":"O5cNj3I1DR1q5/+ZVJ3f1lebfcq5+Sn2/vay4XGbP/XnhnvL1qu/39/vKnPl6GzAmDtXTnbvYP/79q50fW+e7Xffvk/V5nHaR7nu/nx3zfCOmX2/Pi2XtB6/fFIzLt7Wb5I7e6J3mAM=","running":"AAgAAAAAAAAAAAACAAAAAAAAAECAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAEAEAAACAAAAAAAAAAEAAAAAAAAAAQAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAACAYAAAAAAAAAAAAAAAACA=","unvisited":{"count":306,"items":[2,6,7,13,14,17,20,21,22,23,28,29,30,32,34,35,39,41,43,46,47,49,52,53,54,55,57,61,62,63,64,66,68,71,75,76,90,93,94,96,97,99,101,103,105,109,110,117,120,123,125,131,133,135,138,141,142,145,151,152,154,156,157,161,162,166,169,170,177,178,180,182,183,184,187,192,200,203,208,210,211,214,217,218,219,220,225,226,227,231,234,237,238,246,247,251,259,260,264,267,268,269,270,274,279,282,284,285,288,291,293,298,300,302,310,317,325,332,336,338,340,342,343,346,347,351,353,355,356,360,361,362,364,368,369,372,375,376,378,379,380,381,384,385,386,389,390,394,398,399,403,405,407,408,412,413,415,416,419,423,428,432,433,434,435,436,439,450,456,459,464,468,470,472,473,475,479,481,487,492,495,496,501,502,505,508,515,519,525,528,534,540,541,543,545,547,549,555,556,561,562,563,567,568,570,573,579,580,581,583,585,586,590,592,596,600,608,609,615,619,623,625,628,629,632,633,634,635,640,644,645,646,649,650,653,654,657,663,670,672,678,679,681,684,686,687,691,693,694,696,697,699,702,704,709,710,711,718,720,721,727,728,730,731,733,735,738,739,742,743,744,748,750,751,752,757,760,763,765,772,775,776,778,779,781,782,786,790,791,794,799,800,802,803,804,806,811,815,816,817,818,821,822,826,827,828]},"unfinished":{"count":312,"items":[2,6,7,11,13,14,17,20,21,22,23,28,29,30,32,34,35,39,41,43,46,47,49,52,53,54,55,57,61,62,63,64,66,68,71,75,76,89,90,93,94,96,97,99,101,103,105,109,110,117,120,123,125,131,133,135,138,141,142,145,151,152,154,156,157,161,162,166,169,170,177,178,180,182,183,184,187,192,200,203,208,210,211,214,217,218,219,220,225,226,227,231,234,237,238,246,247,249,251,259,260,264,267,268,269,270,274,279,282,284,285,288,291,293,298,300,302,310,317,325,332,336,338,340,342,343,346,347,351,353,355,356,360,361,362,364,368,369,372,375,376,377,378,379,380,381,384,385,386,389,390,394,398,399,403,405,407,408,412,413,415,416,419,423,428,432,433,434,435,436,439,450,456,459,464,468,470,472,473,475,479,481,487,492,495,496,501,502,505,508,515,519,525,528,534,540,541,543,545,547,549,552,555,556,561,562,563,567,568,570,573,579,580,581,583,585,586,590,592,596,600,608,609,615,619,623,625,628,629,632,633,634,635,640,644,645,646,649,650,653,654,657,663,670,672,678,679,681,684,686,687,691,693,694,696,697,699,702,704,709,710,711,718,720,721,727,728,730,731,733,735,738,739,742,743,744,748,750,751,752,757,760,763,765,772,775,776,778,779,781,782,786,790,791,794,799,800,802,803,804,806,811,815,816,817,818,821,822,826,827,828,829]}},{"n":684,"visited":"97//f///83/7///vX/v//37//3///9/39///29/7////3v2v/u//93+/f//v/fv/////939+//9//+//79////7///////3e9f993///9/7///377ws=","running":"69dt02SQ4N5kVO8hvdZPNq8g6qguF3cKrCX/NoQspbtj6NHxKRwYET/PKDU8OBJELAlg3GnGo+lYjjX6vyy7LP2PNKq6sPpFTKCimV/QvGeHWOWi3Q0=","unvisited":{"count":19,"items":[264,273,657,666,423,424,50,51,315,573,577,327,455,343,92,605,229,361,370]},"unfinished":{"count":58,"items":[128,512,3,135,264,269,14,273,657,666,411,284,286,159,31,288,676,423,424,682,300,431,561,50,51,181,568,187,315,573,63,577,66,195,579,327,455,334,593,468,343,599,218,92,221,605,356,101,229,103,484,361,106,234,493,370,627,632]}},{"n":82,"visited":"/////////////wM=","running":"AAAAAAAAAAAAAAA=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":17,"visited":"AAAA","running":"AQEA","unvisited":{"count":15,"items":[1,2,3,4,5,6,7,9,10,11,12,13,14,15,16]},"unfinished":{"count":17,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]}},{"n":4,"visited":"AA==","running":"AA==","unvisited":{"count":4,"items":[0,1,2,3]},"unfinished":{"count":4,"items":[0,1,2,3]}},{"n":9,"visited":"7wE=","running":"QAA=","unvisited":{"count":1,"items":[4]},"unfinished":{"count":1,"items":[4]}},{"n":35,"visited":"AiSQQAM=","running":"AAAAAAA=","unvisited":{"count":27,"items":[0,2,3,4,5,6,7,8,9,11,12,14,15,16,17,18,19,21,22,24,25,26,27,28,29,31,34]},"unfinished":{"count":27,"items":[0,2,3,4,5,6,7,8,9,11,12,14,15,16,17,18,19,21,22,24,25,26,27,28,29,31,34]}},{"n":157,"visited":"///////////+////+/////9//x8=","running":"CGoztGBFFGIS7oKHfwLt20ra9gA=","unvisited":{"count":1,"items":[64]},"unfinished":{"count":3,"items":[64,98,143]}},{"n":337,"visited":"///////////////3/////////////////////7//////////////////AQ==","running":"AAIAAAAAAAAAAABAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":2,"items":[91,230]},"unfinished":{"count":2,"items":[91,230]}},{"n":29,"visited":"8Ik0DA==","running":"AAAAAA==","unvisited":{"count":17,"items":[0,1,2,3,9,10,12,13,14,16,17,19,22,23,24,25,28]},"unfinished":{"count":17,"items":[0,1,2,3,9,10,12,13,14,16,17,19,22,23,24,25,28]}},{"n":20,"visited":"AAAA","running":"AAAA","unvisited":{"count":20,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19]},"unfinished":{"count":20,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19]}},{"n":2860,"visited":"AHCQAEARAFAACQIAgBAAACIEQBAEIAAA4gAABAgEBAAAAAIAAIggAgSAGAAEAIAgJAAAAAAAAAEDwABgABDAAAAACQAAKgiAEAjAgABQAICBQAgBCAAAxBAAEAgAAhBTAQIAAASAAAUAACIBiAQAQAAUANCAACAQIIABAAAAAEEAAECBCCAUAABwACIAAKSGAAAAKQADBAYCEBgEhAhAAERgAIhQAAAIQAEAIAACUABgICSABVAAQCdAAAIAAAgAEIACBCFAABAJgAAEgQEAAABIAABCACJgAIIAACCAAAIAgAACACAAJAQAAACAYggCBAAGACAAAAQBIAIJAIAgBEIQLgYIAAIMAAAiAAACEAACIEAAAgACCAAEAAEAIAAgoQAAAACAAQAACAigAAAgQBQAAAgIAQIAABCCAAlMsiBCBAgCAACAoAYAAABAAAgAAASABBgAoAAAAIAAAAEAAICKAIAAAA==","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":2543,"head":[0,1,2,3,4,5,6,7,8,9,10,11,15,16,17,18,19,21,22,24,25,26,27,28,29,30,31,32,33,34,35,36],"tail":[2824,2826,2828,2829,2830,2832,2833,2834,2835,2836,2837,2838,2839,2840,2841,2842,2843,2844,2845,2846,2848,2849,2850,2851,2852,2853,2854,2855,2856,2857,2858,2859],"sha256":"af3859c3e1fe5b93af018b0f045e19a61b59418d3ec902c27fd8057591959010"},"unfinished":{"count":2543,"head":[0,1,2,3,4,5,6,7,8,9,10,11,15,16,17,18,19,21,22,24,25,26,27,28,29,30,31,32,33,34,35,36],"tail":[2824,2826,2828,2829,2830,2832,2833,2834,2835,2836,2837,2838,2839,2840,2841,2842,2843,2844,2845,2846,2848,2849,2850,2851,2852,2853,2854,2855,2856,2857,2858,2859],"sha256":"af3859c3e1fe5b93af018b0f045e19a61b59418d3ec902c27fd8057591959010"}},{"n":199,"visited":"AAAAAAAAIMIAAAAGAASEAgAAANAgAAAAGA==","running":"AAAAAAAAAAQAAAQAAAAAAEAAAAAAAAAAAA==","unvisited":{"count":180,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,54,55,56,59,60,61,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,83,84,85,86,87,88,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,107,108,109,110,111,112,113,115,116,117,118,120,122,123,124,125,126,127,128,129,130,131,132,133,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,157,160,161,162,163,164,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,197,198]},"unfinished":{"count":183,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,54,55,56,58,59,60,61,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,107,108,109,110,111,112,113,115,116,117,118,120,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,157,160,161,162,163,164,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,197,198]}},{"n":26,"visited":"AAAAAA==","running":"NzJTAw==","unvisited":{"count":12,"items":[3,6,7,8,10,11,14,15,18,19,21,23]},"unfinished":{"count":26,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25]}},{"n":965,"visited":"1H/hPbG214P7P4378pE7rZElKUP79Rn6y75z+GODbp9y/Vkr/zcW+WDt7t6XDYrt8sRfuLPbq9Y6K05+F+u+fCXZcpXcqkCJ3OPf+24jL7rq8+TSzY68q+oUPu3XZsrn/N/HNLcqa3Z/r6Jo94yfLu8vhTp9I9FPDw==","running":"AEAABgAAEBhABQAIIIBAAEAAAACAAAHAAAAAAAAAAgAAAAQAIAAgCAAoKCAAIJAAGAIEAAGQAAARUQECAAAgABQAAAASAAKAAAAAAAAQAAIAAIQAIEgoBAAQgCAAQCCAEACAAAAAAAAQjAAhBAAhACAAAAAUAoEAAA==","unvisited":{"count":362,"items":[0,1,3,5,15,17,18,19,20,30,31,33,34,35,38,40,43,46,51,53,58,61,62,66,78,79,81,84,85,86,90,96,98,99,105,106,107,109,110,114,119,121,124,126,129,130,131,133,137,139,140,142,143,145,146,148,150,151,154,155,156,157,159,162,169,171,177,178,181,182,183,184,186,194,196,197,200,206,210,211,215,216,217,218,226,227,228,231,234,235,236,237,238,240,244,247,253,254,256,258,259,263,265,273,277,279,282,284,286,287,299,302,303,304,307,310,311,313,314,320,321,322,323,324,327,329,332,336,340,344,355,357,358,361,364,366,367,368,370,373,374,377,380,384,386,392,395,396,397,405,407,408,409,410,414,418,419,422,426,429,434,436,438,440,443,445,450,454,455,458,463,468,469,471,472,479,483,485,486,487,490,492,496,502,504,505,511,513,515,518,519,521,522,525,528,530,531,535,537,539,541,542,544,549,552,554,556,558,560,562,563,564,565,567,569,570,572,573,574,576,577,581,586,587,588,597,602,608,612,615,618,619,622,623,628,630,631,632,634,638,640,642,644,650,651,656,657,659,660,664,666,667,669,673,676,680,684,685,688,689,694,700,702,704,706,708,712,713,715,717,718,719,720,726,729,732,739,741,744,747,748,751,752,754,756,763,764,768,769,781,787,788,789,792,793,795,798,799,803,806,808,810,812,814,815,818,820,823,824,827,831,839,844,846,848,850,851,852,854,857,858,860,863,867,872,873,876,877,878,886,888,892,894,895,900,908,910,911,913,915,916,917,918,920,922,926,927,929,935,938,939,940,942,943,945,946,947,949,956,957,959,964]},"unfinished":{"count":389,"items":[0,1,3,5,15,17,18,19,20,25,30,31,33,34,35,38,40,43,46,51,53,58,59,60,61,62,66,78,79,81,84,85,86,90,96,98,99,105,106,107,109,110,114,118,119,121,124,126,129,130,131,133,134,137,139,140,142,143,145,146,148,150,151,154,155,156,157,159,162,169,171,177,178,181,182,183,184,186,194,196,197,200,206,210,211,215,216,217,218,226,227,228,231,234,235,236,237,238,240,244,247,253,254,256,258,259,263,265,273,274,277,279,282,284,286,287,299,302,303,304,307,309,310,311,313,314,320,321,322,323,324,327,329,332,336,340,344,349,355,357,358,361,364,365,366,367,368,370,372,373,374,377,380,384,386,387,392,393,395,396,397,405,407,408,409,410,414,418,419,422,426,429,434,436,438,440,443,445,448,450,454,455,458,460,462,463,464,468,469,471,472,479,483,485,486,487,490,492,496,502,504,505,511,513,515,516,518,519,521,522,525,528,530,531,535,537,539,541,542,544,545,549,552,554,556,558,560,561,562,563,564,565,567,569,570,572,573,574,576,577,581,586,587,588,597,602,608,612,615,618,619,620,622,623,628,630,631,632,634,638,640,642,644,650,651,656,657,659,660,664,666,667,669,673,676,677,680,684,685,686,688,689,694,698,700,702,704,706,708,712,713,715,717,718,719,720,726,727,729,732,739,741,744,747,748,751,752,754,756,757,763,764,768,769,781,787,788,789,792,793,795,798,799,803,806,808,810,812,814,815,818,820,823,824,827,831,839,844,846,848,850,851,852,854,856,857,858,860,863,867,872,873,876,877,878,885,886,888,892,894,895,900,908,910,911,913,915,916,917,918,920,922,926,927,929,935,938,939,940,942,943,945,946,947,949,956,957,959,964]}},{"n":110,"visited":"/qTaxYd/N3/+8qkeGi4=","running":"fQqX47LS1MctDW0e6BA=","unvisited":{"count":18,"items":[96,98,35,38,8,104,12,14,81,51,84,21,88,27,28,93,94,95]},"unfinished":{"count":41,"items":[0,8,9,11,12,14,16,18,21,25,27,28,29,35,36,37,38,47,51,54,55,63,64,72,74,75,81,82,84,86,88,93,94,95,96,98,101,102,103,104,108]}},{"n":39,"visited":"mKFQHAM=","running":"aCP+QyE=","unvisited":{"count":14,"items":[0,1,2,34,35,36,38,10,11,12,14,16,29,31]},"unfinished":{"count":26,"items":[0,1,2,5,6,9,10,11,12,14,16,17,18,19,21,23,24,25,29,30,31,34,35,36,37,38]}},{"n":84,"visited":"AQAAAAIAAAAAAAA=","running":"mFXxEo6mlYj+EQQ=","unvisited":{"count":45,"items":[1,2,5,6,9,11,13,15,17,18,19,24,26,27,29,30,31,32,36,37,38,40,43,44,46,49,51,53,54,56,57,58,60,61,62,64,73,74,75,77,78,79,80,81,83]},"unfinished":{"count":82,"items":[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83]}},{"n":134,"visited":"AAAAAAAAAAAAAAAAAAAAAAA=","running":"AAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":134,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133]},"unfinished":{"count":134,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133]}},{"n":882,"visited":"//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////8D","running":"aspWLP5JJv+4xRpITfGq766pGn4Sjt1dgniHB0zKAnGdDYd0oYQmKe7o7nIiXMDnBx0grNWIJODycFDYj6XW+f8EsUsZfskSHDCiqY+aVwPbWJVCZb8kJAVOYlo1vahfaFEHTwhfPLFQ2fYeYlUB","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":191,"visited":"9///273v/9///+37//b89///999///9/","running":"AAAAAAAAAAAgAAAIAAAAAACACAAAAAAA","unvisited":{"count":17,"items":[33,3,26,38,167,104,107,44,112,81,113,29,84,157,90,123,61]},"unfinished":{"count":18,"items":[33,3,90,38,167,104,107,44,112,81,113,61,84,147,157,26,123,29]}},{"n":19,"visited":"/78G","running":"AAAA","unvisited":{"count":2,"items":[16,14]},"unfinished":{"count":2,"items":[16,14]}},{"n":88,"visited":"7///2/v6/n/7d+s=","running":"AAAAAAAgAAAAEAA=","unvisited":{"count":13,"items":[34,66,4,40,42,75,79,48,82,84,26,29,63]},"unfinished":{"count":13,"items":[34,66,4,40,42,75,79,48,82,84,26,29,63]}},{"n":51,"visited":"////////Bw==","running":"AAAAAAAAAA==","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":636,"visited":"AAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAA=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":634,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[604,605,606,607,608,609,610,611,612,613,614,615,616,617,618,619,620,621,622,623,624,625,626,627,628,629,630,631,632,633,634,635],"sha256":"d104360e71bb46cdf33aed9872ceaa6bf5af2b60eaf63efe0e179cb019000332"},"unfinished":{"count":634,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[604,605,606,607,608,609,610,611,612,613,614,615,616,617,618,619,620,621,622,623,624,625,626,627,628,629,630,631,632,633,634,635],"sha256":"d104360e71bb46cdf33aed9872ceaa6bf5af2b60eaf63efe0e179cb019000332"}},{"n":22,"visited":"AAAA","running":"AAAA","unvisited":{"count":22,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21]},"unfinished":{"count":22,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21]}},{"n":446,"visited":"K2RDiAEgYBQjWjpAIElMJFkAAQASAAowgQKRqMKIUAAlyqkIOASOWoCQwkYqAAhheHLQJKgUlwI=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":316,"items":[2,4,6,7,8,9,11,12,15,18,19,20,21,23,24,25,26,28,29,30,33,34,35,36,37,38,39,40,41,42,43,44,46,47,48,49,50,51,52,55,56,57,59,61,62,63,66,67,68,70,71,72,74,77,79,80,82,86,87,88,89,90,91,92,93,95,96,97,98,99,100,102,103,105,106,108,109,111,112,113,116,117,119,120,121,123,124,126,127,129,130,133,135,136,137,138,139,140,141,142,143,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,162,163,165,166,167,168,169,170,171,172,173,174,175,176,178,180,181,182,183,184,185,186,187,190,191,193,194,195,196,197,198,200,202,203,204,205,206,207,209,210,211,213,214,216,217,218,220,222,224,226,227,228,229,232,233,234,236,237,238,240,241,242,243,245,247,248,249,250,251,252,253,254,255,257,259,260,262,263,264,266,268,269,273,274,276,278,280,281,282,284,285,286,287,288,289,290,294,295,296,297,299,300,301,302,303,304,308,309,310,312,314,317,319,320,321,322,323,324,325,326,328,329,330,331,333,334,336,338,339,340,341,344,347,348,349,351,352,354,356,358,359,360,361,362,363,364,365,366,367,368,369,370,372,373,374,375,377,378,379,380,383,384,385,386,391,392,394,395,399,400,401,402,403,405,408,409,411,412,414,415,416,417,418,420,422,424,425,427,429,430,431,435,437,438,440,442,443,444,445]},"unfinished":{"count":316,"items":[2,4,6,7,8,9,11,12,15,18,19,20,21,23,24,25,26,28,29,30,33,34,35,36,37,38,39,40,41,42,43,44,46,47,48,49,50,51,52,55,56,57,59,61,62,63,66,67,68,70,71,72,74,77,79,80,82,86,87,88,89,90,91,92,93,95,96,97,98,99,100,102,103,105,106,108,109,111,112,113,116,117,119,120,121,123,124,126,127,129,130,133,135,136,137,138,139,140,141,142,143,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,162,163,165,166,167,168,169,170,171,172,173,174,175,176,178,180,181,182,183,184,185,186,187,190,191,193,194,195,196,197,198,200,202,203,204,205,206,207,209,210,211,213,214,216,217,218,220,222,224,226,227,228,229,232,233,234,236,237,238,240,241,242,243,245,247,248,249,250,251,252,253,254,255,257,259,260,262,263,264,266,268,269,273,274,276,278,280,281,282,284,285,286,287,288,289,290,294,295,296,297,299,300,301,302,303,304,308,309,310,312,314,317,319,320,321,322,323,324,325,326,328,329,330,331,333,334,336,338,339,340,341,344,347,348,349,351,352,354,356,358,359,360,361,362,363,364,365,366,367,368,369,370,372,373,374,375,377,378,379,380,383,384,385,386,391,392,394,395,399,400,401,402,403,405,408,409,411,412,414,415,416,417,418,420,422,424,425,427,429,430,431,435,437,438,440,442,443,444,445]}},{"n":89,"visited":"//9///////////8B","running":"lHugeJBcZO3I1s4A","unvisited":{"count":0,"items":[]},"unfinished":{"count":1,"items":[23]}},{"n":168,"visited":"AAIAIAAgABAACBEIAAAAACoAAHIA","running":"QAgACAEAEAAAAAACAAAEAABBQIBA","unvisited":{"count":141,"items":[0,1,2,3,4,5,7,8,10,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,28,30,31,33,34,35,36,37,38,39,40,41,42,43,44,46,47,48,49,50,51,53,54,55,56,57,58,59,61,62,63,64,65,66,67,68,69,70,71,72,73,74,76,77,78,79,81,82,83,85,86,87,88,90,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,115,116,117,118,119,120,121,122,123,124,125,126,127,128,130,132,134,135,137,138,139,140,141,143,144,145,146,147,148,149,151,152,154,155,160,161,162,163,164,165,167]},"unfinished":{"count":153,"items":[0,1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,46,47,48,49,50,51,52,53,54,55,56,57,58,59,61,62,63,64,65,66,67,68,69,70,71,72,73,74,76,77,78,79,81,82,83,85,86,87,88,89,90,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,130,132,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,154,155,159,160,161,162,163,164,165,166,167]}},{"n":1036,"visited":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","running":"gAhFBUigAAAAgAAYYABAIDUAAAEACEEAAAEAMQAEAAAEBAAQAiAAAIAgCAiAQACBEBAAAAAAEABAAgACwEQoEIAgCAAAAAICAACIAAUAAAQhAAgAIQAUggAAAAAACAAEQAQCAAQBAgAAEAFEAgAEgAoigAACoARAQAGIMBAAIBgAAA==","unvisited":{"count":925,"head":[0,1,2,3,4,5,6,8,9,10,12,13,14,15,17,19,20,21,23,25,27,28,29,30,31,32,33,34,36,37,39,40],"tail":[1001,1002,1003,1004,1005,1006,1007,1008,1009,1010,1011,1012,1014,1015,1016,1017,1018,1021,1022,1023,1024,1025,1026,1027,1028,1029,1030,1031,1032,1033,1034,1035],"sha256":"80b658b640991eb8a1a507377e1b6d16aa68994ecc5a718a0584fd7d57d98151"},"unfinished":{"count":1036,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[1004,1005,1006,1007,1008,1009,1010,1011,1012,1013,1014,1015,1016,1017,1018,1019,1020,1021,1022,1023,1024,1025,1026,1027,1028,1029,1030,1031,1032,1033,1034,1035],"sha256":"16c0720d2c5d1e04c9dc266216db565e8bf4599bf27b2c8a77b84665f3c174ea"}},{"n":132,"visited":"/////////////////////w8=","running":"AAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":0,"items":[]},"unfinished":{"count":0,"items":[]}},{"n":37,"visited":"JAAAEAA=","running":"AAAAAAA=","unvisited":{"count":34,"items":[0,1,3,4,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,29,30,31,32,33,34,35,36]},"unfinished":{"count":34,"items":[0,1,3,4,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,29,30,31,32,33,34,35,36]}},{"n":49999,"visited":"////7////+9/7/+//7f/7////+v/////8///X////////v/7////v////v/v/////////v3///+rf////////9//////////3////////////f////v///+/9/+/////7///r//////v//////7/////////////7/////v/f/7////////v////f////////v/v//3+////9//v/3/////////////////7////////////////v7/+/////////3////////3/3///9/////////v7////99/////////////f////7//+//3////f///v//7//////////////////////////+/////////f/f/f//////////+//////////7///////3///f//////vf///f/////9+/////3////v//////////////1//f///3////7///f///33///3///b////7//////v///v//+/7//////3/99////////+/f/f////////////7///////9/////////+/////9+////////+//////8///////////ff///////////////////7///9+//e/9/v///////////////7////f///////////+//v///3f////////39///////+///7////v/////f/7+///7/////+//3/3//+//////+//////////7////+/////////9/////////7//9//////////////+/////+////////7f///3v9/f//9///f/////v///////9/f/////f9//////3/v///////////f7//9/////////7//////////f//9////////z//////9/+//////9/////////////9/////9///f/7///////////3///////////////3b////////7v/////v///96/e////////////7f//7//7/7/+//f//////f//////7///////////////v///////5//3///+v///3//////9////////X///////////////////////3///////////////////////////////////ff///X///////////f/fv///////9//98///7////n///////////3///3/+///////7//9///////////+/////3/v//+///////////////fr//3/f//1//+//////f///+/3/7/////////////+/+/7///7///////////////f7//7/3////3/////f/////////////////f//////v//////9////////////////////////+///////7/7/////////3/////////////+//v///////////////+////f/f///////7///f/7/////////////3//7//3/73////////3/9////////////3///////++9///7///////////+/++////97fv3/////////9///3////79//v////////////7/+/7////v//f/7///////////f///////+//v//+///7////////+//////9/////3////////////9/9//////////9////////////3////7///////////f///7//9/////////V//////3//////////v3/b///////f/////////f////////////7////+//////9//////f///9///v/7/////////v/////7/////////99//f//f79/9///v/////3/////////v////f////f////7//3///////9/+//////3//7///v//////3//9/9+f///93////v/+//+//////3///////////9/+///////////////3/////v//vv///7//////7///+////f/////////////////3///v///////9////f//33/////////7/+////////9/////v/////9//v/f///////3///+v/////////7///fv///////9//////+/f///////v/f////8////rf///+//////////////77/////e/////+//////////////3/v9//f//f///f//////7/////9//////f//vv/////v///5///3////9vf///////v////f///////+////////////////////v///////7///////3/////e///////+///3//////3/7/9//////////+/////////////////v//7///7/f7///+/8/////////////t//////////////9/////////3+/3+/7/////9////////P///v///+///////9///+////ef/v///7//33/////////////////+/////////9////////f//////f///////+/////////7///+///////+//+///////9////////////v//////////////////+/////3//////////////3////////////////+////f9///////////u7f////+//f/////////v///////9/////////////7/////X///////9f//9////////////////v////9///1////////7////7//////////7///////////////////////////f///f///3////3/////v/////7////u//ff7//3/f/////3/////////9r///f//////v//////////9////3////v////////v////////f///+////////////+/9//7//3//9///////////f9/73//////////////////3//////v//f/////////39/////////9//////////3///9/v////////////////////vf///+///////+/////73//f/73////////////f//////////3//f////////////////f////////////7//3/////v//////////////3/3/9///////9////79/+///////////9/////+/f///////7///////+/v////3+9///3////v/9//fv//////1///////////f/+/7///////////+////////f///9ff/7///7////9///7f/////f///////////////7/////////f///t//7//+//v///////77/f/3////v///vf///////7/vf/////////9///3///7/////////////////////3v////3/////9/9///////////////9////v//+5//v//////////7//d///f/////3/////////+//////+////////9///////977///////////9///////////////////3/////////fv+////+///9//3/////////f///////3////v///////////////f//+///9///////v+///////////////////////////99//+/////3//f///////////v7//3///////////f////////7//f///////////////v+////////////////v//////////////+/////////////////v/v3/7////+///v///b////+//3//////////+////+////v//////3/7////////3/////++v/////////////////////////////f/f////////////f//////////////f///9/////1///////+///////9//3/////////////9+//v////f////3///f//////////v//////3/////v/++//3//////+/////v///////////////////+/3/////////////////////////////v7////////7///////7/+///////+9+1v///////+///7///////f/////f/////////////+//////9//7v///f////////////+3/7/f//3////v//////////////9/////////7////////+//////+///////////7/////////+////////////////7+/////////////////3//f////////+3//////5///////7//9///9/////////9/////////////d/7v////////////f////////v/7////3//7//v9///////////////+//v7//7//////////////f/v////f//////////+/////////////3/////////////3//////f+////9/////v/////+////7v////9/////r////+//////+///////3//////uv//////9///7/v////3/////9////f//v/7/////////////////3z/3//v7//////v///91v3/////1////////7///////9/ff7v3////f/////3/////f//+/////////////////9/7+/////+//////6/99//////////9//f///////7/v/e//////+///f/+//7/v//v//97v/////////9///////////+//////////7////9//////////7///9////////9/+/////v//v//f//7/v7//f/f3////////////////7//////////3////////9////+//79/////9//7+//7/+/////////3///vv///////////////////v//7///9/+//+/////////f/3/////////+/3////f////7/////////b////3/////f///3//v/////7///////////v/////f6v/////////7/////v/7/////////////v///+///v//f///////////////l///////77/////////////////97////7///////37/////////////////////3///////////////////X//////////+//////////////7/////3//+///+5///7///////9///7////////////3f+/7/////3///9///////fv+/3////////9/3///////v//6////////+//////////////9/+////////9//////v////v//9/v9///////////v3/////////////3///////////////+/v+////7v///9/3///+//+//////////v///////////P7/f////////n////////////6//v/v/3///////////3//////+v/3/v/v9//9////////////++///f///6/ff///7/////v///////////37f9////////++3/////3/////////////////////////9/3/////7////////8/////////7//937//////3//////v///9//9f//////////f//////9////////////f////+/////////////9//+//////////3////3///9////////////////////v//3/////+/7///////////////f//////////////////v///////////6///////3//////////////////b////+/v//7f//+/////X//3//////////////////+//5///9////z/+//f/////7/////v//v/f//5//v9//////////f//////f/////7//////////v////7/v/f//+/////f//////////////v//////9+7/3+///////////9///////////////f/////////////v//////////////f9/v/v/////+/////////////////////////3////////////////+/////////////9////7////++/9///////////////9////////v////++/////7//////////fn/f/+////////////f/7//////////+/79////v9//9///////9///////////////v///////////f///////////3/////////9///////////////////////+//////////////v////f////////9//////+//////////////////////////////2///////////////////////////73///////////////3//////9/f/3//////////9/////////////////////////3///////+3///v//7////8//////////////f//f//9/7/////////////////////9/n//////+/////f/////////7/f/////7//////////v/7///v+v/f////r////////+97////f//////3/3///v///////93/////+/+/+////////////7/v///b///3/////////f///9/////////////////////9/7/v///67//////////f///////////////////////7/////////////////////3////9///////9///////////v/9/////9//f//9////////t//9//////f/v////7//+//////////+///3///3////7/1///9///v/////9////////////f3v/////////////////+/f//////f7/////////////9//f/////7/////f/////9/////v//9/7///v//X3///////////////77/79+/////3/f//////v////f//////////////////////////99//////3//+9////////////79////9//////9//////////v7///v///+/3////////P/9///9//vd////////////////////v/3v//////v//////f//////7/3//9//u/////////+/9/////////////////f//v///////////9///////9///f/////9///////9//////////9////7///v///////////////3//////////////////9///7///9/+//////////////+/v/+////7////3//////3///////////+//v33/////////////////////3/////+////v//v//9/f//////7////////v/////f///9///v/////7//////////////////9/f///////////////////////////9///v/////////////////3///////9/////f/f//n5/////39////9vn//////////9f///f//////v//v////////////////+///////////b731/+f/////////+3/////v//+/////f5/777/+/////7//u//9///////f9////////////////////////3/////////////v9/////7////+/////////////////fv/////////7////////v////9/////////7///////9+////////////////////+/////////////9///7v////f////////t//+3///////////v//////////////v//////////f/v/////9////////3/////f///////v///////+//+/////9v//+////////////+/////7/////////////////e/////////////+//9//9/////////9////3//97/3////3/////////////v+7////////////////////////////////////////9f////7///9//////////////v/////////7+///////793////////r//////////f///9//////3//f//v////////////7////f///////////////9/n/9////f/////79///f///v////////3//v///7/////////3/33//////////////v/f//////+/9//////9/////+//+/////////////7///9///////3///f////9///5/7/////////////////////////////3////////v/9//////f//////////3//7////fw==","running":"AAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA==","unvisited":{"count":1477,"head":[28672,24587,40971,32783,12305,4114,45079,49176,16410,28,28704,20523,49197,12336,60,16444,45116,28734,4159,4160,20544,36933,71,4168,45130,76,28749,32848,41041,36950,28760,41049],"tail":[44982,24508,40895,32704,49089,28611,20423,49095,20427,8139,32718,36817,32721,12244,16343,40919,36825,36826,16353,40930,4068,12262,32742,32746,36847,16367,45041,24559,32753,28669,36862,45055],"sha256":"9d0081016eaaa691e51704304b4e742e9a4cc73c572c10ce3d58dee93b493dfe"},"unfinished":{"count":1477,"head":[24587,40971,32783,49176,16410,28,49197,60,16444,71,76,32848,41041,41049,32858,94,49246,24674,49251,8292,41060,107,110,32887,16506,124,24713,32906,49289,32908,32915,8342],"tail":[24425,24427,24430,8051,40819,24438,49022,40843,8088,32669,24482,16296,40876,40881,49075,24508,40895,32704,49089,49095,8139,32718,32721,16343,40919,16353,40930,32742,32746,16367,24559,32753],"sha256":"ed23710bf7d21d79e268bc53a94fa6afc72b63421c10372b47623976d3a1d32e"}},{"n":49999,"visited":"AAAAACAABAAAAAAAAAAAAgAAFAAAAADAABAAAAAACgGACAEAAAAAAAkBCAEAAEAAAAABAAAAAIAAAAIAAAAAAAAAECAAAAAAABAAAAAIQAEFAAAAAGAAQAAAAAAAACAAIQAAAAgAGAAAAAAAAAAACAAEAgAAAAAAACAACAAAIggwUAgAIAAAAAAABAoQBAAEIAEAAAgAAAIAAAAAAIQABAAgAQAEAIAAAAAAACAiAAAAAAAAAAEAAFAAAAAAEAAAAgAAEAAWAAAAAAQAgAACAAAAAEAAGAAASAEAAAACCECIAAAAAAAgAAAAAAAkBAYAgABgAgAAAgAAAAEAAAwAgAYAAAAAAAAAAAAAAAIAAAAAAJAACAAAAAAAAIAAAEAAAAAAAACAAAAIAgEBAAAAAAACACAAAAAAAAABQAgAAQAAAABAAAAEAABAQAAEAAAAAAEAAAAAAAAAAAAIAAAAQggAASAAAAgABAAAAAAAQAAAAAAAAAAABAAAAAAAAAAAAAASAgAAEAAAAQAAAACAACAAAAAAEAAAIAAAAAAEAQQAAAAAAAAAEAAAAAAAAAAAAEAAAAAAAEAAAAAAAAACAEAAAAAAAAAIAAAAAAAAAAgAgAAAAEgAAAAgABwEAAAAAAshAAAABAgEAAECAYCgAAAAAAAAEAAAAAAAEAAAAARagIQAAAAgAAEAAAAAAgAChwACAAQAQQAABABAAAAAFAAAEAAAQBAAAAAAAAAAAAAAAAYAAAACQAAAAEAgAAAAIAAAAAgAMAAAAAAAAAAAACAAAQAAABCAABAAABAAAAAAACCAQAAABAAQAAAAAAAAYAAABCAAABQAAAAIABAkEAAAAADAAABAAAAQAAAAARIBQAAAYAAEAAAAAAAAAACJAAgAAAAAAIAAAAAgAAAAABAEAACYAABAAAAAAAAACAAAkIAEAAQEgIAAIACAGAAACAQBAAkAAAAAQAAAAAAAAQCAAACAAAAAAAACABAAAAAAAAAAoAAAAAAAAAAAACABAAAAgAAIQAAAAABgEQAADEAAwgAAIAAAgIQAAQIAAABEMCAAAAAAAIQAQAAAAAgKAAAAIACAZAASAAAACAAAAAwAAAIAAAAAAAAAQCBEAAAAAAAAAACAoBAAAAAIAgAAAAAQIACAAQAAIAAEAABAAAABAAAAAAAAAAABAAAAAAAAAAAAABCAAAACABQAAAAAAgAIAQAMAACAQAAAUAAAAAAAAAAEEAABAAIAAABAAAAAAAAAAAAAAAAACAIoGAAAAAAAAAAAIACgAIAAQBAAABCAAAIAACARQAAEAAACACAgAAAAEAJAAAAYAAIAAAAAAAcAAAACAABEAAACACAAAAAgAIAAAAAAAAAQAgAAAgAAACAAAAAADAEAAAAyAAAIAAEAAAAAAAAAAIAAAAAIAIAAQAAAAAEAAAAAAAAoAAUBAgAEAAAAAAAAQAIAAAAAAAAAAgECAAAAAAAAAgCQABAAAAABAAQAAIYAAgCAAAAAMAAABAAEAAAAAEAAgAAQAQAAACAAAAAEBAhIAAAAAAQAAAAAAIAAAAAAAAAAAAAAQAAAAAACEAAQAAIAAAACAAAEAAAAAIAAAAgCAAAIQAAAAQCQABAAACAAAQMAAAAAAAAAgAAAACAQAACEAAAQCAAAAAIAAAAAAAAAAAQAACAAQAAAAEAAQAAEAAQwCIAACAAAAAAAAAAAEAOCAAACYIAgAAAAAAAAIEEAAQAQAAABAgIoAABgAAAAAAgBEAAADQAAIAAoAAEAAIAAMAAAkACAAAIgAgBIAIAAAABAAAAAAAIAAACAIAABIQBAAAgAAAAAEAEACAAAAAAIAAAAAAAAAAAgAiQBAAAIoAAAASAAEgIAAAIACBUAAAAAAAAAAAAAQEAAAAACAAAAAABAAQABSQIAAAAAAAgAQEAIAAAAIAAAAAAAAAAAAAAAAAAUIAAAABAAASAAAAAAEAAACAAIAAAAAAQAJACAAgAgAAAAAggAAgAAAAACEAAQAAQAAAEJBAAAEAAAAACIAAAAAAIBAABAAAgAAAAAgAAAAAAIAAEoAoUAMAAAAAAAAgAAAgAAAAAAIAAEAAAQAAIAAIAAAAAAAAAAAAAAgggAAACAABAIAEBBIEAAAgAABABgAAAAAgAIJAIAAABACAghAAAgAAABAAAACkAAgAgAAAAAIAgACABBEQAQAQAQIAAAAAABCAAAAAIAgAAAAAIAAACAAAAAAAQBKAAAAAAICggAAAAAAAAAAAAAAAAAAAAEAAAAAgAQABoAACIIAAAAEAADAQAAIAACAQIAEAAEkgEAAAAQAABBAAAAQAAAAAADAAAAiAEgAAAAAQAAAAQCgAAAAAAAAIAAGEAAkAAAAAAIAEAAAAAgAAAAAAABAAAQQIAAAAQAAAAAAAAAAAAAkAAAAKABAAAAAAAAAABAAAAAAAAAAEAgAACAgAAAA4AAQAAAAAAgAAEACAAAAAgMAAAQAAAAAAAAAAEAABAiAAIgAAAAIAkCAACAAAEgCAQIAAAAAABAIAABAAAAQAAAAIBAAAgCAiggAAAAAAAAAAAAAAAAEAAAAABAASAAAAAAAAAAAAEAAAAAAAAAAAQAAAAAAAAAAABAAAQAIEDAAAAABEAABAAEAAAAAABAAAAIIQAAAQAGCAAAAAAEAKABAEAAAEAAAAARAAAAAAAACAABAAAAAAAAAQAREACAAAAAAAAAAAAAAAAACQAAAAAAEAAAEACAAQASEBgCIAAAIAAEABAoIAAAgBAAAAAgIAAAAAgAEAAAEEIAkAAAEKACABAAAAAAAAAABggAAAAAAQAAAgAAAAACACAAAADAAAAAAAAQAAAACACAAAAAAAAAAAAAAAAAAAAAAAABAAAAAUAAAAAAAJAGgAAAAAAIAAAAAAAAAAAABQAAAAAAAFABAAAAAAAAAAAAAAQAAAAAAAAAEAAEAAgAAABJAAAAEAAAYQAEQgAAAIAAAAAAAAAkAAAAAAAAKAAABAAIwIQAAAEAAAAAAAAAIAAAAAQAAEAEAAAAAABACAEAggAAAAAAAAACAAAABAAAAAAEAAAAAAgIBAAAAAMABAATEgAgABAAgAAgQAABACCAgEAAAAAAABgAAAAEAAAAgIAAAAPAAAACgAAAEEEAAAwAABAAAgAEAAAAACAAAAQAAAEAAAAAEAAgEAASAAKAAAAAAAAAAAAAAAAAAAAABAgBABAAAAAAIAAAAAAIAAAIAEAAAAABCAAAIAAIAAAAEAAAAAAAAgAAAAAAAAAIAIAAAAAAAABAAAAAAAAAAAQCAABIAAAAVQAAhIAAQAAAAIAAgEAQCAAAAEAAAIAAAAAAAAAAAAAAAABAACAAAAAgwQAABAAIAggAAAEBAIABIACAAAAAAAAJAAAAAAAAQCAAAAABIAIAAAAAAACAAAQAAAAEAIAAAAAUAAACAADAIAAAKAAQEAAkAAEAAAAAAAAACBAIAQQAAAAAAAAgQIAAAAEAACAAAAQAAIEAIBAAQAAAAAAAIAACIAAQCAAAAAAABAACAAAAAAAQAAACAEABAAAAAIgAAEAAIAAAQAAAAAAAAECAAAAAAAAAAABAAAAAAAAAAkAAEAAAAAIAQABgAAACAAAACAAAAAEgCAAABIiABAABAgEAAIAABAAAiAAAAAAAAAAAIAAAABgAwABEAAgQAAAEAAABAAAAEAAAAAAAAABgBAAAAAAAAAAAAAAAAAAQAABEAAAAAoACAAAAAAAAgAAAEAAAgAAAAgAAQAAoAIBAAAAGAAQQwEABAAAAAgAAAIAAAAAEAAAAAAgACCAAAAAAAAAAAAAAAAAAEAAAAgAAAEAgAACAAAAAAAAAEgAAEAAAAAAAAAAAAAAAAAAAAoAABAAAAAAAAgAAAAABAAAAEIAgAgABAAAAAAAAAAAQQAAICAAAgAAAAgQAAAAAAAgAAAAAAACAAACAACAAAAAABAAAAAgAAAAAAABBAAkgAAAAAAAAAEAWAAAAAAAAAgIAEAAQAAAAAAAAgAAIAAAAAAACgEAAAQBCAQAAAAAAAAAAAAAAACAAAkAAigAAJBEQQAgAQAAAAQAAAQgCgAIAgCAAAAAAAAAAEAAAAAAAAiAAABCAAAAAAQACBAABIAgAAAAAAAAAAQAAACAAAAAAAAAAAAEAAAACAAAAAABgAAAAAAACAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAADAwAAAAICEIAAAIAAAChAAAFIAAEAABAAAAAAAAAwACAAAAAAAIAAAAAAAAACAAAAAAAAAAAACAAICAAICAAAgAAAAGAAQAAEAAAgABAAAAAAAACQAAAgQAAIAAAAAACEAAAAAAAAAAAEAAAABIgAAAAADAABAgoAACAAAAAIoAAIQBQQQAAEAAAIAQACAAAAAwGAAAgAAAJAAAAAEACAAAAAAEAAAAAQAAAACQgAAAAgAAAAAAAABgAAAAAAAAAAAAAQgAgAAAAAAAABBAAAAAAAEAgAAAIAAIAAAAAggEAAAAACAAAAAAEgAAAAAAAAAAAAAEAAAAAAAAAAABABBAAAIAAEAIAAAEQAAEAAAAAABIAAQAGAEAAAAACAAAAAAAAAAAQAgCAAAAAAACAAYECAAAAACAgBAAAAAABQAAAAAAgAAEMAAAAAAAAIAAAAggEAACCAAAAABgABAAAAoAAAAAAhAACAAEAAAAAAAAQgQAQAAAAAACEAAAFEAgAAAEAAkAAAAAAAAAAAAAgAIAgQQAQCAAAAAJAEAAggAAAAAAIQBBAAAEgAAEEAAAAAAAAAAQAAAQAAAIAAAIAAAAAAAgAAAAEAAAAAAAAAAABAAkgAAAAAABAAAIAAAAAQAAAAAAAAAAEAAAAAQAAABADiAAAAQAAIAAAAAAAAAAAAAAAAIAEAAAAAQEAEIAAAAAAAAIAAAAAAIAAAAAAAAEAAAEIAAAAARAAAAAAAAAAAAAAoAAAAhgAgBAAABAAAAAAAAAERCCAAAAAAAAAAAIAAAABAgAAAAAEAAAEAAAAAAAAAAEAAAEAAAgAABAEAAAAACQAAAEQAAAQgAAEIAABAEBAABAAACAABAAAAAAAABACBAAAAAAAAAAAAAAAAAAAACAMAAAAAAAAEBAAAAAgAAAAAgCAAACAFEAABAAgFCAAACAQAAAIABEAAAABAAAAAAAABAQAAAAIAAAEAAAAEAACAEAAAAAAAIAAKAABAAAAAAAAgAAEAAEAAAAAAAACAAAEEAQwBAAAAQAQAAIAGAAAAABABAAQQAAAAAQAgggAAAAAAAQAAAAAAAAABAABAAiAgAQQAAQEAIAAAAAAAAACAACAAAAAAQAAAAAAGAAAQAAACAIAAAAAAAAQAAAIAAAAIAAAgAEEAgBAABAAAAAAAIAAAAQBEAAAAAAAAAAAAAAAAAAAACAgAAEAAAABAAAAEAAAAEBABAAAAAQEAEAAAAAAAACAgAAAAAAAADAAQgAgEAAAAEAAAACgAQIQAACgAAAAAEAABAAAAAAAAAAAAAAIAAAEBAAAgIAQAAAAAAAAIIAKAAAAAAAAAEAAEACAAAAABAAwBAAAQgAAAAAAAAAAAAAAAgACADBAAgAAAAAIAAAAAQIAAABEgAAAAAAAoAQBAAAAAAAAAAAAAAAAQCAAgAAABAAAIAAAAABAAAAAACAABBBBAAAAEAgAAAAAAAAADAAAAAQAABACQAAAAAAEAACggAAAAAAAAAAgAAAAwAAAAAAAAAQCAAAkIIAAAAAAUACAEIAAAAABACSIAAAAAAAAAAAAABAAAAAAAABAAAAAAAAAABAAAAAAAEAEBAAgABjQAgAAAAQCAAAAAAAAAAAADgAQBAECAAAgAAAAAAAAgAAAgAAEBAFAAAAAAAAAgBAAAAAgIYwAAAAAAAAAQgBEAAAAAAAAAQCAAAAAAAAgAAkAAAAgQAACAgAAAgAAGgAAICAAAAAAAAAAAAASQAAAIEAAAAAEAAASQAACAAAAQAAAEAIAAAggAABAAAAAAAAAIAAEACAAAUAAAAAAAAAAADAEAAEQAAgAAAAIAAACAAAAAAAAAAAAABAEAAAAQAAAAIAACAAEAAAAAAAAABAAIAAACCAAAgABCAAAAgAABCQBAgQAAgAEAAACCAAIAAAABAAAFAAAgAAAAIAAAAAAAAgAAEAAAAAAAAAAAAAgQAAAAQgAAAABAAggAAAgAAAAAAAAAAAAAIAAAAAAAAABAAAAAAAAAAQQAACAAEAAIgAAAAAIIAABAAAAIAEAAEYAEAEAAAAAABAAAAAAAAEAEAAAAAAAQAAAAAAAAAAACAIAAAAAAEAAAAACACAABACAAEgAAAAAAAAKIAgAEAAAIAAAAAABAAAABAAAAAAAAAAEABAAAABAAAAAAAgAIAAACAAAABEAgABECACiAAADgAIAABCBACFAAAAAIAAAAAAAKAAAAABAAACAgAACAAAAAAAAAAAAAAAGAAAAACAEAAAAIAgAAAAEAAAFAAAAAAggAAAAAAIAAACAAAQAAAAAEAAAAQAAAAEAAAAACAAAAAAAAAAAAAAAgQAAAIAECgAAAAgAQAQAAIAAAAAAAAAAAgBAAAAAAAAAAAAAAABACAAAAAAAAACAAIoAAQBAAggAAAAgAAACAAAEAAAAAAAgAAAAAAAAAAQAAAAAEAAQABAAAAAAIAKIAAAAAAAAAAAABAAAAAIAAAAgCAAAAAABAIAAAAAAACEAAAAQAAAAAIQAEBAAAAACEEAAAAKBAAAAAAQAAEAAAAAAQAAAAAAAAAAQAAACAAAAggAAAAAAAAIAAAAgQgAAAAFAAAAAAAABEgEAAAAKIEAIAAAAAAAAAAAAAAAAEQAAAAAAAAAgCAAAAAIAAAAAAAAAIQAAAAAAQGAAAAAAAAACAAAABIABACBAAAAAAAQECAAAAAAQIAAAAAAEABAAIEAAAAAEAQACAAACAACAAAAABAgIAAAAAAAAAEAIAAABCCAADAAAAQAAAAAQBAAQAAAAAACAgAAAAAAAEgADAAEAEUAAAAAAAAAAAEACAAQEgAAAAAAAAAAIABAgAAAAEAAAEQAQQAAAAAABAEAAAAhAgAAAAAEAAAAAAAAIAAIACAAAEAAAAAAAAAgAQAAAAAAgAAAAAgAwAAAAAAAAAEAAUAAAIAAEAEABAAAAAAAAAAAAAAAAAAAAQAAAAACAQgAkQAAgAAAAAAAgAAAIQAABAgIAAAAAAAACAAQAAAAAAAAgEAAAAKAAIAAAAECAAAEAAAAAwAAAQAAAAAQgAAACUAAAAwAgAAAAAAACAAEAAAAAAAAAAAAAAAAAwAAAAAAgAoAAAAAAAAAAAAAAABAAAAAIAAIUHAAQAAAAEAAUCgABKAAIAAQAAAAQAQAEAQAAAABEAAAAAAACIEAACAAAAAEAAAIAgAAAAAUAAAAAEAAQAAAAAAAQAAACAAACAAAAAAAQBAAgAgAAgAAAAACBAAAIAQIABCQAAAEAJoAQAABwIAAAgAAAAAAAABAAAAAAAAACAIAAAAAAAAAAEAAAAAAAAAAEAAAAgIEADACAAABAAAAABAAAAAAAAAEAAAgAgAIBBAAAACAAAAAAAAAACAAAAAKABAAAABAAAgAAAAIAAAAAAAAAAAgIAAiAAAIAAABAwAAAAAEAABAQAAIAgAAAAAQAABAAEAABAAQkABACAAJAAAQgAAAAAAIAAAAABQAAAAEAgAAAgAAAAAAAAAAEAAAAAAAAAEQQAEAQAAQACIIAAAAAAAABAARAOAABAIAAAAAAAQAAAAAAAAAgAIBAIAgAAAAAAAAAAAAgAAwAAAAAAAAACQAAAiAAAAAgCAIQAAEARAAAQAAAACAAAkAQAAAEAAGAAAAEAAQAAgGFAAAAAAAAAIAAAQAACAAAAQ4CAAAAAMAAAAAAAARAACAAAEACAAAACAAAAAAAEAQBQAgAAgAACQQAQIEBAAAAEAACAAAAABAQAAlEICAAAAQCAAAAIEgAAAAAAggAAAAAAAAAQAAAEAAAACAAAAAAAgAAIgEEAAAAAAAAARAgAAAAABJAAAABAAAQAAEAAAAAAAADQAAMQQAIBAIIAAEAAAAAAEAAAgACAAAABARAAAAiAAABAAAQAgAAIQAwAAAAAQAAACIAEAAAACAAAIAAEAAAAAAAAAAEAAAMgAAEAAIAAAAAAAAgAEBIBAJBAgAQgAAABABAAgAAAAAAAAAAAAAAACAQBAAAAIAMAACEAAAAAgAAAACAAEAAAAAAIAAAAAUAAAAAMAABAAAAAAAAAACBAEAAAA==","running":"                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          ","unvisited":{"count":47543,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[49965,49966,49968,49969,49970,49971,49972,49973,49974,49975,49976,49977,49978,49979,49980,49981,49983,49984,49985,49986,49987,49988,49989,49990,49991,49992,49993,49994,49995,49996,49997,49998],"sha256":"d12e2074b5d334d5321719fbeee6757aecb11049c5fa2330967fe88408889380"},"unfinished":{"count":47543,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[49965,49966,49968,49969,49970,49971,49972,49973,49974,49975,49976,49977,49978,49979,49980,49981,49983,49984,49985,49986,49987,49988,49989,49990,49991,49992,49993,49994,49995,49996,49997,49998],"sha256":"d12e2074b5d334d5321719fbeee6757aecb11049c5fa2330967fe88408889380"}},{"n":50001,"visited":"/n///////////+/////f////9+f/7v///+//////7//////////3////v////vb///f/////////////f///9//////////+3/////f////9/////f7/7/f///////////3////////////////e///////v////73/P/////9//////////33//////7zv////f//////X3//////3//b/////d/+//77//7/////////b////f+/9///////9///////////////v+//////f/3//////3//7/7////3//7///3////////////////////////7+///////////////v///////////////////////+///v/////e3/9///3/93/////////7/b//////////7////7//9//////////fv////3////v//////////9//////7//v////////////f/////////////v//////////7////////39///7//////////f++///////f////////3f///7//////v/7/////f////7///+/+/////////v////v7//v///7/////t////99///7////++/v2//73//////////////+/7///r/////3//v//////////v/////////v//////////9//7/////////////v///7////v////////////9////////vv/////f///+////////////9/////////+/////+///////////v////////9//+/3///d///////////3/////f//////////////7//////////////////////9/f////////////////////9////////v/////////////9////f//9////////+7t///////n////////////////////77///+////7////////f////////////f//////9//////+/f/////7v3////////7///////f9///////////+9///v//+9//+f//3/////7////////////////////////dv////v/f////////v///78/79///9////////f//v7////7/////+////+//////3//////7/99/7////////////vb///////3//////////vf//////+///////////9/+3////////+/////////////+/f9//f/+//////////3/////f///+7/3//vf////////3////////7/+///////+/////v/f/+/////+//d///////////////////3/b/3//////9/3//+///////3/+/////+////////f/v+//////+//////v//3/f///////////7//////+///7//fv///3///vf///////9////////7/f/////7///9/////////7//3+////////////9//7//////////f9///z3///////v///+///////7///99///////f////3//////v/////7//////9////9/////////////////////////9////////9/f+///////////////////7/33//v///9//////////////f///////////////////////e////u///f//////////////+//r//7/////////+v////3/////9///////3///7///////3+///////////9///////+/+/////9///n///////+//////////////////9/3/////f////////////v////7//3////9//////////3/////+///79///////////////////////+/39////////////+/////7/////f//7///////////v////////v3/3//////3//7/f//+////3//n///t////z////////////////t//7//9//3//v////////////+//////////99//9//////////9///f/////v+v//3///9//////////+//////////////////3/////////9f////7/////97///3///3X////v//////////////////f//////////v/v/7//////+///////9//////3/////////v////////f////////+//////////////////////v////9///////+//f/////7/9f7///7////////v+///////////f/////3/v//////////37///7/////3/3////f//////f//////f//////////f//3////v/+//////////////////7v////////+3////+///////7////////X//v/+////9//n////////////v////////////////3////f/////v//////////+9///y//////3/////3///7///////////9u//v/f////////////v///////+///f//////+v////////////////////////f+3//+/////////f//////f/3//f3////7/v///////////f379/9/////////////v////////////3/3/7////9/+//////////+///////v/////////////f////////9////n//////P3///////////7/9//++v/////////////7///////////7/f////////////9//////v/////9/////////////3//////7/+//////3///////7///v/v////+//f//7/+9///8/97/3///////////////9/////////////v+//f/+//f////////3/7/r/n///////////7e/7/////3/9////3/////////////+//97/2///7+f//v///+/7///////+v///////////+/////f/////////7/////v///////////+9///9/////////9///////1/////////////////////u////9/////////f/v////////////+////////////f///////f/3//////f///f/7////////v/////////////////////////////////+//////////////////+/3/////v//////f/////9///////7//////////////f/////3//////////////f////////7///////////7///////////v////////////3///////v37//7/+//+///v///t/////////////////+/////////////////////////3/ff///97////////////v///////////////f/u/////f//////37/////////9////////9//////////v3///////9////////+/////////////////////////////////////////////////+9//f//////////////7////v+///////////////3////f/////7//+//v////////////////P//////////////////////v//////////9///////f//////7/ff///////+/vf/////////////+/9//////9//v//////////////v/7/////fe//////3/3/3//////////3/3/7//////3//////7////7///3//////////7//////////////////////////+f+//+//v//f////3///////////////////3/////u//////7////////////////3///////3////////+///3//e/////2/////////////////////////////9/////f////t/v////u///////+/////+//////93/v/7/////////9/f///3/////////////////+/f///////////7/////7//////3////////////9/7/v//////v//+u/f/v///f////////////+////////P///f//f/9///v//////////////79/3/7//////+v//3//+///f//v3///////+/////////+////////////////f+//////+//////////f//f3/+/////9f////3/////9////7+f7/v////+vvf//////v////9//9///9//3//7////v///////////9//f////////99//f/t9///////v///9////7////27v//////////+/////////////3///3/////////1////+//////vf3////9///t//9//7+///9////////f////////////////3//v+////+////v//////////7//////7v/f///////////////v/7/n/+///////f////9/////+//////6////////////3///3///////+v/f///e////+//////////////////v/////////////3/////9//////////////z///f//////////////9////7/////9/98///////7/////3777//7+////7////////////////1//f///3////77/////f///9+//////9//////////7///////////vf//7///v//2////v//////v////////9////1///////v///////////////3////////////3//f////+///////v/+9////////////////////////+///3/////77/////////v2//9///////f///////v//3/////+/b//d////////////////////////////7f+77/////9+/////////////////3//////////7/7////v9/+/////37//1/9/9/9f/f/////7/////////Pv//////////////+/////v///////////////////+/////////f/b///7/3/////////79////9f///7////////9/////f////9//////////////7/////////3//////+//+vv///////////7/v////v/7/////3//////////+//+//////3//////////f///////7/////+/////////////7////3/9/////+////////v//////93/////79/+///////3////3/9///////////////v//vv////v+//////////////f////////v7/3/7/////////////3j////+////////3/3////////v////////////////X///3///////9/f/////////f///7///////37///////P//v////3///3//////////+////f//+////f////////////+/////////v///f////3////9/////////f//////////////z9////3/////////f9///////+f///7/+////////7f//////////+/////9///+5/////7///7/9///r/v/3//3v/3/9////f///9////u/////////////////v//////////////7///////v///5//f////f/9//3/7f////3///////9+v///////////3//////////////////9///6//7///v////////v/f/+////////+///////////////////////9//////7///////////7/f///3///Xf7//////v/7/////f/v////7//++//////1//9///////////////7//////3/////////////f/////7f///3////f////f///7////////9////////////////+/f7////7//////vv+//f//////f/+/////////////////3///f/vv//3/v//+/////////+/////9/v/+///9/+////////////9//v//////////7///d//9////////////////7//////////////39e/////v//////////////7///3/3///7//////////////+//f///9//////////7//f///v/7/////////////7//////////////////9737//ff//////////7//////v//+///f////v///////f//////////////+///////////3///7///7//f//3//////////3//////f3/9////////3/////f/v///+f/////////f//3///37////////////////v+////+9//f//f/////////v///v/////////////9////9///6+/v////v///////////+///////////////3////////f//////////f///f+////////////////9///+//+/tf//////7///9///////////////+//+//////////9/////3//////7/////////37/////9////f///////7///v////////////v//////////3v///v////7///////n/////v////////f//3///f//t/////////v/+2/////3////77//v////////////v//v7//////7/////v////////67///+//////v//////////////97/////////39////////////////9//////b//////7/////9////////////f////////////v//f/f7/////////////9/v/////////v/////////////v///3////+//vv//////v//////+////3////v99//f3///+////3////9v/+///v//7/v/////v//9/v3//////////f//////////7///////////////////9////////3/9///3/v///f/////////////3////7////9///9///////////////+//7//3/+/v//f//////////////////////f//////9/+//////f/////////9/+/f///9//////3/////////f//7/////////6////v/+/////////97////////////////////9//f///9/////////7////+////7//3/////////////////////////v////+////+//9//////99//////+//////////////+//3/f////////7///e//////////v1//9///+//+/////////f/73////+//////////f/////7/////v//f/////////7//9//////f////////v/////++//f////9//+v/t/9////////////////3///////////////f//9//3///////////////////3///////fn/+//////f////////+///////////f//f//7v//////v//v+////+fn////////7//////////9//////f////////r/3//////////////f////////////////3////f////f//////////////////////////9f//////////////////////f////////9///f/+////+///X/7//+//////9/////f/7///9//////////39v///9////9////////////////////+/9/9///////+////////////+9//vv/////////+///////v///f///3+/////////////////////////////////3/////////v33/+/////3//+/2n3///f/////9//7//3////////u9//////f///////////////////3/////ve///9/////////7//////////7//v//////7//////////////9v///////7/////////+////3////////7//f//////9/9///7///+///////v/////9////v////b9///////99//////3/////////////////////9/////////f/////////////8/////////79/f3//3////////f/v3/1//r/////////3//////9//f///////////////+////////9//7//////3/7///////+///3/////9////////wE=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAACAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":1504,"head":[0,20480,32771,12291,20485,8200,16397,16398,15,12301,40977,36878,24597,32792,40985,12315,28700,49201,4145,16436,16437,8251,45115,16445,4160,32841,8268,32850,28755,84,20564,12377],"tail":[8113,4018,16307,44986,44988,8126,8131,12228,28614,32711,45003,24524,45006,32719,28624,20433,40913,28627,40924,45023,24544,20449,24548,24550,20455,16361,24553,4086,28662,49145,24572,8189],"sha256":"6099cccde46aa275f29c6c56db65a34634764fff77ee730564a69bc8a86b1346"},"unfinished":{"count":1507,"head":[0,32771,8200,16397,16398,15,40977,24597,32792,40985,49201,16436,16437,8251,16445,32841,8268,32850,84,24674,8296,117,41091,16516,32900,32901,49288,49289,24720,24721,32914,147],"tail":[40766,48973,40788,48983,16230,32625,32627,40830,49023,32649,24459,24464,24486,8107,8113,16307,8126,8131,32711,24524,32719,40913,40924,24544,24548,24550,16361,24553,8183,49145,24572,8189],"sha256":"318a2dfe863a98d911fd30af7a44420640b115393a0007545a1f628020a5b6f7"}},{"n":50001,"visited":"AAAAAQBAAAIAAAAAAAACAACCAAAAAAAAEQAACAAAAAAAAAgAAAABAAAAAAABAGAAgAAAAgAAAAAAAAAAAAgAAQAEAAAAAAAAAAAAAIAGAAAAAAAAAAAAAAAAAACAAAAQQAAAAAECAAAEAMAAAAAQAIACAoAAAEAAAAQEgABAAAAAAIAAAgAFAAIAgAAgAACAAAAAAAAAAAAAAECAAAggAAAIAAAAAAAQAAAAgABAAACgAAAAAAAAABBiAAAAAAAAABARAAAAAAABAAEABAAAAIAAAAAAggAMAIkIABgAAQAAAABAAAACAAACAAAAAAAAAAAgAAAABAAQAAAAAgBIAAEBAAAIAAAAAAAEAAEIAAIAAAAAgABAIQAABAFABAABAQAAEIAACUAAAAACAAAFACAAAAJAAYAAoAIAQAAAAAAAAAAAQAEAAAAwAFAAAAAAAAgAARAAAQAAgEACAAAAEQgAKAAAAAAAAAAABAIAAAAAAACAwAAAAAAIQEAQAAAAAAAAAAASAAAAAAIAAABAAAABAAgAAIAAAAAAQEAAACAEAoIASQAEgECIAADAAAIACBAgEABBAAAAAAAACAAAQRAIAAAAAAEAAAAAAAABAAAAACAAAAgEAAAAAUAAAgAAIAAAAAAAABAAAAAAAAIAgQAABAAAAACAAICAAAAAAAAAACCAAAAAAAAIECABEQAAAAAAAAACEAIBAAAAAAAAAAACAQCAUAAAAQACAAQAgAAAAAAAAAAABAAAgABwAAAAhAAAAAAAAEACABAIEYAAAAAggAAAACABAAAAAEAAAAAAEAAAgAAACAAAAAASAAAAQAAAEAAIAABAAAAJAAAEAEAAQAAAAAAEAAAAAAABgAAACAAAEAQAQAAAJABAAAQAAAAAACQAAEAAEAAABAAAAAAAAABAAAAgBAAAAAAAAAAEAgBAAAEAAQAAgAAAgQAAABAAQAAAIAAAAIIAAUAAAAAAAAAAAAAhQAAAAIkAAAkAACAAAEAAIAAAAACIAAAAAAAAAAAApAAIAAAAAAQAAAAgAAAQABAAAACIQAAAIAAAAAAAgAAACAEAEBAKAAAEAAEAAAgAAAAAAAAAEAAAAAAAAAQAAAAIAAAgAAIAEACEAISAAAkAAEAAIACAAAAAAAgAAAAAAAAQAACAAAAAABAAAAAgADAABAAAABAAMAAAA0AAEAAAAEAQAAACAAAAAAVAAAgACAAAgAACAABEAAIAAAAAACAAAAIAAJAAAAAAAQUAACCAEAgTgCYBAQgAAAAAAIAAEAAAAAAARAEAAAAAAAAAAAAAAgEAAAgYAAAAAAgAFAAAAAAAAAAAAQBAAAAgACAEAAAIBCABAAAAAAAAAAAIQAAAAAAAAAAAAAACAAAIBAEAIAAABsAAAAAABIAAwABAAAAAIAgCAAAAAABAAAAAgEAABAAAABEAARAQAAAAAAAAAAAABAAArAAAAAAAAAABAAgAAAAAAAIAAAAIgABAAgAFAAAAgQAAAAAAAAAAAAAAEAEAAACIAAAQAAAAARACAAAAAABAQAAAAAAAACAAAAAAMBAEAADAAAgAAAAAAAAAAAAAAgQAAAAAAAAAAAoAABAECAAAEAgAAAABAgAAAAAAAAAAAAQAABAAAAAAIAAAAJAAAABAgCAAAAAACAAAAgQABAAAAAAAQAAAAABBRAAAEAAAAIAAAQAAAAAAgAAAAABAIAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAACAAAACAAAAAAgAABAAAIAAAgAEAAgABAAAAABAAAAAAAIAAABRAAACRAIAAAAgAgAAAAAAAACAAgAAAAg4AAAAAICAAAAQAEAAIAAAABEACAAAIACAAAAAAAAAAAAAAEAAAAQAgAEAAACAAAAAAIAAAAAIAAAAAAAAgAEAQAAAAAAIAAAAAIAAAAAIAAAAABAAABAABEAAAAAAABAAAAAgAIBgAAAAQAAQAAAAAACAAABEBgAAQgAAAAAAAQAACCAgAASAAAAACAkAmAQAAAAAAAAAEAIAABBIIgAAAEIAAAAAEAAAAAAAAKACAAAAAAAAAAIAAIYAgAAAAAACAIAAAIAAAAAAAAAAAQAAABAABAAAAAQAAAAAAACICBAAAAAEAAIIAAAACAUEAAQAAAAAAAAQgABEQAAIAAgAAIAAAAQAAAABAEAAEgQAAEAgAAAhAAAAAAEAQIEEAAAAAAECgACBAAABAMAAQAAgCBICIAAAAAAAAAACABAAAEBEAABQAFAEQQACAAiAAAAAAAAQgAgAAAAAAAhACCAAAAAAAQAABAAAAAAAQAAAQEAAAAAAAAAgECACAAAgIQAAEAAAAQBAQAAAAgAAAAIAgEAAAICQgAAACAEAAAAEIAQAAQQBAAgAAAAAAAAACAgAAAIEAAQACACAAAEAAAACAIAAAAAAAAAQgAgIAAAAAAAAAACAAAAIAgAIAAAAAAAAQAQAAAAAAgAAQAAIAAAAAgAAABAAAAAAIAAAAAAAQAAAAAEAAAAAAAAQAIAAAAAAgAAAAAwAAAAAABYEQAABIYAAIEAABAgQAAAgAQAAAAIAAAAAAAQAAAgAIFAAAAIAAQAAASRACAAAAAACABBAAAAAAIQAQAAAAAKAAAAAAAAAAkCAAAAAAAgAAAAAACAACAAAAAAAAAAAAAIAAAAAAAAEAACAAEAAAAAIAAAAAAAAAIAAAAAAAEAAAAAAEAAAAAAAAAgAAAAAAEAAAgggAAAIAAQQAYAAABAAAgAAAAgAAAAQAAAAAABQAAAAAAAAAAQAAAgAAAAAAAAAABAgCAAQAAAABAQgAAAQBAAAFAgQAAAAKgAACYAABIAAACgAAAGQBAAAACQEAAAAAAAAAAAAANABAAAAAAAAAQACEAAAAAAgCAAAAAABAAQAAQAIAACAAAIhDAAAAAAAAAAAAAAAABAQgGAAAAgAEAAAAIEAAAAgAgkAAgAAAAAAAAAAABABAhBAAIgAhAIAAAAAEAAAQAAAAAgAAAAAAhAAAgEAIC4AACAAAAAAiAgAAAAEAAAAAAAAIAAAQAAAAAAAAAACAAAAAAAACAAAAAAAAAIAAAAAAAAACAAAAQAAAAAEABAAAAIBAAAAAAAQCAQhAAAAAAAAABQAAAAAAAEAAAQCEYAAAAEUAAAAAIACBIACEAAABBGAACIAAAAAAADAAAAAAAAAAAAAAAAAAABAEAAAAAAAQAAAQEAQAECAAAAAQAAAYAAAAjAAAAKQAAAAAAAQACIAAAAAAAQSgAAABAQAAAAAIAAAQAAAAAAAAABAAABCAAAAAAAAABAAAAAAQAMAAAAAAAAAAADIAAAAAAAAAAAAAAAABAAAABAAQAAAARAgAAAAAAAAAAAAAQBAAAAAEAAAABAIhAEEAAAAAAACAAAAAIAAQCIAAAAAAAAAGAAAAAIQgAAAIAABEAEAAAAAAAACAAgABAAAAAIAABAABECAAEAAAEQAAAAAAAAAAAIAIAAAABAAAACAAIAAAAgAAEASgAAABAAIAAAAAQAIAAAAAAKAAQAAAAAGQEAQAAAMAACAABAAAAAAQBABgAAAAAAAgAABACAAQAAABAgEAAQCAAACAEIAAAAAAAhAAAAAAAIAAAIAAIAAAAAAAAAiBAABAAACAAAAAADAAAAKAAEAAAAEBAEgAAAAAAAACAAAAAAAAACAAECIAAAAFAAAACEAAAAUAAAABAAACAAAkABAAAICAABAACAAAAAAgAAAAAAAAAAAAAAAAAAAACIAAAAAgAAAQACAABAAIAAAAAAwIEIBAAAAAAAACAAQAAAAAAAAAAAAAAcAgAEgCQgAAAAIBAAgAAABgBAAAIAEAgAAAAIEAABAAAAAQAAAQgAAAAAAAAAAACAABAAAAQCIAAwAAAAAAAAAAAAAIAAAAAAyAAAAAQSIIAAAAAAAAAAAAAAAAAAAAEAAABAAAAACAAAACAGAAAAAAAAJAAAQIAAAAAAAQAAAAAAQwAAAAAAABCAAAoAACAAkCAAMAEAUAAIAAAAgAAAAAAAQAAACAAAGAAAAAAECAEAAAABAAAAAAAEAAAAAAAQAAAAIBCAACAAIAAIQCAAAAAAAAAQAAAAAAAAAAQAAAQAAAEAAAAQAEAIAYCAAAAAAAAAAAAAEAAQARAAACBAABAAAAAAAAAgAAAAAAQQAAAABAQAAAAYAIQAAAIAABAAIAAQgCAEAAAABEAAIAAAAAAAAAAAAAAAEAAAAAQAAAAAAAAEQAAAAAAAQAAAAAAAAAAQAAAAAAgABCAAAwACAAEAgAAgAQAAAAAAAAAAIBoABAFAABgBAAACAAAAABAAAAIAgAAAAAAAAAAQAAAAgBAAAAAJCAAAEAAAAQAAAAAAAIAAAAABAgCCAAAAAAAAAggAAAAAEAgACAAQAAAIAAAACAAAAAgAAAAAAAAgASAAAIAAAAAIQEBAAABAAAAAgAQAAEAIAGACAAgAAIAACAAgAAAAAAAABAABABAQAAAAAEAAAIAAEAAQCAAAIAQACIBAQAUAYAEQIAAAAAAAAAAAAICAAgAAAIQQAAQAAAAAEMAABAAAEDAAIDAAEAIiAAEIAAAAAAACABAAAAAEAAhAgAAAACIABAAAIIAAAAAAgAAACIAAEgAAgAwAAQQEABAAAAgAAAAAAAAAQAAAAAAAAAAAAAAIAAAQAQAAACQAAAAABQAAAAAEAgAAAAEAAAAAAAAAAIAAAEAAAAABAAgABAAKBAAAAAAAoAAAAAAAAAAoAAAABAAAAAEAAAAAIIAkQAAABAAAIZAACAAgAQAAAAAAAAAAAgACAAAAAAUBAAAACAAAAAgAAQgAAACAAGAAAAAAAAEAAAAAAAAIAAIAAAAAAAAAQEAAAQAAAAAAAAAAAAAAAAAABgAAAAAACAAAAAAEAAAEAAAAAAgAAAAAAAAAAABAQACAAAAAAAAAAAEAAAAAAABIgAQAAAAAAIAAAAAAACAEBAAAAAgACAAgAAgAEAgAQBgAAAAACAAAgAAAABAAQAABCAAQAAAABhACAAAAACAAAAAANQAAAREgAIAAQAAMAAgAgAAABAEACAABAAAEAEAGAAAAAAAAgBAAAQIAAAAABAAAAACIQAAIAAAQAAAEQAAAAAgAAAQAAABoAAIAAAAggAAAAIAAAAABQACEAEAAAAAAAAAAABQDAAaAAABAAAAACAAAAAAAAAAAAAAMAAAAAAAAAAIIAABACAAAAAQAAADAAEAAABICAQAAEAFEBQAIIAAAAAAAAAAAEEAAAiAQACAAAJBDAAQAAAAAAAABgAIAAQUAAAAAAQgAAAAAAAAABAAAAAAQgAAAgAABACAAAAECEAgAAICAAAIIIAACAAAAAgIAAEAAAgAAAAAQQCAgAAgAAQAAAAAAAAAEgAAACAIA4AAAgAQACggAACAAAAAAAACAAAAAAgAAIEAAAAAIAAACAIAAAUgAKAAAAAAQAAAACQAACAAAAAQAAhAAAACIAAAACACIAAABgAIAAEAAAAAAAgAgAAAAAEAAAABABAAAAIAAgAAIkAACAAIAAAQAAAAQAAAQASAEAAQgAoIAAAAAAAAAAAAAAACAAAAAAAQAAAAAAgAkAEAEACAAAAAAAAAAgAAIAEAABAAAAAAAAAAAAAAAAAAIBAAIAAAAEAAAAAAgAAAAAQCAAAQACAAYAIAIEAAAAAAACAAgAQUQAAIAIBAAAAgAAIAAgAAgCIAAAAAAAABAACAAAAAKAAAiAAAAAAAAAEAAIAAAIAACAAEAgAgCRAAAAAEIIAogAgAAAAAACAAAAAAAAAIAAIEABQAAACAAAAACQACACAQKAAAAAAAAAQAAAAAAAAAAAAggAAAAEAAAAAEAQAAAICAAAAABAEAAAAAAAAAGQCQAAAAAAAACoAAAABAMEAgAAAAAAEQAAAAAAAAAAAEAAIAAAAIgQAAAAAAAAAAAAw4AAAAAAAAAABAAAAAiABAAAAAgAAgAIQAAAAgwAAQYCIgCAAAAAAAAACIAAAQCACAAAAAgAAAAABAAFAAAgABAAIAAAgABAAAAAAAAEEAAAAAAggwMAAAAAAABAAAAgAAAAAEAAAAIIIAABAAAAAAAAAQAEAAAAAAAAAAAAAAAAAQAAIhAAAAAKADAAAAAAIgCAIAABABAEMAAgAAAQAAAAAAAAAQAAQAQAAAAAACAAAAAAgaAAgAAAAACAAAAgAAABAJBAABABAACAAiQAAAAAAIAUAAACCAAAAAEEAAAEAAAAQAAEAAgAAQEAQAAAQAAAGAAAACAAAIAAAEgAAAEAACAAAAQAAAAAAAAIYQAAAAQACAAAgAAwIACCIAAQAAAQAIAAAAAAABAAAACAAABIABAAAAAABAAAAAAAAAAAAEgAEgAAAAAAAAAAQAAAAAACECAIAAQABAAAAAAApAABAAAAiQwAAAAECIAAAAAAAAAAIAAAAAAAACCgAAQAAAAAgAFAQAAQAADAAABUAAAIgApAQAAAAEAAlDAGQAAACAAAMAGAAAUACABCAAAQQAAAKCAQAAAABgAAAAAAIAAAEAAAAAwAAgIAAsAAAAAEgAAAgAAAAIAQAAAAACQEAAAAAAAAAIAAAAAAQACAUAGQCABAEMABSAAAUhgAAAACAAAAABAAgAAAAEgAAABCAAAAAABAAAAEABAAAAIAAAAAAAAAAAAAAgAAAQAAAAAABgBQAIAgQAAAAAAAACAAAAAABIAAABAAAAAgAQAAAAEAAAAAAAAEAAAFACACAAAAAAAAAAEAAAAIAAAAAAAAQAAgBKAAEACAAAAAAgAEAAAAAAAAQAAAIAgCAAAAIAAAAAAAAAAAAAgEAABAAAAAIAAACQAAIIAAAAABAAAAAAEACAEAAAAAAAAAAIAAAABAQAgAAAAAAAAAQAAEAIAAQAAAAAAAAEAAAAAAAhAAAAEAgggAAAAAEAgAAgBBAIAAAAAwCAgAAAAAACAAIEAAAIAAIAAAAAAAACAAAAAKAAAABAAAAAAAQAAAAQAAAIAAQBAAAAAAAAAAAAgAIAAAAAAAAASAIABEAAAIAAAAgIAAAIAAQAQAIAAAAAgAAAAAAAAAAAAEAIAEBAgAACEAABAAAAAAACAIAAAAAgAAAAAAAAYCADAEAAAAhAAAAAAAAAAAgAJAgAgEAAAAQAAAAAAAAAAIAAACAAAgAAAAAAAAAAAAAAEEAACAAAAAAAAAAIAIAAABEAQCAAAASAAwQAAAAABBAAAAAIAACQAAAQAAAAAAAAAAAAAIAoAQAAAAAAAQBCBAAYAAAAwIgCAAAAAAAAEIBBAAAAAAgAAAAsAABBAAQAASAAEIACAAACAAAEAABAIAAACAAAAAcAIAAAgAAAAAAIACAQgABAAAkACAAAAAAgAAAAgAAAAAAAIAhAAABBAEAAAAAAAABAAAAgAEAAABAACCAAAEBCAAAABAAQCAAIAABAAAAIAAACAABAAAAAAAAJABAAAQACAAAAAEEiAAAAARAASACAAAAAAAAAgACAAAAAAAgMAEAAACgAAAAAAAAAAAAAAAACAAAAAAACAEQAQEAAAAIBAAAACADAAAEAECAAAAAQICAAAAAAAAAAAAQQAAAAAgQAAAAAAAAAgCAAAACAQAIAAAQAAAAAAAgAAAAAIQAAEAABAAAQgABAAEJAEACAgAACAAASAAACIAAAAAIAQIAAAAAAAAgAAAAAACAARABAqAAAABAAAgAQIAAAACCAAAQAgAQIAAAAAAAAAAJAAAAAAAAAAIAgABABAAQAAAGAAAAAoAAACAAAAAAACACABARGAAQCEAACAAAAEBAAAAAAQCAABAAAABAAAAAIBAAAQAAEAACAAAAAAAAAAAAAhREAEAAEAAAgAEAAIAAAQAAAAAEAAAAAAAAAAAAAAABEAAAgAAQAAACAAAAAECAIAAAAAAAAAAAIAABAAAoAAEAgAAABAAAQQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAJABAEAIAAAAABAAGAACAAEAAAAAAAAAAAAgAAAAAAACAQRAAAAgEBAAAEAAAAAQAAACAoAAIQEAAAAAAAAAAIAAAAoACBAEAAIACAABAAgACAAAAAAAAACAAAAAgAECAIAgAAAIAiAAAAAAAAAAAQAAAAkAAgAECAAgABAAAgEABAAAAQAAAAAAAACAAIIAEAAIAAACAAAAAAAIACAAAAgAAAIIIAAAAAAEAIAAAAAABAAAAAoAAAAgAAAAAAAAAgCAAABAAAAAAMAAgCCAACAgCAAAAAAAAAAABAAAAAEAAAAAAAAAEAIIAA=","running":"                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           ","unvisited":{"count":47486,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,25,26,27,28,29,30,31,32],"tail":[49966,49967,49968,49969,49970,49971,49972,49973,49974,49975,49976,49977,49978,49979,49980,49981,49983,49984,49985,49986,49988,49989,49990,49991,49992,49993,49994,49995,49996,49998,49999,50000],"sha256":"1ed85aa41526b2201233214b2d98edf8033543364eddfa136d41b12b70301f02"},"unfinished":{"count":47486,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,25,26,27,28,29,30,31,32],"tail":[49966,49967,49968,49969,49970,49971,49972,49973,49974,49975,49976,49977,49978,49979,49980,49981,49983,49984,49985,49986,49988,49989,49990,49991,49992,49993,49994,49995,49996,49998,49999,50000],"sha256":"1ed85aa41526b2201233214b2d98edf8033543364eddfa136d41b12b70301f02"}},{"n":70000,"visited":"//////////3//////////////////3///v3f//////3///////////////3///////9+/////3//v////////7///////////v//////+9//9//v9///////////7//////fv//7/////////////99//////+//v///////v///////////////////9///////v///3/7///////////3////////vf///////f/9Pfv/f/////////+/////////////////////9////////f//////3/////7/+/////3////////f3///////f//v///f/////////v////////////+///+//////f/+///////99///397////v+/v//v/////3//v////////f/////37//3/f/7f///////////////v///+/9/f//r/+/3///+////////////////////////3///////////v9f///////////9////v/v2/3//1//////39f+//r////3////////////////////////////f////////O/f//////////////////////7//v/6//9/////////v////////////f///9//////////////f7////+/3a///++//v/3/////7f/////////////7//+/////f/+/////9//9//////t//+//+///////////////3/f///9/f//f+//7//3///v///////////3////v//////////7//33/////9///f///////3//////////////////3/////////////3/3/f////v////9////////////9//fv//////v//f/////f/////////////+///9///f///9///v9///////f//7/7//7///////+9/f////+//////3////+3///7v////////////////////////////////////+/////////////v///3///////+/7v//7///////////+/////9///v9//3//+////////v/////////3//////+////v7//////f//9////+/v////3////////////////////+//////////////v/////++/////7////7////////7////9//7////////+//////////////////f///9////f/////////////////////////////3/////7//t///////////////////////////////////////////7////////5////7/////v//////9//7//+/////3//////7///////////77//////3////f/////////3//////v73/t/+97v//////////77////f/////9/v3///////////////////////////99////////////v//9///93//+///////v/v////7/+/+/93//3///////////////////////f////+/////////////f///////////3/////v/f///////////////9///3//////////////////////////v/////9//////7/////////////////7//+///vfv//////f//////////////77///////////////////////////f/7/v3f///c////3//////////e////////3X/v//v//+/7///7//////////////////9/////////3f///////9///////v///////////////3////3/////////7//////7///7///f//3///+////////9//////////f7///////////3///d//////////3/9///v/////////7////////7///+///33//vv/+////////////+///v//////v/////3/9//v/b//7//X///////////////v//////////////3///9/+/////b/9///+///////7///v/7////////////v//v/++//+//////////79/7///////////7/9+37f/////////////79/////////////9/////////9//f/+////////3///////9/////////7//////////vf///5//f////d//39//v///////////3//////7////////////v////f//9r/////r/////////v/7//f///f//+///////////////////////3//////+////f///////9/////////////f3///v/+7////9////+///u////////////753////v/+/////7////3/1///////f/////////v7////3v//////7/////3///////+f///9/+///3+////+///3//v//////7/v//v///7////////////////////////////////////7///f//9//f//v///33/v////f+////////+/////////////////n/////////9/+//////////////3///f////////9+///v//7/379//////9/////+/X///3/////////////f//////3////v/7/+////f///7////////////+3/3/5////e//////////v/v//////////////////////3///b/////////////b//+////+/////e7/////9n//////////////9//9////v///////////f//5//7//f////////////////////////////7////+/////////9/f/////////////////////97///9//////v/9///////////////////////////f//3/////////////f//////////3///////f///////////////f//////5/////9///////////////f//////9/++////n//3////7////////7/7//////////////////b///f/v//////3////////3///////f/////f////7///////3////f//9/7/////3///////3////9/7///////v/////3///////f////3////f9//e////3//////+//t///////////////+///9////////+////////////////////////////P//3///f//+/////////////////v///3/v39//f/////3///7/////f//////9/+/////////////f/2/+//9///7///////////3/9/+//////3//////f7//////3/+///////////////n/3///////////f/////////v//////////9///f///////+7f//+///////3/////////9/////9/////v//////////////7/////3////f////////7/////+//f///////9/7f///7/3//////////////3/////7////////////7/////f///9f////////XP//9/////+///vv/////+/9///3//////////////////7//7/9///u/////////////9//////f//7/+//f/3/////////////7/v3////////5/+v/3v//////9/////9////3///9////v//////X+/f//v/////////7/////////9/////////9////9////////////f+///////////////v3/////////////////////2/f/+//////////////////////////////////////f////+/9///v//+/////////v///3//////////////+/////+//7//9//////////////////////7/+/9///////v/////+3//+////////+//////////////////3//////+///98+1//////////////////////////////7///////////7/////+/////9+//////////////////b//7//v/f///////////////3///////////3/+/f/f////f/////////////7v///3////u//3//f/////////3//7/////3////////////////////////////////v///////7///////////+/////+/////v7/////9/////+7///7//3//+////////////3/////+////3f//+/+/7/////////f/9//////////////////f/////9//7////7+///99//////7/////////////////fv///////////////////////////f//////////v/3//99//////////////////////9/+//3/////////////f9///////////////////u/////9/+/////////n///3//73v///2/9/////9+///7/7/9//////7////////7////////////////ff/3/v/f/3//////////////v//////7//z/////v////////7/////////////////7/9/9v///////vv//f////+///////v///////9/////7//v////9//////+////+///////v9/////67////////7////7/9f/v/+/////////f/////7/v////9//////v//////////////3+9//9///////+//7//////3/7/////////////3////+//////v//7f///////7/////f//////////v//3///////+/f////v///+///7//9//+///3//v93/////7//v/+////3/////3////////3+////////////+///////v3+////3///3/////////5//////7/////////f////3//////7/////////////f/v/v3/+/3//////3/9///////9//8//+////////+////f///////////////////+////f//////////7/////9///////9f////3/////////9////////////+//////////7///////////////t/////////7//8/9////////////////7///////f//3////////////f//e7/////////7///////3////f////////9/////////v///////////3///////////////3/9//////////////////9//////+////////+//////f///v//////////////7///+3//7///f////////+///7////////////9///+////////////3///////9////////////7////3////////+v////7v/////////////97/////3//f//////////////9f//f////////////v/v3/////77////3////9//////////f///////c//+///v/////e////////9+v////+//v/9///7/////////////////3/3/v////3///////////+//////b////////9////3///////////////////+////////////+////7//////+//////+/v//3/////////////////////+/////9v7///77//9////3////+//7vv///////9/+////////////////7///+///+//////////////P///9///////////////////7/////////////v//////////////////f///7///////e///////////f//9v9///////////v/+//////f/////7/////////+/7//+///f//////////+//////////////7/////////////////////+/f7//////97//////////////////////////////////vf////v////7f/7f+/////////+/////9/9///////9f////////////////////v////////////9/3v/////////9v////9/////+////7///u/////////9///3/v/7/9///v///3////////v///////////3////////////////+93/9////f////f/3///////////////////////////9////3/////////f////+///////3///z/////v/////7f9//////+//7////7////7/////v////////v////////v///+/////9/+/93v/3/f/+/v////+/////////////////////////9//////9/7///vr//+/////////v//////////////////9/////7//////+9///7//+v//////n//////+////////v/O/+///////f/7f//////////7/9///////////79//79////////fX///v//3/7/////9///9/////////9//v/P////////W/+///////9//X/////////////////6///+////////////////7///v/f//0+/////////b/f///////9////f/////3/////9+///////7/f//////9////v////3f///9////+////////////9///v///f/////////////////////v///////////9v//////////////+5v/////////7//v//v///////////////+/////9///+////9/7/n//////////////9/////////////////f37f9///7/7+//////////////3/7fv//////////////////7///////////////////7/////////3v////////////////f///f33////7//////7//f/////////////////////////v///////7/////77/3///////////////9/////+9+v//v/f/v/////v3////v7///v/3///////3///////3/7/t///f///////////////f////9///////////////////7////////3/+///////////////9////3///////9///f//////////v////7///////////////vv///////7////////////////7///////9+////////////v/////+/////+///////3/////+////v+/7////////////f/+3/////////+////v///7/v////////////////////7//////v/////////33//+///f///35/v73/v////////////373/f///////////////1///7v/////3/////+////9//////////////b/////rv/////+/fv////////++///+u/7///7////////////////7+////f/////////+//2////3u/+/3/7////////////99v/8/////+9///1//////////////v////v//1///////////////////////9///+f//9//d+////v///9////////3///9////////////v///////+///9///////////3/9/u/9//////////////v//v////////f//3/3//3f///6////9/////////////////3///f/9//3////////3///////3/////////////+////9//v///////////////////f///////////7//1//9/////////9/v/////////////+///////////////////v//////////////9/////7///////9///v///////////////////9////////////////////////////////5///////////9f3/////f/d////////////9f/////////////7///////f/+///////////////f//////5f/////3/6u////////+f///////3////9/t////////9//9f/////v//v///f/3/////v////////+/////3//////f/3/f//ff///+3//////////7////////////f3////9//v//////////t//+/v9///////////7//////////+////+n/////3////////////f//////////////////t//9///////3f///////7+/93//////+////+/////v//////////////v///7///9//3/9//////////7/+7//v//3///v///////3///f/+/7/9///+//7/+///////////v7/////v///9/3///////f///f//////////+///////////////7///z/////v/f/+/7////v9+/f3/337///////////+////////////v/////////7////////v////7//73/////v+///////79/n//////6f//+//////3//3u///////////f////////9/////////779///7///////v///////////////6////////////////////P+/////////////v///////////n////////////3/7/7/+////+/f////////////////////3/9//P////3///////////f9//f//////+//v////3/v///7///v//+//////9//7/////////7/9/////////f/7//7b///////////////////////+////+/////+/9///////////9/7///+////7//3///f///r/9//+/9//////////f////////////3////ff+3rv/////v//f/////////////7///3//////7///f+/f///7//////////7//v/v//+//////////////f/3//////69//3f/////v/////77///v//////f/9//v///v//3//7////X///7/9/u//f/f7//+/////vf/////7/////7////6//////3///////////v///+f////f///////3////////////////zf////////////+//////u///f/3///vv/////////9/7//3///v3////////////////////+/f/////v//77////////////7/v//////7//////3/////////f//f/+8vv////////////////////f////////////////+/////+////f////vv/////////3///39//////////////////////////v////////////////f/////////9////f/7/+3//f//7/////f/////v//3//////2////+///////93//7/////////3/////9/////v///+///39/////////////3////3//f//7///////9//fv//////9////////////3////3///3/////+f///////////77/////////////////////7/9/9///////v++/////9v//r/////3///////////////////f/3/3///7////////////////////////////////f////9///////5///////////////////e/f/ff/9/////f//////////9///////////////v/v/////7//3/f/9////////+/////f//////v/////////////////////////////7/f//////////n/99///////7/////////f+//+/9////7/9/9//////v/////3//f////979////////////////////+/f/fv+f///v///////7//////3///v////////v///////////9///7+//+/f//7f//////////////////+////////f/97/v//////////+/d//////7//////////3///3////7/7///////+/////////////9/9//////v//f///////////+////z//v//P/v//7v////////379////////f///f////9//+///+/////9P/7///////////////v////f///f//7////+/7//+/////////////7///////////////////////v///v//////////7///////f////f///////f///+////+//////////////////////9/3//////////93/v/////9//+///////////93/9//+//79//////////f8/////////////////9////v//9//v//////v////7///////f////3////////7///////////////////9///////+/////3////77v9/3/+///fv//3//3////////3nf////////////3///b//////+/////9////fP/////v//////////f/7////3/vv////f///f//////////vv/////////+//v/z//7///+/9///////////////+/+//////f////f///////9/+///////////////v///////9//////////7/f////v//////////+f/////////7////3+///9//////+//99b///9////f/////////////9////////////////////////3+/v////v//////////f/b7////9392//v////f//////////////+//////v9/f/f///7///3+///+/////v/3//////v/v/////e/+///f////X/////3//v/9////////39//+//3//d///3//////9//////v9////92////3//v//////9/////////x//+9v///////v/////f//////7f//////////////7////9/////v////5///////+/////////+/3//////7///////////////+/9/7/////////3//f///////////f/////7//////3//////////r///////////////3////f///////////////////f////f//////////////////////9+3///9////3/////+/9/+/////9////////////f9///d////7/////9////7/3///////////////f//////////////////////3/////7////////////////+//3///v/3/f//7/////////97//v/9//////////////fv/////////f//////////3//v////////////+//f//v/7//3////////3//////3/9///7v/1//////d//9///f+9///////////9f//////3//93/////////7//////f//////f////+/9///////+3//////////////f///////7//////+///b//////f///////////8=","running":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA=","unvisited":{"count":2131,"head":[57351,49164,40976,40980,32792,65560,40988,40991,57377,49195,8240,57,8250,32827,57408,65602,65609,65617,49235,16473,24666,24669,41054,8289,57444,49253,65637,24680,49259,41070,16496,32880],"tail":[57208,8057,65409,16259,65413,8072,65417,16270,49038,65426,65429,24474,8100,65444,32679,49063,49065,57257,40882,40885,57269,16320,57282,8131,24516,65479,16340,32725,49110,24545,8168,24554],"sha256":"142f86c9e87a595d570a2dce9f18884c6628d7341615a05b0c0d8530ae89c954"},"unfinished":{"count":2133,"head":[57351,49164,40976,40980,32792,65560,40988,40991,57377,49195,8240,57,8250,32827,57408,65602,65609,65617,49235,16473,24666,24669,41054,8289,57444,49253,65637,24680,49259,41070,16496,32880],"tail":[57208,8057,65409,16259,65413,8072,65417,16270,49038,65426,65429,24474,8100,65444,32679,49063,49065,57257,40882,40885,57269,16320,57282,8131,24516,65479,16340,32725,49110,24545,8168,24554],"sha256":"edeaf21b242ff5e38f88d857e6ff77956e6542903babe060724c2fddd4adc4e3"}},{"n":70000,"visited":"gACAAIEAAAAAAAAAAAgBQAEAAAAAAAAAAAAAAAAAAEAAAAgAAgAAAYAACEABAAAAYAAAAIAQABAAACgAIBAAgBIEABAAQQAAACAAAAQAAAAACAAAAgAAAQAAAAAgAAggAAIQAACAACYAABAAAAABQBAAQAAQgACIAAAAAAAAAAAAAACAAABAAIAAAAAAEAAAAAAAgAAAFgAABBAAAgAAABIBAIAgEAJCAQAAAAAAAAAAAAAAQIAAQAAAAAIAEAAAAAAAAEAAQACAAAAAAIgAAAAgBACAAIgAACAIAAAAIAAAACAAIAACAAAAIAIAAAAAAAAAAAAAgEIABgAAAEAIAAgEIgACAAAAQCAAAAAEAAQAAAAAAAAgIBCAAAAAAICAAAAEgCEAAAIAAAAAEAQBAgAAAIAQUAAgAAAAAgACAABAAACECEAAAAAAAIAAAQYAABAECAARABAAAgAQBAAAAACBAAQAIQAADAABAAAgAFAQQEAAAAAEAAABBAAAiAAAAgIAAAQABCACAAAAAAAAAAAAAEAQAigAhAQQAAAAgAAiAAAAAAAAAKAAABAAAAAAAQQAAAAAACAAAQQAAAAAAAEEiACAAACAAEAAhAAAAAAAAICAgggAAgAAAAAAABEQAAAAAAAEAAAIIAAAAAgAAAAAACAAACAABAgAAAAAKAAAJIAAgAAAAEAgAACAAAAAVAAAABAIAgAgAIAAAAAAQAAAAAEAQAAAAAAggAAgAACACAAAAAAAAAAAAAFAAAIAACgAAAAAAAAAAAQAAABYCgAAEIIAAIAgAIAABAACAAAAAAAAAAggQAAQAAEACQBAAQAQgAACAAAAAAFAIAAAEIAAIACAAgIACAAAAAkAIAAWAAAACAAAAgAABAQAAAQBAgAAQACIBw4AAAgABAAAEAAiAEAAAACAAAABAIIAEAAAIAgAgACAFAIAAAAiUAQAAAgCAAAAAAAACAAAAAAAEQEAAAAAEgAAAACAAgAAIAEAAAAAAAAAAEAAAAAIIAAAIAAQABAAQAKAAAEAAAgAVBAAACAAAAICAAABAAAAAAAAAAoAAEACAABAAAACgAAAAAABEAEAAAAAAAIEAAQAAAAAAAACAAAAAAAABAAIAAAQQAACAAAAAAAAACAADAAAAAAAAAAAIAAAAAAAAAAIAAAEAAQCAAAAgAAAQAAAAAAAABAAABAAACAIAAQAAIEgAAAiACAIJAAAAAAQAKAABAAAAAAACAQAAAAACAgAAAAAACAAAAIAQAIBACAAAAAAAAAAAQgABAAABAgAKAAAAABAIQAAAAAEAgCgAAAAAAAAAgAAAAJAAAIAkAAAAACIACAAAJAAIAAADAAAAgBAIAACAQABIAIAAAgAAAAAAAkAgIEAAAAAAUAAAAACAAAAAAAAAIAIAABAAAACAAAAAIAAIBgEAQgAAAAAAAAABAAAACAAAAAAABAAAQIAABAACBAAAQAEAAAAQAAAAAAgAAAAAAAAAAAAABgAUAAQgAAABAAAgAIAAAAAAAAAAAAAAAABAAAAAgEAAABAAgAAAAAIAIAAAAAAAAUgAAAAhQAAAQAAAAAAAAAAAAAACAAAAIABoAAAACAAAAgICIAAAAAQEAAAAAAACAgAAAAAABAQAAAAAAAACEAAEACAAAAAAAAAAAAAAAAACAAQAAAAAAABAAAAAAAACIAAAAAAAAAAAAAAAAAAAAACAAAAAgAKAAAAAAAAAAAAAAAAAAAAIAgEAAAAAAQAAAAAAQgAAQAAAAAAAAAQAAAgAACAAAAAAAAIGAgACAAAAAAAIAAAAAAAQAAACCgAAAAAAAAAAAAAAKAAAAgAAAgBAMAAAAAAAAAQBAIAgAAAAAAAAAAAAAAAAAAAAAAAAAAAggCAMAIQEAACAACAAAAQCAAAAEAAEAAACAAAAAAAAQAAgEEAABAAAAAAAAAAAAAEAIAAAAAEAAAAgAAABEAAQAAAAABAAACAgBAAAAIAICQBEIAIABAAEAAAAEAAAAQABAEABBAEIAAgAAAEAAAAABAIQEAAAgAKAAAAAAAAAAADAAAAgAAgAAAAAABAAAABAQAAIwEEEAQAAAAAAAAAAAACAAAAAAAKAAAAAAAhAAgAAQAQAAAAAABAAAgAAAIQABAAAAFAAEAAIAAQAAAAAAAAAAAAAgAAAAAAYEAAAAEAAAACAAAEAAQAAAAAAAAAAAAAAAiAAAAAgAQAAAAAAAAEEAAgAAAQAEAAAQCIAAAAAEgAAACggAAAAAIAAACAAAAAAAEAAgBAAAAEAAAAAAgAABACAQCIAAAACAAAAAaQAgAABAAAAAAAAQBAAAAAQAAJAgAAAQAAAAEEAAAQAAAAAEAAAAAIAEAACCAAAAABAAAAAAAAAAAAAEAAAAAAAAQAQCAAAgAAABIJgAAAAQQAAABIAACAAgAAAAgACQCAAACAAAAAAgAAgKEQAAAIAAAABAAAAAAACASABAAACCAAAEgAAAAQAAAAAAAAAAAAAAAIAAAAgAgIAAAAQAAAEAQAAAAAAAAAAAAAAAAAAACAAAAAoAAAAABAAAAAQAAAAAAQAAAACAAAAoAAAAAAAAAAIAAQAAAAAAAAABAAAAAAAAEAAAAAAAAgKAAAgAAAAABUAABACAAAQQAgAAAAgBBAAAAAAAAAAAEAAgAQwEDAcAAAUAgAABAAACAAAAAAQQEQBAAAAAAABAIgAAAAAAAAAiBAAAAIIACAQgAACAAAAgEAAAAQQAAAAAABAAQAAAAAAAAAgAAAgAAAAAgFAAAAIAAAAAEAAiAACAgAAAACgAAAAAAAACBCAAgCAAAAAIAKAAACBAAAAQAAAgAAABAAAAAIAEAAABAEAAAMAAAAAAAEICAAACAAAAAAgAAAAAAAAABAAAIAAAAAAAAABAiAAAQQAAAAAAAAADACAAiBEIAAAAAAgAAAIAgAAAAAAAEAAAAAAAAAAAAKIAAAAgAAAAAgAEAAAIAAAQAASAAAAAAAEAAAAAAIAAAAQAAAIAAAAAAABAAAAACAAgAAAAAkAAAEIAAQAAEAAAAACAAAAAAAIAAAgAAAAgigAAAAAAAAEAAAABBABQAAAAAAACAAAAQAIAAAQAAEAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAQIAAAAAAAAgAAAAAAAAAAABAAAAAAAgAIAAAAAEAAAAAAAAAAAAAgAAAIAgAgIRQIACCAAEAgAAAAQAABAAAAAEBAIBAAAAAAAQAAAgACCAACAAFAAAAAABAAAAABACAIAACAAAAAAAQACiAQAAABSCAQAAAAABggAAACAQAAAABAAGAgAAAACQAAAAEAgAKIQwAEAAgIACIAAAAAAAACAAAAAAAAAIAEAQAAIACAAAAEAAEAAAAAAAAAAAAAAAAYAAAAACAAwgAAEAAAAAAAAAEAAAJAAAEAAIgAAAAAQAAAAABAAAEgBAAAIAAAAAAQIABAAAAAAAAAAAIAAAIAAgAgAAAAAAAgECAAggAAAAAAAgAAACAAAABAAACAAAAAAAAAgACQAQAAAAAIABgAAgAEACAAAAgIMggAACCAAAAAAAAAAAEAgABAAIAwAAAAAQAAUAAAAQAAACAAABAGAgAAAAAAAEAEAAAAAAAAAAQAAAEBAAAAAAAAAAgAIBAAEQAAAEAAABAAAAAEEAAAAABAACAAAEAAAABEQEAAAIkAAEACIAAQAAgAAApAAACAACAAAACBAIAAAAAAAAAgAAAAAABAAAAAAAAAAACIQAACAAAAAAAAAAAAAAAgACAAoAgBAAAAAIAAADAKAAAAAAAAAAAAABQAAAIAAAAAAAEAAAAAAAACAAAAECBAAEAAkERgAAAAIRAEAAAgAAAAAAwIAAAAIEUAAgAAAAACAgAAAAIQAAiAAIAAgAAQAAAAAAAIAgAVAAAAAQAAAAAAAAABAAAAgAAAAAQCgIAgAAAAABAAAgAABAAAAAABAACAEQBAIAAAAAAAADAAEACCAAAAAAAAAABBAAAAMAAABBAAIAIAAAAAAAAAAAAABAAAAAwAgBAgAAiAAAEABAAAAAAgAAAAAAAAAAAgQAAEQAQECEIAgAIAAAAAAEQBAAAAAGAAAAAARAgBCIAAYABAAoQAAAAAIAAAAAAAAAIAEEIAAECAgAAAAAAAAAACAAAAAgEAAAAAEAgAAAABAIAAAQQAAAAACAEAAAAECQQADCAABCAQBAAAAAEACAFAIQACAAAAAAEAAAAAAwAAAAAgAAAAAAAxAAAIBAAAAAAAAAAAAAAEAACAACQAIAAAIAEAgAAQEgQAAAAEAAAAEAAAAAIAAkAgQA4AAAAIAAAAABAIAAAEAAEYAAAAAAAAAEBAIAgAAAAAAAAAAAACAgIAAAAAAAAAAAACAAACAAAQQACQgAgAAAAAAAAiBCBgBAAABgACAAACCAAAAEAAAgISQAAAAgAQACACAAGEAAQAAAACAAAAgAAQAAAgCEAAgAgAAAAgAAAAAgAwIAAAIAAAABAAEACAAAAAAAQAIAAECAAgAAAAAAAQABEAAAQABAAAQEAAKAAAQCAAAABAAAAYAAAAAAAEAIAAAJEAAAAAAAAAAAAIAAAAQAAAAAAAAAAAAQhAAAAAAAAAABAAAAAAAACAACAAAAIAAAAAAAACMIASAAAAAAAAAIAEAgAAAAAgAKEEiBAAJEAAAAIgAEAAAAAgAAABAAAAAAAAAAAAAAAAQAEAgAAAIAAAAAEAAAAQAQAAAAAQAAIAAAQkAAAAAAAAAAAAQAAAAAAAEAEAAAAAAAiAAkAgAAAAAIBEQQAAgAAAAAAAkAAAAAAAAACAAAAAAAAAAAAAAQUAmAAAAIYQAAAAAAAIAIAABAIAIAAAEAAAAAAAAQIAAAAAAAAAAQCAIAgAAAAAABAABAAAAAIAAABAwABAAAAQIABDEAAAABAEAAAAAAAAABAAAEAgAAAAQAAAAAAAAABBAAAAYAEAUAQAAAEABAQAAQEAAAAAAIAAAAAEgBAAAgAABAEAAAAQAAAAEBIgAAAAAAAAAAABAAAAAAAAAAAAAAAAAEECBEAAACgAAEQABAACAAAAgAGAAAAAAAAAAAAAAAgACAACIEABAIAiAAAAIAAAADCECAAAAgAIAgAAAQIAICRICwAAAAAABEAAACIACAAIAAAAAQIIIAACAAAAQAAAAAABCggACAAgAAIIAAAAACAAAAACABAQAAAAAAMAIAAAQAECAAAAAAAgAAAAAAAACIAIBgAQAAQAAAAAEAAgAADIAABAAAAAAAAAAAAAAAAAAAgAAkAIQAAAAAAAKQAoAAAAEAgIAAAIAEAAAAAAEgAAAAAMAACAAAAAEAAAAAAAACAAEQAAEAAAAAAAQBAAAAAAAEAQCCAAAAQAAAACEAIAAAEAAAAACAIAAAAAAAABAAAAAAUAAABAAAgAIAAABBAAAAAAAAAAAAAAIAgAAAAAMEABEAAAAABAAAAAAAAEAAIAACAAARACAAAAAAAAAAAAAAAQAAAAAAAgIAFAIAAAAAAAhAAABEAABAgAAAQAwAAIAACAAgAAAAEAQAACAAABAoAACAgCAAAAEAIIAAAAAAAIAAAAAAAAFACBAgQAAAAAAQAAAAABAAAAAAAAAAAAAAAkAAAAAAAAAIAQAAAAEAAEAABAAAAAAAAAAAACgAAAAAAABAAEAQAAgAQAQAAQCABgAAAAAAACAEAABACACAAAAAEAAIAAAEAAAAQAEAAkABASAAAEAAIAAgAAAAIAABAAACAAAAAAAAAAAgIYABAAAAAAMCAAAAAAAgAAAAAAAAAAgAAAAAAIAAAQAAAAAAAAAAEAAAAIAAAEAACBAAAAAABAAAAAACAAgAQAAAAAAAIAAEAgJAgIAQAAAAAAIEAAACAAAgQQAAAQAAAACgAQACAAABAggAAAABAAAAAAABAAIAAggAAACIAAAAAAAAARAQAwAAAASEAAAAAEBAAAAAIAAAAAAAAAAAABCAAAAAAAAACAAAACAACAAAAAAAAAAIAQAAAQAAABEIAAAAQAAAIAAAAAAAQAAYAAAAAAAIEAAAghAAAAAQAAAAAABAAAAAARCCBAAAABAAACQAAABAAAAABgAAEAAwAAAAAAAQAAAQQAEIEAAYABAIAAgAAAEAAAAAAAAIgAAGAABABAACAAAAgBACAKBAAAAAgAAAABAAEEAAAAAAAAAACUAEAAAACAABABAAEAEAAAAAQAEBAAABAAAEAAAAQBAAAAAAAAAgACQAgAAAAAQAQAAAAQgEAAAAAIAAQEAIAAAAMABAAAIAAAAUAAAgAAAAAAABAAAAgAEAAAEMAAAAAAAAAAAACAAABQQAQAAIAAASAAAAECCISAACIAAAAAAAAAQAAAAAAAAAQAAQCgAEAAAABAAAAAACAAAAAACAAAABAAAAAAAAQAAAAABAAAAABAAAAAABACACAkAAQAEAAAiAAAoAAAAAEDIAAAQAAAAAAIAAACAAAAIAAQAAAAACQAASAAQAAAAAEAAAAAgIAAAAAAAAAgAAAAACAAIAAAIAAAAAACAAAAAABGAAQAAAAAAAAAAIABAAAAQAAAAAAAAAAAAAAQBSAAACAAAEAAAAAQAAAEAwAIAAEAAEAAAAAQACEAAQIEAAQCACIAAFABACAAACAAAAAgAAAAAAEAQACEAAAAAgAAAAAAQBAACAAQAgAAAAAAAAAAAAAAAgAAAIAAEACQAAQAUAAEABAAAQAAAAAAggAAAAAIgAQAAACBAACAAABgBAAAEAAgAAkgoAAAEIABABAAAAAAAgAAAAAAAAAABACACAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAgACAAAAAAAAFAAEAGAAQAQAAAAAgCAAAAIAAAAABBAAAAAAABAkAQAAAAAwABAACIBAGACAAAMAAgAAYCAAACIABAAAAABAAAABEAAAAAEBAAEBEAAACAAAAAAIABAAAAAAACAYAAECAAgEIAACAAAAAAAAAIAMAAAAICAAAQAAgAAAAAAAAAAAgQMABQBIAAAAAgAABCAAAACgYAAAAAAAhEAAAAAAEAAEABACAGwAAICAAAAAAgAEAACAAAAEEgiAAAAAIAEAAEAAgAAACHAIAAAIAAQAAEQAhgAQBAAAAgAAAIAQAAIAgIEAAAAUQAAAAAAAEAEAAAAAAAAAQEAAAAAAAAAAgACAEAAAAAAQAIAAoAAQAJAQEAAAQAAQAIAABAABAAAACAAAApAAAIAAAACAAAAEAAAAAhIAACAAIAAAAAAAAAQBAAAAAEAAABAAAAAAAAEAACABAAAAEAAAAAAAAIAAhABAAAAAAQAAAAAAAQAACAAAIAAAAAAAAAAIAAAAAABgAAEMAAAAAAUAgIAQAAAIEAQAAEgAAAAAAAAQAEIAAAAAAABAAAAAAFQIRAACAAAAEIQAAAAAAAAAgIAAAIAAACAAAAUCAAABAQAAAAAAAAABAAACgAAAAAEBAAAAhAAAAEAAAAQBEQIAAAAQEAgAAAEAAAAKAAIAAAAAAAACAAAAQQQAFAAAAAAgQAAAAgACAAACQAAEAgggAAADQAAIAAAAAAACAAABAgAQAAAgAAAAAgBAAAAAgCAIAABAAAAAAAAAAQUAAAAAAABAAACAAAAAABIAAAAAAAQAAAAAAAAACCAAAgAAAAAAAQAAEAAAGICAAAAAAQAAACAAAAAAAAICEAAMAAAAAIAIQUAAAAAAAAQAAAEEAQAAAABAAAGAgAAAAECQAAAAAAAAAAAgAABQAKAAACAAAAAAAAAABAAAQBTEAQABAAAABAAAAAAAFAAAAQAAQEAAAAAAAQAAAADAACBAAAAAAAAAAAAAgEAAAAEAAAgEAAIAIAAEAAAAAAAFQQAAAACAAgAAACBIgAAAgAAAAAAAABKAABAAgAEAAACgAQACASwAAQAAAAAAAAAAAAAAMAAAAAAAAAIAAAAAAQAgYIAUAAgQAAAQAAAAAAAAAQACAAAAAAAAAAAAAAAgAAAAAggAABgAAABAABBAAQAAAgQAAAAEAAAAACBAAAAAAARAAAAIAEQAAQBAAQAAAAQBBAAYAkAAAAAIAIAAAIEAAAAAAAAAIAAEOAAAIQAAAAQDAgCAAAAAAyAAAAAAAgABAIAAAACAAAgAAAEAABAAgAEAAAkAACAAQAAAAAAAAYAAACAEAAAFACAKAAACAEQIACAAAkAAAAAAQAABAIgACACIAAAgEAAAgAIAAAAFAAAIAAAAAAICAAIAQCEIAAEAAgAAAAAAAAEAAAAAAAAAAQSEAABAAEoAAAAEAAoAACAwAAAIAAAABAABAACABAAYIAAEIAAAAAQgAAMAABAACCAAAQAMIKAAACIAAgAAAAAAAUAQAAYAIBAQAAAAAAIAgAAAAAAAAAAAAAAAAgQAAAAEAEAAEEAAUAAAAAAgAAAUAAAAAAEACAAAAAEgAAAAAAAECAQQAQAAAAAEABAAAABAAgAAAAABgCAAIAABEAQAAAAAEAAAAAQAAAAQAAEAAAAIAAAgAAgACAAYQABAIAAAAACBAAQAIAAAABAAAAAAAACAwAAIhAAAIAAAgAAAAAAAAAAEAAAAkAAkAAACQiAACAAAACAAAACgAAAACAAAAAAAABAAAAAAEJAAIgAAAAAABgBAAAAAAABAAChAAAAAAAFAAAAAAIgAAAABAAAABAAAAAIACAwAAEEAAAAAAAAAgAAUAgEAGAIAAAEAQBAAgAAAAIAAAAAAAAAAABAIAABJAAAAAAAAAAAAAAARAQAAAACAAAABAAAAAAIAAAAAAIAAABAIBAAAAAAAoAFhAABAAAAEAAAAAAAAAIAAACAEAAAAAAA0EEAAAABAAABBEAIAAAAAACIAAIAQAAAAAAABCACCAAgAUAAEEACAAIQAACMAQAggJJQAAAAAAAAAAAEAAAIgAAAAAAgAAAAAAAKAAAAAIgAAAAAAAAAAQAAAQAAAAAAAAAAQSIAAQAAEAAAgBgCAAEAAAEIAoAAAAQAAAACAAAAAABABAAAAQQCAAIAAwAIgAKCAAAAAAAAAQAAAAAAwAAAAAAAQAQAgQABAAAAAAAACAAgAAACAAAAAAIAEQAAAAAAggAAAAAAAAEEAAACARAAAAQCgAAQQACACAAACAIAAAAAABJAAAAAAABARQggAAAABAEAkAiABAAAABBAAAAAAAAAQAAEAAAAEAAABAEAAAAQFgAAAQCgAAAAQAAAAEBAgACAAIAgAAAAgAEABEiAAAACBAABAAAAEAGABEAEAABAAABQAAACAAQAAgAAAAAAACAAAAAAAAAAAAEAAAABIAABBSoAIAAAAAAAAIAgAAAAAAAAAAAAAAEEEIBAAAAAAAAABAIADAAgAAACAAoAICAAAAAAAEAAAAAAAAAAQAAAAACACAAAgBAAEAAAAACAIAAAAAAUAkCAAAAAQAGACAAAAAAAAIAAAQAAAAKgCAAAAAAAQAQAAAAAAAAAAAgAAAEAAAAECAAAAAIAEAoAACAAgUAAEAAAAAAAEABAAAAAAAAAAAABBBAEAAAABAAAAAAAgIAAAAEAAAwAAgAAAAgAAQoAABSAAAAQBAABAAAAIAAAAAAAAAgCBACAQAAAAgIAAEAAAAAAAAAQCBAAAggQAABAJACAACAAAAAAAGAAAIgAAAACAAAEAAAgAANQAAAAAAAAAAACAgABwAAUgAAIBAAAAAAgAAAAAAAAAAIAAAAFAAAIAAAQAAAAACAACAAQAAABQEAAARMCAAAAAAgBAABAAAAAASCAAIAAAAAAEAQIAAAEAAAAQAIAAAIAAAEAAAAADAEAAYEADAAAAAAAAgAQCAgAAAAAQAAAAAAAAAAAACAAAAAAAAABAAAAYABAAAAAQEAAAwSEAAAQAgAACIAAAAAAQgEAAAAAABAAAACgTCIKAAAIIAAAAAAAAAAAAAAIgAAAAEAAhgEIACCAAEAACABAIAAAICAAAAAAAAABAEAAAAAAAAAAIAAAQAgAACAQAEAAAAAMACAKAAAYACAAgAABAAAAAIAAAAAEAAIBAAAAAAAEAAAAIgEADAAAgAAABAAAAAAAAAAAgAIAAAAICAACAgACAQAAgAAABAAAAhAAQQAEACQAIiAAAAgAAAIAAAAAQAAAIAAEAAAAAAABAAAAAAAAAAAAAABAAAAAABAAAAAACAgAQAAAAAAAAgAIgAAAAAgAIAAAAAAAAAAAAAAAABCAABQAAACAgAAgAAAAAAAAEAAAAhIQAKAAAAAMAAgAIAAAAEAABACAAAAABAAABAAAAAAAAAAEAAIAASCQAQAAAAAgYAACgAAAIAAAACwAAAAQAAAAAAAAAAAAQQGAAIAIAAICAgAAAAAAAAAAAAAAAAAAAAABQAAAAgAABAAAABABAABAKQAAAAIAAAgAAUEAAAAgAAAAEBAAAABAAAAAAAAAACAAAIAAQAKAAACACQAAACIBAADAAAAoAAAAAAAAAAAAIAAAAAAAAAAAgAAAIAAAAAAAlQBABACAAAAAgAAAAAAAAQBAAAFAAAAAAAAAAAAAAAAAAgAAAAAEgACAAAQgAAAAAAAAAAEAAAAAEEAAAICggQgEgAAAAAAAIBAAAAAAAAAAAAAAGAAAAAAAAAQAEAAQIAAAEAAAAAgAAgAKQASAAAKAAAAAAAAAAAAAAAIAAAAAIEAAAACAABBAEAAABAABAAIMABAAAAEQAAIECEAAAAAgAAAABAACAQAAAAAAAAQAABAIKAAAAAAAAgAAiAgAASAIAAAAAEAAABAAAAEAFAAACAAAAAEQAAAAAAAAAAIBAAAEQACBIAAAAIAQFAAEQAAAAAAOAAgAAAIQAQAAABAAAAAAAACEIBAAgCAgABAAAAAEAAAAAIAAQACAAAAMANAAEABQAAgCIAAAACAQABAAAAACAAAAAAIIIAAgAAIAQAAQBAANCAAAAAIABAAAAAAAAAAAAAcABAAAAACQAAAQAEAAAIQEBBAAAQAAIgABBAAIAAIAAAAAAAAIQAAAABAAAogQAAJAAAACQAAAAiAAADAAAAAAgAQAAUAAABAAAAECABAAAAIAAACAAABAAAAQAAAAhAAAAUwAABAkAAAAAAQAAAAAYAAgAAAAAAAAAAAAEAAAAAAIEgBAAAAAAAAAAgoAAIIAAAAAAAgAQAAAAAAYCAAIACIEAAAAAAEAAAAAAAAAAQAAAAAQAAAAAAABAAEABiBAgAAACABQAAIAAEQAAAAgAAAAAAAAAgAQgAAAAAAAAAAAAAAgRACAAAAAAAAAIAAQAAAAAAAAQCAAICAAAAAAAAABQAAAAAAAAhAPAAABBAAAAAAkAAgAAAIAhAAAAAAAAAAgAAAACAAgAAAEAAAAAIAAQAAAAAAAAAAIBAAEAAAAAAAAAAIAAAACAABAAgAEQAgEAAAAAIAAAAgAAAAZAAABAAAAAAAIAgAAAAAAAAQAAEAAAAAAAAEIAAAAAAAAAAgAAQAoCAAAAABAAAUEBAAAQAAIAAgAAAACAAgEAAAAAAFAAAAAAAAACAEAIAAAwIAAAAAAAAgACAAAAAAAAAEIAAACgAAAAAAAAAICAAACAAQACAAqAAAAADAQAABgAAAAAAAAACAIAA=","running":"                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              ","unvisited":{"count":66366,"head":[0,1,2,3,4,5,6,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,24,25,26,27,28,29,30,31,33,34],"tail":[69966,69967,69968,69969,69970,69971,69972,69973,69974,69975,69976,69977,69978,69979,69980,69981,69982,69984,69985,69986,69987,69988,69990,69991,69992,69993,69994,69995,69996,69997,69998,69999],"sha256":"4ef46c39ce0f8cb540e1bf20caeefb5928971db7576766d4172b3d8ac527c786"},"unfinished":{"count":66366,"head":[0,1,2,3,4,5,6,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,24,25,26,27,28,29,30,31,33,34],"tail":[69966,69967,69968,69969,69970,69971,69972,69973,69974,69975,69976,69977,69978,69979,69980,69981,69982,69984,69985,69986,69987,69988,69990,69991,69992,69993,69994,69995,69996,69997,69998,69999],"sha256":"4ef46c39ce0f8cb540e1bf20caeefb5928971db7576766d4172b3d8ac527c786"}}],"list_sort":[{"distances":"AAAA","reverse":true,"order":{"count":2,"items":[0,1]}},{"distances":"","reverse":true,"order":{"count":0,"items":[]}},{"distances":"","reverse":false,"order":{"count":0,"items":[]}},{"distances":"","reverse":true,"order":{"count":0,"items":[]}},{"distances":"","reverse":false,"order":{"count":0,"items":[]}},{"distances":"","reverse":true,"order":{"count":0,"items":[]}},{"distances":"","reverse":false,"order":{"count":0,"items":[]}},{"distances":"","reverse":true,"order":{"count":0,"items":[]}},{"distances":"","reverse":false,"order":{"count":0,"items":[]}},{"distances":"//","reverse":true,"order":{"count":1,"items":[0]}},{"distances":"gC","reverse":false,"order":{"count":1,"items":[0]}},{"distances":"Bs","reverse":true,"order":{"count":1,"items":[0]}},{"distances":"//","reverse":false,"order":{"count":1,"items":[0]}},{"distances":"AE","reverse":true,"order":{"count":1,"items":[0]}},{"distances":"vq","reverse":false,"order":{"count":1,"items":[0]}},{"distances":"AA","reverse":true,"order":{"count":1,"items":[0]}},{"distances":"AA","reverse":false,"order":{"count":1,"items":[0]}},{"distances":"gCgC","reverse":true,"order":{"count":2,"items":[1,0]}},{"distances":"68gC","reverse":false,"order":{"count":2,"items":[1,0]}},{"distances":"QDAE","reverse":true,"order":{"count":2,"items":[0,1]}},{"distances":"AE//","reverse":false,"order":{"count":2,"items":[0,1]}},{"distances":"9yQD","reverse":true,"order":{"count":2,"items":[0,1]}},{"distances":"ADgC","reverse":false,"order":{"count":2,"items":[0,1]}},{"distances":"AAAA","reverse":true,"order":{"count":2,"items":[0,1]}},{"distances":"AAAA","reverse":false,"order":{"count":2,"items":[0,1]}},{"distances":"ADADAE","reverse":true,"order":{"count":3,"items":[2,1,0]}},{"distances":"AEgCQD","reverse":false,"order":{"count":3,"items":[0,2,1]}},{"distances":"gCAC//","reverse":true,"order":{"count":3,"items":[2,0,1]}},{"distances":"QDAEAD","reverse":false,"order":{"count":3,"items":[1,2,0]}},{"distances":"QFACAD","reverse":true,"order":{"count":3,"items":[0,2,1]}},{"distances":"AAQDgC","reverse":false,"order":{"count":3,"items":[0,1,2]}},{"distances":"AAAAAA","reverse":true,"order":{"count":3,"items":[0,1,2]}},{"distances":"AAAAAA","reverse":false,"order":{"count":3,"items":[0,1,2]}},{"distances":"ABgC//AELsAC//","reverse":true,"order":{"count":7,"items":[0,6,2,1,4,3,5]}},{"distances":"gC//ADACQDyyAE","reverse":false,"order":{"count":7,"items":[3,2,6,4,0,5,1]}},{"distances":"ACAEXG//gCACAE","reverse":true,"order":{"count":7,"items":[3,4,2,6,1,5,0]}},{"distances":"gCjnABAEACACAE","reverse":false,"order":{"count":7,"items":[4,5,3,6,0,1,2]}},{"distances":"AAhrAAQDMaAAAE","reverse":true,"order":{"count":7,"items":[0,1,2,3,4,5,6]}},{"distances":"//AEAEADACAAAD","reverse":false,"order":{"count":7,"items":[4,1,2,3,0,5,6]}},{"distances":"AAAAAAAAAAAAAA","reverse":true,"order":{"count":7,"items":[0,1,2,3,4,5,6]}},{"distances":"AAAAAAAAAAAAAA","reverse":false,"order":{"count":7,"items":[0,1,2,3,4,5,6]}},{"distances":"QDADADACACABACgCAB////ACADAEABgCAEADABQDACACgCQDACABADACABQDQD5e","reverse":true,"order":{"count":32,"items":[28,25,18,14,8,5,10,9,31,22,15,7,30,29,23,19,0,26,17,16,13,12,2,1,27,24,21,20,11,6,4,3]}},{"distances":"gCRIADACQDAEAC//ABgCgCABACQDQDAEADbZABAE//gCAEQDAEQDABH7ACAB//AC","reverse":false,"order":{"count":32,"items":[3,6,12,28,31,2,5,15,16,19,22,24,27,4,13,14,23,25,1,17,0,9,10,21,7,20,30,8,11,18,26,29]}},{"distances":"ADgC0bABQDABAEABAEQDgCADa4QDAEAE59AEgCABgCAEgCQD//+0//tYACAAeLAD","reverse":true,"order":{"count":32,"items":[19,7,5,3,26,24,25,16,2,27,22,20,18,10,1,12,23,13,9,4,21,17,15,14,11,8,6,0,28,29,30,31]}},{"distances":"ACAEAB//gCgCQDABgCADgCACABADQDQD//AB//ADADgC//AEADC5AEABQDsoQDAB","reverse":false,"order":{"count":32,"items":[0,11,1,9,13,19,20,23,24,26,25,6,14,15,28,30,4,5,8,10,21,29,3,16,18,22,2,7,12,17,27,31]}},{"distances":"AAAAACgCAAABwEAAAAuCAEAAAB//AAADAAAEADAAAA//AAgCAEABAAABAAAAgCAA","reverse":true,"order":{"count":32,"items":[0,1,4,7,8,11,12,14,16,19,20,22,25,24,26,27,5,21,13,6,9,23,3,18,17,15,10,2,28,29,30,31]}},{"distances":"ADgCACABAA//QDgCACQDQDAEAEADQDgCABQDAEAArygCACABACAAAA//gCADAEAC","reverse":false,"order":{"count":32,"items":[2,8,22,24,31,0,11,12,13,18,29,30,6,9,10,1,28,27,3,4,14,17,7,15,21,20,5,16,19,23,25,26]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":32,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":false,"order":{"count":32,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31]}},{"distances":"ADRS//ADAEABABAEAEAEQDQDgCgCAE+BABACACQD//ADADQDHSADgCgC//QDACABACQDAEADIGgCA7gCABABABACAC//a6//AEADABgC//QDQDADABAEAC//ACADAE","reverse":true,"order":{"count":63,"items":[56,50,42,41,40,31,16,6,5,59,52,47,45,28,20,2,15,51,39,37,27,26,13,12,46,1,54,53,33,29,23,19,11,10,36,24,38,62,61,57,55,49,48,35,34,25,22,21,14,9,8,7,4,3,0,60,58,44,43,32,30,18,17]}},{"distances":"AD//QDgCADADgCACIuiHgCADDaQDADQDQDQDQ0ZWKtADADgCgCQDAEgCQDAEABAEQDAEgCAEkoAEADQD//gCABL6ADACQDADAEAEAEACAEABABgCQDABzzAEAEgCAD","reverse":false,"order":{"count":63,"items":[7,45,51,0,4,5,11,14,21,22,26,29,31,33,35,37,38,44,47,48,49,50,52,59,60,62,12,8,20,43,2,13,15,16,17,25,28,32,39,46,56,18,19,3,6,10,23,24,27,34,41,55,61,9,36,58,1,40,30,42,53,54,57]}},{"distances":"AB//gCAD6PABaNACAAQD//////ACAB//QDACACADADgCACAAAAACAE26ADAEAEAAQDADAAgCQDgC////AD////1WAEgCuwgCQDAD//ADAEABgCAC////ADQD//gCAD","reverse":true,"order":{"count":63,"items":[8,14,23,24,31,34,53,5,0,60,57,56,50,42,41,39,38,15,12,11,10,1,4,27,43,46,61,54,47,45,37,35,21,2,6,59,48,36,32,16,9,62,58,52,51,49,44,40,33,30,29,28,26,20,19,3,55,25,22,18,17,13,7]}},{"distances":"//ABAEAEYEAEADAEgC//PA////hdgCACAA+cADucY7AEgCABACADABAB////AEgCgCYrABABADQDgC//AEAAAC//ACAAgCADABQDQDACgCQDQDACQDAB57//NUADgC","reverse":false,"order":{"count":63,"items":[15,24,42,44,51,55,2,3,5,6,7,18,21,25,30,36,40,47,61,60,10,37,49,50,53,54,56,4,33,20,8,14,22,31,32,38,46,52,62,13,19,58,17,0,9,11,12,28,29,39,43,59,1,16,23,26,27,34,35,41,45,48,57]}},{"distances":"//ADQDAA//gCAEADQDQDAAAEgCABgCAAAAAAADQD//AAQDr1QD//AAAAmcAAAEADAAADAAAAAEAAAAAAgCAA//AAAEAAABQDQDQDABACADgCADgC//ABAD//IJABgC","reverse":true,"order":{"count":63,"items":[0,3,4,10,13,15,16,17,21,26,27,29,32,34,35,37,38,39,41,43,45,61,57,50,46,59,56,42,25,20,23,28,62,55,53,40,14,12,5,49,48,47,24,22,19,9,8,2,60,58,54,52,44,36,33,31,30,18,11,7,6,1,51]}},{"distances":"AAAAADAAAAAAABicQDACeDABQDAAgCACABACgCXs//AEABAAACAEgCAA//gCABADgCAAAAABADADQDAAGAABgCAAACgCAAABAAAAAAQD//AAAEQDAAAA//ABABADAA","reverse":false,"order":{"count":63,"items":[0,1,2,3,4,5,9,15,17,24,44,21,25,31,36,37,54,61,40,8,12,38,51,55,19,10,14,18,26,29,32,42,45,7,28,6,11,13,20,16,22,23,27,30,33,34,35,39,41,43,46,47,48,49,50,52,53,56,57,58,59,60,62]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":63,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":false,"order":{"count":63,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62]}},{"distances":"//ACACAB//QDABQDACAEv6QDAEJGAEAEQDADAEqlQDQDQDQDgCCwgCTQMo//ABgCADADABADACACABgCADACgCAEAEgCQDQDgC//ABACQDACQD/VQDABADQDADAEAC//","reverse":true,"order":{"count":64,"items":[57,50,38,34,30,6,3,63,49,29,4,0,55,10,19,48,45,42,39,31,26,24,27,59,56,54,52,47,46,23,22,21,20,16,11,7,5,28,13,25,61,60,58,44,43,40,35,33,32,18,17,15,14,12,9,62,53,51,41,37,36,8,2,1]}},{"distances":"AEADABgCABADgCADQD//ACADQDgCAC//gCC0//AD////QDQD//ACAC////QDQDQDADADgCAC9L//gCACAD////gCgC//gCAB//AB2BAEADADQDAC//QD//ADkkQDAD//","reverse":false,"order":{"count":64,"items":[10,14,25,26,35,39,55,0,1,5,7,11,19,32,33,40,51,52,53,59,62,17,8,12,22,23,29,30,31,54,57,61,3,6,13,16,34,38,43,44,46,60,50,36,9,15,18,20,21,24,27,28,37,41,42,45,48,56,58,63,2,4,47,49]}},{"distances":"ACAE//ABACACADADAAAEAEABAD//AEAEgC43X0CzAAzZAEACACABACABACACAC//AB//ABACABQDQDACABgCAAACgC18AAbHQDQD//gCABgCgCgC//ABADAE//QDQD05","reverse":true,"order":{"count":64,"items":[8,20,27,25,11,3,31,13,2,17,21,16,18,19,22,15,14,12,10,9,7,6,1,30,29,28,26,24,23,5,4,0,42,46,57,52,40,36,34,32,60,56,50,33,45,63,55,54,53,51,44,41,47,62,61,49,48,38,37,59,58,43,39,35]}},{"distances":"ACABLXACADe7ABgCQDQDjCYcAEElSm//AD//QDgCADADQDgCgCACACQDABABgCADZdADABQDABAEADADvUACQDABABQDAD////gC//gCACAC////ACABAAADADgC//AD","reverse":false,"order":{"count":64,"items":[0,3,25,26,41,52,53,56,4,12,16,20,21,31,33,37,38,39,46,59,60,63,13,2,8,9,18,22,27,35,42,45,14,11,32,5,7,19,23,24,30,49,51,61,10,40,15,17,47,48,50,54,55,62,1,6,28,29,34,36,43,44,57,58]}},{"distances":"AAADADAAAAQDAAAAgCQDACAAAA//ABAAgCADAAgCAAAAAAAAAEABgClo9CACRdAAAAACEPAAlWAAACADAAgCAAABABACABADAAAD////gCABgCAAAAAAQDAAAEAAQDAA","reverse":true,"order":{"count":64,"items":[0,3,4,6,7,11,12,14,13,15,18,20,21,22,23,25,28,27,26,19,16,8,30,9,5,24,17,2,1,29,10,31,32,35,37,40,42,48,53,46,44,43,51,50,36,54,52,41,34,49,47,39,45,38,33,55,56,57,58,59,60,61,62,63]}},{"distances":"QDAAAAADQDADQDAEgCQDAAADAAABYEQD//AByWAAAE//AAADgCEC////AAAAQDADAA1dABADADjrACSTAAuIAEAAAC//ACAAgCVzho//WhAEABABQDAEAAQDAAABQDAA","reverse":false,"order":{"count":64,"items":[0,1,2,3,5,7,11,20,23,25,4,6,9,8,10,12,31,15,30,14,24,18,16,21,26,27,13,17,19,22,28,29,32,38,44,46,35,36,42,53,57,56,59,62,39,49,52,48,50,37,41,33,45,34,40,43,47,51,54,55,58,60,61,63]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":64,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":false,"order":{"count":64,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63]}},{"distances":"ABAB//AE//ACACAEAD////AD//QD1TACgCADgCSbAEQDADAE//ABAEADQDQDIZACABgC//ADADQDADAD//ABgCAEADADACAC//QDAE//ADQDACAEQDAEACAEACAD+umeAB","reverse":true,"order":{"count":65,"items":[64,41,32,25,1,0,51,48,40,34,24,12,10,9,4,2,62,14,63,42,33,18,16,19,56,53,49,37,29,28,21,13,30,61,59,57,55,52,50,45,44,43,39,38,36,35,27,26,23,22,20,17,11,8,7,3,60,58,54,47,46,31,15,6,5]}},{"distances":"//AEAEBp//AEADADADrcgCABgCgCABwSgAAEACQDABACADgCMzABADgC////QD//AB//ADABAC//4bfnACACADACACACAEgCAEABqEABAEbUACADQDAEgCAEAEAEAEze//","reverse":false,"order":{"count":65,"items":[18,21,36,40,41,43,44,45,54,1,2,5,6,7,8,17,22,26,34,42,46,48,52,55,57,59,60,61,62,3,24,19,30,56,53,39,16,10,12,13,23,27,47,58,50,9,15,63,38,0,4,28,29,31,33,37,64,11,14,20,25,32,35,49,51]}},{"distances":"ACQDABYxACABAE////AEACAAAEADADACgCQDAEADgCQDAB//ACQDABADZignQDACQDACAEAAADuuADQDADAAABAAACADgCgCADABi0AEABI5ADgCAAgCABQDADABgCQDAC","reverse":true,"order":{"count":65,"items":[11,26,22,5,2,23,8,7,29,20,16,28,3,30,25,21,17,1,27,19,18,14,13,12,9,6,31,24,15,10,4,0,35,41,43,56,61,58,52,49,42,37,50,62,57,55,47,46,63,59,39,32,53,60,54,51,48,45,40,38,36,34,64,44,33]}},{"distances":"QDgCEN//gCADAAAE//AB//ABABABABADACAAAA////AD//QDfFQDAEACuYQDACch//gCACgCgCAAABACADACABQD//AAGXV4AAgCAEGmgCABADV2AC//QDgCQDAEAEQD//","reverse":false,"order":{"count":65,"items":[16,27,30,5,7,21,26,2,0,23,24,1,4,3,6,15,25,29,31,28,8,10,19,20,22,32,9,11,12,13,14,17,18,34,39,41,56,40,50,54,61,62,46,51,43,58,60,63,55,47,33,35,36,37,49,52,59,44,38,42,45,48,57,64,53]}},{"distances":"AEAAAEAAjNAAABACAAADAASPABAAADgCABAAAAAAAAABQDQD//gCAAQDACADAAADACAB//AAgCAAAAgCQDsmDiAAAAACAAADABADgCAAzMABACAAAA//QDNJAAAAAAAAgC","reverse":true,"order":{"count":65,"items":[1,3,5,6,8,10,13,16,12,4,17,18,19,20,21,24,25,15,11,26,27,23,22,29,14,9,2,0,28,7,30,31,35,37,38,43,44,46,51,53,48,33,52,41,54,55,56,57,34,50,39,36,58,40,59,42,49,47,45,32,60,61,62,63,64]}},{"distances":"QDQDAAAA//AAABAAR4AAABQDAAABABAEAAADAEAAAEAAABAAH/AB//ADAAACMFAAQDAAACwLADAA//AAQDABAAQDADAAADADkqAAAAAA1kQDAB////SzgCQDAA////ACAA","reverse":false,"order":{"count":65,"items":[0,1,2,3,29,18,20,27,24,30,32,4,5,6,7,15,11,8,9,10,12,17,13,14,16,19,21,26,22,23,25,28,31,33,34,63,36,46,47,40,59,57,35,37,38,39,44,43,61,41,42,45,53,48,49,50,51,58,52,55,56,54,60,62,64]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":65,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":false,"order":{"count":65,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64]}},{"distances":"ABgCyfgCADgCADQDAE//AEACACABAEADADADAE////ACQDAEAEUhACACQD//ADgCgCAEABACABAD+OcLQDAEAC//QDACAE//ABACACQDAE3oACQDPJACQDAB//////QDQD//QDgCADAE+XQDAD//AEAEAEQDgCACACADQDABADRv//ADABADAEABABADgCABAEgCAEADQDACACQDABADgCACQDQDXxAB9jADACgCAEABADAEgC//AE//gCgCAB","reverse":true,"order":{"count":127,"items":[126,117,111,104,95,92,91,88,83,59,48,36,34,13,0,123,121,86,73,65,62,61,60,47,43,29,20,19,9,70,38,112,53,2,125,124,120,115,106,97,94,78,67,32,31,5,3,1,39,110,25,85,109,108,103,100,82,77,71,66,64,63,58,55,51,44,40,28,22,7,56,122,119,118,116,113,105,99,98,96,93,90,89,87,84,81,76,75,74,72,69,68,52,46,41,37,33,30,24,23,18,17,16,15,14,10,8,6,4,114,107,102,101,80,79,57,54,50,49,45,42,35,27,26,21,12,11]}},{"distances":"AEQDQDAEAEACnrTVAEACACgCQDADAEABAEsXcjgCgC67QDAEADgCAEACQDZaADABAB//ACYEACAB2L//QDACQDgC////ACQDACgCAEQDACAE//AEADADAB//QDgCABQDADABADAC//ADAEADADACgCADAEABADACACAB//gCgCACgCADQDABXVVeADQDgCACAEgCADgCADAB//AEiLTAgCAE//AB5sQDADABQDADAEgCAEAEADACAEg71PgCAC","reverse":false,"order":{"count":127,"items":[5,9,10,27,34,36,41,46,48,52,67,73,79,80,85,95,121,126,0,3,4,8,13,14,16,23,24,26,30,50,53,55,56,57,64,66,69,70,71,72,75,76,78,87,92,96,98,100,103,107,112,115,116,118,119,120,122,1,2,12,22,28,40,42,47,51,60,63,88,93,111,114,105,7,91,90,35,29,18,11,19,20,25,43,49,61,74,83,84,86,94,97,99,106,117,125,123,104,6,17,124,38,110,21,33,39,44,45,54,59,68,82,102,108,15,31,32,37,58,62,65,77,81,89,101,109,113]}},{"distances":"AEAAAAgCQDQDABAAAAHRAEACACABgCADABADAE//AAAB//ADn+//AE//AAACJGAAABQDACgCADAAABgCKOABAE/oACADADQDQDgC//gCAAAEABgCABIDYlABABACQDQDADxAAEAB//ABgCQDQDAEABADAEQDgCAAADAAABAEQDgCAC//ABAE//gC//qAAEgCgC//v3QDAEAEAE//wTgCQDABAEABAEAC//LbAA//ABAA//ABAAxiQDQDADgCrZ","reverse":true,"order":{"count":127,"items":[1,2,7,8,20,28,31,37,52,60,59,56,54,41,38,32,21,16,13,6,50,27,25,22,19,43,24,55,51,49,39,35,14,3,58,62,48,47,33,5,4,40,30,57,9,53,46,45,42,36,26,23,18,17,15,10,0,61,44,34,29,12,11,79,81,114,117,119,116,109,107,88,82,74,69,67,118,115,112,103,97,92,90,87,68,65,104,98,93,105,96,95,91,85,78,106,99,113,120,121,126,125,70,123,122,84,77,72,71,63,124,110,108,102,101,100,94,89,83,80,76,75,73,66,64,111,86]}},{"distances":"AC//gCgC////gCAC//AEQDADAC//ADQDAEADAAADADAC//QDQDgCQDAE//gCABIenpABADACAB//3ZmG//AEADgC//ACAEQDABgCAEABACACACQDQDACAEAB//ADAEgCAE0/AAACAB//ADOMgCQDyEAEAEgC//////ADmdADKzACAC//gCADADAEQDAgAAADACADAEACACAEAAgCADQDQD//QDgCADQDADACvlAB43ABAEgCAEABAD//ADAAAB","reverse":false,"order":{"count":127,"items":[0,7,12,21,35,45,52,53,54,57,9,11,14,16,17,19,20,27,34,41,42,46,50,58,61,62,64,31,10,15,23,24,26,47,55,56,2,3,6,25,29,43,49,63,39,32,65,38,1,4,5,8,13,18,22,28,37,40,44,60,30,33,36,48,51,59,66,67,85,86,96,99,100,113,70,75,76,81,83,89,90,91,95,97,98,101,104,110,112,118,120,122,124,93,84,71,73,92,105,106,108,111,72,77,88,103,109,119,82,114,74,116,69,78,79,80,87,123,68,94,102,107,115,117,121,125,126]}},{"distances":"ABACACAAACADADABABABAAQDACDuACQD//ABADSVAAADy2//AAQDABAAAAAAABACAAAAQDgCgCgCAAAAAA//ABABAAAAAAAAADACAAAAAAAEAAACAAABADACACADACABQDADAAABuQ0gACgCAB//gCACgCABgCAAABgCAAAE//gCAAAD//AAgCgC//AAADlVQDADAEAEAAAAADAAADAA//AAAAAAgCAAQDACAD//ABAAAEgCADQDAAADAAQDQD","reverse":true,"order":{"count":127,"items":[0,3,9,10,20,24,27,28,29,32,33,38,39,40,44,45,46,47,50,51,52,54,56,57,43,42,30,26,17,8,7,41,23,16,22,37,36,35,19,34,25,15,11,13,61,58,53,48,21,18,6,5,62,60,59,55,49,31,14,12,4,2,1,66,77,79,80,72,67,63,73,82,84,86,89,92,88,69,68,91,93,95,96,97,100,101,103,105,107,108,109,111,116,115,106,110,112,114,117,119,90,85,81,78,76,74,71,64,65,113,70,122,124,126,125,121,123,120,118,104,102,99,98,94,87,83,75]}},{"distances":"faAA//gCgCgXQDACADABogQDADAA//AEAEACqtuIABAEgCAAieAAABQDABAEAAACAAAEgCAAACAC//gCbv//KrJuADAE//gCAAADADAAAAACAAgCoqAAADipAC//AAZ91qgCQDIEAE//ABQDAEgCAE//AAgCQDHHAAAD//gCAA//QDADAAQDgCAAACAAAAgCQD//gCAAAAgC//AAQDQDgC//AEAA1/gCABACAAAAQDQDAAADgC//QDABAAOXAE","reverse":false,"order":{"count":127,"items":[0,1,7,17,31,36,37,53,60,8,12,15,16,21,29,33,44,45,49,50,58,43,42,6,11,27,63,40,3,4,22,34,39,47,5,24,59,10,18,2,9,13,19,14,20,23,25,38,41,46,26,28,30,32,35,48,51,52,54,55,56,57,61,62,92,113,68,72,74,81,87,108,119,126,79,67,125,66,71,78,86,89,96,104,105,116,117,122,65,73,77,83,90,98,111,120,64,69,75,85,70,76,80,82,84,88,91,93,94,95,97,99,100,101,106,102,103,110,107,109,112,114,115,118,121,123,124]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":127,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":false,"order":{"count":127,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126]}},{"distances":"//gCAC//ACACABgCgCABADABAEQDABAEgC//AEQDADACAD//ABABQDABgCQD//AEAEADABfY////ACAEBhADADgCQDABADAB//ADs6ACgCgCcBAEADDmgCABADACABACABQDACoTADABQDACAEgCACQDgCCmADT5//gCgpADgCAEQDgCABgCABAEdUADQD//AEABgCAEAE//ADADAB//AE60QDACQDAB//QDABgC//AD//5iAEACABgCABQD////","reverse":true,"order":{"count":128,"items":[124,122,114,111,104,97,90,88,69,64,62,59,47,45,34,27,25,24,14,11,9,6,127,126,118,116,112,105,101,95,80,48,37,36,30,23,17,3,0,107,119,50,67,82,123,115,98,89,87,84,81,76,73,58,53,52,43,28,16,8,7,1,35,92,54,79,125,113,110,108,94,86,75,70,65,44,29,26,19,13,57,77,40,120,117,106,103,102,100,99,96,93,91,85,83,78,72,68,60,56,55,49,46,42,41,39,33,32,31,22,20,18,15,12,10,121,109,74,71,66,63,61,51,38,21,5,4,2]}},{"distances":"//QDADAEACmv//ABACQDABACO6ABgCACgCwRAERqTMACQDADABACACAE8qQDgC//0vABgCLyAEAB//ACAD//ABACABABQDgCAEADPIAEAC//AEADACACgC//AB//AE//gCAC//AE////ACADADgCADQDACQDgCADgCAD//QDtYAE8a1Ql7QDADACADgCAEADADQDADAEAEADclACQDADAD//ACQDAEAEABAD//AEgCAC//gCNXdUceAEABAEXfQD","reverse":false,"order":{"count":128,"items":[4,8,11,15,21,25,26,39,43,52,56,57,65,70,76,91,103,108,117,2,3,18,23,27,36,40,48,49,51,54,55,62,67,71,72,74,79,81,85,90,92,94,95,96,98,99,100,101,105,106,110,111,113,115,123,125,35,120,12,50,1,9,22,29,46,75,77,83,89,97,104,109,127,19,20,126,122,102,121,14,16,30,34,47,58,64,73,78,80,93,116,119,88,5,84,17,32,87,86,28,0,6,31,38,41,53,59,61,63,66,68,69,82,107,114,118,7,10,13,24,33,37,42,44,45,60,112,124]}},{"distances":"ACACACQDgC//AEADADAEADQD//gCQD//QDADAEACQDACQDQDACgCgC0GADABACAB//ACAEADAB//ACAB////mkp2ADQDgCABQDADjcAEgCADABQDAEnUACgCACAEAEABzsgC//ABADABX2AEAEQDAAAEAEAD//ABj7zKAAgCQDAAQDQDAAgCABACAD//QDAAcxAEgEAAgC//gCABQDADADQDQD//QDEDAED3hzQDABAEQDADAA//ACABgCgCQD//","reverse":true,"order":{"count":128,"items":[69,74,79,67,78,66,64,81,80,70,82,85,88,90,93,89,83,65,94,87,86,84,73,92,77,76,75,72,71,68,91,95,99,116,120,123,103,63,54,47,39,36,31,29,127,121,109,101,41,40,37,32,15,12,5,27,43,57,42,50,114,98,125,124,102,100,59,52,46,26,25,13,4,96,126,118,115,110,108,107,104,55,48,45,23,22,20,16,14,11,3,111,113,119,117,112,106,105,97,62,61,56,53,51,49,44,35,34,28,18,17,10,9,8,7,6,122,60,58,38,33,30,24,21,19,2,1,0]}},{"distances":"AEACAB//gLAC////ACAD//AAADAAQD//gCABACADAC//ACGqACADABAEgCgCSFACvSAB6gAEACQDAC//AC//gCgCQD//ACgCABgCAAQDACQDACQD//QDADADADADABABgCAEACn7ADO0QDADgC//ACACgCADACZdACAE//ABAAYjAC//gCQDAEACAEABABAD0X//ACQDAEABAD//QDACADjsgCgClbADQDAEAD//AC//ADABACABADAB//AC79//","reverse":false,"order":{"count":128,"items":[1,5,8,18,20,22,24,31,36,38,40,46,52,54,66,74,75,78,80,86,91,98,105,116,120,125,0,9,12,19,25,27,35,58,59,60,61,65,68,71,77,81,90,92,95,100,102,106,111,113,114,118,122,23,69,14,37,44,51,53,55,57,70,89,99,104,112,30,85,79,16,28,29,42,43,47,49,64,72,76,88,108,109,4,107,110,67,32,96,34,126,3,6,7,10,21,39,41,45,56,73,82,97,103,115,117,124,127,2,11,13,15,17,26,33,48,50,62,63,83,84,87,93,94,101,119,121,123]}},{"distances":"AEAA//AA//75AA//gCgCQDAEABAAABAAAE//ABAEAD//AAQDgC//ADAAAA//AAAA1fABAEAAADABu0//AEAAADXPADQD8YAEADAAADAAgCACADgCACABgCQDAAAAQDAEAD//AALJAAAAQDAB8dAEAAABAAAE+kAAz1AAACABAAAAAB//TEADAE//QDAEADADADQDAAAAABAEAAABQDAAQD//gCAAAAAAK6AAaqAB////////AAFkqdAAgC//DWAE","reverse":true,"order":{"count":128,"items":[1,3,6,12,8,13,15,18,14,22,25,21,17,7,4,2,5,24,9,23,10,26,0,27,28,29,20,19,16,11,30,31,35,39,41,46,49,51,57,37,33,32,38,58,55,52,43,59,45,54,50,48,47,44,42,40,36,34,56,53,60,61,62,63,66,68,69,71,74,75,76,78,79,81,84,85,86,83,91,87,65,72,80,88,92,70,67,95,94,93,90,89,77,73,64,82,98,99,102,105,109,110,111,113,115,103,100,120,122,123,125,119,118,117,116,107,124,108,114,106,104,97,112,121,126,127,101,96]}},{"distances":"gCAAADAAQD//AEAAAEAB//AABXQDAAABACgCQDACACAAAAACAAciAAADtEgCAAAAAAwdgC//AAACAEAAAEABACAA////AAACAEAAAAAA//gCACAAACAA9uQDAAABxLACQDACAEAA//ACgCAAaVACADAAQDAAAA//gCQDQDAAgCAEAAQDAAAE//AA//ABAC//ADCvZZbyQDG5AEgCQDAAgCAEAAAE3iAAAAAAAAhBMB//7y0nAAABQDQDAAAAABAA","reverse":false,"order":{"count":128,"items":[0,1,16,2,3,19,20,23,6,8,27,12,4,13,29,28,5,7,18,17,10,9,11,14,15,21,22,24,25,26,30,31,32,37,42,47,56,63,38,40,48,34,33,62,58,35,36,39,45,41,43,44,46,49,50,51,54,59,53,52,55,57,60,65,69,94,66,64,67,73,74,85,89,96,102,107,109,97,101,116,76,81,82,87,100,104,122,98,72,99,70,103,68,71,75,77,78,80,84,79,83,86,88,90,91,92,95,93,105,106,108,115,110,111,112,113,114,123,119,118,117,61,120,121,124,125,126,127]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":128,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":false,"order":{"count":128,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127]}},{"distances":"OdgCAEr2gCQDAEADQDgCgCQDAE////AEADu///ADABACmLAB//AD//gCgCgCAEgCADQDB4QDBIAEmpoggCACdxQDAE//ACgCAEAE//AB//RAAEABAEADACADABgChPgCAE//ADAC/2lCQD//////ACADABADMuACgCRb//QDgCQDACABgCQDABADADgCADAEABAC1D//ACABaRAC/U//ABADAEADABQDgCACQD//LtADgCsC////AEQDgC93ADADQD","reverse":true,"order":{"count":129,"items":[110,106,101,96,90,87,76,60,55,51,23,20,121,120,115,105,99,82,73,72,71,65,52,50,45,26,24,18,14,13,68,104,125,98,17,119,3,39,38,22,69,62,124,118,112,93,88,84,80,63,61,47,40,31,29,28,27,10,9,4,1,42,102,81,53,128,123,114,111,89,85,83,70,43,35,33,11,8,5,0,78,116,34,36,127,126,122,117,109,108,107,95,94,92,91,77,75,66,64,59,57,56,54,49,48,44,37,32,30,25,19,16,15,12,7,6,2,113,103,100,97,86,79,74,67,58,46,41,21]}},{"distances":"ACABAB////gCABACAEAERnQDAD//AD////AC////ADIT//gCQDABXF//////////ADABACACpFABABgC8W//QDgC//AB//AEADgCQDABACAEgCABAE46AD//gCADADACQDACADe1AEABADACgCgC8+ucABAEAEACQDlXAEABABQDACABgCEg//ADADQDADACgCAE//gCACgC//ABABABgCgCAEADQDABgCAE//AEgCADAEAD//QDIeAC////2wgCQD","reverse":false,"order":{"count":129,"items":[0,7,17,34,35,52,63,65,71,79,86,95,100,123,8,9,12,14,20,32,47,48,53,56,58,61,62,66,68,70,77,78,82,91,92,94,97,108,109,113,115,117,118,119,89,21,122,11,24,42,50,64,80,85,93,110,121,128,10,26,67,5,23,39,43,49,54,60,72,73,88,96,99,101,106,107,112,116,127,81,36,75,126,57,40,74,3,4,13,15,16,18,19,22,27,28,29,30,31,41,44,46,59,90,98,102,114,120,124,125,1,2,6,25,33,37,38,45,51,55,69,76,83,84,87,103,104,105,111]}},{"distances":"//ACAEAEQDAEgCgCACABM1gC//QDACgCAAAEAEACACAAQD4dQDADAB//ADgChAQDQDADAAAEADABAAACACQD//ABADgCgCAEAAQD//ACAC//AAADABAEADAEACAEgC////AEADAEjGAB//AAACQDABgCkYQDAAAEADAAABOBADAE//ZlADAA////ABADABQDADAEgC//AEABAEADqz//AD////kuAAgC//ACACQDgC//gCfPAC//ADADACEnAEAEgC","reverse":true,"order":{"count":129,"items":[9,0,16,21,26,27,12,23,29,15,11,7,6,24,22,13,4,10,28,25,18,17,5,3,2,20,19,14,8,1,34,37,38,43,48,54,56,53,50,42,30,62,46,45,49,41,32,31,61,59,58,57,55,47,44,36,35,33,60,52,51,40,39,71,78,81,89,101,94,92,82,74,69,91,90,86,70,64,63,76,68,75,87,95,77,73,83,93,88,85,84,80,79,67,66,65,72,110,121,117,112,108,107,105,99,104,109,128,118,116,111,98,119,115,125,127,126,123,122,106,103,102,100,97,96,124,120,114,113]}},{"distances":"QDADAEAEABQDAEgCkG//AE//ADAEABQDADAAhS//gCgCAE//ACAEDC//QDADAEQDADQDACACgCACABAEABADACADABAEACABADAC//AEADgYAC//AEACABQDQDAEACADgCADACKlAAABACgCAAgCABQDADAE//ADQDADACAEQD////OQQDgCAA//0+ADVOADABQDACgCACgCABADADAAACABADADAEScAAXyAB////ACABADACAClXQDADAEv+ABAE","reverse":false,"order":{"count":129,"items":[24,1,2,3,6,10,12,13,16,22,25,29,30,32,26,0,5,15,28,31,7,20,21,18,8,9,11,19,23,27,4,14,17,34,35,37,42,46,49,54,57,62,66,67,68,70,82,98,76,77,79,81,83,93,95,87,75,80,84,88,97,94,71,73,89,92,78,91,69,72,85,86,74,90,100,106,117,120,121,39,41,43,45,48,51,52,56,61,63,65,103,104,108,109,110,119,124,125,128,33,59,60,123,111,36,64,99,101,53,50,55,115,116,38,40,44,47,58,102,105,107,112,113,122,126,96,114,118,127]}},{"distances":"AAgC//AATCgCgCADACABAAADf1QD//ABAEgCAAAAACADABAAABAAACQD//ACAD+9P5itgCxdABAAgCAAQDAEAAABABgCAAABACADAEAAAEAEAAADACAAAEAAAAABAAADgX//ABAAADAAACgCABAAAAAAgCQDAAAAAAAAgCAA//ACcXAAAAXQAAACACABAAQD//ADAAAAABAAgCQDgCQDQD////ADABQDAAADAAAAAEAAACAAACAEAEADACQDgCQDAB","reverse":true,"order":{"count":129,"items":[0,3,10,15,14,2,17,6,12,18,19,23,24,22,9,5,1,4,21,20,25,28,27,13,16,11,7,29,26,8,37,39,42,46,47,44,43,36,31,35,33,45,38,34,40,32,51,53,52,50,49,54,55,41,56,48,57,58,30,59,60,61,62,67,69,72,66,65,64,71,63,73,74,75,76,70,78,79,80,81,83,84,87,88,89,90,93,82,86,77,68,92,91,85,94,96,98,99,100,101,110,108,107,104,102,112,114,115,117,119,128,126,127,125,111,106,105,103,95,123,122,121,116,113,109,97,124,120,118]}},{"distances":"AAADADACgCACAEgCACAA//ABAAACgCAAQDAEAAAAAAAAAAADAAAA//ADAEAAKJAAAAADABABgCgCAAADABAAAARKACAAABAAAA////ADzVgC//9aACACAEAEAE6+ADABAEgCADgCAAACABAEACAAgC////sVAAABAAAAAAAALMABvHAEQDAA//ADAAAE//AAQDgCAAAA//AAADkWAEABEGAAQDAAQDAAQDABAEAAAAACABADACQDADABgC//QDAAAA","reverse":false,"order":{"count":129,"items":[0,3,5,8,13,1,2,6,17,23,28,30,16,4,7,9,14,10,11,12,15,18,19,20,21,22,24,25,27,26,29,31,32,44,57,33,39,51,59,64,66,43,36,37,53,65,67,61,55,34,35,38,40,41,42,45,56,58,60,62,52,50,46,47,48,49,54,63,68,69,72,71,87,91,93,84,88,96,74,97,77,86,75,76,70,73,78,79,80,81,82,83,85,89,90,92,94,95,98,99,100,101,117,120,102,104,114,119,122,106,108,110,126,103,105,107,109,111,112,124,125,113,115,116,121,118,123,127,128]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":129,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":false,"order":{"count":129,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128]}},{"distances":"gC////QDABgCABADgCQDACAEoPQD////nBgC////QD//gCAEACABAEABACQD//ABAC//AEACADQDOVQDgC//AEABAD+iAD//ACQDQDACQDABZyABgC////QDQDACAEAD//ACAE87gCABAB//QDI9ADAEgCAClMADADACACAEM5ACAEsZABACgCgCgCADADABADoKAC//ABQDAEgCADgCQDAEABABAD//QDACABAD//0nQDACAB//AEQDQDgCQDADgCAEACACAD//ABAEACADw3gCgCQDtkADQDbbABQDABAC//ABADQDkt//ADgCABgCATgCAD////gC//AEAEABQD//AB//QDACADAE//AB2QADQDmWAC//AEAEADUhAD5hwkAE//ABAEgCAEABACgCABerQDACADADQDAC//gC////ADADgCADOugCgCABACoIABQDACAEADQDQDQDABQDADQDADQDACACAD2FADQDPSAB//AEADAEADABQD//EZABABgCABQDADgWgCAEAC//gCAEAD//ABgC//nQgCACABAD//ABAD//gCADSHgCgCAEABADBm//ABADAE//fdACABQD","reverse":true,"order":{"count":300,"items":[298,292,288,279,276,270,258,256,255,251,245,232,224,221,202,199,195,179,172,169,158,151,148,146,134,120,114,109,108,100,95,88,70,69,55,53,43,31,27,25,6,4,295,291,281,278,272,269,265,253,246,213,212,210,194,185,178,173,171,166,164,163,155,150,133,121,116,111,99,71,64,58,57,47,41,33,30,21,19,18,15,14,2,1,45,67,191,180,241,117,138,192,142,87,12,97,223,273,16,183,78,154,261,286,285,282,274,271,266,262,257,220,219,216,211,201,197,165,161,159,157,140,139,128,125,105,103,92,91,90,76,68,56,40,22,17,8,5,0,296,203,145,54,189,284,299,259,252,243,237,235,233,231,230,229,225,208,204,182,174,170,153,147,144,141,126,124,123,118,112,106,101,72,60,59,52,50,49,39,37,29,20,13,9,3,244,218,38,84,73,254,290,160,294,293,289,287,283,280,277,268,267,263,260,250,249,248,247,242,240,236,234,228,227,217,215,214,207,206,198,196,193,190,188,187,186,181,177,176,168,167,162,156,152,143,137,135,132,129,127,122,115,110,107,104,102,96,94,93,86,83,80,79,75,74,66,63,62,46,44,42,36,34,26,23,11,7,297,275,264,239,238,226,222,209,205,200,184,175,149,136,131,130,119,113,98,89,85,82,81,77,65,61,51,48,35,32,28,24,10]}},{"distances":"////gC//ACADAEQDQDpcADAEABQDABQDACgC0BAEAD////ADQDEMAEAEAC//ADQDADio7BACrwADABABACc4//ADABACAD//ADABgCAE//gCttgC//QDi6AEADAB//ABAEQDAEAC//Z1ABACADgCACADgC//gCACz5AEAC//AEACgCACACADABABACgC/NACAEgCQDgCgC//QDgCle//AE//AEQDADQDQD//CQACADQDQDAEACQDABlFgCAEADACXuAD//gCgCADAB//ACADAEADAEADQDAB////AEADADACQDQDADAEAB//ADgCAEAEAEACzMAEAEACAEACAB9a//ABQDAB//gC//ABI4AEACQDABAD//ADQDACADABQDIMAEgCDDAEAEABABgCgCADAE//QDADABABAEADABgC////ACAR//p2QDADACAE//QDphABgCACAEADQDACQDADgCgCADACABgCACADADABAEQDQDgCgCACABABACqvADQD//gCgCABAB8iQDADHiQDAEAE//ACgCADACABAEAC//AC//ACgCRH//seAEABAEAD//ADgCADACAEQDADAB4/2AgC","reverse":false,"order":{"count":300,"items":[4,16,28,35,40,45,67,71,74,79,82,85,87,88,92,95,115,120,127,136,149,161,165,167,180,187,214,220,227,231,237,240,249,252,269,272,275,277,279,292,5,6,10,11,19,20,23,26,27,30,32,37,43,46,48,51,59,60,64,66,72,75,81,84,89,96,106,108,110,116,119,125,126,129,133,137,138,139,140,141,146,147,148,152,153,156,158,159,160,163,164,166,179,183,185,188,192,195,196,201,202,205,208,209,219,221,228,229,233,236,241,242,244,254,263,266,267,271,274,284,286,287,289,291,293,295,215,114,194,25,264,191,178,7,8,13,15,24,31,57,65,98,102,109,111,112,117,118,121,142,150,151,172,181,186,190,204,218,223,230,232,245,246,255,262,265,294,281,128,69,41,2,17,50,53,55,73,76,78,86,93,97,99,100,103,124,131,132,157,175,193,199,200,211,226,234,235,239,247,248,257,258,270,280,290,299,33,58,123,104,9,224,217,253,36,283,54,162,80,18,298,297,34,261,169,94,0,1,3,21,22,29,42,47,52,56,62,68,77,83,101,105,107,113,130,135,144,145,155,170,174,176,184,203,212,213,216,222,256,268,276,278,282,288,12,14,38,39,44,49,61,63,70,90,91,122,134,143,154,168,171,173,177,182,189,197,198,206,207,210,225,238,243,250,251,259,260,273,285,296]}},{"distances":"AEAD//gCADjwQDABQDACTNAEACAC//gCgC//ADQDAEQDf3ACACABgCAC//AEAB//gCABAEQDAAACABACADuo//ABjZAD//gC//ADgCIrAC//AEAAABABACABgCADADAE1M//BkgCADAAdpgCAAQDQDXUACADfPACQDgCAB////ADQDABACADQDg8QDQDgCAENF//ACAE9yQDABACVp0o0NAEQDAAABgCCDQDQDgC1cgCADgCABtygCAE////gCAE//hcAC30bHABgCACAD//AEoFAD//QDgCAEQD//AB4KACACgCADFSACQDADn+ADgCgCAAAAgCADADABABAAQDACAEgCehAAgC//gCAB//ACADgCAEQDABQDACABABAAADQDgCADAAgCACgCQDAEACgCADADrHACQDAC//AEACACAAADqTQD//7lABAE82ABQDAAABgCACAEgCACAEAEABQDQD//ACgCAEgCABAEACAEgCiYABACgCADADgCADADAB//Z2ADABAEAANWAByzAE////ABAD9MACAEwEQD//ACgCACQDADACAEACAAABADAC+jgCACQDQDABAEgCQD//AEQD","reverse":true,"order":{"count":300,"items":[33,30,25,7,31,28,17,14,2,5,32,26,16,15,3,22,10,21,19,8,6,29,20,18,11,4,1,0,27,24,23,13,12,9,36,55,59,57,56,43,38,65,53,48,46,42,64,41,44,60,69,71,67,50,47,70,35,51,66,68,63,62,61,54,49,45,40,34,58,52,39,37,72,102,87,82,97,84,83,100,105,106,91,94,81,78,75,104,108,101,93,92,90,86,80,74,73,96,107,99,95,89,85,77,103,98,88,79,76,109,147,133,120,110,146,141,137,128,125,124,131,116,121,139,129,143,134,126,122,119,117,115,111,132,145,142,114,113,112,144,140,138,136,127,123,118,135,130,161,162,168,174,185,178,167,166,179,176,148,157,182,177,175,172,163,160,159,151,173,184,169,155,153,183,181,171,165,164,158,156,152,180,170,154,150,149,190,195,213,222,219,189,188,217,209,221,218,205,215,202,198,196,193,223,216,207,199,192,186,220,214,210,204,203,200,194,191,212,211,208,206,201,197,187,224,259,255,247,241,233,225,256,236,246,252,249,245,240,238,229,226,257,235,234,260,258,254,253,251,250,244,242,239,232,231,228,248,243,237,230,227,261,284,293,285,268,263,297,275,267,266,288,270,264,273,295,289,277,299,296,292,291,279,274,262,298,294,286,282,280,272,269,265,290,287,283,281,278,276,271]}},{"distances":"//ABACACAEA8QD//Ht//ADABADgC//ADAEQDAB//AEAEABAEABADADACAAQDACESQD//AC////ABABAEAD//YzERADADAEAB//ACAEAAAEACft+kQDAEgC//ABACADgC////ACADAD3EgCpqQDABgCAE9z3gACgCAAQDAAAAQD//QDADABAAAAABAEABAE//gCAEABgC//gCACAEAAAB//AEXuAB//ADAEAEAAABgCABAAHtAAADgCQDzZMe//AEACgCADABADQDQ2ABADADACAE2D//ACgCgCADvEABfJviQDADjTADQDABQDq1AEAAADQDAEHdgC+6QDAD//AEAEADACAA//3fABewBUgCAB////ABxJAA//O5ZuADQDABADABAEkvQDACABAD//QDADgCACQDAEABADAE//ACACgCADADADQDgCgCgCJB//gCQDADgCABAAADADAEAAAE//ACAB//ACADAE//ADABAEgCyFAEQDf7AAgCgCAEgCQDAE//ABoyABAE//AAADAEQDQD//QDgCQDAD//ACX4ADACAEr5AEACgCAD//gC//ADACAAAEAE//AC//AA//x434gC","reverse":false,"order":{"count":300,"items":[2,3,27,30,34,49,53,61,66,78,102,172,4,10,12,15,16,20,21,23,25,26,39,40,44,45,46,50,52,57,62,67,68,75,87,107,111,112,113,153,158,160,162,167,169,170,171,189,5,178,43,31,163,8,187,6,17,29,32,56,72,81,84,86,154,156,161,166,108,42,188,177,54,13,58,63,70,74,79,101,164,179,152,71,157,184,69,175,77,76,55,0,7,9,14,19,33,35,36,41,48,59,64,65,174,181,182,1,11,18,22,24,28,37,38,47,51,60,73,80,82,83,92,85,106,88,89,90,94,97,103,96,99,95,100,110,91,93,98,104,105,109,114,128,138,142,121,127,130,132,136,137,139,145,151,119,125,123,133,150,134,148,116,122,115,117,118,120,129,143,144,146,149,124,140,126,141,131,135,147,155,159,165,168,173,186,176,180,183,185,197,204,211,212,192,194,199,202,206,208,209,214,215,216,225,221,190,196,201,205,217,224,203,213,218,219,220,223,226,195,200,210,222,191,193,198,207,227,228,235,229,230,231,232,238,233,239,240,242,244,247,253,256,261,264,265,248,255,249,245,251,252,254,259,246,234,237,241,257,262,236,243,250,258,260,263,274,277,281,288,293,272,276,278,280,283,287,290,291,266,267,269,271,275,270,282,285,299,279,297,298,268,273,284,286,289,292,294,295,296]}},{"distances":"gCAEABAAAAAAABADADAEAAACAAYKADAAAEACQDAAAAgCAA//ACraAA//AEAAAAACQDAE9agCAAAEgCADADgCAAABAEAAZg//QD//ABAAQDAAAAAA//AAABAAgCAB057GAAAAn1gCADAA//QDAAACAAAAgCAAQDQDjJADAAAAQDAA//AAAAAAADAB//ACADAAAAAA//AEgCAEABAAAAADAAACACADgCAExfQD//AAABADADABAAAEAEAAADACAAACw/AAADABADAAABAE4+ACgCAEACWNAEAAAAACGuAAQDABAEAEAA//gCABACAAsMABQD//ACAABpABAAAAAAAAXqAAAA//AAAAAAACACADABAAAANjQDN1AAAEADACAEAAAAAAAEAAABAAACceAAAEQDgCADgCABMbAB//ACAE//ACgCACgCAD//////AAAAABAEgCAEgCAA//ADgC//AAAAAAgCABnWAAgCAAqXAAAEAAgCAAAAAAAAAAAD//QDAAgCAAQDACAAADMx//AEABABgC0hABQDAAgCQDAAAAQDAAAEADACAC////AAAArYAAAAADAAQDAAQDAAACACAA//Wf","reverse":true,"order":{"count":300,"items":[3,4,5,6,2,10,12,15,16,19,20,22,26,27,23,34,25,21,0,13,24,29,30,32,18,33,28,14,9,8,7,1,31,17,11,36,42,43,45,50,49,47,51,53,54,55,57,58,59,61,56,63,62,41,64,65,66,67,60,38,35,46,52,48,68,40,37,69,70,71,44,39,72,74,75,77,80,82,83,85,86,87,88,89,95,96,97,102,91,98,92,100,76,84,79,78,101,99,81,73,103,104,106,109,105,94,90,108,107,93,115,120,123,126,129,133,134,131,119,116,114,136,112,128,138,110,141,113,124,122,121,127,125,143,144,146,142,139,135,132,130,118,117,111,145,140,137,147,152,155,157,159,163,165,149,164,162,166,167,168,169,170,171,172,173,161,153,158,154,160,148,174,175,176,180,179,151,150,178,177,156,181,182,184,185,183,186,191,192,193,195,197,200,208,206,196,220,219,218,212,209,216,214,205,203,199,202,207,217,211,204,201,194,190,188,187,215,213,210,198,189,221,222,223,228,269,266,265,232,229,231,227,225,230,226,224,233,234,235,237,239,241,242,243,245,246,247,248,249,250,251,253,238,254,252,244,255,256,240,236,257,258,259,260,261,271,272,274,275,277,283,282,263,268,267,276,273,270,262,264,281,280,284,285,286,287,288,289,279,278,290,292,293,291,294,296,295,297,298,299]}},{"distances":"gC//ABAEAAAA//ABADAD////AA//yUAAABQD//AAAA//AAAAAAACAEADACADAEgCABoiAA//ACABQDAAADgCAEAAQDAEAEAAACAAAAAAAAgCAAAEImAEAAQDAAACAAAAAAADJ2ABQDAB/fAAAArRAAAAAA//AAADAEADQDAAAAAAACAAAEgCgCgCADAACPAAAAAAAAS6gC//AAgCAEgCAEAAACr8jJ//ADADAAgCAAAAAEADADADAA//AAADAAsO//ABgC//ACACgCAA//ABAAAAgC4eAAADAAgCADADAAQDADAAACAEAAAAAAACQDAAAAQDAAACAAAAAA7lADAAWV//AAAAADAE//ACAA//ADQD//32gCgCQDAAAAAAABACABAAAAAB//19AD//AAADgCAAABABAAAEAEADAAQDADADABAAAAAAACgCgCAEAAgCQDjYAAQDgCAA//UPHFAEACACACAAAAABABAEQDAAAAQDgCAAYPAEADAAAEADAAgCABAAAAAAADADAAgCgC//ACAAAEPTACAAjgAA//AAAAAAAAAAABABQDgCAAACAAACADADACgCgCAAABACgCAAADAC","reverse":false,"order":{"count":300,"items":[36,3,8,9,17,0,14,1,6,13,18,21,2,4,5,25,28,26,29,30,10,11,7,12,15,16,19,20,22,23,24,27,31,33,35,32,34,38,39,48,61,40,42,46,41,43,45,57,56,44,47,49,50,51,52,55,53,54,58,59,60,62,63,64,65,66,68,73,70,37,67,69,71,72,74,75,76,77,78,79,80,81,82,83,84,85,86,87,108,88,92,104,106,112,113,94,99,89,90,91,93,95,96,97,98,100,105,110,109,101,102,103,107,111,114,115,116,117,132,118,119,120,121,122,134,123,124,133,125,126,143,146,147,150,149,130,140,145,127,141,128,131,136,129,135,137,138,139,142,144,148,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,177,168,174,175,181,186,170,184,185,183,167,169,171,172,173,180,176,178,179,182,187,188,189,191,190,192,193,194,218,198,201,207,208,209,212,213,221,211,224,227,202,219,220,223,225,197,196,199,195,200,203,204,205,206,210,214,215,216,217,222,226,228,229,234,235,236,233,241,249,250,252,253,232,245,231,248,230,237,238,242,246,255,239,240,243,244,247,251,254,260,261,256,257,258,259,262,266,267,270,285,287,290,295,299,268,298,269,271,288,282,272,273,292,296,274,275,276,277,278,279,289,263,264,283,291,265,280,281,284,286,293,294,297]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":300,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273,274,275,276,277,278,279,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,298,299]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":false,"order":{"count":300,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273,274,275,276,277,278,279,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,298,299]}},{"distances":"ADCgACgCAEABADAC//gyABABQDADQDgCAB//AEAE8VADADACAEACAEid//QDQDAB//JWAE//ACgCAC//pcQD//QDAEAD////2+ACQDADAEABQDADAEABABABACACAE//gC//AE//gCAEABABAEAEABABACABABAE//ACADgCACAC//7FACgCgCACADAEAEACAC//ADQDQDABgCADQDSGADgCxAQDABQDADAEBwAEgC//QDQDQDgCQDABgCgCACQDAEgCgCACADhVABABQDACAEQDgCAED7AEAEAEABABgCqoAEABAEQDABgCKAQDACABACQDAE//ABXJfoADAD39//ABjZABAB//ABADACAD//v+QDPwADADBqPMADgCABQDgC////AEADAB//ACgCABADADAEgCQDAEQDgCgCADgC//gCS0gC//ADADACgCAEABABQDABB8ACACQD//ADABAEER//V6AEgCgCAE//AEQDAD//QDgCq2QDACAEAD//ABABACACACQD//gCOLAEnqgCLxgCAEACAEgCgCgCAEAC//AEQD////AD////gCgCQD//OMAEgCAEAD//QD//ADADACADADQDADACgCADAEAE+P//QDAD//AE//QDAEABADACAB//ACADABgCADMiACQDAB70AB5NQDgCgCVSACACACADAC//gCFuABAB//ACQDAC1lKPADACAEAEADAChB//JQgCAEPPABABABACADAEQDAEgCABAC5xADABgCACADABsu//////QDAEABQDABAEABgCAEgCABDoABQD////ACAEAB//d5AEAB//ABQDAD//gCAB//k6gCACQD//gCAD3L//AEgCx7k9wvgCNIACACAE//QDABABACBpADTpAB//ACADADgCAB////ABQDAB//ACQDAEAEAEgC//ABQD//gCiIAC//gC//ADADAB//QDN0AEQDACAEAE//gCAEQDodLy//AB4UAE1u//AC//gCACABQD+9ADQDABHtCkAC//AD//QDABACAB7NW3gCgCs3//ADAEQDACAEADACADAEAEACQDQDbX//ACAC//AEAEADACgCACACGSAB//QDAEgCACABACACABADgC9GABi0ABAEADABIKQD//ABAEQD//ACO1AEADAEfkgCh8AE//QD////ADQDADGYQDAD//gCAD////APAB//gCQD//ACAC//gLQD////EmQDACACqLAW6mHNAE//ADgCQD+KADADQDgCABAE//ACgCQD//ACADgCAC//ACDN//ABgCQDACADACir//ADhggC////AEACAEACACADAEAC//ADgC//ABgCABQDgCAEAD//QDorQDgC////ACAD//AEGIAEAEPCAB////AEMI//ABhaABQDcWQDAEgCgCAEABfqACAEABgCAEABADgCQDQDABACi8ACACADAEgCQDgCgCABABACAC6cADADgC9oADAEACADACADQDADgCADQDACAEQDAEAE//gCtsAEgCADACAEACsHADQDACAE+MADADAEABAEgCgCQDgCQD//ACADADpQAEMEgCABQD////ACgCgCgCACADAEAEQDQDAEgCgCgCADAEQDAE//ADJ7ACJljUADgCADAEQDAEQDtiACAEABABQDACgCAE//zIUgADQDgCQDABADACABABABgCABgCACuYgC//gCQDADAE////ACACAEAEACACACAEQDQD//ACQDdn/cABABLDAEgCAEQDAD//ACADQDADyAgCADQDAMABgCAEABgCAEABE1ACAE//gCgCQDgC3CACgCADACgCQDABACQDgCQDACgCgCADQDQD////DfQDADVBACADAD//AEADABACQDAEgCAEQDQDuGAD//ADgCADADt9QDgCABACACAB//ADADACACgC//ACQD06ADAEADwCQDACQrgCADABABACAEQD////gCABgC//QDQDAEAEgCgCrEACSd","reverse":true,"order":{"count":1000,"head":[988,981,980,960,957,939,916,900,897,894,877,876,849,847,846,845,842,830,829,791,776,734,733,722,717,714,710,702,700,694,674,672],"tail":[270,259,258,257,251,229,228,220,199,178,160,158,137,131,126,96,95,91,88,85,84,81,76,61,60,49,38,36,25,23,7,2],"sha256":"43bf73401b6882eb0e259474abdd275ee106179aa22dd885b4f4759a3b671710"}},{"distances":"ABB9ADT2QDADABADsMgCABBQqh5BQDAEAEABLkFXABgCQDABgCgCIu//8xABAB//ABFBAEAEAEgCAEuaQDQDAEgC//AEACAE//AEQDvr//AEQDQD//AD//gCQDABgCQDgCABHiABQD//ADADgCADN8//ACQDACI4gCABAEQDABAEACp7gY//AEADAcAEAEAB//ACADABAD//QDAEAEQDAB//AEAEQD//ADABQDgCADCH//////ABAE//gCXIQD//////NuADIKQDABQD////ADQD////uS4ggCQDADAEQDADAD//AC//QDQDAC//ACQDQD8O//ABACADgi3yADQD//ADgCQ2ACQDABADQD//ACAEgCQDACACAC//AB//YBQDADTRACAB//AB////ADgCQDABgCAEgCACEzQDACADAD////QDhSQDABACACAEABQD//gCAEABABAC//QDADACAD////QDAEAC//ADQDADAEsFAE//ACAEACABAEgC//gCADQDQD//ACACAEABAEgCACQDADM8AEADgCgCQDgCWhABAC//ABQDgCABADgC//QDADAEADAEgCABABADACnd//AEQD//ACACABADACQDQDgC////gCQDACABADAEAEADQDgCABADACQDADQDw+AEXLADf0ACVQACABACABACgCAD//24g3gCgCADAB//AE//H5QDgCAC//FU//AEADgCACAC////ADQDADABAEo+ACgCADACADABAEABWJAEAEmYABAD//ABgCAB//AB//ACgCACACAEAB//gCgCABACAElsADACAEAEAE7qADAC//7JQDABADABADACdnQDnAQDQDAEEfQDADQDgCAB//AEADABADgCgCgCABgCAEACACgCACAEABQOWlQDACACADAEADACgCgCQDloABABAEADAD//gjgCXaAEQDQDACgCAEADgCABADABAEV2HkgCdJ/z//QDACAEABADQDABgC//gCADgCzZ0HACACgCAB////ACACdrABgCQDgCQDQDgCAB//gCADgCACQDgCADAEACADADAEADADABgCABABTEACAC//ACADgC//QDACgCAD//gCAC//////ABACuWAEADADACgC//AC//AD////QDADgCgCgCAEQDABAC//ACAEAEAEQDAC//ACQD//ADYwgCABABgCgC////AEQDADAB//ADACADgCACADLSvWAEADADQDgCQDABACAEgC//T3QDADgCgCABQD//ADAEADgCQDQD//ABgCADADgCAEAEwAABLMOFABQD//XZADADgCAEAEQDADgCAEQDADLRzbADACAEgCFMABACAEAEAD98AEADQDgCACADACAEgCeagCACAEADukABACACABQD//lOgC//QDABAEACQDgCABQD//AEADAD//QDABADADAEofQDAEzyQDQD9b//ABgCACww////Ps//AB//ABgCAEAEABACtPQDgCAC//QDgCgCdXQDgCABAEQDABgCTu//gCACADACgCACABgCAD//ADAC//ADABAB////AEAEQDJKQDABADQDABAEAEQDCZAEgCAEQDABgCAEAEAB////ACADAEgCgCAEACADABADAEACAB2NgCgCQDAC////gCAE//ACABACACAEy9ABACdIAEgCgCABAB//AE//ADgCADAEgC//QDADgCgCABAEQDgCQDACABgCgCVCAEAE////QDQDgCACADgCACADAEgC//AEgC//ADABACVr//PmQDAEbFAE//ADABADADABQDABAEe6AE//AEgCAD//////AC//QDAEAEgCADuLQDQDAEABAE////gCAEgCQD//////////QDAC//AEADAEABADAEADABACl6gCQDgCACPg6jACgCABADAEgCAE7wACoOAEAD//ABTbACS7gCQDgCgCACAEPBgC//////ADQD//QDQDgCtLADADACUVJxwjAEQDACAC","reverse":false,"order":{"count":1000,"head":[46,76,78,86,97,152,156,158,164,174,180,184,185,186,194,207,210,219,220,229,233,239,248,250,260,261,266,278,296,302,303,306],"tail":[710,718,730,738,740,744,757,760,770,778,779,787,790,799,803,814,818,830,835,841,842,856,862,885,896,899,901,923,942,946,957,968],"sha256":"806fbb7e95cdff9d33fa6c1ff52a13709a3d296bce7db04327793400d28a4e6a"}},{"distances":"QD////AAABABgCAA//ABABwpAAAAAEgCQDQDQDncABgCX/gCAAADABAAAEABQDgC3bABQDQD4zgCAEADACADgCQDABAEhlAEAEAD//ACQDAEAB/XACgCQD//QDADADADADgCQDACAD//AAACADAB//QDAEACQDAEAL45ADgCACACgCAECYPEABABABAAACQDKl//AkACgCAAQDADAAAB//AAAEAB////QDAEACACgCdzABQDADAEAB////ACAEAAABAD//ACACgCQDACv2ADADgCQD//AAQDAEQD0SAEQDgCADAEAEACAE//h7//ABAAADAEQDADQDCaADAEACMGgC//AEABQDACABAEQDABABQDgCAEADABdYJGgC//ADQDQDAD1VAEACgCADQDQD//AC//yPABQDAEAEAEAEABACQDACAB//ADgCgCgCABgCACACADQD//GM////fdAEgCQDADAAAAgCADQDACQDQDAAWUgnADsCgCQDADADABcoQDACgCACABACAEQDAEADgC////dTzMgCQDAEQDAEABymgCAD//ADAAgCAEADgCQDADAEgCADADACQDQD//ABAEAAQDAA//ACaGACAB//ADpfgC//AEQDADQDADACAAADQDAAAAAEQDziQDADADAE//AB//QDADQDAAQDACAAAB//QDAA4VAAABAEQD1UACAEAE//AEADABgCsO//DZ////LWACQDAEAB//gCgCQDgCACAEAEAEgCQDAD//QDACACADACAB//QDp7//ACAEABACAAQDAEACgCAE//AEQDgCOxAEAB//AEADQD//AEACACADgCACgCABAAADgO//ACADABQD7YABgC//AEQDACjRQDACQDwdACADAEAEAEACABADACAEADAB//AD//gCgCACACliQDgCAEpJAEAAViABQDAEADABADgCtY//ACACAE//AEADAA9rgCQDADACACADADADQDACgCQDACACQDACQDjrAEAEABAEACACACABAEAEAB//ABAEACADgCAEAAQDABABQDACACABAD4QADl2gCACAAE6AVADABsigCQDQD//QDADAAgCJpAEABQDQDAC//AC5wABACgCAA//QDgCAA//ABAAgCAAAEADQDAAgCAEACUUgCAEi1QDgCADACgCgCACACADCsQDADACQDADgCACAEQDAEQDgCAAQDQDgC//ABQOAE5BABQDAB//gCQDABAD//ACgCgCUOACTSAE8Si4QDABgCIOACADACgCHWACAE//ABAEgCQDACiQgC//////ABAEAC//ABAEABADADQDKCgCADACAEAEQDAC//AA//AAQDAE23gC/vADADABAAABAEAEADfaAAAB//fsAEgCABAEQDgCAC//AEgCAEAAACgCAE//AEACQDgCABACADAEgCQDADADADgCgCQDV9ABADADACTCgCAEQDADADABAE//ADAEADAAQDABAEQDAEATRPKbAETiQDgCAEAE//AAACgCACAE//QDADADAEgCACABABAC//ADABgCACgCACgCABQD//ADQDAE////gC//ABAAACAC//gCAEQDQDAB4DAEAAAC//AAAD//ABAEACADABgCABAD//gCQDADADQDADQDADAAABAD//ADgC//gCABACACmwQDABAE//gCgC//ADIXADAAgCABQDACACQDADAEQDADADAExagCAEAEKLAEAC//gCACAEAEgCABADACgCACAEABQDAE//AEACQDgCADACQDgCgCABAEAEQDgCACgCACACAEHGAAAC//AEABQDACABAD//QDQDACADNL//by//AE//QDADa1+KQDgCAEQD//pr//dhAEQDHcABAEAAAEABAD//ACAEACABzOACAEAB////AEABZKAEgCACACAEQDQDACQDABAAABGo//ADQDADACgC6BQDQDQDgCQDADXzQDAAgCHOhDABgCH8//QDAEABABQDfA","reverse":true,"order":{"count":1000,"head":[3,7,12,13,24,27,54,44,33,29,26,20,10,9,5,4,50,8,2,1,36,32,11,19,46,42,37,31,23,21,15,6],"tail":[985,982,980,979,978,973,966,964,963,992,937,988,970,995,983,974,972,962,958,955,951,946,943,941,939,975,965,961,960,950,947,945],"sha256":"617f98ab3bdd2c0c077f55dc4a748461c23094c141c6e512404d0025bf32dc05"}},{"distances":"ADACAC//AB//gCABAAgCAEQDAEAEACABADADQDACAAaeACAEADAD+UAB//AB//ABAEADQDgC//w+ABABABABAAACADQDAB//W7gCAB//QDACAEQDAEwJgCAEtuAEgCABAE//ADADgCgCQDgCAD//gCACQDABACABACAC//AAAB//ABAEuLACACgCADQH2vuH//QDABAEgCADACAEAEADACAEACQDAAAEAEAAABAEQDgCADYrAD//ADADAA//6948ADX1AC//gC//AD//WYACk9//AAAEAAACQD//QDADAEACADAEQDgCAE//gC//CmABgv//AERyyb//gCACriADAEACQDACQDAEmxAAgCgCACADQDQDABQDAE//4KAEAB83CqACQDABgCQDADAAACQDQU5qABOEACAAACAE//QDADQDhjQDRVACAEAE//ACAEADQDQDgCABACABQDAEQDIZgC////ACQD//ABAEAEAEABACABAEgCgC//ACAEQDABQDAE//AEAAADAAACQDAEkfABAEgCjsgCAAABAD//gCABUTgCAEgCAEABABAEAEABABACQDgC//gCABQDQDAAABAEAD//QDAAgCAExgt0AAQDAC//ABgC+iAAADADgCAAACQDACAEgCADACABY4ACABQDAEADAEHSADAEgC////gCAEAEgCABQDADADzVQDveADgCABABAEACAD6GABABAEABQDADgCAAAEADABADADAtgCgC//AEADADOYAAABAE//RM6X//ADACQD4egCABoA4hADACABQDgCAE////ABAEQD/bADm2AD9n//AA//ABgCQDQDQDHeABQDgCAEACABQDQDADABABFHDmABACABADgCABAEgC//QD//gC//gCAD//ACAC//////ADoNABtjgCADhMADACACAA//AEAz2l//QD//gC//ACQDZ6AEAA//AAACACACQDQDACKbyEADABAA//ACIWABl0//a6//ABgC6JABADACgC8S//ADSxAEABACY7AEACAEACACOQgC//AAACAAADADABABhkJwAD//ADQDAEADACahgC//QDADFdAEgC//QDj0ACADgCAEACAC//ACAEQDACACACe6AEADABACADABAEABAEABABAC//ABABgCACgCgCACAEABAD1GcGAEACACACABjrACgCABABQDACABQDACADQDgCgCs5AB8b//AAACACAA//ABACABAEAB//ABgCACQDADgCAAAEABQDgCACACAC//QDgCgCADAB//HE//GMQDLAAEADQDADABhyABAAADAAAEQDQDgCADAEQDgCXQADAB//ABQDADQDABADAD//j3//gCAEAENngCADJVgCgCACQD//AD//AEgCQDAEAB//QDoCQDQDADAErShQAA////ACACgCADgCABQD//AAAE//gCABAC//p6AEAAACQDADAEAEQDADQDADACAE////QDAC//a9GDABZM//QDADAEADQDQD//ACgCADNdEuAEABgCACgC//AB1P//AC5cgCgC////2cQDABQDQD//AD//ABAC//ACAEQDQDACACg9//gC//ABABAC//ABABgCAAACAEABQD//gC//gCABABQDQDAAQDQDQDAEQD//gC//AE//ADAAACAEgCgCQDADAAQDAEQDABQD//AAAEADABgCABABgCgCABAEgCACJGAEAEQDAEACQD//ACgCgC//ABACgCAD//ACg4gCgCDH//QDgCADADAEgCADAEAEgC//egQDACACgCAB//gCgCACQDAAACADQDQD////QDAEAAQDACAEAEgCADABAAABgC//QD//////ADACQDAEABAB////a0AB//QDACQDABQDAEFc//gC//ABACABgC//ADABACAB1eAE//ABACAEQDADACgCAEACgCABgCgCABADABgCQDACAEgCABABAEQDACAEQD//LZACAAmlADgCgCm8AD//","reverse":false,"order":{"count":1000,"head":[1,2,14,19,22,43,53,0,10,12,13,16,17,23,24,25,32,33,44,54,56,59,61,11,18,34,45,52,55,48,21,6],"tail":[425,429,430,433,435,438,495,500,503,675,748,848,850,851,854,870,921,932,933,937,942,949,951,955,957,961,971,974,976,982,983,992],"sha256":"54f09b4a9d2f71cad00e0c70123e57f1145c90f1f8ae500a861d3317a6b67797"}},{"distances":"S8gCAAAEAEAAABACAEAAAA//HJAAgCAEAAAEABymAAp+AAAAAAQDAEQDAAAAAAADgCgCABQDAAAEAAAEQDAAAAAAAA//ABADAAAEACAAQDAEAAADACABAAAAACADgCAAgCABAAp1AAADABAA//AAABgCADACACAAAAgCu0////N269ADQDAEgCADADACADQDADAC//ACAAAAlA//AD+/ACABAAgCACABQDAEnDABACAAADABQDAAgCABAEADgCACd7AA+ApXABAAAA////AEADgCACQDAAAAAE//AAAA9ZAAQDAAXHACACeWAAAE//ACACf2//ACQDAAAAQDAAAAQDAAAAgC//gCADACgCAAQDgCAAABAAAEAEAAAEAEQD6bAA//QDdmAAADAD//QDAAAAAAAAAAAAAAAAACgCQDgCADAEQDAAABAAAA//AAAEAAAAAD8TABgCAAD5gC//QDAAicAAdFADAAgCAAgCAEAAAAAEAAAAAAACYYQDQDACAAABAAACQDgCACAAAA//QDAAwQmGABACQDAEAAABAAACAAgCD7AAC3AEAB////gCACgCAAAE//QDADAAAEgCAAAAAAAEAAAAADABAEAAxXUWADABQDgCAD//AA//AEAEQD//AEABABAEABABABAAQDQDdLAC8qQDACAAAAAAAAgCACAAAAACAEQDABAAfsABQDAAAB//gCAAAAAAAAAE////AAgCAAABQDQDAAAAADQDAAyJAEAAAD//ACAA//AEI0ADAAAAAAAAgCAAQDACADAA//egACAAAE7NNFgCgCAE+nACAAABAAAA////AAAAQDAAAC//AEACAA//ACABEo//ABABQDWXAAAD//ABgCAAgC73//AAACAAAAgCrfQDAEAAAAAAgCACAAAAADAEgC//AAAAAEACADAA//AAAEABAAACACWcABAAAAACgCAAAAQDAAAAACAAQDAAAEAAAEAAQDgCAAAAAAAAAAADACAE////gCAA//AAABABAE//AAAAAAgCAAgCAAABACQDABAASIABAAADDJgCADAAACABAAAA4ZAAQDADAAACgCv0AAgC//AAAAAAABAEQDgCAAADAAADAAABAB//QDAEAAgCAAADAEACAE//AAQDAEADAwQDACAAAAtBADADAAADADQD//AAAA//AAAAAAgCACACAAABAEAAgCAAAAAE//gCQD//ACgCAA//AEAAAEABgCADACAC7K467Y//AEABAEAAAAQDgCAA////ACAAACgCAA//ACAC//ABAEgCQeAEQDATABAEAAQDABAAAEAA//AAAEADAEAA//AAACQDQDAAACAAADAAQDQDAAAAAAAAAAAAADQDACADQDAAAAADACABADABQDAB//gCAEADACACAB2rACADQDAC//7FAA3fQDGB////gC2eADAAAEQDACgCAAACACgCACkGAAAAACABAAgCAAAAQDgCAAAAAA/uADJhAEAAAAQDAAAE8tAEADgCACAD//AB//ABABAB//AAAAAAAAAAAEAEAAgCgCAA//AAAA//AEADQDACADQDBAAAAA//AAAAgCAAAAACAAAA//ABAEgCAAAD//ABQaAAqGgCQD//AAAAAAACAEABAC2XAAAAQDAD//ABQDAEAEgCAAACgChg//ADAAABAAACAAAA//ADAAbcAAQDAAAA//AD//AAgC//ADW+AAADADAAACQDgCAD//AAACABgCADAEADAAACAAAAAA//AAABADAAAAAEgCAAAEAAADABgCADAAAAAAAAAEAAAAAAACAAAEADQDABRZAEAEAAADgClRAAADAAADAA//ACAEAAAAADAAQDAAACAA//gCwOwJABACACQDABADdFABABAAQDAEAA//46ABgCQDAAAA//AB//ADAAQDAAgCt7tQAAABetAAADAAAAACAB//gCAD//AD//QDQDABAAADADAAAEADgCAAroADACAAAEAAAAAC","reverse":true,"order":{"count":1000,"head":[2,5,6,9,10,13,16,18,20,22,23,24,28,29,30,34,11,35,36,38,40,41,42,43,44,46,45,19,21,33,32,14],"tail":[946,973,984,987,990,976,968,982,961,989,988,991,992,981,939,993,959,994,995,996,986,985,979,977,970,947,941,938,937,997,998,999],"sha256":"1fa7fc9648f5cc9d53b9c56f834b95171364c933dc4b07a61da159f8a35700a5"}},{"distances":"AAAE//ABACADgCQDACAA//AEgC//AAACQDACADADQDAB////gCAAAAAAAAgCAAACABgCABgCAAAAACAAAEAAACItAAAAAAQDAEABAAACADADAEAAAEgCABABAAlE//QD//gCAEADACAAACQDgCAC//ADgCAEAAACABgCAAAAAEAAACAAQDsyABQDAAgCQDgC//ACgS////ADACgCAEgCQDAAAAgCADAEQDAC//AAQDAA//ACQRAAAAAAAAAEAAagh2gCAAAEAAAEAAAAAEAEACAAgCAEpUACAEACAEQDAAAAAAABSYgCgCAAgCrbgCAA/9ACAEQDAAAAAEADgCAAAAAAAAQDAEgCQDQDgCAAADAAADAAADQDAAAAAAAEG+AEAAQDAAQDADQDQDABACAC////AEADgC2bAAgCYGAA//ADgCAAgCAAgCABgC+KQDQDAAACAAgCAAAAAB//ADAAADAAgCAEAEQDADAAAAAAAAofQDAAgCQD////EA//w/gC//f2AA1/AA//AAAAgC//AAQDAEAEADAA//AAACAAAAABAA//AE//AAgC//QDAAADFdADABACABAAQDAEADABABADmcAEAEAAQDADAC//AA//AEACAA//AAAAA+AEQDAC//ABAAgCAAAAQDNhQDACAA//ACQDAAAAAAAEAAgCAEADAAAAAAgCQDAAAC//AAADAAAEABFtAEAAABABgCAA////QDADAAADAEAE//AEACAAQDQDAEAAgCACQDAAAAAAgC//gCADAA//60ADgClpAAAAAAxRAAAEACAC////AAABADKWAEABgCACQDAAAAAAAEAAAEAEAE//AAACAAgCAAAAACAAAAAAABAAAAACQDQDAAR7AD////AEAC5EQDAAQDMrAAADQDADABAAADVMQD//AEAAAAQDAAABACKSQDgC//AAQD5tgCQDAAAA//gCAAgCJOACABgCAAACABABACAB//AAQDgCAAAAgCAAAAAEACAA//AA4fADAAgC//ioAAQDgCAAgCAEAAgCAD//AEACgC//AA//JQADAAQDgCAAAAACAAAA////ACAAgCgCADAAAA//ABAAAEACACAA//QDAC8CABAD1FAAABAA//ADAAQDAA//B/QDAB//AAAAABAD//ACAAgC//S2AA//AAAAQDAEACAAAAADAAACAEACAAgC//QDAEABAAAAAAAD//gCAAACQDAAPWAB//ACgCADACADDj//AEADgC//AEgCAEQDADACADAAAEQDAAQDAAADACAAACAAAC//ACAAAC//ABAEABgCAAAEAE//4MAAAEAAAEAA//gCAAACACgCAEAAAB//ACQDAACyXcAC//ACAEACAEAEAD7HAAgCQDADgCjkAAgCABAAADKOADADAC+sgCQDQDADAAAAQDQDFR//QDLYAEACADAAAAGtADQDQDADAAACAAHcACAAACAEQDgC//AAAAAEAAAEADQDi1AD61ABgCACAA4OAAACAEAEADAAAAAA//hSoDfhAE+6/1AAAA7jABAAABQDAAAA//AEAA//QDAEABAAAAAAAEABA1ABAAADHFAAgCAAQDACgC//QDADQDgCACADzYAAAAABADAEAAAAAAAAAAAAABMdAAAAgCAAAB//AEAD38AAQDQD//ACQDAAAEABQDAAABgCAD//ADQDACAAAAADAD//AA//AAABAELjAEdPABb4QDAAABADQDgC//AAAAgC//gCACADAA//zEAEAAAAAAAAADiIAEAEAAQDABAAAAQDAAAB//QDQDACAAACAAQDAE//ACACQDAAAAAA//AE//AAADAAYnQDAAADImAAAAAAACAA/zQDQDAAAAQDACe5AAQDACAEACABACDHAE//AAADAEsuAEAAAEAAAEAAgCACAAQDAAAAuvAAACgCAAAAACACVoIqQDAAAB//ACACAEADQDAAAEAAgCAAQDAAAAABAAgCABgCAD//QDQD","reverse":false,"order":{"count":1000,"head":[0,4,8,15,17,31,38,42,51,1,5,11,18,19,40,48,52,53,54,56,43,7,16,20,47,6,12,24,35,61,2,10],"tail":[926,927,929,933,934,938,943,948,951,953,955,957,958,960,962,963,965,968,969,975,977,976,983,985,986,987,989,990,997,991,992,994],"sha256":"457585e5f653ca3119e3944861ab15a07a7b3765719c03b743c54bd62f1b681c"}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":1000,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[968,969,970,971,972,973,974,975,976,977,978,979,980,981,982,983,984,985,986,987,988,989,990,991,992,993,994,995,996,997,998,999],"sha256":"a1002f575c7074b1212021044bde2d1b870f8120e8b4e8d95052ab7e37c4cf79"}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":false,"order":{"count":1000,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[968,969,970,971,972,973,974,975,976,977,978,979,980,981,982,983,984,985,986,987,988,989,990,991,992,993,994,995,996,997,998,999],"sha256":"a1002f575c7074b1212021044bde2d1b870f8120e8b4e8d95052ab7e37c4cf79"}},{"distances":"AAAAAAAAAA+zAAAAAAAAAAAAAAAAAAAAAAAAAA6oAAAAAAAA2BAAAAAAAAAAAAAAAAAAAAAAAAAAvBAAAAAAAAAAAAAAAAAAAAAAo/AAAAAAAAAAAAkvAAAAAAAAAAAAAAgrAAAAgOAAAAAAdhAAAAAAAAAAAAAAAAAAAAAAAAY9AAAAAAYOAAXRAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIiHwAAAAAAAAAAAAAAAAAAAAAAAAAAByAAAAAAAnAA","reverse":true,"order":{"count":146,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145]}},{"distances":"wBgCAFgCwBQDQDwBgCAFwBAFwBAAQDAF//AA//AAQDAFwBQDwBgC//QDwBAFwBgC//wBwB//AFQDgCgCwBgC//QDgC//AFQDAA//AAAAgCQD//QDgCgC//gCAF//AF//gCwBgCAA//wBAFgCQDQDAFgCAF////AAwBwBwBAFwBwBAF//AFwBQDAF//AAQDAFQDgCwBQDAAQDAFgCwBAAAAQDQDAFQDAFAAgCQDgCgCwBgCgC//wB////wBwBgCQDgCAFwBAF//AFQDAFQDQDQD//AAwBgCgC//gCgCAFwBgCwBgC//AAgCgC//gCAFwBwB////wBAFAAwBwBgCQDwBAF//wB//AFgCgCgC//gC","reverse":false,"order":{"count":181,"items":[2,9,11,15,21,29,36,5,6,14,20,23,27,37,43,138,1,3,8,25,31,38,39,44,0,4,7,10,12,13,41,28,30,33,34,16,17,22,18,19,46,60,62,70,83,86,47,48,74,76,88,91,53,55,72,73,90,56,59,64,66,71,69,82,49,50,51,52,57,75,24,40,65,80,81,84,89,26,32,35,42,45,54,58,61,63,67,85,68,77,78,79,87,92,93,95,102,109,111,129,131,133,94,96,99,101,107,108,110,114,134,136,97,116,98,100,103,104,105,106,112,135,139,140,147,158,164,171,175,127,137,169,113,115,118,119,126,128,142,143,145,146,149,151,154,155,157,168,176,177,178,180,117,121,124,125,130,141,148,150,160,163,166,167,170,173,144,152,153,159,120,122,123,132,156,161,162,165,172,174,179]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAA/NAAAAAAAAAAAAAAAA+sAAAAAAAA+YAAAAAAAAAAAA95AAAA91AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8KAAAAAAAA7+AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA6mAAAAAA6aAAAAAAAAAAAAAAAAAAAAAAAAAAAA5mAA5XAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA30AAAAAAAAAAAAAA3CAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0SAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAykAAAAAAAAAAyFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAv7v6AAAAAAAAAAvLAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAt/AAAAAAAAAAAAAAAAtftcAAAAAAAAAAseAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAqyAAAAAAAAAAAAAAAAqMAAAAAAAAAAppAAAApXAAAAAAAAAApQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAm8AAAAAAAAAAAAAAAAAAAAAAlxAAAAAAAAAAAAAAAAAAAAAAAAkqAAkNAAAAAAAAAAAAAAAAjmAAjeAAAAAAAAi6AAAAAAAAAAAAAAAAAAAAAAAAAAhqhphnAAhjAAAAAAAAhXAAAAAAg+AAgmAAAAAAAAgBAAAAAAAAAAAAAAAAfhAAAAAAAAAAAAAAAAAAAAewAAAAAAAAAAAAAAAAAAAAAAAAAAd9AAdtAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAbkAAbfAAAAAAAAAAAAAAAAAAaXAAAAAAAAAAZhAAAAAAAAZGAAAAAAAAAAAAYUAAAAAAAAAAAAAAAAAAAAXVAAAAAAAAAAAAAAAAAAAAAAW1AAAAAAAAAAWaAAAAAAAAAAAAWAAAAAAAAAAAAAAAAAAAAAVLAAAAAAAAU4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAATAAAAAAAAAAAScAAAASXAASLAAAAAAAAAAAAAAAAAAAAAARcAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOUAAAAAAAAAANjAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMgAAAAAAMEAAAAAAAAAAAAAAAAAAAAAAAAAAKqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAJTAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHYAAHLAAAAAAHCG9AAAAAAAAAAAAAAAAAAAAAAAAAAGSAAAAGNAAAAGCAAAAAAAAFvFtAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEFAAAAAAAAAAAAAAAADwAADtAAAAAAAAAAAAAAAAC8AAAAAAAAAAAACTAACNAAAABvAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":785,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[753,754,755,756,757,758,759,760,761,762,763,764,765,766,767,768,769,770,771,772,773,774,775,776,777,778,779,780,781,782,783,784],"sha256":"80cdcd8f64fa9c387ae254f3dd5c3e1cf9f5db1530a8081b80b7a0d22d5073c1"}},{"distances":"wBAFQDAFwBQDAF//AFAFAFAA//wBQD","reverse":true,"order":{"count":15,"items":[7,0,10,11,12,13,4,14,5,2,9,8,6,3,1]}},{"distances":"AFTim/AAN+AA04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFAAAFTim/6bAAhb04IaAAvUC3AApw9NQwkNAALMepyGFpAAsiAFAAm/6bN+hb04AAb3vUC3WUpw9NAAkN3qLMepyGFpAAsiAFTim/6bN+hbAAIab3vUC3WUAA9NQwkN3qLMepyGFpZFsiAFTim/6bN+hbAAIab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAATim/6bAAhb04AAAAvUC3WUpw9NQwkN3qLMepyGFpZFsiAFAAm/6bAAAAAAIab3vUC3WUpw9NQwkN3qLMepyGFpZFAAAFTim/6bN+hb04Iab3vUC3WUpwAAQwkNAALMepAAFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qAAepAAFpAAsiAFTim/AAN+AA04Iab3vUAAWUpw9NQwkN3qLMAAyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpwAAQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwAA3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NAAkN3qLMepyGFpZFsiAFTim/6bAAhb04Iab3vUAAWUpw9NQwkN3q","reverse":false,"order":{"count":362,"items":[0,20,17,1,2,3,4,5,23,10,33,43,7,30,40,14,37,24,11,21,8,18,41,28,15,38,25,12,35,45,9,32,19,42,6,16,13,22,26,27,29,31,34,36,39,44,46,47,69,56,79,66,89,76,63,86,50,73,83,70,57,80,90,54,77,64,87,51,74,61,84,48,71,58,68,91,55,78,65,88,52,62,49,53,72,59,60,67,75,81,92,115,138,102,125,148,171,112,135,158,181,99,122,145,109,132,155,178,96,119,142,106,129,152,175,93,116,139,162,103,126,149,172,113,136,159,182,100,123,146,110,133,156,179,97,120,143,166,107,130,153,176,94,117,140,163,104,127,150,173,114,137,160,183,101,147,170,134,157,180,144,154,95,98,124,111,121,108,131,118,141,105,151,161,164,165,167,85,82,168,169,184,185,186,187,188,189,190,207,194,217,204,227,191,214,201,224,211,198,221,208,195,218,205,228,192,215,202,225,212,199,222,209,196,219,229,193,216,203,213,200,197,206,210,220,223,226,230,253,240,250,273,237,260,270,234,257,244,267,231,254,241,264,274,238,261,248,235,245,268,232,255,242,265,252,275,239,262,272,236,259,246,233,243,247,249,251,256,258,263,269,266,271,276,299,286,309,296,319,283,306,293,316,280,303,290,313,277,300,287,310,297,320,284,307,294,317,281,304,291,278,301,288,311,298,321,285,308,295,318,282,305,292,315,279,289,302,312,314,322,345,332,342,329,352,339,326,359,323,346,333,356,343,330,353,340,327,350,337,360,324,347,334,357,344,331,354,341,328,177,338,361,325,128,174,335,336,348,349,351,355,358]}},{"distances":"AAAAQDQDAAgCAFwBAAgCAAAFAAAA//AAQDAAAA//wBAAAFAAgCAAwBwBwBwBAAAAAAAAQD//AA////AFgCAAAAAAAAwBAA//AAwBwBwB//AAAAAAQDAAQD////QDgCAAAAAAQDwBgCAAAAAAAAgCgCwBAAAAgCAAAA//AAAAAFAAAAQDAAQDgCQDAAAFAAQDAAAAQDAAgCAAAAAAAAgC//AAAAAAAAAAwBgCAFQD////wBQDQDQDAAgCAAAFwBwBAAgCQDQDgCQDgCAFAAAAAFAA//AAQDwBAAAAAAAAwBAAgCAAAFAAAAgCQDAFAFQDgCgCAFwBAFAFwB//AAAAAFAAAFwBwBAAgCwBAAAAAFAAAF//AAQDAAQDAAAFAAwBAAAAwBAAgCAAAAAAAFAAQDAA//wBgCgCAFQD//gCQDAAgCAAwBwBAAAAAAQDAAAAwB//","reverse":true,"order":{"count":226,"items":[0,1,4,8,10,12,13,15,17,18,21,23,25,30,31,32,33,36,41,42,43,44,46,48,52,47,38,37,35,19,14,51,50,49,45,29,28,27,26,20,7,40,24,9,5,34,16,3,2,39,22,11,6,53,54,55,57,60,59,63,64,65,69,70,71,72,75,67,74,73,68,62,66,61,58,56,76,77,79,80,82,83,85,86,88,92,94,96,97,99,101,102,103,104,106,81,105,100,90,78,98,95,91,89,87,93,84,107,108,109,110,111,117,116,118,122,124,128,136,137,139,140,141,143,127,126,112,144,145,146,147,149,151,153,154,167,166,163,148,161,160,155,150,134,132,129,123,113,159,156,142,133,131,130,121,120,119,115,165,164,162,158,157,152,138,135,125,114,168,169,171,175,178,179,181,183,184,186,188,190,191,192,193,195,197,198,199,201,203,210,204,213,215,217,216,205,194,177,174,173,214,211,207,206,196,176,212,187,185,208,189,182,218,219,220,221,209,202,200,180,172,170,222,223,225,224]}},{"distances":"AA/kAA/g/UAAAA/DAAAA+vAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8hAAAAAAAAAAAAAA77AAAAAAAAAAAAAA7ZAA69AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA5VAAAA5G4xAAAAAAAAAAAAAAAAAAAAAA32AAAAAAAAAAAAAAAAAAAAAA2uAA2qAAAAAAAA2JAAAA2BAAAAAAAAAAAAAA1jAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAzxAAAAzhAAAAAAAAAAAAAAy6AAAAAAAAAAAAAAAAAAAAAAAAyGAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAw5AAAAwgwSAAAAAAAAwLAAAAAAvuAAAAAAAAAAAAAAAAAAAAAAAAupumAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAtfAAAAAAAAAAAAAAAAAAtDAAAAAAAAAAAAszAAAAsiAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAq6AAAAAAAAAAAAAAAAAAqGAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAohAAAAAAAAoXAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAmQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAlPAAAAAAAAAAAAAAAAAAAAAAAAAAAAjwAAAAAAAAAAAAAAAAAAAAAAAAAAAAiZAAAAAAAAAAAAAAhHAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAf8AAAAfuAAAAAAfhAAAAAAfKfIAAAAAAAAAAAAeSAAAAAAd+AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAcrclAAAAAAAAAAAAcHAAAAAAcAAAAAbvAAAAAAAAAAAAAAAAAAAAAAAAapAAAAAAAAAAAAAAAAAAZyAAAAAAAAAAZTZRZQZJAAAAAAAAAAAAAAYTYRAAAAAAAAAAAAAAXzAAXhAAAAXVAAAAAAAAAAAAAAAAWmAAAAAAWXAAAAAAAAAAAAAAAAAAAAAAAAAAAAVWAAAAAAAAAAAAAAAAAAAAU9AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAATKAAAAS8AAAAAAAAAAAAAAAAAAAAAAAAAAAARSAAAAAAAAAAQ8AAAAAAAAAAAAAAAAAAQUAAAAAAAAAAAAAAAAAAAAOVAAAAAAAAAAAAAAAAAAAAAANHAAAAAAAAAAAAAAAAAAAAAAAALmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIOAAAAAAAAAAAAAAAAHhAAAAAAAAAAAAHGAAAAAAAAAAGsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFNAAAAAAAAAAAAE2AAEuAAAAAAAAAAAAAAAAAAD9AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABFAAAAAAAAAAAAAiAAAAAAAA","reverse":false,"order":{"count":790,"head":[0,425,189,10,7,1,2,4,3,5,6,8,9,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29],"tail":[758,759,760,761,762,763,764,765,766,767,768,769,770,771,772,773,774,775,776,777,778,779,780,781,782,783,784,785,786,787,788,789],"sha256":"49e5c02e4f9292830394b2b56eff080bee4319838a2883134a397a2ae3b86556"}},{"distances":"wBwBAFwBAAAAAAgC//AAAAwBwBAAgCQD//AF","reverse":true,"order":{"count":18,"items":[3,0,2,4,5,6,9,10,12,13,16,8,11,1,14,7,15,17]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9N","reverse":true,"order":{"count":14,"items":[13,3,6,9,12,2,5,8,11,1,4,7,10,0]}},{"distances":"BSBWDMDcEzE5AAHSHsHzJrKSKmKqLNLZMhNNOUP0RsS7TUTxAAWrXcYGc1ePfAfBAAhqjckIAAknoBpkp2qGqqsMsSsovgAAyE0Q1g1i1s19294a4q406J8P9B9y+d/y","reverse":true,"order":{"count":64,"items":[6,24,31,30,29,28,27,26,25,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,5,4,3,2,1,0,32,36,47,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,46,45,44,43,42,41,40,39,38,37,35,34,33]}},{"distances":"AFTim/AAN+AA04Iab3AAAAAApw9NQw","reverse":true,"order":{"count":15,"items":[3,5,6,2,8,1,4,7,0,9,10,11,13,12,14]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMAAyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpwAAQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkNAALMepyGAAZFsiAFTim/6bN+hb04Iab3vUC3WUpwAAQwkN3qLMepyGFpZFAAAFTim/6bN+hb04Iab3vUC3WUpw9NAAkN3qLMepyGAAZFsiAFTim/6bN+hb04Iab3vUC3AAAAAAQwkN3qLMepyGFpZFsiAFTiAA6bN+hb04Ia","reverse":true,"order":{"count":146,"items":[13,3,18,26,16,29,6,19,32,9,22,12,25,2,15,28,5,31,8,21,34,11,24,1,14,27,4,17,30,7,20,33,10,23,0,36,59,49,39,52,42,55,62,65,45,66,68,58,35,71,48,61,38,51,64,41,54,67,44,57,70,47,60,37,50,63,40,53,43,56,69,46,82,91,105,95,72,85,98,75,88,101,78,104,81,94,84,97,74,87,100,90,103,106,108,107,77,80,93,83,96,73,86,99,76,89,102,79,92,112,118,121,111,124,114,126,127,128,131,140,141,144,134,137,117,130,143,120,133,110,123,136,113,139,116,129,142,119,132,109,145,122,135,125,138,115]}},{"distances":"YZyFBdAFVJy0l6aRPo+zr7Ebn1d26Mis27/QF2Wfi3Vs4f8lcCEjDnbJO7XN8tXuxBzJIeGgVDDCEfnkNqFXgi2lrUWv+xOzmTANo5F97/fnvl8xbUp13LmtXeBdlDa2mzo5uQEKTnK881fx57mQTMuTGavTUChtGODZDhsuYz2b5jyMKn+nvC4ab3YudVCdJtAACNjtZn+DLRjeFOlnR0ocAb+rKLq6gOlI2AmxSO1A5BbwAebCGBoef7r0XrW8YrrdC+HtSsVdI6qbfUE1RU+QkEzx1njWR7CBCO7VTxz4GSgNiPJdIVksGdll9FSBUYv4FW5BiU1Q4eMhO3R1hJEf2bXxjPHa+H4nInYtCDBFGbCQf0n4J6K7vGZ/q47bK2TZ60O8U+/D34Mk1loxVBLARCzws6goqxMYJqAA93hHDBBSQ17VV2FSJ3tT2e+XTCFHiFBZIGaMzM68E1qHhUxSXbeNbtMWid+lOhU5bHMlSSAdRKCxRicwTxRibiLePZWTPeYxvRnC5/VWn6T+Lh8+5ZsSXqRAOCXsq9bybljxaHlPYNngelptJ5MYWwrWdZ8ht+e+jhc54AsH8VWGNmyC33jfhFR0fybrlNrPI5tsAAe9Twe4EPlL16MmKwpD6BP2/cbY4+mXokg9PbG2CJflvMxz/Y4C/rEgrxTXejx+gqZxyJyr+rdV0ucb79zAfGH3yh54P1p/rkTRd/3geDFM1vZToHVT2nJ8H5T6K2CvPNvSz9FnRr120XObPaz117NDvTHO4wWqBB56syAAVbkzhK8ULtrMqW6fSA+mlyV9XKPsIla8tg6/nU799SYW4hNqV4EY1UHJOzlicQNofbjq6WmiWAJyDtl8/NrNVOz8SZyH6ca4pRSYpXbXty02j4vx/LarnkPA/AfTgM7zakBl0Sf08MbsgVY5rpfRE39KoXUHghU+ikULZaN5xr10IAFAuROE2FeUhZydPJmOy9fQggOSPzeSFUEhAxE/xcvSZjfC0zKdb8UUVuy74lbQDV+F9R7dLDDAF8qBRli5tsXPQ/ScMAlTZUfI2rvQXJg916BRd0K1xKjsHgj5XpMe5lyf4tBt3MiQeVV/8CdlQMFSYQ5DacqIRDti45XHcbR+PfiEnQUC3WPOlYFYtJvNzuUhYDxIL44uSJF5C7VkcI3LpidVMAIU7Y8/0bnT/skeHoMwNfAAKk43PLGlo5OBdjOSVFtDs/XHFZ8tA0BeWoa/0hl2vy13VX27XLySBPl1lMxOBQx3StnGO2m4UOuU3KyaC84WHhBX5G+xqsnfjjpWK5z9heMCpbD7Dtr5XKGZfC/qxHsrmHs16567t3GE4De+ueH0R5c9OeEvQ+7RDc0pTfqXHiBPZBvx2ZtpoZ/8Vm7+DYsKte9EAx0YSJRCnVHuV6QpMSBxBbpxLc","reverse":true,"order":{"count":713,"head":[17,197,9,46,241,176,70,55,30,23,52,14,72,22,58,16,43,33,5,1,32,54,77,75,66,10,44,57,65,50,12,39],"tail":[499,468,679,497,337,419,314,657,658,432,682,696,512,517,642,584,373,330,709,547,459,617,710,645,535,632,687,628,390,616,700,498],"sha256":"88d4b32b40ed218f1ca82bec53dae890f5645e37b9ddbdedad510725cef8b30c"}},{"distances":"QDwBgCQDQDwBgCQDQDQDQD//QDgCQDwBwBwBwBgCgCgC////QDQDgCQD//QDgCgCwBgCwB//QD//QDgCQDwBAFgCQDgCQDwB//QDQDwBwBgCQDgCgCQDQD//gCgCQDwBAFwBgCwBwBgCAFwBgCgC//gCQDwBwBQDQDAF//wBwBgCQDgCgCgC//gCwB//wB//AFQDgCgC//AFgCwBgCAFAFQDAFQDwBwBwBQD//gC//QDAFAF//gCQDgCAF//wBwBQDgCQDQD////wBwB//wBgCAFwBQD////wBgCQDAFAFwBwBQDwBQD//QDQDQDgCgCQDQDwBQDAFQDQDQDgCQDQDQDwBAFwBAFgCQDgCAFwBAFQDQDAFQD//////gC//AFQDwBgCAF//QDQDAF//QDQD//wBQDwB//wB//gC//gC////gCAFAFwBAFAF////QD//QDwB//gCgC//gCQDwBAFAFgCAFQD//QDgCAFgCAFgCgCAFgCQD//gCAFwBQDwB//gCAFgCQDQDwB////QDQD//AFgCQD//AFQDgCgCwBAF//gCAF//wB//AFgCgCAFwBgCwBQDwBQD//QDAFgCwBQDQDAF//////wB//QDAFQDwBAF//wBAFQD//gC//AFwBgCAF//QDAFwBAFgCwBAFgCgCwBQDgC//////AFgCwBQDgCAF//wBAF//QDQD//wB//gCQDAFwB////wBQDAFQDAFQDwBgCwBwBAFQDQDgCAFAFAFwBQDwBQDwBAFwB//QDQDgCQD//AFAFwB//gCwBAFwBgCQDgCQDwBwBwBwBQDQD//////AFAF//AF//wBgC////AFwBwBgCwBQDwBQDgC//gCwBgCQDQDgC//AFQDAFwBwB//wBQDAFAFAFwBAF//wBQDwBAFgC////wBQDwB//////wBQDwBAFQDAFQDwBwBwB//AF//wBwBQDAFgC//wBAFQDwBAFgC//AFAFAFAFgCQDwBQDAFQDAFwBwB//gCAF//////AFQD////wB//AF//wBwB//QDgCAFQDAFAFQD//gCAFAF//gC//wBgCAFgCQDQDwBgCAF//wBgCgCgCQDgCwBAF//AFAFQDgC//AFAFAFQDwBwBQDwB//wBQDwBAF//wBQDAFAFAFAFgC//gCQDwB//AFgCwBgCgC","reverse":true,"order":{"count":589,"head":[583,579,571,566,557,552,543,533,531,527,519,516,514,512,511,508,507,506,503,489,482,476,474,463,462,461,457,456,450,442,436,429],"tail":[242,237,235,234,220,219,217,216,199,195,191,184,181,179,175,173,164,148,147,139,124,119,118,108,106,105,101,96,81,70,64,42],"sha256":"3f098985042c7bf3eaade9a8627a0a678970f2781f0e39fc95eb529a9a867670"}},{"distances":"/4/d+M888U767T6p6g5rAA5G45404z4g4C2n2b2a2Z2E161BAA080T0KzxzTytx3xyxTxDwswowjwYwXvYu8ujuFtLs7s6smrrrfrarOq5qtqmqcqRqDqBpvpgpHAAosokoeoVnrnaAAlpllkZkCAAjfiSAAAAhwgpgZf/f2fdfMejeGdvdbdLc6cncmcdbeAAayAAavaeZsZgY0YeYUYJX8X6XxXpXNWXWLVGVDUxAATuTqSARnRfQUQHPxPuPePdPOAAPKPEOLNKM9MzMiMaAAL/LhLGJoJmAAAAGpGPGHFzFhErEeESD6DPDODNCoCeCaCQBkAxAgAAAUASAA","reverse":false,"order":{"count":170,"items":[42,41,40,39,38,37,36,35,34,33,32,31,30,29,28,27,26,25,23,22,21,20,19,18,17,16,15,14,13,12,11,9,8,7,6,5,4,3,2,1,0,10,24,85,84,83,82,81,80,79,76,75,73,72,71,70,68,67,66,65,64,63,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,62,69,74,77,78,128,127,126,125,124,123,122,121,120,119,118,116,115,114,113,112,111,110,109,108,107,106,105,104,103,102,101,100,99,97,95,94,93,92,91,90,89,88,87,86,96,98,117,129,130,168,167,165,164,163,162,161,160,159,158,157,156,155,154,153,152,151,150,149,148,147,144,143,142,141,140,138,137,136,135,134,133,132,131,139,145,146,166,169]}},{"distances":"AAAAAAAAAABZAAAAAAAAAAAAAAAAAAAAAAEhAAAAAAAAFeAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAK3AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP0AAAAAAAAAAAAAAAAAAAAAAS9AAAAAAAAAAUtAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAazAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAixAAAAAAAAk8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoPAAAAAApWAAplAAAAAAAAAAAArIAAAAAAAAAAAAAAAAtmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAzUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":false,"order":{"count":220,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219]}},{"distances":"AAQDAA//AAAAwBAAAAAAAAAAAAAAAAgCAAgCAAAAAAAAAAAAAAAAgCAAwBAAAAAAAAAAAAAA//AAQDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAAAAAAAAAAAQDAAAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQDAAAA//AAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQDAA","reverse":false,"order":{"count":141,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140]}},{"distances":"XbFrTnAAAAAAAANvs+rl/YAA9MAAPdb5AAAAMCZz81MFWKS6qaAAAAAAAAAAeMAAxnVyrHc77DyUAAPqCd4ztC/o4sAAAAAAzf2lAAzmqeKbfZBIgojCYeAAAAAAfKpTAAnJ0W","reverse":false,"order":{"count":67,"items":[1,2,0,3,4,5,6,18,21,7,23,33,22,19,30,9,8,32,10,11,12,13,14,15,16,17,24,20,25,26,27,28,29,31,55,40,53,39,58,35,62,54,56,57,65,63,52,34,42,37,48,51,49,41,36,38,44,43,45,46,47,50,59,60,61,64,66]}},{"distances":"AFTiAA6bN+hb04","reverse":false,"order":{"count":7,"items":[0,1,2,4,5,6,3]}},{"distances":"AAAAAAAAWRAAAAucAA","reverse":true,"order":{"count":9,"items":[0,1,2,3,4,5,6,7,8]}},{"distances":"/7AAAAAA8R7pAAAA4OAA2l1HAAAAAA0WzYzVy+AAAAyDwmwPwJAAAAt5AAAAsYsIsHr9AAAAAAqqpypLpEnMAAAAAAeZeGd1dfcdcDb9AAa2YFXaAAXGW/W8AAAAAAAAAAAASWAAQ1QvAAAAPrPFAAAANcMsAALBKrKdJbJDI0IMAAAAGxGNFFAADRCfAAAA","reverse":true,"order":{"count":96,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95]}},{"distances":"AAAAAAAAfQAAAAAAEjAAAAtmAAAAAAAAAAAAAAAAAAAAAAAAHnAAAAAAAAAAAAAAAAAAxgAAAA7tAAAAAAAAAAAAnrAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHXAAAAAAAAAAAAAAZTAAkLAAAAAAa5AAAAAAAA1WAAAAAAAAAAAAHmAA0XAAlNAAAAqSAAAAAAAAAAAAAAAAAAAAAAAAbuAAAAAAAAu4AAAAVSAAWiAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAATrAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOfAAAAAAAAAAAAu8A0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAASlAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKLAAevHBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAm6AAAArtAAAAAAP3AATOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAq8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAbPAAAAUMAAAAAAAAAAXNAAYeAAAAAAKtAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA7JAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAhMAAA3AAAAAAAAAAAAAAAAAAAAYvAAAAAAAAAAAA0uAAAAAAAAAAAAAAAAAAAAAAAAAAAAPyAAAAAAAAAAAAAAAAOVAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOsAAAAAApYAAAACxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAcjAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA9fc0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAla9CAAo2AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA9GAAAAuYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAApAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA/IAAAAAAAAAAAA/iwsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA7qUgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAcZAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAy8s1AAAAAAAAAA2ZAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA5/AAAAAAAAcUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIEAAAAAAAAAAAAH9AAAAAAAAAA1DAAAAAAAAAAAAAAAAAAAA8xAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA2BAAAAAAAA","reverse":false,"order":{"count":784,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[575,753,754,755,756,757,758,759,760,761,762,763,764,765,766,767,768,769,770,771,772,773,774,775,776,777,778,779,780,781,782,783],"sha256":"e22167c1bc5cdbe76efdd36c5379cdb174ce35cb403dc306f8b81e414f2ad5e7"}},{"distances":"AeBIBoByByC2DDEkEtGiGkH8IILGL/MCMdMhPMRcRlR2SpTaTiVUVXVeWnXRX7YbaPbkckdFeBeSeVe9fnfxgTg/hUirjEjsl4nQoaokpFpTqUqZrYrrs0s5uMuhvTwRwzyyyzz3z90B0G1I2P2T3I3x4Y5u6z7z8E9P9j92+C+K","reverse":true,"order":{"count":86,"items":[85,84,83,82,81,80,79,78,77,76,75,74,73,72,71,70,69,68,67,66,65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0]}},{"distances":"QDwBQDAF//AF//wBAFQD//AFgCgC//gCAFQDAFwBwBgC//gCgCgCgCQDQDAF//AFwBwB//AFQDwBgCgCQDwBQD//AFQD////wBgCwBgCwBQDAFwB//wBQDQD//gCgC//wBgCwBAFwB//wBQDgCwB//wBQDQDQDQDgCQDQDgC//wBgCAFQDAFwBAFQDwBwBQD//QDAFAFwBwBQDgCAF//////wBAFgCwBQDgCQDgCQDgCQDAFAF//QD//QDAFgCAFQDgCQDwBAFAFgC//AF//gCwBwBwB//QD//QDgCgCwBAFAFAFwBAFQDgCgC//////AFgCQDgCwBAFQDAFwBgCgCQDQDgCQDQDAF//gCAF//AFwBAFgCwB//AFgCQDQDgC//AFwB//QDAFAFQDAFAFQDgCQDQD//QDAFwBAFwBwBgCgCwBwBQD//gCwBAFwBAF","reverse":false,"order":{"count":224,"items":[3,5,8,11,16,18,29,31,35,44,54,67,87,89,91,98,99,104,109,119,120,125,127,132,133,136,149,150,151,153,160,165,167,176,179,181,183,187,193,197,198,200,201,208,210,221,223,0,2,9,17,27,28,36,40,42,45,53,58,59,71,76,77,78,79,81,82,88,92,95,97,102,112,114,116,118,122,124,128,130,143,145,154,162,166,171,172,174,175,189,190,196,199,202,204,205,207,217,12,13,15,21,23,24,25,26,38,39,49,51,61,62,65,72,80,83,86,103,110,113,115,117,126,129,134,138,146,147,155,156,161,163,169,170,173,178,184,188,191,203,213,214,219,1,7,19,20,32,33,37,41,48,50,52,55,57,64,66,68,70,73,75,85,90,93,94,100,101,108,111,131,139,140,141,148,152,164,168,182,185,194,209,211,212,215,216,220,222,4,6,10,14,22,30,34,43,46,47,56,60,63,69,74,84,96,105,106,107,121,123,135,137,142,144,157,158,159,177,180,186,192,195,206,218]}},{"distances":"AAAAnKxAgMDbAAAAAAAAAAAAAAAAkQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA1+AAAAAAAAAAAAAAAAAAAAAAsNAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoXAAAAAAAAAAAAAAAAAAAAAAAAEWAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAlBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA01AAAAAAAAAAcNAAAAAAAAAA3aAAJ8AAAAAAAAAAAAAAAAAAAAAAQ5AAAA41AAAAAAn/AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAORAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA7MAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAw3AAAAAAAA5cAAAAAAAAAAAAAAAADNAAAAAAAAAAAAAAAAs0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA5zAAAAAAAAAAAAAAAAAAAADLAAAAAAAAAAAAAAAAAAAAAAAAAAIhAAAAAAAA1kAAAAAAAAObAAAAAAAAAAAAAAAAAAAAAA+uAAAAAAAAAAAAAAAAAAAAAAAAa+AAAA5+AAAAAAAAAAAAAAWAAAAA97AAAAAAAAAAAAAAAAAAOXAAAAAAAAAAAAAAAAAAAAAAAAAAAAAASzAAAALyAAgyAAAAAAAAAAAAAAAAAAAAAAAAAAAAy9AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAdoAAAA+OAAAAAAAAAAG9AAAAAAAAAA4PAAAApcAAAA7M7PAAAAAAAAAAAAAAAAAAWWAAAAAAAACXAAAAAAAAAAAAAAAAAAAAB5AAAAAAAAAAAAAAAAdSAAAAAAAAKuAARYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAobz/AAmPAAAAAAAAAAAAAAAAbkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAxAAAAAAAAAAAAAAAAAAAAAAAAvFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":false,"order":{"count":618,"head":[0,1,5,4,2,3,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[586,587,588,589,590,591,592,593,594,595,596,597,598,599,600,601,602,603,604,605,606,607,608,609,610,611,612,613,614,615,616,617],"sha256":"0b31a7afdc4a273443f4a3ea5b516441852a28e7a076f30ea2a8881e28373ef4"}},{"distances":"/7/5AA/yAA/w/t/p/X/G/B+++7+w+v+r+p+m+R+Q+N+J+E95939l9j9g9V9S9H87868y8q8p8m8g8b8Q8E7775727p7o7k7b7X7X7X7V6+6s6j6V6U6O6I6G5/585x5u5t5m5h5J5J5D5C414j4h4e4Z4N4H4H4E4C4B303x3w3q3p3j3Y3T3F3F3D3B3A282x2c2Q2P2M2I2F1+14AA1u1r1m1k1f1R1N1M1I1C0+0+0t0t0s0W0R0F0Az4zyzuzfzczczZzMzKzIzEzDzAy7y0ypylykyjybyGx3x1xsxjxhxgxcxcxVxTxTxQxMw/w7w0wxwmwbwawXwSwOwKwJwBv7vsvnvmvgvavXvXvUvPvKvHvFvCvBu3u1utususukuhuZuZuTuTuIuFt5t2t1t0thtatStRtOtBs8swsusescsQsGsGsEsArxrwrmrjrUrNrDrBq+q8q1q1qvquqpqoqWqUqMqHp8p6p3pvpepepdpbpXpWpTpMpCouooomoboaoZoXoUoMoIn7n5nxnsnpnnnmnknbnTnRnOnHAAmxmtmtmrmqmlmdmbmZmXmUmAl6lulklilWlVlUlQlPlMlJk/k+k+k6kykxkskrkpkpkhkekckWkHkGkFkCj9jzjxjYjYjTjTjLjEjDjBi5i4iuihiLiGh3h0hzhuhMhEgpgkgbgOgNgIgHf/f8f0fyfufkfifbfZfYfCfBfBeyeeeeebeSeSeQdudtdldjdgdedQdMdKAAc/cbcYcTcLcIcFcBbubpbnbjbabYbWbRbMbLbJa8a0aralajajaSaKaCaAZ5ZwZwZtZqZpZoZlZeZcZbZXZWZTZSZPZJZFY9Y6YxYtYqYpYmYhYWYVYUYBX7X4XyXuXpXHXEXBW7WsWkWhWgWdWXWRWLWHWFV5V2VsVqVSVIU8U6U4UxUpUmUWUQUPUOUMUIT/T4T2TxToTdTYTXTRTOTOTES9S8S6S6S5SqSoSmShSISHSGSESAR+R9R9R7R4RrRlRkRgRaRVRURSRMREQ/Q9Q6Q4Q4QzQrQqQpQgQeQcQUQTQQQNQIP+P8P4P1P0PuPuPfPdPbO7O5OvOkOhOhOYOTOROROQONOBOAN4N1N0NxNtNqNhNgNdNbNUNDNBM1MuMpMoMjMfMdMVMJMBMAL4L2LkLiLgKwKsKoKnKiKbKSKSKRKIKGKBJwJtJpJkJiJTJTJKJJI8I7I2IoIjIgIgIgIeIXIVIJIFIDH1H1HgHLHEHAG7GzGyGwGuGmGSGSGEGDF+F0FwFnFhFdFVFNFAFAE/E8EyExEvEuErElEgEVEMEMEKD6D4DyDwDtDrDlDlDjDgDfDeDcDSDQDHDFDBC4C0CyCwCvCuCuCrClCkCiCeCaCaCXCRCOCNCNCLCFB+B9B1BrBqBlBfBaBEA/A8A7AzAwAuAsAgAfAbAXAXAVAAAPAOAMAJAG","reverse":true,"order":{"count":726,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[695,694,696,697,698,699,700,701,702,703,704,705,706,707,708,709,710,711,712,713,714,715,716,718,717,719,720,721,722,723,724,725],"sha256":"9149ee0f7e49a81be4a128e41404b7b8424d38540131e28324cbdbc4264cff6f"}},{"distances":"AiArA3A6BCBPBWBiBuBwB7CQCzDADEDGDWEDEFEbEiEiE3FKFSFUFvGGGIGUAAHDAAHXHfHwH2AAIVAAAAJJJpJqJvJxKIKWKgLVLYLZAALxL3MJMMMeMiNQNdAANvNxN5OBOZAAOrOyO9O+O+PMAAPoQOAAQzAAQ4Q7Q/RFRLRMRXRYRgR2R4AASkS4S+AATGTQTWTYTdTpT6T8UFUGUOUOUSAAUcVbV2V/WGWGWIWiWjWwAAYCYRYZYkYrAAY9ZRaqa8bMbQAAb1cXAAcgckclcuczc+dKdNdTAAdsdtdud4eNAAeeegemeve2fIAAgKgSghg+hMhqAAhwh7imi1i+jBjRjbjijwj1kPkkAAlMlSlilslwl4mBmCAAmsm5nFnMnbnoAAoAoqo9o/pWplAAp5AAqEqGqZqnqqrFrMrQrgrmr4AAsss2tEtGtkt0AAuDuRuqutuxu5vOAAvfvkvtv5wAwFwUAAwfwkwqwsw0xDxGxJxSxWxbxsx0AAyQyiynytywy+zIzSzdzqAAz40EAAAA0o01031T132D2M2X2c2g2p22263C3L3X3Y3aAA334D4E4T4v435DAA5T5g5h5m5q546C6kAA7O7WAA7+7+7+8F8o8r8xAA869R9d9u9y9399+J+q+5AA/b/d/j","reverse":true,"order":{"count":331,"items":[30,32,36,35,34,33,31,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0,37,39,40,52,61,67,74,76,75,73,72,71,70,69,68,66,65,64,63,62,60,59,58,57,56,55,54,53,51,50,49,48,47,46,45,44,43,42,41,38,77,78,79,91,95,109,119,118,117,116,115,114,113,112,111,110,108,107,106,105,104,103,102,101,100,99,98,97,96,94,93,92,90,89,88,87,86,85,84,83,82,81,80,120,126,133,136,146,152,159,162,161,160,158,157,156,155,154,153,151,150,149,148,147,145,144,143,142,141,140,139,138,137,135,134,132,131,130,129,128,127,125,124,123,122,121,166,180,189,196,202,201,200,199,198,197,195,194,193,192,191,190,188,187,186,185,184,183,182,181,179,178,177,176,175,174,173,172,171,170,169,168,167,165,164,163,203,204,205,217,224,232,240,246,245,244,243,242,241,239,238,237,236,235,234,233,231,230,229,228,227,226,225,223,222,221,220,219,218,216,215,214,213,212,211,210,209,208,207,206,254,265,268,269,287,286,285,284,283,282,281,280,279,278,277,276,275,274,273,272,271,270,267,266,264,263,262,261,260,259,258,257,256,255,253,252,251,250,249,248,247,288,296,305,308,316,327,330,329,328,326,325,324,323,322,321,320,319,318,317,315,314,313,312,311,310,309,307,306,304,303,302,301,300,299,298,297,295,294,293,292,291,290,289]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA9bAAAAAAAAAAAA82AAAAAA7QAAAAAAAAAAAAAAAAAAAAAAAAAA5IAAAAAAAAAAAAAAAAAA3XAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAyRAAAAAAAAAAAAAAAAAAvIAAAAAAAAAAAAAAAAAAtNAAtHAAAAsjAAAAAArGAAAAq1AAAAAAAAAAAAAAAAAAAApdAAAAAAAAAAAAAAAAoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAl3AAAAAAAAAAAAkYAAAAAAAAAAAAAAAAAAAAAAAAAAAAgwAAgNAAAAAAfFAAAAAAAAAAAAAAAAAAAAAAAAAAAAb7bhbgAAAAAAAAAAAAAAAAY8AAAAAAAAAAAAAAAAAAXpAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAATRAAAAAASEAAAAAAAAAAAAAAAAAAQaAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALWLUAAAAAAKnAAAAAAAAAAAAAAAAAAAAIoAAAAAAIBAAAAAAAAAAAAAAAAAAAAAAGDAAAAAAAAFNAAAAAAEcAAAAAAAAAAAAAADjAAAAAAAAAAAAAABJAAAAAAAA","reverse":true,"order":{"count":330,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273,274,275,276,277,278,279,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,298,299,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329]}},{"distances":"AWCGCoD5AAGEGUAAGtHlHlH0AAJcKNK3LpMEMhM2NENNOXOgOlPaP5QLQoTuUSUmU3VHVNXtAAY4ZBZKAAaiaxbhcRd/eEfMfqAAicimAAAAkJlSmgmunEAApEqtrGrttDtDAAtRtqunvFwhxJxdxhyyzMzoz2z80O1j2X3S3a3h5m5u6D7d8g8z8388AA","reverse":false,"order":{"count":95,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94]}},{"distances":"AyA7C7DnEcGrHPHYHiIXLYMAMjNKNKNNOPOyPjQXQdSJSqTzUbUcU8V5WFWWWfXEX3YGbEbQeSehfggliHjDjKAAl9mSneAAr4sRtau6xTxWy5zAzW0X0c0z2K2d2h3y6Z6y7P7Y9y/k","reverse":true,"order":{"count":70,"items":[34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0,43,47,69,68,67,66,65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,46,45,44,42,41,40,39,38,37,36,35]}},{"distances":"AFTim/AAN+AAAAIaAAvUAAAApw9NAAkNAAAAAAAAAAZFsiAATim/6bAAAAAAIaAAvUC3AApw9NQwAA3qAAAAyGAAZFAAAATim/6bAAhbAAAAb3vUAAWUpwAAAAAA3qLMepAAFpZFAAAFTim/AAAAhb04Iab3vUAAWUpw9NQwkNAAAAAAyGFpZFAAAFTim/6bN+AA04Iab3AAC3WUAAAAAAAAAALMAAAAFpZFsiAFTim/AAN+AA04Iab3vUC3WUpwAAQwkN3qLMAAAAFpZFsiAATim/6bN+hb04Iab3vUC3WUpwAAQwAA3qAAepAAAAAAsiAFTim/6bAAhb04IaAAAAC3AApwAAQwkNAALMepAAFpZFsiAFAAm/AAN+AA04Iab3vUAAAAAAAAQwkNAALMAAyGAAZFAAAFTim/AAN+hbAAIaAAvUC3WUAAAAQwkNAALMAAyGFpZFsiAATiAAAAN+hb04AAAAvUAAAApwAAQwAAAALMepAAFpZFsiAFAAm/6bN+hb04AAAAvUAAWUpw9NAAkNAALMAAyGFpZFsiAFTim/6bN+AAAAAAAAvUAAAApwAAQwAA3qAAepyGFpZFsiAATim/6bN+AAAAIab3vUAAAApwAAQw","reverse":true,"order":{"count":314,"items":[3,5,6,8,10,11,13,9,12,0,14,16,17,18,19,20,22,23,26,25,2,15,21,24,1,4,7,27,28,29,30,31,32,33,34,36,38,39,40,41,43,45,46,49,42,35,50,51,37,52,53,55,54,56,59,60,61,62,58,48,64,44,65,67,68,71,57,70,47,63,66,69,72,73,79,82,81,85,86,87,88,91,95,75,78,94,97,98,84,74,100,77,90,80,93,83,96,101,103,99,76,89,102,92,104,105,106,107,108,109,110,111,113,112,118,120,128,131,121,133,134,138,141,144,147,124,137,114,150,127,140,117,130,143,146,123,136,149,126,139,116,129,142,119,132,145,122,135,148,151,152,125,115,153,155,157,158,159,164,154,160,165,167,169,170,172,173,174,177,180,185,187,189,190,193,183,186,163,176,166,179,156,192,182,162,175,188,178,191,168,181,171,184,161,194,195,196,197,200,202,203,204,206,209,210,212,213,215,216,219,220,223,225,226,229,222,199,228,205,218,208,221,198,211,224,214,227,230,231,201,217,207,232,233,237,238,240,241,243,245,246,249,254,256,259,239,252,255,260,261,262,263,266,279,236,275,265,242,258,251,264,257,250,267,268,235,248,244,234,253,269,270,271,272,247,273,281,282,283,284,285,286,287,289,291,292,293,299,302,295,298,288,301,278,294,274,290,303,304,305,308,307,297,300,277,280,306,296,276,309,310,311,312,313]}},{"distances":"FqziGjHCfAkDivAAAA","reverse":false,"order":{"count":9,"items":[0,2,3,4,6,5,1,7,8]}},{"distances":"/B+s+s+C+A988+8v8A7h676l6d6K57434n4T4R2m2M2H1z1v1p0Y0XzmzmzTyux8xXxAwrwqwWwNv+vyvlu+t7tqtdtcsasUrIpgpJooonn1mZl+l8lpkjj8j6jhjAAAh4hrhbhGgvgYgYgVgFfwfoemducpcgcYbNa8avagZ4ZzZyZeZcYnYYXvXnXgXKWxWcVvVrUZT6ToTkTMSuSfSaSQR6RmQ6QsQqQcP7P1PVOTONN9NVNSM+M3MsMZMJL8LMLLKzKoKjKMJsJUJII6IhIUIKIIHsHKHJGwGRGQFhFaFUFRFLEyEsEjEfEcDsCvCIB7BfBNBGBEBBA/","reverse":true,"order":{"count":168,"items":[0,2,1,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,28,27,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,70,69,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167]}},{"distances":"AAAAAAAAAAhbAAAAb3AAAAAAAAAAAAAA3qAAAAAAAAAAAAAATiAAAAAAAAAAAAAAAAC3AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC3AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAyGAAAAAAAAAAAAAAN+AAAAAAb3AAC3AAAAAAAAkNAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA3qAAAAAAAAAAAAAAAAAAAAAAAAAAIaAAAAAAAAAAAAAAAAAAAAAAyGAAAAAAAAAAm/AAAAAAAAAAAAAAAAAAAA9NQwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAWUAAAAAAAA3qAAAAyGAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA3qAAAAyGAAAAAAAAAAAAAAAAAAAAAAb3AAC3AAAAAAAAAAAAAAAAAAAAZFAAAAAAm/AAAAhbAAAAAAvUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA04AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA3qAAAAAAAAAAAAAAAAAAAAAAAAAAAAb3AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAkNAAAAAAAAAAAAAAAAAAAA6bAAAAAAAAAAAAAAWUAAAAAAAAAAAAAAAAAAAAAAAATiAAAAAAAAAAAAAAAAAAAApwAAAAAAAAAAAAAAAAAAsiAAAAAAAAN+hbAAAAAAAAAAAAAA9NQwAAAAAAAAAAAAZFAAAAAAm/AAAAAAAAAAAAAAAAAApwAAAAAAAALMAAAAAAAAAAAAAAm/AAAAAAAAAAAAvUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAyGAAAAAAAAAAAAAAAAhbAAAAAAAAAA","reverse":true,"order":{"count":517,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[485,486,487,488,489,490,491,492,493,494,495,496,497,498,499,500,501,502,503,504,505,506,507,508,509,510,511,512,513,514,515,516],"sha256":"8fca7e44ca5d3b8e6ebd8a80d4fd0459b942587756d3a9d757656ac6a43a1daf"}},{"distances":"VriW2YsJiRjqhGU5RYEjVTSR8Ni94yYYuIxD5N9E6GLA/sB9H+gndiMcLWMGfiwAR4I6O8Y0GHzlP8+AwETCWLwgunZBf0/K1uK1C8gPsNfywuBt8r3yffo1v8h0LXwMmIGmNHCBKnSWVD/lOEu6jXnRvOvCwemOZEcqJnR6MdLn9p6Z7IU+bRBP8Gyfz1TJqrdR9MWwBKV4zZ+E50K0OHd8ZHNZNBGSTeYH9VkTG/Lsd751U+xfntWfJs305MGf7txaD+MkXO/ZFW08Js5GvfwRd3A0x/+vnE0f","reverse":false,"order":{"count":146,"items":[141,100,91,55,23,67,50,130,9,134,36,111,127,65,116,24,33,82,124,136,68,105,49,21,28,62,85,117,29,27,84,131,110,66,109,72,106,34,38,8,32,83,11,69,41,95,112,7,89,120,70,10,0,101,42,123,99,132,113,15,35,45,80,108,90,81,97,26,140,118,107,58,30,53,46,51,25,6,61,4,1,13,74,5,115,64,79,144,75,122,59,96,3,52,16,44,73,77,76,138,60,31,40,63,139,78,43,54,17,129,121,142,93,102,37,94,145,135,48,2,57,125,14,137,126,18,104,119,20,87,88,128,92,12,56,19,98,114,86,39,103,143,47,133,71,22]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AAAAAAwBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAAAAAAAAAAAAAAAAAwBAAAAAAAFAAAA//AAAA//AAAAAAAAAAAAAAgCAAAAAAAAQDAAAAAAAAQDAAAAAAAAAAAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AAAAAFwBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQDAAAAAAwBAAwBAAAAgCAAAAAAAAAAAFAAAAAAwBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAAAAAAAAAAAAAAAFgCAAAAwBAAAAAFAAAAAAAAAA//AFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQDAAAAAAAAwBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAA//wBAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AAAAAAAAAAAAAAwBAA//AAAAAAAAAAAAAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwBAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAAAAAAAAAAwBAAQDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwBAAAAAAAAAAAAAAAAwBgCAAAAAAAAAAAAAAAAAAAAAAAAwBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAAAAAAAAAAAwBAAgCAAAAAAAAAAAAAAgCgCAAAAAAAAAAwBAAAAAAwBAAAAAAAAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAwBAAgCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAAAAAAAAAAAAAAAAAAAQDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AAAA//gCAAAAAAAAAAAF//AAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQDAAAAAAAAwBAAAAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":743,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[711,712,713,714,715,716,717,718,719,720,721,722,723,724,725,726,727,728,729,730,731,732,733,734,735,736,737,738,739,740,741,742],"sha256":"bd2e78b00b9d32fd10019d47c36512d76fbeb927c406ab6187ba8ad5c080ceb4"}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLM","reverse":false,"order":{"count":409,"head":[0,23,46,69,92,115,138,161,184,207,230,253,276,299,322,345,368,391,10,33,56,79,102,125,148,171,194,217,240,263,286,309],"tail":[95,118,141,164,187,210,233,256,279,302,325,348,371,394,13,36,59,82,105,128,151,174,197,220,243,266,289,312,335,358,381,404],"sha256":"f9b5bec23f653c0791c98d3c4fa7832508918c03c3847ef3a35570b93ecbbe48"}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAATqAAAAAAAAAAAAAAAAAAAAAAAAAAG/AAAAAAAA","reverse":true,"order":{"count":56,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55]}},{"distances":"AA3YeM","reverse":false,"order":{"count":3,"items":[0,2,1]}},{"distances":"AF","reverse":true,"order":{"count":1,"items":[0]}},{"distances":"QDAA","reverse":true,"order":{"count":2,"items":[0,1]}},{"distances":"1m0zwrwNcyAAAADyAA","reverse":true,"order":{"count":9,"items":[0,1,2,3,4,5,6,7,8]}},{"distances":"/Y/H9V848a6A5p352t2i2O090x0s0T0T0NzPy7yYyXyLxpxfxUxKttsksdr4rUq4qqqoqPpfolnrnpnhncm+m4mllqlelCkbkVkAi9i5ioiIiAhdgagUfnfYfXfQe/ewejeNeEeAd/dYcscUcLbaZTYYYOXdXPWfWbWFVsVMVCVBTUSpSZRdQYP3PpPNOyOWNtNsMELjK/KwJKI6H3HrHYF1FVDUCxCQCLCJB+B1A8Aa","reverse":true,"order":{"count":118,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,15,14,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117]}},{"distances":"UY","reverse":false,"order":{"count":1,"items":[0]}},{"distances":"8o1FwWoen4l3icf7fSZaYpSiLTK1Be","reverse":false,"order":{"count":15,"items":[14,13,12,11,10,9,8,7,6,5,4,3,2,1,0]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb","reverse":false,"order":{"count":144,"items":[0,23,46,69,92,115,138,10,33,56,79,102,125,20,43,66,89,112,135,7,30,53,76,99,122,17,40,63,86,109,132,4,27,50,73,96,119,142,14,37,60,83,106,129,1,24,47,70,93,116,139,11,34,57,80,103,126,21,44,67,90,113,136,8,31,54,77,100,123,18,41,64,87,110,133,5,28,51,74,97,120,143,15,38,61,84,107,130,2,25,48,71,94,117,140,12,35,58,81,104,127,22,45,68,91,114,137,9,32,55,78,101,124,19,42,65,88,111,134,6,29,52,75,98,121,16,39,62,85,108,131,3,26,49,72,95,118,141,13,36,59,82,105,128]}},{"distances":"AAAAm/6bAAhb04Iab3vUAAWUpw9NAAkN3qLMAAyGAAZFAAAF","reverse":true,"order":{"count":24,"items":[0,1,3,4,10,13,14,16,6,17,18,19,9,12,2,15,5,8,11,20,21,7,22,23]}},{"distances":"AIAIBFBWBkB8B8B/CJCPCiCtC0C1DBDXDfDlDmDsDxD+EFEMEREZEjEvE1FFFTFaFeGIGKGMGcGsGwG1G/HFHaHcHdHdHgHnHoHpHsHwHzH4H8IIIOIWIZIqIwI/JJJNJXJmJoJ8KHKNKPKRKUKWKdKhKiKlK2K5LBLDLGLNLXLZLaMBMMMjM8M8NLNrOEOHOTOZOnOtO0O3PGPXPjPtP+QAQlQpQ2Q6RARbRmRnRvRyR5R6SCSESGSJSSSXSYSnSsTQTgTqTqTqTzUCURUaUlU8VAVWVsWFWHWSWlWoWpW6XEXKXLXRXfXoXpXqX2X+YDYLYTYbYjYlY5ZEZKZMZPZjZ1Z2Z3Z8aDaqawa0a+bAbEbLbNbSbTbZblbvb6b6cQcUclcqcucucydcdgdsd7eBeFeKeaekeleqfLfRgAgEgJgLgMgYgYgogqg2hDhFhjhuiBiIiRiZitjYjbjbjcjrj0j2kCkDkQknkvlAlClglqlql7mEmPmam2m9nCnEnFnInXnknknrn1oGoYpPpepkpupupxp8qLqhqsrFrTrirxr2sSsbsxs2s5s/tetit7t9t+uVudufuvuwvJvJvMvMvTvbvjvmv1v3v3v6wAwHwOwUwkwqwyw2xNxUxmxux0x4x6x/yWyfyhypyry5zBzDzJzXzozrzszvzxzy0B0V0Y0d0j0l0q0s0s1H1s1+2L2X2h2i2i2v2124292+2/3M3M3Z3f313238384P4d4s4u475B5C5N5R5g5k5l5m5v6F6J6K6N6i6n6q6x687E7L7P7x778C8I8L8N8R8T8086888+9A9B9C9N9Q9p9x+V+W+e+o+z+9/N/Z/j/p/z/5","reverse":true,"order":{"count":428,"head":[427,426,425,424,423,422,421,420,419,418,417,416,415,414,413,412,411,410,409,408,407,406,405,404,403,402,401,400,399,398,397,396],"tail":[31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0],"sha256":"50226d04a35d9f3d9b599a69bbf93dac47bc602f313a47b840cf4fdff0814900"}},{"distances":"1PlnNc+oBoJ70d2BAAHoRk9AaoseR8Z3IZSr/63rtWheKKbbZIbL6KfGAAMO1lWYAAO3wU","reverse":true,"order":{"count":35,"items":[8,18,3,11,26,19,7,0,6,28,30,32,34,20,13,1,21,27,23,25,12,15,24,31,17,14,10,33,2,29,22,5,16,9,4]}},{"distances":"9H5gdJSySPH/Fe","reverse":true,"order":{"count":7,"items":[0,1,2,3,4,5,6]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WU","reverse":true,"order":{"count":12,"items":[3,6,9,2,5,8,11,1,4,7,10,0]}},{"distances":"AAAaAAAAAvA4AABEBIAABKAABUAAAABdBjB1B3B5B6B/CBAAAAAACWCdCxC2AADGAADfDkDpAAAAEHAAAAAAE3AAE/E/AAFCFGFKFKAAFgFkFoAAFsAAFuAAAAAAF5F7F/AAGcGlAAGxG5G7G9AAHDHFAAHGAAAAAAHPHWHaHeAAAAAAAAIoAAAAJCAAJGAAJdJqJrAAJ2AAJ/KAKBAAAAAAAAAAAAKmKoAAAAKzKzK3K7AALCLGAAAAAALaAALgLhAAAAL6MGMKMOAAAAAAAAAAAAAANiNqAANrNuNwNzN/AAAAOEOGOMOUAAAAAAOpAAOsAAPTPUAAPcPePhAAAAP9AAP+QOQVQfAAQmQpAAAAAARARHRQRaAARkRwRxAAR/AASLSOSVAASpSpAATOTbTbAAAAAAAAToTpAAAAAATxT4T+T/UAUKUPUVAAAAAAU4U5U5U6AAVBVUVWVXAAVaViVoVqAAVyVyVzWBWDWSAAAAAAAAAAWzW2W3XFXPXUXVAAX3X4AAAAYPAAAAYbYeYiYvAAAAZAZBZGZJZPZWAAZpAAZ3Z+aAaAAAaMaPAAananAAAAa/bAbDAAAAbPbTbcAAAAAAbnbybzb1b6AAAAcGcIcJcXcbcccfAAAAc5AAdQdYAAd4d5d9d+d/AAAAAAe6fDfGAAfMAAAAAAAAAAAAAAf6AAgAgLAAAAgZgcAAgvg1hIhMhchuAAh2h9iEiIiJAAAAiPiWAAAAilAAirAAi6jHjLjOAAAAjWjgkCkFAAktk7AAl3l3l5l6AAAAmNAAmPmRmTAAAAmpAAAAm0AAm7AAnGnKnMnSnancAAAAntnwn+oAoNoToVoZopAAozAAAAAAAAo7o+o+AApDAAAApOAAprp3AAAAqVAAqYqfqkAAqwAAAAAArVrZrqAAAAAAAAr3AAAAAAsLsLsMAAsNAAsSAAAAAAAAstAAs8s9tBtUAAAAAAAAAAt5t8AAAAuPAAuUubAAufAAuvuyuzu5AAAAu8u/vCAAvJvJvUvXAAvZAAvhAAAAAAvwvwAAv0v2AAwBAAAAwKAAwiwlwpAAAAxCAAxIAAxgAAAAAAxsx1x2AAyGyVAAAAAAyhykykywAAAAy8AAy9zDzDzGzOzQAAzhzjznzp0F0F0dAA0h0nAAAAAA0w04AA081B1E1EAAAAAA1S1ZAA1h2A2A2C2F2KAAAA2PAAAA2i2k2t2124292/3KAA3NAAAAAA3t3u3v3v3536AAAAAA4pAA4y444/5A5BAAAAAAAA5c5pAA5yAAAA6W6iAA6m6x6yAA62AA7N7WAA7b7j7p7q7qAA7677AAAA8C8IAAAAAAAAAAAA808+AA9n9r9sAA9+AA+IAAAAAAAAAAAA/yAAAA","reverse":false,"order":{"count":693,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[661,662,663,664,665,666,667,668,669,670,671,672,673,674,675,676,677,678,679,680,681,682,683,684,685,686,687,688,689,690,691,692],"sha256":"7a47d01645c821f07456cda246e869a610fc53a877f4e3be53aea51df21cf8fe"}},{"distances":"EJAAAAAAOXAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":13,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12]}},{"distances":"AAEcAAAAAAAAIRAAAAAAAAAAAAAAAAAAPOAAAAAAAAAAAAUVAAAAAAAAAAYIAAAAcZAAAAdlAAAAAAAAAAAAAAAAAAAAAAqBAAAAAAAAAAAAAAyCAAAAAAAAAAAAAA2VAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":72,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71]}},{"distances":"vDujoCedRIzP/0JnHBcUmmAL4EsV0/vYVb1QIcy6VOzjpQddCzbeHm/VJcgJ6z+kDZTFjJxz8ug4VQUN+rTJXGdrzPFciV4FxIt4kKr26hGc/CxGa6KBemi57zgxOKIx1nbObDnR+EGWN5VtFfbDoVsE00OW+CWDJC94i968t74Vvpf0pJJAuUHiblmH7inY6GFTZU3KCHwjYLRLPmzwJzb0P9ZRXr6kq2NKzYGYNImLwVCupZ4JJgsWfrPf/tUvtZiUJTSa5FUVXZ1aW3vDn9ZCERvU584U90X7hAFM1s1Lzle+yllEwsEScl001gqnVtC4ubxolRc37qDcuxSf+LdxG8qQlImouPxzLCRYytlG8ZI9goL5hFrCtuhHQbH+2KjE5wT3S9Ej2oH7GjwTjO9eVJGemxBNPr8bSGBOjVfMY9wh+n+9uJtO2Fq2PzE0DIc+EpWuLaDUXsQpbVjl9VG2TrsGV2O+MVtnOPcw82UFIwIxOqZLpjgZIfbQLFApPdojUWBQpk4h4Cft3/PLeBA7E5vMIcRvNGg1vo1Ziq1kQQ+7KgUcT+aeijq2B7OfzKhwxGaG16NWW4DYcMs/NHe/BjE6IWiUeQhxlsE4S3iB/LQ4jqaXB1th+khFgLb3uc8nMnJoyMlYtlSU+tDG9l+Qhb+GSj/oKh+XCn0NS6BSZ+ywXlBYIIIA7ZGEWHjkWtoofohV5Syjimtdh0pJZGw4a9y4u8N5Qx5zKQNeEsw2MXHwRKBBGJ90CUGs2wSA9EmY6SPbsDheCyZ75p9WAvbPhbtqxxdg3pMMfKfsnCJ63GMorHxOQvLJLmX9C1Sw/18P/Vpcc3fDgI2PAMYW/qolIrafEx+55N61mM02uyHfPTIarA+xEj9oSlW3Mk/EmNvkS8gXC7W5aMaf+H1jXBvonQMe7HEuyDRc2GvsECN/mjjpcMvVqQ4lnEg6gkEn1EaiA0mMMDtTNImPT8dWaLg9oNdrLi9VE4pop3Vx0mKYtkvbYYrdG9UrQtgJLO7lv10jRroaOMk4+D0motmmXo79v9JdqwXrOGn0Xp8C+tnrGP76sAijMz5OFu75ZnDj4y4KFnVzP7DilK4PXbhEJQ3iCRVLRvF35fSNnqOly2Si7RpQfYTabLftnH4HNMGXae8aIE/1cnx9ESHAJVcyt9YDumnM1BrzmwmzhQx12km1A9rxzoeUmv79V50r48Xe+3NkH/bwcKlSBQqLwbrxaABkplvIvVJ48bJ9zWYT2XIAnQiK8cpQOR7Li3Ws2FS7zgc6H9IiMpIasnvQapdrwZZhlxkwPAT69amd67Y5iBcMGNCSMLZzNG/tcVETzz31J0bZg3Kc9M1tI5E9sjZyfra1IUMrpC57JEwDyD/dVJ/Es4ECJWw4pK2Fb5KDSQJV74jDn+","reverse":false,"order":{"count":707,"head":[11,424,255,394,482,267,598,377,207,211,259,614,341,345,300,619,314,286,100,556,663,380,338,119,390,24,414,161,452,329,224,229],"tail":[518,68,333,456,170,331,337,31,316,216,40,328,532,441,608,431,279,217,54,447,693,310,27,418,691,335,426,126,667,6,416,579],"sha256":"81c287bff1b164395b45a6db7bd0938cff69e8bdcce970d409d4622cde2c8d8e"}},{"distances":"AAAAgCAAQDAFAAAAAAAAAAAAgCAAAAAA//AAAAAFAAAAAAAAwBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":75,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74]}},{"distances":"QDgCgCgCwBwBgCgCAFwBwB//wBQDQDAFAFAFwBwBAFwB//QD////QDAF//wB//gCgCQDAFgCwB//gCQDQD////QDAF////gCAFQD//gCQDQDQD//wBAFQD//wBwBgCQDAFQDwBwBgC//QD//QDAFAFAFAFgCQDQD//AFgCAF////gCgCAFQD//QDQDQD//QDAFAFQD//QDQD////QDwB////gC//gCQDwBgCwBQD//QD//QD//AFwBQDQDAFAFwBwBgCAFAFAFgCQDQDAF//gCwBwB//gCgC//wBAFQDwB////gCQDQDwBwB//AFwBQDgCgCgCgCgCgCwBgCgCgC//AFAF//QDAFAFQDwBQDQDQDgCgCQD//gC//wBAFgCAFQDgC//AFQDAFAFAFgCwBgCwB//QDwBAF////AF//wBQD","reverse":true,"order":{"count":214,"items":[211,209,208,204,194,187,185,173,170,156,150,149,144,141,137,120,118,116,109,107,106,103,102,99,94,90,85,84,80,71,69,59,55,50,46,45,42,41,37,30,28,25,24,22,11,212,206,203,201,188,178,166,158,155,154,148,145,140,139,128,127,122,114,112,105,67,66,61,60,56,36,29,21,19,18,12,10,9,5,4,202,200,193,190,186,183,182,169,168,167,165,164,163,162,161,160,151,143,142,138,133,129,113,110,108,87,86,82,77,68,62,51,47,38,35,32,31,7,6,3,2,1,213,205,196,192,184,181,180,179,177,174,159,153,152,147,135,134,124,123,119,117,115,111,104,101,100,98,95,93,92,91,89,79,78,72,70,65,63,58,54,53,52,49,43,40,39,33,26,23,14,13,0,210,207,199,198,197,195,191,189,176,175,172,171,157,146,136,132,131,130,126,125,121,97,96,88,83,81,76,75,74,73,64,57,48,44,34,27,20,17,16,15,8]}},{"distances":"AFTi","reverse":true,"order":{"count":2,"items":[1,0]}},{"distances":"AGAOAnAvBjB1CNCSCYC9DFDJDSDWD4EcEqEsE0E2FgGNGnG5HaH1IJJIJJJPJqJtKAKVKiKjLKAAL3L5MQMiNRNVN8OLOkOuPYPnPqQBQDRYRZRdRhRiRuR7SOSUS7TFTXTdU1VAWaW0W6W+XAXXXcX+YjY6Y9Zba5bRbVAAcFcWcncyczAAc7dFdJdYdhe0e4fQf7gKgegjhbhnhohoiNi0jvj1knlDljltmNnLnXnZnfnnn8oSokomo7pNpSpbpjpvqNqqqrq4rUrnsjsos5s5s/t6t9uJufu6wZwmxCxIxSyNyRybyzzbzczqzvz70F0z1P1i1l1s1w2U2Z2d2e2f3F3M394G4c4/5E516G6X6k7A7e8C8v86869H9b9e90909++D+Z","reverse":false,"order":{"count":197,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGFAAAAGeAAAAAAAAAAAAAAAAHmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAANqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAR2AAAAAAAAAAAAAAAAAAAAUuU1AAU3AAU6AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAa3a8bWAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAe0AAAAAAAAAAAAAAAAAAAAiAAAAAjUAAAAAAAAAAkOAAAAmGmZAAAAAAAAAAAAAAAAAAAAAAAAAApcAAAAAAAAAArDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAx7AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA1aAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA32AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA+7AAAAAAAAAAAA","reverse":true,"order":{"count":285,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,102,103,104,105,106,101,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,171,130,129,128,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273,274,275,276,277,278,279,280,281,282,283,284]}},{"distances":"/7AAAAAAAAAAAAAAAAAAAAAAAA+NAAAAAAAAAAAAAAAAAAAAAAAAAA8eAA8WAAAAAAAAAAAA7XAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA5hAAAAAAAAAAAAAAAA33AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0fAAAAAAAAAAAAAAAAAAAAAAAAAAAAxxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAn6AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAjXizAAAAifAAAAAAAAAAAAh2AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAeoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAbKa9AAAAahAAAAAAAAAAAAZfAAAAZAYyAAYYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAWaAAAAAAAAVYAAAAAAAAAAAAUMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPLAAAAAAAAAAOqAAOoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIjAAAAAAAAAAAAAAAAAAAAAAHIHDAAAAAAAAAAGlAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADpAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAnAAAA","reverse":false,"order":{"count":440,"head":[253,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30],"tail":[408,409,410,411,412,413,414,415,416,417,418,419,420,421,422,423,424,425,426,427,428,429,430,431,432,433,434,435,436,437,438,439],"sha256":"e56988e62348fd52cc6779ec5d112a760aef88b2e7f66db9ef6259c15d22cd4d"}},{"distances":"V0YjfPrH","reverse":true,"order":{"count":4,"items":[3,2,1,0]}},{"distances":"AFAAAA","reverse":false,"order":{"count":3,"items":[0,1,2]}},{"distances":"TzcEyMzp","reverse":true,"order":{"count":4,"items":[3,2,1,0]}},{"distances":"lgAAUDAAwTZWYXiN","reverse":true,"order":{"count":8,"items":[0,1,3,4,7,5,6,2]}},{"distances":"AgAlA/BPBQBeCKCMCdCuCzEXAAF6GJGRGiHEHLHfHfHhHhHjH6ICIMI7JFJiJmJoKBKBKNKgKiLELULqMAMAM1NPNVN8OEOpOuO4PMPWPXPaPkPyPzP5QdQpQ2Q9RHRuR5SYSqS5TPTbTpT9UTUqVbVcWNWPW2YZYiY/ZlZnaRahbycCcJccc7c9dVdlePe6e8f5ghgohBhEhRhyiUisitjpjsj0kFkhkylhmEmSnRnzoQoVocpTpmp6qArErJtItLtTtjtvtxt2uNuRuXueuquuu3vAxExGxTx6yAyMyOzDzMzSzkztzuzu0p1V1q2I3O3T3X3v4E4K45465H5f5g5y6U6f7P7c7p8S8Y8o8o889K9k95+F+O+P+S+Z/W","reverse":true,"order":{"count":191,"items":[11,10,9,8,7,6,5,4,3,2,1,0,12,190,189,188,187,186,185,184,183,182,181,180,179,178,177,176,175,174,173,172,171,170,169,168,167,166,165,164,163,162,161,160,159,158,157,156,155,154,153,152,151,150,149,148,147,146,145,144,143,142,141,140,139,138,137,136,135,134,133,132,131,130,129,128,127,126,125,124,123,122,121,120,119,118,117,116,115,114,113,112,111,110,109,108,107,106,105,104,103,102,101,100,99,98,97,96,95,94,93,92,91,90,89,88,87,86,85,84,83,82,81,80,79,78,77,76,75,74,73,72,71,70,69,68,67,66,65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13]}},{"distances":"AFTim/6bN+hb04IaAAvUAA","reverse":false,"order":{"count":11,"items":[0,7,4,1,5,2,9,6,3,8,10]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":false,"order":{"count":15,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14]}},{"distances":"AFAAm/AAAAAA04AAAAAAAAAApw9NQwkN3qLMepAAFpAAAAAFTiAA6bAAhb04AAAAvUAAWUpwAAQwkN3qAAepyGFpZFAAAFAAm/6bN+hb04AAb3vUC3AAAAAAQwAAAALMepyGAAAAsiAFAAAAAAN+AA04Iab3AAC3AApw9NQwkNAALMepyGFpAAAAAFAAm/6bN+AA04AAAAvUC3WUAA9NAAAA3qLMAAyGFpAAAAAATim/6bAAhb04AAAAvUC3WUAA9NQwAAAAAAepyGFpAAAAAFTiAA6bAA","reverse":true,"order":{"count":143,"items":[1,2,3,4,5,7,8,9,10,11,13,16,15,19,21,22,23,25,26,6,0,27,29,12,28,30,31,32,18,24,14,17,20,33,35,36,40,45,47,49,39,52,42,53,55,57,58,59,60,61,62,65,48,38,51,64,41,54,44,34,37,50,63,43,56,46,66,67,68,69,70,71,72,74,78,80,82,85,90,91,93,95,97,98,75,88,81,99,100,101,94,84,87,77,103,83,96,73,86,76,89,102,79,104,105,92,106,107,108,110,111,112,113,114,115,119,121,122,123,127,128,118,124,129,109,130,131,132,134,117,120,133,126,116,135,136,137,139,125,138,140,141,142]}},{"distances":"wBAFAFAFAAwBAFQD//QDQDAAgC////wBAFgCgCAFgCAFAAAF//wBwB//AAAFgCQD////AAQDQD//wBAFwBQDAAgCQDwBQDQDAFgC//gCgCAFwBAF//wBQDgCQDAA//gCwBAF//////AAAFwBQDAAgCgCAAwB//gC//wBQDQDQDQD//AFAAAFwBAFQDAFgCQD//gCQDQDQDQDgCAAgCAFwBwBgCgC////wBgCwBAFQDwBgCAFQD//gC//wBQDQDwBAAQDAFAAQDwBQDgCgCwBAF//wBQDQD//AFAAAFAFAFAF//QDgCAAwB//AF//QDAFQDQDAF//////AAQDgCwB//QDQD//AFQDQDAFgCwB//gCgC//gCAFQDwBAF//gCAFwBwBAAQDAAQDQD//wBAFwBAF//QD//wB//QD//AFQDgCQDQDgCAFgCQD//AAAFwB//wBQDAA//AF//QDAFAA//AFAAwBAFwB//wBAFQDwBQDAFwB////AFAA////wBAFAFQDAFAFQDQDwBAFgCgCwBAAgCwBQD//QDAFwBAAwBAFQDAAQDQD//AAAAAAAAwBgCQD//wBQDAFwBAFAFwBgCwBAAAF//AFQDgCgCQDAFQDQDgCQDgCgCQDwB//AFwBgCQDQDgCAFAFAFgCAAwBAAgCAAgCAAgCQDAFAA//QD//QDQDAAAAQDQDgCgC//QDAAwBgCAAgCgCgCgCAAAA//AFwBgCgCQDgCAAAF//////gCwBAAgCAFAFgCQD//QDwB//gCwBQDwBAFAFAFQD//QDgCAFAFwB////AF//AF//AAQDAAAAQDgCwBAFAFQD////AFgCAF//AAAFAAQDgCgCAAAFwBQDgC//gCAFgCAAwB//AF////wBgC//gCQDAAQDQDAAQDQDAF//wBQDAFAFwBwBwBwBwBAA//AF//AFAFwBQDQDQDAAAAAFwBgCAAAFwBwBgCgCAAgCAFwB//AAAFQDgCgCQDwBwB////wBwBgCAA//gCAF//QDgCgCgCgC//wBAFQD//AAwBgCwBQD//QD//AFgCgCQDwB////gC//gCQDAFwBgCgCgCgCgC//QDwBgCwBgCAFAAgCwBAAQDAFQDAFAF//gCAFQDwB//AFAAQDQDgCAFQDgCwBwBAAAFAF////wBwBQDAF////QD//AFAAwBAFQDwBQDAAgCAF//wBAA//wBQDwB//AAAFQDgC//AFwBAA//QDgCgCgCwBwBQDgC//AFgCwBwBQDAF//AA////AFQDQDwBQDQDAFwB////wBQD//AFAF//AFAA//wBQD//gCAAAF//wBAFwB//AFQDQDwBQDgCgCgCgCwBAA//wBAFgC//AF////wBQD//","reverse":true,"order":{"count":688,"head":[4,11,22,28,34,37,33,32,27,24,14,13,8,40,38,26,25,15,5,0,30,20,18,17,12,41,36,35,31,10,9,7],"tail":[654,651,648,645,685,678,675,669,664,662,655,646,680,674,673,672,671,658,686,670,668,667,656,647,682,679,666,663,660,652,650,649],"sha256":"9871cbcccb618eb2fbfc4ea64717d8aed0426d55f996f3404452b8144cf84ed7"}},{"distances":"AAAAAA","reverse":true,"order":{"count":3,"items":[0,1,2]}},{"distances":"FGJ3lak8bbQfUXuD4ppYq3c5TCgo6wBwx7VPcTU7uDCNPyxMbmBp+dCsoWqZQgJtMxOElfja966v9jQF9o96QP7NhqgXqCcOEmWdKHmrTjFtdIuL0hwOE5XeZYLBVkUMkO+kGGCflwl+d44dhp4wCFgn0pCj7U+hV95cTeYp4fpvHr72kUaZhbadgSmmqPxYjT+1LPP8QpbzmoBUJkI/6t1nUnbpuH4ZY9DBHDrTyFyoJH+Bv98FVkky3NZWJzIFdgCtLnX9XYtAV6e6YJ3Ea3z4evuO2oN+gSfP2GFwF8AjhwJqwtuWoC9lVXIffGm2YxKSEMtTC+56MH4UUsbRdxqqkeh+HJe+RmOtJKwCOMJFEPYCrDyX8A/mbuVGJZfxpDEoQ0Uyei1Bxe1U+qCcXDhsDAtOKnE6GvcEl11MsprndShHX3Y9P1zDyi2uyL12eszqraaDcXlqs8yjjWI50YDiPbtRlkMBg2jqjRfivJKrDxP95rhv4AotcScHdPOz61gx2FAK873OSpXijYZj4F4jtbQu4FGIVBmF1IJIKfURyehGSX4aUtEmAWf+gRndBqf6FK9N7+wPKo8BZKbRRBRSnA+MpHZO5tkpU8lWJXFGAvE0pXiDzbqkJTJhJfEugx7hc7Jun0jQOtA/EJw3ih+8X8KmWJECnrkwxUP6k7EZ4iJ3dhx+pwvXfDL6bQG9PKQmK7MPL2vvuBSa7yzoHo/ZZdJ1YQgqME3do7N5BghpT6LhGUR+KZwVTGxP4OZ5fdNye2k96JIxoLs+b45Y+6hhPUMaRBZmBBlzC0mJpAPZ3pvTm3pS9U4eS9apger5l7P6aQHwBrhov2J0DTK8RfS12QhGnRAZogVa6wljGXOAx81f7HO6jZqFzmiCXcaj/0wJwVZ0hqFdF24DWMwYj1ZqhFECmLOCPk/vh+piRrzWH1HqRGdX35vMtBTUU4gRyTNzWe/GRa4GVCUKyXhOBzgJSJLWlym7DMyEiI4WGy8fpWQ4iD42ts3TCe5M4tiNJmJxGI3D2njv1/WgpGbV2LwuD++k/W9XRfCRD8zuRXZXqaKom0BjV0J+tarLEK68cRZSD2qXRQvAJBQBqxuiu5FVHFW3I3Un+3OWVHTjxHdDQVRn6HfUPuhVA4er5ObWWEMcfcCxNkb0BlMxVjJ5IXVCVJ7Alfstvfib/xL7EqLjm/ohbso487vD3NOzcCor3Sc8q0/EmuK9l4oVaCofhk2u3nRvjPnovXW3YMsoN3JSTi/9zVXOHcQm6rfeJp378YlexAwLT08F1bZ2PlKCTY5L+extGbA80FINFHJKSj5Wv3RHM51/CQ1/PjXZXjQgBzbnuHaTT9GbwovSQQ+QAxONxX7/jMPzRuEvsSbNkLVtxM6CjyHex2mbIzYXlfqUMQXoNbo2huICXw472IHOmE2u8148mXE1+v49zyXEHhWVRrznFi6ao+LQrKJ/Dn4Xj9meQHBMrPGIes57goy4d6wOOfyP90ZmRjZGqA/S","reverse":true,"order":{"count":756,"head":[631,448,594,465,187,363,526,755,483,611,331,394,560,97,720,200,525,65,79,652,26,681,301,119,41,36,750,40,155,38,527,410],"tail":[579,129,27,77,67,508,201,529,666,21,74,672,490,15,420,288,25,582,537,372,103,739,400,327,655,572,682,310,149,431,284,259],"sha256":"78c3f34aefc4571cd6bb1eeaf79f8bb53ae00763dd7c1d9e59f936528b2ac57b"}},{"distances":"gCQD////gCQDgCgCwB//gCgC////wBAFAF////AFAFwBwBQDAF//AFAFQDwBgCwBwBQDQDQD//gCwBAFwB////////AFwB//AF//gCAFAFAFAFwBQDwB//gCQDQD//QDgC//AFgCwBgCwB////gCwBQDQDwBwBQDwBQDgCQDgC//QDAFgCQDgCgCQDAFwBAFwB//AFwBAFAFAF//AF////QD//QDgCgCgCwB//gCgCwBQDwB//////wBwBAF//wBgC//wBQD//gC","reverse":true,"order":{"count":134,"items":[132,129,126,122,121,120,114,108,106,105,103,97,85,72,71,65,62,58,49,47,44,43,42,41,36,25,18,17,13,12,9,3,2,130,127,124,123,119,117,113,99,96,94,80,78,77,74,70,68,57,55,46,40,38,32,31,29,22,21,14,8,133,128,116,115,112,111,110,91,90,88,84,82,73,69,67,64,59,50,37,30,11,10,7,6,4,0,131,118,109,107,92,89,86,83,81,79,76,75,63,61,60,56,35,34,33,28,23,5,1,125,104,102,101,100,98,95,93,87,66,54,53,52,51,48,45,39,27,26,24,20,19,16,15]}},{"distances":"6z4AwefEbcLLGuDjB+","reverse":true,"order":{"count":9,"items":[0,1,2,3,4,5,6,7,8]}},{"distances":"ASKFKKLCMDOuS5TeUSUiWaWqX7YYZjalcKdQd/eLfIhjmUoNqUrfrmsWs+x8zz0p163I556k9Q","reverse":true,"order":{"count":37,"items":[36,35,34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0]}},{"distances":"AUAWCBCPCVDoF1I2KELvMqNCPrPwRSRtSlSvTMTjUrZZaZcBckeHeUeWAAkWlbmTmoonpeqbsEtStevgwFwTwTyd2n3Z4r7w8N+W","reverse":true,"order":{"count":50,"items":[28,49,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34,33,32,31,30,29,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0]}},{"distances":"/LAAAA+WAAAAAAAAAA7cAA606WAAAAAAAAAAAAAAAAAAAA29AAAAAAAAAAAAAAAAAAAAAAw/AAAAAAAAAAAAAAAAuoAAAAAAAAAAAAAAAAq8AAAAAApSAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAcPAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQ5AAP0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAALBAAAAKUAAAAAAAAAAAAAAAAFRAAE1AAAAAADtAAAAAACaAAAAAAAAAAAAAAAA","reverse":false,"order":{"count":146,"items":[0,1,2,3,4,5,6,7,8,12,9,10,11,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145]}},{"distances":"qaS+A4nnlPFJ1spmwhI4FKWxbeBtJdJXrmF/i+Rt9ekfnV+N9eTTXo84KrtXqOpAPkfOThl193i3saQa1I5hf+wVd4d2I5Hcpcm1kHybe3GfMbr80cG0mtiFuWrujJP9+4Sb+jq3FBuAY04evl0yhXdD560Yn29StjL9moLovY8ycOANveF5ZvbMCfcc7NrC0OZDXl5QZm0sCB/5oQ9ZbdlIRMm9F7jbl830die4ptIl/egl0fId0zuiRf6cFKr/NZAPJejw0Xcanez5tuNHQQu2zQXeAplVB1w+GLSEWF8hIqgyILgeP5fA/jEEDuc+su5HNLiZarW1k6I9yIy0fbJIeBnpcaWz/npYpIlPHabbZGTijYh0fNL/mRZkgmjIjZNbj4/rKzD/NYmSfthv1tAOi0BbLgbiJa7ak/9ovWKzU3xRRTA4nKTGw9MCykQo2Mr4QSEFiX1p4rwUcOhSa5o2orgyId/oWE3stpXxV0R/U6r5nWwhQkE2kIWuOB5TjypkBxv2t232fkbdsvHCCCIN1TrhR3fukrtwyc3rtVi+94sr9Ysa4xeMRkPzWGmHx3mG8ZTMhA+FLZ+JCruB39ejCfjPcFDrbNRQDrfbpXGi+W+2UVCOcnWhP8RrxD3sJoFye8WRJqHzUqAHSo8j00qvU3U4r4wPaVQJJuaI5TfLjyPi0OW3z/FHiFlbtyDDIW+MevpKhfSVYNtGRghmvzS+3gtyErmUKxupULJw0Vw0Qv5m1YGQW0iH5W76pVHIkGNHEu6mqFgvi+g2svqWL1MWCvqR+jknAHfbVQUAs9N+6Xe0ms6GLSAguQpcyksuXDNxobz5s9Za1YddlUePg4W5Ippe3C2ZI37SOwKuPtr3RcAPp24y6kq4ov5vFJPgmE8cfLSJVxQso1A7BVIFzD3oIdQKNhCuctY7nlpFwY36d1","reverse":true,"order":{"count":471,"head":[103,195,239,176,156,118,64,311,398,66,310,23,353,295,293,278,36,211,24,20,105,280,79,27,85,329,149,449,290,381,209,433],"tail":[366,227,157,197,158,306,303,351,396,463,296,300,92,313,266,102,144,258,13,205,456,455,217,2,142,411,439,129,203,87,400,327],"sha256":"be2ed5256ffd6ec0ddbfdd7a5fc2a9f64d97363aeed9f1b4b5e790d1bfa951fe"}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hbAAIab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3AApw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04","reverse":true,"order":{"count":260,"items":[105,82,13,118,95,72,26,3,108,85,62,16,121,98,75,6,111,88,65,19,124,101,78,9,114,91,68,22,127,104,81,12,117,94,71,25,2,107,84,15,120,97,74,28,5,110,87,64,18,123,100,77,8,113,90,67,21,126,103,80,11,116,93,70,24,1,106,83,14,119,96,73,27,4,109,86,63,17,122,99,76,7,112,89,66,20,125,102,79,10,115,92,69,23,0,29,59,36,49,39,52,42,55,32,45,58,35,48,61,38,51,41,54,31,44,57,34,47,60,37,50,40,53,30,43,56,33,46,149,243,220,197,174,151,128,256,233,210,187,164,141,246,223,200,177,154,131,259,236,213,190,167,144,249,226,203,180,157,134,239,216,193,170,147,252,229,206,183,160,137,242,219,196,173,150,255,232,209,186,163,140,245,222,199,176,153,130,258,235,212,189,166,143,248,225,202,179,156,133,238,215,192,169,146,251,228,205,182,159,136,241,218,195,172,254,231,208,185,162,139,244,221,198,175,152,129,257,234,211,188,165,142,247,224,201,178,155,132,237,214,191,168,145,250,227,204,181,158,135,240,217,194,171,148,253,230,207,184,161,138]}},{"distances":"AAAAAA6bN+AA04AAAAvUAAAAAA9N","reverse":false,"order":{"count":14,"items":[0,1,2,4,9,3,5,6,7,8,10,11,12,13]}},{"distances":"AAAAAAAAAAAAAA","reverse":false,"order":{"count":7,"items":[0,1,2,3,4,5,6]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAURAAAAAAAAAAAAAAAAAAAAAAAAAAcXAAAAAAK2AAAAhWAAvfAAAAAAAAAAAAgXAAAAAAAAAAAAAAAAAAAAAAAAAArVAAAAAAAAAAAAAAAAAAAA6hAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADK4mAAviAAAAAAAAAAAAyDAAAAAAAAAAAAQRAAAAAAAAAGAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAd0AAAAAAAAAAAAAAPlAAAAAAAAAANjAAAAcoAAAAAAAAdSAAAAAAAAAAAAAAAAAAAAAAAAAAfwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPeAAAAAAAAAAAAAAAAAAAAAAAAa4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAK1AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAarAAAAAARKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAJnAAAAAAAAAAAAAAAAdDAAAAAAAAAACGAAAAAAAAAAAAAAAAXmAAbXAAAAAAAAAAAAAAbBAAmJAAAAAAAAAAI14gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA2GAAAAAAAAAAAAAAAAAAAAAAFKAAAAAAAAAAAAAAAAA8AAAAAAsUAAAAAAAAAAAAAAAAAAAAAAAAcrAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAX2dHAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAmpAAAAAAAAAAWlAAAAAAAAAAAAAAAAAAAAAAiNAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAI7AAAAAAAAAAmEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0loZAAAAAAAAAAAAAAAA3JAAAAAAAAAAAAAAAAAAAAAAAAAAAAyHAAAAAAAAtIAAAAAAF4AAAAAA3sAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAzZAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD+AAAAAAAAAAAAAA4HAA7t","reverse":false,"order":{"count":596,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[564,565,566,567,568,569,570,571,572,573,574,575,576,577,578,579,580,581,582,583,584,585,586,587,588,589,590,591,592,593,594,595],"sha256":"7f7bc972553c341633936ab37a6b2692e910f858217bc44cdc425c1f6dc05d25"}},{"distances":"ALAVA3BuBvC8DVDvEDEZElEsEuGDGEGPGWGbGpGtHSHVHuIlIrJAJGLQMANqNrNtN5OGOSOXOgOtOyO1O6PBPEPVPpQERDRGRUSPSaSdSkS1S9TCTIVQVUWCWWWcXrYDYHYPYPYWY7ZHarbAbDbZcwc6dGdUdWeHeXeaeme3fIfafqf5f/gUhxiTibimjBjVjVjokekrk2k7lalul8mtmum2m4nSnknwpHpRpgpjqRqSqVqarNr0r6r9sZsssxs5tdtmtquMuVuXuevAvOvhxJxnxwx/yIzazr0i0y1X182Q2b2q263W4y5L5p5v5+6n6r7D7I7b718K8M8O9t+S+T+i+i/I/q/z","reverse":true,"order":{"count":176,"items":[175,174,173,172,171,170,169,168,167,166,165,164,163,162,161,160,159,158,157,156,155,154,153,152,151,150,149,148,147,146,145,144,143,142,141,140,139,138,137,136,135,134,133,132,131,130,129,128,127,126,125,124,123,122,121,120,119,118,117,116,115,114,113,112,111,110,109,108,107,106,105,104,103,102,101,100,99,98,97,96,95,94,93,92,91,90,89,88,87,86,85,84,83,82,81,80,79,78,77,76,75,74,73,72,71,70,69,68,67,66,65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WU","reverse":true,"order":{"count":12,"items":[3,6,9,2,5,8,11,1,4,7,10,0]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTi","reverse":true,"order":{"count":71,"items":[59,36,13,49,26,3,62,39,16,52,29,6,65,42,19,55,32,9,68,45,22,58,35,12,48,25,2,61,38,15,51,28,5,64,41,18,54,31,8,67,44,21,57,34,11,70,47,24,1,60,37,14,50,27,4,63,40,17,53,30,7,66,43,20,56,33,10,69,46,23,0]}},{"distances":"ESUIWUW8Zjddf6ixj0q5vd+S","reverse":false,"order":{"count":12,"items":[0,1,2,3,4,5,6,7,8,9,10,11]}},{"distances":"AAAAAAAAAAAAAbAAAoAAAAAAAAAABWAAAAAAAAAAAAAAAAAAAAB/AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADEAAAAAAAAAAAADxDyAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFoAAAAAAGQGRAAAAAAAAAAAAAAAAHEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAJOAAAAAAAAAAAAAAAAJpAAAAAAAAJ3AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAL5AAAAAAAAAAAAAAAAAAM4AAAAAAAAAAAAAAAANyAAAAAAAAAAAAOcAAAAOhAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAARoAAAAAAAAAAAAAAAAAAAAAAAAS7AAAATAAAAAAAAAAAAAAAAAAAAATqAAAAAAAAAAAAAAAAUtAAAAAAAAAAVTAAAAAAAAAAAAAAAAVxAAAAAAAAAAWDWJAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYRAAAAAAAAAAY3AAZDAAAAAAAAAAAAZjAAAAAAAAAAZwAAAAAAAAaBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAbpAAAAAAcAAAAAAAAAAAAAAAAAAAc8AAAAAAAAAAdQAAAAAAAAAAeNAAAAAAAAAAAAeaAAAAAAAAAAAAAAAAAAfFAAAAAAAAAAAAAAfwAAAAAAAAAAAAAAAAgWAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAiqAAAAAAAAAAAAAAAAAAjwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAk5AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAnxAAAAAAAAAAAAAAAAAAAAAAAAAAo/AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAqCAAAAAAAAAAqXAAAAAAAAAAAAAAAAAAAAAAq/AAAArTAAAAAAAAAArdAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAslAAAAssAAAAAAAAAAAAtEAAAAAAAAAAAAAAAAAAAAtzAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvVAAAAAAAAAAvrAAAAAAAAAAAAAAAAAAAAAAAAAAwfAAwtAAAAAAAAAAAAxKAAAAxZAAxnAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAzOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA2dAAAAAAAAAAAAAA3NAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA5UAAAA5vAAAA6PAAAA6b6cAAAAAAAAAAAA66AAAAAAAAAAAAAAAAAAAA77AAAAAAAAAA8aAAAAAAAAAAAAAAAA9FAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA/PAAAAAAAAAA","reverse":true,"order":{"count":797,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[765,766,767,768,769,770,771,772,773,774,775,776,777,778,779,780,781,782,783,784,785,786,787,788,789,790,791,792,793,794,795,796],"sha256":"dd85573c242ece18ffc45bd3c40b3c0ba4eacf765114145a4d9fb98007fdfca0"}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw","reverse":true,"order":{"count":13,"items":[3,6,9,12,2,5,8,11,1,4,7,10,0]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkNAALMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9N","reverse":true,"order":{"count":244,"items":[105,82,59,36,13,118,95,72,49,26,3,108,85,62,39,16,121,98,75,52,29,6,111,88,65,42,19,101,78,55,32,9,114,91,68,45,22,104,81,58,35,12,117,94,71,48,25,2,107,84,61,38,15,120,97,74,51,28,5,110,87,64,41,18,100,77,54,31,8,113,90,67,44,21,103,80,57,34,11,116,93,70,47,24,1,106,83,60,37,14,119,96,73,50,27,4,109,86,63,40,17,99,76,53,30,7,112,89,66,43,20,102,79,56,33,10,115,92,69,46,23,0,131,243,220,197,174,151,128,233,210,187,164,141,223,200,177,154,236,213,190,167,144,226,203,180,157,134,239,216,193,170,147,124,229,206,183,160,137,242,219,196,173,150,127,232,209,186,163,140,222,199,176,153,130,235,212,189,166,143,225,202,179,156,133,238,215,192,169,146,123,228,205,182,159,136,241,218,195,172,149,126,231,208,185,162,139,221,198,175,152,129,234,211,188,165,142,224,201,178,155,132,237,214,191,168,145,122,227,204,181,158,135,240,217,194,171,148,125,230,207,184,161,138]}},{"distances":"RqAAzrFcQwcQKXs0diWSES37ZGXdaZo4kB1mNWxmYABaKINYk14WL+L3MOTW7TOF00PFHzgodNTckF7HkJ+I4/oEuL+AMrA8PdsVHwSRdjbWnZkAzgQuvTaEOMXHrVCNn5d0SGcJCbsyK857frakWN95rgkrIon585h+pRR0gTE/cbXi1MepJyPghF2v7uBPdwBynrfcDtzh5gZe0947hQ7buT0AVDFFV8VLSebbyiaFBa1AoLfPm/+WxiAAh5anO1vTbsiBwWBU3zySNR+nGwR5C4g9tgGixKxIzhk8zVEQO4bllm/mzvYQss6H5nllVpoalEZIorzXR3S4/RotgLj3z73nSXSnR8sjeJSuODSx4ffNIX5nxm4A3NvcP1D1NPQcmHIesq3xnJMggsKBiJtq+HTl3IfBRTORRmlo4PM6GmiA6ykvJyAsYk5dAsb6JIcC4oEOqyCRGsvEXWtuBwxL5ZDFzRWCI8+12dd1rw6gE31XlVtm/s4OQlfIfy+oG/QL64jNGoj4U2uUe/yIgnSj8FH+s0XYlRwgM9CxXceW5tuZoa1SNQ5FglV0UoaGgM/HLoOcXVlrma6qSXX6yDChlZdKJJQRL+a+qEjZB8SQbXLzBT2ZAnaNwljNSSn2m1XfPDzF4GOqX7XSVPSOEESlhXN6AAyAI+uP7GAAWJ8ViLDjSY9r7s31kpkF9UqvkyysVGHGGsB81j6DWPy4QZhHmfOJVhnW/ORCND38engUO5v0alqISThuw1","reverse":true,"order":{"count":381,"items":[1,250,289,241,255,41,204,45,75,80,268,30,39,258,216,295,245,71,278,221,236,283,42,226,25,212,251,324,11,197,206,242,313,17,247,281,88,32,2,56,238,323,265,298,19,235,316,273,189,58,231,279,263,44,233,203,249,270,7,69,196,49,244,76,62,228,306,82,15,280,43,79,64,319,54,198,320,294,194,293,211,300,248,272,24,217,77,40,38,16,55,261,307,317,259,202,215,81,332,92,200,35,266,284,84,288,254,72,253,207,264,89,277,243,65,52,8,36,301,86,5,67,225,223,310,53,305,73,14,315,287,59,12,220,20,326,297,87,321,13,276,271,232,292,327,61,9,74,239,285,328,262,286,205,37,29,331,267,296,318,51,309,329,66,83,0,210,208,4,57,252,193,303,257,190,91,48,33,322,325,291,209,60,31,23,18,282,192,274,213,46,199,28,304,26,27,311,290,70,6,22,201,218,90,302,224,240,78,195,269,34,50,256,230,260,214,3,85,246,10,227,330,191,237,275,299,68,229,63,308,234,21,312,47,125,153,168,137,123,94,107,157,185,158,102,105,182,187,134,173,188,93,119,104,109,172,154,146,101,165,148,116,135,186,124,144,145,132,129,108,142,156,177,169,164,161,120,98,122,152,159,162,147,171,131,126,106,141,170,99,121,183,178,96,130,151,115,127,117,103,163,155,112,160,113,110,167,181,179,175,114,174,176,139,166,150,128,180,136,184,138,143,111,149,100,140,97,118,133,95,222,314,334,339,368,345,350,341,346,338,359,371,347,358,361,353,335,380,375,337,351,377,367,364,352,348,349,342,379,363,373,372,376,360,340,366,354,344,378,369,362,374,365,333,370,336,355,356,343,357,219]}},{"distances":"AFTim/6bN+AA04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3AAC3WUpw9NQwkNAAAAepyGFpZFsiAFTiAA6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAATim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFAAAFTim/6bN+hb04IaAAvUC3WUpw9NQwkN3qLMepAAFpZFsiAFTim/6bN+hbAAIab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMAAyGFpZFsiAFTiAA6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwAA3qLMepyGFpZFsiAFTim/6bN+hb04AAb3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpAAsiAFTim/6bN+hb04AAb3AAC3WUpw9NQwkNAALMepyGFpZFsiAFTi","reverse":true,"order":{"count":278,"items":[5,197,151,13,141,26,3,154,16,144,29,6,19,9,22,12,25,2,15,28,18,31,8,21,11,24,1,14,27,4,17,30,7,20,10,23,0,32,39,40,48,59,36,49,62,52,65,42,55,45,58,35,61,38,51,64,41,54,67,44,57,34,47,60,37,50,63,53,66,43,56,33,46,69,82,91,95,72,85,98,75,88,78,68,81,94,71,84,97,74,87,77,90,80,93,70,83,96,73,86,99,76,89,79,92,100,105,111,121,128,118,131,108,134,124,101,137,114,127,104,117,130,107,120,133,110,123,136,113,126,103,116,129,106,119,132,109,122,135,112,125,102,115,156,163,174,187,164,177,190,199,200,167,203,180,157,193,170,147,206,183,160,196,173,150,186,140,176,153,189,166,143,202,179,192,169,146,205,182,159,195,172,149,185,162,139,198,175,152,188,165,142,201,178,155,191,168,145,204,181,158,194,171,148,207,184,161,138,214,243,220,233,210,246,223,236,213,226,239,216,229,242,219,232,209,222,235,212,225,238,215,228,241,218,231,208,221,234,211,224,237,227,240,217,230,251,259,258,260,262,266,256,249,269,272,275,252,265,255,268,245,271,248,261,274,264,277,254,267,244,257,270,247,273,250,263,276,253]}},{"distances":"AFTim/6bAAhb04Iab3vUC3AApw9NQwAA3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUAAWUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUAAWUpwAAAAkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepAAFpZFsiAFTim/6bAAhb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTiAA6bN+hbAAIab3vUC3AApw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwAA3qLMepyGFpZFsiAFTim/6bN+hb04IaAAvUC3AApw9NQwkN3qLMepAAFpZFsiAFTim/6b","reverse":true,"order":{"count":188,"items":[3,4,11,13,15,33,36,26,39,16,29,6,42,19,32,9,45,22,35,12,25,2,38,28,5,41,18,31,8,44,21,34,24,1,37,14,27,40,17,30,7,43,20,10,46,23,0,56,59,60,82,72,49,85,62,75,52,65,78,55,68,58,84,74,87,64,88,91,81,71,48,61,51,77,54,90,67,80,57,93,70,47,83,73,50,86,63,76,53,89,66,79,92,69,96,105,98,117,118,95,108,121,126,128,131,134,111,124,101,137,114,127,104,140,94,130,107,120,97,133,110,123,100,136,113,103,139,116,129,106,119,132,109,122,99,135,112,125,102,138,115,153,169,172,174,151,164,180,187,141,177,154,167,144,157,170,147,183,160,173,150,186,163,176,166,143,179,156,146,182,159,149,185,162,175,152,165,142,178,155,168,145,181,158,171,148,184,161]}},{"distances":"OWS1T9aa/W","reverse":false,"order":{"count":5,"items":[0,1,2,3,4]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUAA9NAAkN3qLMepAAFpZFsiAFTim/6bN+hb04Iab3vUC3WUAA9NQwkN3qLMAAyGFpZFsiAATim/6bN+hb04Iab3vUC3AApw9NQwkN3qAAepyGFpZFsiAFTim/6bN+hb04Iab3vUC3AAAA9NQwkN3qLMepyGAAZFAAAFAAm/6bAAhb04Iab3vUC3WUpw9NQwkN3qLMepyGAAZFAAAFTim/6bN+hb04Iab3vUC3WUpw9NQwkNAALMepyGFpZFsiAFTim/6bN+hb04IaAAvUC3AApw9NQwAA3qLMepyGAAZFsiAFTim/6bAAhb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hbAAIab3vUC3WUpw9NAAkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpwAAQwkN3qAAepyGFpAAsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkNAALMAAyGFpZFsiAFTim/6bN+hb04AAb3vUC3WUpwAAAAkN3qLMAAyGFpZFAAAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04AAb3AAC3WUAA9NQwkNAALMepyGFpAAsiAFTim/AAN+hb04Iab3vUC3WUAA9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUAA9NQwkN3qLMepAAFpZFsiAATim/6bN+hb04Iab3vUC3WUAA9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUAAWUpw9NAAkN3qLMAAAAFpZFsiAFAAm/AAN+hb04Iab3vUC3WUAA9NQwkN3qLMepyGFpZFsiAFTim/6bN+hbAAIab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpwAAQwkN3qLMepyGFpZFsiAFTim/6bN+AA04Iab3vUC3WUAA9NQwAA3qLMepyGFpZFsi","reverse":true,"order":{"count":506,"head":[12,128,13,14,19,35,36,26,3,39,16,41,46,49,52,29,6,42,55,32,9,45,22,48,25,2,38,15,51,28,5,18],"tail":[478,455,491,468,445,504,481,458,494,471,448,484,461,497,474,451,487,464,500,477,454,490,467,444,503,480,457,493,470,447,483,460],"sha256":"a1f5b3b757cfb25f94d267d09912a7f2de7b7c8f869488f6c51d6ef0c630ad08"}},{"distances":"/u/S/S/O+8+y+r+Z+P+F999v9s9l9k9i9g9W9E9C858s8oAA8N797sAA7U636sAA6M6K5854535y5q4643424z4y4i4d4R4I343xAA3l3a3U3SAAAA3I3G27AA22AA2sAA2d2X2N2L2I2C1s1g1Y1U1M1K1C0+0mAAAA0X0M0J0Iz/z+z1z0zUzPy7y1yoylyhyVyQyPyMyBxhxgxNxIw6wjwjAAvovXu+uwuvAAuXuXuRuQAAtwteAAtAs7s6AAsssbrhrerKrIq6qVqQqNp+p5pypupjpXAApVAApPpCo6oxonogoWoNAAn8n0nrnmnjnXnJnBm/m3m1mSmIAAmAl6l4AAlrlZlMlHlClCkSkMj3jxjqi0iwimimiViFhohohfhWAAhKhGg/gpgggMf2f1f0fsfofZfHe6AAAAeCdzdldddVdMc/c/c4cvctcfcXcScOAAbpbnbkbFbEatasamadaXaLAAZnAAZIZDZBY+Y4YrYjYjAAYdYcYcYVYVYTYPYDYDYDXyAAXgAAWeWcAAWKVzVgVSVJAAAAUhUeUKUJUIUFTuTeTbTZTLTDSvSmSlSkSjSVSSR9AAR1RpRjRbRYRTRRAAQ1QtQtQfQeQLQHP7PyPTPSPQO0OwOqOoOaOKOHN8N5NlNfNcNYM+M8M8MuMtMlMQLeLeLILDK/K+K5KzKqKhKeKYKAJ5JwJeJcJQJMJKJII8I5IzImIWISIMHmHdHbHTHOHJGwGtGoGkGbAAAAF3AAFtFnFgFeFJFDE4E1EzEtEbEREOEKDuDmAAAAAAB5AABwBVA4AyApAdAXAX","reverse":true,"order":{"count":408,"head":[0,2,1,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[376,377,378,379,380,381,382,383,384,385,386,387,388,389,390,391,392,393,394,395,396,397,398,399,400,401,402,403,404,405,407,406],"sha256":"e87648e167cec5b03588cf26048414ba46e5bde2da3de21accc34d6788817bc8"}},{"distances":"AAiX5TPEmErGAAAA6y76AAAAG+a4atAAAAAAuNineGAAAAAAWVAAAAtsqFAAp1+qKkoQAA6QAAaxi+elKDfxAAAAaO46AAYJ7TAAAAAAAAAAAAzXAAAA5t+kAAAAUMYmQ5AAAAAAcK+BAASW6ecO9lAAun2IlLuGZSdLAA0n2dAAPzAAy5F5AAnG4d5hJkgyGWAAAA11AAJ0AAAAjXD15QAAAAAAVQTDciA5AAZM6ZAA1cAAAAUEKhAAezs7AAAAAASqAAdyo6RZ38i3AAlDAArKAA9vAAJyAAbXKV+7AAbV3TTMQ+AAEBXPERAAbpdGAAAA4IAAAALKAAAAngAAibAAqEjTPKLlVyAAM6BOjOhfnBVGexe9pv95AAAAV6AAAAAAAAfhAAnIAAAAsguc9ccfjBAAnFtSAAAA7pAAEDAAAAAABFIIL6bocOAAAAAAIgJWCzAAXqZ+AAooAAAA0ovPUCAAkMAAD6AAAAD8ANL7AA4pVUAAAArM/3D3rsAAAAAAwaAAAAAALP39LRkaiX2cfv1sAA1eA1AAtBctkYAAaUU6G4V9AALzmJZKLEb18sKoAAAAlzQrAAUBAA/BAAFiAAAAsQAAAAAA+1AAxxAAmG3xHRAAib8FAAGPl7tSlISfRDGpuvAAAAAAIgAADW6MAAAAAA3FW4jiAA6BZ9AAAAAAAAAAAAZ6AACR35AAzvAAAAAA4LAAAAAAAAAAAAAAAAhSAAAACjAAAAChAA3IAA5eAAn5gYAAMmAACHAAEnhb+EAAAsAAhvAAAAlrAA5KAAAAAAHcAAWpgyAAAYAYJuxOuYLhAAAAAAYwAAg0Veo++JIO6VAAaoAAAAAAAAN9KMAAlnAAcTRtAAK4AAQHMUAAAAAAgkAaAAAAI4XUtIJkAAAAZQAAAAJSlCAAxTAAAAgPWUAAAAAAFNooW8AArHAAgwAAotOqiTmjV+EdAA61OWZiAAvfNHq9AAAAAABmAAAAsoAAEk37AAAAVCAAXnvTN2zXAHOaAAJGAAAAxEyP+AAAgFFMAAFuPxAA8RqbsIkBAAAAlC/bsFiAOYAAv9AAAAAAsAAAAAAAHHAAkiAAHNAA3bAAdeAAzOyrAAAA/BufArp/EnwvWvAAepvbLTzQAAKXWSAAAAP0Wc5qnKRopsbCAAAAAAAAAAAAAAAAAANiIiAAYYAApQAAi8AAAAG11t+mAAAAf+0ZAAuRg5AALtBJpjqlytAAw1KLAAAA8V5YLxAApIfBAAAAAAD/gGAAReeSAAAAAACqOh5aJlTASmGrAA/lOhNrAAAAajyFwswneyxzAA9xAA3JAA1FALKeAA5JHigcoQgK27AAd8ohAAAAXMmCAA2pAAAAA8L/lGml2NqdOATzAAb3lwYb+hnOkRaSAAk4UwAAAAtzq2yI8KQ8RIVDoCimC5AAAAAAz/AAVEBErvqnxZAAkOAAAAAAvwAAz/AA7S/6sMAAtCAAfpHGAAP+AAzVtg4ChEGZ","reverse":true,"order":{"count":748,"head":[0,6,7,10,11,13,14,15,16,17,18,21,22,23,25,26,27,28,29,31,9,8,2,34,187,35,5,30,33,4,36,38],"tail":[723,725,726,727,729,731,733,732,730,703,724,735,737,740,742,745,743,728,744,736,734,710,711,746,738,709,708,707,741,739,747,712],"sha256":"44c0bc00dc56f99e7e006f67cc9c57459fdf3f0b4f52d77cf824d235a71bd4cd"}},{"distances":"gC////AFAAAAgCwB//AAAFAF//gCgC////","reverse":true,"order":{"count":17,"items":[4,5,9,16,15,12,8,2,1,7,14,13,6,0,11,10,3]}},{"distances":"cY6fXFbPNTeR6oK1okLpUF1V6Rr6T0aGRCsxzoDBzf5nlJ79Os5qeTJAHxzeYlsdJ+0hCBJfBBv5alcnziKe8O6qfdsqVhPLMiw+PqZJUHtTgqgEcBbQfTJ7xThN0yG9EPANBQjmJpWE6MrL6bUtvF0tOixSCscevwsn/ruxh5A57QNIKLfeh1G+6Onp0JsiofFih2ik2G6w2FUMZOGO9O3DV1rUBxdU6BcklQzmfsd4vrBpQ/TdJ67a/5Umc2hHKhrO/DrfWUdmlTZDt+7ABCMIBynj0oC2Quc1vPAXIJqhK+8shQuR+TIEkflUuruK4HOHyhDzTodJ6xT8Q7LiFjfX4u8AkQ0g18NKi34ToCYboWeNw+ENvin78LL5+gk1e1fJhEbwAoNZhvhniz64milRO3goczCa4vHl23a3JO59jsY8VQokMHEb32SjCzHMiEGJ5EVPIL2d7Y/cw3+tbkKR6H/ziGBHWb3L8dWoocO3RJD0XTuU3YqOqjW7vujbtnrWgF1uBHjd/WhO1vM1eyrpw/ihM+l04ndKl28E5FO9rmVqJlbfiO0FFO5DrlUPi6uOnS+2z5Fx0QHiqMDEGTYL/3KZantjOz2hycbpHrlAtwUUgmsxlQAabB3te69v9bDefeFy3ue5QCrdCxgX5Jj9oLeWgAOJ1eNPTeV//Bm4jFKRSebXgHE16Z21UXIL8d08JMUB39PdDQI0yrhiyQpSNOTe6iODItpqLxAKjdtW49CBH6NKLqmmyFqGgPz3tw3K7Wif0+XbBJRKaCsZ36uiQ2De3cm5CDBX0N01GmEmLazrPfDv52Kh3FjsDCKbJG4gqF35d3/4Ttwaq1hKmLZnQN0qjekr8yoAiZKBnc5+K6EKi1n/2PClrIapUOOjVAJdNfpLD3uiQ6alSs/3pSuaHdTmCKrSvKx7pyVTSXp0Vw4F/zgTd2X5UMnUaG1VM/lF/M6U4R+mXgvMAdPvSO+v/X58ZDtMpKChs7rxMrH6+MwEKW70yBn6vf0An0bKyrWHQVG0ZhnAnvD9swmc6lpisOHajNFua6X7Sxy9DCcOFNZoaSKt3Ey/3LIvybcBJ/VrBQTFTO+1grimuXxVn/bWESYRXyglmeb9f0wSaDFK/Sg/C6Jg7Qqa2a074bhiLzB7dLZecIIM9FeqWdKOLmNI7PJP1m3JrlDn0GNhJ+N+H+aYTcol4m+yKP3NNcC6H+eunttnYVfEWHWFFUmGG2ZQ9Z2Q+sa7FnVraZV1o+WcHe+zQBbCdM0MAa3IMV/m0KKBa6Kwx+eY8XoTa69kb9Er3zYGVHmXlKtNNc5pJfZKLHMsphvjPrOYWcRRjz116osfO0SA/GCMtkjHLKkPmNWNvQNuEHk4/RFw0AMlk6B+wSmURVgc+0lGdNoopeIzBMCRdV1I6Iny7J+XFziSV/juxBjz3+ylGF/VzJJFdL7R/g38VHCSeqh5ikEOOnpsmO4PpiSRzWzG1Vcrs3XBDnFprpkDThY1WBCHvYLzsmmj661CwC","reverse":true,"order":{"count":761,"head":[124,421,457,300,472,237,82,639,726,231,492,262,721,566,688,482,676,130,340,291,549,698,631,603,491,233,622,485,190,711,154,502],"tail":[497,207,729,705,677,462,753,400,375,34,693,577,140,110,119,401,546,66,704,390,260,239,138,36,85,196,488,636,315,147,65,371],"sha256":"6dcf60035542306913cf30ba1cd3c2482ec303a0ea4ce7778ae1b721587f45bc"}},{"distances":"AATim/AAN+AA04IaAAAAAAAApwAA","reverse":false,"order":{"count":14,"items":[0,1,2,3,4,5,7,6,8,9,10,11,12,13]}},{"distances":"AAAAAAAAAA","reverse":false,"order":{"count":5,"items":[0,1,2,3,4]}},{"distances":"AAAA","reverse":true,"order":{"count":2,"items":[0,1]}},{"distances":"AFTim/6bAAhb04Iab3vUC3WUpw9NQwkN3qLMep","reverse":false,"order":{"count":19,"items":[0,10,7,17,14,1,11,8,18,15,2,3,4,5,12,9,6,16,13]}},{"distances":"LwnRlPeTXrrykjqlPETRE7Y6LucYxajea+d7dILHdOvlvdO6Wx64JEsPFOH4DPeV","reverse":true,"order":{"count":32,"items":[25,14,21,22,27,5,7,1,2,6,15,31,3,17,20,18,13,16,11,4,24,9,8,23,0,12,19,26,29,28,10,30]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUAA9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZF","reverse":true,"order":{"count":183,"items":[82,59,36,13,72,49,26,3,85,62,39,16,75,52,29,6,88,65,42,19,78,55,32,9,68,45,22,81,58,35,12,71,48,25,2,84,61,38,15,74,51,28,5,87,64,41,18,77,54,31,8,90,67,44,21,80,57,34,11,70,47,24,1,83,60,37,14,73,50,27,4,86,63,40,17,76,53,30,7,89,66,43,20,79,56,33,10,69,46,23,0,104,174,151,128,105,164,141,118,95,177,154,131,108,167,144,121,98,180,157,134,111,170,147,124,101,160,137,114,91,173,150,127,163,140,117,94,176,153,130,107,166,143,120,97,179,156,133,110,169,146,123,100,182,159,136,113,172,149,126,103,162,139,116,93,175,152,129,106,165,142,119,96,178,155,132,109,168,145,122,99,181,158,135,112,171,148,125,102,161,138,115,92]}},{"distances":"+Wn+","reverse":false,"order":{"count":2,"items":[1,0]}},{"distances":"QDgCgCwBgCgCgCwBAFAFQDwB////////QDgCQDgC//wB//wBAFgCAFAFwBwBgCQDAFwB//AF//AFQDwB//QD//wBwBgCwBQDwBQDAFgCwBQDQDwBQDQDQDwBAFAFQDwBAFQDwBAFwBgC//AFQDQDQDwBAFwB//QDAF//wBAFgCQDAFgCwBAFwBgCwBgCQDwBwBwBwB//wBQD//gCAFAFAF//wBgCAFwBQDQDQDwBgC//wB//wBwB//QDQDwBwBQDQDQD//wBAFwBAFAFQDwB//gCwBQDwBQDAFwBgCAFwB//QDgC//gCQDwBwB//gCwBwBwB//QDAFAFgCAFAFAFQDAFQDwBwBwBQDAFAFQDQD//QDwB//QDgCAFgCgCQDgCgCQDwBAFQDQDgC//wBwBAFgCAF//gCgCwBQDAFAFAFQDQDgCgCAFQDwB//wB//QDwBwB//wBAFQDAFwBwB//gCwBwBAFgCAF////wBgCQDgCAFgCwB//wBAFwBQD////QDAFgCgCQD//gCQD//gCQDgCQD//gCgCAFwBQDAFwBQD//QD//wB//QDAFgCAFwBwBgCgCwB//AFQD//QDAF//QDwBgCwBgC////gCQD//gCgCQDgCwBAFgC//wBAFQDQD//AF//wBAF//wBQDwBAFQDwBQDgCgC//wBgC//AF//QDAFAFQDAFQDAFQD//gCAFwBgCwBQDAFwB//AFgCAFwB//AFwBQDAFAFQD//AF//QDwBAF//////QDAFwB//QD//AFQDgCQDgC////QDQD////wBQDAFAFQD","reverse":false,"order":{"count":402,"head":[8,9,24,26,27,32,35,37,50,60,61,64,67,71,76,80,83,86,89,104,105,106,110,132,134,135,144,147,164,165,167,168],"tail":[264,269,278,280,282,292,295,298,304,305,308,316,321,323,326,336,339,341,350,359,364,371,373,377,378,379,383,385,391,392,395,396],"sha256":"dfeadeb0df27fbca57c9aeac3198964d5ac5145f5c261812d8ee740fb22c11f1"}},{"distances":"JW1b6L","reverse":true,"order":{"count":3,"items":[2,1,0]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vU","reverse":true,"order":{"count":33,"items":[13,26,3,16,29,6,19,32,9,22,12,25,2,15,28,5,18,31,8,21,11,24,1,14,27,4,17,30,7,20,10,23,0]}},{"distances":"AAgCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgCgCAAAAAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAwBAAAA////AAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//wBAAwBAAAAwBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAAAQDAAAAAAAAAAAAAAAA//AAAAAAAA","reverse":true,"order":{"count":105,"items":[0,45,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,20,19,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104]}},{"distances":"AFTiAA6bN+hb04IaAAvUC3WUpwAAQwkNAAAAepyGFpZFsiAFTim/6bN+hb04AAb3vUC3AApw9NQwkN3qLMepAAFpZFsiAFTim/6bN+hbAAIaAAvUAAAApw9NQwkN3qLMepyGFpZFsiAFTim/6bAAhbAAIab3vUC3WUpw9NQwkN3qLMepAAFpZFsiAFTim/6bN+hb04Iab3AAC3WUpw9NQwkN3qLMepyGFpZFsiAATim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMAAyGFpZFsiAFAAm/6bN+AA04Iab3vUC3WUpw9NQwkN3qLMepyGAAZFsiAFTim/6bN+hb04IaAAvUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04IaAAvUC3WUpw9NQwkN3qLMAAyGFpZFsiAFTim/6bN+hb04AAb3vUC3WUpwAAQwkN3qLMepyGFpZFsiAFTim/6bN+hbAAIab3vUC3WUpw9NQwkN3qLMepAAFpZFsiAFTim/AAN+hb04Iab3AAC3WUpw9NQwkN3qLMepyGFpZFsiAFAAAAAAN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hbAAIab3AAC3WUpw9NQwkNAALMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpAAsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMAAAAFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMAAyGFpZFsiAFTim/6bN+AA04Iab3vUC3WUpw9NQwkN3qLMepyGAAAAsiAFTim/6bN+hb04Iab3vUC3WUpwAAQwkN3qLMepyGAAZFsiAFTiAA6bN+AA04Iab3vUC3WUpw9NQwkN3qLMepyGFpAAsiAATim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMep","reverse":false,"order":{"count":479,"head":[0,46,69,92,138,161,184,207,230,10,33,79,102,125,148,171,194,217,43,66,89,112,135,181,204,227,7,53,76,99,122,145],"tail":[478,465,429,452,475,426,436,459,423,446,433,456,420,427,430,434,439,449,472,469,466,453,440,442,443,450,458,460,462,476,463,473],"sha256":"b4ee1e3419c749422709018665796869856869c7967f8b7ce4c33e7a1ad4790f"}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAABcAAAAAAAAAAAAAAAAAACTAACfAAAAAAAAAAAAAAAAAAAADUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGZAAAAGlAAAAAAAAAAAAG7AAAAAAHSAAAAAAAAIDAAAAAAAAAAI2AAAAAAAAAAAAAAAAAAAAAAKoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMSAAAAAAAAAAAAAAAAAAAAAAAAAAOIAAOmOwO3O/AAAAAAAAAAAAPQAAAAAAAAAAAAAAAAAAAAQPAAAAAAAAAAQ/AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAATSAAAAAAAAAAAAAAAAAAAAAAUUAAVBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAXhAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAaDAAAAAAAAAAAAAAAAAAAAAAAAAAAAbwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAdnAAAAAAAAAAdsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAfRAAAAAAAAAAAAAAAAAAAAhdAAAAAAAAAAAAAAAAAAiWAAAAAAixAAAAAAAAjqAAAAAAAAkGAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAm0AAAAAAAAAAAAAAAAnmAAAAAAAAAAAAAAAAAAAAAAAAAAAAqDAAAAAAAAAAAAqqq0AAAArAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAs0AAAAtoAAAAtwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0MAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA2KAAAAAAAAAAAA3MAAAAAAAAAAAA4CAAAAAAAAAAAAAAAAAAAA5X5aAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8eAAAAAAAAAAAAAAAAAAAAAAAAAA9gAAAAAAAA+NAAAAAAAAAAAAAA+3AA/ZAAAAAA","reverse":true,"order":{"count":581,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[550,551,552,553,554,555,556,557,558,559,560,561,562,563,564,565,566,567,568,569,570,571,572,573,574,575,576,577,516,578,579,580],"sha256":"6a64e15ebaa53ed57770483f7c01c50e0c6fcff4814f33342397fe5683269e00"}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAAAAAAAAAAAA//AAAAAAQDAAAAAAAAQDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQDAAAAAAAA//AAAAAAAAAAAAAFAAgCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAAAwBAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwBAAAA////AAAAAAAAAAAAAAAAAAAAAAAAAAAAAFwBQD//AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AAAAgCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgCgCAAAAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwBAAAAAA//gCAAAAAAAAAAAAAAAAAAAAQDAAAAAAAAAAAAgCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwBAAAAAAAAAAAAgCAAAAAAAAAAAAAAgCAAwBAAAAAAAAAAAAAAAAAAAAAAwBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQDAAAAQDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAFAAAAAAAA//AAAAAA//AAAAAAAAwBAAAAAAgCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAAAAAAAAFAAAAAAAAAAAAAAAAAFwBAAAAAAAAAAAAAAAAAAAFAAAFAAAA//AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgCAAAAAA//AAwBAAAAAAAAAAAAAAAAAAAAAAwBAAAAAAAAAAAAAA//AAAAAAAAAAAAwBAAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AA//AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AAAA","reverse":false,"order":{"count":625,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[593,594,595,596,597,598,599,600,601,602,603,604,605,606,607,608,609,610,611,612,613,614,615,616,617,618,619,620,621,622,623,624],"sha256":"c0aeb36b5622d40a879cfc72584363f3cc06cf8f39eb663bb2ffd95c80c0dd86"}},{"distances":"/+/7/u/n/U/U+2+0+y+u+H+D919n9g87878786828y8x8n8e8d8O8K8K8G797c7b7Z6/6/6662616x6v6v6r6n6U6T6M6L6D6A5v5u5b5X5P5O5I49484r4i4T4P4G3/3+39383m3h3O3K2/26252r2q2n2Z2O2N2J2A181s1B0/0o0k0e0b0b0E0Dz6z2zzzyzsznzFzFy6y4ywypyiyYyWySyPyDx4x3xyxyxxxTxTxQw6wvwpwWwTwRwHwCv+vqvjvivhvLvEvAuvurunuAt6t3txtstqtptRtFtCs/s5slsUsDr6r5r5ryryrsrbrHq5q4qvqnqbqaqZqXqUqHp9p5pspqpjpOo2o1otohogofoSoMoIn/n+n9nfnanZnUnRnKnFnDm4m4mVmJmEl9l0ltlrlplmlglalXlSlPlFlDk+kuktkpkRkJkGkFjojajTjRi9i7isipimigiMiIiEiDh/h4h1hvhkhUhKhHg/g8g0gLgFfwftfpfSfMfLexetepeieeeQeQd/d2dvdrdpdhdSdQdHdHc6cpcjcKb4bqbYbWbIbIbEbBbAa+a7a5a3aqahafacaZZ7Z1ZuZkZeZYZXZXZOZGZFYzYoYkYgYgYdYXYBYAXuXlXeXaXVXQXQXHW5WpWnWbWUWUWQWIWFV9VyVtVqVXVRU/U/U4UqUcUMUIUGUCT9T5TwTfTdTWTUTHTFS9S3SvSpShSUSPSAR8R1RtRqRhRPQ+Q9QTQCP9PsPrPXPVPUPTPBO3O1OnOaOLOEN+N+NyNwNwNqNjNgNeNQNNNIM6MnMfMRMQMPL9L1LZLZLULQLPLOLLLELCLBKnKkKfKOKGKBJ1JgJeJWJRJMJBI/I+IvIuIkIbH9HxHrHoHWHSHOHJHDG/G8G4G3GuGSGSGHGHGGF+F3FrFmFfFcFYFSFLFKEtEiEcEWESEJD/D8D1DyDqDnDlDiDiDeDQDKC/C5C2CzClCLCKB6BzBrBaBLBIBHA7A1AyAeAZASARARAQALAHAF","reverse":true,"order":{"count":510,"head":[0,1,2,3,5,4,6,7,8,9,10,11,12,13,14,17,16,15,18,19,20,21,22,23,24,25,27,26,28,29,30,31],"tail":[478,480,479,481,482,483,484,485,486,487,488,489,490,491,492,493,494,495,496,497,498,499,500,501,502,503,505,504,506,507,508,509],"sha256":"04203d7d34d73833fe45feb793d5300323e5dd4e6aeaeccaa040715ec32908a4"}},{"distances":"/h/e/d/b/V/T/O+i+e+F+E+C9y9h9f9e9S8w8K8E78707R7L7H6g6c6b6Q6Q6O6C6C5q5o5n5Z5I404w4o4F3i2l2O2H2F161W1Q1L1E1A0/0t0R0Gzyzjzey+ywytx8x4xqxixfxaxPw8wPwKv6vyvbvbvGucuOtttTtHtDs/spsKsFr8r8rzrvrtrPq7quqtqmqfqNqFqEp+pnpkpWozoxosoWoSoIoDoBoBn/nznznonfnbmdmbmGmCl7lslhlhlflJlElAksjljUjJjIjCimiliiididiaiRiPhSgrf8fWfRe+e1e1eyeleId/dwdvc7cbbPa8a5a3aZZlZeZXZMYpAAYbYPYDXsXnXVXUXLWZWMV0VmVcU2U1UtUdUbUNT+T2ToTnTJTFTCRyRCQpQkQfQYQSP4PyPuPcPYPJPCPBO7OeOZOXOMOFNrNUNKMwMiMWMVMPMJMCMBLrLmKtKqKhKZKRKKKEJ4JvI9I3IwIfIfIdIQH2HuHSHDHBG7G2GqGfGfGeGdFuFgFaFBD+DMDIDEDBC/CrCYCYBsANAM","reverse":true,"order":{"count":278,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,29,28,30,32,31,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,76,75,77,78,79,80,81,82,83,84,85,86,87,89,88,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,114,113,115,117,116,118,119,120,121,122,123,124,125,126,128,127,129,130,131,132,133,134,135,136,137,138,139,140,141,143,142,144,145,146,147,148,149,150,151,152,154,153,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,247,246,248,249,250,251,252,253,254,255,256,257,259,258,260,261,262,263,264,265,266,267,268,269,270,271,272,274,273,275,276,277]}},{"distances":"IIAAzpyu9OAAq1AAAAP04IMyAAqNAA","reverse":false,"order":{"count":15,"items":[0,1,11,9,13,6,3,2,4,5,7,8,10,12,14]}},{"distances":"AAAdAAB9CWAAC8AADTAAAAAAAAAAAAE4AAAAF0F0AAAAAAAAHhAAAAIeIfIiAAIvJNAAKSAAKhAAAALWAAL7NZNcNdAANmAAAAAAAAAAQAAAQcAAAARYAARfSFSXTFAAAAAAAATtUCUqAAVsAAWXWYW0XxAAAAAAAAAAY8Y+ZTZhAAaHaYAAAAa9AAAAbZbxcwc0AAAAAAdyd1d4eBeaenAAfZAAg8iTAAicipjKjNjnj7kFAAAAAAAAmPmWnInJAAn4n7oCoPogouAAAAAAAAqWAAqiAAAAAAAAAAAAAAAAtHAAu6AAvUvWvYAAAAxHxJxQxSxwxxAAAAAAAAyYy9zGzYAAAA0PAAAAAAAAAA1NAA1d1g1u1+AA3b354EAA5AAAAA5V5W5fAAAA6KAAAA6q6r6uAA8L8S8oAA9H9SAA+V+h+7/E/T/dAA","reverse":true,"order":{"count":221,"items":[0,2,5,7,8,6,4,3,1,9,10,11,12,13,14,16,17,20,21,22,23,25,26,27,30,31,33,35,37,38,40,44,43,42,41,36,45,46,39,34,32,29,28,24,19,18,15,47,48,49,50,51,52,53,55,56,58,63,64,65,66,70,72,77,78,79,80,81,86,89,90,92,93,98,99,100,106,105,104,103,102,101,97,96,95,94,91,88,87,85,84,83,82,76,75,74,73,71,69,68,67,62,61,60,59,57,54,107,108,109,112,119,120,121,122,123,128,135,136,137,138,139,140,141,134,133,132,131,130,129,127,126,125,124,118,117,116,115,114,113,111,110,142,143,144,145,146,147,148,149,151,153,157,158,164,163,162,161,160,159,156,155,154,152,150,165,166,167,168,173,174,176,177,178,179,180,182,187,191,193,194,198,199,201,202,206,210,213,219,218,217,216,215,214,212,211,209,208,207,205,204,203,200,197,196,195,192,190,189,188,186,185,184,183,181,175,172,171,170,169,220]}},{"distances":"AF//QDAA//AF//wB//gCAA//gCAAAAAAgCAFAAAAAAgCwBQDAAQDAA//AAAAAAAAAAQDAAgCAAAAwBAAAA//AA//AAwBAFAFQDAAgCAAgCAAwB//AAQD//AAAFgCgCwBAAQD//AAwB//wBAAAAAAAFAAwBAAAAQDgCAA////AAAFwB//AFAAAFAAAFAF//AFwBAAgCAFwBAAAFAAAAAAAAgCAFAAwBgCAAQD//////wBgCgCAAAAAAAAQDAAQDAA//AFgCQDQDAFwBQDAAQDgCAFAAAF//gCQDwBQDAAAAwBAAAAgCQD//wBwBAAAAAAAAQDAFAAAAwBAF//AFgCQDAAQDQDgCAAwBAFAAgCAAAF//AAAA//AAAAAFAFgCgCgCgCAAgCAAgCQDQD//AAAAAF//AAwBAAwBgCAA////QDwBwBgCAAgCgC//AFAAAF//AAAAAAwBgCAFAFwB//AAwBwBAFgCAFwB//QDAAAFAFwBAAAAAAgCwBAAAA//gC//wB//AFAAwBQDQDAAAFAAAAAAQDAFAAAAAAwBAA//AFwBQDgCAAAAAFAAAFAF//AAAAgCAAgCAFwBQDAA//AAgCQDAAQDAAAAAAAFwBAFwBQD////wBAAAFgCwBQDAAAAAFQDAF//AAAFQDAAQDgCAAAAgCAA//wBwBAF//AAQDAAAAAFAAAAAFAA//wB//AAQDAA//gCAA//AAAAQDAFAAAAQD//gCAAQDQDAAgCwBgCAAAAAFAAAFgCAAAAAAwBAAAFwB//AAwBAA//AAgCQDAFAAAAAAwBAAQDAAgCAAAAQDAAAAgCQDAFAAgCwBAAwBAAAAAF////AAAFwBAA//AFwBQDAFQDAAAFAAwBgCgCQDAAQDAFAAAAAFQDAFwBAAAAAAgCAAQDAAAAAFAFQD//AAAAAFwBQDwBAFwBQDAAAAAFgCgCAAAF//AAAAAA","reverse":false,"order":{"count":481,"head":[0,5,17,60,2,23,25,33,9,16,7,1,3,12,21,35,22,4,6,8,10,11,13,14,15,18,19,20,24,26,38,27],"tail":[452,473,474,429,427,433,435,438,436,440,443,444,448,449,450,451,453,455,456,468,460,461,462,464,466,470,471,475,477,478,479,480],"sha256":"03dd2d017bc26aa8eff1578b60467a2e43d527279c942c5fbaf5a62eaa665673"}},{"distances":"//QDAF//AAQDAFgCQD//QDAFAFQDgCAFQDQD//AFQDgCQDQDwBwB////gC//AFQDgC//AFwBgCAFAFgCwB//QDQD//wBQDAFQDAFQDQDgC//gCgCAFAFQDQD//AFwBAFgCgC//wBgC////gCQDwB//gCgCAFgCAF//gCAF//////AF//AFgCwB//wB//AFwBQDwBgCgCgCQDQDQD//////QDAFgCgCgCwBgCgCgCQDgCwBAFwBgCAA//gC//AFwBAF//gCQD//gCgCAF//gCgCQDgCQDwBQDgCAF//AFQDAFgCQDQDQD////gC//QDAFAAwBwBwBQDAFgCwBgCQDQDwB//gCwBAAgC","reverse":false,"order":{"count":177,"items":[2,6,11,12,15,19,30,34,37,38,1,5,8,10,13,16,17,20,22,23,31,42,43,7,14,21,28,32,36,39,25,35,40,0,3,4,47,49,56,57,61,63,77,79,82,86,88,94,108,119,126,128,96,101,102,103,107,116,131,98,99,100,109,110,111,113,114,115,117,121,124,130,133,134,90,92,95,97,112,118,120,127,91,93,104,105,106,122,135,145,147,149,159,165,46,48,50,51,58,59,72,139,141,143,148,151,152,153,158,164,169,170,52,54,55,64,65,68,71,75,76,78,81,89,137,138,140,144,150,156,166,168,173,176,24,45,62,67,73,142,161,162,163,167,171,174,9,18,26,27,29,33,41,44,53,60,66,69,70,74,80,83,84,85,87,123,125,129,132,136,146,154,155,157,160,172,175]}},{"distances":"AFAAwBgCAAAAAAQDAAAAAAAAgCAAAA//AAAA////AAgCAFAAAAgCAAAAgCAA//AAAAQDQDwBAA//AFgCAFAF//gCgCQDAAwBQDgCQDAAwBAAAAAFAAgCAFAFAAgCQDAAgC//AAAAAFAFwBAAwB//gCAAgC//AFAAwBgCAFgCAAAAAAAAAAQDwBAAAAAAAA//AAAAgCwBwBAAwBQDAAAAAAAAQD////AAgC////AAwBQDwBAA//AF//AFAAQDgC//AFAAwBAAAAAFAAgCgCwBwBAAgCQDAFAAAAwBQDAAAAAFQDgCgCAFAAAA//AAAAgCgCAF//QDAAAFAFAFQDQD////wBwB//AAAAQDgCAA//AFAAAAgCAAAA//AFgCwBAAAAAAAAAAAAAAQD////////gC////wBwBAA//AAAAQDAAAFAAAAgCAAwBAAQD////AAAAAAAAwBwBAA//AFAFAAgCAAAFQDwBwBQDAFQDQDAA//AF//AAQDAAAAAAgCwBwBAFQDAFQDAFgCgC////AAAAAAAAAA//////QD//AFAA//AAAFAAAAwBAAAAAFQDAAAAgCAFQDwBwBAAAFQDAAAF////AAgCAAAAAAQDAAAAAAwBwBAAAAAAAAgCAFgCAAQDAAAAAAAAAAAAAAAAAA//AFgCAA////AFQD//AAwB//gCAAAAwBQDQDAAAAAAwBAAwBAAAAgCgCgCQD////QDQDAAQDAAAFAFAAAFAAAAAAwBAAgCAAAAQDAAAAwBAAAAAFwBAFgCAAAAAAAAwBAFAAAF//////QD//AAAAAAQDwBAFgCQDQD//wBAAAFAAAAAFgCgC//AAAF//AAQDgC////AAAAAAQDAAAAAAQDAAAAgCgCQDAAAA//AF//AA//AA//AA//AAAAAAAAwB//AAAAAF//wBAAgCgCAAwBAAQDQDgCAAAAAA//AAQDAAwBgCwBAFAAgC","reverse":false,"order":{"count":487,"head":[0,1,7,3,2,4,5,6,8,9,10,11,55,58,59,48,12,13,14,40,15,16,17,22,38,34,45,50,21,28,57,18],"tail":[469,481,483,445,447,448,449,450,451,452,453,454,455,456,457,466,458,464,459,460,461,463,465,468,470,474,475,476,477,478,480,485],"sha256":"5e76c68ae31a94088156ab8d09b21dc699d37fc1dbe0ba335b3eb5ff0185e7bc"}},{"distances":"wBgCQD//wBgC////AFQDAFgC//wB////wB//AF//AFgCAAgCgC//QDwB//wBgCgC//AF//gCQDgCQDgCAFgC//QDwBgCAFQDAFQDwBQDwBgCgCgCQDgCwBwBwBAFQDAFgCgCAFgCgCwB//QDgCwBgC//QDQDQDQDwBgCAFAFQDAFwBQDwB//QDAAgCQD//QD//QDwBgCAF//wBAFwBAFAFQDgCwBgC////wBQDQDgCQDQDAFgCwBwBgCAF//AFQDgC//gCgCQDAFwBwBgCQDQD//wBQD//AFwBwBAFQDgC//gCgC//QDgC//gC//AFgCgC//QDQDgCwBgCwBQD//QD//gCQD//QDQD//////wBwB//gC//AF//gCQDQDAF//AFQDQDgC//wBQD////QDAFQDAFQDwBAFAFwBgCAFgC//gCQDQDgCAF//wBAFwBQDgCQDAFgCQDQDQDAF//AFgCgC////wB//AFQDwBQDQDQDQDAF//AFQDQD//gCwB//gCQDAFgCgCwBwBAFQDwBwB////QDQDQDQDQDQD//wB//gCAFQDgCAFAFwBQDQDAFwB//wBgC//wBAFAFwBgC//gC//QD//wB//wBwB//AF//gCAF//wBQDQD//gC//QDgCAF//wB//AF","reverse":false,"order":{"count":326,"items":[8,10,18,20,33,40,46,48,61,63,66,185,190,192,202,204,207,208,211,218,221,226,231,233,240,247,249,258,263,279,282,283,287,294,295,308,311,321,325,2,9,26,36,38,43,47,49,51,56,62,71,76,77,78,79,1,5,11,21,23,24,30,31,35,37,39,41,45,53,54,55,57,64,65,67,68,72,74,81,0,4,13,16,27,29,44,50,52,58,59,60,69,73,80,3,6,7,12,14,15,17,19,22,82,83,85,100,103,105,106,119,84,87,90,93,95,97,107,114,115,117,118,92,99,108,110,116,120,86,88,98,102,104,109,89,91,124,126,133,143,146,158,127,132,137,138,141,147,153,162,163,168,170,173,175,176,188,189,193,194,198,201,203,205,215,216,223,225,228,229,230,241,243,244,245,246,250,251,257,264,269,270,271,272,273,274,280,285,286,301,314,315,319,123,128,130,131,136,148,150,151,154,156,159,160,164,166,172,183,187,195,210,212,214,217,224,227,234,235,253,256,259,260,278,281,291,297,299,310,317,320,113,121,122,134,135,140,144,145,165,167,180,181,197,206,209,220,222,238,242,254,261,262,265,266,276,284,288,290,293,296,303,305,306,313,323,25,28,32,34,42,70,75,94,96,101,111,112,125,129,139,142,149,152,155,157,161,169,171,174,177,178,179,182,184,186,191,196,199,200,213,219,232,236,237,239,248,252,255,267,268,275,277,289,292,298,300,302,304,307,309,312,316,318,322,324]}},{"distances":"/s/W/G+9AA+1AA9+AA9l9AAA76AAAA7W7VAA62AA6m6eAAAAAA5rAA5gAAAA5Y5R5F5D424L313y3n3l3bAA3L2hAA2XAAAA11101rAA1eAA1WAA010y0x0r0kAA0j0SAAzGy8AAAAycAAAAxcw2wvwmwgAAAAwDvkvWvJu2ujAAAAAAtjtBscsOsKsGAArwrsAAAAAAAAqQqPAAAApVAAAAogoXn9AAmuAAAAlylplYlNlMAAkWAAjtjijTAAAAibiVAAAAAAhDg7gugpgnglgTAAAAAAfIe4e3e2AAd3ddAAdDdCc1AAAAAAAAAAAAafZhAAAAY4AAAAAAYiAAYfYeYJAAAAXlXiAAVvAAVoVSUwAAAAAAUBTxTwAAAAAASRSJR9ROQzQoQJAAAAAAPrPQAAOSAAONN/N6AAAAMbLUAAAAAAKoJjJdJXJTJLAAI/AAIoAAAAAAHrAAG+GqGjGQAAGPAAF6AAAAFaFZFSFKAAAAEmEjAAAADyAADCC7AAAAAACPAABjBOAAA2A1Ac","reverse":false,"order":{"count":267,"items":[33,32,31,30,27,25,21,20,18,16,15,12,10,9,7,5,3,2,1,0,4,6,8,11,13,14,17,19,22,23,24,26,28,29,66,65,63,62,60,59,58,57,56,54,52,50,49,48,45,43,42,40,39,38,37,36,35,34,41,44,46,47,51,53,55,61,64,67,68,69,70,71,101,96,95,93,92,91,90,89,88,84,83,82,81,80,79,76,75,74,73,72,77,78,85,86,87,94,97,98,99,100,102,103,104,135,134,133,129,128,125,124,123,121,119,118,117,116,115,112,110,109,105,106,107,108,111,113,114,120,122,126,127,130,131,132,164,161,160,153,152,151,149,148,146,145,144,143,139,138,137,136,140,141,142,147,150,154,155,156,157,158,159,162,163,165,166,167,168,169,203,202,198,197,196,195,194,193,192,188,187,186,182,181,180,178,176,175,172,171,170,173,174,177,179,183,184,185,189,190,191,199,200,201,204,237,232,230,224,220,217,205,206,235,234,233,226,222,221,219,218,213,212,209,208,207,210,211,214,215,216,223,225,227,228,229,231,236,238,239,240,241,266,265,264,262,261,259,255,254,252,249,248,245,244,243,242,246,247,250,251,253,256,257,258,260,263]}},{"distances":"5a2in2M6IeIbF0","reverse":true,"order":{"count":7,"items":[0,1,2,3,4,5,6]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAA","reverse":true,"order":{"count":24,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQw","reverse":true,"order":{"count":15,"items":[13,3,6,9,12,2,5,8,11,1,14,4,7,10,0]}},{"distances":"AWAkApA1CPCRCSDKDlDnEYEcEjEvEvEwE1FjGmG2HkHqIpIuIxAAJpKLKOKfKrKtK1K1K5LXLrLzMNM5NLNROvP0P3QLRHRPSFS0S9TsTuTvUCUOUqVBVgViVyV0WmX/YEYOYzaCaGakaoawbDbscRcWchckc+d0ePegeheqfDfJfXf/gPgehChDhnhxiDiPiQivjGjxkJkuk/AAlQlhmSmdm3nwnxnyn5odofoqpHpOpkqOqgrbrfrfrksBsKsLsNsStJtctntutwujupu2wWwpwqw8w/xlx6yhyyAA0d1J1q2C2Y2t2/3I3M3Q3/4m4tAA5a6B6X6k7O7Z7v8c9O+S+x+3/I/m","reverse":false,"order":{"count":176,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175]}},{"distances":"AIAJANAPARASAAAbAsAtA5AABKBNBUBZBgAABqB8AAB+B+CCCECGCKCRCTCdCgCvCzC2C+C+DGDHDHDJDpDsEDEJEXEbEeEfEqEyE2E8E9FBFGFLFOFOFVFWFZFbFbAAAAFmFrFzF7F+GEGGGNGOGbGnHAAAHMHUHWHaAAH3H6H7IBIKAAIPITAAIiImIqAAIuIvIvI4I9JLJUJVJXJYJYAAJaJfJhAAAAKPKPKUKUKcKdKiKnKuK0LGLKLOLSLfLfLiLjLjLvLyLzAAL7MGMNMNMRMcMeMpMxMyM1M3M5M6NBNCNENHNPNQNZNaNcNnNsAANxN5OPOUAAOfOkO0O1O2O7PCPDPIAAPRPWPlPmPmPrPyP/QCQEQJQOQTQWQiQmQtRBRBAARHRHRMRQRURgRmRvAAR3R6R7SFSMSOSPShSrSzS2S4S9TPTRTSTVTVTjTnTsT+UEUEULULUNUVUWUYUbAAUsU6U+U+VAVFAAVMVSVZViVlVnVyV2V6V6V6AAWJWMWYW4XRXTAAXlXmXwXxXzX1YHYXYcYeYeYhYlYzY2ZAZIZJZRZiZpZ2Z6Z8Z/AAaWaYapara1a2AAa+bDAAbIbPbQbTbTbXbkbsbvbzb+cQcScWcXcgcicrc1c2c6c/AAdGdPdXdZdadddldldyAAd5d9d9eAebelele0e+fDfNfZfbfhAAfwfzAAf5f5f5f9AAgDgDgEgNgOgXgagcgdAAg6hQhYhchjAAhwhxhyh1h2h4iLiLiOiRiZinipAAi0i1AAjAjPjcjdjkAAjqjvj0j5j6kEkTAAkXkmAAAAk4k5k7AAlElLlOlSAAlolvl/mMmNmPmQmUmXmgmjAAmomqmsmumym+nMnNnNnPnPnSnSncncnonsoCoFoGoJoKoQoRopotozpIpJpKpLpSpXpZpcpepfpjpkppptpvp+qMqVqcqorGrGrJAAr1sDsGsGsIsLsVsWsZsisjskssswswsys0s0s4s7s7s+tAtEtHtXtatctrtrt2AAt+uAuBuFuHuIuMuNuPuPuQAAuSuVuWububAAuiulutuwu8vBvIvPvUvVvXvYvjvmAAv5v9v/wEwGwdweAAwmwvw2xExQAAAAxdxfAAxgxmAAxsxyx6x7x9yQyTyeykynyoywy7zGzJzYzazdzjzmzozpzszsz00A0F0K0U0e0i0k0n0s0t0y090+AA1G1I1J1M1ZAA1b1e1f1r1s122C2DAA2J2N2R2U2X2Y2Y2m2o2x2125AA3BAA3G3Y3c3d3d3d3h3r3r3s3x3y324B4K4OAAAA4t4x414245465B5a5d5g5h5l5o5q5555586A6L6U6X6Z6f6m6m6m6w6y6y626363697D7E7R7V7X7c7r7z73777+8B8F8M8QAA8g8h8i8r8t8w8w8yAA9H9L9Q9XAA9k9398+B+D+G+I+M+O+RAA+d+e+0+5+8/E/G/L/O/Q/Z/e/i/rAA/w/7/8","reverse":false,"order":{"count":744,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[712,713,714,715,716,717,718,719,720,721,722,723,724,725,726,727,728,729,730,731,732,733,734,735,736,737,738,739,740,741,742,743],"sha256":"053d9f1827766e1c62294cce2ba0cd85f911e16c94fe575ee92730eb1748cb46"}},{"distances":"ylevTuIva8NstyPXQcOmcOJ/A/XsqXvle/CpXu/SjCs7ja2dxL3ceXfGlLgicTuOiehzhJh/k7kIHHfJLSnkTl0Y36","reverse":true,"order":{"count":45,"items":[19,44,25,23,43,0,24,15,31,6,21,14,41,28,36,37,22,20,32,35,33,34,29,39,27,16,1,26,30,10,4,18,13,2,42,8,7,9,5,40,11,3,38,17,12]}},{"distances":"FGHfHqH3H6IAKrNRNhP8QlRASoS1VtWsXdYWYoZwcBcQhEh8iUi/jFkolLoFqhr2shstswtAucv4wu0H4P4T7e7x8K+w","reverse":false,"order":{"count":46,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45]}},{"distances":"AAAAAAAAAAAAQDAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAAwBAAAAAAAAAAAAAAAAAAAA//AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAAFwBAAAAAAAAAAAAAAAAAAAAAAAAwBAAAAwBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AAAAAAAAAAAAAAAAAAAAAAwBAFAAAAAFAAAAAAAAAAAAAAQDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AAAAAAwBAAAAAAAAAAAAAAAAAAQDAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AAAAAAAAAAAAAFAAAAAAAAAAAAQDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAAAAAAAAAAAAAQDAAAAAAwBQDAAAAAAAAAAAAAAAAAAAAwBAAAAAAAAAAAAAAAAAA//AAAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAFAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwBAAAA//AAAAAAAAAAAAAA","reverse":true,"order":{"count":311,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273,274,275,276,277,278,279,281,280,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,298,299,300,301,302,303,60,304,305,306,307,308,309,310]}},{"distances":"/o/W/V/Q/M/G+ZAA9n9m9m9i9S8r8B75717p7M6y6I55525V5P5I4p4K4E39383g2s2K2H1815151X1X1V1S1K0z0S0Iz9z6z1zqzmzgy6ysyfxmxVxOw6wwwQwEv7vtu9u4u0uuufucuYuYuTuSuAtitetRtFs+s6s4s3sCr/rurNq6qqqeqWqVqNpppWpUo1oyoBnsmxmumpmZmYmHl9lVk+k1kvkWjJjGjDi5AAinieiRiHiAh8hwhohThFgugigXfifUe2ehegeUd2dsdndddTdIclcNbWa+awafaeaZaIaHZ5ZtZkZdZUZOZHY0YsYoYcYLYKYGXnXeXBW2WoVvU5UuUoUoUfUdT+T4TyTkTZS5SzSaSBRkRGRFRBQ+QoQRQAP6P5PrPPO4OpOgObOGAANNM9MtMfMcMGLyLZLBK0KsKhKUJuJpJfI+IdH4HxHVHOHOG/GnGhGCFoFeFcFUFQFKE5EpEBDzDTDQDOC9CpCOCBBUBTAvAAAO","reverse":true,"order":{"count":254,"items":[0,1,2,3,4,5,6,7,8,10,9,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,37,36,39,38,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,71,70,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,175,174,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,227,226,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253]}},{"distances":"gCwBgCwBgC//wBAFgCAF//gC////QD","reverse":false,"order":{"count":15,"items":[7,9,14,0,2,4,8,11,1,3,6,5,10,12,13]}},{"distances":"/uAANi","reverse":true,"order":{"count":3,"items":[0,1,2]}},{"distances":"AAAAAAEGFMF6GaAAHZAAHoAALmMyAAAANaAAAAPcAAAAR6SXSaULUlU4U7VRVmAAWPXoXtAAAAY/ZTAAAAZsaNAAduAAejenfvhzAAjJk6mEmNnOnzAAoiAAqNAArEAAAAAAtit3unAAuyAAvOAAv4wKxKAAAAAA1G1GAA182I5cAA5kAA5/6lAA7sAAAA9iAA+k/G/J/d/z","reverse":true,"order":{"count":102,"items":[0,1,2,7,9,11,14,15,17,18,20,21,31,35,36,39,40,43,45,49,48,47,46,44,42,41,38,37,34,33,32,30,29,28,27,26,25,24,23,22,19,16,13,12,10,8,6,5,4,3,50,57,59,61,63,64,65,69,71,73,77,78,79,82,86,88,91,93,94,96,101,100,99,98,97,95,92,90,89,87,85,84,83,81,80,76,75,74,72,70,68,67,66,62,60,58,56,55,54,53,52,51]}},{"distances":"AGAAAAAlAAAwA4AAAABNBOAAAAAAAABaBdAABmBxBzB0AAAAAACGAAAAAAC4C5C5C8C9DCDHAADXAAAADoAADyD1D3AAD+EHEHAAAAEUEVEYEgAAAAAAAAAAE8E/AAFIFJAAAAF2F8F+AAAAGRGcGgGlAAAAGyHGHMAAAAAAHVAAHqAAHvH0H2AAITIXIjIrAAAAJCJLJLJaJbAAAAJtAAJ1AAAAAAJ8KDAAKEAAKJKRKUKUAAAAKfKgAAKnAAKyAAK6LBLDLFAALQAAAALsAALyAAL6L8AAL/MDAAMMAAMbMkAAAAMwMwM3M9NKNPAANaAAAAN8AAOAODOLAAAAAAAAOZOjOzO6O7AAAAPNPNPRPVAAPePfPgPnAAP2QCAAAAQDQFQIAAAAQlQpAAAAAAAAQ8RARJRSAARrAAAASISPSQSUSUSYSiAAAAAAS1AATXAATdT3T8AAT8UCUMUNUOAAUSAAUcUdAAAAU1AAAAAAVYVZVaVcVcAAVfAAAAVhViVkVvAAAAV4AAV/AAAAAAWaWgWgWoAAWrW7W+AAXZXaXcXiXlXoAAAAXvX1X4X7YGAAYdAAYrAAY/AAZrAAZzAAAAaUAAAAajalAAamarawAAa8bAbCbLAAbObPAAbtbxbybyAAb3b5AAcBAAAAcVAAcncococ6c8dCdDAAdEdGdHdOAAdfAAdodrAAAAeaeaecAAAAepere9fAfHfJfKAAffAAfpAAf1gAgBAAgIAAgLAAgagmAAAAg9AAAAhGAAhShthuiCAAAAiKAAAAiViWiZAAAAAAAAAAixiyAAAAAAi6AAjOjUjaAAAAAAjzj0kVAAkbAAksAAk/AAAAlNAAlSAAAAliAAAAAAlnloAAmBAAmSAAAAmfmfmhmnmumwmynEAAAAAAnbAAn0AAoCAAogomAAAAAAo7o+AApKpNAApSpkplpspwpwpxAAAAp5qAqBAAqPAAqWAAqZAAqbqjqmAAAAq+q/q/AArIAArSrXAAruAAAAr0r+AAsHAAsPsQAAsTAAsaAAAAsoAAsxs0s5s9tCtEtGtGtItPtUtaAAtqtyAAAAuHAAAAuVAAAAupAAuvAAAAAAvAAAvGAAvMvNvOvPvPAAvTAAvaAAAAvqvsvxv1AAAAAAwQAAwdAAAAAAwwAAwyAAAAAAxGAAxVxWxbxlxoxrAAAAxvAAx1AAAAAAyCAAyGyRAAy3AAAAAAAAzPzZAAAAAAzlAAznzoAAAAAAAAAA0O0P0U0Z0ZAA0g0rAA0t0y0zAAAAAA1n1z17AAAAAA2XAA2zAA27293KAAAAAA3lAA3nAAAA3u3u3y3z374JAAAAAA4145AAAA5I5PAAAA5nAA5xAAAA6BAA6F6H6IAA6K6N6O6W6ZAA6mAA6wAA61686/7B7QAAAAAA70747576AAAA8IAAAAAA8V8Y8a8eAA8lAA8q8uAA8181AA9C9G9TAAAAAA9r9s9t+YAAAA+h+l+w++/CAA/J/O/V/d/n/q/z/1","reverse":true,"order":{"count":756,"head":[1,2,4,7,8,11,12,13,14,17,22,23,24,26,27,28,35,34,33,32,31,30,29,25,21,20,19,18,16,15,10,9],"tail":[754,753,752,751,750,749,748,746,745,744,743,742,739,738,737,736,732,731,730,728,727,725,724,722,720,719,718,717,713,710,709,708],"sha256":"8393e8eb0e89661133ad98b4159976b48cc5e7c7902b1eea14bf3fb50f994a09"}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwBAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAFAAAAAAAAAAAAwBwBAAAAAAQDAAAAAAAAAAAAAAAAAF//AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwBAAAAAAAAAAgCAAAFAAAAQDAAAAAAAAAAAAAAAAAAAAAAAAAAAAQDAAAAAAAFAAAA","reverse":true,"order":{"count":108,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,43,42,44,45,46,47,48,49,50,51,52,53,54,55,57,56,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107]}},{"distances":"AAAAAMAAANAAAWAAArAAAtA3A7A9BDAABFBJAABlAABzAAB6AACFCLAACUAAAAAAAACyAAC/DJDODQAAD0D6D+EAAAAAEMAAAAEeAAAAEoAAAAAAFBAAAAFKAAAAFXFaAAAAFkAAAAF2AAAAGBAAGdGhGpGtG8AAHJHQHQHTAAHTHVHXHeAAHoHuAAH3ICAAAAIOAAAAIbIfIgAAImIvIwAAI2AAJLAAJkJnJnJsAAAAKRKXKZKbKdKkAAKsK3LALBAAAALMAALVAAAAAAAAL4AAMBMIMJAAMKAAMbMcAAAAMmAAAANDAANKAAAAAAAAAAOAAAOTOWOfOiOrAAOuOwAAAAO5O8O/AAAAPHPHAAAAAAPjAAPpPyAAP+AAQeAAAARDAAAAAARfR7SCSLAAAASTAAShAAAAAAAAS/AAAATGAATRTTTaTsAATxAAAAAAAAUMAAUSAAAAUVAAUfUmUxU0AAAAAAAAAAAAAAV7WEWFWJWPWQWYAAAAAAWbAAWuAAAAW+XFXOXPXbAAXwX6X8YJAAYjAAAAZDZFZRAAZaZfZkAAZ1AAZ8AAAAaIaJaSaTaVaXaYapaqasa1a1a7a7AAAAbDAAAAAAbpb3b+AAAAcHAAAAchAAcqczczc/AAAAAAdkdzd0d8eQecAAeqeufCfKfMfnAAfufvgGAAAAAAAAgnAAg1g/AAhBhChHhVhbhuh2AAiBiIAAAAicijioAAAAAAjLjUjVAAjZjjAAjzj8j+kAkCkDkRAAkgAAkmkqk9k+k/lDlFlHlPAAlfllAAmFmImYmeAAmqmqAAm4AAnKnfnfntnvn2n4oGAAoRoUAAAAolorosovAAo7AAAApIAAAApOAApbAApipnpvAApwpxpxAAp8p9AAAAAAqoAAqzq0AAAAAAAArDAArYrbrbAArergrirkAAAAr8AAAAsVsfAAsqs+AAtAtEAAAAtrt1AAt8uHuSubugAAAAuxAAu9AAAAAAvXvXvjwJAAAAwRwRwhwrAAw2AAAAAAxOAAAAAAAAAAxhAAAAAAxyAAx9x/AAAAyVyeAAAAAAy4y4y8y9AAAAzSAAzqAAAA0O0R0XAA0jAA0n0qAA07081A1RAAAA1i1uAAAA2E2M2W2a2b2d213HAA3a3d3i3kAA3o3u31AAAA4Q4T4TAA4W4dAA4m4n4z44455JAAAA5Q5j5m5m5p5vAA5zAA6B6G6M6R6TAAAAAA6q6u6vAA6163AAAA69AAAAAAAA7VAAAAAA7f7hAAAAAAAAAA8H8N8SAA8pAA8vAAAA879F9KAA9O9OAA9cAAAA+O+W+b+eAA+x+yAA+4+9/D/PAA/S/dAA/0AA","reverse":false,"order":{"count":674,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[642,643,644,645,646,647,648,649,650,651,652,653,654,655,656,657,658,659,660,661,662,663,664,665,666,667,668,669,670,671,672,673],"sha256":"9aa5c9e871f03ec898f68f23225b689ce1605d6605d1f6c326313553042f69fb"}},{"distances":"AGAHAIARAAApAAAAAAAAAABDBIBLBMBTBVBZAAAABmBtAABvAAAAB7B+AAAACiCnAACqCwAACyCzAAC2C5DFAADKDMDNDQAAAAAADeDhAADrAAAAD9D+EDEFAAAAEcEgEgAAEkAAAAE/FAAAAAAAFRAAFWFaAAFlFuF7GJGKGRAAGZGiGlGoG6HBAAAAH2AAIEAAAAIgIqItIwAAI5I6I/JGJPJPAAAAAAAAAAAAAAAAJ8KBKDAAKJAAKYAAAAAAKtAAAAAAK+K/AALKLPLsLtL0MBAAMDAAAAMUAAMcMiAAAAMwAAAAM9AAM+AAM/AANENUNWAANeAAAAN4AAOLONAAOUOiOkAAAAAAOyO5O/AAPCAAPFPMAAAAAAPiPxP3AAP6P9P/P/AAAAAAQSAAQfQhAAAAQsAARNRPRsRtR2AAR9R9SBSFAAAASISLSXAASfAASoSuSvAAAAS8AAAATOTYAATdAAAAToTpAAAAAAUSUVUiUkAAAAU9VBVDVEVLVOVOVSAAVbAAViVkAAVwV6AAWCAAWFWFWFWKWUWeWlAAW1AAW6XLAAXPXUAAAAXkXuAAX1AAAAAAYGYJYJAAAAYMAAYaYiAAAAAAY8AAZIAAZXAAAAZmZnZnZqZwZyZ2AAZ6Z+aAaBAAaNaPaQaRaUaaahAAAAAAAAara1AAa9bKbMbQbSAAbZbdbnboAAbzAAb+AAAAcCcDAAAAAAcNcQAAAAcZAAchcwcxcyAAc0AAc4c+AAc/AAdDAAAAAAAAdkAAAAdwdyd0d0AAd5AAAAd/eLAAeRegAAAAAAe9AAfJfNfPAAAAAAAAfwAAf0f1f+gIgIAAgJgTgWgZAAgqgtgugwgxAAgzg0g8hEhFAAhQAAhahjhkhnhsAAhzh7AAh/iEiGicifijAAiuizi1i1AAi5i7jEAAAAjRjWjWjZAAAAjhjmjnjuAAkOAAkRkWAAkbkqAAkuAAk5AAk+lHlKlTlZldlklnlplxl0l1AAl3AAAAAAAAmZAAAAAAAAm5AAAAnRAAneAAnininkAAntAAn5n+n+oCAAAAoRoSoVAAoiokomAAAAo2AApHpNpNpQpRpSAAAApsAAp4AAqLAAqfAAquqyqyAAAArKrPAAAAAArqr1sAAAAAsCsEsIAAAAsaAAstAAs3AAAAtHAAAAAAAAAAtntntptxt1t/uFuPAAAAAAAAudAAuluvuwAAu4u9AAAAvNvbvdvivmvoAAAAAAAAwYAAAAAAwhwnwtwzAAw5w7xGAAxKAAxNxXxbAAAAxfAAxqAAyDyFyIAAAAyozGzLzXAAAAzvzzz0AAz6z90C0DAAAA0M0W0ZAA0g0hAAAA0y07081G1TAAAAAA1a1b1kAA1r1s1013162H2JAA2L2R2TAA2g2k2l2qAAAA24AA3EAAAAAA3jAAAA3436393+AA4F4M4R4bAAAA5WAA5pAAAAAA596FAA6JAAAA6hAA6l6lAAAA637FAA7G7VAA7f7rAA758H8K8TAAAAAAAA8u8v899B9D9KAA9gAA9o9q9tAA+C+FAA+M+S+Y+fAAAAAA+wAA/A/D/FAA/X/e/l/mAAAAAA/zAA/9/+","reverse":true,"order":{"count":800,"head":[4,6,7,8,9,10,18,19,22,24,25,28,29,32,35,38,42,46,45,44,43,41,40,39,37,36,34,33,31,30,27,26],"tail":[787,786,785,783,779,778,777,776,774,773,771,770,769,767,765,764,763,762,761,760,755,754,753,752,750,793,794,795,797,799,798,796],"sha256":"ae3235d3dc350576876601aef4facbe75af712c2bb365c7218538c7c81b56a82"}},{"distances":"/i/P3MhuffT1ScQ+MmHFAk","reverse":true,"order":{"count":11,"items":[0,1,2,3,4,5,6,7,8,9,10]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA5eAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA2gAAAAAAAAAAAAAAAAAAAAAAAAAAz/znAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAArFAAAAAApJAAAAAAAAAAAAAAAAAAAAAAAAAAAAlDAAkgAAAAAAjsAAAAAAiwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAdiAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAASFAARVAAAAAAAAAAAAQjAAAAAAAAAAN3AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAI0AAAAAAAAINAAAAAAAAAAAAAAFZAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":240,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239]}},{"distances":"AAAAAAAAAAAAVnAAAA","reverse":false,"order":{"count":9,"items":[0,1,2,3,4,5,6,7,8]}},{"distances":"F2IJQFSuXcaWdBfssBwA1U6Y","reverse":true,"order":{"count":12,"items":[11,10,9,8,7,6,5,4,3,2,1,0]}},{"distances":"AHAAAAAAAAB0B8CPCsCsAAAAAAAADUAAAAAAAAAAAAAAAAAAEjAAAAAAEqAAAAAAAAAAAAAAAAAAAAFyAAAAAAAAAAGfAAAAG2AAAAAAHHAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALFAAAAAAAAAANRAAAAAAAAAAAAAAAAOdAAAAAAAAAAAAAAAAQXAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUkUuAAAAAAAAAAAAAAAAWgAAAAWvAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAdkAAAAAAAAAAAAAAAAAAAAAAfCfKfxAAAAAAAAAAAAAAAAAAhTAAAAAAAAAAAAAAAAAAizAAAAAAAAi+AAjHAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAmdAAmlAAAAAAAAAAAAAAAAAAAAAAAAAAAApjAAAAAAAAAAAAAAAAAAAAAAAAAAAArpAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAtlAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAv/AAwWAAAAwjAAAAAAAAAAAAAAAAAAAAAAAAx9AAAAAAAAAAAAAAAAzOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA2OAAAAAAAAAA2p3CAAAAAAAAAAAAAAAAAAAAAAAAAA4z5JAAAAAAAAAAAAAAAAAAAA6OAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8+AAAAAAAAAA9lAAAAAAAAAAAAAA+XAAAAAAAAAAAAAA/gAAAAAA","reverse":true,"order":{"count":445,"head":[195,9,0,1,2,3,4,8,7,6,5,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30],"tail":[413,414,415,416,417,418,419,420,421,422,423,424,425,426,427,428,429,430,431,432,433,434,435,436,437,438,439,440,441,442,443,444],"sha256":"220b0c588b17dd24dd0872b267f59f79025f6cd83466d197c9111a4ac61a58ac"}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTiAA6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/","reverse":true,"order":{"count":164,"items":[151,105,82,95,108,85,98,117,128,59,36,13,141,118,72,49,26,3,154,131,62,39,16,144,121,75,52,29,6,157,134,111,88,65,42,19,147,124,101,78,55,32,9,160,137,114,91,68,45,22,150,127,104,81,58,35,12,163,140,94,71,48,25,2,153,130,107,84,61,38,15,143,120,97,74,51,28,5,156,133,110,87,64,41,18,146,123,100,77,54,31,8,159,136,113,90,67,44,21,149,126,103,80,57,34,11,162,139,116,93,70,47,24,1,152,129,106,83,60,37,14,142,119,96,73,50,27,4,155,132,109,86,63,40,17,145,122,99,76,53,30,7,158,135,112,89,66,43,20,148,125,102,79,56,33,10,161,138,115,92,69,46,23,0]}},{"distances":"18F2mxtWAAX3AA/F6Qz38bnBmR","reverse":true,"order":{"count":13,"items":[4,6,7,10,8,0,9,3,11,2,12,5,1]}},{"distances":"oy","reverse":false,"order":{"count":1,"items":[0]}},{"distances":"FAdToA53BDY1B9oMwgzpcpS5z2x5RSkGlYIDfstCDmcQnSPPB4AY+RQGfYv/H+bM8AHkxBofGbWLRYK7mb08ZKPX0JakDVMkGd2OmqvwgQdlazXg60AN9ivS/GfnIwYrjI5y9Ncc","reverse":true,"order":{"count":68,"items":[60,26,58,66,32,56,3,65,49,41,44,12,9,13,34,8,29,51,59,19,35,7,2,22,50,40,16,15,64,52,18,61,28,53,1,10,67,21,31,54,45,42,5,63,55,37,11,38,14,27,43,23,47,39,62,17,30,33,48,36,0,20,46,6,24,4,25,57]}},{"distances":"AATi","reverse":true,"order":{"count":2,"items":[0,1]}},{"distances":"56+simoh3ipYBihitjozpz1MguqY0feEXTqmfTzSSjDmudYTB6FBAIJbHQFizTwiV7NGsiepvVna/TNemFoHHZQf6iNYa8gH1eDC7K/wkZvPenuig/+k5hb+RjLXhcob+GkKmbIB140ZRI4nWeoqK4sKHyUZo6pOJdywSVlJqzSufle8fttQQdz1Z1vZhTBgNXUGPYE8SU7Gd3m3fimlrBUDdhEzKxWTpdiEfd3f/cqjBiPG/m0n0F++GvOex8zVlAjgt9XgXkiuHsNuUe1C9jGBR5FQUxla/IqvVEuLhqRIbzPCknkWmnN8qnbifKa8M8rF1YNBxDg5WJkkJgX6e8CQ3V2kUey5Ffo91OKsvK","reverse":false,"order":{"count":181,"items":[26,95,6,118,24,171,49,21,109,99,25,141,176,29,139,124,28,42,134,76,67,27,80,168,179,110,74,61,160,163,33,96,45,39,135,155,125,151,119,98,90,43,70,149,60,140,100,82,20,85,107,97,77,136,174,142,146,32,166,111,72,16,131,132,169,23,92,46,159,157,150,59,108,102,15,54,35,87,170,158,18,114,104,86,88,47,12,165,56,94,62,7,148,113,2,133,129,65,153,52,167,152,128,83,143,40,66,105,154,103,37,41,63,3,73,9,78,177,79,5,112,10,13,117,17,156,145,84,106,161,75,34,89,8,130,147,22,55,180,53,36,93,31,164,126,81,175,19,30,127,91,122,69,14,121,137,11,178,162,48,68,173,172,115,4,71,58,0,44,101,50,138,64,57,1,123,144,38,116,120,51]}},{"distances":"6dzCmofoYYO0Bu","reverse":false,"order":{"count":7,"items":[6,5,4,3,2,1,0]}},{"distances":"//AFQDAAAAwBAFAA//AAAAAAAA////wBwBwBQDwBAA//////wBQD//AAAAQDAAgCAFAAAFAAAA////wBwB////AAAAAAAAgCAAwBAAAAAAAA//AAQDAAQDAFAFAAgCAFAFAAAF//wB//wBAAAAAAAAAAAFAAgCwBAAQD//AAAAAAAAgC//gCAAwBAFAAgCAAgCAFgCgCAA//AAAAAFgCAFwBwBAFwBwBAFAAwB//AAQDQDAFAA////wBQDgC//QDAAQD//AAAAwB//QDwBAAAA//AAQD//gCAAAAgCAAQDAAgCwBAFAAAA//AAwBgCQDwBAAAFAFwBQDQDAFwBQDAAwB//wBAFAAAAAAwBgCAAAAQDQDgCAFgCQDgCQDAAgCAAAAAAAAQDAAgCwBAAgCQD//AFwBgCAAAFAAgCQDwB//AAQDAFAFQDAA","reverse":true,"order":{"count":220,"items":[0,3,4,7,8,9,10,11,12,20,27,28,30,33,35,36,42,41,38,37,26,23,22,21,14,13,40,39,24,19,17,16,15,5,31,29,18,2,34,32,6,43,44,45,46,47,48,49,25,1,50,51,52,53,54,55,57,61,65,71,72,73,74,75,77,79,78,80,82,81,83,84,85,86,90,93,95,100,101,88,69,67,91,102,103,108,107,70,68,105,99,98,96,94,89,87,62,58,56,109,106,104,97,92,76,66,64,63,60,59,113,116,120,128,131,132,133,137,138,139,140,142,134,130,126,122,121,115,136,123,114,111,110,125,135,129,127,124,118,117,119,144,145,147,149,153,154,155,156,161,164,160,157,151,158,150,146,143,159,148,141,163,162,152,112,170,172,173,171,168,175,176,177,180,181,190,192,193,194,195,197,200,203,207,209,213,212,205,199,178,210,206,201,198,191,188,186,184,179,202,204,214,218,215,211,196,189,187,183,182,169,166,165,217,216,208,185,174,167,219]}},{"distances":"+m5I2tuzranynpi1bKWfK6HgHVDECb","reverse":true,"order":{"count":15,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14]}},{"distances":"fAQuQmqiiA/tFfdsuehUO4D+mXYhxKkG0fsr2P7/HZn+XWAJ7aXxU9EvzEGLhBFYUXoLzvAAKe6t4a0LwAFeyesQSc+3mZJOHvW2AAN/zv2AIV6IKcAAoo9m9dN8AAdCKn6uV9ckIYKmzrZeL789pLAAmZAAGPAAAAzZjHxTiMluAAc6mdVJUmXWdRWU9koxabONossm1D/d04CtYh2Com2faXyz8yu4KfuTb224AAchRZlUjuFbuXhOAXd2CpP6zEAAFpgmeFF2HmYIR0eq40JTp1PdzfmzcdAAvAZUAAgWAAAANG7cNr9kznaVAAljqoApRpzZJlTOLRJpnNaXhjOd35mTavQiCMxKPrBpsXAA7ku96vYv1ufc8cDrSRAAg/KXE+FyYlgyvCKMw4wuWBSOAAAATDO2AASFuxCbAAOcoVZrzbAAUWFEh6+nGRAAxzmL7i2fTySU2IAAybE/0n6q0ofPCbI5qKfvHk5F93qgAAqilJuXqxAAB9AAaLvGfJpFAAeVI6BlAA3OG8JusEAApBk3BwtZE0pkDKCJRc74zl0AvpRkr9B5/TEmL2y15y48LYToD9aDk84G7RcTGXo1JF1Ucb0e9cVwaYst/ZYBv/nc0lpTKRYCG+IW9En9GDKZXNAAx+GHAAxVSAF+s/BVRbAAd1vjylj0Q3vP2QAAoteZ17M3X4E3CXg7MWP/khJLAA5cAAB/aUTjv4XgpzE+ZOeUKYUhAdf3kWIMAAAAEuqnAAsUNVDftBAAAA1ubcI5hA0ICPuT6Q4FDnu5zwEu","reverse":true,"order":{"count":396,"items":[5,101,19,35,45,24,37,38,18,16,39,34,28,42,14,40,8,17,43,3,33,21,12,15,4,9,30,0,7,13,25,22,26,32,44,1,2,10,36,20,29,6,41,31,27,11,23,50,57,59,60,62,73,65,55,53,52,70,74,58,75,76,46,77,79,80,83,86,94,110,116,129,138,115,107,105,100,102,142,128,109,111,122,113,99,140,98,106,143,119,120,123,131,137,132,125,117,144,114,96,108,104,135,136,118,127,141,97,112,139,134,133,130,121,103,126,124,145,148,150,151,155,158,181,188,182,153,184,172,186,156,163,81,177,146,183,180,160,95,168,88,173,85,159,82,84,170,149,174,169,157,147,165,190,175,178,191,192,187,92,63,87,67,71,185,91,49,93,66,89,90,162,171,51,61,154,152,72,166,64,69,56,193,167,164,47,68,54,48,78,195,194,189,176,179,161,204,205,208,212,217,221,223,231,308,244,304,318,226,296,235,243,227,230,301,236,234,312,303,216,232,224,200,201,198,210,245,240,214,225,220,197,241,237,215,196,202,218,228,206,229,203,209,207,213,199,239,242,222,219,233,238,211,246,251,253,258,262,267,284,277,288,289,295,263,279,278,287,280,255,249,271,266,282,250,247,273,257,268,248,294,269,256,259,254,293,291,281,276,286,290,265,260,264,272,285,292,274,275,252,283,270,261,323,324,326,333,340,336,327,310,335,341,344,339,330,307,313,299,342,319,311,337,343,334,302,297,306,315,309,322,305,328,332,338,345,321,314,300,317,316,298,325,320,329,331,354,355,356,372,373,376,381,382,390,391,383,387,394,360,393,389,380,377,375,362,352,370,386,349,369,365,384,358,364,346,361,367,359,351,378,350,366,353,385,371,363,347,395,374,392,379,348,388,357,368]}},{"distances":"ANA4BJBVBwDSFsF6HJISI6I6JOJOKwK2LFLHLHLhL7MWMYMcN9P9RRR3SaTgToTvVfViWSWuXVYEYNYNZOZQdpfHfLgggigvg7hvj1kOkmmmm/nXnto0pRpeqTq7tStdtmuJvkv1v+wIxDyJyMzSzc0i2R3C3+4p4q5A506j6u8J8T8X8d8g9O/Q/u","reverse":true,"order":{"count":93,"items":[92,91,90,89,88,87,86,85,84,83,82,81,80,79,78,77,76,75,74,73,72,71,70,69,68,67,66,65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0]}},{"distances":"AHAQAZAbAbAgAvAzA2A2A8BBBUBZBoBpB6CGCOCQCUCXCkDADFDJDRDRDVDeDvEAEFERESEaEeEgEjEyE4FJFVFbFcFdFkF0F6F7F+GKGMGWGiGkGnGnGvG7G+G/HBHXHYHiHmHtH1H5IGIIIRIRIgIrI7JBJQJiJ0J1J3KAKBKCKEKWKWKYKiKtK0LELPLQLSLiLpLtLuL2L3L4L/MGMGMIMUMxM4NDNPNRNZNnNoNrN2N7N+N/OEOEOGOQOYOcOiOtOvO6PDPjP2P4P7P9QAQOQYQfQjQuQyRARBRERPRWRaRkRmRpRqRzSASJSRSUSXSeSsSuS8S/TATBTETITNTOTXTbTiToTrTyT9UCUEUFUVUbUeUmUoUsUtUuU/VMVNVbVfVfVgVlVyV2V9WIWNWNWhWhWlWnWpWvWwW0W+XEXEXGXjXjXoXxXyXyYAYXYeYgY1Y4Y+Y/ZQZhZsZuZ0Z6Z6Z9aBaFaMaSaTaTaTala5bDbHbLbabobwb5cHcIcMcQcRcacechcoctdBdHdKdLdPdRdTdVdZdZdcdgdieAeEeGeVereweye0e2fBfCfGfOfPfgfgfkfkf3f+gIgkgngrgyg4g8hLhYhYhZhhhjh0h3h7iSifikiqiriujBjHjajkjvj2kSkTkZkbkekfkhknkxk4lblclclxl1l7l+mEmFmNmdmemhmkmmmum+nGnLnOnUnUncnknqn0n4n5n9n+oMoNoPoWoYogojoopJpKpLpop8p9qDqHqLqNqPqPqQqcqpqvq0q2q5rHrNrPrbrxrzsBsDsPsismszs6s8tJtZtjtttut3t5t6uBuJuPuWuaubucudujuououpu8vGvQvUvfvqvsvzv1v4wBwEwJwKwPwPwRw1w1w2w3w6w/xBxFxNxQxUxhxuxzx4yHyIyKyNyOyhyiytyyyzzAzJzOzVzozpzqz4z5z8z+0F0G0N0f0i0m041R1V1p1u1x162B2K2S2U2W2Z2e282+2/3N3U3V3h344I4J4b4e4r464+5I5b5d5k5r5y5055565+6N6O6P6V6Y6c6e6f6l6m6q6u6+6+6+7A7F7R7U7m7578787/8M8M8V8b8d8n8q8v8w81889G9K9N9T9V9b9m9r9u9u9u9x909++P+V+W+Z+d+j+l+m+p+y+1+1+9/D/D/I/e/k/1","reverse":false,"order":{"count":592,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[560,561,562,563,564,565,566,567,568,569,570,571,572,573,574,575,576,577,578,579,580,581,582,583,584,585,586,587,588,589,590,591],"sha256":"64c12c5d336ed2b30f86b07f7329cb7c1c526f5966346476cfc1ffa95d9d28cc"}},{"distances":"AAAAAAAAHcIOAAAAAAAAAAAAAAAAAAAAAAAAAAXPAAAAAAAAAAAAAAAAAAAAAAAAisjfjnAAAAAAAAAAAAoqAAAAAAqeAAAAAAAAAAAAAAAAAA0PAAAAAA4cAAAAAAAAAAAAAAAA","reverse":false,"order":{"count":68,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67]}},{"distances":"AAAAAAAAAAAUAAAAAAAAAAAAAwAAAAAAAAAAAAAAAABXAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEDAAAAAAAAAAAAAAAAFcAAAAAAAAAAAAAAAAAAG4AAAAAAAAAAAAAAHhAAAAAAAAAAAAAAAAAAAAJKAAAAAAAAJyAAAAAAKGAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAL7AAMBAAAAAAMVAAAAAAM4AAAAAANUNaAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQuAAAAAARYAAAAAARzAAAAAAAAAAAAAAAAAAAAAAAASwAAAAAAAAAAAAAAAAAATxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAVSVWAAAAAAVtAAAAAAAAAAAAAAAAAAWpAAAAAAAAAAAAAAAAAAYeYiAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAdIAAdVAAAAAAAAAAAAAAAAAAAAAAAAAAAAe1AAAAAAfGAAAAAAfRfUAAAAAAAAAAAAAAAAAAAAAAAAAAgpAAAAAAhLAAAAAAhXAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAjVAAjYAAAAAAAAAAAAAAAAAAAAAAkgAAkrAAAAAAAAAAAAAAAAAAAAAAAAAAlTAAAAAAAAAAAAAAlqAAAAAAAAAAAAAAAAmXAAAAAAAAAAAAAAnAAAAAAAAAAAAAAAnbAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAApXAAAAAAAAAAAAAAqjAAAAAAAAAAAAAAAAAAsYsfAAAAsxAAAAAAAAAAAAAAAAt+AAAAAAAAuxAAAAAAvCAAAAAAAAAAAAAAAAAAAAAAAAwtAAAAAAAAAAAAxQxTAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAzJAAzSAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA1NAAAA1hAAAAAAAA18AAAAAAAA2eAAAAAAAAAAAAAAAA3mAAAAAAAAAA4kAAAAAAAAAAAAAAAAAA5VAAAAAAAAAAAA6EAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA70AAAAAAAAAAAAAAAA8uAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA/aAAAAAAAAAA","reverse":true,"order":{"count":638,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[606,607,608,609,610,611,612,613,614,615,616,617,618,619,620,621,622,623,624,625,626,627,628,629,630,631,632,633,634,635,636,637],"sha256":"f084c9cfe7c04e66a34451b3e11a6b1a0d3dc80331e017e38db3b1b5e6c6bbc6"}},{"distances":"AAAAAAAAAFAAAFAAAAQDwBAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAwBAAAAAAAAAAAAAA//AAAAAAAAgCAAAAAAAAAAAAAAAAQDAAAAAAAAAAAAAAAAAAAAwBAAAAQDAAAA","reverse":true,"order":{"count":65,"items":[0,1,2,3,4,5,6,7,8,10,9,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64]}},{"distances":"OC1GFHLGESShUy8M9dviDNY6vYf3K9SPzdKY0eR6YS8RLWy2vy9Ue/6kOYAmpO6P4mFvKT+RLLsncpHTZJ6YOOnLgzZ96JCmTTjbHxTTJS0Zl8l0miiTRKylywAA1HCEENOv/hshgeIg/PEa8d2XJEw+Iz01DkX2ePKzp2SuYMY7oD7qAa4QWDinkFzQfQKTaRTTn8H5+Oem0utbPE2gJgbfJoq5757aga1tRU8XfRO8dOOOHtSqKR2Rkp831e27","reverse":false,"order":{"count":128,"items":[29,63,47,10,4,2,33,39,50,52,34,17,14,3,36,22,0,42,28,58,19,15,5,48,51,6,20,11,40,45,38,26,13,44,57,49,55,54,56,43,30,37,12,9,24,59,60,23,16,53,18,1,62,32,46,31,41,27,7,21,25,8,35,61,88,78,64,71,120,99,69,76,74,106,108,122,95,81,119,65,117,104,114,121,83,97,90,79,84,85,96,107,118,80,101,94,116,112,68,91,92,124,98,86,82,109,67,103,75,93,102,77,126,113,123,73,105,127,89,111,87,110,115,72,125,100,70,66]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQ3AAAA","reverse":true,"order":{"count":24,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAAQDAAAAAAAFAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQDAAAAgCAAQDAAAA","reverse":true,"order":{"count":59,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58]}},{"distances":"AFAAAAAAN+hbAAAAAAAAAAWUAA9NAAkN3qLMAAyGFpZFsiAFTim/6bN+hbAAIaAAvUC3WUAA9NAAkN3qAAAAyGFpZFsiAFAAAAAAAAAA04AAb3AAAAWUAA9NQwkNAAAAepAAFpZFsiAAAAm/6bN+hbAAIab3vUAAWUpwAAQwkNAALMepAAAAZFsiAAAAAA6bN+hb04IaAAvUC3WUAA9NQwAAAALMepyGAAAAAAAFTim/AAAAhb04Iab3AAAAAApw9NQwAA3qLMepyGFpZFAAAFTim/6bN+hb04Iab3vUC3WUAAAAAAkNAALMepyGFpZFsiAATim/6bN+hbAAIaAAvUAAWUAA9NQwAAAALMepAAAAZFAAAATim/6bAAhbAAAAb3vUC3AApw9NQwAA","reverse":true,"order":{"count":200,"items":[1,2,3,5,6,7,8,9,10,12,13,14,18,26,29,31,35,36,37,39,16,19,32,22,38,4,40,41,42,45,25,15,28,44,21,34,11,24,27,17,30,43,20,33,46,23,0,47,48,49,50,51,52,53,55,56,58,59,62,63,65,69,70,72,75,78,79,82,85,88,89,92,93,94,95,98,91,68,81,71,84,61,97,74,87,64,77,54,90,67,80,57,83,60,96,73,86,99,76,66,100,104,107,108,112,113,114,118,119,124,125,126,128,105,130,137,141,131,144,121,134,111,147,101,127,140,117,143,120,133,110,146,123,136,149,103,139,116,129,106,142,132,109,145,122,135,148,102,138,115,150,151,152,154,157,161,167,169,171,173,174,176,177,180,181,183,184,188,190,191,193,195,197,187,164,170,160,196,186,163,153,189,166,179,156,192,182,159,172,185,162,198,175,165,178,155,168,158,194,199]}},{"distances":"+D4ttYiKg8fkUbTyFBE2Cs","reverse":true,"order":{"count":11,"items":[0,1,2,3,4,5,6,7,8,9,10]}},{"distances":"dsRzSZ0e3kEdua0189wWRwGxzkWxua2Ro1rWXVxCmsAiiEZXYCZGtFTYxaoO2/MO1LEcyiyv9q8Z+EOYT6MUiavf/EhD6vBaGOjRZRO4mijZqwLkVPYeWXGTkHxgE9qKFBynKsmZryRaKl2wURIarsUwiKhQaApMHH3R2vwM9+LnAGH7h0KYwybJYlM7z+mSh2x3Eusjf2cSA8cCak0kM3MKAJkbHSxgA4SVok7JylJ8eWgIJl2kayF8mLhs7YIalu95Xf0tKwbAmUFpHC00K5leDGYplCiVbIwBa1v1LZj2/BS+8z30T04elmtg08iQ/tSood2P3MjoR41v47udk+BowgozvYVrnngYr63y8OqYrvG8NSG85FdO8uSkAqgEZuHbjBTbqlkoRQcGA+m2nuTxS3meVqx+6Q5ojTQXxnAnRB6DooqeExVUOUvEo4vmm0QURi+XQM33XZNj0X9xwrZew0f/pfLOdI6mdRTzRqOzC/SsG16k6Lp4bAirC6G5lCOKek/4t0yhWiM9lHGbili7RHtRa/0YTqlCLVuCGxl4vXW+0aFrWNBOCw6uhAdgTYP6dohwUn3ZZOQrb3UvZfS5+I4EpeGKp/+vSyJwt5DR6zLSziv6KNa4WjQT8Vs6bwXvQcbK/qROGk9rZdLj4I34a5OLuxknV9Hv4r5bJrgIk4jr8u1ynG3yGKqJWvDkQSGB7UC0kLXjriaxXRymJS6MIiM3pL7w6rSes+1krWSDPwqVqOk89UQsbm0fA+wiWmPML2","reverse":false,"order":{"count":387,"items":[86,108,21,213,190,112,102,200,382,283,47,171,284,355,254,246,140,309,351,33,5,98,218,62,64,135,281,123,353,303,348,48,59,265,326,11,276,248,255,183,185,136,80,110,193,337,87,73,127,364,362,120,340,307,117,314,89,70,66,132,138,239,311,274,148,329,55,85,386,107,31,41,106,365,93,263,184,231,257,333,220,39,245,51,385,374,289,228,352,317,225,211,322,295,379,214,268,325,198,69,226,244,10,1,166,373,113,2,369,189,161,247,306,204,299,151,27,288,195,272,203,243,154,40,72,292,297,75,56,219,206,175,336,282,58,262,316,384,350,13,279,360,18,230,130,357,321,24,57,92,141,25,294,50,23,328,235,298,192,78,104,359,122,146,315,332,270,133,252,144,91,323,380,320,296,103,199,101,240,187,242,287,290,0,118,258,100,237,191,119,341,177,286,45,77,125,291,88,96,22,76,159,143,42,266,253,267,194,49,210,53,165,343,149,60,356,109,335,197,342,377,170,142,256,273,264,139,156,128,277,124,95,134,67,205,52,20,224,201,346,176,202,29,162,114,216,173,16,222,366,79,302,238,251,304,349,63,376,375,181,217,196,54,17,372,358,74,182,68,178,99,319,370,26,269,157,260,308,275,6,14,169,334,221,278,174,43,223,147,313,145,83,9,172,383,234,90,236,19,28,61,111,212,97,207,261,34,116,361,65,35,312,12,94,232,271,280,3,381,105,131,137,7,158,32,371,167,345,163,15,121,82,71,30,164,81,293,4,179,347,153,229,331,301,330,155,338,168,186,339,209,215,250,363,208,249,241,368,285,46,310,115,354,126,367,180,318,37,188,344,152,8,378,36,327,233,129,84,38,300,227,305,150,44,324,160,259]}},{"distances":"AHAQAaAmAtAxAxA1A3A8BLBMBSBZBZBfBkBvBvB2CTCbCfCkCyDCDTDfDuEDEJELEREUE3E6FMFSFgFjFqGHGVGeGfGlGrGuG3G6HPHRHaHfH5H7ICIHISITI3I5I5JPJQJWJdJgJhJjJnJrJ1J8J8KJKOKhKmKsKvKxKxK3K+LBLkL1MdMhNLNONWNdNfNxOAOBObOiOpOxO0O5PDPKPMPqPwQIQPQXQXQdQhQhQ/RCRFRWRcRhRiRlRpRvR2SASFSHSNSQSZSuTCTPTUTuTzT5T6UFUGUXUYUZUkUzVCVOVQVaVsVsVxWHWJWMWSWTWZWhWiWiW2W5XBXfXxX3X4YFYOYXYuY7ZAZFZIZOZkZuZ0Z/AAaSaVaZalamatawaza1a/bFbGbVbZbfbfbhcNcQc7c8c+dFdIdIdXdadndodpdpdtdueIeMeaebene2e8e9fJfVfZfdfefyf+gEgFgNgPgpgrhAhIhMhQhShkhsiBiHiLiUiUihijipjHjUjbjjjokBkDkGkJkJkVkekzk6lHlXlglqlql3l4l5mKmKmemtmvmxm5nAnInPnQnRnqn6n/n/oFoOoUobokovo/pFpXAApwp7p9qIqYqoq4rKrQrUrUrarfrmrprxsBsJsotRtatftgtltmt2t2uCuZucusuuu4vJvWv8wNwPwRwWwWwfwmwnxOxPxTxWyAyFyHyMyQyRycycydyiylzXzXzfzqzuz40a0e0k0w061A1G1K1V1W1n162b2h2z3C3O3i3m3p3s3u4G4H4t4x4+5C5E5W5g6T6T6q6u7D7I7T7T7d7g7h7q738D8G8O8Z8c8h8i8k8q8z9Q9b9m9r9797+C+i+n+q+w+9AA/G/K/V/X/f/g/m/2/5/6/+","reverse":true,"order":{"count":445,"head":[300,299,298,297,296,295,294,293,292,291,290,289,288,287,286,285,284,283,282,281,280,279,278,277,276,275,274,273,272,271,270,269],"tail":[31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0],"sha256":"f913048d6a9ad4bb2ef3011f6236980b260a11fd9f504cbd85146b469fd627c2"}},{"distances":"gdoYlIS5slNFvtzAvQ07EjSe7+hxdB+4C78nuAx+JY3PGhmSzWVSfZ+/vAaswPq7ozJF7X4mngmswKcKJf1c34Tcgb5MDhgL7Alj30o0i0GGqIXXaWtUiGAA+DAAge4c6wrtXnCPAA1qTk4LBW9Q7738AAVWTOFOKoV6hxIR6ePkIycUe2qbslIwX7KuJHu0AAcWVby9jforo0l/SlX1KqF8I9FPAAIpxsyiYedEHtAARqsjXNlxEVPikAtzIldNCjxqAAFcAADnCtv+LsZ54VOFxicZuBipbirdExquAAm/B8YSAAG8juCc3A28r22zAAAAt3W70ExFAwrsHI35AAJ1bSLM/dVMWSg8E/AAvnEf2UQ0R3LIAn3OhcAdyY74CPj2DL6h6BKCJo7h5pXEeJQCegGZYXqgAAOrcMPsa50Mz2Px6Vs5gZQQuGjmAALKfDoaWhAAAA2LAAY4AAmDVKNLk3IixzlHeEtqw5FfU/TiDCpqUkAXkWDJAANVgDvX0+jFIKVOuVxQIPMGHBqjixrmAABCAANjDxgDUrTEih7JFHdvM9nCC4h/8IrG9+wY+QS5qzcdAAmZeZis/SvA5+AAtmoQAAiissAeAADRon0pRMPwIReTBCAARXHfEcUbAACYjWbiiGUIeL7Jq1AAnTZIQ27zx6PtHTI4uPHO4SJ4j/HVLl3Y8LwlLM8sQmAA9FppYyjgmaieAA+mAABW9euUgenCfyAAAArJZjomS/oSpbIDbT1wAAiOEAFFXXOuwemdgyqJyWlhAAyyLYs6LzUR9tkGRnvBIqAAf9kZafKAAAkTLJcFPWDLoEE1k9sKA3yhAA5kI9AAqAz0eSpVH8xKvDlav8jNAAzAQjAAAAG26vRVctAAuV84ll2qB5xM2pmFtFAACj/dVcQQVmagbwGLvfo8+XpKk5+3GXSDhInyVcBR4kH8Pdd4nzwAW5kn5XJbdeF2E2rpfq/4ZK+YvCLhlOKDXnOMAAYLihAAM8AY/E6ZAAIr+1YTVRzPMx9Eu7EHqhna6C1f1V7YPlLqct0gKYKRcDDNfpC0rcAAe4E1eIYWWYAA+LAArAZZyl8qAArebszc8UtWQrzCoLZB+on0HTeAQPt0BktwzxnZ1sUfMrPK6u3fa34bU/eCPSahryHDF6ZqGXVmAAaQBhAA95bIf3c0S5OiRn+EwX4fp1Go0jAz8FalAAiE+6V/MavDAAOTxNCxANsLAAQtcJAAAO","reverse":true,"order":{"count":619,"head":[27,15,73,17,12,74,48,35,21,9,24,7,19,30,6,8,28,18,4,31,32,1,23,2,13,0,26,14,29,25,3,11],"tail":[587,583,605,581,590,592,591,614,616,458,457,456,454,439,615,434,455,609,606,426,437,597,580,459,611,452,446,584,599,612,617,618],"sha256":"511a8fea3ffa5ef569c6ca6a4f7ecce64e630414bbb4a0f2efa5d2753cf7905f"}},{"distances":"EokB","reverse":true,"order":{"count":2,"items":[1,0]}},{"distances":"8a8U636Z5350504/373l3O2W2A1g1W1D0Hx5xHwnvqvXtctFsusor3qwqumhkzjpjfhEgvgPdmdWazZaZEZAYiYKYFYFWFVnTyS3QfQKP8O6NsNqMRJYISE/EDC/CpCNBQBD","reverse":false,"order":{"count":66,"items":[65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,44,45,43,42,41,40,39,38,37,36,35,34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,5,6,4,3,2,1,0]}},{"distances":"//wB//AF//QDQDgCAFwBAFAFAFAF//wB","reverse":true,"order":{"count":16,"items":[14,4,2,0,15,9,1,7,6,5,13,12,11,10,8,3]}},{"distances":"AFAAm/","reverse":true,"order":{"count":3,"items":[0,1,2]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAsOU146AAAAAAAAAAAAAAAAvzAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA4xAAAAAAAAAAAAAAAAAAAAAAAAnTnnAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAmPAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAATLAAAAAAAAoQAAAAAAAAAAAAAAAAAA95AAAAAAAAAAAAAAAAAAAAAAAAAAL5AAAAAAAAvpAAAAAAAAAAwVAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAaTAAAAAAAAAAAAAAAAAAAAAAAApvAAAAAAAAAAAAAAJIAAKkAAAAAAAAAAAAuaAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAcpAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAlYAAAAAAejAAAAAAGbAAAAAAAAAAAAAAAAAAAAAAowAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAATTAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA/3AA5AAAAAAAAAAAAAAAAAAAqUAAAAAAAAAAAAAAAAAAAAAAWHAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACQAAAAAAAAAAuGAAAAAAAAAAAAAAAAAAAALkAAAAAA7rAAAAAAAAAAAAAAAAPgAAAAAAAARIAAAAAAdFAAAAAAx5AAAAAAAAAAAAAAAAAAAAAAAAAAqkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHvAAAAAAAAAAAAlHAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA79AAAAAAAAAAAAAAAA","reverse":true,"order":{"count":455,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,15,13,66,14,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30],"tail":[423,424,425,426,427,428,429,430,431,432,433,434,435,436,437,438,439,440,441,442,443,444,445,446,447,448,449,450,451,452,453,454],"sha256":"3eebf700ece1c5521a0021dcedf79621832d03c9d06ff29b59eab90aadd922ea"}},{"distances":"8x0RtWeRAAAAZHAAMXLlAA","reverse":false,"order":{"count":11,"items":[9,8,6,3,2,1,0,4,5,7,10]}},{"distances":"AFTiAA6bN+hb04AAb3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WU","reverse":true,"order":{"count":104,"items":[2,7,82,59,36,13,95,72,49,26,3,85,62,39,16,98,75,52,29,6,88,65,42,19,101,78,55,32,9,91,68,45,22,81,58,35,12,94,71,48,25,84,61,38,15,97,74,51,28,5,87,64,41,18,100,77,54,31,8,90,67,44,21,103,80,57,34,11,93,70,47,24,1,83,60,37,14,96,73,50,27,4,86,63,40,17,99,76,53,30,89,66,43,20,102,79,56,33,10,92,69,46,23,0]}},{"distances":"VQAAMBmLS/y7AAAAjsAAOk2B3KAAuOAApBAA","reverse":true,"order":{"count":18,"items":[1,5,4,2,6,7,9,12,11,13,14,15,16,3,8,0,10,17]}},{"distances":"DFEGLGP+QIXdX8YNfymLqJxryTyx0d0i","reverse":false,"order":{"count":16,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15]}},{"distances":"OlUqfNjnk2vR","reverse":true,"order":{"count":6,"items":[5,4,3,2,1,0]}},{"distances":"ANAWAXAlAxA1A2A7BGBNBTBeBrBvBxBxB+CACWCZCdCrCxC3C3DEDcDfDgDhDmDxDyD6D6D7D9D+D/ECEHEKEPEQEUEkFGFbFoFrFuF3F6GEGHGJGKGXGYGdGgGtGxGyG7G9HAHdHjIDIOIPIXIZIZIpIqIyI6JAJFJSJYJeJrJwJzJ3J7KJKYKgKyK0K8LDLKLoLqLrL3L4MUMVMrMuMxM9NCNGNKNPNXNnNnNnNnNtNvOGOTOaOmOqOqO6O6PAPKPQPTPZP3QBQEQIQOQQQTQTQVQYQaQaQvQ1Q9RCRNRORPRZRmRwR7R+SESgSlSsSuS9TKTSTVTiTlToT1T2T2T4UDUGUIUWUWUfUkUsU5VCVfVfVhWRWUWoWpXAXEXLXLXPXVXnXoXsYBYCYGYOYQYbYcYwZJZMZOZVZVZYZfZoZrZyaIabajakapata0a9bEbKbMbObxb3b+cMcYcccdcicicncsc1c3dRdddid5eAeJeXeYeufJfLfefpf+gRgRgggkgsgvgwg3hAhJhPh1h8iNicisjJjKjMjQjWjzkKkWkikmkokrkyk6lOlXlflhl1l4l6l7mhmkmomrnInInjnjoBoIoKoMoNoRoTowozo1o4pHpepfpipwpzp7p/qAqDqDqIqLqUqXqZqaqeqgrGrKrLrQrYror4r9r9sJsZsesosys7tXtbtcttt5t8uAuCuKuTuju0vAvCvRvUvVvZvxv2wSwawbwnwtwywzw3w9w+xDxFxKxKxLxVxcxjxjxux1x5y1y3zAzYzkzuzyz1z/0L0g0k0306091A1P1o1q1y2B2E2P2S2T2m21273a3a3e3h3t304a4b4e4k4z495H5N5O5P5X5a5h5051586L6X6e6i6p6y637E7F7N7R788I8J8L8M8e8f8q8r80889H9K9M9T9U9X9Y9e9l9x+J+M+S+U+d+g+h+n+t+0/F/c/m/t/5","reverse":true,"order":{"count":485,"head":[484,483,482,481,480,479,478,477,476,475,474,473,472,471,470,469,468,467,466,465,464,463,462,461,460,459,458,457,456,455,454,453],"tail":[31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0],"sha256":"f94e09ab19de4c5ef9403cbd1d715fb3e7cb35ec50fc183ab8948a3e7a1ac08d"}},{"distances":"DMDoJ5PyRLSJUFgUgcpz1y2F6e","reverse":true,"order":{"count":13,"items":[12,11,10,9,8,7,6,5,4,3,2,1,0]}},{"distances":"ASAYAbA0A1A6BBBGBGBqBzCCCYC6DXDfDvEOEQETErEsE3FEFIFiFnFwF1GBGJGjGjGuGxG2HGHTHcHkAAH7IAIEIFIQISIVIqI2I4I+JLJNJiJjJwJ5KjKqLALFLvLyMGMMMfMiMwMyNQNSNYNYNZNfNhN3OOOfOgO8PFPcPfPgPhPjPkPlP1P/QOQQQcQcQjQpQ7Q8RGRRRbRnRrSLSWSfSqS2S3AATNTWTpT5UCUGUHUbUkUqU6VJVLVUVVVeVvV0V/WAWJWOWmWpWtWzW2XAXbXoXtXwX0YBYKYnZLZWZkZpZqZwaFaXaaacafapa2AAbHbKbRbYbvb0b2b5cEcZcac4c7dDdSdSdXdmdndqdud3eReleleneue4e5e9e+fAfZfff9gFgUgWgZgagagnhAhah1iBiDiKiYifizjHjcjfjpkQlVlWlXlnlxl7l9mSmYmjmzm4m5nEnKnPnTnfnhnvnvn0n7oBoIoZo8pKpPpmp5qDqPqPqUqbqcqfq1q5rnrwr0sCsPswsxsxtCtTtYtbtbtjuAuKugukvIvOvYvpvsvsvxwNwWwhxaxgxpxux/yNyXyhyqyrywy4y+y+y/AAzfzjzuz90I0R0f0+1J1J1W1b1v1y1y1y13182A2H2M2P2d2i2m2o23233I3N3V3k3q3r3t4G4V4m4o4+5B5W5g5h5i5k566D6S6T6n6n6t63647D7a7e787+7/8B8m8/9U9Y9b9g92+c+f+x+z+3+4+8/c/5","reverse":true,"order":{"count":380,"items":[17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0,40,65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,41,39,38,37,36,35,34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,111,160,159,158,157,156,155,154,153,152,151,150,149,148,147,146,145,144,143,142,141,140,139,138,137,136,135,134,133,132,131,130,129,128,127,126,125,124,123,122,121,120,119,118,117,116,115,114,113,112,110,109,108,107,106,105,104,103,102,101,100,99,98,97,96,95,94,93,92,91,90,89,88,87,86,85,84,83,82,81,80,79,78,77,76,75,74,73,72,71,70,69,68,67,66,161,300,299,298,297,296,295,294,293,292,291,290,289,288,287,286,285,284,283,282,281,280,279,278,277,276,275,274,273,272,271,270,269,268,267,266,265,264,263,262,261,260,259,258,257,256,255,254,253,252,251,250,249,248,247,246,245,244,243,242,241,240,239,238,237,236,235,234,233,232,231,230,229,228,227,226,225,224,223,222,221,220,219,218,217,216,215,214,213,212,211,210,209,208,207,206,205,204,203,202,201,200,199,198,197,196,195,194,193,192,191,190,189,188,187,186,185,184,183,182,181,180,179,178,177,176,175,174,173,172,171,170,169,168,167,166,165,164,163,162,301,379,378,377,376,375,374,373,372,371,370,369,368,367,366,365,364,363,362,361,360,359,358,357,356,355,354,353,352,351,350,349,348,347,346,345,344,343,342,341,340,339,338,337,336,335,334,333,332,331,330,329,328,327,326,325,324,323,322,321,320,319,318,317,316,315,314,313,312,311,310,309,308,307,306,305,304,303,302]}},{"distances":"AOAdAeAhAsAuAvAyAzAzBCBDAABLBMBMAABUAABbBfBuBwB2CECJCfChCjCzC9DDDEDGDMDNDQDaDcDeDkDnDsAAD6D8ECEFAAELEUEVEkEnEzE0E+FDAAFfFtFwF0F3AAAAGOGOGQGRGVGaGbGkGlGlGoG3AAHGHQHRHTHjHnHpHzH1H1H4H7H+H+AAIFIUAAIaIaIdIkAAIuI9I/JDAAJLJNJPJTJaJaJlJuJuJ0J2J9J/KAKDKDKJKRKSKWKZKZKcKtK3K5LBLJAALZLcLeLnLrAALuLvLyLzL1L2L/AAMUMUMgMyMzM0M2AANFNQNSNXNaNcNeNgAANnN2N7N/OBODOEOGOPOPOUOYOnOpOsOvOyAAO8PCAAPTPXPXPdPpPtP0P4AAQAQBQHQKQLQfQfQjQkQmQwQ1Q/RERFRIRRRURWRcRcRgAARqRtR0AAR8R+R/SASESUSfSiSqSqSxSzS0S0S2S8S9TBTFTLTPTRTUTfTiTkTuTzT7AAUOUWUZUeUjUpUqU1U7VEVGVIAAViAAVzV2V8WCWEWPWPWRWeWhWvWwWzW6W7XIXIXLXNXcAAXlXnXrXtX1X2X/YHYZYiYiYiYkYxY0Y/ZBZCZJZLZMZYZaZcZlZqZsZvZ2Z3aBaQaQaaAAaialaqaua2a3bAbCbCbKbMbNbRbWbcbwb0b2AAb4b9cDAAcMcOcQcVAAcbcccicscucvc8dFdGdRdRdSdUdVdYdgAAAAd9eBeOAAeTeme8fFAAfRfVfYfefmf9gDgFgIAAgNgagbgcgdgkgogwg1g1g4g9hDhJAAhNhPhThXhbhjhohthyh6h8iQiViWiZibifihimi0i0i3AAi6jCjCjDjGjQjZjfjkjpjvAAj0j2j2AAkOkfkjksk0k4k7lAlFlRlTlclhAAl+mCmDmPmQmSAAmYmbmbmhAAmkmrmsmvmxmynDnEnKnUncAAnwn5n5n8n/oAAAoKoUoUoXoaofohososototovo3o6o8AApJpSpWpfplptptp0p4p6qLqQqXqYAAq1AAAArBrLrLrQrTrqrwrxr1r9sBAAAAsWsdsdsismspsts1AAs5AAs+tAtBtKtLtWtXtbtbAAtjtntptwtzAAuGuHuIuNuQuWAAuiujAAAAu6AAvQvVvWvbvrvsv+wFwNwSwTwhwpwvAAAAAAxMxUxXxkx4x9x+yByGyQyRyWymymynyuyvAAy5y8zDzKzUzazozrztztzvz50J0L0iAA0qAA0t0u0y0103AA1I1K1N1N1P1Z1o1t101515192L2Y2d2g2h2k2k2p2t2w2x26293C3D3E3G3J3J3NAA3Y3c3c3d3pAA3yAA334F4G4N4W4c4243435LAA5X5o5v5x52535556565+6F6G6O6S6Y6c6e6f6f6o6p6s687R7U7jAAAA7m7t7071747+8NAA8pAA8u8x8y81AA9V9d9d9v9+AA+C+f+i+l+v+v+3+//B/CAA/Q/U/X/X/a/e/rAA/s/y/7","reverse":false,"order":{"count":758,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[726,727,728,729,730,731,732,733,734,735,736,737,738,739,740,741,742,743,744,745,746,747,748,749,750,751,752,753,754,755,756,757],"sha256":"83a6897c4cf735b8b2cac260f75ecdb015ade0ca28b09b70c253674584d82c54"}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAWUAA9NQwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQwAAAAAAAAAAAAZFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA3qAAAAAAAAAAAAAAAAm/AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":91,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90]}},{"distances":"AFAAgC","reverse":true,"order":{"count":3,"items":[0,1,2]}},{"distances":"MINdN3RSAAatf0nrqQ0JAA","reverse":false,"order":{"count":11,"items":[0,1,2,3,4,5,6,7,8,9,10]}},{"distances":"","reverse":false,"order":{"count":0,"items":[]}},{"distances":"AAA5AAAABUAADFDPAAD7AAAAAAAAFkGPAAAAHTAAAAIBIOIjAAJ7AAAALtL8MsAAOEAAOKAAAAO9PmAAP2QGQuRNRhR1AASHSdSeAATQAAAAAAAAAAUSAAVAVJAAV6AAAAAAX6AAYfAAAAcDAAcwc8AAdPAAdteZAAe1e9fTfWfkf4AAhCAAiGjWAAjpjujwj8AAAAmFmQnInYn7oZAAoypTplAAqOqXqhAAAAAAAAsdskAAtcAAAAuDAAAAAAvdAAwTAAAAAAAAxtAAAAyqzEAAAAzjAA05AAAA1/AA243VAA3oAA455ZAA6F6T6U6xAA7r8BAAAA889M9b9lAAAA/E/j/u","reverse":true,"order":{"count":174,"items":[0,2,3,5,8,9,7,6,4,1,10,11,12,13,16,17,19,20,24,26,27,31,33,35,36,39,41,40,38,37,34,32,30,29,28,25,23,22,21,18,15,14,46,50,51,49,48,47,45,44,43,42,52,53,54,55,56,58,61,63,64,65,67,69,70,72,75,77,80,85,84,83,82,81,79,78,76,74,73,71,68,66,62,60,59,57,87,89,92,94,90,97,98,105,109,112,111,110,113,114,115,116,118,119,120,108,107,106,121,122,123,117,104,103,102,101,100,99,96,95,93,91,88,86,124,125,126,127,128,129,130,131,132,133,135,136,139,140,142,144,145,147,150,152,155,160,163,164,169,170,173,172,171,168,167,166,165,162,161,159,158,157,156,154,153,151,149,148,146,143,141,138,137,134]}},{"distances":"AAAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgCAAAAAF","reverse":false,"order":{"count":27,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26]}},{"distances":"AFQDAFwB//wBQD//wBgCQDQDgCAF","reverse":true,"order":{"count":14,"items":[7,4,8,5,3,12,9,11,10,6,1,13,2,0]}},{"distances":"oWjdE1x1QaH2MhXKihYblWCB5fj05qeU3VOl8czWF1HZ","reverse":true,"order":{"count":22,"items":[18,14,12,16,19,3,0,10,13,1,8,15,9,7,4,17,6,5,21,20,2,11]}},{"distances":"AuAAAAAAAAAAAAAAAAFwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAW9AAAAAAAAAAAAAAAAAAAAAAAAAAkZAAAAAAAAAAAAoBAAAAqSAAAAAAAAAAAAAAAAAAAAAAAAAA0Z1VAAAAAAAAAA41AA6g6pAAAA8TAAAAAAAAAA","reverse":true,"order":{"count":83,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,65,66,67,68,69,70,72,74,73,64,75,76,77,71,78,79,80,81,82]}},{"distances":"9Lu5AAoOd9AAAAVDUFNpAALqLRAA","reverse":true,"order":{"count":14,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13]}},{"distances":"AmBpE1HyQCQzTwXjqJuuyqyq3L5k8N8u9N+x+4/7","reverse":true,"order":{"count":20,"items":[19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA4SAAAAAAAAAA2tAAAA1mAAAAAA0fAAAAz6AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwcAAAAAAAAAAAAAAAAAAAAAAAAAAoNAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAhlAAAAAAAAAAAAAAAAAAAAAAAAbMAAAAAAAAZBAAAAAAAAAAAAAAVMAAU6AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKLAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADCAAB7BsAAAAAAAA","reverse":true,"order":{"count":182,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181]}},{"distances":"A8BUBeB1CBCJCUCoC0C9DCDIEFEIEWExE8FIFTF6GJGUGwHCHKHZHeHqJrKILOLPLaLpMEMjM3M/NSNjNpOFO2PBPMPOPsQCRWSkS+TRTXTvT1T/UIV7WWWYWaWgW1XCXUXXXtXwYsY3ZrZvata0a5bgbsb7b/cDcPcgcjc9dHdjd8eWfkfofsgLgWgshMhghwh9i0jWj8kFkRkpk3k8lBlQlqmbmjmkm2nUnwpgplpwqnqzq9q9rArBrGrJrbrbrer1r9r9sDsUsrtItItNu5vLvpvyv5wDwdwmw0w9xlxrycyhyuy4y6zAzdzoz+0U0c0f1K1Y1x2X273T4n4q4x5P5n6U6/7A7M7n7q7u8d8083839R9U+N+O+i+r+z/K/V/e/2","reverse":false,"order":{"count":195,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194]}},{"distances":"ANAWAnArAsAABDBRBSBgBnBnBoB2B6CPCUCjC3C8C/DBDDDFDRDSDYDmD3D4ECECEGESEdEjE9FFFPFQFfFkGHGIGRGXGXGaGpGuG4G5G8HEHHHHAAHNHRAAHbHfHqHrAAH0INIPIRIdIgInIpI0I1JEJOJpJzJ5KJKMKMKVKWKXKnKoKyKzLOLRLRLTLULZLvL1L1L4MLMQMhMmMnMuMuMyM2M8NINNNRNYNbNdNgNrAANzN7N8N9N+OCOHOPOVOWOfOgOnPVPbPhPoPpPxP3P6P7QCQEQGQSQTQTQYQaQfQjQoQoQqQtQuQzQ1Q3RHRJRcRgRmRnRrRsRuRvRwR4R7R7SCSJSJSPSWSWScSgSsS1S6TMTRTUTrTsT4UEULUOUVUbUeUfUtVEVIVPVSVZVgVvVyVyV7V9V/WAWEWUWXWYWkWrWvW7XNXOXQXTXaXcXeXkXrXuX0X1X1YBYGYPYVYXYdYdYsY/Y/ZBZRZfZfZxZxZzZ0aCaEaHaTaVaXaaafajarasata6bFbNbbbhbkbnbnbqbvb5b5cHAAcLcNcvcwc4c8c9dDdKdKdOdPdRdXdZdadfdrdudvdzd3eKeLeNePeYedefehepeseuevexfDfcfhfkfmfpf5f7gLgNgQgSgYgjgvg6g8g8hBhBhKhKhPhVhchghqhuh/iCiQiViiimiqiuixiyi1i8i8i/jAjFjPjWjajbjpjuj1j4j9kBkDkOkPkQkRAAkSkTkbkdktk8lFlKlNlPlQlTlVlZlglklml2l6mDmUmZmbm+nEncnsnvn3oKoSoYogoioqowpJpNpUpWprpupyp8p8p+qDqEqMqVqYqrqsq9q+rRrVrVrermrnrvr2sAsEsFsOsbshsksksrssstswsxs1s6s8tHtKtKtPtbtfthtptstttwtxt0t2t8t+uOufujuqvFvIvRvevjvovxvywSwWwcwdwjwswswsw2w6w/xAxIxJxMxXxcxtx8x8yFyQyTydyly0y7y+y+zHzXzZzgzlAAzmzvzzz2z3z5z8z8z90A0F0M0N0P0Q0a0l0o0q0y020+1H1K1L1L1k121+2L2m2r2u2v2+3D3E3L3N3T3c3e3y4F4J4L4M4N4O4Y4cAA4p4r4t4x4y42485A5D5K5S5T5a5h5w6J6K6N6O6R6m6o6w62686+7J7K7O7Q7S7o7q738E8F8N8b8d8w8x848888899F9H9K9L9W9j9l929497+F+K+L+M+Z+f+h+i+m+s+s+u+u+u+y+1+3/D/J/O/T/U/a/c/f/j/r/0/2/3/6","reverse":true,"order":{"count":651,"head":[5,369,368,367,366,365,364,363,362,361,360,359,358,357,356,355,354,353,352,351,350,349,348,347,346,345,344,343,342,341,340,339],"tail":[150,149,148,147,146,145,144,143,142,141,140,139,138,137,136,135,134,133,132,131,130,129,128,127,126,125,124,123,122,121,120,119],"sha256":"597d20d26aae228409e5d94a82c08c05292e6e057224949aef24cd5c25742b6a"}},{"distances":"AATiAAAAAAAAAAIaAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA9NAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIaAAAAC3AAAAAAQwAAAAAAAAAAAAAAAAAAAAAA6bAAAAAAAAAAvUAAWUAAAAAAAAAAAAAAAAAAAAAAAAAAm/AAAAAAAAAAb3AAAAAAAAAAAAAAAALMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA04IaAAAAAAAAAA9NAAkNAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvUAAWUAAAAAAAAAAAAepAAAAAAAAAAAAAAAAAAAAAAAAAAAAC3WUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIaAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC3AAAAAAAAAAAALMAAyGAAAAAAAATim/AAAAAAAAAAAAAAAAAAAAAAQwAAAAAAepAAFpAAAAAAAAAA","reverse":true,"order":{"count":302,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,271,272,273,274,275,276,278,277,270,279,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,217,297,298,299,300,301]}},{"distances":"QDwBQD////AAAAgCQDAF//gCgCAFgCQDAAwBwB//wBAFgCgCQDAAAF//wBgCAF//AF//QD////AA//wB//QDgCgCQDAFAFgCgC//AF//QDQDgC//AF//AAwBAFwBgCQDQDwBAFQDgCQDAAQDwB////QD//wB////gCQD////QDQDgCQDQDgCAAQD//gCwB//wBAFAFgCQDgCQDwBQDgCgC//wBAFgCQDAFAAgCwBwBQDwBgCAF//wBAF////QDAFgCwBgCAFwBwBAAAAQD//QDAFgCgC//wBAFAAwB//AAQDgCAFAFwB//AF//wBwBwBwBgCAF//AAAFAFAFwB//wBQDAFgC//QDwBwBAFAAgCAFQDAFgCQD//wBgC","reverse":true,"order":{"count":189,"items":[5,6,16,25,37,40,38,36,35,33,31,27,19,10,4,3,39,28,20,18,17,1,43,42,29,23,22,14,12,11,7,44,41,34,24,15,8,2,0,32,30,26,21,13,9,58,70,90,92,83,82,79,78,76,74,73,57,55,51,49,77,72,65,61,59,89,86,80,68,62,54,48,47,91,88,87,85,84,81,75,71,69,67,64,63,53,52,66,60,56,50,46,45,113,125,124,121,107,95,133,129,122,118,116,115,108,103,134,135,137,132,96,94,140,130,128,119,114,110,106,105,101,99,93,138,136,126,117,111,104,102,100,139,131,127,123,120,112,109,98,97,145,148,164,174,169,163,179,186,156,154,147,142,187,177,176,170,168,160,159,158,157,153,146,143,188,184,180,173,161,150,141,185,182,175,171,149,183,181,178,172,167,166,165,162,155,152,151,144]}},{"distances":"AcBHBPBYBnBwB1B7CUCUDCElEsE4InJtJ2MAMIMeMgMlNVNZNaO3PBPJQHQtRvRvR1R9SqS6UoWlXFXdXpXxXxYvZiaFaQaiaibWbXcdcnczc0c3dUdeeLeMfAfRfZf8gJgVhgiIiVixjgkGkbkilMldlyl8l/mlmnnDoDoSowo7pVqkrTrdrksks0s2t9t/vVvxwBwiwyw8xGyDyGzG0V1G1P1u142k2t253l384D4V5a5d6Z6e69728a9A+g/l","reverse":false,"order":{"count":128,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127]}},{"distances":"AFTiAA6bN+hb04AAb3vUC3WU","reverse":true,"order":{"count":12,"items":[2,3,6,7,9,5,8,11,1,4,10,0]}},{"distances":"AAJMAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":10,"items":[0,1,2,3,4,5,6,7,8,9]}},{"distances":"/3AA/A+y+x+l+c+J+J+E9w9s9fAA8W8P767m7m6w6v5p5H4n3n222u2O2N1u1fAA0c0Xy1yeyKAAxowxwkwZwPueuVuDuAtltaspsbrQrDqhqaqUqPAApPpEo3oqAAnaAAnGAAm4mrmkl7lPk0AAjpjfh4hMf/f+fiAAfLfGe4esereVeLeKdydcdYc5cSAAbNAAZbY/Y4WsWcWYAAWFVvUZAATAR6RrRAQtQLQKQAAAOAMvMuMTL5KEJJJFJAIrIHIBHzHkHZGnGdGTGKAAGBF3AAE2D+D8DzDsDLB4AAAAAzAW","reverse":true,"order":{"count":152,"items":[0,1,2,3,4,5,6,8,7,9,10,11,12,13,14,15,16,18,17,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151]}},{"distances":"AATiAAAAAAhb04AAAAvUAAWUpw9NQwkNAALMepyGAAAAsiAFTim/AAAAAA04AAb3AAC3WUpwAAQwAA3qLMAAyGFpAAsiAAAAm/AAN+AA04AAAAvUAAAApwAAAAkN3qLMepyGAAZFsiAFTim/6bN+AA04AAb3vUAAWUAAAAQwkNAAAAepAAFpAAsiAATiAA6bN+hbAAAAb3vUC3AAAAAAQwkNAALMepyGFpZFsiAFAAAAAAAAAAAAIab3AAC3AApw9NQwkN3qLMAAAAFpZFsiAATim/6bAAAAAAAAb3vUAAWUpw9NQwAAAAAAAAAAFpAAsiAFAAAAAAAAhb04Iab3vUC3WUAAAAAAAAAAAAAAAAFpAAsiAFTim/AAAAhb04IaAAvUC3WUpwAAQwkNAAAAAAAAAAZFAAAFTiAA6bN+hb04AAb3vUAAWUAA9NQwAAAAAAAAAAFpZFAAAFAAAAAAN+hb04Iab3vUAAWUpw9NAAAA3qLMepyGFpZFsiAATim/AAAAhb04Iab3AAC3WUAA9NAAkN3qLMepyGFpZFAAAATiAA6bN+AA04AAAAAAAAAAAA9NQwkN3qAAepyGAAZFsiAFAAm/6bN+hb04AAb3AAAAWUAAAAAAAA3qLMepyGFpZFsiAFAAAA6bN+hb04AAAAAAC3AAAAAAQwAAAAAAepAAAAAAAAAFTiAAAAN+hb04Iab3vUC3WUAA9NAAkNAALMAAAAFpZFAAAFTim/AAAAhbAAAAb3AAAAWUAA9NQwkN3qAAepAAFpAAsiAFAAm/6bAAAAAAIaAAvUAAWUAA9NQwAAAALMAAyGFpAAAAAFAAAA6bN+hbAAAAb3vUC3AApw9NAAAA3qAAepyGAAZFsiAFTiAAAAAAAA04Iab3AAC3AAAA","reverse":true,"order":{"count":450,"head":[0,2,3,4,7,8,10,13,9,16,20,21,22,25,26,27,28,29,30,32,35,31,36,37,38,39,6,19,12,15,5,40],"tail":[430,423,400,393,431,433,432,434,436,426,419,422,439,440,441,442,443,445,435,402,438,418,408,444,398,411,437,446,447,414,448,449],"sha256":"bc56d43e04f08c1b61f03fc9c01925b6ff41f5fae579ace13b3ed58ff4b7280e"}},{"distances":"AAAxBOCxEAEKEyE1E2FIFTFTF+GxG+IUJgKuKuK/LzL+MLMcNGNPNQAANaOFOKOZAAPFPTPyP0QrQwRcRoSHSUSbTRAATsT2T8UbUhVDVhV0WnWrW/XSX3YPYRYZYxZHZPZTZYaFaIaJaNbAbmbwb/cfAAc8dAdXd4AAeNekeye5AAe/fMfNfVgnhAhKhshwhxhxh7h/iNjEjJjbjyj1kAk3lQltAAl7l+mCmFmHmHmYmdAAmtAAnYn4n7n+oIAAoyo2o2o6AApSpVAAp+qOqkAAq4AArFrIrNrgrnr3r9r9sGsHsjs2tFtJuVudugurusuuvBvgvmvnwLwMxQxVxZyBy1zl061D1P1i1r2+3B3C3r4z5W5j6B606/7c72788h8tAA90+F+JAA+5/C/H/Q/c/p/tAA/3","reverse":false,"order":{"count":208,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207]}},{"distances":"eVAA","reverse":true,"order":{"count":2,"items":[0,1]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAfeAAAAAAAAAAAAAAAAAAAAAAFeAAAA","reverse":false,"order":{"count":35,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw","reverse":true,"order":{"count":197,"items":[174,151,128,105,82,59,36,13,187,164,141,118,95,72,49,26,3,177,154,131,108,85,62,39,16,190,167,144,121,98,75,52,29,6,180,157,134,111,88,65,42,19,193,170,147,124,101,78,55,32,9,183,160,137,114,91,68,45,22,196,173,150,127,104,81,58,35,12,186,163,140,117,94,71,48,25,2,176,153,130,107,84,61,38,15,189,166,143,120,97,74,51,28,5,179,156,133,110,87,64,41,18,192,169,146,123,100,77,54,31,8,182,159,136,113,90,67,44,21,195,172,149,126,103,80,57,34,11,185,162,139,116,93,70,47,24,1,175,152,129,106,83,60,37,14,188,165,142,119,96,73,50,27,4,178,155,132,109,86,63,40,17,191,168,145,122,99,76,53,30,7,181,158,135,112,89,66,43,20,194,171,148,125,102,79,56,33,10,184,161,138,115,92,69,46,23,0]}},{"distances":"AFTim/6bN+","reverse":false,"order":{"count":5,"items":[0,4,1,2,3]}},{"distances":"bGXOCaAmA4TOPDH1i+tDdQnS8bERQZmOdmZQbsTxFLXXJZQGM+P8myYGHFNQBkNUZwCSTa+42n2wNL4ECgpEUR26Qd+qL5h/2Hp4lcRy0D+p","reverse":true,"order":{"count":54,"items":[35,45,53,12,39,43,37,36,48,52,9,49,41,11,26,15,50,8,47,16,10,18,0,32,17,27,21,1,42,19,34,5,51,44,14,23,25,6,31,29,38,24,46,22,7,28,20,13,40,2,33,30,4,3]}},{"distances":"BRAAAAAACxDQDsAAEDAAAAAAAAFDAAFxF5GDHDHfHwAAAAIXIkI6AAKNKoMEMPAAAAMgMrOWOgPaQdQnQ0RZSBSGSWAAAATBTzUQVQVdVkAAAAWyW9AAYjAAZ4aJahAAAAcucxc4AAd7efe/fDAAgOg/hZhjh2jIkOmOnHAAAAAAqzrerhAArrAAsttBtJtXAAtrtwt6AAAAAAv6AAxCAAAAxRxkyBAAAA0GAA0j0lAA1A2PAA3IAA3O354BAAAA4h4nAA5q5vAA7UAAAAAA8z9a9k+L+i/h/0","reverse":true,"order":{"count":145,"items":[1,2,3,7,9,10,11,12,14,21,22,26,30,29,28,27,25,24,23,20,19,18,17,16,15,13,8,6,5,4,0,31,32,33,45,46,53,54,57,59,63,64,68,70,69,67,66,65,62,61,60,58,56,55,52,51,50,49,48,47,44,43,42,41,40,39,38,37,36,35,34,73,82,81,80,76,83,84,85,86,89,91,94,92,79,78,74,96,99,100,101,102,103,104,105,98,97,95,93,90,88,87,77,75,72,71,106,107,111,112,114,117,120,122,126,127,130,133,135,136,137,144,143,142,141,140,139,138,134,132,131,129,128,125,124,123,121,119,118,116,115,113,110,109,108]}},{"distances":"j8yKipvs2wgCwsrzhdINrl","reverse":false,"order":{"count":11,"items":[9,5,8,2,0,10,7,3,6,1,4]}},{"distances":"","reverse":false,"order":{"count":0,"items":[]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Ia","reverse":true,"order":{"count":77,"items":[59,36,13,72,49,26,3,62,39,16,75,52,29,6,65,42,19,55,32,9,68,45,22,58,35,12,71,48,25,2,61,38,15,74,51,28,5,64,41,18,54,31,8,67,44,21,57,34,11,70,47,24,1,60,37,14,73,50,27,4,63,40,17,76,53,30,7,66,43,20,56,33,10,69,46,23,0]}},{"distances":"RzTefOfnoX0r1F3d+N/+","reverse":false,"order":{"count":10,"items":[0,1,2,3,4,5,6,7,8,9]}},{"distances":"AAAAAAAAAAAAAA","reverse":true,"order":{"count":7,"items":[0,1,2,3,4,5,6]}},{"distances":"+2vNAAAAAAsgj5cUbYAAXaVWVJUsPyO0","reverse":false,"order":{"count":16,"items":[1,0,2,3,4,15,14,13,12,11,10,8,7,6,5,9]}},{"distances":"AAAAAAAAAAAAAAAADBAAAAAAAAElAAFRAAAAAAHzAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAASKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAeeAAAAAAAAfaf7AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAr6AAAAAAAAAAAAAAAAtjAAAAAAAAAAAAAAAAAAxCxIAAAAx7AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA+1AA","reverse":false,"order":{"count":179,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178]}},{"distances":"AAAAAAAAAAAAwBAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQDAA//AAAAAA//AAAAAAAAAA//AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQDAAAAAAAAAAAAAAAAAAwBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAgCAFAAAAQDAAAAAAAAAAAAAAAAAAAAAAQDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAAAAAAAAAAAAAAAA//AAAAAAAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAgCAAAAAAAAAFAAAAAAQDAAAAAAAFAAAFAAAAAAgCAAgCAAAAQDAAAAAAAAAAAFAAAAAAAAAFAAAAAAAAAAAAwBAAAAQDAAAAAAAAAAAAAAAAAAgCAAAAAAAAAAAAAAAAAAAAAAwBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQDAAAAAAAAAAAAAAAAwBAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAwBAAAAAAQDAAAAAAAAAAAAAAAAQDAFAAAAAAQDAAAAAAAAAAAAAAAFAAAAAAAAAAAAAA","reverse":true,"order":{"count":339,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273,274,275,276,277,278,279,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,298,299,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338]}},{"distances":"wBgCgCQD////wBgCwBQDwBAFAFgCwBwBwBQDAFgCgCQDAFgCgC//QDAFgC//wB//AFwB//wBwBwBgCgCAFwBAFgCAFAFgCgCgCAFAFgCAFgCAFwBQDAF//wBgCAFgCQD//AFgCwB//QDwBwBgCwBAFAFgCQDAFgCQD//AFAFAFwBgCAFAF//QD//gC//wB////////wBgCAF////wBQDwBwBgCQDAFgCQD//QDwBwBgCwBAA//QDgCQD////gCQDgCQDgCgC//wBwBAFwBQDwB//gCwBQD//////QDAFgCwB//wB//AFAFQDAAgCQD//gCwBAFgCwBAFwB","reverse":true,"order":{"count":167,"items":[81,68,64,58,34,31,29,25,5,4,73,71,70,67,59,55,41,37,36,35,33,30,16,15,14,10,8,6,0,79,76,72,66,62,60,53,51,48,47,46,43,39,38,28,24,23,20,19,13,7,2,1,80,77,69,63,56,26,21,17,9,3,82,78,75,74,65,61,57,54,52,50,49,45,44,42,40,32,27,22,18,12,11,119,152,150,145,124,120,113,103,102,98,97,96,95,93,91,89,118,116,115,107,106,104,99,94,85,122,117,111,108,100,92,86,123,121,114,112,109,105,90,110,101,88,87,84,83,156,159,144,143,139,132,125,166,164,161,151,149,141,138,136,134,133,163,160,157,148,140,131,130,128,126,158,155,146,142,137,129,127,165,162,154,153,147,135]}},{"distances":"QDwBAFQDgCwBQD////gCAFgC","reverse":true,"order":{"count":12,"items":[8,7,5,1,11,9,4,6,3,0,10,2]}},{"distances":"CNDFE8FhAAHtIKJgMfNcXKX8ZKafd1gfhOjNlfnIqtrvs/wpx+2f8V9H/G/p","reverse":true,"order":{"count":30,"items":[4,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,3,2,1,0]}},{"distances":"EnEuXJYWf0ngydyyzA6c7V8W/3","reverse":true,"order":{"count":13,"items":[12,11,10,9,8,7,6,5,4,3,2,1,0]}},{"distances":"AFTim/6bN+hb04Iab3","reverse":false,"order":{"count":9,"items":[0,7,4,1,8,5,2,6,3]}},{"distances":"AAAAAAAAAAhbAAAAAAAAAAAAAAAAAAAA3qAAAAAAAAZFAAAFTiAAAAAAAA04AAAAAAAAAAAAAAAAAAAAAAAAyGAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFpAAAAAAAAAAAAAAAAAAAAb3AAAAAAAAAAAAAA3qLMAAAAFpAAAAAAAAAAAAAAAAAAIaAAAAAAAAAA9NAAAAAALMAAyGAAAAAAAAAAAAAAAAAA04AAAAAAAAAAAAAAQwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvUAAWUpwAAAAAAAAAAAAAAAAAAAAAAAAAA6bAAAAAAAAb3AAAAAAAA9NAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvUAAWUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIab3AAAAAAAAAAAAAAAAAAAAyGAAAAAAAAAAm/AAAAAAAAAAAAAAAAAAAAAAQwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC3AApwAAQwAAAAAAAAyGAAAAAAAAAAm/AAAAAAAAAAAAAAAAAAAAAAQwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFpZFsiAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFpAAAAAAAAAAAAAAAAAAAAb3AAAAAAAAAAAAAAAAAAAAAAAAZFAAAAAAAAAAAAhbAAAAAAAAAAAAAAAAAAAAAAAAAAyGAAAAsiAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA6bAAAAAAAAb3AAAAAAAAAAAAkN3qAAAAAAAAAAAAAATiAAAAN+AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvUAAAAAAAAAAAAAAAAepAAAAZFAAAAAAm/AAAAAAAAAAAAAAAAAApw9NAAkNAA","reverse":true,"order":{"count":500,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,24,25,26,27,28,29,30,31,32],"tail":[470,471,472,473,474,475,476,477,478,479,480,482,483,484,485,481,438,486,487,488,489,490,491,492,493,494,496,495,497,498,23,499],"sha256":"711de30b3a6c7c8fd61929efb5ab177a2ff3109fe305ed5be47461b5863e1323"}},{"distances":"CJAANfAAAASXAAu+AA018BAA","reverse":false,"order":{"count":12,"items":[0,1,2,3,4,5,6,7,8,9,10,11]}},{"distances":"kQoiup45AAZkAAI+N39NTZWasoGGMQAAAfP1AA1L","reverse":true,"order":{"count":20,"items":[3,4,6,9,2,12,1,0,5,11,10,8,14,7,15,17,13,16,18,19]}},{"distances":"AFgC////QDAFQDAF//wBgCAF//AFQD//AFAFQDQDAFgCAFwBwBwB////gCgC//gCwB//wB//QDgCwBAF////wBgCwBQDwB//AFQDgCgCgCgCwBwBwBAFQDQDgCwBQD//wBQDwBgC////gCAFQDAF//AF//QD//AFwB////////gCQD//AFQD//AFQD////AFAFwB//gCgCwBwBgC//QDgCwB//gC//gCQD//wBQDAFQD//AF//gCAF//wBgCAFAFQDQDwB////gCwB//gCwBgCQDAFAFwBgCwBwBgCAFwBQD//QDAFgCwB//QDAFwBgCwBQD////wBwB////gCgCQDAFwB//wB////AFgC//gCwBQDwBAFwBAF//wBAFAF//AFQDAF//wBwB//gCQDwB//gCQDQDgCQDQD//gCgCwBQDQDgCQD//AF////wBAFQDgCQD//AF//gCgCwBgCAFgCAFQDgCgC//wBQDgC//wBQDwBwBwBAFgCwBQD//gCwBwBQDgCwBAFQDgCQDgCgCgC//QDAFAF//wBwBQDAFQDAFQDwB//QD//wB//gCAFgCAFQDgCAF//wB","reverse":true,"order":{"count":294,"items":[292,284,282,280,271,267,253,243,239,228,226,220,219,217,209,202,198,195,191,187,179,176,175,173,167,166,163,162,155,150,135,132,131,123,120,118,113,110,108,104,98,94,93,90,87,84,83,82,81,78,76,74,69,68,63,47,41,40,35,33,30,27,26,15,12,8,3,2,293,283,279,273,272,259,256,255,251,248,247,246,244,240,231,221,212,201,197,196,188,185,183,181,174,172,165,164,160,158,154,148,145,144,142,137,134,130,124,114,107,102,101,97,80,66,64,61,56,55,54,46,44,42,38,34,32,25,24,23,9,290,287,285,266,265,264,262,258,254,250,242,238,237,234,232,230,229,224,215,211,210,206,203,199,180,178,169,168,159,153,146,143,138,136,133,125,121,111,109,106,103,100,99,85,70,67,60,53,52,51,50,43,37,31,29,28,21,10,1,289,281,278,276,274,268,263,261,257,252,245,241,236,225,223,216,214,213,208,207,205,204,200,193,182,170,161,156,151,149,139,129,128,117,115,112,105,92,89,86,77,72,65,62,59,58,49,45,36,19,18,14,6,4,291,288,286,277,275,270,269,260,249,235,233,227,222,218,194,192,190,189,186,184,177,171,157,152,147,141,140,127,126,122,119,116,96,95,91,88,79,75,73,71,57,48,39,22,20,17,16,13,11,7,5,0]}},{"distances":"AATim/AAAAhbAAIab3AAAAWUAA","reverse":true,"order":{"count":13,"items":[0,2,3,4,5,6,8,1,7,9,10,11,12]}},{"distances":"/6/2/0/tAA/e/J/FAA+z+t+NAA97AAAA9zAA9lAAAAAAAAAAAA8v8q8p8YAA8S8NAAAAAAAA7y7y7s7l7dAA7Y7S7RAAAA7D64616eAA6T6R6JAA5o5GAAAA4s4n4l4XAAAAAAAA4C3wAAAA3bAA3FAA28AA2y2tAA1zAAAA1k1j1S1G1DAA0o0l0g0V0L0FAAznAAAAAAzUzSzRzQzQzNy2yqypAAAAyDx/x7AAx5x4AAAAxZAAw3w2AAwnwmwewbAAwVwFwDv8vwvvvivfvUAAAAuxAAupuiucAAuZuSuHAAuAAAt2t1totmtdtHtDs2AAstsoAAsUsRsOsNAAAAAAriAArbrYAArBq5AAAAqrqqqmqJAAqFp2pxpcpZAAoKn/n6nwnoAAndnYAAAAnOnMnKAAmpmlmjAAmcmPmJmBl4l4lsAAAAliAAAAAAk/krklAAAAi1ivitAAAAAAAAiIAAiFh+AAAAhgAAg4goghAAAAAAfLe/AAAAAAevAAAAAAAAAAAAeJAAd3d0dzAAdpdhdNAAcpcocIcIb+boblbXbMbGa9AAarahabAAAAZtZtZsAAAAAAAAYxYuAAAAYJYHYDYAAAXrXnAAAAW7WyAAWTWOAAAAAAAAV7VwAAViVPVDVCAAU6UwAAUpAAAAUYAAUFAAAAAATsTkAATeTZAATKAAAASzSrAAAASTSPAAR1RuAARiReRcRSREAAQ+QwQvAAQhQgQaQPQOQLQHAAP4AAPqAAPUPMPCOzAAAAOpOfOPAAAANoNZNUNMM7AAAAMoMCAAAAAAAAAALdAAAAAAJXJVAAAAAAI5IsIkIcIPICAAAAAAAAHlAAHeAAHRHGAAG+AAAAAAGaAAAAAAAAF2AAFyAAFQFNFMFDAAAAAAAAEbEaAAAADsDmDiDHC/C3AAAAAACUCUAACGBqBmAABfBZBXAAAwAAAAAL","reverse":true,"order":{"count":478,"head":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31],"tail":[446,447,448,449,450,451,452,453,454,455,456,457,458,459,460,461,462,464,463,465,466,467,468,469,470,471,472,473,474,475,476,477],"sha256":"c805ae7120a7a573b4f9dea7fc56c3a3ebe45f5db02abe5b0a63ca95d59ec794"}},{"distances":"AAAAAAAAAAAAAAQ1AAAAAA","reverse":false,"order":{"count":11,"items":[0,1,2,3,4,5,6,7,8,9,10]}},{"distances":"AFTim/6bAAAAAAIaAAvUAAWUAAAAQwAA3qLMAAyGAAZFAAAFAAm/6bAAhb04Iab3vUAAAAAA9NQwkN3qLMAAyGAAAAsiAATim/AAAAhb04AAAAAAAAWUpw9NQwkNAALMepyGFpAAsiAFTiAAAAN+hbAAIaAAvUC3WUpw9NAAkN3qLMAAyGAAAAsiAFAAm/6bN+hb04IaAAAAC3WUpwAAAAkN3qLMepyGFpAAsiAAAAm/AAN+AA04Iab3vUAAAApwAAAAkN3qAAepyGAAAAsiAFTiAA6bN+hb04IaAAvUC3AApwAAQwAAAAAAAAAAAAZFsiAFTim/AAAAhb04AAb3AAAAWUAA9NAAAAAALMepAAFpZFsiAAAAm/6bN+hb04AAAAvUC3WUpw9NAAkN3qAAepAAFpZFsiAAAAm/6bAAAA04AAAAvUAAAAAAAAAAkN3qLMAAyGFpAAAAAATiAAAAAAhbAAIaAAAAAAAAAA9NQwkN3qAAepAAFpZFsiAFTim/AAN+hb04AAb3AAAAAAAA9NQwkN3qLMAAyGFpZFAAAFAAm/AAAAAA04Iab3AAAAWUAA9NAAkNAALMepAAFpZFAAAATiAA6bN+hb04Iab3AAC3AApw9NQwAA3qLMepAAFpAAsiAFTim/6bAAhb04IaAAvUC3WUAAAAAAAAAAAAepAAFpAAAAAATiAAAAAAhb04AAAAAAAAWUpw9NQwAA3qAAepyGFpZFsiAFAAm/6bN+hbAAAAAAAAC3WUAA9NQwAA3qAAAAAAFpAAsiAAAAm/6bAAhbAAIaAAAAC3AAAAAAAAAA3qLMepAAFpAAsiAFTim/6bN+hbAAAAb3vUC3WUpwAAQwkN3qLMAAyGFpZFAAAFTim/AAAAAAAAIab3vUC3WUAA9NAAAAAAAAAAAAFpAAsiAFTiAAAAN+AAAAAAAAAAC3WUAAAAAAAA3qLMAAyGFpAAsiAFAAm/6bN+hbAAIab3vUAAWUpwAAQwkNAALMepyGFpZFsiAATiAA6bAAhbAAIab3AAC3WUAA9NQwAA3qAAepAAAAZFAAAFTim/6bAAhb04Iab3vUC3WUpw9NQwkN3qLMepyGAAZFsiAAAAm/AAN+hb04AAAAAAC3AApw9NQwkNAALMepyGAAZFAAAATim/6bAAhb04AAb3AAC3WUAA9NQwAAAAAAepAAFpZFsiAFTim/6bN+AA04AAb3AAAAAApw9NQwkN3qLMepyGFpZFAAAAAAm/AAN+AAAAIab3vUC3AApwAAAAAA3qLMAAyGAAZFAAAFAAAAAAN+hbAAIaAAAAC3AApw9NAAkNAALMepAAFpZFsiAATiAA6bN+hb04AAAAvUAAAAAA9NQwkN3qAAepAAFpZFAAAAAAm/AAN+hb04IaAAAAC3WUpw9NAAAA3qLM","reverse":true,"order":{"count":708,"head":[3,2,1,0,4,5,6,8,10,12,13,15,16,18,19,14,20,22,24,26,27,29,32,9,25,28,31,21,11,17,30,7],"tail":[686,689,690,691,693,698,699,703,696,673,666,702,692,682,695,672,685,688,665,701,668,681,694,671,697,687,664,700,704,705,706,707],"sha256":"6080c073dd0f19f7736d2a911190d480fce2dd4a012cce7d7febe9cd31f506c0"}},{"distances":"AFTi","reverse":true,"order":{"count":2,"items":[1,0]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMAAyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NAAkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3","reverse":true,"order":{"count":172,"items":[151,59,64,128,105,82,36,13,152,164,141,118,95,72,49,26,3,154,131,108,85,62,39,16,167,144,121,98,75,52,29,6,157,134,111,88,65,42,19,170,147,124,101,78,55,32,9,160,137,114,91,68,45,22,150,127,104,81,58,35,12,163,140,117,94,71,48,25,2,153,130,107,84,61,38,15,166,143,120,97,74,51,28,5,156,133,110,87,41,18,169,146,123,100,77,54,31,8,159,136,113,90,67,44,21,149,126,103,80,57,34,11,162,139,116,93,70,47,24,1,129,106,83,60,37,14,165,142,119,96,73,50,27,4,155,132,109,86,63,40,17,168,145,122,99,76,53,30,7,158,135,112,89,66,43,20,171,148,125,102,79,56,33,10,161,138,115,92,69,46,23,0]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMep","reverse":false,"order":{"count":19,"items":[0,10,7,17,4,14,1,11,8,18,5,15,2,12,9,6,16,3,13]}},{"distances":"AAAAAAAAAAAA","reverse":true,"order":{"count":6,"items":[0,1,2,3,4,5]}},{"distances":"AAAAAA","reverse":false,"order":{"count":3,"items":[0,1,2]}},{"distances":"YloYHFWsu6YNFgvo1ZMV2/KESMCWAOzo4Wc0L0LtRb4o9BvLYjtaeDBi64se0ToVzttwahkzNeHVGpHKFBJlHLepIiChkiPXdU06ggWpBpb3hqIgHyHnJ2v/OZtSnlHOLb2uxiGQSp49dHTNYw+RY8MDnQtSGs9t6vawe50EplWVaIT9phb4gh1TQK7yy1Z1tOUOl4eGpY4v3p3EJE8zEefUWAmOVfAhDIHztU7SmVJ/OJ+IP+LYCh47kw4omYqKgEekUDr4qFci9i7tSaKjQPUtz27HLK9rMAhXV9egDIZU05xW8p8KeKC2yC/8ScehumfP6kCgeWtij3pMuIV2EW6igBe2nrMVw6MKqAxJCQOgokXQm9f1KyQ5IyzjpoxeUfQCDV8Rma7wsaWPUKOqspSSJaTF77/s7N5FoyqFUxu7kVSPTMjqvv5W8g4/CcmYx8FhzqVN9J2Fcuk7Y+HzDzldpw7gGXQmLVY+W07J6lqjNk9nKeXru5rwaAdOPQWARxJz1sr1aEx7N36BFaVo","reverse":true,"order":{"count":266,"items":[157,207,73,119,79,143,247,134,228,22,105,152,220,195,153,206,93,197,135,237,115,208,243,141,28,80,244,162,171,263,219,209,221,69,123,101,125,21,16,102,103,10,65,229,258,8,91,49,150,30,83,140,32,226,15,189,94,156,224,261,66,191,151,179,176,59,218,7,23,213,4,250,160,168,33,165,25,114,77,61,96,202,29,198,131,259,251,245,127,211,132,178,236,190,84,88,100,167,210,182,1,31,174,62,76,184,196,223,126,116,109,98,235,231,35,124,46,214,166,217,54,145,90,50,128,172,185,107,161,82,173,43,129,159,147,164,154,99,26,48,253,70,17,230,133,89,53,81,34,86,260,252,95,149,241,232,74,72,0,24,5,249,183,242,3,51,85,199,255,108,146,169,265,110,227,212,139,192,97,200,130,87,71,216,205,68,158,136,203,215,12,256,20,187,239,138,92,193,120,47,254,201,181,60,118,262,246,36,175,9,177,75,144,18,19,64,121,240,142,186,137,248,11,117,58,257,41,204,104,188,44,55,233,113,56,57,37,63,42,39,2,78,38,238,67,225,6,264,40,106,170,234,194,148,112,155,122,45,163,222,13,180,52,27,111,14]}},{"distances":"ATAaAvBBBGBHBMBRBZBcBeBhBrCWChChCuCwCyC3DCDCDKDgDjAAEDEEEUEWEgEmE0FCFGFSFZF2F4F+GyG2H0H2H+IHIRAAJsJ+KFKWKmK5LVL4MCMEMjM8NuNvN+OAOTOWObOyPGPSPmQBQDQNQqQrQ5RBRHR5SBSPSVSWSmSrSyTFTGTITlTmUtVIVIVKVVVWVzV2WKWOXCXrYAYCYDYJYUYVYYAAYeYkYsY/ZAZDZJZMZZZpZyZyaPaQaYaxbdbmbob2b+cMc2c+dDdTdaddd2d2d3d4eUeqere8fEfQfefuf2f8gPgmhVhth6iDiSiWiui6jEjKj9kDkGkIAAk4k7lGlIlZlblil/mMmqmvnNnanpnxnxn4oDokpMpQpYpfpfptqMqUqtq4q+rJrSrvrxsRsSsttNtZtgtgt1t8uQuTunuzvRvgvwv/wDwGwGwGwIwNwQwZwfwzw8xLxhxixmyXycyhyyy5y6zIzKzazv0B0O0h0o0o0s0/1J1S1n1v131/2D2V2q2w3I3T3u3w334C4E4H4U4i425I5M5W5q506C6M6S6T6e6i6u647F7S7i8N8V8b8c8c8k9Y9n9x+D+K+p+4+6+6/0/3/4","reverse":true,"order":{"count":309,"items":[8,7,6,5,4,3,2,1,0,25,46,45,44,43,42,41,40,39,38,37,36,35,34,33,32,31,30,29,28,27,26,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,47,92,91,90,89,88,87,86,85,84,83,82,81,80,79,78,77,76,75,74,73,72,71,70,69,68,67,66,65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,111,169,168,167,166,165,164,163,162,161,160,159,158,157,156,155,154,153,152,151,150,149,148,147,146,145,144,143,142,141,140,139,138,137,136,135,134,133,132,131,130,129,128,127,126,125,124,123,122,121,120,119,118,117,116,115,114,113,112,110,109,108,107,106,105,104,103,102,101,100,99,98,97,96,95,94,93,170,308,307,306,305,304,303,302,301,300,299,298,297,296,295,294,293,292,291,290,289,288,287,286,285,284,283,282,281,280,279,278,277,276,275,274,273,272,271,270,269,268,267,266,265,264,263,262,261,260,259,258,257,256,255,254,253,252,251,250,249,248,247,246,245,244,243,242,241,240,239,238,237,236,235,234,233,232,231,230,229,228,227,226,225,224,223,222,221,220,219,218,217,216,215,214,213,212,211,210,209,208,207,206,205,204,203,202,201,200,199,198,197,196,195,194,193,192,191,190,189,188,187,186,185,184,183,182,181,180,179,178,177,176,175,174,173,172,171]}},{"distances":"AFTim/6bN+hb","reverse":true,"order":{"count":6,"items":[3,2,5,1,4,0]}},{"distances":"9f74AAAAAA0vAAAAAAAAAAAAAAAAAAAAgdAAAAAAAA","reverse":true,"order":{"count":21,"items":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20]}},{"distances":"AAAAAAAAAAAAAAAAAAAAAA","reverse":true,"order":{"count":11,"items":[0,1,2,3,4,5,6,7,8,9,10]}},{"distances":"AFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+hb04Iab3vUC3WUpw9NQwkN3qLMepyGFpZFsiAFTim/6bN+","reverse":true,"order":{"count":741,"head":[726,703,680,657,634,611,588,565,542,519,496,473,450,427,404,381,358,335,312,289,266,243,220,197,174,151,128,105,82,59,36,13],"tail":[713,690,667,644,621,598,575,552,529,506,483,460,437,414,391,368,345,322,299,276,253,230,207,184,161,138,115,92,69,46,23,0],"sha256":"6992238e5fcbf2ea9ecd5d2242550c77387749cf41788b1424b0f32bc09cd39f"}},{"distances":"AFAAm/6bAAhb04AAAAvUAAWUpw9NQwkN3qAAepyGFpZFAAAATiAAAAN+hbAAIab3vUAAWUpw9NAAkNAAAAepAAAAAAsiAFTiAAAAN+hbAAAAAAAAC3WUAAAAAAAAAALMAAyGAAZFAAAAAAm/6bN+AAAAAAAAvUAAWUpwAAQwAA3qLMepAAAAAAsiAATiAA6bN+AAAAAAAAvUC3WUAA9NQwAA3qAAepAAFpAAsiAATiAAAAAAAAAAIab3AAAAWUpw9NQwkN3qAAepyGFpAAsiAATiAA6bN+hb04AAAAvUC3AAAAAAAAkN3qAAepAAFpZFsiAFAAm/6bN+AAAAIab3AA","reverse":false,"order":{"count":171,"items":[0,1,20,30,27,34,2,3,4,5,6,7,8,14,9,10,24,11,21,31,18,28,15,12,35,32,19,16,13,17,22,23,25,26,29,33,41,38,36,37,39,40,42,43,44,46,50,47,45,48,49,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,73,83,71,72,74,75,76,77,80,81,78,79,82,84,86,87,88,89,90,102,112,96,91,92,93,94,116,110,114,108,95,97,98,99,100,103,101,104,106,105,107,109,111,113,115,117,118,119,120,121,122,123,124,125,161,148,142,129,139,130,147,131,132,135,159,133,137,134,136,138,140,168,165,169,143,144,141,145,146,149,150,151,152,158,126,156,153,154,155,157,163,127,160,85,162,164,128,166,167,170]}}]} diff --git a/test/OptunaSharp.Tests/oracle/gen_cma_pickle_oracle.py b/test/OptunaSharp.Tests/oracle/gen_cma_pickle_oracle.py index 3a42e82..6e3ecad 100644 --- a/test/OptunaSharp.Tests/oracle/gen_cma_pickle_oracle.py +++ b/test/OptunaSharp.Tests/oracle/gen_cma_pickle_oracle.py @@ -19,8 +19,15 @@ `protocol5_cases` are restored states re-pickled with protocol 5, the default from CPython 3.14, whose numpy arrays are `_frombuffer` + BYTEARRAY8 instead of `_reconstruct` + BUILD. -Run in the repo's main Python env (the interpreter the interop suite uses; cmaes 0.13.1, numpy 2.4.2): +Run in the repo's main Python env (the interpreter the interop suite uses; cmaes 0.13.1, numpy 2.5.4, the NumPy whose +OpenBLAS NumSharp 0.81.0 bundles, so the eigendecompositions in the told states match C# bit for bit): python test/OptunaSharp.Tests/oracle/gen_cma_pickle_oracle.py + +Two runs never write the same file: cmaes keeps `_funhist_values` from `np.empty`, so every pickle carries whatever +memory that buffer got, and the gzip headers of the codec cases carry a timestamp. CmaPickleOracleTests take the +entries cmaes has not written yet from Python's state and compare the rest byte for byte, so a regeneration is a real +change only where those tests' expectations move (NumSharp 0.81.0's OpenBLAS moved the 30-dimensional case's told +state). """ import base64 import gzip @@ -234,8 +241,7 @@ def main(): oracle["protocol5_cases"] = protocol5_cases(oracle["variants"]) path = os.path.join(os.path.dirname(os.path.abspath(__file__)), "cma_pickle_oracle.json") # LF on every OS, as the repository stores text (.gitattributes eol=lf). - with open(path, "w", newline=" -") as f: + with open(path, "w", newline="\n") as f: json.dump(oracle, f, indent=1) print("wrote", path) diff --git a/test/OptunaSharp.Tests/oracle/gen_cpython_order_oracle.py b/test/OptunaSharp.Tests/oracle/gen_cpython_order_oracle.py new file mode 100644 index 0000000..aa9b407 --- /dev/null +++ b/test/OptunaSharp.Tests/oracle/gen_cpython_order_oracle.py @@ -0,0 +1,236 @@ +"""Record CPython's iteration order of int-set differences and the order list.sort() leaves NaN-bearing tuples in. + +Two orders Optuna inherits from CPython itself, not from Optuna's code, which OptunaSharp reproduces in +OptunaSharp.Internal.PyIntSet and OptunaSharp.Internal.PyListSort and replays from this corpus with no Python at test +time (Internal/CPythonOrderOracleTests): + +* ``set_difference``: GridSampler's ``list(set(range(n)) - set(visited) - set(running))`` and + ``list(set(range(n)) - set(visited))`` (QA-68). The order is CPython's hash-table slot order, which depends on the + table sizes, the probe sequence, and which of ``set_difference``'s two strategies runs. +* ``list_sort``: NSGA-III's ``list.sort(reverse=True)`` over ``(np.float64 distance, int index)`` tuples (QA-56). A + NaN distance compares neither smaller nor larger than anything, so the result is whatever CPython's timsort (with + its powersort merge policy since 3.11) does with an inconsistent order: only an exact port reproduces it. The + distances come from :data:`POOL` (NaN, the infinities, both zeros, k / 4090), two characters per distance; the + replay rebuilds the pool, as IEEE division makes ``k / 4090`` the same double on both sides. + +The corpus pins CPython 3.12, the interpreter the interop suite runs on (CI installs 3.12). CPython 3.13 changed +``count_run`` (equal-element runs), which can change the order NaN-bearing lists end up in, so the generator refuses +another minor version rather than record a different order under the same file name. + +Run in the repo's main Python env: + python test/OptunaSharp.Tests/oracle/gen_cpython_order_oracle.py +""" +import base64 +import hashlib +import json +import os +import random +import sys + +import numpy as np + +OUT = os.path.join(os.path.dirname(os.path.abspath(__file__)), "cpython_order.json") +FULL_LIST_LIMIT = 400 +ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" +# The distances a sort case draws from, written to the corpus once: NaN, the infinities, both zeros, then 4,091 values +# k / 4090 in [0, 1]. A case stores each distance as two ALPHABET characters, its pool index in base 64. +POOL = [float("nan"), float("inf"), float("-inf"), 0.0, -0.0] + [k / 4090 for k in range(4091)] + + +def bitmap(values, n): + """Encode a set of ints in ``range(n)`` as a little-endian bitmap, base64, so large cases stay small. + + Args: + values: The ints to encode, possibly with duplicates; every one is in ``range(n)``. + n: The size of the universe; the bitmap holds ``ceil(n / 8)`` bytes. + + Returns: + The base64 text of the bitmap, bit ``k % 8`` of byte ``k // 8`` set for each ``k`` in ``values``. + """ + data = bytearray((n + 7) // 8) + for k in values: + data[k >> 3] |= 1 << (k & 7) + return base64.b64encode(bytes(data)).decode("ascii") + + +def describe(order): + """Describe an iteration order so the replay can check it whole: in full when short, else by digest. + + Args: + order: The list of ints in the order CPython produced. + + Returns: + A dict with ``count`` and either ``items`` (the full list) or ``head`` / ``tail`` (the first and last 32) and + ``sha256`` (of the decimal ints joined by commas, UTF-8). + """ + if len(order) <= FULL_LIST_LIMIT: + return {"count": len(order), "items": order} + text = ",".join(str(v) for v in order).encode("utf-8") + return { + "count": len(order), + "head": order[:32], + "tail": order[-32:], + "sha256": hashlib.sha256(text).hexdigest(), + } + + +def set_case(n, visited, running): + """Record GridSampler's two set differences for one history. + + Args: + n: The grid size, ``len(all_grids)``. + visited: Grid ids of finished trials (duplicates allowed, as GridSampler's list has them). + running: Grid ids of running trials (duplicates allowed; may overlap ``visited``). + + Returns: + The case: ``n``, the two bitmaps, and the orders of ``set(range(n)) - set(visited) - set(running)`` + (``unvisited``) and of ``set(range(n)) - set(visited)`` (``unfinished``). + """ + unvisited = list(set(range(n)) - set(visited) - set(running)) + unfinished = list(set(range(n)) - set(visited)) + return { + "n": n, + "visited": bitmap(visited, n), + "running": bitmap(running, n), + "unvisited": describe(unvisited), + "unfinished": describe(unfinished), + } + + +def set_cases(rng): + """Build the set-difference cases: the journal's example, edge sizes, and random histories. + + The random histories cover both of ``set_difference``'s strategies (copy-then-discard when the left set is more + than four times the right one, a fresh table otherwise), the dummy purge after discards, and the table growth of + ``set(range(n))`` on both sides of 50,000 elements. + + Args: + rng: The seeded ``random.Random`` drawing the histories. + + Returns: + The list of cases (see :func:`set_case`). + """ + cases = [set_case(16, [0, 1, 2, 3, 5, 6, 7, 9, 10, 12, 13, 14, 15], [])] # QA-68: [8, 11, 4] + for n in (0, 1, 2, 5, 7, 8, 9, 31, 32, 33, 64, 100): + cases.append(set_case(n, [], [])) + cases.append(set_case(n, list(range(0, n, 2)), list(range(1, n, 3)))) + for _ in range(240): + n = rng.choice([rng.randint(1, 40), rng.randint(1, 300), rng.randint(1, 3000)]) + visited_density = rng.choice([0.0, 0.01, 0.1, 0.3, 0.6, 0.9, 0.99, 1.0]) + running_density = rng.choice([0.0, 0.0, 0.02, 0.1, 0.5]) + visited = [k for k in range(n) if rng.random() < visited_density] + running = [k for k in range(n) if rng.random() < running_density] + # Duplicates, as GridSampler's lists hold one entry per trial. + visited += [rng.choice(visited) for _ in range(len(visited) // 7)] if visited else [] + rng.shuffle(visited) + cases.append(set_case(n, visited, running)) + for n in (49999, 50001, 70000): + visited = [k for k in range(n) if rng.random() < 0.97] + running = [k for k in range(n) if rng.random() < 0.001] + cases.append(set_case(n, visited, running)) + cases.append(set_case(n, [k for k in range(n) if rng.random() < 0.05], [])) + return cases + + +def encode(codes): + """Encode pool indices as the compact text a sort case stores. + + Args: + codes: Indices into :data:`POOL`, each below 4,096. + + Returns: + Two :data:`ALPHABET` characters per index, the high base-64 digit first. + """ + return "".join(ALPHABET[c >> 6] + ALPHABET[c & 63] for c in codes) + + +def sort_case(codes, reverse): + """Record the order ``list.sort`` leaves NSGA-III's ``(distance, index)`` tuples in. + + Args: + codes: The distances as indices into :data:`POOL`. NSGA-III takes its distances from a float64 array, so + each tuple gets its own ``np.float64`` object and two NaNs are never identical, never equal. + reverse: Whether to sort with ``reverse=True`` (NSGA-III's call). + + Returns: + The case: the encoded distances, ``reverse``, and the indices in sorted order (see :func:`describe`). + """ + array = np.array([POOL[c] for c in codes], dtype=np.float64) + pairs = [(array[i], i) for i in range(len(codes))] + pairs.sort(reverse=reverse) + return {"distances": encode(codes), "reverse": reverse, "order": describe([i for _, i in pairs])} + + +def quantize(x): + """Map a value in [0, 1] to the pool index of the nearest k / 4090. + + Args: + x: The value, in [0, 1]. + + Returns: + Its pool index (5 for 0.0, 4095 for 1.0). + """ + return 5 + int(round(x * 4090)) + + +def sort_cases(rng): + """Build the sort cases: the journal's example, structured runs, and random NaN-bearing lists. + + Sizes reach past 64 so runs are extended by binary insertion, merged by the powersort policy, and merged with + galloping; NaN rates from none to all, ties from a small value pool, infinities and signed zeros. + + Args: + rng: The seeded ``random.Random`` drawing the lists. + + Returns: + The list of cases (see :func:`sort_case`). + """ + cases = [sort_case([0, 0], True)] # QA-56: the borderline front of two (inf, inf) trials, NaN distances + special = [1, 2, 3, 4, quantize(0.25), quantize(0.5), quantize(1.0)] + for size in (0, 1, 2, 3, 7, 32, 63, 64, 65, 127, 128, 129, 300, 1000): + for nan_rate in (0.0, 0.05, 0.3, 1.0): + for reverse in (True, False): + codes = [0 if rng.random() < nan_rate else rng.choice(special + [quantize(rng.random())]) + for _ in range(size)] + cases.append(sort_case(codes, reverse)) + for _ in range(240): + size = rng.choice([rng.randint(0, 20), rng.randint(20, 200), rng.randint(200, 800)]) + nan_rate = rng.choice([0.0, 0.01, 0.1, 0.4, 0.9]) + shape = rng.choice(["random", "ascending", "descending", "plateaus", "sawtooth"]) + if shape == "random": + codes = [quantize(rng.random()) for _ in range(size)] + elif shape == "ascending": + codes = sorted(quantize(rng.random()) for _ in range(size)) + elif shape == "descending": + codes = sorted((quantize(rng.random()) for _ in range(size)), reverse=True) + elif shape == "plateaus": + codes = [quantize(rng.randint(0, 4) / 4) for _ in range(size)] + else: + codes = [quantize(((i * 7) % 23) / 23) for i in range(size)] + codes = [0 if rng.random() < nan_rate else c for c in codes] + cases.append(sort_case(codes, rng.random() < 0.7)) + return cases + + +def main(): + """Write ``cpython_order.json`` beside this script. Rerunning on the same CPython rewrites an identical file. + + Raises: + SystemExit: Under a CPython other than 3.12, whose sort may order NaN-bearing lists differently. + """ + if sys.version_info[:2] != (3, 12): + raise SystemExit("record with CPython 3.12 (see the module docstring); this is %s" % sys.version.split()[0]) + rng = random.Random(20261112) + corpus = { + "python": sys.version.split()[0], + "set_difference": set_cases(rng), + "list_sort": sort_cases(rng), + } + with open(OUT, "w", encoding="utf-8", newline="\n") as f: + json.dump(corpus, f, separators=(",", ":")) + f.write("\n") + print("wrote", OUT, len(corpus["set_difference"]), "set cases,", len(corpus["list_sort"]), "sort cases") + + +if __name__ == "__main__": + main() diff --git a/test/OptunaSharp.Tests/oracle/gen_numpy_scalar_math_oracle.py b/test/OptunaSharp.Tests/oracle/gen_numpy_scalar_math_oracle.py new file mode 100644 index 0000000..c39ca6e --- /dev/null +++ b/test/OptunaSharp.Tests/oracle/gen_numpy_scalar_math_oracle.py @@ -0,0 +1,101 @@ +"""Record NumPy's float64 log1p / expm1 / logaddexp over a fixed input set, as raw bit patterns. + +OptunaSharp's MathUtil.Log1p / Expm1 / LogAddExp delegate to NumSharp's public models of the UCRT routines NumPy calls +on Windows (NumSharp.Utilities.NDLog1pExpm1Math / NDLogAddExpMath). Internal/MathUtilNumSharpModelTests replays this +corpus with no Python at test time: log1p, logaddexp and expm1 outside [-ln 2, ln 1.5] must match bit for bit, expm1 +inside that band within 2 ulp (the UCRT's in-band polynomial is undocumented; no public formula reproduces it). + +The corpus is a win-amd64 pin. NumPy's float64 log1p / expm1 call the platform's libm: the UCRT on Windows, glibc (or +SVML loops on AVX-512 machines) on Linux, Apple's libm on macOS, so the recorded bits are those of Windows NumPy and +the replay runs on Windows only. + +Run on Windows in the repo's main Python env (the interpreter the interop suite uses): + python test/OptunaSharp.Tests/oracle/gen_numpy_scalar_math_oracle.py +""" +import json +import os +import platform +import struct + +import numpy as np + +OUT = os.path.join(os.path.dirname(os.path.abspath(__file__)), "numpy_scalar_math.json") +LN2 = float(np.log(2.0)) +LN15 = float(np.log(1.5)) + + +def bits(x): + """Encode a float64 as its IEEE-754 bit pattern, so the C# replay reads back the exact value (NaN payloads and + the sign of zero included), which a decimal repr would not guarantee across formatters. + + Args: + x: The value to encode; a Python float or a NumPy float64 scalar. + + Returns: + The big-endian bit pattern as 16 lowercase hex digits (``"3ff0000000000000"`` for ``1.0``). + """ + return struct.pack(">d", float(x)).hex() + + +def main(): + """Record NumPy's outputs over the fixed, seeded input set and write ``numpy_scalar_math.json`` beside this script. + + The inputs cover each function's special values, both sides of expm1's UCRT band, the two ranges where + TruncNorm.NdtriExp calls expm1, tiny and huge magnitudes, and logaddexp's cancellation regime (near-equal pairs). + Rerunning it on the same NumPy rewrites an identical file. + + Raises: + SystemExit: When run off Windows, where NumPy's log1p/expm1 come from another libm and the corpus would no + longer describe what the Windows replay checks. + """ + if platform.system() != "Windows": + raise SystemExit("record on Windows: NumPy's log1p/expm1 call the platform libm (see the module docstring)") + rng = np.random.default_rng(20261111) + + log1p_x = np.concatenate([ + np.array([0.0, -0.0, -1.0, np.inf, 5e-324, -5e-324, 1e-300, -1e-300, 1e-17, -1e-17, 2.0 ** -53, 1.0, 2.0]), + rng.uniform(-1.0, 1.0, 60), + -1.0 + 10.0 ** rng.uniform(-15, -1, 20), + rng.choice([-1.0, 1.0], 30) * 10.0 ** rng.uniform(-300, -1, 30), + 10.0 ** rng.uniform(0, 300, 40), + ]) + + expm1_x = np.concatenate([ + np.array([0.0, -0.0, -LN2, LN15, -1000.0, -745.2, 709.7, 710.0, -np.inf, np.inf, 5e-324, -1e-300, 1e-17]), + rng.uniform(-40.0, -LN2, 40), + rng.uniform(LN15, 700.0, 40), + rng.uniform(-LN2, LN15, 60), + -rng.uniform(0.0, 1e-2, 30), # TruncNorm.NdtriExp's flip branch, expm1(y) for y in (-1e-2, 0]. + rng.uniform(1e-2, 5.0, 30), # its initial guess, expm1(-z) for -z in [1e-2, 5]. + rng.choice([-1.0, 1.0], 20) * 10.0 ** rng.uniform(-300, -3, 20), + ]) + + a = rng.uniform(-50.0, 50.0, 80) + near_b = a + rng.choice([-1.0, 1.0], 80) * 10.0 ** rng.uniform(-17, 2, 80) + wide_a = rng.uniform(-1000.0, 1000.0, 40) + wide_b = rng.uniform(-1000.0, 1000.0, 40) + special = np.array([ + [0.0, 0.0], [-1e-5, -1e-5], [np.inf, np.inf], [-np.inf, -np.inf], [np.inf, 1.0], [-np.inf, 1.0], + [1.0, -np.inf], [-700.0, -701.0], [-1.0, -2.0], [745.0, 745.0], [-745.0, -746.0], + ]) + lae_a = np.concatenate([special[:, 0], a, wide_a]) + lae_b = np.concatenate([special[:, 1], near_b, wide_b]) + + with np.errstate(all="ignore"): + corpus = { + "numpy": np.__version__, + "platform": platform.platform(), + "machine": platform.machine(), + "band": {"low": bits(-LN2), "high": bits(LN15)}, + "log1p": [{"x": bits(x), "y": bits(y)} for x, y in zip(log1p_x, np.log1p(log1p_x))], + "expm1": [{"x": bits(x), "y": bits(y)} for x, y in zip(expm1_x, np.expm1(expm1_x))], + "logaddexp": [{"a": bits(p), "b": bits(q), "y": bits(y)} for p, q, y in zip(lae_a, lae_b, np.logaddexp(lae_a, lae_b))], + } + with open(OUT, "w", encoding="utf-8", newline="\n") as f: + json.dump(corpus, f, indent=1) + f.write("\n") + print(f"wrote {OUT}: log1p {len(corpus['log1p'])}, expm1 {len(corpus['expm1'])}, logaddexp {len(corpus['logaddexp'])}") + + +if __name__ == "__main__": + main() diff --git a/test/OptunaSharp.Tests/oracle/numpy_scalar_math.json b/test/OptunaSharp.Tests/oracle/numpy_scalar_math.json new file mode 100644 index 0000000..05dccb5 --- /dev/null +++ b/test/OptunaSharp.Tests/oracle/numpy_scalar_math.json @@ -0,0 +1,2254 @@ +{ + "numpy": "2.4.2", + "platform": "Windows-11-10.0.26200-SP0", + "machine": "AMD64", + "band": { + "low": "bfe62e42fefa39ef", + "high": "3fd9f323ecbf984c" + }, + "log1p": [ + { + "x": "0000000000000000", + "y": "0000000000000000" + }, + { + "x": "8000000000000000", + "y": "8000000000000000" + }, + { + "x": "bff0000000000000", + "y": "fff0000000000000" + }, + { + "x": "7ff0000000000000", + "y": "7ff0000000000000" + }, + { + "x": "0000000000000001", + "y": "0000000000000001" + }, + { + "x": "8000000000000001", + "y": "8000000000000001" + }, + { + "x": "01a56e1fc2f8f359", + "y": "01a56e1fc2f8f359" + }, + { + "x": "81a56e1fc2f8f359", + "y": "81a56e1fc2f8f359" + }, + { + "x": "3c670ef54646d497", + "y": "3c670ef54646d497" + }, + { + "x": "bc670ef54646d497", + "y": "bc670ef54646d497" + }, + { + "x": "3ca0000000000000", + "y": "3ca0000000000000" + }, + { + "x": "3ff0000000000000", + "y": "3fe62e42fefa39ef" + }, + { + "x": "4000000000000000", + "y": "3ff193ea7aad030b" + }, + { + "x": "bf901422201cb500", + "y": "bf9034ca7cba6f98" + }, + { + "x": "3fef2b9b344e0496", + "y": "3fe5c35ed85646df" + }, + { + "x": "3fe5ee2353f7debc", + "y": "3fe0b3db68523994" + }, + { + "x": "3fd85e88e809fe88", + "y": "3fd4a6279765e045" + }, + { + "x": "bfebf96dc97c1374", + "y": "c000959891f3d6e2" + }, + { + "x": "3fe9b49f03f27cde", + "y": "3fe2de2578baae8c" + }, + { + "x": "bfce4e6c33647038", + "y": "bfd14ada0803ff33" + }, + { + "x": "bfe6bf541ddf1a12", + "y": "bff3da6f5af5d3c2" + }, + { + "x": "bfdd98f6f1d98404", + "y": "bfe3dd38462f3e4d" + }, + { + "x": "bfdd7d4ed1d57328", + "y": "bfe3c388e7c722eb" + }, + { + "x": "bfed298fe1f3deca", + "y": "c00361d0225aec4d" + }, + { + "x": "3fdf66a784b87f68", + "y": "3fd98c96f26bbc0d" + }, + { + "x": "3fd7b5bcde176c4c", + "y": "3fd42b72a4213545" + }, + { + "x": "3fe90b2a62feda10", + "y": "3fe27fa22ac721a4" + }, + { + "x": "3fe06c1ff23c186a", + "y": "3fda82ad1769a5c1" + }, + { + "x": "bfec7f5ca3cbe06e", + "y": "c001b2b5e45a93bc" + }, + { + "x": "3fe4796f480cbc68", + "y": "3fdfa7572f13bc50" + }, + { + "x": "3fed704a59d33f12", + "y": "3fe4dfaa7588cd82" + }, + { + "x": "bfc07e525bb32570", + "y": "bfc1a83e4941ad25" + }, + { + "x": "3fc0c1a183d91558", + "y": "3fbf7e5c61cbd3f3" + }, + { + "x": "bfbfe4046121b8f0", + "y": "bfc1079202681af8" + }, + { + "x": "3fe52c4136982b3a", + "y": "3fe03fffcba58977" + }, + { + "x": "bfd45424774781fc", + "y": "bfd875d36e3ddbd7" + }, + { + "x": "bfef0a7d7ce16d44", + "y": "c00c0f843b0328df" + }, + { + "x": "3fc9ee26fb1bc988", + "y": "3fc79cb2859cbe67" + }, + { + "x": "bfd17f77dde7bcf4", + "y": "bfd470d265cb3bbd" + }, + { + "x": "bfe627be6723ca16", + "y": "bff2dc5ac1bca628" + }, + { + "x": "3fe29757206a6dac", + "y": "3fdd508c1a39b104" + }, + { + "x": "3fe330bd7c0b4a1e", + "y": "3fde1176e24c100a" + }, + { + "x": "3fae4b6f2a633520", + "y": "3fad6ea8de044d57" + }, + { + "x": "bfe92a93a819d372", + "y": "bff8b3b30c4db7cf" + }, + { + "x": "3fe10519f26a3946", + "y": "3fdb4ba0dd0b2191" + }, + { + "x": "3fdaeab449e1c248", + "y": "3fd677cc32028aa2" + }, + { + "x": "3fda9e9f5b8f2150", + "y": "3fd6422724875e3d" + }, + { + "x": "3fe4cc63680425be", + "y": "3fe0061a054a181a" + }, + { + "x": "bfe6a13c5d1fa46e", + "y": "bff3a6b9a26a004e" + }, + { + "x": "bfe6897269872e18", + "y": "bff37e4dfcdb058a" + }, + { + "x": "bfa2509c428e9a80", + "y": "bfa2a6863198ebf3" + }, + { + "x": "3fa814a82c865900", + "y": "3fa78813f8b7144e" + }, + { + "x": "bfe5d7437848f688", + "y": "bff25b99bd7f1433" + }, + { + "x": "3fbc79bf3ddbbae0", + "y": "3fbb00142564ab3f" + }, + { + "x": "3fe09c2e27b1c5c6", + "y": "3fdac21186d3d84a" + }, + { + "x": "3fe1d45654568afc", + "y": "3fdc57fbe742042b" + }, + { + "x": "bfc8d3ef655fe7f0", + "y": "bfcb99d04e37ebf0" + }, + { + "x": "3fd5e404b0bfb570", + "y": "3fd2d40c81220ed3" + }, + { + "x": "bfe637d35ed2ccc8", + "y": "bff2f69338b5b43d" + }, + { + "x": "3fc5a11d13b28650", + "y": "3fc3fc1984c387af" + }, + { + "x": "bfe2656863ef8fba", + "y": "bfeb5f484f3a2618" + }, + { + "x": "3fdddedd5a7c7a28", + "y": "3fd883a020a5ec3e" + }, + { + "x": "bfe2d2d6ecdb221e", + "y": "bfec64d3a19b046a" + }, + { + "x": "3fed18ac87318cea", + "y": "3fe4b1e756e4fa69" + }, + { + "x": "3fe41a50952a852a", + "y": "3fdf32ea5e4c33d0" + }, + { + "x": "3fda4caa9ce32970", + "y": "3fd6082b47d2f202" + }, + { + "x": "bfd2e3b43ba412a0", + "y": "bfd66296a14029bb" + }, + { + "x": "bfe53ac87334a134", + "y": "bff16c48666354e5" + }, + { + "x": "bfeb627dd2ecb77a", + "y": "bffefb5af946515d" + }, + { + "x": "3fd2ef4c66f7c984", + "y": "3fd09642bde0631e" + }, + { + "x": "3fedf19c9b1994c0", + "y": "3fe522bf2e540211" + }, + { + "x": "3feaad7d5313f296", + "y": "3fe367010d7ddfd4" + }, + { + "x": "3fd2e9b7e05d47d8", + "y": "3fd091f43768be7c" + }, + { + "x": "bfeffffffe0feb74", + "y": "c0337090b3416a4f" + }, + { + "x": "bfef4fa6c29199df", + "y": "c00eb5259f5ffe74" + }, + { + "x": "bfefffffffffffac", + "y": "c040272a79e86b40" + }, + { + "x": "bfeffcf179ac86b0", + "y": "c01f9302c785efb4" + }, + { + "x": "bfeffffffffb5e3d", + "y": "c0381d0d30098ba2" + }, + { + "x": "bfeffffffffffd51", + "y": "c03e3457e6e6cd93" + }, + { + "x": "bfefffffca204f5e", + "y": "c0301d5802682bc5" + }, + { + "x": "bfefffffe7c8e3a1", + "y": "c030ea0e8d229b50" + }, + { + "x": "bfeffab4ed9490b3", + "y": "c01d60bf9dd1e473" + }, + { + "x": "bfeff868ba247e86", + "y": "c01bef93b5f3c55e" + }, + { + "x": "bfefe2e15f08278a", + "y": "c0168ed92eb57c33" + }, + { + "x": "bfeffffae0f859ab", + "y": "c029d86c210d2968" + }, + { + "x": "bfeffffffcbf1024", + "y": "c032ebe69eb3c1cd" + }, + { + "x": "bfeffd28004310bb", + "y": "c01fdcf85ae31643" + }, + { + "x": "bfeffffffebf9b89", + "y": "c033e07c74eb8a6a" + }, + { + "x": "bfeffffffffffd15", + "y": "c03e1ee883a01672" + }, + { + "x": "bfeffffffffffee6", + "y": "c03f184af0b9afdd" + }, + { + "x": "bfefffffffc2b7ae", + "y": "c03587ec6d507092" + }, + { + "x": "bfefffffffff6ee5", + "y": "c03a36d356c59336" + }, + { + "x": "bfeffeaf2c55f73a", + "y": "c02179196608c5c1" + }, + { + "x": "b1ff750d644a5adb", + "y": "b1ff750d644a5adb" + }, + { + "x": "363433852d897235", + "y": "363433852d897235" + }, + { + "x": "1c62630321bc02d5", + "y": "1c62630321bc02d5" + }, + { + "x": "119fbc3ddd4d7d18", + "y": "119fbc3ddd4d7d18" + }, + { + "x": "0a888415edc226fa", + "y": "0a888415edc226fa" + }, + { + "x": "2481da3ced3b25fa", + "y": "2481da3ced3b25fa" + }, + { + "x": "99cf511c0ba1cc60", + "y": "99cf511c0ba1cc60" + }, + { + "x": "a81517c4e357425a", + "y": "a81517c4e357425a" + }, + { + "x": "8fed7143a698b154", + "y": "8fed7143a698b154" + }, + { + "x": "9d248c44c98cbbb6", + "y": "9d248c44c98cbbb6" + }, + { + "x": "88f9582f85a358bd", + "y": "88f9582f85a358bd" + }, + { + "x": "9430195cecb66dc8", + "y": "9430195cecb66dc8" + }, + { + "x": "217944d5015bd686", + "y": "217944d5015bd686" + }, + { + "x": "a255cc0fd6d6c077", + "y": "a255cc0fd6d6c077" + }, + { + "x": "90fbc9dde5ea7719", + "y": "90fbc9dde5ea7719" + }, + { + "x": "1c7b62359a1298a1", + "y": "1c7b62359a1298a1" + }, + { + "x": "9988473b2c2a0267", + "y": "9988473b2c2a0267" + }, + { + "x": "afd0979f7dce19bf", + "y": "afd0979f7dce19bf" + }, + { + "x": "2bc741f3ad8fe2df", + "y": "2bc741f3ad8fe2df" + }, + { + "x": "8d23a59d0082ae24", + "y": "8d23a59d0082ae24" + }, + { + "x": "16345b61ae09358d", + "y": "16345b61ae09358d" + }, + { + "x": "aef99f28abe32fa7", + "y": "aef99f28abe32fa7" + }, + { + "x": "20786e5849000cff", + "y": "20786e5849000cff" + }, + { + "x": "0d69ebe177199aca", + "y": "0d69ebe177199aca" + }, + { + "x": "051be4e77ff3324f", + "y": "051be4e77ff3324f" + }, + { + "x": "94ae67ab89f73ee1", + "y": "94ae67ab89f73ee1" + }, + { + "x": "37f4c04f1c331c71", + "y": "37f4c04f1c331c71" + }, + { + "x": "18818c08d2a138de", + "y": "18818c08d2a138de" + }, + { + "x": "aee49ad4088f993c", + "y": "aee49ad4088f993c" + }, + { + "x": "9f36d4242a9dd897", + "y": "9f36d4242a9dd897" + }, + { + "x": "6a3948d1e65461b5", + "y": "407d5066ca0bcc14" + }, + { + "x": "4992bab6c41cf08f", + "y": "405ab9bd22e60296" + }, + { + "x": "450b634a6f506e57", + "y": "404c5759f32ca5df" + }, + { + "x": "59c184cf6a56cac4", + "y": "4071e5c47d1877ec" + }, + { + "x": "4906dc10d9b22bd2", + "y": "4059373d70bdebce" + }, + { + "x": "5d6f655e0a166115", + "y": "40747257b4e2c088" + }, + { + "x": "7670e974f6911d62", + "y": "4082e3d6930cfc5a" + }, + { + "x": "728493f303b4322a", + "y": "4081880fc4abf4ae" + }, + { + "x": "47736d92285edef7", + "y": "4054d7cb637ecd1f" + }, + { + "x": "6b077abd72985a63", + "y": "407ddf641fcd8b51" + }, + { + "x": "7bb4e1347b90afad", + "y": "4084b751b3bff5c9" + }, + { + "x": "56fb34144fd5ec6f", + "y": "406ff37c3f72e534" + }, + { + "x": "49269677cca34e25", + "y": "40598f32776baf33" + }, + { + "x": "69e3f5ffc9266947", + "y": "407d152ac9f54014" + }, + { + "x": "75f508a28d42f4ec", + "y": "4082b938bc29123b" + }, + { + "x": "61924f3e09b94e98", + "y": "407750c4ad220952" + }, + { + "x": "52fbdaef0ca69c76", + "y": "406a68ad7580f701" + }, + { + "x": "496db37754215374", + "y": "405a522a11404791" + }, + { + "x": "7dd8014a3c7e01a5", + "y": "408574f89811b7bc" + }, + { + "x": "7c0dec6636276eb7", + "y": "4084d5ec87fad763" + }, + { + "x": "63b709bd60dfbd38", + "y": "4078cd8413f08da3" + }, + { + "x": "48ce151e0ed366d6", + "y": "4058975de9c8f3be" + }, + { + "x": "78816d9a9930023f", + "y": "40839b11cf1fc891" + }, + { + "x": "4bc5befb39798110", + "y": "406069f91cb5048b" + }, + { + "x": "625d052c8de3445e", + "y": "4077dd38be0928e3" + }, + { + "x": "4a723c74f95d5952", + "y": "405d25173fe44933" + }, + { + "x": "4e9245a1acb01ad8", + "y": "40644a88fb085af5" + }, + { + "x": "4b700bd3f80555dc", + "y": "405fe2af8cf387cb" + }, + { + "x": "40f2f07a031ae2d8", + "y": "4026849e7581fa8a" + }, + { + "x": "57066416f9484c9f", + "y": "407001b7d2f14dea" + }, + { + "x": "69a9aef1cd1ac21a", + "y": "407cecd6bb45130e" + }, + { + "x": "466cd2c6541c1da7", + "y": "4051fee57ab67917" + }, + { + "x": "685e72069f298553", + "y": "407c06a9ad8dd330" + }, + { + "x": "64e0efd186eee4a1", + "y": "40799b4f64c761bf" + }, + { + "x": "5f28bd744d96c1ca", + "y": "4075a50f798610aa" + }, + { + "x": "6df2174f5206d780", + "y": "407fe47769e88914" + }, + { + "x": "6f62df5ff4fe5e3f", + "y": "4080721c5305e116" + }, + { + "x": "55c0cd6b08063634", + "y": "406e3ea2335e2311" + }, + { + "x": "704b188c5338cbe2", + "y": "4080c2a2f26ca7d0" + }, + { + "x": "7e31e1e7ce1063a4", + "y": "408593e2f6ebb6d0" + } + ], + "expm1": [ + { + "x": "0000000000000000", + "y": "0000000000000000" + }, + { + "x": "8000000000000000", + "y": "8000000000000000" + }, + { + "x": "bfe62e42fefa39ef", + "y": "bfe0000000000000" + }, + { + "x": "3fd9f323ecbf984c", + "y": "3fe0000000000000" + }, + { + "x": "c08f400000000000", + "y": "bff0000000000000" + }, + { + "x": "c08749999999999a", + "y": "bff0000000000000" + }, + { + "x": "40862d999999999a", + "y": "7fed75ae7a50ee14" + }, + { + "x": "4086300000000000", + "y": "7ff0000000000000" + }, + { + "x": "fff0000000000000", + "y": "bff0000000000000" + }, + { + "x": "7ff0000000000000", + "y": "7ff0000000000000" + }, + { + "x": "0000000000000001", + "y": "0000000000000001" + }, + { + "x": "81a56e1fc2f8f359", + "y": "81a56e1fc2f8f359" + }, + { + "x": "3c670ef54646d497", + "y": "3c670ef54646d497" + }, + { + "x": "c0432de13baccb32", + "y": "bff0000000000000" + }, + { + "x": "c043c80ea8c42aba", + "y": "bff0000000000000" + }, + { + "x": "c03dfafbd36faf68", + "y": "bfeffffffffffca4" + }, + { + "x": "c028a119b91dd5b8", + "y": "bfeffff697d6a9f5" + }, + { + "x": "c01888f8bca4f9a0", + "y": "bfefee3c840b823a" + }, + { + "x": "c0423121e471dd40", + "y": "bfefffffffffffff" + }, + { + "x": "c01fe9308ab255c0", + "y": "bfeffd30a2fccca9" + }, + { + "x": "c03d9f713e3e61e8", + "y": "bfeffffffffffb33" + }, + { + "x": "c034dcdda8d819ae", + "y": "bfefffffff88749e" + }, + { + "x": "c0422d66f5beeac7", + "y": "bfefffffffffffff" + }, + { + "x": "c034f3b1c5489d48", + "y": "bfefffffff92a781" + }, + { + "x": "c03cf09685238322", + "y": "bfeffffffffff67f" + }, + { + "x": "c027f399b70a322a", + "y": "bfeffff2cc7d5a34" + }, + { + "x": "c0411fe0c1e1d7f6", + "y": "bfeffffffffffff4" + }, + { + "x": "c02d70fc2618fd9e", + "y": "bfefffff26d9424d" + }, + { + "x": "c02806ba62c216f0", + "y": "bfeffff3486a0fdc" + }, + { + "x": "c0108bcaf517abc8", + "y": "bfef7d1ad4b95b98" + }, + { + "x": "c03d6dc0dce586b5", + "y": "bfeffffffffffa2c" + }, + { + "x": "c0228e9bdb6243ea", + "y": "bfefff3c1bed00f5" + }, + { + "x": "c0404650c9755398", + "y": "bfefffffffffffbe" + }, + { + "x": "c022ee0774582d0c", + "y": "bfefff5d6ab03afe" + }, + { + "x": "c0315d918f0588b4", + "y": "bfeffffff094153e" + }, + { + "x": "c03bcdc436e27092", + "y": "bfefffffffffe266" + }, + { + "x": "c02c15baad070756", + "y": "bfeffffe54204bfb" + }, + { + "x": "c02034873a5c9308", + "y": "bfeffd8514dfae61" + }, + { + "x": "c039e34a4ab85b92", + "y": "bfefffffffff36e8" + }, + { + "x": "c0169c10488084a8", + "y": "bfefe340f576740e" + }, + { + "x": "c035e6ad227426e8", + "y": "bfefffffffd5aced" + }, + { + "x": "c03b24fa25c13b58", + "y": "bfefffffffffc6c4" + }, + { + "x": "c0412940c571b776", + "y": "bfeffffffffffff5" + }, + { + "x": "c0355903549a2985", + "y": "bfefffffffb664a3" + }, + { + "x": "c035f6e378f8b30e", + "y": "bfefffffffd845d3" + }, + { + "x": "c042d1837f315f8d", + "y": "bff0000000000000" + }, + { + "x": "c038132a0595dea4", + "y": "bfeffffffffb2f8c" + }, + { + "x": "c03622c8d867c421", + "y": "bfefffffffde8860" + }, + { + "x": "c031ad3a31682545", + "y": "bfeffffff4b3ca08" + }, + { + "x": "c02cd4a6351502d6", + "y": "bfeffffed94e5338" + }, + { + "x": "c008b693328a9d20", + "y": "bfee8aee24c75d63" + }, + { + "x": "c02f0169de39547e", + "y": "bfefffff9caa0014" + }, + { + "x": "c04254aef574016c", + "y": "bfefffffffffffff" + }, + { + "x": "4065373a98d53536", + "y": "4f3d186b3ef36aa9" + }, + { + "x": "408570148ce1001c", + "y": "7dca0d176cb6dec5" + }, + { + "x": "4071a3028b02e98b", + "y": "596148d186e55534" + }, + { + "x": "406e7e8ecad735d4", + "y": "55eef70d51dea917" + }, + { + "x": "4071532e91f91ff8", + "y": "58ee22ea5993dc62" + }, + { + "x": "4083cc0e0dbdde66", + "y": "790f10961152ca8b" + }, + { + "x": "4041ce3ee18f4ed5", + "y": "4324c4697f2501bf" + }, + { + "x": "405ca004f679d2b5", + "y": "4a423d6481ddf5b8" + }, + { + "x": "406937b4bfe6af1c", + "y": "522091d544e716a3" + }, + { + "x": "40653246a42c1c32", + "y": "4f38ec581999d6e7" + }, + { + "x": "407841cf4d92d346", + "y": "62ee75d994241e12" + }, + { + "x": "407536a5d694d92c", + "y": "5e8982c970c4427a" + }, + { + "x": "407b9222f448c5da", + "y": "67b56c90a9fdd6f4" + }, + { + "x": "405f7326c061603a", + "y": "4b46785deed98cda" + }, + { + "x": "407d44a1d8150a9a", + "y": "6a283be42b846b4e" + }, + { + "x": "408266c029d52932", + "y": "7506f9ed3d8fd324" + }, + { + "x": "406221ed074b421d", + "y": "4d03651aafa86877" + }, + { + "x": "40820ec283f7f0fe", + "y": "74092d89248aceb2" + }, + { + "x": "4035189d102c8273", + "y": "41d5a29a078e6774" + }, + { + "x": "4077b6f7ee7910d9", + "y": "6225416215233979" + }, + { + "x": "407777572ae240d5", + "y": "61c9806f807afb67" + }, + { + "x": "4031242ca55a9a69", + "y": "417a88445ae37737" + }, + { + "x": "4054ee380abdfdd9", + "y": "477b9487034c0652" + }, + { + "x": "405bf6ae31dc2da3", + "y": "4a04b3f26f3a859b" + }, + { + "x": "4018b7f261e8430c", + "y": "407e1d0e2fc844b7" + }, + { + "x": "4075032d43153d26", + "y": "5e405bd01afe8200" + }, + { + "x": "4063d32ead9de1c5", + "y": "4e3c105384294378" + }, + { + "x": "4082a92cb1585aaa", + "y": "75c6a3ab7ab6b3fb" + }, + { + "x": "407e2a34fbf3ea45", + "y": "6b73b0848d6452c8" + }, + { + "x": "4046e44c06ac46e8", + "y": "4410958827cbe3b7" + }, + { + "x": "407b418161e26342", + "y": "6741c33f03139573" + }, + { + "x": "40816dddff7445ce", + "y": "7238eb6823a1ee6f" + }, + { + "x": "405f64a9f55c2998", + "y": "4b41eb15a48793cf" + }, + { + "x": "40831822e844d3ca", + "y": "7706ce01ad58614a" + }, + { + "x": "40770b0c102447d3", + "y": "612e05405ceafb28" + }, + { + "x": "40803404b98444d4", + "y": "6eb07537e2e614f2" + }, + { + "x": "407cc9452757bdd4", + "y": "69763f712be918c1" + }, + { + "x": "40718c7666dd456f", + "y": "5940e48e4fad66b6" + }, + { + "x": "40712fae15d50fd8", + "y": "58ba36ded9aa7ac8" + }, + { + "x": "4071b3a5e9f458a7", + "y": "597872ab41fa5627" + }, + { + "x": "3fbb1ac7d6eedf28", + "y": "3fbc976cd5e6cc5e" + }, + { + "x": "bfb61df0abbe5a08", + "y": "bfb53041137a3ec6" + }, + { + "x": "bfd7d704cea3e895", + "y": "bfd3e74051b523c4" + }, + { + "x": "bfd20c6477ee3f5c", + "y": "bfcf741e132bccd0" + }, + { + "x": "bfddfa57abaedbb0", + "y": "bfd7ef9d20a5411c" + }, + { + "x": "3fa9173d4f319390", + "y": "3fa9b73aa20bea7d" + }, + { + "x": "bfbbff471b3e3f50", + "y": "bfba85430922a61b" + }, + { + "x": "bfe0e846fea18797", + "y": "bfda4469423a039a" + }, + { + "x": "bfe4bf76ce3838fa", + "y": "bfde88dde2768be8" + }, + { + "x": "bfd7e0c5051f68c4", + "y": "bfd3edf7b974146e" + }, + { + "x": "bfe0aeeaa47a510c", + "y": "bfda008975013c8f" + }, + { + "x": "bfcc179e07426942", + "y": "bfc939247ae9d564" + }, + { + "x": "bfc0a77eda7d3420", + "y": "bfbf3b8ea9883b8e" + }, + { + "x": "3fca28e7778c59c4", + "y": "3fcd06574a4d23ff" + }, + { + "x": "3fc8d5fb911165f0", + "y": "3fcb68b5b5922e8e" + }, + { + "x": "bfe2c2d2600b8d7a", + "y": "bfdc64123e924dc2" + }, + { + "x": "bfd1e63847a9e2af", + "y": "bfcf3a772c4db561" + }, + { + "x": "bfc0f3f5d4401104", + "y": "bfbfc1ac256e2044" + }, + { + "x": "bfac61acc50cc230", + "y": "bfab9bf784b56b98" + }, + { + "x": "bfa81bb6bdfb8940", + "y": "bfa78caa7285f2bb" + }, + { + "x": "bfe1a6e5abab7b80", + "y": "bfdb2295df41e9a1" + }, + { + "x": "bfdb9e59e968c96d", + "y": "bfd66e75a19ac472" + }, + { + "x": "bfd92be952575163", + "y": "bfd4cfb407030b1d" + }, + { + "x": "bfaa606bc778d4d0", + "y": "bfa9b5701a53a37b" + }, + { + "x": "3fc5053857e6b5f8", + "y": "3fc6d84a7eb50c55" + }, + { + "x": "3fd105ce68faa776", + "y": "3fd38056ad629d97" + }, + { + "x": "bfdef02b1ae9b455", + "y": "bfd8885a24ec16f0" + }, + { + "x": "3fd299d9a203389c", + "y": "3fd5960d3f675181" + }, + { + "x": "bfe430ecf3d07031", + "y": "bfddf27f23247a15" + }, + { + "x": "bfb5a2b0f88f9ae8", + "y": "bfb4bf199a647454" + }, + { + "x": "3fd9419789c863ba", + "y": "3fdef71d81270534" + }, + { + "x": "3f99c190a23a4da0", + "y": "3f9a152fd04a806d" + }, + { + "x": "bf979d24bec83360", + "y": "bf9757f97c4bcc91" + }, + { + "x": "bfd4815d3c5f55c9", + "y": "bfd18b7b5377802d" + }, + { + "x": "3fd7b7db4d85b836", + "y": "3fdcb5d796fa0961" + }, + { + "x": "bfe1aaf03341b708", + "y": "bfdb273d62ac80f6" + }, + { + "x": "bfe2dd312cfdd191", + "y": "bfdc815e59e05fae" + }, + { + "x": "3fb66017ae2a7158", + "y": "3fb761e0556754b0" + }, + { + "x": "3fce3c011c56db08", + "y": "3fd10d4716b1212a" + }, + { + "x": "bfe369be980d50bf", + "y": "bfdd1bf0cb6ac86d" + }, + { + "x": "bfc6f50680a7e828", + "y": "bfc50423da76a9a4" + }, + { + "x": "bfe14526efe9d6ee", + "y": "bfdab14e50a2247d" + }, + { + "x": "bfd7df5c573f630f", + "y": "bfd3ecff598ea9aa" + }, + { + "x": "bfe405e65070aa83", + "y": "bfddc49717d8cbb9" + }, + { + "x": "3fd7dd4a416b7d76", + "y": "3fdcec2150494d30" + }, + { + "x": "bfe4bb790be67d63", + "y": "bfde84b1138034c8" + }, + { + "x": "bfdf981219646890", + "y": "bfd8ef5d7154a128" + }, + { + "x": "bfe46a899a8e5b96", + "y": "bfde2f96d4ce9ef9" + }, + { + "x": "bfd99fcf9f6c9716", + "y": "bfd51da3925ed251" + }, + { + "x": "bfb27c7a5ace9a58", + "y": "bfb1d5a5ab6db7ac" + }, + { + "x": "bfe5a4a0c073657c", + "y": "bfdf75341b1edc0d" + }, + { + "x": "bfe19fbc862e2429", + "y": "bfdb1a551ccf9826" + }, + { + "x": "bf912bc90219c9e0", + "y": "bf91072280867575" + }, + { + "x": "3fc3ad3dedbbcb60", + "y": "3fc5450a934c732a" + }, + { + "x": "3fc54f76786c1af8", + "y": "3fc72fe225811308" + }, + { + "x": "3fc0b90c27bd5ac8", + "y": "3fc1dd49b7fd24af" + }, + { + "x": "bfcad1d4e66461e4", + "y": "bfc8324012487dad" + }, + { + "x": "3fb107938d9c40d8", + "y": "3fb19bd97439c13a" + }, + { + "x": "3fbfab1dafca2210", + "y": "3fc0daf2502069a5" + }, + { + "x": "bfd5930fdf44087b", + "y": "bfd2507f917135e7" + }, + { + "x": "bf7316e418a68e3e", + "y": "bf730b855f71c737" + }, + { + "x": "bf60dd5e96ddd755", + "y": "bf60d8edb1a2845b" + }, + { + "x": "bf839d5468a5512c", + "y": "bf83855c50014495" + }, + { + "x": "bf81179ea8871d83", + "y": "bf8105694e87592f" + }, + { + "x": "bf23aaf9bf5bc148", + "y": "bf23aa990bc7fb33" + }, + { + "x": "bf74327e04c54953", + "y": "bf7425c3f30e5b65" + }, + { + "x": "bf841a98b67f6b0f", + "y": "bf84016b281dfa18" + }, + { + "x": "bf71dd66ed58f58f", + "y": "bf71d3716961e379" + }, + { + "x": "bf580e69a5208f57", + "y": "bf5809e4ccd999d2" + }, + { + "x": "bf72eb8bc32ef58f", + "y": "bf72e06067a50caa" + }, + { + "x": "bf6f5fe659bedb8a", + "y": "bf6f5089e8800b78" + }, + { + "x": "bf6bc2bc799eb833", + "y": "bf6bb6b554b81714" + }, + { + "x": "bf61932091dab5f3", + "y": "bf618e4df8628366" + }, + { + "x": "bf6e2d818e3375d2", + "y": "bf6e1f4b3c72fbfa" + }, + { + "x": "bf6901b67059d21a", + "y": "bf68f7f3a4d79a2c" + }, + { + "x": "bf7170dc8433dff3", + "y": "bf71675e7f1d7f69" + }, + { + "x": "bf7c2b955050ad04", + "y": "bf7c12d75711d0ad" + }, + { + "x": "bf7e6be3667ab3aa", + "y": "bf7e4f09fbfb545e" + }, + { + "x": "bf681904458a6605", + "y": "bf680ff3bf31beaf" + }, + { + "x": "bf7f6d0fca2bb18c", + "y": "bf7f4e4732aa995e" + }, + { + "x": "bf60606c818f8c9a", + "y": "bf605c3c70f2906f" + }, + { + "x": "bf80c077d1335f6e", + "y": "bf80aefa0de53cd7" + }, + { + "x": "bf8370459d5b5e21", + "y": "bf8358baf9496f72" + }, + { + "x": "bf00512bb6072148", + "y": "bf00511b121f3a68" + }, + { + "x": "bf79a243ee8dd7a7", + "y": "bf798dc62084d452" + }, + { + "x": "bf74de82e21c8e9c", + "y": "bf74d0ec9c30009a" + }, + { + "x": "bf5bdf3e6cf7f352", + "y": "bf5bd92d9ab999cd" + }, + { + "x": "bf72c0a0179296b2", + "y": "bf72b5a725c209dd" + }, + { + "x": "bf7ed5f979161908", + "y": "bf7eb855bc0f9807" + }, + { + "x": "bf83b55ee0f20ce5", + "y": "bf839d2bfae5aa2c" + }, + { + "x": "4007d3dcb0ac6501", + "y": "4032a8442d36eb50" + }, + { + "x": "40076236a2f85f5e", + "y": "4031989ec0cd1dca" + }, + { + "x": "3fe33311695bcc3b", + "y": "3fea4e8e8539eefe" + }, + { + "x": "3ff9f07be849bcde", + "y": "40103ca3a1c81a3f" + }, + { + "x": "40094d8c2891f3d3", + "y": "4036a36287f81f83" + }, + { + "x": "4011c560b67ce32a", + "y": "4055008bf2bb628c" + }, + { + "x": "3fee43ab94e4f3c9", + "y": "3ff93242e29ec640" + }, + { + "x": "3ffe1cf2ca75eef3", + "y": "401644ad81a4607e" + }, + { + "x": "400686bf7bf665b8", + "y": "402f69b3e83011a4" + }, + { + "x": "3fdb1f6ffd62be56", + "y": "3fe0e34cae409f26" + }, + { + "x": "400286aed7ac5769", + "y": "402243eb15eeddba" + }, + { + "x": "3fe4798543afb376", + "y": "3fecad64b804df5e" + }, + { + "x": "400815f039360708", + "y": "40334d46265550b9" + }, + { + "x": "400c0a1bd1c1c28d", + "y": "404023c06ba1db22" + }, + { + "x": "40096b687d1f72c6", + "y": "4036fc434c2be0e8" + }, + { + "x": "40113699b5821ed4", + "y": "40523c79db207428" + }, + { + "x": "3ff153c8a284f431", + "y": "3fff411a0ce9c6be" + }, + { + "x": "3ff8e616cbff7e3f", + "y": "400decd97a70b7e4" + }, + { + "x": "3fcd1f8d77bd9150", + "y": "3fd059eff648a641" + }, + { + "x": "3ff4ba845882aefb", + "y": "400539405c18ab8e" + }, + { + "x": "3fd4b1ee8b53ca75", + "y": "3fd86ecd5bf7f8ec" + }, + { + "x": "4011ab6a20a6867a", + "y": "40547856567ddbb2" + }, + { + "x": "3fda7dacc1c404db", + "y": "3fe0685764c8cd8e" + }, + { + "x": "4010b65273b805ab", + "y": "40500f42a473f03f" + }, + { + "x": "3fc142ff65042edb", + "y": "3fc27ad2957fcfe5" + }, + { + "x": "3ffeadb0ad3d051a", + "y": "4017368efb304a26" + }, + { + "x": "3ff97a1cf70e63cd", + "y": "400f5221b3a05576" + }, + { + "x": "400b30eb76ef0e19", + "y": "403cee4616cfad30" + }, + { + "x": "3fbe37f248949e67", + "y": "3fc009846b5b7cc2" + }, + { + "x": "4011d6fc768c464c", + "y": "40555ee8e158d1a3" + }, + { + "x": "3ae807765fd374c5", + "y": "3ae807765fd374c5" + }, + { + "x": "0ea731da21c6ca04", + "y": "0ea731da21c6ca04" + }, + { + "x": "94b763970348d4aa", + "y": "94b763970348d4aa" + }, + { + "x": "34f9d92a2ef84eb1", + "y": "34f9d92a2ef84eb1" + }, + { + "x": "9007ef0f308bf74d", + "y": "9007ef0f308bf74d" + }, + { + "x": "3128d908457b2e1f", + "y": "3128d908457b2e1f" + }, + { + "x": "173563e54225bcd4", + "y": "173563e54225bcd4" + }, + { + "x": "9f0fdb318235f13e", + "y": "9f0fdb318235f13e" + }, + { + "x": "9e997b6153a35ba1", + "y": "9e997b6153a35ba1" + }, + { + "x": "8b6c4cd56afc36a8", + "y": "8b6c4cd56afc36a8" + }, + { + "x": "ad62eb84014a7a5e", + "y": "ad62eb84014a7a5e" + }, + { + "x": "0beb390f972deb8e", + "y": "0beb390f972deb8e" + }, + { + "x": "9855b8dafe0c4e06", + "y": "9855b8dafe0c4e06" + }, + { + "x": "aacdabb35d0fdfbf", + "y": "aacdabb35d0fdfbf" + }, + { + "x": "2f416e4303d559db", + "y": "2f416e4303d559db" + }, + { + "x": "a3e21a6999255f19", + "y": "a3e21a6999255f19" + }, + { + "x": "373e853785bb9a2f", + "y": "373e853785bb9a2f" + }, + { + "x": "1d3b656dba65c1d8", + "y": "1d3b656dba65c1d8" + }, + { + "x": "8599b354fefde07a", + "y": "8599b354fefde07a" + }, + { + "x": "250c92d99a197083", + "y": "250c92d99a197083" + } + ], + "logaddexp": [ + { + "a": "0000000000000000", + "b": "0000000000000000", + "y": "3fe62e42fefa39ef" + }, + { + "a": "bee4f8b588e368f1", + "b": "bee4f8b588e368f1", + "y": "3fe62e2e0644b10c" + }, + { + "a": "7ff0000000000000", + "b": "7ff0000000000000", + "y": "7ff0000000000000" + }, + { + "a": "fff0000000000000", + "b": "fff0000000000000", + "y": "fff0000000000000" + }, + { + "a": "7ff0000000000000", + "b": "3ff0000000000000", + "y": "7ff0000000000000" + }, + { + "a": "fff0000000000000", + "b": "3ff0000000000000", + "y": "3ff0000000000000" + }, + { + "a": "3ff0000000000000", + "b": "fff0000000000000", + "y": "3ff0000000000000" + }, + { + "a": "c085e00000000000", + "b": "c085e80000000000", + "y": "c085dd7e70a80828" + }, + { + "a": "bff0000000000000", + "b": "c000000000000000", + "y": "bfe5f9c2a0209f6e" + }, + { + "a": "4087480000000000", + "b": "4087480000000000", + "y": "40874d8b90bfbe8e" + }, + { + "a": "c087480000000000", + "b": "c087500000000000", + "y": "c087457e70a80828" + }, + { + "a": "c02fdb05c9f536f8", + "b": "c02fdb05c9f536ef", + "y": "c02e78219a059355" + }, + { + "a": "401097863eb25840", + "b": "401097893f4b1d12", + "y": "40135d501ede4a04" + }, + { + "a": "c032e1acf3ba03b2", + "b": "c032e1acf3ac75b5", + "y": "c032303adbbb6ae4" + }, + { + "a": "4025c12fcac32200", + "b": "c04f48a905724600", + "y": "4025c12fcac32200" + }, + { + "a": "c0171b32fe4c86b8", + "b": "c0171b3549690235", + "y": "c014556bc3fb5325" + }, + { + "a": "4045ed21bdb3750e", + "b": "4045ed21bdb336c8", + "y": "404645dac9af3ed3" + }, + { + "a": "40207d86ca3668e4", + "b": "40207d86ca2ce825", + "y": "4021e06afa214c23" + }, + { + "a": "c0473de9d7496b76", + "b": "c0473de9d73783d7", + "y": "c046e530cb448ebf" + }, + { + "a": "40209f326a4bf4d0", + "b": "4020a745ebf851c5", + "y": "402206246ea87651" + }, + { + "a": "4042556208187238", + "b": "4042556206391456", + "y": "4042ae1b1324ac30" + }, + { + "a": "400ff2eb2a1dd1f0", + "b": "400ff2eb2a1d9139", + "y": "4012bf3df4ee2008" + }, + { + "a": "402f4ad34ed8a5f8", + "b": "402f4ad34ed8a6e8", + "y": "403056dbbf642507" + }, + { + "a": "c03f62abea7062ae", + "b": "c03f2f73f8461982", + "y": "c03e96567a3078ed" + }, + { + "a": "40288acd542f8b70", + "b": "40288acd542f8b71", + "y": "4029edb1841f2f0f" + }, + { + "a": "403a41afd1650064", + "b": "4040dafbdbe13a5c", + "y": "4040db0ed3690252" + }, + { + "a": "40210a8b5d0e0328", + "b": "40210a8b5ad36455", + "y": "40226d6f8be0575e" + }, + { + "a": "40482030d76bf820", + "b": "404af54662f2e5c2", + "y": "404af5b7c494c141" + }, + { + "a": "c034a9b8149cbbff", + "b": "c034a9b5942f00f7", + "y": "c033f844bc6d4467" + }, + { + "a": "403f0531d72bc190", + "b": "403f0531d0b0aac7", + "y": "403fb6a3ebe60800" + }, + { + "a": "401cfca08ef511f0", + "b": "401cfca08e64ebab", + "y": "401fc268ee8c460b" + }, + { + "a": "40474b9ef8e7e4d0", + "b": "40474b9ef8e780fb", + "y": "4047a45804e39bcd" + }, + { + "a": "4042abbfed03e50a", + "b": "4042abbfed03dd03", + "y": "40430478f8ffc9ee" + }, + { + "a": "40337554c3302c44", + "b": "4033757e271d0350", + "y": "403426db8df48eb5" + }, + { + "a": "c0172e4ca278f1f8", + "b": "c0172e4cba052ee0", + "y": "c01468844e5fc91d" + }, + { + "a": "c03db577e0f492c1", + "b": "c03db577e0f49903", + "y": "c03d0405c8fcc413" + }, + { + "a": "c030c509f453101e", + "b": "c030c55ea9d08242", + "y": "c03013c233990405" + }, + { + "a": "4038617ba5232e88", + "b": "4038617ba44351bf", + "y": "403912edbcab11f3" + }, + { + "a": "3feba516fc4f9000", + "b": "3fef5ee74e6a2804", + "y": "3ff9df10f1cc786c" + }, + { + "a": "404292d532facc94", + "b": "404292d532facc94", + "y": "4042eb8e3ef6b57c" + }, + { + "a": "c03ae5dbe4641116", + "b": "c03ae5d8a1de4c67", + "y": "c03a34682b2808e2" + }, + { + "a": "40391c9f2c7aa110", + "b": "40391cc84d6350de", + "y": "4039ce25d5ba3c9f" + }, + { + "a": "c048a33a5a7ecdf1", + "b": "c048a33a5a7ecdf1", + "y": "c0484a814e82e509" + }, + { + "a": "c03388370d102692", + "b": "c033883701bb72ec", + "y": "c032d6c4ef6dfadf" + }, + { + "a": "401e36c5dd0d7f80", + "b": "401e36c5dd0d86ec", + "y": "40207e471e76653a" + }, + { + "a": "403fcbd15c5e6de8", + "b": "403fcbd15c5e6e03", + "y": "40403ea1ba2b1fe2" + }, + { + "a": "404412ba9f8aae2e", + "b": "404412ba9f8ac52a", + "y": "40446b73ab86a294" + }, + { + "a": "c043134cad8a101a", + "b": "c043134ca3588b5f", + "y": "c042ba939c7564bb" + }, + { + "a": "c03fec4dbe50e226", + "b": "c03fec4dbe50e226", + "y": "c03f3adba6591057" + }, + { + "a": "4012a67ac856a900", + "b": "4017cc1ad11676af", + "y": "4018c5d1e1de6dae" + }, + { + "a": "c0200e0a911aece8", + "b": "c0200e08623aa94d", + "y": "c01d564a9375b674" + }, + { + "a": "3fea503071668000", + "b": "3fea663933908d4a", + "y": "3ff844bcdb7bb176" + }, + { + "a": "40057b29492239e0", + "b": "40057b243b17aae4", + "y": "400b06b781dbe712" + }, + { + "a": "c03db42c4b2d9b2f", + "b": "c03db42c4b3629fe", + "y": "c03d02ba333a10c7" + }, + { + "a": "403d0abbe11d42d8", + "b": "4010a2e322e48404", + "y": "403d0abbe11d5403" + }, + { + "a": "c03f9db9b384a0fc", + "b": "c03f9d604debe8f0", + "y": "c03eec1ae4d9799b" + }, + { + "a": "c047b98b0c6b6fb3", + "b": "c047b9ed81cb63bc", + "y": "c047610331a7fc3a" + }, + { + "a": "4037cc9dc56f8ffc", + "b": "4037cc9dc56ca3e1", + "y": "40387e0fdd65ebbe" + }, + { + "a": "c0435cd034d10699", + "b": "c0435cbf600a1257", + "y": "c043040ebe2ad122" + }, + { + "a": "4046dc54a5b260a4", + "b": "40479f77c485dcab", + "y": "4047b8aea0eabf3b" + }, + { + "a": "c0297cea55f9b228", + "b": "c0297ceff69262f9", + "y": "c0281a08f6546c46" + }, + { + "a": "4045a0fb981c53e4", + "b": "4045a0fb981c5484", + "y": "4045f9b4a4183d1c" + }, + { + "a": "4030110570478c7c", + "b": "4030110570478c7c", + "y": "4030c277883f5e4b" + }, + { + "a": "c0215db89f101f7c", + "b": "c0215dbbb31aeb29", + "y": "c01ff5abf24a942d" + }, + { + "a": "bfd5de0a62b62b00", + "b": "bfd2ad9d03cec15d", + "y": "3fd81bc804ee00e5" + }, + { + "a": "c03963f36da9c3f1", + "b": "c03963f36da9c3f3", + "y": "c038b28155b1f223" + }, + { + "a": "c002a942434e1ea0", + "b": "c002a942434e092f", + "y": "bffa3b63071f0ad8" + }, + { + "a": "403a180049336330", + "b": "403a17fa62d64f11", + "y": "403ac96f6e0104ce" + }, + { + "a": "c03a283b26c23fba", + "b": "c03a5cf36d49d300", + "y": "c0398fca629d647b" + }, + { + "a": "40486cfeb16825ba", + "b": "40486cfeb1667ee6", + "y": "4048c5b7bd633b38" + }, + { + "a": "c0455eff767c306e", + "b": "c0455ef4dd94e981", + "y": "c04506411df090b7" + }, + { + "a": "c046c301842f5916", + "b": "c046d392748e998a", + "y": "c046724c609aefac" + }, + { + "a": "c01d70fdd4353688", + "b": "c01d710679083cc6", + "y": "c01aab39c6bd1caf" + }, + { + "a": "c0359d4f9138e100", + "b": "c0359d4f9138e100", + "y": "c034ebdd79410f31" + }, + { + "a": "4036a4571f767c70", + "b": "4036a4571f767c6f", + "y": "403755c9376e4e3f" + }, + { + "a": "404221551da60f5a", + "b": "404221551da60f5a", + "y": "40427a0e29a1f842" + }, + { + "a": "c03ab79279e4daf0", + "b": "c03ab79279e4daf1", + "y": "c03a062061ed0921" + }, + { + "a": "40407414e9498698", + "b": "4040741488ef4862", + "y": "4040cccdc5185976" + }, + { + "a": "c016dc9e66a18d38", + "b": "c016dc9e66a189a0", + "y": "c01416d606c2442e" + }, + { + "a": "c047dc63ef8a7a7e", + "b": "c047dc63e7eb49c8", + "y": "c04783aadfbef92d" + }, + { + "a": "402a4327fe1466c0", + "b": "402a4327fe146fb3", + "y": "402ba60c2e040ed8" + }, + { + "a": "c0396df8c1f68b02", + "b": "c0396df8c0ed0027", + "y": "c038bc86a979f3c5" + }, + { + "a": "c02f3ccc3b609370", + "b": "c02dc3d3dbfbf70c", + "y": "c02cfb7bd8fd978c" + }, + { + "a": "40395c3ae9aec5e0", + "b": "4039524ac3bb3c0a", + "y": "403a08c146f84fad" + }, + { + "a": "c03cdf34a0179034", + "b": "c03cdf34a040eefc", + "y": "c03c2dc288346dc9" + }, + { + "a": "3ffcfb859b0f5c80", + "b": "3ffcfb859b0f5c7e", + "y": "400409538d463cbb" + }, + { + "a": "3fdd7741e2d0f000", + "b": "3fdd7741e2e258a9", + "y": "3ff274f1f833860d" + }, + { + "a": "40441c475d880b08", + "b": "40441c2539f5e5fc", + "y": "404474ef58de3f5a" + }, + { + "a": "40103f8664d50d38", + "b": "40103f8664d50d39", + "y": "4013054ec4b45476" + }, + { + "a": "40421c35630363ae", + "b": "40421c35630363e5", + "y": "404274ee6eff4cb1" + }, + { + "a": "4045e69d1fe3d80c", + "b": "4045e69d1fe3d80c", + "y": "40463f562bdfc0f4" + }, + { + "a": "c076bf7f6be85014", + "b": "c08bf913b048da91", + "y": "c076bf7f6be85014" + }, + { + "a": "c0825d3f6b2520c1", + "b": "4070c97d94e01904", + "y": "4070c97d94e01904" + }, + { + "a": "c05258a337b66ac8", + "b": "4061140a025ae960", + "y": "4061140a025ae960" + }, + { + "a": "407a6858ff46334c", + "b": "c08a1264ea166d0d", + "y": "407a6858ff46334c" + }, + { + "a": "c0865cf74ff92a72", + "b": "408ab24b67bea236", + "y": "408ab24b67bea236" + }, + { + "a": "4089a32602c8322c", + "b": "c06dcef5bd9820ec", + "y": "4089a32602c8322c" + }, + { + "a": "c07d91bf71dceca8", + "b": "c08d4418d19a7910", + "y": "c07d91bf71dceca8" + }, + { + "a": "c084e64c2d44e3a9", + "b": "4086876dc2ba4f6c", + "y": "4086876dc2ba4f6c" + }, + { + "a": "406fd726c89daed0", + "b": "408ed5b8b016cfde", + "y": "408ed5b8b016cfde" + }, + { + "a": "c08d1218e772e071", + "b": "c072f75258601348", + "y": "c072f75258601348" + }, + { + "a": "c08a9216a4b22c38", + "b": "c07ccee4dbb97226", + "y": "c07ccee4dbb97226" + }, + { + "a": "408538a9fe50303a", + "b": "c0812639efda890e", + "y": "408538a9fe50303a" + }, + { + "a": "4033ca5481e23fe0", + "b": "401e8f8d96b2c080", + "y": "4033ca54da97dd7a" + }, + { + "a": "4071a6a971db9614", + "b": "c08db15e5b822014", + "y": "4071a6a971db9614" + }, + { + "a": "408a14dd417f93ea", + "b": "c0888c12e9d681ae", + "y": "408a14dd417f93ea" + }, + { + "a": "c08bd3e75f464350", + "b": "c08c74472ad48cb3", + "y": "c08bd3e75f45ffba" + }, + { + "a": "4080101bf75a47c8", + "b": "c082fd3305dc1fd3", + "y": "4080101bf75a47c8" + }, + { + "a": "c073e577e17d85a0", + "b": "c06e9d29a15292b8", + "y": "c06e9d29a15292b8" + }, + { + "a": "c07a8a6582c51bcc", + "b": "403e102213690f40", + "y": "403e102213690f40" + }, + { + "a": "406add10e6a41958", + "b": "c0874eb6ff2ffd3a", + "y": "406add10e6a41958" + }, + { + "a": "c08673194316fae2", + "b": "c075f1a9e331c80c", + "y": "c075f1a9e331c80c" + }, + { + "a": "408e8ab256f2cca8", + "b": "4067a49c61a84e20", + "y": "408e8ab256f2cca8" + }, + { + "a": "407e91f40640b07c", + "b": "408c5145a85bf2a2", + "y": "408c5145a85bf2a2" + }, + { + "a": "4088b8b747da0e68", + "b": "407f641c99ce736c", + "y": "4088b8b747da0e68" + }, + { + "a": "40573aca72f242f0", + "b": "c064ef7afbf541b0", + "y": "40573aca72f242f0" + }, + { + "a": "4085ea85fa16f42e", + "b": "c03474b3efb9bb20", + "y": "4085ea85fa16f42e" + }, + { + "a": "4083d04abebe796e", + "b": "408d427aebff5eba", + "y": "408d427aebff5eba" + }, + { + "a": "c0859f61ba8c8b56", + "b": "408d46d708f59552", + "y": "408d46d708f59552" + }, + { + "a": "4087402fc823ac7e", + "b": "c087fe0a67364834", + "y": "4087402fc823ac7e" + }, + { + "a": "407b3341c0cd63c0", + "b": "c07d9aa1e1b2665e", + "y": "407b3341c0cd63c0" + }, + { + "a": "4078bd1f9dbd8154", + "b": "c0727806011b9a56", + "y": "4078bd1f9dbd8154" + }, + { + "a": "c06c6f4e7a0a06f4", + "b": "c08050ec40297cda", + "y": "c06c6f4e7a0a06f4" + }, + { + "a": "c0868f3177ed05f6", + "b": "4075815ca8f7b25c", + "y": "4075815ca8f7b25c" + }, + { + "a": "c067019766f0e4ec", + "b": "4087b042e8fc910e", + "y": "4087b042e8fc910e" + }, + { + "a": "c06dc283baed1efc", + "b": "c08be477b6f86d04", + "y": "c06dc283baed1efc" + }, + { + "a": "4089f06c71a400d4", + "b": "c08d4cf9de015e98", + "y": "4089f06c71a400d4" + }, + { + "a": "c07ace520aa37b32", + "b": "c04a8a837db96c30", + "y": "c04a8a837db96c30" + }, + { + "a": "c08a2657348aa378", + "b": "40716bd04e41f93c", + "y": "40716bd04e41f93c" + }, + { + "a": "40772fdc3a77d1c8", + "b": "40879e71e9417aec", + "y": "40879e71e9417aec" + }, + { + "a": "c0534aa9c3c64468", + "b": "406ad75131531ef8", + "y": "406ad75131531ef8" + } + ] +}