Regenerate the amalgamated headers

Signed-off-by: Niels Lohmann <mail@nlohmann.me>
Move the dump tests of this branch to unit-json_view_dump.cpp
2026-10-21 11:29:53 +00:00 · 2026-10-17 08:32:12 +02:00 · 2026-10-17 08:32:11 +02:00 · 2026-10-17 08:32:10 +02:00 · 2026-10-17 08:32:10 +02:00 · 2026-10-17 08:32:09 +02:00
104 changed files with 743 additions and 574366 deletions
@@ -64,7 +64,6 @@ labels:
    - "tests/src/unit-json_view.*"
    - "tests/src/json_view_test_helpers\\.hpp"
    - "tests/src/fuzzer-(parse_json_view|json_view_image)\\.cpp"
-    - "tests/benchmarks/json_view/.*"
    - "tools/amalgamate/config_json_view\\.json"
    - "docs/mkdocs/docs/features/json_view\\.md"
    - "docs/mkdocs/docs/api/basic_json_(document|view)/.*"
@@ -37,7 +37,7 @@ jobs:
          path: pr/

  check:
-    runs-on: ubuntu-26.04
+    runs-on: ubuntu-latest
    env:
      MAIN_DIR: ${{ github.workspace }}/main
      INCLUDE_DIR: ${{ github.workspace }}/main/single_include/nlohmann
@@ -77,12 +77,13 @@ jobs:
          cd $MAIN_DIR

          # Built from this PR's own tools/macro_builder/main.cpp, not a
-          # develop checkout: unlike amalgamate.py, this tool has no other
-          # source of truth to check against (its own README documents that
-          # it must reproduce macro_scope.hpp byte for byte), so there is
-          # nothing to gain from checking out a separate copy, and doing so
-          # would make this step fail on a PR that adds support for a new
-          # dispatch table until that PR itself merges to develop.
+          # develop checkout: unlike amalgamate.py and generate_natvis.py,
+          # this tool has no other source of truth to check against (its
+          # own README documents that it must reproduce macro_scope.hpp
+          # byte for byte), so there is nothing to gain from checking out a
+          # separate copy, and doing so would make this step fail on a PR
+          # that adds support for a new dispatch table until that PR itself
+          # merges to develop.
          TMPDIR=$(mktemp -d ./macro_builder_check.XXXXXX)
          c++ -std=c++11 tools/macro_builder/main.cpp -o "$TMPDIR/macro_builder"
          "$TMPDIR/macro_builder" > "$TMPDIR/paste.hpp"
@@ -145,14 +146,14 @@ jobs:
      - name: Regenerate nlohmann_json.natvis
        run: |
          cd $MAIN_DIR
-          # The generator and its template are what this check verifies the
-          # committed natvis file against (which namespaces it lists, and
-          # what each entry looks like), so run this PR's copy rather than
-          # the develop checkout's: with develop's, a PR that changes either
-          # could never pass. generate_natvis.py loads the template from its
-          # own directory. Like the macro_builder step above, this only runs
-          # PR content in a job without credentials.
-          python3 tools/generate_natvis/generate_natvis.py $MAIN_DIR
+          # The template is what this check verifies the committed natvis
+          # file against, so take it from this PR rather than from the
+          # develop checkout: generate_natvis.py loads the template from its
+          # own directory, and with develop's copy a PR that changes the
+          # template could never pass. Like the macro_builder step above,
+          # this only renders PR content in a job without credentials.
+          cp tools/generate_natvis/nlohmann_json.natvis.j2 $NATVIS_TOOL_DIR/
+          python3 $NATVIS_TOOL_DIR/generate_natvis.py $MAIN_DIR

      - name: Build patch and check for differences
        id: diff
@@ -21,7 +21,7 @@ permissions:
 jobs:
  CodeQL-Build:

-    runs-on: ubuntu-26.04
+    runs-on: ubuntu-latest
    permissions:
      security-events: write

@@ -1,84 +0,0 @@
-name: "json_view benchmarks"
-
-# On demand only: runs the comparison of json_view with yyjson, simdjson, and
-# Boost.JSON (tests/benchmarks/json_view/compare.py) on GitHub-hosted runners,
-# for numbers from x86-64 and AArch64 Linux. It runs when started by hand, or
-# when a pull request gets the label "benchmark" (on both architectures, with
-# GCC and the default settings). Shared runners are noisy: the results show
-# where json_view stands, but published numbers need a quiet machine (see
-# tests/benchmarks/json_view/README.md).
-
-on:
-  pull_request:
-    types: [labeled]
-  workflow_dispatch:
-    inputs:
-      runner:
-        description: "Runner image"
-        type: choice
-        options:
-          - ubuntu-24.04
-          - ubuntu-24.04-arm
-        default: ubuntu-24.04
-      compiler:
-        description: "Compiler"
-        type: choice
-        options:
-          - g++
-          - clang++
-        default: g++
-      native:
-        description: "Compile for the runner's CPU (-march=native)"
-        type: boolean
-        default: false
-      rounds:
-        description: "Rounds of bench_view"
-        type: number
-        default: 30
-
-permissions:
-  contents: read
-
-concurrency:
-  # (the label is part of the group: adding an unrelated label must not cancel a running benchmark)
-  group: json-view-benchmarks-${{ github.workflow }}-${{ github.ref }}-${{ github.event.label.name }}
-  cancel-in-progress: true
-
-jobs:
-  compare:
-    if: github.event_name == 'workflow_dispatch' || github.event.label.name == 'benchmark'
-    strategy:
-      matrix:
-        runner: ${{ fromJSON(github.event_name == 'workflow_dispatch' && format('["{0}"]', inputs.runner) || '["ubuntu-24.04", "ubuntu-24.04-arm"]') }}
-    runs-on: ${{ matrix.runner }}
-    timeout-minutes: 60
-    steps:
-      - name: Harden Runner
-        uses: step-security/harden-runner@e14015d583714f6e62063499dc959a02595150a1 # v2.21.1
-        with:
-          egress-policy: audit
-
-      - uses: actions/checkout@3d3c42e5aac5ba805825da76410c181273ba90b1 # v7.0.1
-        with:
-          persist-credentials: false
-
-      - name: Download test data
-        run: |
-          cmake -S . -B build -DJSON_BuildTests=On
-          cmake --build build --target download_test_data
-
-      - name: Run the comparison
-        env:
-          CXX: ${{ inputs.compiler || 'g++' }}
-          CC: ${{ inputs.compiler == 'clang++' && 'clang' || 'gcc' }}
-          ROUNDS: ${{ inputs.rounds || 30 }}
-          NATIVE: ${{ inputs.native && '--native' || '' }}
-        run: python3 tests/benchmarks/json_view/compare.py --data build/test_files --download --rounds "$ROUNDS" $NATIVE
-
-      - name: Summary
-        run: cat tests/benchmarks/json_view/results/*.md >> "$GITHUB_STEP_SUMMARY"
-
-      - uses: actions/upload-artifact@043fb46d1a93c77aae656e7c1c64a875d1fc6a0a # v7.0.1
-        with:
-          name: json_view-benchmarks-${{ matrix.runner }}-${{ inputs.compiler || 'g++' }}
-          path: tests/benchmarks/json_view/results/
@@ -50,7 +50,7 @@ jobs:
          persist-credentials: false

      - name: "Run analysis"
-        uses: ossf/scorecard-action@fa7117db83c52d787ae5a89f350999701505d78e # v2.5.0
+        uses: ossf/scorecard-action@2d1146689b8cda280b9bc96326124645441f03bc # v2.4.4
        with:
          results_file: results.sarif
          results_format: sarif
@@ -33,7 +33,7 @@ jobs:
      security-events: write # for github/codeql-action/upload-sarif to upload SARIF results
      actions: read # only required for a private repository by github/codeql-action/upload-sarif to get the Action run status
    name: Scan
-    runs-on: ubuntu-26.04
+    runs-on: ubuntu-latest
    steps:
      - name: Harden Runner
        uses: step-security/harden-runner@ccd8616d44fd3846e67624a50d5aad6d37bf2d25 # v2.22.1
@@ -32,7 +32,7 @@ jobs:
        run: cmake --build build --target ci_test_gcc

  ci_meson_install:
-    runs-on: ubuntu-26.04
+    runs-on: ubuntu-latest
    steps:
      - uses: actions/checkout@3d3c42e5aac5ba805825da76410c181273ba90b1 # v7.0.1
        with:
@@ -77,7 +77,7 @@ jobs:
          cmake --build build-import-split

  ci_infer:
-    runs-on: ubuntu-26.04
+    runs-on: ubuntu-latest
    steps:
      - name: Harden Runner
        uses: step-security/harden-runner@ccd8616d44fd3846e67624a50d5aad6d37bf2d25 # v2.22.1
@@ -106,7 +106,7 @@ jobs:
          if-no-files-found: ignore

  ci_static_analysis_ubuntu:
-    runs-on: ubuntu-26.04
+    runs-on: ubuntu-latest
    strategy:
      matrix:
        target: [ci_test_single_header, ci_cppcheck, ci_cpplint, ci_reproducible_tests, ci_non_git_tests, ci_offline_testdata, ci_reuse_compliance, ci_test_valgrind]
@@ -175,7 +175,7 @@ jobs:
        run: cmake --build build --target ${{ matrix.target }}

  ci_test_coverage:
-    runs-on: ubuntu-26.04
+    runs-on: ubuntu-latest
    steps:
      - name: Harden Runner
        uses: step-security/harden-runner@ccd8616d44fd3846e67624a50d5aad6d37bf2d25 # v2.22.1
@@ -430,7 +430,7 @@ jobs:
        run: cmake --build build --target ci_nvhpc

  ci_emscripten:
-    runs-on: ubuntu-26.04
+    runs-on: ubuntu-latest
    steps:
      - name: Harden Runner
        uses: step-security/harden-runner@ccd8616d44fd3846e67624a50d5aad6d37bf2d25 # v2.22.1
@@ -450,7 +450,7 @@ jobs:
        run: cmake --build build

  ci_test_documentation:
-    runs-on: ubuntu-26.04
+    runs-on: ubuntu-latest
    strategy:
      matrix:
        target: [ci_test_examples, ci_test_build_documentation, ci_test_documentation_mermaid]
@@ -1,7 +1,6 @@
 {
  "_comment": "Used by the ci_infer CMake target (#5715 item 4b). fail-on-issue makes CI fail on Infer findings; disable-issue-type is a type-level baseline for the ~174 pre-existing findings (all PULSE_UNNECESSARY_COPY*/PULSE_RESOURCE_LEAK/PULSE_CONST_REFABLE, mostly in test code) triaged in run https://github.com/nlohmann/json/actions/runs/35829411620 on commit 1054b2097, so CI fails only on a NEW issue type. Remove an entry here once its findings have been fixed or explicitly accepted.",
  "_comment_pulse": "Pulse stops exploring paths after pulse-max-disjuncts (default 20). With the default, basic_json::replace_value() (destroy + assert_invariant) exceeds the limit, Pulse loses the stored type, and reports false NULLPTR_DEREFERENCE findings for get_ptr() results in tests/src/unit-pointer_access.cpp.",
-  "_comment_view": "Infer's model of std::unique_ptr mixes up values that are returned by value and own one: basic_json_document (parse() results) and the `built` values of the build() helper in tests/src/unit-json_view_builder.cpp. It reports USE_AFTER_DELETE for one of them after the destructor of an unrelated object (e.g. ~built() on line 345 invalidating `shallow` on line 350 of that file, or two documents parsed in one lambda in tests/src/unit-json_view_dump.cpp). AddressSanitizer and Valgrind are clean on the same tests, so reports for the json_view test files are excluded; findings reported in the library headers are still reported.",
  "pulse-max-disjuncts": 40,
  "fail-on-issue": true,
  "disable-issue-type": [
@@ -11,8 +10,5 @@
    "PULSE_UNNECESSARY_COPY_OPTIONAL",
    "PULSE_RESOURCE_LEAK",
    "PULSE_CONST_REFABLE"
-  ],
-  "report-block-list-path-regex": [
-    "tests/src/unit-json_view.*\\.cpp"
  ]
 }
@@ -361,10 +361,10 @@ add_custom_target(ci_test_coverage
    COMMAND ${CMAKE_COMMAND} --build ${PROJECT_BINARY_DIR}/build_coverage32
    COMMAND cd ${PROJECT_BINARY_DIR}/build_coverage32 && ${CMAKE_CTEST_COMMAND} --parallel ${N} --output-on-failure

-    COMMAND ${LCOV_TOOL} --directory . --capture --output-file json.info --rc branch_coverage=1 --rc geninfo_unexecuted_blocks=1 --ignore-errors mismatch --ignore-errors unused --ignore-errors inconsistent
-    COMMAND ${LCOV_TOOL} -e json.info ${SRC_FILES} --output-file json.info.filtered --rc branch_coverage=1 --ignore-errors unused --ignore-errors inconsistent
+    COMMAND ${LCOV_TOOL} --directory . --capture --output-file json.info --rc branch_coverage=1 --rc geninfo_unexecuted_blocks=1 --ignore-errors mismatch --ignore-errors unused
+    COMMAND ${LCOV_TOOL} -e json.info ${SRC_FILES} --output-file json.info.filtered --rc branch_coverage=1 --ignore-errors unused
    COMMAND ${CMAKE_SOURCE_DIR}/tests/thirdparty/imapdl/filterbr.py json.info.filtered > json.info.filtered.noexcept
-    COMMAND ${GENHTML_TOOL} --title "JSON for Modern C++" --legend --demangle-cpp --output-directory html --show-details --branch-coverage --ignore-errors inconsistent json.info.filtered.noexcept
+    COMMAND ${GENHTML_TOOL} --title "JSON for Modern C++" --legend --demangle-cpp --output-directory html --show-details --branch-coverage json.info.filtered.noexcept

    COMMENT "Compile and test with coverage"
 )
@@ -1 +1 @@
-cppcheck==1.5.3
+cppcheck==1.5.2
@@ -132,10 +132,6 @@ outside of a string, invalid) byte; see the [FAQ entry](../../home/faq.md#nul-by
 - [operator>>](../operator_gtgt.md) - deserialize from stream
 - [`JSON_STRICT_NUL_HANDLING`](../macros/json_strict_nul_handling.md) - opt in to rejecting a NUL byte in the input
  instead of treating it as end of input
- [`JSON_DISABLE_STREAM_BULK_SCAN`](../macros/json_disable_stream_bulk_scan.md) - read a `std::istream` one character
-  at a time
- [`JSON_DISABLE_UNLOCKED_FILE_IO`](../macros/json_disable_unlocked_file_io.md) - read a `FILE*` with the locking stdio
-  functions

 ## Version history

@@ -147,10 +143,6 @@ outside of a string, invalid) byte; see the [FAQ entry](../../home/faq.md#nul-by
 - Extended overload (2) to accept heterogeneous iterator+sentinel pairs (C++20 ranges support) in version 3.13.0.
 - `JSON_STRICT_NUL_HANDLING` added in version 3.13.0 to optionally reject a NUL byte in the input instead of treating
  it as end of input; planned to become the default in version 4.0.0.
- Parsing from an `std::istream` scans the characters in its stream buffer in bulk in version 3.13.0
-  ([`JSON_DISABLE_STREAM_BULK_SCAN`](../macros/json_disable_stream_bulk_scan.md)).
- Parsing from a `FILE*` locks the file once instead of once per character in version 3.13.0
-  ([`JSON_DISABLE_UNLOCKED_FILE_IO`](../macros/json_disable_unlocked_file_io.md)).

 !!! warning "Deprecation"

@@ -93,8 +93,7 @@ Logarithmic in the size of the JSON object.

 - [count](count.md) returns the number of occurrences of a key
 - [contains](contains.md) checks whether a key exists
- [basic_json_view::find](../basic_json_view/find.md) - the same lookup on a zero-copy view (a duplicate key resolves
-  to the first member, whereas `parse()` keeps the last)
+- [basic_json_view::find](../basic_json_view/find.md) - the same lookup on a zero-copy view

 ## Version history

@@ -51,8 +51,7 @@ Constant.
 ## See also

 - [back](back.md) to access the last element
- [basic_json_view::front](../basic_json_view/front.md) - the same access on a zero-copy view (document order, not
-  sorted; duplicate keys are visited)
+- [basic_json_view::front](../basic_json_view/front.md) - the same access on a zero-copy view

 ## Version history

@@ -100,7 +100,7 @@ When iterating over an array, `key()` will return the index of the element as st
 - [begin](begin.md) returns an iterator to the first element
 - [end](end.md) returns an iterator to one past the last element
 - [basic_json_view::items](../basic_json_view/items.md) - the same range on a zero-copy view (`#!cpp const auto`,
-  not `#!cpp const auto&`: items are produced on the fly; document order, not sorted; duplicate keys are visited)
+  not `#!cpp const auto&`: items are produced on the fly)

 ## Version history

@@ -275,9 +275,8 @@ Strong exception safety: if an exception occurs, the original value stays intact
 - documentation on [runtime assertions](../../features/assertions.md)
 - see [`at`](at.md) for access by reference with range checking
 - see [`value`](value.md) for access with default value
- [basic_json_view::operator[]](../basic_json_view/operator%5B%5D.md) - the same access on a zero-copy view (a duplicate
-  key resolves to the first member, whereas `parse()` keeps the last; a missing key gives a discarded view instead of
-  undefined behavior)
+- [basic_json_view::operator[]](../basic_json_view/operator%5B%5D.md) - the same access on a zero-copy view (always
+  returns a discarded view instead of assuming undefined behavior)

 ## Version history

@@ -112,16 +112,6 @@ By default, a `'\0'` (NUL) byte anywhere in the input is treated as end of input
 outside of a string, invalid) byte; see the [FAQ entry](../../home/faq.md#nul-bytes-in-the-input) for details and the
 [`JSON_STRICT_NUL_HANDLING`](../macros/json_strict_nul_handling.md) macro to opt into rejecting it instead.

-!!! tip "Performance"
-
-    Contiguous inputs (strings, string views, vectors, arrays, pointer ranges) are the fastest to parse. A
-    `#!cpp std::istream` comes close: the parser scans the characters its stream buffer holds in bulk, without reading
-    ahead, so the stream is left exactly where it would be after reading one character at a time. A `#!cpp FILE*` is
-    read one character at a time, but the file is locked only once, so other threads that use the same `FILE` object
-    wait until parsing is done. See [input sources and performance](../../features/parsing/index.md#input-sources-and-performance),
-    [`JSON_DISABLE_STREAM_BULK_SCAN`](../macros/json_disable_stream_bulk_scan.md), and
-    [`JSON_DISABLE_UNLOCKED_FILE_IO`](../macros/json_disable_unlocked_file_io.md).
-
 ## Examples

 ??? example "Example: (1) parse from a character array"
@@ -257,10 +247,6 @@ outside of a string, invalid) byte; see the [FAQ entry](../../home/faq.md#nul-by
 - [operator>>](../operator_gtgt.md) - deserialize from stream
 - [`JSON_STRICT_NUL_HANDLING`](../macros/json_strict_nul_handling.md) - opt in to rejecting a NUL byte in the input
  instead of treating it as end of input
- [`JSON_DISABLE_STREAM_BULK_SCAN`](../macros/json_disable_stream_bulk_scan.md) - read a `std::istream` one character
-  at a time
- [`JSON_DISABLE_UNLOCKED_FILE_IO`](../macros/json_disable_unlocked_file_io.md) - read a `FILE*` with the locking stdio
-  functions

 ## Version history

@@ -275,11 +261,6 @@ outside of a string, invalid) byte; see the [FAQ entry](../../home/faq.md#nul-by
  it as end of input; planned to become the default in version 4.0.0.
 - Extended empty-input detection to also cover an `std::istream` without a stream buffer, and fixed a crash
  (`std::terminate`) when parsing from an `std::istream` with `eofbit` in its exception mask, in version 3.13.0.
- Parsing from an `std::istream` scans the characters in its stream buffer in bulk in version 3.13.0
-  ([`JSON_DISABLE_STREAM_BULK_SCAN`](../macros/json_disable_stream_bulk_scan.md) restores reading one character at a
-  time).
- Parsing from a `FILE*` locks the file once instead of once per character in version 3.13.0
-  ([`JSON_DISABLE_UNLOCKED_FILE_IO`](../macros/json_disable_unlocked_file_io.md) restores `std::fgetc`).

 !!! warning "Deprecation"

@@ -116,10 +116,6 @@ consumer `sax` has a super-linear complexity.

 A UTF-8 byte order mark is silently ignored.

-When reading from a `#!c FILE*`, the file is locked while it is parsed. The lock is recursive, so the SAX handler may
-use the same file with stdio functions, but it must not wait for another thread that uses the same `FILE` object; see
-[`JSON_DISABLE_UNLOCKED_FILE_IO`](../macros/json_disable_unlocked_file_io.md).
-
 ## Examples

 ??? example
@@ -141,10 +137,6 @@ use the same file with stdio functions, but it must not wait for another thread

 - [parse](parse.md) - deserialize from a compatible input
 - [accept](accept.md) - check if the input is valid JSON
- [`JSON_DISABLE_STREAM_BULK_SCAN`](../macros/json_disable_stream_bulk_scan.md) - read a `std::istream` one character
-  at a time
- [`JSON_DISABLE_UNLOCKED_FILE_IO`](../macros/json_disable_unlocked_file_io.md) - read a `FILE*` with the locking stdio
-  functions

 ## Version history

@@ -156,10 +148,6 @@ use the same file with stdio functions, but it must not wait for another thread
 - Extended overload (2) to accept heterogeneous iterator+sentinel pairs (C++20 ranges support) in version 3.13.0.
 - `JSON_PRECISE_STREAM_POSITION` added in version 3.13.0 to optionally leave a `#!cpp std::istream` positioned right
  after the parsed value when `strict` is `#!cpp false`.
- Parsing from an `std::istream` scans the characters in its stream buffer in bulk in version 3.13.0
-  ([`JSON_DISABLE_STREAM_BULK_SCAN`](../macros/json_disable_stream_bulk_scan.md)).
- Parsing from a `FILE*` locks the file once instead of once per character in version 3.13.0
-  ([`JSON_DISABLE_UNLOCKED_FILE_IO`](../macros/json_disable_unlocked_file_io.md)).

 !!! warning "Deprecation"

@@ -18,10 +18,10 @@ has `erase`; calling it on a read-only `basic_json_document` fails to compile (`
 1. Removes every member of `object` whose key is `key` (see [Notes](#notes) on duplicate keys) and returns how many
   were removed; `#!cpp 0` if `object` has no member with this key.
 2. Removes the element at index `idx` of `array`, which must already exist (`#!cpp idx < array.size()`).
-3. Removes the value the JSON pointer `ptr` refers to, relative to [`root()`](root.md). `ptr` must not be empty
-   ([`root()`](root.md) itself cannot be erased), and the *parent* of the target must already exist. The target is
-   removed as in 1. if the parent is an object (returns the number of removed members, `#!cpp 0` or more) and as in 2.
-   if it is an array (always returns `#!cpp 1`).
+3. Removes the value the JSON pointer `ptr` refers to, relative to [`root()`](root.md), and returns how many values
+   were removed: the *parent* of the target must already exist, and the target itself is removed as in 1. (an object
+   member; `#!cpp 0` or more) or 2. (an array element; always `#!cpp 1`). `ptr` must not be empty -- [`root()`](root.md)
+   itself cannot be erased.

 ## Template parameters

@@ -69,10 +69,10 @@ has `erase`; calling it on a read-only `basic_json_document` fails to compile (`
   [`out_of_range.404`](../../home/exceptions.md#jsonexceptionout_of_range404) (an empty token); otherwise (an
   object, or a primitive value the pointer's parent resolves to) throws what 1. throws.

-Overloads 1. and 2. also throw [`invalid_iterator.202`](../../home/exceptions.md#jsonexceptioninvalid_iterator202)
-("view does not belong to this document") if `object`/`array` is a [discarded](../basic_json_view/is_discarded.md)
-view or a view of a *different* document. Overload 3. never throws `invalid_iterator.202`: it takes no view, and it
-always starts from this document's own [`root()`](root.md).
+Every overload also throws [`invalid_iterator.202`](../../home/exceptions.md#jsonexceptioninvalid_iterator202) ("view
+does not belong to this document") if `object`/`array` is a [discarded](../basic_json_view/is_discarded.md) view or a
+view of a *different* document (overloads 1-2 only; overload 3 always starts from this document's own
+[`root()`](root.md)).

 ## Complexity

@@ -92,10 +92,9 @@ always starts from this document's own [`root()`](root.md).

 Like [`set`](set.md) and [`push_back`](push_back.md), `erase` never moves an element's *value*: a view still
 referring to a removed member or element keeps showing what it last held (see [Edits](index.md#edits)) -- it just no
-longer appears when `array`/`object` is read, dumped, or iterated. What does change is the container's sequence of
-*links* to its elements: removing an element of `array` (2.) shifts the links to the elements after it by one, as
-[`insert`](insert.md) does in the other direction. *Every* iterator already taken over `array`/`object` is invalidated
-by an erase, not only those at or after the removed element, since the container may now use a different sequence.
+longer appears when `array`/`object` is read, dumped, or iterated. Removing an element of `array` (2.) does shift the
+*links* to the elements after it, the same way `insert`, `set`, or `push_back` on the same array would; any iterator
+already taken over `array`/`object` is invalidated by an erase, since it was walking the old layout.

 ## Examples

@@ -110,30 +110,17 @@ enum class image_check

 How thoroughly `load()` validates `image` before trusting it.

-`full` (the default)
-:   Checks everything the parser itself guarantees: structure and bounds; that every string is valid UTF-8 (and, for a
-    string still in the source text, that it contains no quote, backslash, or control character); and that every number
-    token is well-formed and matches the value stored for it. Strings and float tokens may share a range only if the
-    ranges are identical (as nodes that share a value do), and never overlap otherwise. Reading and serializing a
-    checked image is safe and always produces valid JSON, exactly as for a parsed document. This is the right choice for
-    an image from anything you do not fully control -- a file, a cache shared with other processes, a peer on the
-    network.
+| value    | checks                                                                                                    | guarantees |
+|----------|--------------------------------------------------------------------------------------------------------------|------------|
+| `full`   | everything the parser itself guarantees: structure and bounds; that every string is valid UTF-8 (and, for a string still in the source text, that it contains no quote, backslash, or control character); and that every number token is well-formed and matches the value stored for it; strings and float tokens may share a range only if the ranges are identical (as nodes that share a value do), and never overlap otherwise | reading and serializing a checked image is safe and always produces valid JSON, exactly as for a parsed document |
+| `bounds` | structure and bounds only -- that every offset and count in the node index stays inside the image            | reading and serializing stay memory-safe, but a crafted image can hold strings that are not valid UTF-8 or that serialize to invalid JSON ([`dump()`](../basic_json_view/dump.md) writes them unchanged or throws [`type_error.316`](../../home/exceptions.md#jsonexceptiontype_error316)), and numbers whose values differ from their text |
+| `none`   | nothing                                                                                                       | images from a trusted source only -- reading a damaged image is undefined behavior |

-`bounds`
-:   Checks structure and bounds only: that every offset and count in the node index stays inside the image. So
-    `load()`, [`root()`](root.md), element access, and [`materialize()`](../basic_json_view/materialize.md) can never
-    read outside the image, even on a damaged one. It does *not* guarantee that the image describes valid JSON: a
-    string that a `full` check would have rejected can make [`dump()`](../basic_json_view/dump.md) write invalid UTF-8
-    or invalid JSON, or throw [`type_error.316`](../../home/exceptions.md#jsonexceptiontype_error316), and a number can
-    read back with a value that does not match how it is spelled. An [editable document](../json_editable_document.md)
-    does not take such a string over: [`set`](set.md), [`push_back`](push_back.md) and [`insert`](insert.md) throw
-    `type_error.316` when they copy it from a view of the loaded document, and leave the editable document unchanged.
-    `bounds` skips scanning the text and the decoded strings, so it fits a cache your own process just wrote and reads
-    straight back, where damage would mean a bug or a hardware fault rather than adversarial input.
-
-`none`
-:   Checks nothing. Reading a damaged image is undefined behavior, so use it only for an image you trust as much as
-    your own memory.
+`full` is the default and the right choice for an image from anything you do not fully control -- a file, a cache
+shared with other processes, a peer on the network. `bounds` skips scanning the text and the decoded strings, so it
+fits a cache your own process just wrote and reads straight back, where damage would mean a bug or a hardware fault
+rather than adversarial input; it still cannot crash or read out of bounds. `none` skips validation entirely and
+should only be used for an image you trust as much as your own memory.

 **Lifetime.** Overloads 1 and 2 borrow `image`: it must stay alive and byte-for-byte unchanged for as long as the
 returned document, and any [view](../basic_json_view/index.md) taken from it, is used -- exactly like a document
@@ -147,6 +134,16 @@ returned document, and any [view](../basic_json_view/index.md) taken from it, is
    ("unknown format"). Use images to cache a document within one build of the library, or to hand one to another
    process running the *same* build on the *same* (little-endian) machine -- not as a long-term storage format.

+**What `image_check::bounds` does not guarantee.** A bounds-checked image can never make `load()`,
+[`root()`](root.md), element access, or [`materialize()`](../basic_json_view/materialize.md) read outside the image,
+so those stay safe on a damaged one. It does *not* guarantee that the image describes valid JSON: a string
+that a `full` check would have rejected can make [`dump()`](../basic_json_view/dump.md) write invalid UTF-8 or invalid
+JSON, or throw `type_error.316`, and a number can read back with a value that does not match how it is spelled.
+Reserve `bounds` for images you already trust to be well-formed, and use it only to skip the extra scan.
+An [editable document](../json_editable_document.md) does not take such a string over either:
+[`set`](set.md), [`push_back`](push_back.md) and [`insert`](insert.md) throw `type_error.316` when they copy it from
+a view of the loaded document, and leave the editable document unchanged.
+
 ## Examples

 ??? example "Caching a document, ownership, and a rejected image"
@@ -41,7 +41,7 @@ basic_json_view at(const json_pointer& ptr) const;

 ## Exception safety

-Strong guarantee: there are no changes to the view or the document it refers to.
+Strong exception safety: if an exception is thrown, there are no changes to the view or the document it refers to.

 ## Exceptions

@@ -77,8 +77,8 @@ None of these exceptions carry a [`JSON_DIAGNOSTICS`](../macros/json_diagnostics
 1. Linear in the number of members: as for [`ordered_json`](../ordered_json.md), members are compared one after
   another, in document order, stopping at the first match. Each comparison first checks the
   key's length -- already known from the index, without reading the key bytes -- before comparing its content.
-   Objects with 128 or more members get a hash index of their keys while parsing, so that a lookup in them takes
-   constant time on average.
+   Objects with 128 or more members get a hash index while parsing, so that a lookup in them takes constant time
+   on average.
 2. Linear in `idx`: elements are skipped one at a time from the first one, since they are not a fixed size in the
   index (unlike `BasicJsonType`'s array, which is random-access).
 3. Linear in the number of reference tokens of `ptr` and, for each token, in the number of members of the object at
@@ -13,7 +13,7 @@ The last element or member value. For a primitive value (number, string, boolean

 ## Exception safety

-Strong guarantee: there are no changes to the view or the document it refers to.
+Strong exception safety: if an exception is thrown, there are no changes to the view or the document it refers to.

 ## Exceptions

@@ -33,7 +33,8 @@ index.
 ## Notes

 Unlike [`BasicJsonType::back()`](../basic_json/back.md), which has undefined behavior for an empty array or object,
-`back()` throws `invalid_iterator.214` for an empty array, an empty object, a null value, or a discarded view.
+`back()` throws `invalid_iterator.214` in that case -- the same way it already does for `#!json null` and for a
+discarded view, where `BasicJsonType::back()` also throws.

 ## Examples

@@ -6,7 +6,7 @@ iterator begin() const noexcept;

 Returns an iterator to the first element of an array, or the first member value of an object, in **document order**
 -- the order the values appear in the source text, not sorted by key. A primitive value iterates as a range of one
-element (itself), and a `#!json null` value or a [discarded](is_discarded.md) view iterates as an empty range.
+element (itself); `#!json null` and a [discarded](is_discarded.md) view iterate as an empty range.

 ## Return value

@@ -23,7 +23,7 @@ Constant.
 ## Notes

 For an object, iteration visits **every** member, including all occurrences of a duplicate key -- unlike
-[`operator[]`](operator[].md), [`at`](at.md), [`find`](find.md), and [`contains`](contains.md),
+[`operator[]`](operator[].md), [`at`](at.md), [`find`](find.md), [`contains`](contains.md), and [`count`](count.md),
 which all resolve to the *first* member with a given key. See the
 [Notes on duplicate keys](operator[].md#notes) of `operator[]`.

@@ -31,10 +31,6 @@ Because objects are iterated in document order rather than sorted by key, the or
 iterating the [`materialize()`](materialize.md)d `BasicJsonType` value would produce: a `#!cpp basic_json` object
 (`std::map`-backed by default) sorts its keys, while a view does not.

-An `ordered_json` value also keeps document order, but it keeps only one entry per key: as `parse()` does, it keeps the
-*last* value, at the position of the key's *first* occurrence. The view, in contrast, visits every member, including
-the duplicates.
-
 ## Examples

 ??? example
@@ -35,8 +35,8 @@ No-throw guarantee: this function never throws exceptions.
 1. Linear in the number of members: as for [`ordered_json`](../ordered_json.md), members are compared one after
   another, in document order, stopping at the first match. Each comparison first checks the
   key's length -- already known from the index, without reading the key bytes -- before comparing its content.
-   Objects with 128 or more members get a hash index of their keys while parsing, so that a lookup in them takes
-   constant time on average.
+   Objects with 128 or more members get a hash index while parsing, so that a lookup in them takes constant time
+   on average.
 2. Linear in the number of reference tokens of `ptr` and, for each token, in the number of members of the object at
   that level or the index into the array -- as for [`operator[]`](operator[].md#complexity) and
   [`at`](at.md#complexity) with a JSON pointer.
@@ -55,8 +55,7 @@ view.

 !!! info "Postconditions"

-    If `#!cpp v.contains(key)` returns `#!cpp true`, then `#!cpp v[key]` is not [discarded](is_discarded.md) and
-    `#!cpp v.at(key)` does not throw. If
+    If `#!cpp v.contains(key)` returns `#!cpp true`, then `#!cpp v[key]` is not [discarded](is_discarded.md). If
    `#!cpp v.contains(ptr)` returns `#!cpp true`, then `#!cpp v[ptr]` is not discarded and `#!cpp v.at(ptr)` does not
    throw.

@@ -6,8 +6,7 @@ size_type count(const char* key) const;
 size_type count(const string_t& key) const;
 ```

-Returns the number of members with key `key` if the value is an object, `#!cpp 0` otherwise. Members with a repeated
-key are all counted.
+Returns `#!cpp 1` if the value is an object with a member with key `key`, `#!cpp 0` otherwise.

 ## Parameters

@@ -16,8 +15,7 @@ key are all counted.

 ## Return value

-the number of members of the object with key `key` (duplicates included), or `#!cpp 0` if the value is not an object
-or has no such member.
+`#!cpp 1` if the value is an object and has a member with key `key`, `#!cpp 0` otherwise.

 ## Exception safety

@@ -25,30 +23,36 @@ No-throw guarantee: this function never throws exceptions.

 ## Complexity

-Linear in the number of members: unlike the lookup functions, `count()` does not stop at the first match, because it
-has to count every member with the key. Members are compared one after another, in document order. Each comparison
-first checks the key's length -- already known from the index, without reading the key bytes -- before comparing its
-content. The hash index of the keys of objects with 128 or more members does not help here, since every member
-is visited.
+Linear in the number of members: as for [`ordered_json`](../ordered_json.md), members are compared one after another,
+in document order, stopping at the first match. Each comparison first checks the key's length
+-- already known from the index, without reading the key bytes -- before comparing its content.
+Objects with 128 or more members get a hash index while parsing, so that a lookup in them takes constant time on
+average.

 ## Notes

+!!! warning "Duplicate keys: the first member wins"
+
+    If the source text repeats a key, this resolves to the *first* member with it, not to the last one that
+    [`materialize()`](materialize.md) and `parse()` keep. See the [Notes on duplicate keys](operator[].md#notes) of
+    `operator[]` and [Duplicate keys](../../features/json_view.md#duplicate-keys) for the reasons and for how to get
+    the last value.
+
 This method always returns `#!cpp 0` when the value is not an object -- including a [discarded](is_discarded.md)
 view.

-If the source text repeats a key, `count()` returns more than `#!cpp 1` for it, even though the
-[materialized](materialize.md) value (like the result of `parse()`) would have only one member with that key. Hence
-`#!cpp count(key) > 1` detects duplicate keys. This is unlike the lookup functions
-([`operator[]`](operator[].md), [`at`](at.md), [`find`](find.md), [`contains`](contains.md)), which resolve to the
-*first* member; see the [Notes on duplicate keys](operator[].md#notes) of `operator[]`.
+Unlike [`BasicJsonType::count()`](../basic_json/count.md), whose return value can in principle exceed `#!cpp 1` for
+an `ObjectType` that allows multiple entries per key, `count()` here never does: it is exactly
+[`contains()`](contains.md) as `#!cpp 0`/`#!cpp 1`. This holds even if the source text has a duplicate key -- see the
+[Notes on duplicate keys](operator[].md#notes) of `operator[]` -- because a `#!cpp count() > 1` result would require
+counting every member with a matching key (the lookup functions resolve to the *first* one).

 ## Examples

 ??? example

-    The example below validates that every transaction of a batch carries exactly one `amount` field, using
-    `count()` before deciding whether to materialize a transaction at all. It reports a transaction with no `amount`
-    field and one with a duplicated `amount` field.
+    The example below validates that every transaction of a batch carries a mandatory `amount` field, using
+    `count()` before deciding whether to materialize a transaction at all.

    ```cpp
    --8<-- "examples/basic_json_view__count.cpp"
@@ -60,13 +60,11 @@ Linear in the size of the output text.
 The walk over the subtree is iterative, so the nesting depth it can write is limited by available memory only, not by
 the call stack -- as for [`materialize()`](materialize.md).

-Strings are escaped by the same rules as [`BasicJsonType::dump`](../basic_json/dump.md).
-
-With `#!cpp numbers == number_format::shortest`, floats are written with the library's shortest round-trip conversion,
+Strings are escaped by the same rules as [`BasicJsonType::dump`](../basic_json/dump.md). With
+`#!cpp numbers == number_format::shortest`, floats are written with the library's shortest round-trip conversion,
 exactly as [`BasicJsonType::dump`](../basic_json/dump.md) would (e.g. `#!cpp 1.5`, `#!cpp 100.0`, `#!cpp 1e+100`), and
 integers are copied from the source text -- already canonical in JSON, so this matches their shortest form too --
 except that `#!cpp -0` is written as `#!cpp 0`, the way [`BasicJsonType::parse()`](../basic_json/parse.md) reads it.
-
 `#!cpp number_format::source` copies every number exactly as written in the source text instead, with no exception
 for `#!cpp -0` -- `#!cpp 1.50`, `#!cpp 1E2`, `#!cpp -0.0`, `#!cpp -0`, or all digits of an integer literal with more
 digits than any number type holds (such a literal is itself classified as a float, see
@@ -5,8 +5,9 @@ iterator end() const noexcept;
 ```

 Returns an iterator to one past the last element of an array, one past the last member value of an object, in
-**document order** -- see [`begin()`](begin.md). A primitive value iterates as a range of one element (itself), and a
-`#!json null` value or a [discarded](is_discarded.md) view iterates as an empty range (`#!cpp begin() == end()`).
+**document order** -- see [`begin()`](begin.md). A primitive value iterates as a range of one element (itself);
+`#!json null` and a [discarded](is_discarded.md) view iterate as an empty range, so `#!cpp begin() == end()` for
+them.

 ## Return value

@@ -28,8 +28,8 @@ No-throw guarantee: this function never throws exceptions.
 Linear in the number of members: as for [`ordered_json`](../ordered_json.md), members are compared one after another,
 in document order, stopping at the first match. Each comparison first checks the key's length
 -- already known from the index, without reading the key bytes -- before comparing its content.
-Objects with 128 or more members get a hash index of their keys while parsing, so that a lookup in them takes
-constant time on average.
+Objects with 128 or more members get a hash index while parsing, so that a lookup in them takes constant time on
+average.

 ## Notes

@@ -13,7 +13,7 @@ The first element or member value. For a primitive value (number, string, boolea

 ## Exception safety

-Strong guarantee: there are no changes to the view or the document it refers to.
+Strong exception safety: if an exception is thrown, there are no changes to the view or the document it refers to.

 ## Exceptions

@@ -31,8 +31,8 @@ Constant.
 ## Notes

 Unlike [`BasicJsonType::front()`](../basic_json/front.md), which has undefined behavior for an empty array or
-object, `front()` throws `invalid_iterator.214` for an empty array, an empty object, a null value, or a discarded
-view.
+object, `front()` throws `invalid_iterator.214` in that case -- the same way it already does for `#!json null` and
+for a discarded view, where `BasicJsonType::front()` also throws.

 ## Examples

@@ -10,8 +10,8 @@ Converts the value to `T`.
 For the types below, the conversion works directly on the flat index -- no `BasicJsonType` value is built for it:

 - `#!cpp bool`
- arithmetic types other than `#!cpp bool` (for a boolean, `#!cpp 0`/`#!cpp 1`, exactly as for
-  [`BasicJsonType::get<T>()`](../basic_json/get.md))
+- arithmetic types other than `#!cpp bool` (from a number; from a boolean, as `#!cpp 0`/`#!cpp 1`, exactly as
+  [`BasicJsonType::get<T>()`](../basic_json/get.md) converts a boolean)
 - `#!cpp std::nullptr_t`
 - `#!cpp std::basic_string<char, Traits, Alloc>` (including `string_t`) -- a copy of the string
 - [`string_view_t`](index.md#member-types) -- **no copy**: the returned view points into the document's
@@ -19,10 +19,10 @@ For the types below, the conversion works directly on the flat index -- no `Basi
  document's own buffer of decoded strings (see [`get_string()`](get_string.md))
 - `BasicJsonType` -- equivalent to [`materialize()`](materialize.md)
 - `basic_json_view` -- returns `#!cpp *this`
- `#!cpp std::vector<U, A>` -- from an array, element by element, each converted with `#!cpp get<U>()`; `#!cpp
+- `#!cpp std::vector<U, A>` -- element by element, each converted with `#!cpp get<U>()`; `#!cpp
  std::vector<basic_json_view>` keeps a view of every element instead of a value
 - `#!cpp std::map<K, V, C, A>` and `#!cpp std::unordered_map<K, V, H, E, A>`, if `K` is constructible from a `#!cpp
-  (const char*, std::size_t)` pair -- from an object, member by member, each value converted with `#!cpp get<V>()`; with a repeated
+  (const char*, std::size_t)` pair -- member by member, each value converted with `#!cpp get<V>()`; with a repeated
  key, the *last* value is kept, as [`BasicJsonType::parse()`](../basic_json/parse.md) (and
  [`materialize()`](materialize.md)) does; `#!cpp std::map<std::string, basic_json_view>` keeps views of the members
  instead of values
@@ -43,7 +43,7 @@ the value, converted to `T`

 ## Exception safety

-Strong guarantee: there are no changes to the view or the document it refers to.
+Strong exception safety: if an exception is thrown, there are no changes to the view or the document it refers to.

 ## Exceptions

@@ -62,9 +62,6 @@ None of the exceptions thrown directly by this function (the first three bullets
 [`JSON_DIAGNOSTICS`](../macros/json_diagnostics.md) path: the view has no `BasicJsonType` value to point at. An
 exception thrown while converting through `materialize()` (the last bullet) is different: it is thrown by a real
 `BasicJsonType` value, so it **does** carry a `JSON_DIAGNOSTICS` path if `BasicJsonType` was built with it enabled.
-That path is relative to the root of the view's subtree, because `materialize()` builds only the subtree (with parent
-pointers): it is empty if the failing value is the subtree's root itself, and it never is the path within the whole
-document.

 ## Complexity

@@ -76,8 +73,8 @@ document.
 - `#!cpp std::map`/`#!cpp std::unordered_map`: linear in the number of members for walking them, plus the container's
  own insertion cost per member (logarithmic for `#!cpp std::map`, amortized constant for `#!cpp
  std::unordered_map`), times the complexity of converting one member to the mapped type.
- every other `T`: the cost of [`materialize()`](materialize.md) and of destroying the `BasicJsonType` value
-  afterwards, plus that of [`BasicJsonType::get<T>()`](../basic_json/get.md).
+- every other `T`: linear in the size of the subtree (building the `BasicJsonType` value), plus the complexity of
+  [`BasicJsonType::get<T>()`](../basic_json/get.md) on it.

 ## Notes

@@ -15,7 +15,7 @@ had to be decoded once when the document was parsed).

 ## Exception safety

-Strong guarantee: there are no changes to the view or the document it refers to.
+Strong exception safety: if an exception is thrown, there are no changes to the view or the document it refers to.

 ## Exceptions

@@ -37,14 +37,9 @@ hand out a reference to a stored `string_t`. `get_string()` (equivalently, [`get
 zero-copy alternative: [`BasicJsonType::get_ref<const string_t&>()`](../basic_json/get_ref.md) is its closest
 counterpart, except that it returns a view instead of a reference to a value that must already exist.

-`get_string()` borrows the string: nothing is copied, whereas [`get<std::string>()`](get.md) copies it. For a borrowed
-document, the returned [`string_view_t`](index.md#member-types) is valid as long as the caller's buffer; for an owned
-one, as long as the document.
-
 The returned [`string_view_t`](index.md#member-types) is valid exactly as long as the view that produced it -- see the
 [validity rules](index.md) of `basic_json_view` -- and, for a string with no escapes, for as long as the document's
-source text, which for a borrowed document must remain valid **and unmodified** for as long as the document exists,
-since floating-point values and unescaped strings are read from the source lazily.
+source text.

 ## Examples

@@ -5,15 +5,12 @@ template<typename T>
 T& get_to(T& v) const;
 ```

-Converts the value to `T` and stores it in `v`, in one of two ways:
+Converts the value to `T` and assigns it to `v`. Equivalent to

- For the types that [`get<T>()`](get.md) converts directly -- arithmetic types, `#!cpp bool`,
-  `#!cpp std::nullptr_t`, [`string_view_t`](index.md#member-types), `#!cpp std::basic_string`, `BasicJsonType`,
-  `basic_json_view`, `#!cpp std::vector`, and `#!cpp std::map`/`#!cpp std::unordered_map` with string keys -- `v` is
-  assigned: `#!cpp v = get<T>()`.
- For every other type, the subtree is built into a `BasicJsonType` value and `#!cpp materialize().get_to(v)` is
-  called, i.e. `from_json()` is invoked with the existing `v`, exactly as
-  [`BasicJsonType::get_to()`](../basic_json/get_to.md) does.
+```cpp
+v = get<T>();
+return v;
+```

 ## Template parameters

@@ -31,27 +28,15 @@ Converts the value to `T` and stores it in `v`, in one of two ways:

 ## Exception safety

- For the directly converted types: strong exception safety. If an exception is thrown, `v` is not modified.
- For every other type: as for [`BasicJsonType::get_to()`](../basic_json/get_to.md). `materialize()` throws before `v`
-  is touched, but a `from_json()` that throws may leave `v` partly modified.
+Strong exception safety: if an exception is thrown, `v` is not modified.

 ## Exceptions

- For the directly converted types: whatever [`get<T>()`](get.md) throws for the same value and `T`.
- For every other type: whatever [`materialize()`](materialize.md) and
-  [`BasicJsonType::get_to()`](../basic_json/get_to.md) throw.
+Whatever [`get<T>()`](get.md) throws for the same value and `T`.

 ## Complexity

- For the directly converted types: whatever [`get<T>()`](get.md) has for the same `T`.
- For every other type: that of [`materialize()`](materialize.md), plus that of
-  [`BasicJsonType::get_to()`](../basic_json/get_to.md).
-
-## Notes
-
-The difference between the two ways matters for a `from_json()` that sets only the fields present in the JSON: since
-it runs on the existing `v`, the other fields of `v` keep their values, whereas assigning `get<T>()` would replace
-them with those of a default-constructed `T`.
+Whatever [`get<T>()`](get.md) has for the same `T`.

 ## Examples

@@ -14,27 +14,18 @@ to the document and a pointer into its index), trivially copyable. A view is val
 - the document has not been re-parsed with [`read()`](../basic_json_document/read.md) (or
  [`parse()`](../basic_json_document/parse.md) into it) or shrunk with
  [`shrink_to_fit()`](../basic_json_document/shrink_to_fit.md) since the view was taken, and
- if the document borrows its source text, that text is still alive and unmodified (floating-point values and
-  unescaped strings are read from it lazily).
+- if the document borrows its source text, that text is still alive.

 Moving the document itself does not invalidate its views: the index is heap-allocated independently of the
 `basic_json_document` object.

-`basic_json_view` provides the read-only part of the `BasicJsonType` interface:
-
- the type-inspection functions
- element access
- lookup
- iteration
- conversion: [`get<T>()`](get.md), [`get_string()`](get_string.md), [`number_token()`](number_token.md), and
-  [`materialize()`](materialize.md) to build the `BasicJsonType` value of a subtree on demand
- comparison: [`operator==`](operator_eq.md) and [`operator!=`](operator_ne.md) compare two views, or a view and a
-  `BasicJsonType` value, without ever building a `BasicJsonType` value for a view; no ordering comparison
-  (`#!cpp operator<`) is provided
-
-[`operator[]`](operator%5B%5D.md), [`at`](at.md), [`contains`](contains.md), and [`value`](value.md) also accept a
-[`json_pointer`](../json_pointer/index.md). Unlike `basic_json`, there are no implicit conversion operators (no
-`#!cpp operator ValueType()`), and no `#!cpp get_ptr()` or `#!cpp get_ref()`; see [`get`](get.md).
+`basic_json_view` provides the read-only part of the `BasicJsonType` interface: the type-inspection functions, element
+access, lookup, iteration, conversion, and comparison -- [`get<T>()`](get.md), [`get_string()`](get_string.md),
+[`number_token()`](number_token.md), and [`materialize()`](materialize.md) to build the `BasicJsonType` value of a
+subtree on demand. [`operator[]`](operator%5B%5D.md), [`at`](at.md), [`contains`](contains.md), and
+[`value`](value.md) also accept a [`json_pointer`](../json_pointer/index.md). [`operator==`](operator_eq.md) and
+[`operator!=`](operator_ne.md) compare two views, or a view and a `BasicJsonType` value, without ever building a
+`BasicJsonType` value for a view; no ordering comparison (`#!cpp operator<`) is provided.

 `basic_json_view` itself is always read-only -- it never has a `set` or `push_back` of its own. A view of an
 **editable** document (`#!cpp Editable == true`) sees every edit made through
@@ -70,6 +61,7 @@ still refers to it -- including ones taken before the change -- reads the new va
 - **string_view_t** - `#!cpp std::string_view` on C++17 and newer, a minimal internal substitute otherwise
 - **iterator**, **const_iterator** - a forward iterator over the elements of an array or the member values of an
  object, in document order; both names refer to the same type, since a view is always read-only
+- **item** - a (key, value) pair produced by [`items()`](items.md)
 - [**number_format**](number_format.md) - how [`dump()`](dump.md) writes numbers

 ## Member functions
@@ -4,9 +4,9 @@
 /* unspecified */ items() const noexcept;
 ```

-Returns a range of items -- (key, value) pairs -- for use in range-based for loops. An item's `#!cpp key()` is a
-`#!cpp string_view_t` (for an array element, its index converted to a string, as for
-[`BasicJsonType::items()`](../basic_json/items.md)), and its `#!cpp value()` is a `basic_json_view` of the element.
+Returns a range of [`item`](index.md#member-types) values -- (key, value) pairs -- for use in range-based for loops.
+The key of an array element is its index, converted to a string, as for
+[`BasicJsonType::items()`](../basic_json/items.md).

 The returned type is not part of the public API and may change between versions; use a range-based for loop (see the
 example), or `#!cpp decltype(v.items())` if you need to name it.
@@ -33,8 +33,8 @@ is nothing for a reference to bind to.

 ## Return value

-A range whose iterators dereference to an item (with `#!cpp key()` and `#!cpp value()`, see above) and whose
-`#!cpp begin()`/`#!cpp end()` are equivalent to [`basic_json_view::begin()`](begin.md)/[`end()`](end.md), in document order.
+A range whose iterators dereference to [`item`](index.md#member-types) and whose `#!cpp begin()`/`#!cpp end()` are
+equivalent to [`basic_json_view::begin()`](begin.md)/[`end()`](end.md), in document order.

 ## Exception safety

@@ -48,14 +48,14 @@ Constant.

 As for [`begin()`](begin.md)/[`end()`](end.md), `items()` visits **every** member of an object, including all
 occurrences of a duplicate key -- unlike [`operator[]`](operator[].md), [`at`](at.md), [`find`](find.md),
-and [`contains`](contains.md), which resolve to the *first* member with a given key. See the
+[`contains`](contains.md), and [`count`](count.md), which resolve to the *first* member with a given key. See the
 [Notes on duplicate keys](operator[].md#notes) of `operator[]`.

 !!! danger "Lifetime issues"

-    Unlike `BasicJsonType::items()` (see [#2040](https://github.com/nlohmann/json/issues/2040)), calling `items()` on
-    a temporary view is safe, for instance `#!cpp for (auto item : v["a"].items())`: the returned range holds a copy
-    of the view. What must outlive the loop is the document and, for a borrowed document, the source buffer.
+    As for `BasicJsonType::items()`, calling `items()` on a temporary view (or a temporary document) is dangerous:
+    the range refers back to the document, so the document must outlive the loop. See
+    [#2040](https://github.com/nlohmann/json/issues/2040) for the `BasicJsonType` background.

 ## Examples

@@ -15,7 +15,7 @@ and [`materialize()`](materialize.md) can only represent approximately, as a `nu

 ## Exception safety

-Strong guarantee: there are no changes to the view or the document it refers to.
+Strong exception safety: if an exception is thrown, there are no changes to the view or the document it refers to.

 ## Exceptions

@@ -50,7 +50,7 @@ basic_json_view operator[](const json_pointer& ptr) const;

 ## Exception safety

-Strong guarantee: there are no changes to the view or the document it refers to.
+Strong exception safety: if an exception is thrown, there are no changes to the view or the document it refers to.

 ## Exceptions

@@ -83,8 +83,8 @@ None of these exceptions carry a [`JSON_DIAGNOSTICS`](../macros/json_diagnostics
   another, in document order, stopping at the first match. Each comparison first checks the
   key's length -- already known from the index, without reading the key bytes -- before comparing its content, so a
   key of a different length than `key` is rejected without touching the source text.
-   Objects with 128 or more members get a hash index of their keys while parsing, so that a lookup in them takes
-   constant time on average.
+   Objects with 128 or more members get a hash index while parsing, so that a lookup in them takes constant time
+   on average.
 2. Linear in `idx`: elements are skipped one at a time from the first one, since they are not a fixed size in the
   index (unlike `BasicJsonType`'s array, which is random-access).
 3. Linear in the number of reference tokens of `ptr` and, for each token, in the number of members of the object at
@@ -110,13 +110,13 @@ document.
 !!! warning "Duplicate keys: the first member wins"

    If the source text has an object with a duplicate key, `#!cpp operator[]` (and [`at`](at.md), [`find`](find.md),
-    [`contains`](contains.md), [`value`](value.md), and JSON pointer resolution) all resolve to
+    [`contains`](contains.md), [`count`](count.md), [`value`](value.md), and JSON pointer resolution) all resolve to
    the *first* member with that key, because a lookup can stop as soon as it finds a match. This is different from
    [`materialize()`](materialize.md) (and [`BasicJsonType::parse()`](../basic_json/parse.md)), which replay every
    member in order and so keep the *last* value for a repeated key, so `#!cpp v["a"]` and
    `#!cpp v.materialize()["a"]` can differ. To get the value `parse()` would give, use
    [`materialize()`](materialize.md) or iterate the members with [`items()`](items.md) and keep the last match.
-    The key hash index of a larger object (128 members or more) leads to the first member of a key as well.
+    The hash index of a larger object (128 members or more) leads to the first member of a key as well.
    [`begin()`](begin.md)/[`end()`](end.md) and [`items()`](items.md) iterate over *all* members, including
    duplicates, in document order. See [Duplicate keys](../../features/json_view.md#duplicate-keys) and
    [`size()`](size.md#notes).
@@ -14,14 +14,14 @@ same string for a discarded `BasicJsonType` value).
 a string representation of the type ([`value_t`](../basic_json/value_t.md)):

 | Value type                                         | return value  |
-|----------------------------------------------------|---------------|
-| `#!json null`                                      | `"null"`      |
-| boolean                                            | `"boolean"`   |
-| string                                             | `"string"`    |
-| number (integer, unsigned integer, floating-point) | `"number"`    |
-| object                                             | `"object"`    |
-| array                                              | `"array"`     |
-| discarded                                          | `"discarded"` |
+|-----------------------------------------------------|---------------|
+| `#!json null`                                        | `"null"`      |
+| boolean                                              | `"boolean"`   |
+| string                                               | `"string"`    |
+| number (integer, unsigned integer, floating-point)   | `"number"`    |
+| object                                               | `"object"`    |
+| array                                                | `"array"`     |
+| discarded                                            | `"discarded"` |

 `type_name()` never returns `#!cpp "binary"`, since a JSON text has no binary values (see
 [`is_binary()`](is_binary.md)); it also never returns `#!cpp "invalid"`, since a view's `#!cpp kind` always comes
@@ -44,7 +44,7 @@ equivalent) deduce `string_t`, not `const char*`, for their return type and for

 ## Exception safety

-Strong guarantee: there are no changes to the view or the document it refers to.
+Strong exception safety: if an exception is thrown, there are no changes to the view or the document it refers to.

 ## Exceptions

@@ -70,8 +70,8 @@ None of these exceptions carry a [`JSON_DIAGNOSTICS`](../macros/json_diagnostics
 1. Linear in the number of members: as for [`operator[]`](operator[].md#complexity), members are compared one after
   another, in document order, stopping at the first match. Plus the complexity of converting
   the found member to `T` (see [`get`](get.md)).
-   Objects with 128 or more members get a hash index of their keys while parsing, so that a lookup in them takes
-   constant time on average.
+   Objects with 128 or more members get a hash index while parsing, so that a lookup in them takes constant time
+   on average.
 2. Linear in the number of reference tokens of `ptr` and, for each token, in the number of members of the object at
   that level or the index into the array -- as for the [`operator[]`](operator[].md#complexity) and
   [`at`](at.md#complexity) overloads that take a JSON pointer. Plus the complexity of converting the resolved value
@@ -16,10 +16,6 @@ header. See also the [macro overview page](../../features/macros.md).

 ## Parsing

- [**JSON_DISABLE_STREAM_BULK_SCAN**](json_disable_stream_bulk_scan.md) - read a `std::istream` one character at a time
-  instead of scanning its stream buffer in bulk
- [**JSON_DISABLE_UNLOCKED_FILE_IO**](json_disable_unlocked_file_io.md) - read a `FILE*` with `std::fgetc` instead of
-  locking it once and using the unlocked stdio functions
 - [**JSON_PRECISE_STREAM_POSITION**](json_precise_stream_position.md) - opt in to leaving an input stream positioned
  right after a parsed number
 - [**JSON_STRICT_BINARY_UTF8**](json_strict_binary_utf8.md) - opt in to checking strings for valid UTF-8 in the CBOR,
@@ -1,144 +0,0 @@
-# JSON_DISABLE_STREAM_BULK_SCAN
-
-```cpp
-#define JSON_DISABLE_STREAM_BULK_SCAN /* value */
-```
-
-When defined to `1`, parsing from a `#!cpp std::istream` reads the input one character at a time through the stream
-buffer, as in version 3.12.0 and earlier, instead of scanning the characters that the stream buffer already holds in
-bulk.
-
-The macro is an escape hatch for stream buffers that do not follow the usual contract of `std::basic_streambuf` (see
-the requirements on the stream buffer in the notes below). It does not change any result: values, exceptions, and the
-position of the stream after parsing are the same either way. Only the speed differs.
-
-## Default definition
-
-The default value is `0`: streams are scanned in bulk.
-
-```cpp
-#define JSON_DISABLE_STREAM_BULK_SCAN 0
-```
-
-## Notes
-
-!!! note "How streams are scanned"
-
-    A `std::streambuf` keeps the part of the input it has read but not yet handed out in its *get area*, the range
-    from `gptr()` to `egptr()`. A `std::filebuf`, for instance, reads the file in blocks of a few kilobytes into its get
-    area, and a `std::stringbuf` exposes its whole string as one get area.
-
-    When parsing from a `std::istream`, the parser scans this get area directly, with the same fast paths that it uses
-    for a `std::string`: runs of ordinary string characters, numbers, and indentation are recognized several bytes at a
-    time instead of being requested from the stream buffer one character at a time. When the parser reaches the end of
-    the get area, it asks the stream buffer for the next character as before, which makes the stream buffer refill its
-    get area.
-
-    The parser only reads characters that it would also have read one at a time, and it advances the stream buffer
-    exactly over the characters it consumes. Nothing is read ahead, buffered elsewhere, or put back. Therefore, the
-    stream is left exactly where it was left before:
-
-    - [`operator>>`](../operator_gtgt.md) and [`sax_parse`](../basic_json/sax_parse.md) with `strict = false` can still
-      read several values from one stream, and the stream can still be used with other `std::istream` functions after a
-      value has been read.
-    - With [`JSON_PRECISE_STREAM_POSITION`](json_precise_stream_position.md), the stream is still positioned right after
-      a parsed number.
-    - Exception messages, including the line, the column, and the last read token, are unchanged.
-
-!!! note "Performance"
-
-    Parsing from a `std::ifstream` or `std::istringstream` is typically 1.5 to 2 times as fast as before, and reading
-    many small values from one stream with `operator>>` 1.4 to 4 times as fast. Parsing from a stream is then within
-    about 10 to 20 % of first reading the whole file into a `std::string` and parsing that.
-
-    A stream buffer without a get area (one that only overrides `underflow()` and `uflow()` and hands out every
-    character from there) offers nothing to scan in bulk, so it is read one character at a time as before.
-
-!!! note "Requirements on the stream buffer"
-
-    The bulk scan relies on the following behavior, which every stream buffer of the standard library and every stream
-    buffer that keeps its input in its get area has:
-
-    - When `sgetc()` returns a character while `gptr() < egptr()`, that character is `*gptr()`; when `sbumpc()` returns
-      one, it was at `gptr()` before the call.
-    - Characters in the get area are not changed while they are in the get area.
-    - `underflow()` or `uflow()` either sets up a get area that holds the returned character at `gptr()` (or at
-      `gptr() - 1` after `uflow()`), or leaves the get area empty.
-
-    A stream buffer that returns characters from `uflow()` while leaving unrelated characters in its get area, or that
-    changes the characters in its get area in place, does not meet these requirements. Define the macro to `1` for
-    such stream buffers.
-
-!!! note "ABI compatibility"
-
-    The value of this macro is encoded in the [namespace](../../features/namespace.md) (tag `_dsbs`), resulting in
-    distinct symbol names. Translation units compiled with and without it can therefore be linked into the same program
-    without One Definition Rule (ODR) violations, but they cannot exchange instances of library types.
-
-!!! note "Other inputs"
-
-    Strings, string views, vectors, arrays, and pointer or iterator ranges over contiguous memory are scanned in bulk
-    anyway. Reading from a `#!cpp FILE*` is not affected by this macro; see
-    [`JSON_DISABLE_UNLOCKED_FILE_IO`](json_disable_unlocked_file_io.md) for that input.
-
-## Examples
-
-??? example "Example: reading values from a stream (default)"
-
-    The stream is scanned in bulk, and the values are read one after the other:
-
-    ```cpp
-    #include <iostream>
-    #include <sstream>
-    #include <nlohmann/json.hpp>
-
-    using json = nlohmann::json;
-
-    int main()
-    {
-        std::istringstream input(R"({"id": 1} {"id": 2} 42 rest)");
-        json j1, j2, j3;
-        input >> j1 >> j2 >> j3;  // {"id":1}, {"id":2}, 42
-
-        std::string word;
-        input >> word;            // "rest"
-    }
-    ```
-
-??? example "Example: reading one character at a time (macro defined to 1)"
-
-    With the macro, the same program reads the stream one character at a time, with the same results:
-
-    ```cpp
-    #define JSON_DISABLE_STREAM_BULK_SCAN 1
-    #include <iostream>
-    #include <sstream>
-    #include <nlohmann/json.hpp>
-
-    using json = nlohmann::json;
-
-    int main()
-    {
-        std::istringstream input(R"({"id": 1} {"id": 2} 42 rest)");
-        json j1, j2, j3;
-        input >> j1 >> j2 >> j3;  // {"id":1}, {"id":2}, 42
-
-        std::string word;
-        input >> word;            // "rest"
-    }
-    ```
-
-## See also
-
- [**parse**](../basic_json/parse.md) - deserialize from a compatible input
- [**operator>>**](../operator_gtgt.md) - deserialize from stream
- [**sax_parse**](../basic_json/sax_parse.md) - generate SAX events
- [**JSON_PRECISE_STREAM_POSITION**](json_precise_stream_position.md) - leave an input stream positioned right after a
-  parsed number
- [**JSON_DISABLE_UNLOCKED_FILE_IO**](json_disable_unlocked_file_io.md) - read a `FILE*` with the locking stdio
-  functions
- [Parsing: input sources and performance](../../features/parsing/index.md#input-sources-and-performance)
-
-## Version history
-
- Added in version 3.13.0.
@@ -1,112 +0,0 @@
-# JSON_DISABLE_UNLOCKED_FILE_IO
-
-```cpp
-#define JSON_DISABLE_UNLOCKED_FILE_IO /* value */
-```
-
-When defined to `1`, parsing from a `#!cpp FILE*` reads every character with `std::fgetc`, as in version 3.12.0 and
-earlier, instead of locking the file once and reading it with the unlocked stdio functions.
-
-It does not change any result: values, exceptions, and the position of the file after parsing are the same either way.
-Only the speed and the locking of the file differ (see the notes on locking below).
-
-## Default definition
-
-The default value is `0`: the file is locked once and read with the unlocked stdio functions where they are available.
-
-```cpp
-#define JSON_DISABLE_UNLOCKED_FILE_IO 0
-```
-
-## Notes
-
-!!! note "Background"
-
-    The C standard library makes every `std::fgetc` call thread-safe by locking and unlocking the `FILE` object. When
-    parsing from a `FILE*`, the parser reads one character at a time, so this happens for every character of the input.
-
-    Instead, the parser locks the file once when parsing starts and unlocks it when parsing ends - also when an
-    exception is thrown - and reads the characters in between without locking:
-
-    | C library                                                  | functions                                          |
-    |------------------------------------------------------------|----------------------------------------------------|
-    | glibc (Linux), Apple (macOS, iOS), Android, FreeBSD, NetBSD, OpenBSD, DragonFly BSD | `flockfile`, `getc_unlocked`, `funlockfile` (POSIX) |
-    | Microsoft (MSVC, clang-cl)                                 | `_lock_file`, `_fgetc_nolock`, `_unlock_file`       |
-    | others (e.g., musl, MinGW, newlib)                         | `std::fgetc`, as before                             |
-
-    This makes parsing from a `FILE*` 3 to 4 times as fast with the Apple C library and 1.1 to 1.3 times as fast with
-    glibc, whose locking is cheaper. The binary formats ([`from_cbor`](../basic_json/from_cbor.md),
-    [`from_msgpack`](../basic_json/from_msgpack.md), ...) read from a `FILE*` the same way.
-
-!!! note "Locking"
-
-    While a value is parsed from a `FILE*`, the parsing thread holds the file's lock. The lock is recursive, so the
-    parsing thread itself - for instance, a [SAX](../json_sax/index.md) handler or a
-    [parser callback](../basic_json/parser_callback_t.md) - can keep using the file with stdio functions such as
-    `std::ftell`. Other threads that use the same `FILE` object wait until the parser is done. Before, they could
-    interleave their reads with the parser's, which made the parsed input unpredictable anyway.
-
-    A program in which a SAX handler or parser callback waits for **another** thread that uses the **same** `FILE`
-    object would deadlock. Define the macro to `1` for such programs.
-
-!!! note "ABI compatibility"
-
-    The value of this macro is encoded in the [namespace](../../features/namespace.md) (tag `_dufio`), resulting in
-    distinct symbol names. Translation units compiled with and without it can therefore be linked into the same program
-    without One Definition Rule (ODR) violations, but they cannot exchange instances of library types.
-
-!!! note "Other inputs"
-
-    Reading from a `#!cpp std::istream` is not affected by this macro; see
-    [`JSON_DISABLE_STREAM_BULK_SCAN`](json_disable_stream_bulk_scan.md) for that input.
-
-## Examples
-
-??? example "Example: parsing from a `FILE*` (default)"
-
-    The file is locked once while it is parsed:
-
-    ```cpp
-    #include <cstdio>
-    #include <nlohmann/json.hpp>
-
-    using json = nlohmann::json;
-
-    int main()
-    {
-        std::FILE* f = std::fopen("example.json", "rb");
-        json j = json::parse(f);  // f is locked until parse() returns
-        std::fclose(f);
-    }
-    ```
-
-??? example "Example: locking for every character (macro defined to 1)"
-
-    With the macro, every character is read with `std::fgetc`, with the same result:
-
-    ```cpp
-    #define JSON_DISABLE_UNLOCKED_FILE_IO 1
-    #include <cstdio>
-    #include <nlohmann/json.hpp>
-
-    using json = nlohmann::json;
-
-    int main()
-    {
-        std::FILE* f = std::fopen("example.json", "rb");
-        json j = json::parse(f);  // std::fgetc for every character
-        std::fclose(f);
-    }
-    ```
-
-## See also
-
- [**parse**](../basic_json/parse.md) - deserialize from a compatible input
- [**sax_parse**](../basic_json/sax_parse.md) - generate SAX events
- [**JSON_DISABLE_STREAM_BULK_SCAN**](json_disable_stream_bulk_scan.md) - read a `std::istream` one character at a
-  time
- [Parsing: input sources and performance](../../features/parsing/index.md#input-sources-and-performance)
-
-## Version history
-
- Added in version 3.13.0.
@@ -72,12 +72,6 @@ The default value is `0` (disabled — existing behavior is preserved).
    distinct symbol names. Translation units compiled with and without it can therefore be linked into the same program
    without One Definition Rule (ODR) violations, but they cannot exchange instances of library types.

-!!! note "Bulk scanning"
-
-    The parser scans the characters in the stream buffer in bulk (see
-    [`JSON_DISABLE_STREAM_BULK_SCAN`](json_disable_stream_bulk_scan.md)), but it never reads ahead. The stream is left
-    at the same position with and without bulk scanning, in both modes of this macro.
-
 !!! tip "Workaround without the macro"

    Separate the values in the stream with whitespace. The character consumed after a number is then the separator,
@@ -12,9 +12,8 @@ non-ASCII characters (e.g. CJK or emoji) this can validate several times faster.
 This is an **opt-in external dependency**. The library itself remains header-only and its behavior is unchanged: the
 same input is accepted or rejected either way, and every parse error is reported at the same position with the same
 message (simdutf is only used to fast-path *valid* runs; anything it flags falls back to the scalar path so the exact
-diagnostic is preserved). A `std::istream` uses simdutf for the characters its stream buffer holds (see
-[`JSON_DISABLE_STREAM_BULK_SCAN`](json_disable_stream_bulk_scan.md)); other streaming inputs (`FILE*`, wide strings,
-user-defined adapters) always use the scalar path.
+diagnostic is preserved). Streaming inputs (files, `std::istream`, wide strings, user-defined adapters) always use the
+scalar path.

 When `JSON_USE_SIMDUTF` is defined you must make the `simdutf.h` header available on the include path and link the
 simdutf library. When it is not defined, no simdutf header is included and there is no dependency.
@@ -14,12 +14,10 @@ The same input is accepted or rejected either way, with the same values, and err
 the speed differs. The macro exists for platforms whose compilers lack the intrinsics headers, and to test the portable
 code.

-!!! note "ABI compatibility"
+!!! warning "Define consistently"

-    The macro selects between two definitions of the same inline functions. Whether it is defined is encoded in the
-    [namespace](../../features/namespace.md) (tag `_vns`), resulting in distinct symbol names. Translation units
-    compiled with and without it can therefore be linked into the same program without One Definition Rule (ODR)
-    violations, but they cannot exchange instances of library types.
+    The macro selects between two definitions of the same inline functions. It must therefore be defined identically for
+    **every** translation unit that includes `<nlohmann/json_view.hpp>`; prefer a compile definition on the target.

 ## Default definition

@@ -17,12 +17,12 @@ Define the macro only together with a compiler option that enables SSSE3 (e.g. `
 has it), and only for programs that run on such CPUs. It saves the check of the CPU, which costs little. The same
 input is accepted or rejected either way; only the speed of non-ASCII text differs.

-!!! note "ABI compatibility"
+!!! warning "Define consistently"

-    The macro selects between two definitions of the same inline functions. Whether it is defined is encoded in the
-    [namespace](../../features/namespace.md) (tag `_vssse3`, on every architecture), resulting in distinct symbol
-    names. Translation units compiled with and without it can therefore be linked into the same program without One
-    Definition Rule (ODR) violations, but they cannot exchange instances of library types.
+    The macro selects between two definitions of the same inline functions. It must therefore be defined identically,
+    with the same compiler options, for **every** translation unit that includes `<nlohmann/json_view.hpp>`; mixing
+    translation units that define it with ones that do not is an ODR violation. Prefer a compile definition on the
+    target.

 ## Default definition

@@ -39,6 +39,5 @@ the library.
 ## Version history

 - Added in version 3.11.0. Changed inline namespace name in version 3.11.2. Added the ABI tag `_dp` in
-  version 3.12.0, and the ABI tags `_bics`, `_psp`, `_snul`, `_sbu8`, `_ekmo`, `_dsbs`, `_dufio`, `_vns`, and
-  `_vssse3` in version 3.13.0; see
+  version 3.12.0, and the ABI tags `_bics`, `_psp`, `_snul`, `_sbu8`, and `_ekmo` in version 3.13.0; see
  [`nlohmann` Namespace](../../features/namespace.md#structure).
@@ -121,7 +121,6 @@ being read.
 - [`JSON_STRICT_NUL_HANDLING`](macros/json_strict_nul_handling.md) - opt in to rejecting a NUL byte in the input
  instead of treating it as end of input
 - [`JSON_PRECISE_STREAM_POSITION`](macros/json_precise_stream_position.md) - opt in to leaving the stream positioned right after a number
- [`JSON_DISABLE_STREAM_BULK_SCAN`](macros/json_disable_stream_bulk_scan.md) - read the stream one character at a time

 ## Version history

@@ -134,6 +133,3 @@ being read.
  crash (`std::terminate`) when `i` has `eofbit` in its exception mask, in version 3.13.0.
 - Changed to the strong exception safety guarantee in version 3.13.0: `j` is no longer left with a partially parsed
  value if parsing throws.
- Scans the characters in the stream buffer of `i` in bulk in version 3.13.0; the position of `i` after the call is
-  unchanged ([`JSON_DISABLE_STREAM_BULK_SCAN`](macros/json_disable_stream_bulk_scan.md) restores reading one character
-  at a time).
@@ -135,9 +135,6 @@ Note: Some modern features (like C++20 ranges or filesystem support) may be disa
  headers are included.
 - [x] On Windows, the library is compiled with `<Windows.h>` being included to detect and avoid common bugs (see
  [`unit-windows_h.cpp`](https://github.com/nlohmann/json/blob/develop/tests/src/unit-windows_h.cpp)).
- [x] The library is compiled with Qt's keyword macros (`slots`, `signals`, `emit`, `foreach`, `forever`) being defined
-  to make sure it does not use them as identifiers (see
-  [`unit-qt_keywords.cpp`](https://github.com/nlohmann/json/blob/develop/tests/src/unit-qt_keywords.cpp)).
 - [x] The library is compiled with exceptions disabled to support alternative means of error handling.

 ## Stable public API
@@ -5,14 +5,13 @@ using json_document = nlohmann::json_document;

 int main()
 {
-    // validate that every transaction of a batch carries exactly one
+    // validate that every transaction of a batch carries a mandatory
    // "amount" field before materializing any of them into a nlohmann::json
-    // value -- count() counts every member with the key
+    // value -- count() returns 0 or 1 for an object
    json_document batch = json_document::parse(R"(
      [
        {"id": 1, "amount": 9.99},
-        {"id": 2},
-        {"id": 3, "amount": 5.00, "amount": 500.00}
+        {"id": 2}
      ]
    )");

@@ -20,10 +19,9 @@ int main()
    for (std::size_t i = 0; i < transactions.size(); ++i)
    {
        const auto transaction = transactions[i];
-        const auto amounts = transaction.count("amount");
-        if (amounts != 1)
+        if (transaction.count("amount") == 0)
        {
-            std::cout << "transaction " << i << " has " << amounts << " \"amount\" fields\n";
+            std::cout << "transaction " << i << " is missing \"amount\"\n";
            continue;
        }
        std::cout << "transaction " << i << ": " << transaction["amount"].materialize().dump() << '\n';
@@ -1,3 +1,2 @@
 transaction 0: 9.99
-transaction 1 has 0 "amount" fields
-transaction 2 has 2 "amount" fields
+transaction 1 is missing "amount"
@@ -14,8 +14,8 @@ C++ types, and finally serialize it again.
  [parsing untrusted input](parsing/untrusted_input.md).
 - [Zero-copy JSON views](json_view.md) — read a JSON text through a flat index instead of building a `json` tree;
  strings and numbers stay in the input and are only decoded when needed.
- [Editable documents](json_view.md#editing-a-document) — modify a parsed document without building a `json` tree.
- [Images](json_view.md#images) — save a parsed document and load it again without parsing it.
+  [Editable documents](json_view.md#editing-a-document) can also be modified, and [images](json_view.md#images) load a
+  parsed document again without parsing it.
 - [Comments](comments.md) and [trailing commas](trailing_commas.md) — opt-in relaxations of the JSON grammar.

 ## Accessing and modifying values
@@ -67,10 +67,9 @@ table). [`parse_copy()`](../api/basic_json_document/parse_copy.md) always owns a

 !!! warning "A borrowed document depends on your buffer"

-    If a document borrows its text, that text **must outlive the document** (and every view taken from it) and must
-    stay **unmodified** for as long as the document exists, since floating-point values and unescaped strings are
-    read from it lazily. Reading or writing through a view after the underlying buffer is gone is undefined behavior,
-    exactly as it would be for a dangling `#!cpp std::string_view`.
+    If a document borrows its text, that text **must outlive the document** (and every view taken from it). Reading
+    or writing through a view after the underlying buffer is gone is undefined behavior, exactly as it would be for
+    a dangling `#!cpp std::string_view`.

 A view is valid only while all of the following hold:

@@ -78,7 +77,7 @@ A view is valid only while all of the following hold:
 - the document has not been re-parsed since the view was taken (with [`read()`](../api/basic_json_document/read.md)
  or [`parse()`](../api/basic_json_document/parse.md) into it),
 - the document has not had [`shrink_to_fit()`](../api/basic_json_document/shrink_to_fit.md) called on it since, and
- if the document borrows its source text, that text is still alive and unmodified.
+- if the document borrows its source text, that text is still alive.

 Moving the `basic_json_document<>` itself is fine and does **not** invalidate its views: the index is a separate heap
 allocation that keeps its address across the move. Take a fresh view from [`root()`](../api/basic_json_document/root.md)
@@ -168,10 +167,10 @@ document: `#!cpp auto v = json_document::parse(text).root();` does not compile.

    If an object in the source text repeats a key, [`operator[]`](../api/basic_json_view/operator%5B%5D.md),
    [`at`](../api/basic_json_view/at.md), [`find`](../api/basic_json_view/find.md),
-    [`value`](../api/basic_json_view/value.md), [`contains`](../api/basic_json_view/contains.md), and JSON pointer
-    resolution all return the **first** member with that key. `basic_json::parse()` instead keeps the **last** value
-    of a repeated key, so for `#!cpp {"a":1,"a":2}`, `#!cpp view["a"]` is `#!cpp 1` while `#!cpp parse(text)["a"]` is
-    `#!cpp 2`. [`count`](../api/basic_json_view/count.md) counts every member with the key, so it is `#!cpp 2` here.
+    [`value`](../api/basic_json_view/value.md), [`contains`](../api/basic_json_view/contains.md),
+    [`count`](../api/basic_json_view/count.md), and JSON pointer resolution all return the **first** member with that
+    key. `basic_json::parse()` instead keeps the **last** value of a repeated key, so for `#!cpp {"a":1,"a":2}`,
+    `#!cpp view["a"]` is `#!cpp 1` while `#!cpp parse(text)["a"]` is `#!cpp 2`.

 [`begin()`](../api/basic_json_view/begin.md)/[`end()`](../api/basic_json_view/end.md) and
 [`items()`](../api/basic_json_view/items.md) visit *every* occurrence, in document order, and
@@ -180,7 +179,7 @@ document: `#!cpp auto v = json_document::parse(text).root();` does not compile.

 **Why the first?** A lookup can stop as soon as it finds a match. Returning the last member would force every lookup
 to scan all members of the object, even when the key is found at the very first one: this made lookups in small
-objects 1.6 to 3.4 times slower. The hash index of the keys of objects with 128 members or more leads to the first member of a
+objects 1.6 to 3.4 times slower. The hash index of objects with 128 members or more leads to the first member of a
 key as well. Other zero-copy parsers that index the source text, such as yyjson and simdjson, also return the first
 member. RFC 8259 only says that names within an object SHOULD be unique and that the behavior of a receiver that sees
 duplicates is unpredictable, so neither choice is wrong.
@@ -133,14 +133,6 @@ When defined, default parse and serialize functions for enums are excluded and h

 See [full documentation of `JSON_DISABLE_ENUM_SERIALIZATION`](../api/macros/json_disable_enum_serialization.md).

-## `JSON_DISABLE_STREAM_BULK_SCAN`
-
-When defined to `1`, parsing from a `#!cpp std::istream` reads one character at a time instead of scanning the
-characters that the stream buffer holds in bulk. Results are the same either way; the macro is an escape hatch for
-stream buffers that do not follow the usual `std::streambuf` contract. The default value is `0`.
-
-See [full documentation of `JSON_DISABLE_STREAM_BULK_SCAN`](../api/macros/json_disable_stream_bulk_scan.md).
-
 ## `JSON_DISABLE_TUPLE_REFERENCE_CONVERSION`

 When defined to `1`, a JSON value can no longer be created from a one-element `std::tuple` holding a reference to a JSON
@@ -149,14 +141,6 @@ is planned to become the default in version 4.0.0.

 See [full documentation of `JSON_DISABLE_TUPLE_REFERENCE_CONVERSION`](../api/macros/json_disable_tuple_reference_conversion.md).

-## `JSON_DISABLE_UNLOCKED_FILE_IO`
-
-When defined to `1`, parsing from a `#!cpp FILE*` reads every character with `std::fgetc`, which locks the file each
-time, instead of locking the file once and reading it with the unlocked stdio functions. Results are the same either
-way. The default value is `0`.
-
-See [full documentation of `JSON_DISABLE_UNLOCKED_FILE_IO`](../api/macros/json_disable_unlocked_file_io.md).
-
 ## `JSON_NO_AUTOMATIC_UDLS`

 When defined, `<nlohmann/json.hpp>` does not include `<nlohmann/json_literals.hpp>` with the user-defined string literals
@@ -23,12 +23,6 @@ The complete default namespace name is derived as follows:
    - [`JSON_STRICT_BINARY_UTF8`](../api/macros/json_strict_binary_utf8.md) defined non-zero appends `_sbu8`.
    - [`JSON_USE_OBJECTS_FOR_ENUM_KEYED_MAPS`](../api/macros/json_use_objects_for_enum_keyed_maps.md) defined non-zero
      appends `_ekmo`.
-    - [`JSON_DISABLE_STREAM_BULK_SCAN`](../api/macros/json_disable_stream_bulk_scan.md) defined non-zero appends
-      `_dsbs`.
-    - [`JSON_DISABLE_UNLOCKED_FILE_IO`](../api/macros/json_disable_unlocked_file_io.md) defined non-zero appends
-      `_dufio`.
-    - [`JSON_VIEW_NO_SIMD`](../api/macros/json_view_no_simd.md) defined appends `_vns`.
-    - [`JSON_VIEW_USE_SSSE3`](../api/macros/json_view_use_ssse3.md) defined appends `_vssse3`.
 - The inline namespace ends with the suffix `_v` followed by the 3 components of the version number separated by
  underscores. To omit the version component, see [Disabling the version component](#disabling-the-version-component)
  below.
@@ -111,9 +105,5 @@ follows:
 - Added ABI tags `_bics` ([`JSON_BRACE_INIT_COPY_SEMANTICS`](../api/macros/json_brace_init_copy_semantics.md)), `_psp`
  ([`JSON_PRECISE_STREAM_POSITION`](../api/macros/json_precise_stream_position.md)), `_snul`
  ([`JSON_STRICT_NUL_HANDLING`](../api/macros/json_strict_nul_handling.md)), `_sbu8`
-  ([`JSON_STRICT_BINARY_UTF8`](../api/macros/json_strict_binary_utf8.md)), `_ekmo`
-  ([`JSON_USE_OBJECTS_FOR_ENUM_KEYED_MAPS`](../api/macros/json_use_objects_for_enum_keyed_maps.md)), `_dsbs`
-  ([`JSON_DISABLE_STREAM_BULK_SCAN`](../api/macros/json_disable_stream_bulk_scan.md)), `_dufio`
-  ([`JSON_DISABLE_UNLOCKED_FILE_IO`](../api/macros/json_disable_unlocked_file_io.md)), `_vns`
-  ([`JSON_VIEW_NO_SIMD`](../api/macros/json_view_no_simd.md)), and `_vssse3`
-  ([`JSON_VIEW_USE_SSSE3`](../api/macros/json_view_use_ssse3.md)) in version 3.13.0.
+  ([`JSON_STRICT_BINARY_UTF8`](../api/macros/json_strict_binary_utf8.md)), and `_ekmo`
+  ([`JSON_USE_OBJECTS_FOR_ENUM_KEYED_MAPS`](../api/macros/json_use_objects_for_enum_keyed_maps.md)) in version 3.13.0.
@@ -55,30 +55,6 @@ whitespace, because `operator>>` consumes the character that terminates a number
 [`JSON_PRECISE_STREAM_POSITION`](../../api/macros/json_precise_stream_position.md) is defined to `1` — see the
 [`operator>>` notes](../../api/operator_gtgt.md#notes) for details and examples.

-## Input sources and performance
-
-All inputs produce the same values and the same exceptions, but they are read in different ways, which makes some of
-them faster than others:
-
-| input                                                                                      | how it is read                                                                     |
-|--------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------|
-| strings, string views, string literals, contiguous containers, pointer or iterator ranges over contiguous memory | the whole input is scanned in bulk: runs of string characters, numbers, and indentation are recognized several bytes at a time |
-| `#!cpp std::istream` (`#!cpp std::ifstream`, `#!cpp std::istringstream`, ...)            | the characters the stream buffer holds are scanned in bulk like a string; the stream buffer is asked for more when they are used up |
-| `#!cpp FILE*`                                                                              | one character at a time, with the file locked once for the whole parse              |
-| other iterator ranges (e.g., `#!cpp std::list<char>`, `#!cpp std::istreambuf_iterator<char>`), wide strings | one character at a time                                                             |
-
-Parsing a file from a `#!cpp std::ifstream` is therefore only about 10 to 20 % slower than reading the whole file into a
-`#!cpp std::string` first and parsing that, and it needs no memory for a copy of the file. The stream is never read
-ahead: after parsing, it is positioned exactly as if every character had been read one at a time, so
-[`operator>>`](../../api/operator_gtgt.md) can still read several values from one stream (see also
-[JSON Lines](json_lines.md)).
-
-Two macros switch these optimizations off without changing any result:
-[`JSON_DISABLE_STREAM_BULK_SCAN`](../../api/macros/json_disable_stream_bulk_scan.md) for stream buffers that do not
-follow the usual `std::streambuf` contract, and
-[`JSON_DISABLE_UNLOCKED_FILE_IO`](../../api/macros/json_disable_unlocked_file_io.md) for programs in which another
-thread must use the same `#!cpp FILE` object while it is parsed.
-
 ## SAX vs. DOM parsing

 The library offers two parsing models:
@@ -194,9 +194,9 @@ packet-beta

 | Bytes | Field   | Type       | Contents                                                                                                                      |
 |-------|---------|------------|-------------------------------------------------------------------------------------------------------------------------------|
-| 0     | `kind`  | `uint8_t`  | the type, numbered as [`value_t`](../api/basic_json/value_t.md): 0 null, 1 object, 2 array, 3 string, 4 boolean, 5 signed integer, 6 unsigned integer, 7 float; 10 for a link (see below). There is no node for a discarded value: a [discarded](../api/basic_json_view/is_discarded.md) view has none |
-| 1     | `flags` | `uint8_t`  | bits 0-1: where a string's bytes (or a number's token) are (0: the source text, 1: the buffer of decoded strings, for strings with escapes, 2: the edit buffer); bit 2: the value of a boolean; bit 3: moved, bit 4: new, bit 5: linked (see below) |
-| 2-3   | `extra` | `uint16_t` | numbers: the number of integer digits (low byte) and fraction digits (high byte), 255 for more; objects: the number of their key hash index (1-based), or 0; otherwise 0 |
+| 0     | `kind`  | `uint8_t`  | the type, numbered as [`value_t`](../api/basic_json/value_t.md): 0 null, 1 object, 2 array, 3 string, 4 boolean, 5 signed integer, 6 unsigned integer, 7 float; 10 for a link (see below) |
+| 1     | `flags` | `uint8_t`  | bits 0-1: where a string's bytes (or a number's token) are (0: the source text, 1: the buffer of decoded strings, for strings with escapes, 2: the edit buffer); bit 2: the value of a boolean; bits 3 and 4: moved and new (see below) |
+| 2-3   | `extra` | `uint16_t` | numbers: the number of integer digits (low byte) and fraction digits (high byte), 255 for more; objects: the number of their hash index (1-based), or 0; otherwise 0 |
 | 4-7   | `off`   | `uint32_t` | where the value starts: the first byte after a string's opening quote (or its position in the buffer of decoded strings), the first byte of a number or literal, the bracket of an array or object |
 | 8-11  | `len`   | `uint32_t` | strings: the length after decoding; floats and literals: the length of the token; arrays and objects: the number of elements |
 | 12-15 | `next`  | `uint32_t` | arrays and objects: the number of nodes of the subtree, including the node itself                                              |
@@ -212,7 +212,7 @@ packet-beta
  step from element to element this way and skip whole subtrees in constant time.
 - **Offsets** are 32 bits wide, so a document is limited to 4294967279 bytes, 4 GiB minus 16 bytes (a margin below
  2^32 for positions one scanner step past the end of the text; `out_of_range.416`).
- **Large objects** (128 members or more) get a hash index for their keys after parsing
+- **Large objects** (128 members or more) get a hash index after parsing
  ([`detail/view/object_index.hpp`](https://github.com/nlohmann/json/blob/develop/include/nlohmann/detail/view/object_index.hpp)):
  an open-addressing table whose slots hold the distance from the object's node to a key's node, so that a lookup does
  not compare every key. Of duplicate keys the table leads to the first, as a linear search does. The object's `extra`
@@ -257,8 +257,6 @@ edited:
  sequence (a header node, then the entries), whose number is in `off`. The entries are links (`kind` 10), whose bytes
  8-15 hold the address of the value's node, so values never move.
 - A node written by an edit gets the flag *new* (bit 4): it has no position in the source text.
- A value that an entry of such a sequence links to gets the flag *linked* (bit 5): its extent in the parsed layout
-  (`next`) no longer matters, so a scalar can replace an array or object there in place.
 - Views of read-only documents compile without any of this: how views walk the index is a template parameter
  (`navigation<Editable>`).

@@ -370,9 +370,7 @@ nav:
          - 'JSON_DELETE_DEPRECATED_FUNCTIONS': api/macros/json_delete_deprecated_functions.md
          - 'JSON_DIAGNOSTIC_POSITIONS': api/macros/json_diagnostic_positions.md
          - 'JSON_DISABLE_ENUM_SERIALIZATION': api/macros/json_disable_enum_serialization.md
-          - 'JSON_DISABLE_STREAM_BULK_SCAN': api/macros/json_disable_stream_bulk_scan.md
          - 'JSON_DISABLE_TUPLE_REFERENCE_CONVERSION': api/macros/json_disable_tuple_reference_conversion.md
-          - 'JSON_DISABLE_UNLOCKED_FILE_IO': api/macros/json_disable_unlocked_file_io.md
          - 'JSON_HAS_CPP_11, JSON_HAS_CPP_14, JSON_HAS_CPP_17, JSON_HAS_CPP_20, JSON_HAS_CPP_23, JSON_HAS_CPP_26': api/macros/json_has_cpp_11.md
          - 'JSON_HAS_EXPERIMENTAL_FILESYSTEM, JSON_HAS_FILESYSTEM': api/macros/json_has_filesystem.md
          - 'JSON_HAS_RANGE_VIEW_CONVERSION': api/macros/json_has_range_view_conversion.md
@@ -54,14 +54,6 @@
    #define JSON_USE_OBJECTS_FOR_ENUM_KEYED_MAPS 0
 #endif

-#ifndef JSON_DISABLE_STREAM_BULK_SCAN
-    #define JSON_DISABLE_STREAM_BULK_SCAN 0
-#endif
-
-#ifndef JSON_DISABLE_UNLOCKED_FILE_IO
-    #define JSON_DISABLE_UNLOCKED_FILE_IO 0
-#endif
-
 #if JSON_DIAGNOSTICS
    #define NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS _diag
 #else
@@ -110,38 +102,14 @@
    #define NLOHMANN_JSON_ABI_TAG_OBJECTS_FOR_ENUM_KEYED_MAPS
 #endif

-#if JSON_DISABLE_STREAM_BULK_SCAN
-    #define NLOHMANN_JSON_ABI_TAG_DISABLE_STREAM_BULK_SCAN _dsbs
-#else
-    #define NLOHMANN_JSON_ABI_TAG_DISABLE_STREAM_BULK_SCAN
-#endif
-
-#if JSON_DISABLE_UNLOCKED_FILE_IO
-    #define NLOHMANN_JSON_ABI_TAG_DISABLE_UNLOCKED_FILE_IO _dufio
-#else
-    #define NLOHMANN_JSON_ABI_TAG_DISABLE_UNLOCKED_FILE_IO
-#endif
-
-#ifdef JSON_VIEW_NO_SIMD
-    #define NLOHMANN_JSON_ABI_TAG_VIEW_NO_SIMD _vns
-#else
-    #define NLOHMANN_JSON_ABI_TAG_VIEW_NO_SIMD
-#endif
-
-#ifdef JSON_VIEW_USE_SSSE3
-    #define NLOHMANN_JSON_ABI_TAG_VIEW_USE_SSSE3 _vssse3
-#else
-    #define NLOHMANN_JSON_ABI_TAG_VIEW_USE_SSSE3
-#endif
-
 #ifndef NLOHMANN_JSON_NAMESPACE_NO_VERSION
    #define NLOHMANN_JSON_NAMESPACE_NO_VERSION 0
 #endif

 // Construct the namespace ABI tags component
-#define NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b, c, d, e, f, g, h, i, j, k, l) json_abi ## a ## b ## c ## d ## e ## f ## g ## h ## i ## j ## k ## l
-#define NLOHMANN_JSON_ABI_TAGS_CONCAT(a, b, c, d, e, f, g, h, i, j, k, l) \
-    NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b, c, d, e, f, g, h, i, j, k, l)
+#define NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b, c, d, e, f, g, h) json_abi ## a ## b ## c ## d ## e ## f ## g ## h
+#define NLOHMANN_JSON_ABI_TAGS_CONCAT(a, b, c, d, e, f, g, h) \
+    NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b, c, d, e, f, g, h)

 #define NLOHMANN_JSON_ABI_TAGS                                       \
    NLOHMANN_JSON_ABI_TAGS_CONCAT(                                   \
@@ -152,11 +120,7 @@
            NLOHMANN_JSON_ABI_TAG_PRECISE_STREAM_POSITION,           \
            NLOHMANN_JSON_ABI_TAG_STRICT_NUL_HANDLING,               \
            NLOHMANN_JSON_ABI_TAG_STRICT_BINARY_UTF8,                \
-            NLOHMANN_JSON_ABI_TAG_OBJECTS_FOR_ENUM_KEYED_MAPS,       \
-            NLOHMANN_JSON_ABI_TAG_DISABLE_STREAM_BULK_SCAN,          \
-            NLOHMANN_JSON_ABI_TAG_DISABLE_UNLOCKED_FILE_IO,          \
-            NLOHMANN_JSON_ABI_TAG_VIEW_NO_SIMD,                      \
-            NLOHMANN_JSON_ABI_TAG_VIEW_USE_SSSE3)
+            NLOHMANN_JSON_ABI_TAG_OBJECTS_FOR_ENUM_KEYED_MAPS)

 // Construct the namespace version component
 #define NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT_EX(major, minor, patch) \
@@ -1342,32 +1342,14 @@ inline char* write_shortest(char* first, const zmij::shortest_decimal d) noexcep
    return end + (three ? 5 : 4);
 }

-/// the powers of ten up to 10^19 (all that fit in std::uint64_t)
-inline const std::array<std::uint64_t, 20>& powers_of_ten() noexcept
+/// the powers of ten up to 10^16
+inline const std::array<std::uint64_t, 17>& powers_of_ten_16() noexcept
 {
-    static const std::array<std::uint64_t, 20> powers =
+    static const std::array<std::uint64_t, 17> powers =
    {
        {
-            1u,
-            10u,
-            100u,
-            1000u,
-            10000u,
-            100000u,
-            1000000u,
-            10000000u,
-            100000000u,
-            1000000000u,
-            10000000000u,
-            100000000000u,
-            1000000000000u,
-            10000000000000u,
-            100000000000000u,
-            1000000000000000u,
-            10000000000000000u,
-            100000000000000000u,
-            1000000000000000000u,
-            10000000000000000000u
+            1u, 10u, 100u, 1000u, 10000u, 100000u, 1000000u, 10000000u, 100000000u, 1000000000u, 10000000000u,
+            100000000000u, 1000000000000u, 10000000000000u, 100000000000000u, 1000000000000000u, 10000000000000000u
        }
    };
    return powers;
@@ -1385,9 +1367,9 @@ JSON_HEDLEY_NON_NULL(1)
 JSON_HEDLEY_RETURNS_NON_NULL
 inline char* write_short_decimal(char* first, std::uint64_t digits, int count, int exp) noexcept
 {
-    JSON_ASSERT(digits >= powers_of_ten()[static_cast<std::size_t>(count - 1)] && count <= 15);
+    JSON_ASSERT(digits >= powers_of_ten_16()[static_cast<std::size_t>(count - 1)] && count <= 15);
    const int scale = 16 - count;
-    return write_shortest(first, zmij::shortest_decimal{digits * powers_of_ten()[static_cast<std::size_t>(scale)], exp - scale - 1, 0, false});
+    return write_shortest(first, zmij::shortest_decimal{digits * powers_of_ten_16()[static_cast<std::size_t>(scale)], exp - scale - 1, 0, false});
 }

 /// as write_short_decimal(), counting the digits (not 0, less than 10^15)
@@ -1398,7 +1380,7 @@ inline char* write_short_decimal(char* first, std::uint64_t digits, int exp) noe
    JSON_ASSERT(digits != 0 && digits < 1000000000000000u);
    // floor(log10(2^bits)) + 1 digits, or one less
    const int log2_bound = ((64 - count_leading_zeros(digits)) * 1233) >> 12;
-    const int count = log2_bound + (digits >= powers_of_ten()[static_cast<std::size_t>(log2_bound)] ? 1 : 0);
+    const int count = log2_bound + (digits >= powers_of_ten_16()[static_cast<std::size_t>(log2_bound)] ? 1 : 0);
    return write_short_decimal(first, digits, count, exp);
 }

@@ -14,12 +14,10 @@
 #include <cstdint> // uint32_t
 #include <cstring> // strlen
 #include <iterator> // begin, end, iterator_traits, random_access_iterator_tag, distance, next, reverse_iterator
-#include <limits> // numeric_limits
 #include <streambuf> // streambuf
 #include <string> // string, char_traits
 #include <type_traits> // enable_if, is_base_of, is_pointer, is_integral, remove_pointer
 #include <utility> // pair, declval
-#include <vector> // vector

 #ifndef JSON_NO_IO
    #include <cstdio>   // FILE *
@@ -32,24 +30,6 @@
 #include <nlohmann/detail/meta/type_traits.hpp>
 #include <nlohmann/detail/string_utils.hpp>

-#ifndef JSON_NO_IO
-    // Which unlocked stdio functions file_input_adapter uses (see
-    // JSON_DISABLE_UNLOCKED_FILE_IO): 1 = POSIX flockfile/getc_unlocked,
-    // 2 = Microsoft CRT _lock_file/_fgetc_nolock, 0 = none (std::fgetc, which
-    // locks the file for every character). Only C libraries known to declare
-    // the functions are listed; the macros are tested after <cstdio>, which
-    // defines __GLIBC__.
-    #if JSON_DISABLE_UNLOCKED_FILE_IO
-        #define JSON_UNLOCKED_FILE_IO 0
-    #elif defined(_MSC_VER)
-        #define JSON_UNLOCKED_FILE_IO 2
-    #elif defined(__GLIBC__) || defined(__APPLE__) || defined(__ANDROID__) || defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__)
-        #define JSON_UNLOCKED_FILE_IO 1
-    #else
-        #define JSON_UNLOCKED_FILE_IO 0
-    #endif
-#endif  // JSON_NO_IO
-
 NLOHMANN_JSON_NAMESPACE_BEGIN
 namespace detail
 {
@@ -76,35 +56,18 @@ class file_input_adapter
        : m_file(f)
    {
        JSON_ASSERT(m_file != nullptr);
-        lock();
    }

    // make class move-only
    file_input_adapter(const file_input_adapter&) = delete;
-    file_input_adapter(file_input_adapter&& rhs) noexcept
-        : m_file(rhs.m_file)
-    {
-        // the lock is owned by the thread, not the adapter: hand it over
-        rhs.m_file = nullptr;
-    }
+    file_input_adapter(file_input_adapter&&) noexcept = default;
    file_input_adapter& operator=(const file_input_adapter&) = delete;
    file_input_adapter& operator=(file_input_adapter&&) = delete;
-    ~file_input_adapter()
-    {
-        unlock();
-    }
+    ~file_input_adapter() = default;

    std::char_traits<char>::int_type get_character() noexcept
    {
-        // the file is locked for the lifetime of the adapter, so the
-        // per-character lock of std::fgetc can be skipped
-#if JSON_UNLOCKED_FILE_IO == 1
-        return getc_unlocked(m_file);
-#elif JSON_UNLOCKED_FILE_IO == 2
-        return _fgetc_nolock(m_file);
-#else
        return std::fgetc(m_file);
-#endif
    }

    // returns the number of characters successfully read
@@ -115,32 +78,6 @@ class file_input_adapter
    }

  private:
-    // Lock the file once for the whole parse instead of once per character.
-    // The lock is recursive, so fread() and the user's own stdio calls on the
-    // same thread keep working.
-    void lock() noexcept
-    {
-#if JSON_UNLOCKED_FILE_IO == 1
-        flockfile(m_file);
-#elif JSON_UNLOCKED_FILE_IO == 2
-        _lock_file(m_file);
-#endif
-    }
-
-    void unlock() noexcept
-    {
-        // a moved-from adapter has no file and holds no lock
-        if (m_file == nullptr)
-        {
-            return;
-        }
-#if JSON_UNLOCKED_FILE_IO == 1
-        funlockfile(m_file);
-#elif JSON_UNLOCKED_FILE_IO == 2
-        _unlock_file(m_file);
-#endif
-    }
-
    /// the file pointer to read from
    std::FILE* m_file;
 };
@@ -190,26 +127,15 @@ class input_stream_adapter
    input_stream_adapter& operator=(input_stream_adapter&) = delete;
    input_stream_adapter& operator=(input_stream_adapter&&) = delete;

-    input_stream_adapter(input_stream_adapter&& rhs) noexcept
-        : is(rhs.is), sb(rhs.sb)
 #if JSON_PRECISE_STREAM_POSITION
-        , lookahead(rhs.lookahead)
-#endif
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-        , token_carry(std::move(rhs.token_carry))
-        , token_segment(rhs.token_segment)
-        , current_in_get_area(rhs.current_in_get_area)
-        , tracking_token(rhs.tracking_token)
-#endif
+    input_stream_adapter(input_stream_adapter&& rhs) noexcept
+        : is(rhs.is), sb(rhs.sb), lookahead(rhs.lookahead)
    {
        rhs.is = nullptr;
        rhs.sb = nullptr;
-#if JSON_PRECISE_STREAM_POSITION
        rhs.lookahead = false;
-#endif
    }

-#if JSON_PRECISE_STREAM_POSITION
    // Whether the character last returned by get_character() can be given back
    // to the input with release_lookahead().
    static constexpr bool supports_lookahead = true;
@@ -229,41 +155,17 @@ class input_stream_adapter
            sb->sbumpc();
        }

-#if !JSON_DISABLE_STREAM_BULK_SCAN
-        // sgetc() refills the get area if it is exhausted
-        const bool refill = streambuf_access::get_ptr(sb) == streambuf_access::get_end(sb);
-        if (JSON_HEDLEY_UNLIKELY(refill))
-        {
-            save_token_segment();
-        }
-#endif
-
        auto res = sb->sgetc();
        // set eof manually, as we don't use the istream interface.
        if (JSON_HEDLEY_UNLIKELY(res == std::char_traits<char>::eof()))
        {
            // there is nothing to step over next time
            lookahead = false;
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-            current_in_get_area = false;
-#endif
            is->clear(is->rdstate() | std::ios::eofbit);
        }
        else
        {
            lookahead = true;
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-            if (JSON_HEDLEY_UNLIKELY(refill))
-            {
-                // the peeked character is at gptr(), unless the streambuf has
-                // no get area
-                after_refill(res, streambuf_access::get_ptr(sb) != streambuf_access::get_end(sb));
-            }
-            else
-            {
-                current_in_get_area = true;
-            }
-#endif
        }
        return res;
    }
@@ -277,6 +179,13 @@ class input_stream_adapter
        lookahead = false;
    }
 #else
+    input_stream_adapter(input_stream_adapter&& rhs) noexcept
+        : is(rhs.is), sb(rhs.sb)
+    {
+        rhs.is = nullptr;
+        rhs.sb = nullptr;
+    }
+
    // std::istream/std::streambuf use std::char_traits<char>::to_int_type, to
    // ensure that std::char_traits<char>::eof() and the character 0xFF do not
    // end up as the same value, e.g., 0xFFFFFFFF.
@@ -285,37 +194,12 @@ class input_stream_adapter
    // stays consumed after parsing; see JSON_PRECISE_STREAM_POSITION.
    std::char_traits<char>::int_type get_character()
    {
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-        // sbumpc() refills the get area if it is exhausted
-        const bool refill = streambuf_access::get_ptr(sb) == streambuf_access::get_end(sb);
-        if (JSON_HEDLEY_UNLIKELY(refill))
-        {
-            save_token_segment();
-        }
-#endif
-
        auto res = sb->sbumpc();
        // set eof manually, as we don't use the istream interface.
        if (JSON_HEDLEY_UNLIKELY(res == std::char_traits<char>::eof()))
        {
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-            current_in_get_area = false;
-#endif
            is->clear(is->rdstate() | std::ios::eofbit);
        }
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-        else if (JSON_HEDLEY_UNLIKELY(refill))
-        {
-            // the consumed character is at gptr() - 1, unless the streambuf
-            // has no get area and returned it from uflow()
-            const char* const next = streambuf_access::get_ptr(sb);
-            after_refill(res, next != nullptr && next != streambuf_access::get_begin(sb));
-        }
-        else
-        {
-            current_in_get_area = true;
-        }
-#endif
        return res;
    }
 #endif
@@ -334,165 +218,7 @@ class input_stream_adapter
        return res;
    }

-#if !JSON_DISABLE_STREAM_BULK_SCAN
-    // The lexer may scan the characters in the get area of the streambuf
-    // directly (SWAR fast paths). The get area is only a window into the
-    // input: it ends wherever the streambuf's buffer ends, and is refilled by
-    // the next get_character(). The lexer therefore keeps counting the
-    // position itself and treats the end of the window as "unknown", not as
-    // the end of the input.
-    static constexpr bool supports_bulk_scan = true;
-    static constexpr bool bulk_window = true;
-
-    // Pointer to the next unread character; only valid when
-    // bulk_remaining() > 0. The character before it is the one last returned
-    // by get_character().
-    const char* bulk_data() const
-    {
-        return current_end();
-    }
-
-    // Number of unread characters in the get area.
-    std::size_t bulk_remaining() const
-    {
-        if (!current_in_get_area)
-        {
-            return 0;
-        }
-        return static_cast<std::size_t>(streambuf_access::get_end(sb) - current_end());
-    }
-
-    // Consume @a n characters previously inspected via bulk_data(); the last
-    // of them becomes the character last returned by get_character().
-    void bulk_skip(std::size_t n)
-    {
-        JSON_ASSERT(n <= bulk_remaining());
-        // gbump() takes an int, but a get area (e.g., of a std::stringbuf) can
-        // be larger
-        constexpr auto max_bump = static_cast<std::size_t>((std::numeric_limits<int>::max)());
-        for (; n > max_bump; n -= max_bump)
-        {
-            streambuf_access::bump(sb, static_cast<int>(max_bump));
-        }
-        streambuf_access::bump(sb, static_cast<int>(n));
-    }
-
-    // The adapter keeps the current token for the lexer's error messages: the
-    // part in the get area is only remembered as a pointer, and copied out
-    // when the get area is about to be refilled.
-    static constexpr bool supports_token_tracking = true;
-
-    // Start a token with the characters read from now on. Until this is
-    // called, nothing is tracked (the binary readers never call it).
-    void begin_token() noexcept
-    {
-        tracking_token = true;
-        token_carry.clear();
-        token_segment = current_end();
-    }
-
-    // Start a new token with the character @a c last returned by
-    // get_character().
-    void mark_token_start(std::char_traits<char>::int_type c)
-    {
-        tracking_token = true;
-        token_carry.clear();
-        if (current_in_get_area)
-        {
-            token_segment = current_end() - 1;
-        }
-        else
-        {
-            token_segment = nullptr;
-            token_carry.push_back(std::char_traits<char>::to_char_type(c));
-        }
-    }
-
-    // Copy the characters read since mark_token_start() to @a out, without the
-    // last one if @a drop_last.
-    void copy_token(std::vector<char>& out, bool drop_last) const
-    {
-        out = token_carry;
-        if (token_segment != nullptr)
-        {
-            out.insert(out.end(), token_segment, current_end());
-        }
-        if (drop_last && !out.empty())
-        {
-            out.pop_back();
-        }
-    }
-#endif
-
  private:
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-    // Reads the protected get-area pointers of any std::streambuf. Naming the
-    // members through a derived class makes forming the member pointers
-    // accessible; calling them on another streambuf object is then ordinary
-    // member access through a pointer to member.
-    struct streambuf_access : std::streambuf
-    {
-        static const char* get_ptr(std::streambuf* s)
-        {
-            return (s->*(&streambuf_access::gptr))();
-        }
-        static const char* get_end(std::streambuf* s)
-        {
-            return (s->*(&streambuf_access::egptr))();
-        }
-        static const char* get_begin(std::streambuf* s)
-        {
-            return (s->*(&streambuf_access::eback))();
-        }
-        static void bump(std::streambuf* s, int n)
-        {
-            (s->*(&streambuf_access::gbump))(n);
-        }
-    };
-
-    // one past the character last returned by get_character(), if that is in
-    // the get area
-    const char* current_end() const
-    {
-#if JSON_PRECISE_STREAM_POSITION
-        // the character is peeked at gptr() and not stepped over yet, unless
-        // it was given back with release_lookahead()
-        return streambuf_access::get_ptr(sb) + (lookahead ? 1 : 0);
-#else
-        return streambuf_access::get_ptr(sb);
-#endif
-    }
-
-    // the get area is about to be replaced: copy the token's part in it
-    void save_token_segment()
-    {
-        if (token_segment != nullptr)
-        {
-            token_carry.insert(token_carry.end(), token_segment, streambuf_access::get_end(sb));
-            token_segment = nullptr;
-        }
-    }
-
-    // character @a c was just read into a new get area (@a in_get_area) or
-    // returned without one
-    void after_refill(std::char_traits<char>::int_type c, bool in_get_area)
-    {
-        current_in_get_area = in_get_area;
-        if (!tracking_token)
-        {
-            return;
-        }
-        if (in_get_area)
-        {
-            token_segment = current_end() - 1;
-        }
-        else
-        {
-            token_carry.push_back(std::char_traits<char>::to_char_type(c));
-        }
-    }
-#endif
-
 #if JSON_PRECISE_STREAM_POSITION
    // Step over the character last returned by get_character(). The character
    // has already been peeked successfully, so for every streambuf with a get
@@ -514,16 +240,6 @@ class input_stream_adapter
    /// whether get_character() peeked a character that is not consumed yet
    bool lookahead = false;
 #endif
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-    /// the part of the current token that was in earlier get areas
-    std::vector<char> token_carry{}; // NOLINT(readability-redundant-member-init)
-    /// start of the current token's part in the get area, or nullptr
-    const char* token_segment = nullptr;
-    /// whether the character last returned by get_character() is in the get area
-    bool current_in_get_area = false;
-    /// whether a token is tracked at all; the binary readers never start one
-    bool tracking_token = false;
-#endif
 };
 #endif  // JSON_NO_IO

@@ -166,43 +166,6 @@ constexpr bool input_adapter_supports_bulk_scan(std::false_type /*detected*/)
    return false;
 }

-// Detect whether an input adapter keeps the current token itself and can
-// hand it out on demand (see input_stream_adapter::supports_token_tracking),
-// so the lexer need not copy every scanned character into token_string.
-template<typename InputAdapterType>
-using detect_supports_token_tracking = decltype(InputAdapterType::supports_token_tracking);
-
-template<typename InputAdapterType>
-constexpr bool input_adapter_supports_token_tracking(std::true_type /*detected*/)
-{
-    return InputAdapterType::supports_token_tracking;
-}
-
-template<typename InputAdapterType>
-constexpr bool input_adapter_supports_token_tracking(std::false_type /*detected*/)
-{
-    return false;
-}
-
-// Detect whether the contiguous block of a bulk-scan adapter is only a window
-// into the input (see input_stream_adapter::bulk_window): its end is not the
-// end of the input, so a token that touches it must be finished character by
-// character.
-template<typename InputAdapterType>
-using detect_bulk_window = decltype(InputAdapterType::bulk_window);
-
-template<typename InputAdapterType>
-constexpr bool input_adapter_bulk_window(std::true_type /*detected*/)
-{
-    return InputAdapterType::bulk_window;
-}
-
-template<typename InputAdapterType>
-constexpr bool input_adapter_bulk_window(std::false_type /*detected*/)
-{
-    return false;
-}
-
 /*!
@brief lexical analysis

@@ -221,20 +184,9 @@ class lexer : public lexer_base<BasicJsonType>
    /// whether the last read token can be reconstructed from the input adapter
    /// on demand (in error paths) instead of being copied on every scanned
    /// character; see input_adapter_supports_seek
-    static constexpr bool seekable =
+    static constexpr bool lazy_token_string =
        input_adapter_supports_seek<InputAdapterType>(is_detected<detect_supports_seek, InputAdapterType> {});

-    /// whether the adapter keeps the token itself (mark_token_start() /
-    /// copy_token()); see input_adapter_supports_token_tracking
-    static constexpr bool adapter_token =
-        !seekable && input_adapter_supports_token_tracking<InputAdapterType>(is_detected<detect_supports_token_tracking, InputAdapterType> {});
-
-    /// whether the last read token is obtained from the input adapter on
-    /// demand (in error paths) instead of being copied on every scanned
-    /// character: seekable adapters reconstruct it from the consumed input,
-    /// token-tracking adapters keep it themselves
-    static constexpr bool lazy_token_string = seekable || adapter_token;
-
    /// whether the read position is derived from the input adapter on demand
    /// instead of being counted on every scanned character. Seekable adapters
    /// know how much input they consumed and can revisit it, so
@@ -242,7 +194,7 @@ class lexer : public lexer_base<BasicJsonType>
    /// and line and column are recomputed from the consumed input only when
    /// get_position() is called (errors). Counting per character kept two
    /// increments and a newline check in the hot path of every get().
-    static constexpr bool lazy_position = seekable;
+    static constexpr bool lazy_position = lazy_token_string;

    /// whether a simulated unget can be passed on to the input adapter, which
    /// then leaves the character in the input; see
@@ -251,17 +203,14 @@ class lexer : public lexer_base<BasicJsonType>
        input_adapter_supports_lookahead<InputAdapterType>(is_detected<detect_supports_lookahead, InputAdapterType> {});

    /// whether string scanning may bulk-consume runs of ordinary characters
-    /// directly from a contiguous input buffer (SWAR fast path). Without
-    /// lazy_token_string / lazy_position, the bulk paths copy the consumed
-    /// characters into token_string and advance the position counters
-    /// themselves (see bulk_consume).
+    /// directly from a contiguous input buffer (SWAR fast path). This requires
+    /// the token to be reconstructible lazily (lazy_token_string), so bypassing
+    /// the per-character capture in get() cannot lose error diagnostics. It
+    /// also implies lazy_position, so the bulk paths need not advance the
+    /// position counters.
    static constexpr bool bulk_scan =
-        input_adapter_supports_bulk_scan<InputAdapterType>(is_detected<detect_supports_bulk_scan, InputAdapterType> {});
-
-    /// whether the contiguous block is only a window into the input, so that
-    /// its end does not end a token; see input_adapter_bulk_window
-    static constexpr bool bulk_window =
-        input_adapter_bulk_window<InputAdapterType>(is_detected<detect_bulk_window, InputAdapterType> {});
+        lazy_token_string
+        && input_adapter_supports_bulk_scan<InputAdapterType>(is_detected<detect_supports_bulk_scan, InputAdapterType> {});

  public:
    using token_type = typename lexer_base<BasicJsonType>::token_type;
@@ -270,11 +219,7 @@ class lexer : public lexer_base<BasicJsonType>
        : ia(std::move(adapter))
        , ignore_comments(ignore_comments_)
        , discard_number_values(discard_number_values_)
-    {
-        // the token string of an error before the first token is everything
-        // read so far
-        begin_token(std::integral_constant<bool, adapter_token> {});
-    }
+    {}

    // deleted because of pointer members
    lexer(const lexer&) = delete;
@@ -291,8 +236,8 @@ class lexer : public lexer_base<BasicJsonType>
    /// contiguous input: try to decode the 4 hex digits following `\\u`
    /// directly from the input buffer via hex_codepoint(), instead of 4 calls
    /// to get(). On success, advances the adapter exactly as those 4 get()
-    /// calls would (including the position and token bookkeeping of a
-    /// streaming adapter, see bulk_consume) and leaves @a current holding the last of
+    /// calls would (bulk_scan implies lazy_position, so there are no position
+    /// counters to advance) and leaves @a current holding the last of
    /// the 4 digits, just as the last such get() would; the codepoint is
    /// written to @a out. Makes no state change and returns false for a
    /// pending unget, fewer than 4 remaining bytes, or any of the 4 bytes not
@@ -311,7 +256,7 @@ class lexer : public lexer_base<BasicJsonType>
        {
            return false;
        }
-        bulk_consume(reinterpret_cast<const char*>(raw), 4);
+        ia.bulk_skip(4);
        current = char_traits<char_type>::to_int_type(raw[3]);
        out = codepoint;
        return true;
@@ -440,36 +385,7 @@ class lexer : public lexer_base<BasicJsonType>
            return;
        }
        token_buffer.append(reinterpret_cast<const typename string_t::value_type*>(data), pos);
-        bulk_consume(reinterpret_cast<const char*>(data), pos);
-    }
-
-    /// consume @a n characters at @a data (the adapter's bulk_data()) and do
-    /// the bookkeeping get() would have done for them; the characters are
-    /// never newlines
-    void bulk_consume(const char* data, std::size_t n)
-    {
-        bulk_track_position(n, std::integral_constant<bool, lazy_position> {});
-        bulk_track_token(data, n, std::integral_constant<bool, lazy_token_string> {});
-        ia.bulk_skip(n);
-    }
-
-    /// seekable adapter: the position is derived from the adapter
-    void bulk_track_position(std::size_t /*n*/, std::true_type /*lazy*/) const noexcept {}
-
-    /// streaming adapter: count the characters
-    void bulk_track_position(std::size_t n, std::false_type /*lazy*/) noexcept
-    {
-        position.chars_read_total += n;
-        position.chars_read_current_line += n;
-    }
-
-    /// the token is obtained from the adapter
-    void bulk_track_token(const char* /*data*/, std::size_t /*n*/, std::true_type /*lazy*/) const noexcept {}
-
-    /// streaming adapter: capture the characters
-    void bulk_track_token(const char* data, std::size_t n, std::false_type /*lazy*/)
-    {
-        token_string.insert(token_string.end(), data, data + n);
+        ia.bulk_skip(pos);
    }

    /// streaming input: no bulk fast path
@@ -1687,10 +1603,6 @@ scan_number_done:
            }
        }
        const std::size_t len = i;
-        if (number_may_continue(len == avail, std::integral_constant<bool, bulk_window> {}))
-        {
-            return token_type::uninitialized;
-        }

        // reset() records where this token starts (for diagnostics), so it has
        // to run before the input position advances below
@@ -1708,8 +1620,7 @@ scan_number_done:
            const token_type integer_result = convert_integer(number_type, data, data + len);
            if (JSON_HEDLEY_LIKELY(integer_result != token_type::uninitialized))
            {
-                bulk_consume(data + 1, len - 1);
-                read_number_terminator(std::integral_constant<bool, bulk_window> {});
+                ia.bulk_skip(len - 1);
                return integer_result;
            }
            // The value does not fit an integer, so this token converts as a
@@ -1725,37 +1636,11 @@ scan_number_done:
        token_buffer.append(reinterpret_cast<const typename string_t::value_type*>(data), len);
        decimal_point_position = dot_index;

-        bulk_consume(data + 1, len - 1);
-        read_number_terminator(std::integral_constant<bool, bulk_window> {});
+        ia.bulk_skip(len - 1);

        return convert_number(number_type, mantissa_end);
    }

-    /// window adapter: a number that reaches the end of the window may continue
-    /// after it, so scan_number() has to read it character by character
-    static constexpr bool number_may_continue(bool at_end, std::true_type /*window*/) noexcept
-    {
-        return at_end;
-    }
-
-    /// the end of the block is the end of the input, which ends the number
-    static constexpr bool number_may_continue(bool /*at_end*/, std::false_type /*window*/) noexcept
-    {
-        return false;
-    }
-
-    /// window adapter: read the character after a bulk-scanned number and unget
-    /// it, as scan_number() does. The adapter is a stream that is handed back to
-    /// the user, who must find the same input consumed either way.
-    void read_number_terminator(std::true_type /*window*/)
-    {
-        get();
-        unget();
-    }
-
-    /// the input is not handed back, so the terminator can stay unread
-    void read_number_terminator(std::false_type /*window*/) const noexcept {}
-
    /// contiguous input: try the number fast path, else the byte-path scanner
    token_type scan_number_dispatch(std::true_type /*bulk*/)
    {
@@ -1811,30 +1696,11 @@ scan_number_done:
    /// seekable adapter: remember where the current token starts so it can be
    /// reconstructed from the input on error; current has already been
    /// consumed, hence the -1
-    void note_token_start(std::true_type /*lazy*/)
-    {
-        note_token_start_lazy(std::integral_constant<bool, adapter_token> {});
-    }
-
-    void note_token_start_lazy(std::false_type /*adapter_token*/) noexcept
+    void note_token_start(std::true_type /*lazy*/) noexcept
    {
        token_string_start = ia.get_consumed_count() - 1;
    }

-    /// token-tracking adapter: start tracking the token at the first character
-    void begin_token(std::true_type /*adapter_token*/) noexcept
-    {
-        ia.begin_token();
-    }
-
-    void begin_token(std::false_type /*adapter_token*/) const noexcept {}
-
-    /// token-tracking adapter: the token starts with the current character
-    void note_token_start_lazy(std::true_type /*adapter_token*/)
-    {
-        ia.mark_token_start(current);
-    }
-
    /// streaming adapter: start copying the token eagerly, beginning with the
    /// already-read first character
    void note_token_start(std::false_type /*lazy*/) noexcept
@@ -2155,20 +2021,6 @@ scan_number_done:
  public:
    /// seekable adapter: rebuild the last read token from the input on demand
    const std::vector<char_type>& collect_token_chars(std::vector<char_type>& out, std::true_type /*lazy*/) const
-    {
-        return collect_token_chars_lazy(out, std::integral_constant<bool, adapter_token> {});
-    }
-
-    /// token-tracking adapter: the adapter hands out everything read since
-    /// mark_token_start(), except a pending unget (see below)
-    const std::vector<char_type>& collect_token_chars_lazy(std::vector<char_type>& out, std::true_type /*adapter_token*/) const
-    {
-        const bool pending_real_unget = next_unget && current != char_traits<char_type>::eof();
-        ia.copy_token(out, pending_real_unget);
-        return out;
-    }
-
-    const std::vector<char_type>& collect_token_chars_lazy(std::vector<char_type>& out, std::false_type /*adapter_token*/) const
    {
        // a pending unget of a real (non-EOF) character means that character
        // was consumed from the input but is not part of the token; EOF is
@@ -2290,8 +2142,9 @@ scan_number_done:
    Pretty-printed JSON indents every line with a run of spaces, which the loop
    in skip_whitespace() would otherwise read one character at a time. The
    spaces are skipped 8 bytes at a time; the last 7 bytes of the input and any
-    other whitespace are left to that loop. Skipping bypasses get();
-    bulk_consume() does its bookkeeping.
+    other whitespace are left to that loop. Skipping bypasses get(), which is
+    fine because bulk_scan implies lazy_position: the position is derived from
+    the adapter, not counted per character.
    */
    void skip_indentation(std::true_type /*bulk*/)
    {
@@ -2314,7 +2167,7 @@ scan_number_done:
                break;
            }
        }
-        bulk_consume(data, pos);
+        ia.bulk_skip(pos);
    }

    /// streaming input: no bulk fast path
@@ -532,7 +532,7 @@ class json_pointer
            {}
        };

-        std::vector<slot> table;
+        std::vector<slot> slots;
        std::size_t used = 0;

        static std::size_t hash_of(std::size_t parent, const string_t& token) noexcept
@@ -547,19 +547,19 @@ class json_pointer

        void grow()
        {
-            std::vector<slot> old(table.size() * 2);
-            old.swap(table);
-            const std::size_t mask = table.size() - 1;
+            std::vector<slot> old(slots.size() * 2);
+            old.swap(slots);
+            const std::size_t mask = slots.size() - 1;
            for (const auto& s : old)
            {
                if (s.token != nullptr)
                {
                    std::size_t i = s.hash & mask;
-                    while (table[i].token != nullptr)
+                    while (slots[i].token != nullptr)
                    {
                        i = (i + 1) & mask;
                    }
-                    table[i] = s;
+                    slots[i] = s;
                }
            }
        }
@@ -572,7 +572,7 @@ class json_pointer

        // start with the empty prefix only
        prefix_tree()
-            : table(16)
+            : slots(16)
            , parent(1, 0)
            , is_array(1, false)
        {}
@@ -582,20 +582,20 @@ class json_pointer
        std::size_t add_child(std::size_t id, const string_t& reference_token)
        {
            const std::size_t hash = hash_of(id, reference_token);
-            const std::size_t mask = table.size() - 1;
+            const std::size_t mask = slots.size() - 1;
            std::size_t i = hash & mask;
-            while (table[i].token != nullptr)
+            while (slots[i].token != nullptr)
            {
-                if (table[i].hash == hash && table[i].parent == id && *table[i].token == reference_token)
+                if (slots[i].hash == hash && slots[i].parent == id && *slots[i].token == reference_token)
                {
-                    return table[i].id;
+                    return slots[i].id;
                }
                i = (i + 1) & mask;
            }

            // new prefix
            const std::size_t child = parent.size();
-            table[i] = slot(hash, id, &reference_token, child);
+            slots[i] = slot(hash, id, &reference_token, child);
            if (reference_token == "0")
            {
                is_array[id] = true;
@@ -604,7 +604,7 @@ class json_pointer
            is_array.push_back(false);

            // keep the load factor below 1/2
-            if (++used * 2 > table.size())
+            if (++used * 2 > slots.size())
            {
                grow();
            }
@@ -21,7 +21,6 @@
 #undef JSON_NO_UNIQUE_ADDRESS
 #undef JSON_DISABLE_ENUM_SERIALIZATION
 #undef JSON_DISABLE_TUPLE_REFERENCE_CONVERSION
-#undef JSON_UNLOCKED_FILE_IO
 #undef JSON_DTOA_SSE2
 #undef JSON_DTOA_NEON

@@ -48,8 +47,6 @@
    #undef JSON_STRICT_BINARY_UTF8
    #undef JSON_DELETE_DEPRECATED_FUNCTIONS
    #undef JSON_USE_OBJECTS_FOR_ENUM_KEYED_MAPS
-    #undef JSON_DISABLE_STREAM_BULK_SCAN
-    #undef JSON_DISABLE_UNLOCKED_FILE_IO
 #endif

 #include <nlohmann/thirdparty/hedley/hedley_undef.hpp>
@@ -422,10 +422,8 @@ class builder
            arena_ensure(16);
            std::memcpy(m_arena_write, r, 16);
        }
-        else if (n != 0)
+        else
        {
-            // (an empty run leaves an empty arena unallocated, and memcpy()
-            // must not be passed its null pointer even for zero bytes)
            arena_ensure(n);
            std::memcpy(m_arena_write, r, n);
        }
@@ -684,7 +682,7 @@ obj_next:
            return fail(error_code::expected_object_end);

 close_object:
-            // a large object gets a hash index for its keys (objects only, so that closing
+            // a large object gets a hash index (objects only, so that closing
            // an array pays nothing for this)
            if (NLOHMANN_VIEW_UNLIKELY(cur_count >= document_data::index_min_members))
            {
@@ -846,7 +844,7 @@ indent_done:

        /// append a node: (kind, flags, extra, off) and the second word (len, or
        /// an integer's value); two stores on little-endian targets
-        NLOHMANN_VIEW_ALWAYS_INLINE node* push_node(value_t k, std::uint8_t flags, std::uint16_t extra, std::size_t off, std::uint64_t second)
+        NLOHMANN_VIEW_ALWAYS_INLINE node* emit(value_t k, std::uint8_t flags, std::uint16_t extra, std::size_t off, std::uint64_t second)
        {
            if (NLOHMANN_VIEW_UNLIKELY(out == cap))
            {
@@ -876,9 +874,9 @@ indent_done:

        NLOHMANN_VIEW_ALWAYS_INLINE void open(value_t k)
        {
-            // (base is read after push_node(), which moves the node array when it
+            // (base is read after emit(), which moves the node array when it
            // grows; in one expression the order of the two is unspecified)
-            const node* const n = push_node(k, 0, 0, static_cast<std::size_t>(p - b), 0);
+            const node* const n = emit(k, 0, 0, static_cast<std::size_t>(p - b), 0);
            const auto idx = static_cast<std::uint32_t>(n - base);
            if (depth != 0)
            {
@@ -938,7 +936,7 @@ indent_done:
            {
                return fail(error_code::invalid_literal);
            }
-            push_node(k, flags, 0, static_cast<std::size_t>(p - b), n);
+            emit(k, flags, 0, static_cast<std::size_t>(p - b), n);
            p += n;
            return true;
        }
@@ -1046,7 +1044,7 @@ indent_done:
                // of the negative std::int64_t)
                second = negative ? 0 - m : m;
            }
-            push_node(kind, 0, layout, static_cast<std::size_t>(s - b), second);
+            emit(kind, 0, layout, static_cast<std::size_t>(s - b), second);
            return true;
        }

@@ -1059,7 +1057,7 @@ indent_done:
            p = scan_string_run<Value>(p, e);
            if (NLOHMANN_VIEW_LIKELY(p != e && *p == '"'))
            {
-                push_node(value_t::string, 0, 0, static_cast<std::size_t>(s - b), static_cast<std::uint64_t>(p - s));
+                emit(value_t::string, 0, 0, static_cast<std::size_t>(s - b), static_cast<std::uint64_t>(p - s));
                ++p;
                return true;
            }
@@ -1069,7 +1067,7 @@ indent_done:
                return false;
            }
            p = r.p;
-            push_node(value_t::string, node_flags::escaped, 0, r.start, r.len);
+            emit(value_t::string, node_flags::escaped, 0, r.start, r.len);
            return true;
        }
    };
@@ -201,11 +201,6 @@ class json_side
    const BasicJsonType* m_json;
 };

-inline bool is_number(value_t t) noexcept
-{
-    return t == value_t::number_integer || t == value_t::number_unsigned || t == value_t::number_float;
-}
-
 /// whether two sides are equal; iterative, so that the nesting depth is
 /// limited by memory only
 template<typename BasicJsonType, typename A, typename B>
@@ -230,6 +225,8 @@ bool equal(const A& a0, const B& b0)
    {
        const value_t ta = a.type();
        const value_t tb = b.type();
+        const bool numbers = (ta == value_t::number_integer || ta == value_t::number_unsigned || ta == value_t::number_float)
+                             && (tb == value_t::number_integer || tb == value_t::number_unsigned || tb == value_t::number_float);
        if (ta == value_t::discarded || tb == value_t::discarded)
        {
            // basic_json decides (JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON)
@@ -240,13 +237,13 @@ bool equal(const A& a0, const B& b0)
        }
        else
        {
-            if (ta != tb && !(is_number(ta) && is_number(tb))) // numbers of different types can be equal
+            if (!numbers && ta != tb)
            {
                return false;
            }
            if (ta == value_t::string)
            {
-                if (a.string() != b.string())
+                if (!(a.string() == b.string()))
                {
                    return false;
                }
@@ -275,7 +272,7 @@ bool equal(const A& a0, const B& b0)
                }
                stack.push_back(std::move(f));
            }
-            else if (a.scalar() != b.scalar()) // numbers (also of different types), null, boolean
+            else if (!(a.scalar() == b.scalar())) // numbers (also of different types), null, boolean
            {
                return false;
            }
@@ -292,7 +289,7 @@ bool equal(const A& a0, const B& b0)
            const std::size_t count = f.object ? f.members_a.size() : f.elements_a.size();
            if (f.next == count)
            {
-                stack.pop_back(); // (f dangles now, and is bound again after continue)
+                stack.pop_back();
                continue;
            }
            if (f.object)
@@ -11,7 +11,7 @@
 #include <array> // array
 #include <cstddef> // size_t
 #include <cstdint> // uint8_t, uint32_t
-#include <cstring> // memcmp, memcpy
+#include <cstring> // memcpy
 #include <limits> // numeric_limits
 #include <map> // map
 #include <memory> // unique_ptr
@@ -46,7 +46,7 @@ struct document_data
    std::string owned; ///< owned copy of the input, if any (a std::string, so that its NUL serves as the parser's sentinel)
    std::vector<std::uint8_t> owned_image; ///< a loaded image the document owns (the text and the decoded strings point into it)

-    // hash indexes of the keys of large objects (see object_index.hpp)
+    // hash indexes of large objects (see object_index.hpp)
    static constexpr std::uint32_t index_min_members = 128;
    struct object_index
    {
@@ -56,16 +56,14 @@ struct document_data
    std::vector<object_index> indexes;
    std::vector<std::uint32_t> index_slots;
    std::vector<std::uint32_t> large_objects; ///< positions of the objects to index (noted while parsing)
-    std::array<const char*, 4> base = {{nullptr, nullptr, nullptr, nullptr}}; ///< string bases: source, arena, edit arena, unused (indexed by flags & node_flags::storage)
+    std::array<const char*, 4> base = {{nullptr, nullptr, nullptr, nullptr}}; ///< string bases: source, arena, edit arena (indexed by flags & node_flags::storage)
    bool discarded = true;

    /// The storage of edits (editable documents only; see edit_storage.hpp).
-    /// No edit moves or resizes the parsed index, and the nodes of values
-    /// written by edits never move either, so a view stays valid whenever it
-    /// was taken, before the first edit or between later ones: an array/object
-    /// whose elements change gets node_flags::moved, and its elements then live
-    /// in a separate sequence (a header node, then the entries), whose entries
-    /// link to the values.
+    /// Edits never move or resize the parsed index, so views stay valid: an
+    /// array/object whose elements change gets node_flags::moved, and its
+    /// elements then live in a separate sequence (a header node, then the
+    /// entries), whose entries link to the values.
    struct edit_state
    {
        std::vector<node*> moved{};                    ///< element sequences of moved arrays/objects (header node first) // NOLINT(readability-redundant-member-init)
@@ -185,12 +183,6 @@ struct document_data
        return base[n.flags & node_flags::storage] + n.off;
    }

-    /// whether the string of node k (a key) is the n bytes at key
-    bool key_equals(const node& k, const char* key, std::size_t n) const noexcept
-    {
-        return k.len == n && (n == 0 || std::memcmp(str(k), key, n) == 0);
-    }
-
    /// the node after n's subtree (containers span `next` nodes, scalars one)
    static NLOHMANN_VIEW_ALWAYS_INLINE const node* after(const node* n) noexcept
    {
@@ -12,7 +12,7 @@
 #include <cmath> // isinf, isnan
 #include <cstddef> // size_t
 #include <cstdint> // int64_t, uint8_t, uint32_t, uint64_t
-#include <cstring> // memmove
+#include <cstring> // memcmp, memmove
 #include <limits> // numeric_limits
 #include <string> // string, to_string
 #include <type_traits> // decay, enable_if, integral_constant, is_arithmetic, is_convertible, is_floating_point, is_same, is_signed
@@ -313,7 +313,7 @@ class editor

    bool key_equals(const node& k, string_view_t key) const noexcept
    {
-        return m_doc.key_equals(k, key.data(), key.size());
+        return k.len == key.size() && (key.size() == 0 || std::memcmp(m_doc.str(k), key.data(), key.size()) == 0);
    }

    /// remove the members with this key (all, or all but the first) from an object
@@ -50,19 +50,7 @@ inline node* alloc_nodes(document_data& d, std::size_t k)
    document_data::edit_state& e = edit_state_of(d);
    if (NLOHMANN_VIEW_UNLIKELY(static_cast<std::size_t>(e.chunk_end - e.chunk_cur) < k))
    {
-        if (k >= e.chunk_next / 2)
-        {
-            // a large request (half of the next chunk or more) gets a chunk of
-            // its own, so that the rest of the current chunk stays available
-            // for smaller ones
-            std::unique_ptr<node[]> own(new node[k]()); // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
-            e.chunks.push_back(std::move(own));
-            e.bytes += k * sizeof(node);
-            return e.chunks.back().get();
-        }
-        // a smaller request leaves the rest of the current chunk unused
-        // (fewer than k nodes, and k is less than half of the new chunk)
-        const std::size_t count = e.chunk_next;
+        const std::size_t count = (std::max)(k, e.chunk_next);
        std::unique_ptr<node[]> fresh(new node[count]()); // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
        e.chunks.push_back(std::move(fresh));
        e.chunk_cur = e.chunks.back().get();
@@ -93,8 +81,7 @@ inline std::size_t text_capacity(std::size_t cap, std::size_t used, std::size_t
 }

 /// copy n bytes into the edit arena and return their offset; a new buffer
-/// leaves the old one alive, so that string views into it remain valid; n is
-/// 0 for an empty string (written by an edit, or the key of a new member)
+/// leaves the old one alive, so that string views into it remain valid
 inline std::uint32_t append_text(document_data& d, const char* s, std::size_t n)
 {
    document_data::edit_state& e = edit_state_of(d);
@@ -102,7 +89,7 @@ inline std::uint32_t append_text(document_data& d, const char* s, std::size_t n)
    {
        const std::size_t cap = text_capacity(e.text_cap, e.text_used, n);
        std::unique_ptr<char[]> fresh(new char[cap]); // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
-        if (NLOHMANN_VIEW_LIKELY(e.text_used != 0)) // (0 only for the first buffer, and then texts is empty)
+        if (e.text_used != 0)
        {
            std::memcpy(fresh.get(), e.texts.back().get(), e.text_used);
        }
@@ -140,10 +127,8 @@ inline void reserve_moved(document_data& d)
    if (e.moved.size() == e.moved.capacity() || e.moved_cap.size() == e.moved_cap.capacity())
    {
        // both grow before either changes, so that the push_backs cannot throw
-        // (both conditions are needed: reserve() may allocate more than asked,
-        // so the two capacities can differ)
-        e.moved.reserve((e.moved.size() * 2) + 16);
-        e.moved_cap.reserve((e.moved.size() * 2) + 16);
+        e.moved.reserve((2 * e.moved.size()) + 16);
+        e.moved_cap.reserve((2 * e.moved.size()) + 16);
    }
 }

@@ -8,11 +8,11 @@

 #pragma once

-#include <algorithm> // min, sort
+#include <algorithm> // sort
 #include <array> // array
-#include <cstddef> // offsetof, size_t
+#include <cstddef> // size_t
 #include <cstdint> // int64_t, uint8_t, uint16_t, uint32_t, uint64_t
-#include <cstring> // memcmp, memcpy, memset
+#include <cstring> // memcmp, memcpy
 #include <limits> // numeric_limits
 #include <string> // string
 #include <vector> // vector
@@ -105,7 +105,7 @@ inline void compact_nodes(const document_data& d, std::size_t arena_size, std::v
        }
        return r;
    };
-    const auto copy_node = [&](const node * v)
+    const auto emit = [&](const node * v)
    {
        node r = *v;
        switch (static_cast<value_t>(v->kind))
@@ -159,10 +159,10 @@ inline void compact_nodes(const document_data& d, std::size_t arena_size, std::v
        }
        out.push_back(r);
    };
-    copy_node(d.nodes);
+    emit(d.nodes);
    while (!stack.empty())
    {
-        const frame top = stack.back();
+        frame& top = stack.back();
        if (top.cur == top.end)
        {
            node& c = out[top.index];
@@ -171,14 +171,20 @@ inline void compact_nodes(const document_data& d, std::size_t arena_size, std::v
            stack.pop_back();
            continue;
        }
+        ++top.count;
+        const node* v = nullptr;
        if (top.object)
        {
            out.push_back(string_node(*top.cur));
+            v = document_data::deref(top.cur + 1);
+            top.cur = document_data::after(top.cur + 1);
        }
-        const node* const value = top.cur + (top.object ? 1 : 0);
-        stack.back().cur = document_data::after(value);
-        ++stack.back().count;
-        copy_node(document_data::deref(value)); // may grow the stack
+        else
+        {
+            v = document_data::deref(top.cur);
+            top.cur = document_data::after(top.cur);
+        }
+        emit(v); // may grow the stack (top is not used afterwards)
    }
 }

@@ -189,15 +195,17 @@ inline std::vector<std::uint8_t> save_image(const document_data& d)
    throw_type_error(320, "json_document images need a little-endian target"); // LCOV_EXCL_LINE
 #endif
    const std::size_t arena_size = d.arena_size;
+    const node* nodes = d.nodes;
+    std::size_t count = d.node_count;
    std::vector<node> compacted;
    std::string text_tail;
    std::string arena_tail;
    if (d.edits)
    {
        compact_nodes(d, arena_size, compacted, text_tail, arena_tail);
+        nodes = compacted.data();
+        count = compacted.size();
    }
-    const node* const nodes = d.edits ? compacted.data() : d.nodes;
-    const std::size_t count = d.edits ? compacted.size() : d.node_count;
    const std::size_t text_size = d.size + text_tail.size();
    const std::size_t total_arena = arena_size + arena_tail.size();
    if (NLOHMANN_VIEW_UNLIKELY(text_size >= image_limit || total_arena >= image_limit || count >= image_limit))
@@ -217,13 +225,14 @@ inline std::vector<std::uint8_t> save_image(const document_data& d)
    std::memcpy(o, &h, sizeof(h));
    o += sizeof(h);
    std::memcpy(o, nodes, count * sizeof(node));
-    // the hash indexes are rebuilt by load(), whose check rejects any other
-    // extra of an object, and the same document saves to the same bytes
+    // the hash indexes are rebuilt by load()
    for (std::size_t i = 0; i < count; ++i)
    {
        if (nodes[i].kind == static_cast<std::uint8_t>(value_t::object) && nodes[i].extra != 0)
        {
-            std::memset(o + (i * sizeof(node)) + offsetof(node, extra), 0, sizeof(nodes[i].extra));
+            node n = nodes[i];
+            n.extra = 0;
+            std::memcpy(o + (i * sizeof(node)), &n, sizeof(node));
        }
    }
    o += count * sizeof(node);
@@ -262,22 +271,21 @@ inline bool scan_number_token(const unsigned char* s, std::size_t len, number_to
    const unsigned char* p = s;
    t.negative = p != e && *p == '-';
    p += t.negative ? 1 : 0;
+    t.int_start = p;
    if (p == e)
    {
        return false;
    }
-    t.int_start = p;
    if (*p == '0')
    {
        ++p;
    }
    else if (*p >= '1' && *p <= '9')
    {
-        do
+        while (p != e && is_digit(*p))
        {
            ++p;
        }
-        while (p != e && is_digit(*p));
    }
    else
    {
@@ -310,12 +318,11 @@ inline bool scan_number_token(const unsigned char* s, std::size_t len, number_to
        {
            return false;
        }
-        do
+        while (p != e && is_digit(*p))
        {
            t.exponent = t.exponent < 100000 ? (t.exponent * 10) + (*p - '0') : t.exponent;
            ++p;
        }
-        while (p != e && is_digit(*p));
        t.exponent = exp_negative ? -t.exponent : t.exponent;
        t.is_float = true;
    }
@@ -326,7 +333,7 @@ inline bool scan_number_token(const unsigned char* s, std::size_t len, number_to
 /// writes "many" instead; the caller accepts both)
 inline std::uint16_t float_layout(const number_token& t)
 {
-    return static_cast<std::uint16_t>((std::min)(t.int_digits, std::size_t{255}) | ((std::min)(t.frac_digits, std::size_t{255}) << 8u));
+    return static_cast<std::uint16_t>((t.int_digits < 255 ? t.int_digits : 255) | ((t.frac_digits < 255 ? t.frac_digits : 255) << 8u));
 }

 /// whether a float token (well-formed, per scan_number_token) is finite as
@@ -728,10 +735,14 @@ inline void load_image(document_data& d, const std::uint8_t* image, std::size_t
    // the hash indexes of large objects, as after parsing
    for (std::size_t i = 0; i < count; ++i)
    {
-        const node& n = d.nodes[i];
-        if (n.kind == static_cast<std::uint8_t>(value_t::object) && n.len >= document_data::index_min_members)
+        node& n = d.nodes[i];
+        if (n.kind == static_cast<std::uint8_t>(value_t::object))
        {
-            d.large_objects.push_back(static_cast<std::uint32_t>(i));
+            n.extra = 0;
+            if (n.len >= document_data::index_min_members)
+            {
+                d.large_objects.push_back(static_cast<std::uint32_t>(i));
+            }
        }
    }
    build_object_indexes(d);
@@ -112,7 +112,7 @@ const node* find_member(const document_data& d, const node* object, const char*
    }
    for (const node* m = nav::first(d, object); m != end; m = document_data::after(m + 1))
    {
-        if (d.key_equals(*m, key, n))
+        if (m->len == n && std::memcmp(d.str(*m), key, n) == 0)
        {
            return m;
        }
@@ -120,23 +120,6 @@ const node* find_member(const document_data& d, const node* object, const char*
    return nullptr;
 }

-/// the number of members of an object with this key (duplicates included)
-template<bool Editable>
-std::size_t count_members(const document_data& d, const node* object, const char* key, std::size_t n) noexcept
-{
-    using nav = navigation<Editable>;
-    std::size_t result = 0;
-    const node* const end = nav::end(d, object);
-    for (const node* m = nav::first(d, object); m != end; m = document_data::after(m + 1))
-    {
-        if (d.key_equals(*m, key, n))
-        {
-            ++result;
-        }
-    }
-    return result;
-}
-
 /// whether an integer type is accepted as an array index by the view's
 /// operator[] and at(): every integer type but bool and size_t, which has its
 /// own overload
@@ -70,11 +70,5 @@
    #define NLOHMANN_VIEW_LITTLE_ENDIAN 0
 #endif

-/// eight checks at fixed offsets 0..7
-#define NLOHMANN_VIEW_REPEAT_FIRST_8(X) X(0) X(1) X(2) X(3) X(4) X(5) X(6) X(7)
-
-/// eight checks at fixed offsets 8..15
-#define NLOHMANN_VIEW_REPEAT_SECOND_8(X) X(8) X(9) X(10) X(11) X(12) X(13) X(14) X(15)
-
 /// sixteen checks at fixed offsets 0..15
-#define NLOHMANN_VIEW_REPEAT16(X) NLOHMANN_VIEW_REPEAT_FIRST_8(X) NLOHMANN_VIEW_REPEAT_SECOND_8(X)
+#define NLOHMANN_VIEW_REPEAT16(X) X(0) X(1) X(2) X(3) X(4) X(5) X(6) X(7) X(8) X(9) X(10) X(11) X(12) X(13) X(14) X(15)
@@ -19,8 +19,6 @@
 #undef NLOHMANN_VIEW_THROW
 #undef NLOHMANN_VIEW_LITTLE_ENDIAN
 #undef NLOHMANN_VIEW_REPEAT16
-#undef NLOHMANN_VIEW_REPEAT_SECOND_8
-#undef NLOHMANN_VIEW_REPEAT_FIRST_8
 #undef NLOHMANN_VIEW_NEON
 #undef NLOHMANN_VIEW_SSE2
 #undef NLOHMANN_VIEW_SSSE3
@@ -34,7 +34,7 @@ struct node_flags
 {
    static constexpr std::uint8_t escaped = 1; ///< string payload lives in the decode arena, not the source
    static constexpr std::uint8_t edited = 2;  ///< string or number token lives in the edit arena (editable documents)
-    static constexpr std::uint8_t storage = escaped | edited; ///< mask: where a string or number token lives (index into document_data::base)
+    static constexpr std::uint8_t storage = 3; ///< mask: where a string or number token lives (index into document_data::base)
    static constexpr std::uint8_t is_true = 4; ///< boolean value
    static constexpr std::uint8_t moved = 8;   ///< array/object: the elements live in a separate sequence (editable documents)
    static constexpr std::uint8_t is_new = 16; ///< written by an edit: no source position
@@ -53,7 +53,7 @@ struct node
 {
    std::uint8_t kind;   ///< value_t, or kind_link
    std::uint8_t flags;  ///< node_flags
-    std::uint16_t extra; ///< numbers: integer digits (low byte) and fraction digits (high byte), 255 = "many"; objects: number of the object's key hash index (1-based, 0 = none); otherwise 0
+    std::uint16_t extra; ///< numbers: integer digits (low byte) and fraction digits (high byte), 255 = "many"; objects: number of the hash index (1-based, 0 = none); otherwise 0
    std::uint32_t off;   ///< source offset (string content, number token, literal, bracket); arena offset if escaped/edited; number of the element sequence if moved
    std::uint32_t len;   ///< string: decoded bytes; float: token bytes; array/object: element count
    std::uint32_t next;  ///< array/object: number of nodes of the subtree (its extent in the enclosing sequence)
@@ -45,11 +45,10 @@ inline bool float_token_layout(const char* first, const char* last, std::size_t&
    {
        return false;
    }
-    do
+    while (digit(p))
    {
        ++p;
    }
-    while (digit(p));
    dot = std::string::npos;
    if (p != last && *p == '.')
    {
@@ -58,11 +57,10 @@ inline bool float_token_layout(const char* first, const char* last, std::size_t&
        {
            return false;
        }
-        do
+        while (digit(p))
        {
            ++p;
        }
-        while (digit(p));
    }
    mantissa_end = static_cast<std::size_t>(p - first);
    if (p != last && (*p == 'e' || *p == 'E'))
@@ -73,11 +71,10 @@ inline bool float_token_layout(const char* first, const char* last, std::size_t&
        {
            return false;
        }
-        do
+        while (digit(p))
        {
            ++p;
        }
-        while (digit(p));
    }
    return p == last;
 }
@@ -10,13 +10,14 @@

 #include <cstddef> // size_t
 #include <cstdint> // uint32_t, uint64_t
+#include <cstring> // memcmp

 #include <nlohmann/json.hpp>
 #include <nlohmann/detail/view/document_data.hpp>
 #include <nlohmann/detail/view/macro_scope.hpp>
 #include <nlohmann/detail/view/node.hpp>

-// Hash indexes of the keys of large objects, so that a lookup does not compare thousands
+// Hash indexes of large objects, so that a lookup does not compare thousands
 // of keys (as Boost.JSON switches from a linear search to a hash table for
 // large objects). An object with document_data::index_min_members members or
 // more gets an open-addressing table after parsing; its node stores the
@@ -41,12 +42,6 @@ namespace view
 /// members; and every member costs at most this many steps while building)
 constexpr std::size_t index_max_displacement = 64;

-// a table has at least 2 * len slots (len >= index_min_members), so the probe
-// window of index_max_displacement + 1 slots stays far smaller than the table
-// and a probe never wraps around onto its own start
-static_assert(document_data::index_min_members >= 2 * index_max_displacement,
-              "a table must be much larger than the probe window of a lookup");
-
 /// hash of a key: its bytes, eight at a time, in a fixed byte order
 inline std::uint64_t key_hash(const char* s, std::size_t n) noexcept
 {
@@ -82,36 +77,45 @@ inline void build_object_index(document_data& d, node* obj)
    }
    const std::size_t start = d.index_slots.size();
    d.index_slots.resize(start + cap, 0);
-    std::uint32_t* const table = d.index_slots.data() + start;
+    std::uint32_t* const slots = d.index_slots.data() + start;
    const std::size_t mask = cap - 1;
+    bool degenerate = false;
    for (const node* k = document_data::first_child(obj), *end = document_data::child_end(obj); k != end; k = document_data::after(k + 1))
    {
        const char* const key = d.str(*k);
-        std::size_t slot = conditional_static_cast<std::size_t>(key_hash(key, k->len)) & mask;
+        const std::uint64_t hash = key_hash(key, k->len); // (a cast of the call would be useless where std::uint64_t is std::size_t)
+        std::size_t i = static_cast<std::size_t>(hash) & mask;
        bool duplicate = false;
        std::size_t distance = 0;
-        while (table[slot] != 0)
+        while (slots[i] != 0)
        {
-            const node* const other = obj + table[slot];
-            if (d.key_equals(*other, key, k->len))
+            const node* const other = obj + slots[i];
+            if (other->len == k->len && (k->len == 0 || std::memcmp(d.str(*other), key, k->len) == 0))
            {
                duplicate = true; // keep the first
                break;
            }
-            if (distance == index_max_displacement)
+            if (++distance > index_max_displacement)
            {
-                // too many keys share a home region
-                d.index_slots.resize(start); // no table: the object is searched linearly
-                return;
+                degenerate = true; // too many keys share a home region
+                break;
            }
-            ++distance;
-            slot = (slot + 1) & mask;
+            i = (i + 1) & mask;
+        }
+        if (degenerate)
+        {
+            break;
        }
        if (!duplicate)
        {
-            table[slot] = static_cast<std::uint32_t>(k - obj);
+            slots[i] = static_cast<std::uint32_t>(k - obj);
        }
    }
+    if (degenerate)
+    {
+        d.index_slots.resize(start); // no table: the object is searched linearly
+        return;
+    }
    d.indexes.push_back(document_data::object_index{start, static_cast<std::uint32_t>(mask)});
    obj->extra = static_cast<std::uint16_t>(d.indexes.size());
 }
@@ -130,21 +134,22 @@ inline void build_object_indexes(document_data& d)
 inline const node* find_indexed(const document_data& d, const node* obj, const char* key, std::size_t n) noexcept
 {
    const document_data::object_index& ix = d.indexes[obj->extra - 1u];
-    const std::uint32_t* const table = d.index_slots.data() + ix.start;
-    std::size_t slot = conditional_static_cast<std::size_t>(key_hash(key, n)) & ix.mask;
+    const std::uint32_t* const slots = d.index_slots.data() + ix.start;
+    const std::uint64_t hash = key_hash(key, n); // (a cast of the call would be useless where std::uint64_t is std::size_t)
+    std::size_t i = static_cast<std::size_t>(hash) & ix.mask;
    for (std::size_t distance = 0; distance <= index_max_displacement; ++distance)
    {
-        const std::uint32_t s = table[slot];
+        const std::uint32_t s = slots[i];
        if (s == 0)
        {
            return nullptr;
        }
        const node* const k = obj + s;
-        if (d.key_equals(*k, key, n))
+        if (k->len == n && (n == 0 || std::memcmp(d.str(*k), key, n) == 0))
        {
            return k;
        }
-        slot = (slot + 1) & ix.mask;
+        i = (i + 1) & ix.mask;
    }
    return nullptr; // (no key sits further from its home slot)
 }
@@ -47,24 +47,24 @@ enum class index_status
 template<typename StringType>
 index_status array_index(const StringType& s, std::size_t& idx) noexcept
 {
-    // as basic_json: the empty token and "-" (past the last element) are
-    // unresolved rather than not a number
-    if (s.empty() || (s.size() == 1 && s[0] == '-'))
-    {
-        return index_status::unresolved;
-    }
-    if (s[0] < '0' || s[0] > '9')
-    {
-        return index_status::not_number;
-    }
    if (s.size() > 1 && s[0] == '0')
    {
        return index_status::leading_zero;
    }
-    std::uint64_t v = 0;
-    for (const auto c : s)
+    // as basic_json: also a single character, but "-" and the empty token are
+    // left to the conversion below and reported as unresolved
+    if (!s.empty() && !(s.size() == 1 && s[0] == '-') && !(s[0] >= '0' && s[0] <= '9'))
    {
-        const auto d = static_cast<unsigned>(static_cast<unsigned char>(c)) - '0';
+        return index_status::not_number;
+    }
+    if (s.empty())
+    {
+        return index_status::unresolved;
+    }
+    std::uint64_t v = 0;
+    for (std::size_t i = 0; i < s.size(); ++i)
+    {
+        const auto d = static_cast<unsigned>(static_cast<unsigned char>(s[i])) - '0';
        if (d > 9 || v > ((std::numeric_limits<std::uint64_t>::max)() - d) / 10)
        {
            return index_status::unresolved; // not a number, or beyond unsigned long long
@@ -83,12 +83,14 @@ NLOHMANN_VIEW_ALWAYS_INLINE const unsigned char* scan_string_run(const unsigned
        if (e - p >= 16)
        {
 #define NLOHMANN_VIEW_STEP(i) if (NLOHMANN_VIEW_LIKELY(plain[p[i]] != 0)) {} else { p += (i); goto stop; }
-            NLOHMANN_VIEW_REPEAT_FIRST_8(NLOHMANN_VIEW_STEP)
+            NLOHMANN_VIEW_STEP(0) NLOHMANN_VIEW_STEP(1) NLOHMANN_VIEW_STEP(2) NLOHMANN_VIEW_STEP(3)
+            NLOHMANN_VIEW_STEP(4) NLOHMANN_VIEW_STEP(5) NLOHMANN_VIEW_STEP(6) NLOHMANN_VIEW_STEP(7)
 #if NLOHMANN_VIEW_VECTOR
            if (!Value) // (a plain `!Value || !NLOHMANN_VIEW_VECTOR` is a constant condition for MSVC, C4127)
 #endif
            {
-                NLOHMANN_VIEW_REPEAT_SECOND_8(NLOHMANN_VIEW_STEP)
+                NLOHMANN_VIEW_STEP(8) NLOHMANN_VIEW_STEP(9) NLOHMANN_VIEW_STEP(10) NLOHMANN_VIEW_STEP(11)
+                NLOHMANN_VIEW_STEP(12) NLOHMANN_VIEW_STEP(13) NLOHMANN_VIEW_STEP(14) NLOHMANN_VIEW_STEP(15)
                p += 8;
            }
 #undef NLOHMANN_VIEW_STEP
@@ -175,7 +177,32 @@ NLOHMANN_VIEW_ALWAYS_INLINE const unsigned char* skip_digits(const unsigned char
 /// powers of ten up to 10^19 as integers
 inline std::uint64_t int_pow10(unsigned k) noexcept
 {
-    return ::nlohmann::detail::dtoa_impl::powers_of_ten()[k];
+    static const std::array<std::uint64_t, 20> table =
+    {
+        {
+            1u,
+            10u,
+            100u,
+            1000u,
+            10000u,
+            100000u,
+            1000000u,
+            10000000u,
+            100000000u,
+            1000000000u,
+            10000000000u,
+            100000000000u,
+            1000000000000u,
+            10000000000000u,
+            100000000000000u,
+            1000000000000000u,
+            10000000000000000u,
+            100000000000000000u,
+            1000000000000000000u,
+            10000000000000000000u
+        }
+    };
+    return table[k];
 }

 /// value of 0 < k < 8 digits at p in one step if [p, p + 8) lies below
@@ -73,13 +73,6 @@ class output_buffer
        m_pos += n;
    }

-    /// a string literal, without its terminating NUL
-    template<std::size_t N>
-    NLOHMANN_VIEW_ALWAYS_INLINE void put(const char (&s)[N]) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
-    {
-        put(s, N - 1);
-    }
-
    void put_repeated(char c, std::size_t n)
    {
        reserve(n);
@@ -109,7 +102,7 @@ class output_buffer
    /// which a static constexpr member does not have before C++17)
    static constexpr std::size_t step() noexcept
    {
-        return 0x10000;
+        return 65536;
    }

    static StringType& sized(StringType& out, std::size_t estimate)
@@ -174,17 +167,14 @@ inline std::size_t plain_output_run(const unsigned char* s, std::size_t n) noexc
 /// A stack that starts in a buffer of the caller (a local array) and moves to
 /// the heap (a vector of the caller) only when that is full, so that dumps of
 /// shallow documents need no allocation. The top is a pointer, as in
-/// std::vector. grow() is static and out of line: it gets the vector and the
-/// used range and returns the new storage, so the address of the stack never
-/// reaches a call. Otherwise the compiler would have to keep the three
-/// pointers in memory and load and store them on every push_back() and
-/// pop_back(), not just when growing.
+/// std::vector. The address of the stack never escapes (the growth gets the
+/// vector and returns the new storage), so its pointers stay in registers.
 template<typename T>
 class small_stack
 {
  public:
    small_stack(T* buffer, std::size_t capacity, std::vector<T>& heap) noexcept
-        : m_begin(buffer), m_top(buffer), m_end(buffer + capacity), m_heap(heap)
+        : m_begin(buffer), m_top(buffer), m_end(buffer + capacity), m_heap(&heap)
    {}
    small_stack(const small_stack&) = delete;
    small_stack(small_stack&&) = delete;
@@ -198,7 +188,7 @@ class small_stack
        {
            const std::size_t used = size();
            const std::size_t capacity = 2 * static_cast<std::size_t>(m_end - m_begin);
-            m_begin = grow(m_heap, m_begin, used, capacity);
+            m_begin = grow(*m_heap, m_begin, used, capacity);
            m_top = m_begin + used;
            m_end = m_begin + capacity;
        }
@@ -238,18 +228,9 @@ class small_stack
    T* m_begin;
    T* m_top;
    T* m_end;
-    std::vector<T>& m_heap;
+    std::vector<T>* m_heap;
 };

-/// a string literal at w, without its terminating NUL (after room())
-/// @return a pointer past it
-template<std::size_t N>
-NLOHMANN_VIEW_ALWAYS_INLINE char* put_literal(char* w, const char (&s)[N]) noexcept // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
-{
-    std::memcpy(w, s, N - 1);
-    return w + N - 1;
-}
-
 /// how the view's dump() writes a value
 struct dump_style
 {
@@ -338,15 +319,15 @@ class view_serializer
                    m_out.finish();
                    return;
                }
-                if (stack.back().pos == stack.back().end)
+                frame& f = stack.back();
+                if (f.pos == f.end)
                {
-                    const bool object = stack.back().object;
+                    const bool object = f.object;
                    stack.pop_back();
                    newline(stack.size());
                    m_out.put(object ? '}' : ']');
                    continue;
                }
-                frame& f = stack.back();
                if (!f.first)
                {
                    m_out.put(',');
@@ -358,7 +339,7 @@ class view_serializer
                    write_string(*f.pos);
                    if (m_style.pretty)
                    {
-                        m_out.put(": ");
+                        m_out.put(": ", 2);
                    }
                    else
                    {
@@ -473,6 +454,12 @@ class view_serializer
            }
            w += n;
        };
+        // a literal of n bytes (after room(n))
+        const auto literal = [&](const char* text, std::size_t n)
+        {
+            std::memcpy(w, text, n);
+            w += n;
+        };
        // a string that is not a plain string of the source (out of line, so
        // that the cursor stays in a register here)
        const auto escaped = [&](const node & n)
@@ -558,11 +545,11 @@ class view_serializer
                    room(8);
                    if ((n->flags & node_flags::is_true) != 0)
                    {
-                        w = put_literal(w, "true");
+                        literal("true", 4);
                    }
                    else
                    {
-                        w = put_literal(w, "false");
+                        literal("false", 5);
                    }
                    break;
                case value_t::object:
@@ -572,7 +559,7 @@ class view_serializer
                    room(8);
                    if (n->len == 0)
                    {
-                        w = object ? put_literal(w, "{}") : put_literal(w, "[]");
+                        literal(object ? "{}" : "[]", 2);
                    }
                    else
                    {
@@ -592,7 +579,7 @@ class view_serializer
                }
                case value_t::null:
                    room(8);
-                    w = put_literal(w, "null");
+                    literal("null", 4);
                    break;
                case value_t::binary:    // LCOV_EXCL_LINE (not in a document)
                case value_t::discarded: // LCOV_EXCL_LINE
@@ -679,16 +666,16 @@ class view_serializer
        switch (static_cast<value_t>(n.kind))
        {
            case value_t::null:
-                m_out.put("null");
+                m_out.put("null", 4);
                break;
            case value_t::boolean:
                if ((n.flags & node_flags::is_true) != 0)
                {
-                    m_out.put("true");
+                    m_out.put("true", 4);
                }
                else
                {
-                    m_out.put("false");
+                    m_out.put("false", 5);
                }
                break;
            case value_t::string:
@@ -772,7 +759,7 @@ class view_serializer
                // check also keeps an image that was only checked for bounds,
                // whose token may not be made of digits, from the counted
                // overload)
-                const auto& powers = ::nlohmann::detail::dtoa_impl::powers_of_ten();
+                const auto& powers = ::nlohmann::detail::dtoa_impl::powers_of_ten_16();
                const unsigned count = int_digits + frac_digits;
                return count - 1u < 15u && d.w >= powers[count - 1u] && d.w < powers[count]
                       ? ::nlohmann::detail::dtoa_impl::write_short_decimal(w, d.w, static_cast<int>(count), static_cast<int>(d.exponent))
@@ -815,14 +802,12 @@ class view_serializer
    {
        if (!std::isfinite(x))
        {
-            m_out.put("null");
+            m_out.put("null", 4);
            return;
        }
-        static constexpr bool is_ieee_single_or_double
-            = std::numeric_limits<number_float_t>::is_iec559
-              && ((std::numeric_limits<number_float_t>::digits == 24 && std::numeric_limits<number_float_t>::max_exponent == 128)
-                  || (std::numeric_limits<number_float_t>::digits == 53 && std::numeric_limits<number_float_t>::max_exponent == 1024));
-        write_float(x, std::integral_constant<bool, is_ieee_single_or_double>());
+        write_float(x, std::integral_constant < bool,
+                    (std::numeric_limits<number_float_t>::is_iec559 && std::numeric_limits<number_float_t>::digits == 24 && std::numeric_limits<number_float_t>::max_exponent == 128)
+                    || (std::numeric_limits<number_float_t>::is_iec559 && std::numeric_limits<number_float_t>::digits == 53 && std::numeric_limits<number_float_t>::max_exponent == 1024) > {});
    }

    void write_float(number_float_t x, std::true_type /*is_ieee_single_or_double*/)
@@ -917,25 +902,25 @@ class view_serializer
        switch (codepoint)
        {
            case 0x08:
-                m_out.put("\\b");
+                m_out.put("\\b", 2);
                return;
            case 0x09:
-                m_out.put("\\t");
+                m_out.put("\\t", 2);
                return;
            case 0x0A:
-                m_out.put("\\n");
+                m_out.put("\\n", 2);
                return;
            case 0x0C:
-                m_out.put("\\f");
+                m_out.put("\\f", 2);
                return;
            case 0x0D:
-                m_out.put("\\r");
+                m_out.put("\\r", 2);
                return;
            case 0x22:
-                m_out.put("\\\"");
+                m_out.put("\\\"", 2);
                return;
            case 0x5C:
-                m_out.put("\\\\");
+                m_out.put("\\\\", 2);
                return;
            default:
                break;
@@ -8,11 +8,10 @@

 #pragma once

-#include <cstddef> // nullptr_t, size_t
 #include <cstdint> // int64_t
 #include <map> // map
 #include <string> // basic_string
-#include <type_traits> // decay, enable_if, is_arithmetic, is_constructible, is_integral, is_same
+#include <type_traits> // enable_if, is_constructible
 #include <unordered_map> // unordered_map
 #include <vector> // vector

@@ -104,41 +103,6 @@ Map map_value(const View& v)
 template<typename Key>
 struct is_string_key : std::is_constructible<Key, const char*, std::size_t> {};

-/// the arithmetic types arithmetic_value() converts to (bool has its own
-/// conversion)
-template<typename T>
-struct is_non_bool_arithmetic : conjunction<std::is_arithmetic<T>, negation<std::is_same<T, bool>>> {};
-
-/// the default values of value() other than C strings, which have their own
-/// overload (returning string_t)
-template<typename T>
-struct is_non_c_string_default : negation<std::is_same<typename std::decay<T>::type, const char*>> {};
-
-/// the integral types accepted as an array index by the edits of a document
-template<typename T>
-struct is_non_bool_integral : conjunction<std::is_integral<T>, negation<std::is_same<T, bool>>> {};
-
-/// whether View::get<T>() converts to T without materialize(); get_to()
-/// assigns these, and passes the others to from_json
-template<typename T, typename BasicJsonType, typename View>
-struct is_direct_value : std::integral_constant < bool,
-    std::is_arithmetic<T>::value || std::is_same<T, std::nullptr_t>::value
-    || std::is_same<T, typename View::string_view_t>::value
-    || std::is_same<T, BasicJsonType>::value || std::is_same<T, View>::value >
-{};
-
-template<typename Traits, typename Alloc, typename BasicJsonType, typename View>
-struct is_direct_value<std::basic_string<char, Traits, Alloc>, BasicJsonType, View> : std::true_type {};
-
-template<typename U, typename A, typename BasicJsonType, typename View>
-struct is_direct_value<std::vector<U, A>, BasicJsonType, View> : std::true_type {};
-
-template<typename K, typename V, typename C, typename A, typename BasicJsonType, typename View>
-struct is_direct_value<std::map<K, V, C, A>, BasicJsonType, View> : is_string_key<K> {};
-
-template<typename K, typename V, typename H, typename E, typename A, typename BasicJsonType, typename View>
-struct is_direct_value<std::unordered_map<K, V, H, E, A>, BasicJsonType, View> : is_string_key<K> {};
-
 }  // namespace view
 }  // namespace detail
 NLOHMANN_JSON_NAMESPACE_END
@@ -31,12 +31,12 @@
 #include <cstddef> // nullptr_t, size_t // IWYU pragma: keep
 #include <cstdint> // uint8_t, uint32_t
 #include <cstring> // memcpy, strlen
-#include <istream> // istream // IWYU pragma: keep
+#include <istream> // istream
 #include <iterator> // distance, input_iterator_tag, iterator_traits
 #include <map> // map
 #include <memory> // unique_ptr
 #ifndef JSON_NO_IO
-    #include <ostream> // ostream // IWYU pragma: keep
+    #include <ostream> // ostream
 #endif
 #include <string> // string
 #include <tuple> // tuple_element, tuple_size // IWYU pragma: keep
@@ -265,7 +265,7 @@ class basic_json_view
        {
            if (is_discarded())
            {
-                return {};
+                return basic_json_view();
            }
            detail::view::throw_type_error(305, "cannot use operator[] with a string argument with ", type_name());
        }
@@ -291,7 +291,7 @@ class basic_json_view
        {
            if (is_discarded())
            {
-                return {};
+                return basic_json_view();
            }
            detail::view::throw_type_error(305, "cannot use operator[] with a numeric argument with ", type_name());
        }
@@ -314,7 +314,7 @@ class basic_json_view
    {
        if (NLOHMANN_VIEW_UNLIKELY(is_discarded()))
        {
-            return {};
+            return basic_json_view();
        }
        return detail::view::resolve_pointer(*this, detail::json_pointer_access::reference_tokens(ptr), detail::view::pointer_mode::unchecked);
    }
@@ -379,7 +379,7 @@ class basic_json_view
    /// the member with this key converted to T, or the default value if there
    /// is no such member (the first one, should the key occur more than
    /// once). Throws type_error.306 if this is not an object.
-    template<typename T, typename std::enable_if<detail::view::is_non_c_string_default<T>::value, int>::type = 0>
+    template < typename T, typename std::enable_if < !std::is_same<typename std::decay<T>::type, const char*>::value, int >::type = 0 >
    T value(string_view_t key, const T& default_value) const
    {
        if (NLOHMANN_VIEW_UNLIKELY(!is_object()))
@@ -398,7 +398,7 @@ class basic_json_view
    /// the value a JSON pointer refers to converted to T, or the default
    /// value if the pointer cannot be resolved. Throws type_error.306 if this
    /// is neither an object nor an array.
-    template<typename T, typename std::enable_if<detail::view::is_non_c_string_default<T>::value, int>::type = 0>
+    template < typename T, typename std::enable_if < !std::is_same<typename std::decay<T>::type, const char*>::value, int >::type = 0 >
    T value(const json_pointer& ptr, const T& default_value) const
    {
        if (NLOHMANN_VIEW_UNLIKELY(!is_structured()))
@@ -487,11 +487,11 @@ class basic_json_view
        return !detail::view::resolve_pointer(*this, detail::json_pointer_access::reference_tokens(ptr), detail::view::pointer_mode::contains).is_discarded();
    }

-    /// the number of members with this key (more than 1 if the key occurs
-    /// more than once); 0 if this is not an object
+    /// 1 if this is an object with a member with this key, else 0 (duplicate
+    /// keys count once)
    size_type count(string_view_t key) const
    {
-        return is_object() ? detail::view::count_members<Editable>(*m_doc, m_node, key.data(), key.size()) : 0;
+        return contains(key) ? 1 : 0;
    }

    size_type count(const char* key) const
@@ -558,12 +558,10 @@ class basic_json_view
        return get_impl(detail::view::value_tag<T> {}, detail::priority_tag<2> {});
    }

-    /// as BasicJsonType::get_to(): the types get<T>() converts directly are
-    /// assigned, all others are passed to from_json with v as it is
    template<typename T>
    T& get_to(T& v) const
    {
-        get_to_impl(v, detail::view::is_direct_value<T, BasicJsonType, basic_json_view> {});
+        v = get<T>();
        return v;
    }

@@ -750,10 +748,8 @@ class basic_json_view
    {
        if (editable() && m_doc->edits != nullptr)
        {
-            // positions of moved and new values are not source offsets; the root
-            // (the first node) spans the source text and every edit
-            const bool is_root = m_node == m_doc->nodes;
-            return is_root ? m_doc->size + m_doc->edits->text_used : 64;
+            // positions of moved and new values are not source offsets
+            return m_node == m_doc->nodes ? m_doc->size + m_doc->edits->text_used : 64;
        }
        const node* const end = m_doc->nodes + m_doc->node_count;
        if ((m_node->flags & detail::view::node_flags::storage) != 0)
@@ -800,7 +796,7 @@ class basic_json_view
        return (m_node->flags & detail::view::node_flags::is_true) != 0;
    }

-    template<typename T, typename std::enable_if<detail::view::is_non_bool_arithmetic<T>::value, int>::type = 0>
+    template < typename T, typename std::enable_if < std::is_arithmetic<T>::value && !std::is_same<T, bool>::value, int >::type = 0 >
    NLOHMANN_VIEW_ALWAYS_INLINE T get_impl(detail::view::value_tag<T> /*unused*/, detail::priority_tag<2> /*unused*/) const
    {
        if (NLOHMANN_VIEW_UNLIKELY(m_node == nullptr))
@@ -866,21 +862,6 @@ class basic_json_view
        return materialize().template get<T>();
    }

-    // --- get_to() dispatch ---
-
-    template<typename T>
-    void get_to_impl(T& v, std::true_type /*direct*/) const
-    {
-        v = get<T>();
-    }
-
-    /// from_json may keep parts of v (members a JSON object lacks, say)
-    template<typename T>
-    void get_to_impl(T& v, std::false_type /*direct*/) const
-    {
-        materialize().get_to(v);
-    }
-
    const document_data* m_doc = nullptr;
    const node* m_node = nullptr;
 };
@@ -1040,7 +1021,7 @@ class basic_json_document
        return m_data ? m_data->node_count : 0;
    }

-    /// bytes held by the document (index, decoded strings, and owned text or image)
+    /// bytes held by the document (index, decoded strings, owned text or image)
    std::size_t memory_usage() const noexcept
    {
        if (!m_data)
@@ -1188,7 +1169,7 @@ class basic_json_document
    }

    /// assign an existing array element; returns a view of it
-    template<typename I, typename V, typename std::enable_if<detail::view::is_non_bool_integral<I>::value, int>::type = 0>
+    template < typename I, typename V, typename std::enable_if < std::is_integral<I>::value && !std::is_same<I, bool>::value, int >::type = 0 >
    view_type set(view_type array, I idx, V && value)
    {
        return editor().set(array, index(idx), std::forward<V>(value));
@@ -1210,14 +1191,14 @@ class basic_json_document
        const auto& token = ptr.back();
        if (parent.is_null())
        {
-            if (token == "-")
-            {
-                return push_back(parent, std::forward<V>(value));
-            }
            const bool digits = std::all_of(token.begin(), token.end(), [](const char c)
            {
                return c >= '0' && c <= '9';
            });
+            if (token == "-")
+            {
+                return push_back(parent, std::forward<V>(value));
+            }
            if (digits)
            {
                // (an invalid index is an error before the parent changes)
@@ -1255,7 +1236,7 @@ class basic_json_document

    /// insert into an array before position idx (idx <= size()); returns a
    /// view of the new element
-    template<typename I, typename V, typename std::enable_if<detail::view::is_non_bool_integral<I>::value, int>::type = 0>
+    template < typename I, typename V, typename std::enable_if < std::is_integral<I>::value && !std::is_same<I, bool>::value, int >::type = 0 >
    view_type insert(view_type array, I idx, V && value)
    {
        return editor().insert(array, index(idx), std::forward<V>(value));
@@ -1268,7 +1249,7 @@ class basic_json_document
    }

    /// remove an array element
-    template<typename I, typename std::enable_if<detail::view::is_non_bool_integral<I>::value, int>::type = 0>
+    template < typename I, typename std::enable_if < std::is_integral<I>::value && !std::is_same<I, bool>::value, int >::type = 0 >
    void erase(view_type array, I idx)
    {
        editor().erase(array, index(idx));
@@ -118,14 +118,6 @@
    #define JSON_USE_OBJECTS_FOR_ENUM_KEYED_MAPS 0
 #endif

-#ifndef JSON_DISABLE_STREAM_BULK_SCAN
-    #define JSON_DISABLE_STREAM_BULK_SCAN 0
-#endif
-
-#ifndef JSON_DISABLE_UNLOCKED_FILE_IO
-    #define JSON_DISABLE_UNLOCKED_FILE_IO 0
-#endif
-
 #if JSON_DIAGNOSTICS
    #define NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS _diag
 #else
@@ -174,38 +166,14 @@
    #define NLOHMANN_JSON_ABI_TAG_OBJECTS_FOR_ENUM_KEYED_MAPS
 #endif

-#if JSON_DISABLE_STREAM_BULK_SCAN
-    #define NLOHMANN_JSON_ABI_TAG_DISABLE_STREAM_BULK_SCAN _dsbs
-#else
-    #define NLOHMANN_JSON_ABI_TAG_DISABLE_STREAM_BULK_SCAN
-#endif
-
-#if JSON_DISABLE_UNLOCKED_FILE_IO
-    #define NLOHMANN_JSON_ABI_TAG_DISABLE_UNLOCKED_FILE_IO _dufio
-#else
-    #define NLOHMANN_JSON_ABI_TAG_DISABLE_UNLOCKED_FILE_IO
-#endif
-
-#ifdef JSON_VIEW_NO_SIMD
-    #define NLOHMANN_JSON_ABI_TAG_VIEW_NO_SIMD _vns
-#else
-    #define NLOHMANN_JSON_ABI_TAG_VIEW_NO_SIMD
-#endif
-
-#ifdef JSON_VIEW_USE_SSSE3
-    #define NLOHMANN_JSON_ABI_TAG_VIEW_USE_SSSE3 _vssse3
-#else
-    #define NLOHMANN_JSON_ABI_TAG_VIEW_USE_SSSE3
-#endif
-
 #ifndef NLOHMANN_JSON_NAMESPACE_NO_VERSION
    #define NLOHMANN_JSON_NAMESPACE_NO_VERSION 0
 #endif

 // Construct the namespace ABI tags component
-#define NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b, c, d, e, f, g, h, i, j, k, l) json_abi ## a ## b ## c ## d ## e ## f ## g ## h ## i ## j ## k ## l
-#define NLOHMANN_JSON_ABI_TAGS_CONCAT(a, b, c, d, e, f, g, h, i, j, k, l) \
-    NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b, c, d, e, f, g, h, i, j, k, l)
+#define NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b, c, d, e, f, g, h) json_abi ## a ## b ## c ## d ## e ## f ## g ## h
+#define NLOHMANN_JSON_ABI_TAGS_CONCAT(a, b, c, d, e, f, g, h) \
+    NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b, c, d, e, f, g, h)

 #define NLOHMANN_JSON_ABI_TAGS                                       \
    NLOHMANN_JSON_ABI_TAGS_CONCAT(                                   \
@@ -216,11 +184,7 @@
            NLOHMANN_JSON_ABI_TAG_PRECISE_STREAM_POSITION,           \
            NLOHMANN_JSON_ABI_TAG_STRICT_NUL_HANDLING,               \
            NLOHMANN_JSON_ABI_TAG_STRICT_BINARY_UTF8,                \
-            NLOHMANN_JSON_ABI_TAG_OBJECTS_FOR_ENUM_KEYED_MAPS,       \
-            NLOHMANN_JSON_ABI_TAG_DISABLE_STREAM_BULK_SCAN,          \
-            NLOHMANN_JSON_ABI_TAG_DISABLE_UNLOCKED_FILE_IO,          \
-            NLOHMANN_JSON_ABI_TAG_VIEW_NO_SIMD,                      \
-            NLOHMANN_JSON_ABI_TAG_VIEW_USE_SSSE3)
+            NLOHMANN_JSON_ABI_TAG_OBJECTS_FOR_ENUM_KEYED_MAPS)

 // Construct the namespace version component
 #define NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT_EX(major, minor, patch) \
@@ -8412,12 +8376,10 @@ NLOHMANN_JSON_NAMESPACE_END
 #include <cstdint> // uint32_t
 #include <cstring> // strlen
 #include <iterator> // begin, end, iterator_traits, random_access_iterator_tag, distance, next, reverse_iterator
-#include <limits> // numeric_limits
 #include <streambuf> // streambuf
 #include <string> // string, char_traits
 #include <type_traits> // enable_if, is_base_of, is_pointer, is_integral, remove_pointer
 #include <utility> // pair, declval
-#include <vector> // vector

 #ifndef JSON_NO_IO
    #include <cstdio>   // FILE *
@@ -8435,24 +8397,6 @@ NLOHMANN_JSON_NAMESPACE_END
 // #include <nlohmann/detail/string_utils.hpp>


-#ifndef JSON_NO_IO
-    // Which unlocked stdio functions file_input_adapter uses (see
-    // JSON_DISABLE_UNLOCKED_FILE_IO): 1 = POSIX flockfile/getc_unlocked,
-    // 2 = Microsoft CRT _lock_file/_fgetc_nolock, 0 = none (std::fgetc, which
-    // locks the file for every character). Only C libraries known to declare
-    // the functions are listed; the macros are tested after <cstdio>, which
-    // defines __GLIBC__.
-    #if JSON_DISABLE_UNLOCKED_FILE_IO
-        #define JSON_UNLOCKED_FILE_IO 0
-    #elif defined(_MSC_VER)
-        #define JSON_UNLOCKED_FILE_IO 2
-    #elif defined(__GLIBC__) || defined(__APPLE__) || defined(__ANDROID__) || defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__)
-        #define JSON_UNLOCKED_FILE_IO 1
-    #else
-        #define JSON_UNLOCKED_FILE_IO 0
-    #endif
-#endif  // JSON_NO_IO
-
 NLOHMANN_JSON_NAMESPACE_BEGIN
 namespace detail
 {
@@ -8479,35 +8423,18 @@ class file_input_adapter
        : m_file(f)
    {
        JSON_ASSERT(m_file != nullptr);
-        lock();
    }

    // make class move-only
    file_input_adapter(const file_input_adapter&) = delete;
-    file_input_adapter(file_input_adapter&& rhs) noexcept
-        : m_file(rhs.m_file)
-    {
-        // the lock is owned by the thread, not the adapter: hand it over
-        rhs.m_file = nullptr;
-    }
+    file_input_adapter(file_input_adapter&&) noexcept = default;
    file_input_adapter& operator=(const file_input_adapter&) = delete;
    file_input_adapter& operator=(file_input_adapter&&) = delete;
-    ~file_input_adapter()
-    {
-        unlock();
-    }
+    ~file_input_adapter() = default;

    std::char_traits<char>::int_type get_character() noexcept
    {
-        // the file is locked for the lifetime of the adapter, so the
-        // per-character lock of std::fgetc can be skipped
-#if JSON_UNLOCKED_FILE_IO == 1
-        return getc_unlocked(m_file);
-#elif JSON_UNLOCKED_FILE_IO == 2
-        return _fgetc_nolock(m_file);
-#else
        return std::fgetc(m_file);
-#endif
    }

    // returns the number of characters successfully read
@@ -8518,32 +8445,6 @@ class file_input_adapter
    }

  private:
-    // Lock the file once for the whole parse instead of once per character.
-    // The lock is recursive, so fread() and the user's own stdio calls on the
-    // same thread keep working.
-    void lock() noexcept
-    {
-#if JSON_UNLOCKED_FILE_IO == 1
-        flockfile(m_file);
-#elif JSON_UNLOCKED_FILE_IO == 2
-        _lock_file(m_file);
-#endif
-    }
-
-    void unlock() noexcept
-    {
-        // a moved-from adapter has no file and holds no lock
-        if (m_file == nullptr)
-        {
-            return;
-        }
-#if JSON_UNLOCKED_FILE_IO == 1
-        funlockfile(m_file);
-#elif JSON_UNLOCKED_FILE_IO == 2
-        _unlock_file(m_file);
-#endif
-    }
-
    /// the file pointer to read from
    std::FILE* m_file;
 };
@@ -8593,26 +8494,15 @@ class input_stream_adapter
    input_stream_adapter& operator=(input_stream_adapter&) = delete;
    input_stream_adapter& operator=(input_stream_adapter&&) = delete;

-    input_stream_adapter(input_stream_adapter&& rhs) noexcept
-        : is(rhs.is), sb(rhs.sb)
 #if JSON_PRECISE_STREAM_POSITION
-        , lookahead(rhs.lookahead)
-#endif
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-        , token_carry(std::move(rhs.token_carry))
-        , token_segment(rhs.token_segment)
-        , current_in_get_area(rhs.current_in_get_area)
-        , tracking_token(rhs.tracking_token)
-#endif
+    input_stream_adapter(input_stream_adapter&& rhs) noexcept
+        : is(rhs.is), sb(rhs.sb), lookahead(rhs.lookahead)
    {
        rhs.is = nullptr;
        rhs.sb = nullptr;
-#if JSON_PRECISE_STREAM_POSITION
        rhs.lookahead = false;
-#endif
    }

-#if JSON_PRECISE_STREAM_POSITION
    // Whether the character last returned by get_character() can be given back
    // to the input with release_lookahead().
    static constexpr bool supports_lookahead = true;
@@ -8632,41 +8522,17 @@ class input_stream_adapter
            sb->sbumpc();
        }

-#if !JSON_DISABLE_STREAM_BULK_SCAN
-        // sgetc() refills the get area if it is exhausted
-        const bool refill = streambuf_access::get_ptr(sb) == streambuf_access::get_end(sb);
-        if (JSON_HEDLEY_UNLIKELY(refill))
-        {
-            save_token_segment();
-        }
-#endif
-
        auto res = sb->sgetc();
        // set eof manually, as we don't use the istream interface.
        if (JSON_HEDLEY_UNLIKELY(res == std::char_traits<char>::eof()))
        {
            // there is nothing to step over next time
            lookahead = false;
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-            current_in_get_area = false;
-#endif
            is->clear(is->rdstate() | std::ios::eofbit);
        }
        else
        {
            lookahead = true;
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-            if (JSON_HEDLEY_UNLIKELY(refill))
-            {
-                // the peeked character is at gptr(), unless the streambuf has
-                // no get area
-                after_refill(res, streambuf_access::get_ptr(sb) != streambuf_access::get_end(sb));
-            }
-            else
-            {
-                current_in_get_area = true;
-            }
-#endif
        }
        return res;
    }
@@ -8680,6 +8546,13 @@ class input_stream_adapter
        lookahead = false;
    }
 #else
+    input_stream_adapter(input_stream_adapter&& rhs) noexcept
+        : is(rhs.is), sb(rhs.sb)
+    {
+        rhs.is = nullptr;
+        rhs.sb = nullptr;
+    }
+
    // std::istream/std::streambuf use std::char_traits<char>::to_int_type, to
    // ensure that std::char_traits<char>::eof() and the character 0xFF do not
    // end up as the same value, e.g., 0xFFFFFFFF.
@@ -8688,37 +8561,12 @@ class input_stream_adapter
    // stays consumed after parsing; see JSON_PRECISE_STREAM_POSITION.
    std::char_traits<char>::int_type get_character()
    {
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-        // sbumpc() refills the get area if it is exhausted
-        const bool refill = streambuf_access::get_ptr(sb) == streambuf_access::get_end(sb);
-        if (JSON_HEDLEY_UNLIKELY(refill))
-        {
-            save_token_segment();
-        }
-#endif
-
        auto res = sb->sbumpc();
        // set eof manually, as we don't use the istream interface.
        if (JSON_HEDLEY_UNLIKELY(res == std::char_traits<char>::eof()))
        {
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-            current_in_get_area = false;
-#endif
            is->clear(is->rdstate() | std::ios::eofbit);
        }
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-        else if (JSON_HEDLEY_UNLIKELY(refill))
-        {
-            // the consumed character is at gptr() - 1, unless the streambuf
-            // has no get area and returned it from uflow()
-            const char* const next = streambuf_access::get_ptr(sb);
-            after_refill(res, next != nullptr && next != streambuf_access::get_begin(sb));
-        }
-        else
-        {
-            current_in_get_area = true;
-        }
-#endif
        return res;
    }
 #endif
@@ -8737,165 +8585,7 @@ class input_stream_adapter
        return res;
    }

-#if !JSON_DISABLE_STREAM_BULK_SCAN
-    // The lexer may scan the characters in the get area of the streambuf
-    // directly (SWAR fast paths). The get area is only a window into the
-    // input: it ends wherever the streambuf's buffer ends, and is refilled by
-    // the next get_character(). The lexer therefore keeps counting the
-    // position itself and treats the end of the window as "unknown", not as
-    // the end of the input.
-    static constexpr bool supports_bulk_scan = true;
-    static constexpr bool bulk_window = true;
-
-    // Pointer to the next unread character; only valid when
-    // bulk_remaining() > 0. The character before it is the one last returned
-    // by get_character().
-    const char* bulk_data() const
-    {
-        return current_end();
-    }
-
-    // Number of unread characters in the get area.
-    std::size_t bulk_remaining() const
-    {
-        if (!current_in_get_area)
-        {
-            return 0;
-        }
-        return static_cast<std::size_t>(streambuf_access::get_end(sb) - current_end());
-    }
-
-    // Consume @a n characters previously inspected via bulk_data(); the last
-    // of them becomes the character last returned by get_character().
-    void bulk_skip(std::size_t n)
-    {
-        JSON_ASSERT(n <= bulk_remaining());
-        // gbump() takes an int, but a get area (e.g., of a std::stringbuf) can
-        // be larger
-        constexpr auto max_bump = static_cast<std::size_t>((std::numeric_limits<int>::max)());
-        for (; n > max_bump; n -= max_bump)
-        {
-            streambuf_access::bump(sb, static_cast<int>(max_bump));
-        }
-        streambuf_access::bump(sb, static_cast<int>(n));
-    }
-
-    // The adapter keeps the current token for the lexer's error messages: the
-    // part in the get area is only remembered as a pointer, and copied out
-    // when the get area is about to be refilled.
-    static constexpr bool supports_token_tracking = true;
-
-    // Start a token with the characters read from now on. Until this is
-    // called, nothing is tracked (the binary readers never call it).
-    void begin_token() noexcept
-    {
-        tracking_token = true;
-        token_carry.clear();
-        token_segment = current_end();
-    }
-
-    // Start a new token with the character @a c last returned by
-    // get_character().
-    void mark_token_start(std::char_traits<char>::int_type c)
-    {
-        tracking_token = true;
-        token_carry.clear();
-        if (current_in_get_area)
-        {
-            token_segment = current_end() - 1;
-        }
-        else
-        {
-            token_segment = nullptr;
-            token_carry.push_back(std::char_traits<char>::to_char_type(c));
-        }
-    }
-
-    // Copy the characters read since mark_token_start() to @a out, without the
-    // last one if @a drop_last.
-    void copy_token(std::vector<char>& out, bool drop_last) const
-    {
-        out = token_carry;
-        if (token_segment != nullptr)
-        {
-            out.insert(out.end(), token_segment, current_end());
-        }
-        if (drop_last && !out.empty())
-        {
-            out.pop_back();
-        }
-    }
-#endif
-
  private:
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-    // Reads the protected get-area pointers of any std::streambuf. Naming the
-    // members through a derived class makes forming the member pointers
-    // accessible; calling them on another streambuf object is then ordinary
-    // member access through a pointer to member.
-    struct streambuf_access : std::streambuf
-    {
-        static const char* get_ptr(std::streambuf* s)
-        {
-            return (s->*(&streambuf_access::gptr))();
-        }
-        static const char* get_end(std::streambuf* s)
-        {
-            return (s->*(&streambuf_access::egptr))();
-        }
-        static const char* get_begin(std::streambuf* s)
-        {
-            return (s->*(&streambuf_access::eback))();
-        }
-        static void bump(std::streambuf* s, int n)
-        {
-            (s->*(&streambuf_access::gbump))(n);
-        }
-    };
-
-    // one past the character last returned by get_character(), if that is in
-    // the get area
-    const char* current_end() const
-    {
-#if JSON_PRECISE_STREAM_POSITION
-        // the character is peeked at gptr() and not stepped over yet, unless
-        // it was given back with release_lookahead()
-        return streambuf_access::get_ptr(sb) + (lookahead ? 1 : 0);
-#else
-        return streambuf_access::get_ptr(sb);
-#endif
-    }
-
-    // the get area is about to be replaced: copy the token's part in it
-    void save_token_segment()
-    {
-        if (token_segment != nullptr)
-        {
-            token_carry.insert(token_carry.end(), token_segment, streambuf_access::get_end(sb));
-            token_segment = nullptr;
-        }
-    }
-
-    // character @a c was just read into a new get area (@a in_get_area) or
-    // returned without one
-    void after_refill(std::char_traits<char>::int_type c, bool in_get_area)
-    {
-        current_in_get_area = in_get_area;
-        if (!tracking_token)
-        {
-            return;
-        }
-        if (in_get_area)
-        {
-            token_segment = current_end() - 1;
-        }
-        else
-        {
-            token_carry.push_back(std::char_traits<char>::to_char_type(c));
-        }
-    }
-#endif
-
 #if JSON_PRECISE_STREAM_POSITION
    // Step over the character last returned by get_character(). The character
    // has already been peeked successfully, so for every streambuf with a get
@@ -8917,16 +8607,6 @@ class input_stream_adapter
    /// whether get_character() peeked a character that is not consumed yet
    bool lookahead = false;
 #endif
-#if !JSON_DISABLE_STREAM_BULK_SCAN
-    /// the part of the current token that was in earlier get areas
-    std::vector<char> token_carry{}; // NOLINT(readability-redundant-member-init)
-    /// start of the current token's part in the get area, or nullptr
-    const char* token_segment = nullptr;
-    /// whether the character last returned by get_character() is in the get area
-    bool current_in_get_area = false;
-    /// whether a token is tracked at all; the binary readers never start one
-    bool tracking_token = false;
-#endif
 };
 #endif  // JSON_NO_IO

@@ -11740,43 +11420,6 @@ constexpr bool input_adapter_supports_bulk_scan(std::false_type /*detected*/)
    return false;
 }

-// Detect whether an input adapter keeps the current token itself and can
-// hand it out on demand (see input_stream_adapter::supports_token_tracking),
-// so the lexer need not copy every scanned character into token_string.
-template<typename InputAdapterType>
-using detect_supports_token_tracking = decltype(InputAdapterType::supports_token_tracking);
-
-template<typename InputAdapterType>
-constexpr bool input_adapter_supports_token_tracking(std::true_type /*detected*/)
-{
-    return InputAdapterType::supports_token_tracking;
-}
-
-template<typename InputAdapterType>
-constexpr bool input_adapter_supports_token_tracking(std::false_type /*detected*/)
-{
-    return false;
-}
-
-// Detect whether the contiguous block of a bulk-scan adapter is only a window
-// into the input (see input_stream_adapter::bulk_window): its end is not the
-// end of the input, so a token that touches it must be finished character by
-// character.
-template<typename InputAdapterType>
-using detect_bulk_window = decltype(InputAdapterType::bulk_window);
-
-template<typename InputAdapterType>
-constexpr bool input_adapter_bulk_window(std::true_type /*detected*/)
-{
-    return InputAdapterType::bulk_window;
-}
-
-template<typename InputAdapterType>
-constexpr bool input_adapter_bulk_window(std::false_type /*detected*/)
-{
-    return false;
-}
-
 /*!
@brief lexical analysis

@@ -11795,20 +11438,9 @@ class lexer : public lexer_base<BasicJsonType>
    /// whether the last read token can be reconstructed from the input adapter
    /// on demand (in error paths) instead of being copied on every scanned
    /// character; see input_adapter_supports_seek
-    static constexpr bool seekable =
+    static constexpr bool lazy_token_string =
        input_adapter_supports_seek<InputAdapterType>(is_detected<detect_supports_seek, InputAdapterType> {});

-    /// whether the adapter keeps the token itself (mark_token_start() /
-    /// copy_token()); see input_adapter_supports_token_tracking
-    static constexpr bool adapter_token =
-        !seekable && input_adapter_supports_token_tracking<InputAdapterType>(is_detected<detect_supports_token_tracking, InputAdapterType> {});
-
-    /// whether the last read token is obtained from the input adapter on
-    /// demand (in error paths) instead of being copied on every scanned
-    /// character: seekable adapters reconstruct it from the consumed input,
-    /// token-tracking adapters keep it themselves
-    static constexpr bool lazy_token_string = seekable || adapter_token;
-
    /// whether the read position is derived from the input adapter on demand
    /// instead of being counted on every scanned character. Seekable adapters
    /// know how much input they consumed and can revisit it, so
@@ -11816,7 +11448,7 @@ class lexer : public lexer_base<BasicJsonType>
    /// and line and column are recomputed from the consumed input only when
    /// get_position() is called (errors). Counting per character kept two
    /// increments and a newline check in the hot path of every get().
-    static constexpr bool lazy_position = seekable;
+    static constexpr bool lazy_position = lazy_token_string;

    /// whether a simulated unget can be passed on to the input adapter, which
    /// then leaves the character in the input; see
@@ -11825,17 +11457,14 @@ class lexer : public lexer_base<BasicJsonType>
        input_adapter_supports_lookahead<InputAdapterType>(is_detected<detect_supports_lookahead, InputAdapterType> {});

    /// whether string scanning may bulk-consume runs of ordinary characters
-    /// directly from a contiguous input buffer (SWAR fast path). Without
-    /// lazy_token_string / lazy_position, the bulk paths copy the consumed
-    /// characters into token_string and advance the position counters
-    /// themselves (see bulk_consume).
+    /// directly from a contiguous input buffer (SWAR fast path). This requires
+    /// the token to be reconstructible lazily (lazy_token_string), so bypassing
+    /// the per-character capture in get() cannot lose error diagnostics. It
+    /// also implies lazy_position, so the bulk paths need not advance the
+    /// position counters.
    static constexpr bool bulk_scan =
-        input_adapter_supports_bulk_scan<InputAdapterType>(is_detected<detect_supports_bulk_scan, InputAdapterType> {});
-
-    /// whether the contiguous block is only a window into the input, so that
-    /// its end does not end a token; see input_adapter_bulk_window
-    static constexpr bool bulk_window =
-        input_adapter_bulk_window<InputAdapterType>(is_detected<detect_bulk_window, InputAdapterType> {});
+        lazy_token_string
+        && input_adapter_supports_bulk_scan<InputAdapterType>(is_detected<detect_supports_bulk_scan, InputAdapterType> {});

  public:
    using token_type = typename lexer_base<BasicJsonType>::token_type;
@@ -11844,11 +11473,7 @@ class lexer : public lexer_base<BasicJsonType>
        : ia(std::move(adapter))
        , ignore_comments(ignore_comments_)
        , discard_number_values(discard_number_values_)
-    {
-        // the token string of an error before the first token is everything
-        // read so far
-        begin_token(std::integral_constant<bool, adapter_token> {});
-    }
+    {}

    // deleted because of pointer members
    lexer(const lexer&) = delete;
@@ -11865,8 +11490,8 @@ class lexer : public lexer_base<BasicJsonType>
    /// contiguous input: try to decode the 4 hex digits following `\\u`
    /// directly from the input buffer via hex_codepoint(), instead of 4 calls
    /// to get(). On success, advances the adapter exactly as those 4 get()
-    /// calls would (including the position and token bookkeeping of a
-    /// streaming adapter, see bulk_consume) and leaves @a current holding the last of
+    /// calls would (bulk_scan implies lazy_position, so there are no position
+    /// counters to advance) and leaves @a current holding the last of
    /// the 4 digits, just as the last such get() would; the codepoint is
    /// written to @a out. Makes no state change and returns false for a
    /// pending unget, fewer than 4 remaining bytes, or any of the 4 bytes not
@@ -11885,7 +11510,7 @@ class lexer : public lexer_base<BasicJsonType>
        {
            return false;
        }
-        bulk_consume(reinterpret_cast<const char*>(raw), 4);
+        ia.bulk_skip(4);
        current = char_traits<char_type>::to_int_type(raw[3]);
        out = codepoint;
        return true;
@@ -12014,36 +11639,7 @@ class lexer : public lexer_base<BasicJsonType>
            return;
        }
        token_buffer.append(reinterpret_cast<const typename string_t::value_type*>(data), pos);
-        bulk_consume(reinterpret_cast<const char*>(data), pos);
-    }
-
-    /// consume @a n characters at @a data (the adapter's bulk_data()) and do
-    /// the bookkeeping get() would have done for them; the characters are
-    /// never newlines
-    void bulk_consume(const char* data, std::size_t n)
-    {
-        bulk_track_position(n, std::integral_constant<bool, lazy_position> {});
-        bulk_track_token(data, n, std::integral_constant<bool, lazy_token_string> {});
-        ia.bulk_skip(n);
-    }
-
-    /// seekable adapter: the position is derived from the adapter
-    void bulk_track_position(std::size_t /*n*/, std::true_type /*lazy*/) const noexcept {}
-
-    /// streaming adapter: count the characters
-    void bulk_track_position(std::size_t n, std::false_type /*lazy*/) noexcept
-    {
-        position.chars_read_total += n;
-        position.chars_read_current_line += n;
-    }
-
-    /// the token is obtained from the adapter
-    void bulk_track_token(const char* /*data*/, std::size_t /*n*/, std::true_type /*lazy*/) const noexcept {}
-
-    /// streaming adapter: capture the characters
-    void bulk_track_token(const char* data, std::size_t n, std::false_type /*lazy*/)
-    {
-        token_string.insert(token_string.end(), data, data + n);
+        ia.bulk_skip(pos);
    }

    /// streaming input: no bulk fast path
@@ -13261,10 +12857,6 @@ scan_number_done:
            }
        }
        const std::size_t len = i;
-        if (number_may_continue(len == avail, std::integral_constant<bool, bulk_window> {}))
-        {
-            return token_type::uninitialized;
-        }

        // reset() records where this token starts (for diagnostics), so it has
        // to run before the input position advances below
@@ -13282,8 +12874,7 @@ scan_number_done:
            const token_type integer_result = convert_integer(number_type, data, data + len);
            if (JSON_HEDLEY_LIKELY(integer_result != token_type::uninitialized))
            {
-                bulk_consume(data + 1, len - 1);
-                read_number_terminator(std::integral_constant<bool, bulk_window> {});
+                ia.bulk_skip(len - 1);
                return integer_result;
            }
            // The value does not fit an integer, so this token converts as a
@@ -13299,37 +12890,11 @@ scan_number_done:
        token_buffer.append(reinterpret_cast<const typename string_t::value_type*>(data), len);
        decimal_point_position = dot_index;

-        bulk_consume(data + 1, len - 1);
-        read_number_terminator(std::integral_constant<bool, bulk_window> {});
+        ia.bulk_skip(len - 1);

        return convert_number(number_type, mantissa_end);
    }

-    /// window adapter: a number that reaches the end of the window may continue
-    /// after it, so scan_number() has to read it character by character
-    static constexpr bool number_may_continue(bool at_end, std::true_type /*window*/) noexcept
-    {
-        return at_end;
-    }
-
-    /// the end of the block is the end of the input, which ends the number
-    static constexpr bool number_may_continue(bool /*at_end*/, std::false_type /*window*/) noexcept
-    {
-        return false;
-    }
-
-    /// window adapter: read the character after a bulk-scanned number and unget
-    /// it, as scan_number() does. The adapter is a stream that is handed back to
-    /// the user, who must find the same input consumed either way.
-    void read_number_terminator(std::true_type /*window*/)
-    {
-        get();
-        unget();
-    }
-
-    /// the input is not handed back, so the terminator can stay unread
-    void read_number_terminator(std::false_type /*window*/) const noexcept {}
-
    /// contiguous input: try the number fast path, else the byte-path scanner
    token_type scan_number_dispatch(std::true_type /*bulk*/)
    {
@@ -13385,30 +12950,11 @@ scan_number_done:
    /// seekable adapter: remember where the current token starts so it can be
    /// reconstructed from the input on error; current has already been
    /// consumed, hence the -1
-    void note_token_start(std::true_type /*lazy*/)
-    {
-        note_token_start_lazy(std::integral_constant<bool, adapter_token> {});
-    }
-
-    void note_token_start_lazy(std::false_type /*adapter_token*/) noexcept
+    void note_token_start(std::true_type /*lazy*/) noexcept
    {
        token_string_start = ia.get_consumed_count() - 1;
    }

-    /// token-tracking adapter: start tracking the token at the first character
-    void begin_token(std::true_type /*adapter_token*/) noexcept
-    {
-        ia.begin_token();
-    }
-
-    void begin_token(std::false_type /*adapter_token*/) const noexcept {}
-
-    /// token-tracking adapter: the token starts with the current character
-    void note_token_start_lazy(std::true_type /*adapter_token*/)
-    {
-        ia.mark_token_start(current);
-    }
-
    /// streaming adapter: start copying the token eagerly, beginning with the
    /// already-read first character
    void note_token_start(std::false_type /*lazy*/) noexcept
@@ -13729,20 +13275,6 @@ scan_number_done:
  public:
    /// seekable adapter: rebuild the last read token from the input on demand
    const std::vector<char_type>& collect_token_chars(std::vector<char_type>& out, std::true_type /*lazy*/) const
-    {
-        return collect_token_chars_lazy(out, std::integral_constant<bool, adapter_token> {});
-    }
-
-    /// token-tracking adapter: the adapter hands out everything read since
-    /// mark_token_start(), except a pending unget (see below)
-    const std::vector<char_type>& collect_token_chars_lazy(std::vector<char_type>& out, std::true_type /*adapter_token*/) const
-    {
-        const bool pending_real_unget = next_unget && current != char_traits<char_type>::eof();
-        ia.copy_token(out, pending_real_unget);
-        return out;
-    }
-
-    const std::vector<char_type>& collect_token_chars_lazy(std::vector<char_type>& out, std::false_type /*adapter_token*/) const
    {
        // a pending unget of a real (non-EOF) character means that character
        // was consumed from the input but is not part of the token; EOF is
@@ -13864,8 +13396,9 @@ scan_number_done:
    Pretty-printed JSON indents every line with a run of spaces, which the loop
    in skip_whitespace() would otherwise read one character at a time. The
    spaces are skipped 8 bytes at a time; the last 7 bytes of the input and any
-    other whitespace are left to that loop. Skipping bypasses get();
-    bulk_consume() does its bookkeeping.
+    other whitespace are left to that loop. Skipping bypasses get(), which is
+    fine because bulk_scan implies lazy_position: the position is derived from
+    the adapter, not counted per character.
    */
    void skip_indentation(std::true_type /*bulk*/)
    {
@@ -13888,7 +13421,7 @@ scan_number_done:
                break;
            }
        }
-        bulk_consume(data, pos);
+        ia.bulk_skip(pos);
    }

    /// streaming input: no bulk fast path
@@ -22040,7 +21573,7 @@ class json_pointer
            {}
        };

-        std::vector<slot> table;
+        std::vector<slot> slots;
        std::size_t used = 0;

        static std::size_t hash_of(std::size_t parent, const string_t& token) noexcept
@@ -22055,19 +21588,19 @@ class json_pointer

        void grow()
        {
-            std::vector<slot> old(table.size() * 2);
-            old.swap(table);
-            const std::size_t mask = table.size() - 1;
+            std::vector<slot> old(slots.size() * 2);
+            old.swap(slots);
+            const std::size_t mask = slots.size() - 1;
            for (const auto& s : old)
            {
                if (s.token != nullptr)
                {
                    std::size_t i = s.hash & mask;
-                    while (table[i].token != nullptr)
+                    while (slots[i].token != nullptr)
                    {
                        i = (i + 1) & mask;
                    }
-                    table[i] = s;
+                    slots[i] = s;
                }
            }
        }
@@ -22080,7 +21613,7 @@ class json_pointer

        // start with the empty prefix only
        prefix_tree()
-            : table(16)
+            : slots(16)
            , parent(1, 0)
            , is_array(1, false)
        {}
@@ -22090,20 +21623,20 @@ class json_pointer
        std::size_t add_child(std::size_t id, const string_t& reference_token)
        {
            const std::size_t hash = hash_of(id, reference_token);
-            const std::size_t mask = table.size() - 1;
+            const std::size_t mask = slots.size() - 1;
            std::size_t i = hash & mask;
-            while (table[i].token != nullptr)
+            while (slots[i].token != nullptr)
            {
-                if (table[i].hash == hash && table[i].parent == id && *table[i].token == reference_token)
+                if (slots[i].hash == hash && slots[i].parent == id && *slots[i].token == reference_token)
                {
-                    return table[i].id;
+                    return slots[i].id;
                }
                i = (i + 1) & mask;
            }

            // new prefix
            const std::size_t child = parent.size();
-            table[i] = slot(hash, id, &reference_token, child);
+            slots[i] = slot(hash, id, &reference_token, child);
            if (reference_token == "0")
            {
                is_array[id] = true;
@@ -22112,7 +21645,7 @@ class json_pointer
            is_array.push_back(false);

            // keep the load factor below 1/2
-            if (++used * 2 > table.size())
+            if (++used * 2 > slots.size())
            {
                grow();
            }
@@ -28382,32 +27915,14 @@ inline char* write_shortest(char* first, const zmij::shortest_decimal d) noexcep
    return end + (three ? 5 : 4);
 }

-/// the powers of ten up to 10^19 (all that fit in std::uint64_t)
-inline const std::array<std::uint64_t, 20>& powers_of_ten() noexcept
+/// the powers of ten up to 10^16
+inline const std::array<std::uint64_t, 17>& powers_of_ten_16() noexcept
 {
-    static const std::array<std::uint64_t, 20> powers =
+    static const std::array<std::uint64_t, 17> powers =
    {
        {
-            1u,
-            10u,
-            100u,
-            1000u,
-            10000u,
-            100000u,
-            1000000u,
-            10000000u,
-            100000000u,
-            1000000000u,
-            10000000000u,
-            100000000000u,
-            1000000000000u,
-            10000000000000u,
-            100000000000000u,
-            1000000000000000u,
-            10000000000000000u,
-            100000000000000000u,
-            1000000000000000000u,
-            10000000000000000000u
+            1u, 10u, 100u, 1000u, 10000u, 100000u, 1000000u, 10000000u, 100000000u, 1000000000u, 10000000000u,
+            100000000000u, 1000000000000u, 10000000000000u, 100000000000000u, 1000000000000000u, 10000000000000000u
        }
    };
    return powers;
@@ -28425,9 +27940,9 @@ JSON_HEDLEY_NON_NULL(1)
 JSON_HEDLEY_RETURNS_NON_NULL
 inline char* write_short_decimal(char* first, std::uint64_t digits, int count, int exp) noexcept
 {
-    JSON_ASSERT(digits >= powers_of_ten()[static_cast<std::size_t>(count - 1)] && count <= 15);
+    JSON_ASSERT(digits >= powers_of_ten_16()[static_cast<std::size_t>(count - 1)] && count <= 15);
    const int scale = 16 - count;
-    return write_shortest(first, zmij::shortest_decimal{digits * powers_of_ten()[static_cast<std::size_t>(scale)], exp - scale - 1, 0, false});
+    return write_shortest(first, zmij::shortest_decimal{digits * powers_of_ten_16()[static_cast<std::size_t>(scale)], exp - scale - 1, 0, false});
 }

 /// as write_short_decimal(), counting the digits (not 0, less than 10^15)
@@ -28438,7 +27953,7 @@ inline char* write_short_decimal(char* first, std::uint64_t digits, int exp) noe
    JSON_ASSERT(digits != 0 && digits < 1000000000000000u);
    // floor(log10(2^bits)) + 1 digits, or one less
    const int log2_bound = ((64 - count_leading_zeros(digits)) * 1233) >> 12;
-    const int count = log2_bound + (digits >= powers_of_ten()[static_cast<std::size_t>(log2_bound)] ? 1 : 0);
+    const int count = log2_bound + (digits >= powers_of_ten_16()[static_cast<std::size_t>(log2_bound)] ? 1 : 0);
    return write_short_decimal(first, digits, count, exp);
 }

@@ -38849,7 +38364,6 @@ struct formatter<nlohmann::NLOHMANN_BASIC_JSON_TPL, char> // NOLINT(cert-dcl58-c
 #undef JSON_NO_UNIQUE_ADDRESS
 #undef JSON_DISABLE_ENUM_SERIALIZATION
 #undef JSON_DISABLE_TUPLE_REFERENCE_CONVERSION
-#undef JSON_UNLOCKED_FILE_IO
 #undef JSON_DTOA_SSE2
 #undef JSON_DTOA_NEON

@@ -38876,8 +38390,6 @@ struct formatter<nlohmann::NLOHMANN_BASIC_JSON_TPL, char> // NOLINT(cert-dcl58-c
    #undef JSON_STRICT_BINARY_UTF8
    #undef JSON_DELETE_DEPRECATED_FUNCTIONS
    #undef JSON_USE_OBJECTS_FOR_ENUM_KEYED_MAPS
-    #undef JSON_DISABLE_STREAM_BULK_SCAN
-    #undef JSON_DISABLE_UNLOCKED_FILE_IO
 #endif

 // #include <nlohmann/thirdparty/hedley/hedley_undef.hpp>
@@ -71,14 +71,6 @@
    #define JSON_USE_OBJECTS_FOR_ENUM_KEYED_MAPS 0
 #endif

-#ifndef JSON_DISABLE_STREAM_BULK_SCAN
-    #define JSON_DISABLE_STREAM_BULK_SCAN 0
-#endif
-
-#ifndef JSON_DISABLE_UNLOCKED_FILE_IO
-    #define JSON_DISABLE_UNLOCKED_FILE_IO 0
-#endif
-
 #if JSON_DIAGNOSTICS
    #define NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS _diag
 #else
@@ -127,38 +119,14 @@
    #define NLOHMANN_JSON_ABI_TAG_OBJECTS_FOR_ENUM_KEYED_MAPS
 #endif

-#if JSON_DISABLE_STREAM_BULK_SCAN
-    #define NLOHMANN_JSON_ABI_TAG_DISABLE_STREAM_BULK_SCAN _dsbs
-#else
-    #define NLOHMANN_JSON_ABI_TAG_DISABLE_STREAM_BULK_SCAN
-#endif
-
-#if JSON_DISABLE_UNLOCKED_FILE_IO
-    #define NLOHMANN_JSON_ABI_TAG_DISABLE_UNLOCKED_FILE_IO _dufio
-#else
-    #define NLOHMANN_JSON_ABI_TAG_DISABLE_UNLOCKED_FILE_IO
-#endif
-
-#ifdef JSON_VIEW_NO_SIMD
-    #define NLOHMANN_JSON_ABI_TAG_VIEW_NO_SIMD _vns
-#else
-    #define NLOHMANN_JSON_ABI_TAG_VIEW_NO_SIMD
-#endif
-
-#ifdef JSON_VIEW_USE_SSSE3
-    #define NLOHMANN_JSON_ABI_TAG_VIEW_USE_SSSE3 _vssse3
-#else
-    #define NLOHMANN_JSON_ABI_TAG_VIEW_USE_SSSE3
-#endif
-
 #ifndef NLOHMANN_JSON_NAMESPACE_NO_VERSION
    #define NLOHMANN_JSON_NAMESPACE_NO_VERSION 0
 #endif

 // Construct the namespace ABI tags component
-#define NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b, c, d, e, f, g, h, i, j, k, l) json_abi ## a ## b ## c ## d ## e ## f ## g ## h ## i ## j ## k ## l
-#define NLOHMANN_JSON_ABI_TAGS_CONCAT(a, b, c, d, e, f, g, h, i, j, k, l) \
-    NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b, c, d, e, f, g, h, i, j, k, l)
+#define NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b, c, d, e, f, g, h) json_abi ## a ## b ## c ## d ## e ## f ## g ## h
+#define NLOHMANN_JSON_ABI_TAGS_CONCAT(a, b, c, d, e, f, g, h) \
+    NLOHMANN_JSON_ABI_TAGS_CONCAT_EX(a, b, c, d, e, f, g, h)

 #define NLOHMANN_JSON_ABI_TAGS                                       \
    NLOHMANN_JSON_ABI_TAGS_CONCAT(                                   \
@@ -169,11 +137,7 @@
            NLOHMANN_JSON_ABI_TAG_PRECISE_STREAM_POSITION,           \
            NLOHMANN_JSON_ABI_TAG_STRICT_NUL_HANDLING,               \
            NLOHMANN_JSON_ABI_TAG_STRICT_BINARY_UTF8,                \
-            NLOHMANN_JSON_ABI_TAG_OBJECTS_FOR_ENUM_KEYED_MAPS,       \
-            NLOHMANN_JSON_ABI_TAG_DISABLE_STREAM_BULK_SCAN,          \
-            NLOHMANN_JSON_ABI_TAG_DISABLE_UNLOCKED_FILE_IO,          \
-            NLOHMANN_JSON_ABI_TAG_VIEW_NO_SIMD,                      \
-            NLOHMANN_JSON_ABI_TAG_VIEW_USE_SSSE3)
+            NLOHMANN_JSON_ABI_TAG_OBJECTS_FOR_ENUM_KEYED_MAPS)

 // Construct the namespace version component
 #define NLOHMANN_JSON_NAMESPACE_VERSION_CONCAT_EX(major, minor, patch) \
@@ -285,10 +285,6 @@ if (JSON_TestSimdutf)
    endif()
 endif()

-# test-file_input checks from a second thread that parsing from a FILE* releases the file's lock
-find_package(Threads REQUIRED)
-json_test_set_test_options("test-file_input;test-file_input_unlocked_io_disabled" LINK_LIBRARIES Threads::Threads)
-
 # *DO* use json_test_set_test_options() above this line

 json_test_should_build_32bit_test(json_32bit_test json_32bit_test_only "${JSON_32bitTest}")
@@ -373,33 +369,6 @@ json_test_add_test_for(src/unit-diagnostic-positions.cpp
    MAIN test_main CXX_STANDARDS ${test_cxx_standards} ${test_force}
 )

-# test reading from a std::istream again without scanning the get area in bulk
-json_test_set_test_options(test-stream-bulk-scan_disabled
-    COMPILE_DEFINITIONS JSON_DISABLE_STREAM_BULK_SCAN=1
-)
-json_test_add_test_for(src/unit-stream-bulk-scan.cpp
-    NAME test-stream-bulk-scan_disabled
-    MAIN test_main CXX_STANDARDS ${test_cxx_standards} ${test_force}
-)
-
-# test reading from a std::istream again with JSON_PRECISE_STREAM_POSITION
-json_test_set_test_options(test-stream-bulk-scan_precise
-    COMPILE_DEFINITIONS JSON_PRECISE_STREAM_POSITION=1
-)
-json_test_add_test_for(src/unit-stream-bulk-scan.cpp
-    NAME test-stream-bulk-scan_precise
-    MAIN test_main CXX_STANDARDS ${test_cxx_standards} ${test_force}
-)
-
-# test reading from a FILE* again with the locking stdio functions
-json_test_set_test_options(test-file_input_unlocked_io_disabled
-    COMPILE_DEFINITIONS JSON_DISABLE_UNLOCKED_FILE_IO=1
-)
-json_test_add_test_for(src/unit-file_input.cpp
-    NAME test-file_input_unlocked_io_disabled
-    MAIN test_main CXX_STANDARDS ${test_cxx_standards} ${test_force}
-)
-
 # the json_view parser again with the portable string scanning instead of
 # NEON/SSE2, and on x86-64 with the SSSE3 UTF-8 check (JSON_VIEW_USE_SSSE3)
 json_test_set_test_options(test-json_view_builder_portable
@@ -21,11 +21,7 @@ foreach(test default noversion)
    target_compile_definitions(abi_config_${test}_all_tags PRIVATE
        JSON_DIAGNOSTICS=1
        JSON_DIAGNOSTIC_POSITIONS=1
-        JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON=1
-        JSON_DISABLE_STREAM_BULK_SCAN=1
-        JSON_DISABLE_UNLOCKED_FILE_IO=1
-        JSON_VIEW_NO_SIMD
-        JSON_VIEW_USE_SSSE3)
+        JSON_USE_LEGACY_DISCARDED_VALUE_COMPARISON=1)
    target_link_libraries(abi_config_${test}_all_tags PRIVATE abi_compat_main)
    add_test(
        NAME test-abi_config_${test}_all_tags
@@ -52,22 +52,6 @@ TEST_CASE("default namespace")
        expected += "_ekmo";
 #endif

-#if JSON_DISABLE_STREAM_BULK_SCAN
-        expected += "_dsbs";
-#endif
-
-#if JSON_DISABLE_UNLOCKED_FILE_IO
-        expected += "_dufio";
-#endif
-
-#ifdef JSON_VIEW_NO_SIMD
-        expected += "_vns";
-#endif
-
-#ifdef JSON_VIEW_USE_SSSE3
-        expected += "_vssse3";
-#endif
-
        expected += "_v" STRINGIZE(NLOHMANN_JSON_VERSION_MAJOR);
        expected += "_" STRINGIZE(NLOHMANN_JSON_VERSION_MINOR);
        expected += "_" STRINGIZE(NLOHMANN_JSON_VERSION_PATCH) "::basic_json";
@@ -53,22 +53,6 @@ TEST_CASE("default namespace without version component")
        expected += "_ekmo";
 #endif

-#if JSON_DISABLE_STREAM_BULK_SCAN
-        expected += "_dsbs";
-#endif
-
-#if JSON_DISABLE_UNLOCKED_FILE_IO
-        expected += "_dufio";
-#endif
-
-#ifdef JSON_VIEW_NO_SIMD
-        expected += "_vns";
-#endif
-
-#ifdef JSON_VIEW_USE_SSSE3
-        expected += "_vssse3";
-#endif
-
        expected += "::basic_json";

        // fallback for Clang
@@ -1 +0,0 @@
-build/
@@ -1,90 +0,0 @@
-# json_view compared with other libraries
-
-The in-tree benchmarks in [`tests/benchmarks`](../README.md) measure `json_document` against `json::parse` only. The
-programs here compare it with [yyjson](https://github.com/ibireme/yyjson),
-[simdjson](https://github.com/simdjson/simdjson), and [Boost.JSON](https://github.com/boostorg/json): the question
-users ask when they pick a library. They are not built by CMake or run by CI.
-
-## Reproducing the numbers
-
-`compare.py` builds the programs against `include/` of this checkout, runs them, and writes the results together with
-everything needed to reproduce them to `results/<date>-<host>.md` (and `.csv`): the date, the commit, the CPU, the
-OS, the compiler, the flags, and the versions of all libraries.
-
-```sh
-python3 tests/benchmarks/json_view/compare.py --data <json_test_data directory> [--native] [--rounds 30]
-```
-
- `--data` is the downloaded [test data](https://github.com/nlohmann/json_test_data), e.g. the `test_files` directory
-  of a CMake build directory. It needs `nativejson-benchmark/{twitter,citm_catalog,canada}.json` and
-  `jeopardy/jeopardy.json`.
- The other libraries come from the system: pkg-config, or Homebrew (`brew install yyjson simdjson boost`). With
-  `--download`, pinned releases are downloaded instead and checked against their SHA-256. Without Boost headers (or
-  with `--no-boost`), the Boost.JSON columns are skipped, and the results say so.
- `--corpus file...` adds files to the corpus benchmark, e.g. those of
-  [simdjson-data](https://github.com/simdjson/simdjson-data) or the
-  [yyjson benchmark](https://github.com/ibireme/yyjson_benchmark).
- Only the Python 3 standard library is used; a C++17 compiler is needed (`CXX` and `CC` are honored).
-
-For numbers worth publishing, use a quiet machine (see [Getting stable numbers](../README.md#getting-stable-numbers)),
-the default 30 rounds or more, and `--native` only if the other libraries were built for the same CPU.
-
-### On GitHub-hosted runners
-
-The workflow [json_view benchmarks](../../../.github/workflows/json_view_benchmarks.yml) runs `compare.py --download`
-on demand: by hand (Actions → "json_view benchmarks" → "Run workflow"), on an x86-64 or AArch64 Ubuntu runner with GCC
-or Clang, or when a pull request gets the label `benchmark`, on both architectures with GCC. The results appear as the
-job summary and as an artifact. Shared runners are noisy, so these numbers show
-where `json_view` stands on another architecture; they are not meant for publication.
-
-## What is measured
-
-`bench_view.cpp` runs four workloads on twitter, citm_catalog, canada, jeopardy, a single tweet (`status`), and a
-JSON-RPC request (`rpc`):
-
-| workload | what it does |
-|---|---|
-| parse | build and free a document |
-| traverse | parse, then visit every value, convert every number, touch every string and key |
-| select | parse, then read a few fields per record (e.g. id, user name, and retweet count of each tweet) |
-| dump | serialize a parsed document (compact) |
-
-`bench_corpus.cpp` runs parse, traverse, and dump on any list of files, so that no library is tuned to a handful of
-documents. Its dump also writes the numbers as they are in the input: `json_view` with `number_format::source`, and
-yyjson with numbers read as raw text (`YYJSON_READ_NUMBER_AS_RAW`), without converting them.
-
-`bench_edit.cpp` measures read-modify-write: parse, apply the same logical edits with each library's own API, and
-serialize (compact). Workloads: `patch` (a handful of edits at fixed places) and `update` (edits in every record).
-An editable `json_document` edits in place; yyjson copies its immutable document into a mutable one first
-(`yyjson_doc_mut_copy`); Boost.JSON and `json::parse` build mutable DOMs; simdjson cannot edit a document. All
-outputs are checked to describe the same value.
-
-Before anything is timed, all engines must accept each document and agree on the traversal: the number of values, the
-bytes of all strings and keys, and the sum of all numbers. All engines run interleaved in every round, and the best
-round is reported, as time and as a factor of the `json_view` time (below 1 means faster than `json_view`). Each timed
-call follows an untimed call of the same engine: otherwise the engine after `json::parse` pays for the allocator
-cleaning up the tens of thousands of nodes `json::parse` just freed (with glibc, this made `json_view` look 1.7 times
-slower on citm_catalog traverse).
-
-The engines do not all offer the same features, which the numbers should be read with:
-
-| engine | document | random access | editable | notes |
-|---|---|---|---|---|
-| `json_view` | immutable index into the text | yes | no | a fresh document per parse; "reused" parses into the same document |
-| yyjson | immutable (`yyjson_read`) | yes | via a mutable copy | |
-| simdjson DOM | immutable, parser reused | yes | no | "fresh" uses a new parser per parse |
-| simdjson On-Demand | none: forward-only, lazy | no | no | only traverse and select |
-| Boost.JSON | owning, mutable DOM | yes | yes | monotonic resource |
-| `json::parse` | owning, mutable DOM | yes | yes | |
-
-Reusing memory matters as much as the parser. simdjson DOM reuses its parser, so it writes into memory it already
-touched; a fresh `json_view` document or yyjson document gets new memory for every parse. On Linux, glibc returns large
-blocks to the system when they are freed, so every fresh parse of a large document pays a page fault per 4 KiB page:
-on x86-64 Linux, a fresh `json_view` parse of jeopardy took about twice as long as a reused one. On macOS on Apple
-silicon, with 16 KiB pages, the difference is much smaller. Compare "json_view (reused)" with "simdjson DOM", and the
-fresh `json_view` with "simdjson DOM (fresh)" and yyjson.
-
-## Published results
-
-Results are only published with the file `compare.py` wrote, which names the machine and the versions; see
-`results/`. Numbers from one machine and compiler do not carry over to another: rerun the script.
@@ -1,348 +0,0 @@
-//     __ _____ _____ _____
-//  __|  |   __|     |   | |  JSON for Modern C++ (supporting code)
-// |  |  |__   |  |  | | | |  version 3.12.0
-// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
-//
-// SPDX-FileCopyrightText: 2013-2026 Niels Lohmann <https://nlohmann.me>
-// SPDX-License-Identifier: MIT
-
-// Corpus benchmark: the read-only workloads of bench_view.cpp on any list of
-// JSON files (for example the benchmark sets of simdjson and yyjson).
-//
-//   ./bench_corpus [--rounds N] file...
-//
-// For every file, all engines must accept it and agree on a traversal (value
-// count, string bytes, sum of numbers) before anything is timed. Workloads:
-// parse (build and free a document), traverse (visit every value, convert
-// every number), dump (compact), and for json_view also dump with the source
-// number text, compared with yyjson writing numbers read as raw text
-// (YYJSON_READ_NUMBER_AS_RAW). Results go to bench_corpus.csv.
-#include <nlohmann/json_view.hpp>
-
-#if JSON_VIEW_BENCH_BOOST
-    #include <boost/json.hpp>
-    #include <boost/json/src.hpp>
-#endif
-#include <simdjson.h>
-#include <yyjson.h>
-
-#include <algorithm>
-#include <chrono>
-#include <cmath>
-#include <cstdio>
-#include <cstdlib>
-#include <cstring>
-#include <fstream>
-#include <functional>
-#include <sstream>
-#include <string>
-#include <vector>
-
-using nlohmann::json;
-using nlohmann::json_document;
-using nlohmann::json_view;
-
-static volatile double g_sink;
-
-struct stats
-{
-    double num = 0;
-    std::size_t str = 0, nodes = 0;
-};
-
-static void walk(json_view v, stats& st)
-{
-    ++st.nodes;
-    switch (v.type())
-    {
-        case json::value_t::object:
-            for (auto it = v.begin(); it != v.end(); ++it)
-            {
-                st.str += it.key().size();
-                walk(*it, st);
-            }
-            break;
-        case json::value_t::array:
-            for (const json_view e : v)
-            {
-                walk(e, st);
-            }
-            break;
-        case json::value_t::string:
-            st.str += v.get_string().size();
-            break;
-        case json::value_t::number_integer:
-            st.num += static_cast<double>(v.get<std::int64_t>());
-            break;
-        case json::value_t::number_unsigned:
-            st.num += static_cast<double>(v.get<std::uint64_t>());
-            break;
-        case json::value_t::number_float:
-            st.num += v.get<double>();
-            break;
-        default:
-            break;
-    }
-}
-
-static void walk(yyjson_val* v, stats& st)
-{
-    ++st.nodes;
-    switch (yyjson_get_type(v))
-    {
-        case YYJSON_TYPE_OBJ:
-        {
-            std::size_t idx, max;
-            yyjson_val* k, * val;
-            yyjson_obj_foreach(v, idx, max, k, val)
-            {
-                st.str += yyjson_get_len(k);
-                walk(val, st);
-            }
-            break;
-        }
-        case YYJSON_TYPE_ARR:
-        {
-            std::size_t idx, max;
-            yyjson_val* val;
-            yyjson_arr_foreach(v, idx, max, val)
-            {
-                walk(val, st);
-            }
-            break;
-        }
-        case YYJSON_TYPE_STR:
-            st.str += yyjson_get_len(v);
-            break;
-        case YYJSON_TYPE_NUM:
-            st.num += yyjson_is_sint(v) ? static_cast<double>(yyjson_get_sint(v)) : yyjson_is_uint(v) ? static_cast<double>(yyjson_get_uint(v)) : yyjson_get_real(v);
-            break;
-        default:
-            break;
-    }
-}
-
-static void walk(simdjson::dom::element e, stats& st)
-{
-    ++st.nodes;
-    switch (e.type())
-    {
-        case simdjson::dom::element_type::OBJECT:
-            for (auto f : simdjson::dom::object(e))
-            {
-                st.str += f.key.size();
-                walk(f.value, st);
-            }
-            break;
-        case simdjson::dom::element_type::ARRAY:
-            for (auto c : simdjson::dom::array(e))
-            {
-                walk(c, st);
-            }
-            break;
-        case simdjson::dom::element_type::STRING:
-            st.str += std::string_view(e).size();
-            break;
-        case simdjson::dom::element_type::INT64:
-            st.num += static_cast<double>(int64_t(e));
-            break;
-        case simdjson::dom::element_type::UINT64:
-            st.num += static_cast<double>(uint64_t(e));
-            break;
-        case simdjson::dom::element_type::DOUBLE:
-            st.num += double(e);
-            break;
-        default:
-            break;
-    }
-}
-
-#if JSON_VIEW_BENCH_BOOST
-static void walk(const boost::json::value& v, stats& st)
-{
-    ++st.nodes;
-    switch (v.kind())
-    {
-        case boost::json::kind::object:
-            for (const auto& kv : v.get_object())
-            {
-                st.str += kv.key().size();
-                walk(kv.value(), st);
-            }
-            break;
-        case boost::json::kind::array:
-            for (const auto& c : v.get_array())
-            {
-                walk(c, st);
-            }
-            break;
-        case boost::json::kind::string:
-            st.str += v.get_string().size();
-            break;
-        case boost::json::kind::int64:
-            st.num += static_cast<double>(v.get_int64());
-            break;
-        case boost::json::kind::uint64:
-            st.num += static_cast<double>(v.get_uint64());
-            break;
-        case boost::json::kind::double_:
-            st.num += v.get_double();
-            break;
-        default:
-            break;
-    }
-}
-#endif
-
-static std::string slurp(const std::string& p)
-{
-    std::ifstream f(p, std::ios::binary);
-    if (!f)
-    {
-        std::fprintf(stderr, "cannot open %s\n", p.c_str());
-        std::exit(1);
-    }
-    std::stringstream ss;
-    ss << f.rdbuf();
-    return ss.str();
-}
-
-static bool same(const stats& a, const stats& b)
-{
-    return a.nodes == b.nodes && a.str == b.str && (a.num == b.num || std::fabs(a.num - b.num) <= 1e-9 * std::fabs(a.num));
-}
-
-int main(int argc, char** argv)
-{
-    int rounds = 0; // 0: by size
-    std::vector<std::string> files;
-    for (int i = 1; i < argc; ++i)
-    {
-        if (std::strcmp(argv[i], "--rounds") == 0 && i + 1 < argc)
-        {
-            // (clamped: 0 rounds by size, at most a million)
-            rounds = static_cast<int>((std::min)((std::max)(std::strtol(argv[++i], nullptr, 10), 0L), 1000000L));
-        }
-        else
-        {
-            files.push_back(argv[i]);
-        }
-    }
-    std::FILE* csv = std::fopen("bench_corpus.csv", "w");
-    if (csv == nullptr)
-    {
-        std::perror("bench_corpus.csv");
-        return 1;
-    }
-    std::fprintf(csv, "file,bytes,workload,engine,ns\n");
-    json_document reused;
-    simdjson::dom::parser sj;
-    for (const auto& path : files)
-    {
-        const std::string s = slurp(path);
-        const std::string name = path.substr(path.rfind('/') + 1);
-        const simdjson::padded_string ps(s);
-
-        // all engines must agree before timing
-        stats a, b, c, d;
-        const json_document doc = json_document::parse(s);
-        walk(doc.root(), a);
-        yyjson_doc* y = yyjson_read(s.data(), s.size(), 0);
-        auto sjr = sj.parse(ps);
-#if JSON_VIEW_BENCH_BOOST
-        boost::json::parse_options opt;
-        opt.numbers = boost::json::number_precision::precise;
-        boost::json::monotonic_resource mr0;
-        const boost::json::value bv = boost::json::parse(s, &mr0, opt);
-#endif
-        if (y == nullptr || sjr.error())
-        {
-            std::printf("%-34s skipped (an engine rejects it)\n", name.c_str());
-            yyjson_doc_free(y);
-            continue;
-        }
-        walk(yyjson_doc_get_root(y), b);
-        walk(sjr.value_unsafe(), c);
-#if JSON_VIEW_BENCH_BOOST
-        walk(bv, d);
-#else
-        d = a;
-#endif
-        yyjson_doc_free(y);
-        const bool ok = same(a, b) && same(a, c) && same(a, d);
-
-        const int r = rounds > 0 ? rounds : static_cast<int>(std::max<std::size_t>(3, std::min<std::size_t>(60, 400000000 / (s.size() + 1))));
-        struct engine
-        {
-            std::string name;
-            std::function<void()> fn;
-        };
-        json_document vd = json_document::parse(s);
-        yyjson_doc* yd = yyjson_read(s.data(), s.size(), 0);
-        yyjson_doc* yd_raw = yyjson_read(s.data(), s.size(), YYJSON_READ_NUMBER_AS_RAW);
-        simdjson::dom::parser sjd;
-        const simdjson::dom::element se = sjd.parse(ps).value_unsafe();
-        const std::vector<std::pair<std::string, std::vector<engine>>> workloads =
-        {
-            {
-                "parse", {
-                    {"json_view", [&] { auto x = json_document::parse(s); g_sink = static_cast<double>(x.node_count()); }},
-                    {"json_view (reused)", [&] { reused.read(s); g_sink = static_cast<double>(reused.node_count()); }},
-                    {"yyjson", [&] { yyjson_doc* x = yyjson_read(s.data(), s.size(), 0); g_sink = static_cast<double>(yyjson_doc_get_val_count(x)); yyjson_doc_free(x); }},
-                    {"simdjson DOM", [&] { auto e = sj.parse(ps).value_unsafe(); g_sink = e.is_object(); }},
-                    {"simdjson DOM (fresh)", [&] { simdjson::dom::parser p; auto e = p.parse(ps).value_unsafe(); g_sink = e.is_object(); }},
-#if JSON_VIEW_BENCH_BOOST
-                    {"Boost.JSON", [&] { boost::json::monotonic_resource mr; auto v = boost::json::parse(s, &mr); g_sink = v.is_object(); }},
-#endif
-                }
-            },
-            {
-                "traverse", {
-                    {"json_view", [&] { auto x = json_document::parse(s); stats st; walk(x.root(), st); g_sink = st.num; }},
-                    {"yyjson", [&] { yyjson_doc* x = yyjson_read(s.data(), s.size(), 0); stats st; walk(yyjson_doc_get_root(x), st); g_sink = st.num; yyjson_doc_free(x); }},
-                    {"simdjson DOM", [&] { stats st; walk(sj.parse(ps).value_unsafe(), st); g_sink = st.num; }},
-#if JSON_VIEW_BENCH_BOOST
-                    {"Boost.JSON", [&] { boost::json::monotonic_resource mr; auto v = boost::json::parse(s, &mr); stats st; walk(v, st); g_sink = st.num; }},
-#endif
-                }
-            },
-            {
-                "dump", {
-                    {"json_view", [&] { std::string o = vd.root().dump(); g_sink = static_cast<double>(o.size()); }},
-                    {"yyjson", [&] { std::size_t n = 0; char* o = yyjson_write(yd, 0, &n); g_sink = static_cast<double>(n); std::free(o); }},
-                    {"simdjson DOM", [&] { std::string o = simdjson::to_string(se); g_sink = static_cast<double>(o.size()); }},
-                    {"json_view (source numbers)", [&] { std::string o = vd.root().dump(-1, ' ', false, json_view::number_format::source); g_sink = static_cast<double>(o.size()); }},
-                    {"yyjson (raw numbers)", [&] { std::size_t n = 0; char* o = yyjson_write(yd_raw, 0, &n); g_sink = static_cast<double>(n); std::free(o); }},
-                }
-            },
-        };
-        std::printf("%-34s %9zu B%s\n", name.c_str(), s.size(), ok ? "" : "  [ENGINES DISAGREE]");
-        for (const auto& wl : workloads)
-        {
-            std::vector<double> best(wl.second.size(), 1e300);
-            for (int i = 0; i < r; ++i)
-            {
-                for (std::size_t k = 0; k < wl.second.size(); ++k)
-                {
-                    // an untimed call first: whatever the previous engine left to the allocator
-                    // (e.g. thousands of freed json nodes) is cleaned up here, not in the timing
-                    wl.second[k].fn();
-                    const auto t0 = std::chrono::steady_clock::now();
-                    wl.second[k].fn();
-                    best[k] = std::min(best[k], std::chrono::duration<double, std::nano>(std::chrono::steady_clock::now() - t0).count());
-                }
-            }
-            std::printf("  %-9s", wl.first.c_str());
-            for (std::size_t k = 0; k < wl.second.size(); ++k)
-            {
-                std::printf("  %s %.2f GB/s (%.2fx)", wl.second[k].name.c_str(), static_cast<double>(s.size()) / best[k], best[k] / best[0]);
-                std::fprintf(csv, "%s,%zu,%s,%s,%.1f\n", name.c_str(), s.size(), wl.first.c_str(), wl.second[k].name.c_str(), best[k]);
-            }
-            std::printf("\n");
-            std::fflush(stdout);
-        }
-        yyjson_doc_free(yd);
-        yyjson_doc_free(yd_raw);
-    }
-    std::fclose(csv);
-}
@@ -1,589 +0,0 @@
-//     __ _____ _____ _____
-//  __|  |   __|     |   | |  JSON for Modern C++ (supporting code)
-// |  |  |__   |  |  | | | |  version 3.12.0
-// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
-//
-// SPDX-FileCopyrightText: 2013-2026 Niels Lohmann <https://nlohmann.me>
-// SPDX-License-Identifier: MIT
-
-// Read-modify-write benchmark: parse a document, apply the same logical edits
-// with each library's own API, and serialize it (compact).
-//
-//   json_view     json_editable_document: edits in place, unchanged values stay in the index
-//   yyjson        yyjson_read + yyjson_doc_mut_copy (the way to edit a parsed document)
-//   Boost.JSON    parse into a mutable DOM (monotonic resource, precise numbers), serialize
-//   json::parse   nlohmann::json today
-// simdjson has no mutable document and is not part of this comparison.
-//
-// Workloads:
-//   patch   a handful of edits at fixed places (scalars, a new member, a new array element)
-//   update  edits in every record (twitter: 100 statuses, citm: 243 performances,
-//           canada: 480 rings, jeopardy: 216,930 questions): set scalars, erase a
-//           member, add a member (canada: replace the first point of every ring)
-//
-// Build: see README.md (same flags as bench_view.cpp).
-#include <nlohmann/json_view.hpp>
-
-#if JSON_VIEW_BENCH_BOOST
-    #include <boost/json.hpp>
-    #include <boost/json/src.hpp>
-#endif
-#include <yyjson.h>
-
-#include <algorithm>
-#include <chrono>
-#include <cstdio>
-#include <cstdlib>
-#include <fstream>
-#include <functional>
-#include <sstream>
-
-using nlohmann::json;
-using nlohmann::json_editable_document;
-using nlohmann::json_editable_view;
-#if JSON_VIEW_BENCH_BOOST
-    namespace bj = boost::json;
-#endif
-
-static volatile std::size_t g_sink;
-
-// ---------------- json_view ----------------
-
-static std::string edit_view(const std::string& name, const std::string& s, bool update)
-{
-    json_editable_document d = json_editable_document::parse(s);
-    const json_editable_view r = d.root();
-    if (name == "twitter")
-    {
-        if (update)
-        {
-            std::int64_t i = 0;
-            for (const json_editable_view st : r["statuses"])
-            {
-                d.set(st, "retweet_count", i++);
-                d.set(st, "favorited", true);
-                d.set(st, "text", "redacted");
-                d.erase(st, "entities");
-                d.set(st, "edited", true);
-            }
-        }
-        else
-        {
-            d.set(r["search_metadata"], "count", 200);
-            d.set(r["statuses"][0], "text", "patched");
-            d.set(r["statuses"][0]["user"], "followers_count", 1);
-            d.set(r["statuses"][99], "favorited", true);
-            d.set(r, "patched", true);
-        }
-    }
-    else if (name == "citm_catalog")
-    {
-        if (update)
-        {
-            for (const json_editable_view p : r["performances"])
-            {
-                d.set(p, "name", "performance");
-                d.set(p, "start", p["start"].get<std::int64_t>() + 1);
-                d.erase(p, "seatMapImage");
-                d.set(p, "edited", true);
-            }
-        }
-        else
-        {
-            d.set(r["events"]["138586341"], "name", "patched");
-            d.set(r["performances"][0], "start", 0);
-            d.set(r["venueNames"], "PLEYEL_PLEYEL", "Salle");
-            d.set(r, "patched", true);
-        }
-    }
-    else if (name == "canada")
-    {
-        const json_editable_view coords = r["features"][0]["geometry"]["coordinates"];
-        if (update)
-        {
-            for (const json_editable_view ring : coords)
-            {
-                d.set(ring, 0, json::array({0.5, 0.5}));
-            }
-        }
-        else
-        {
-            d.set(r["features"][0]["properties"], "name", "patched");
-            d.set(r, "type", "FeatureCollection2");
-            d.set(coords[0], 0, json::array({0.0, 0.0}));
-        }
-    }
-    else if (name == "jeopardy")
-    {
-        if (update)
-        {
-            for (const json_editable_view q : r)
-            {
-                d.set(q, "value", "$1");
-                d.erase(q, "air_date");
-            }
-        }
-        else
-        {
-            d.set(r[0], "value", "$0");
-            d.set(r[100000], "answer", "patched");
-            d.set(r[216929], "round", "x");
-            d.push_back(r, json::object({{"category", "NEW"}, {"value", "$5"}}));
-        }
-    }
-    else if (name == "status")
-    {
-        d.set(r, "retweet_count", 1);
-        d.set(r["user"], "name", "x");
-    }
-    else if (name == "rpc")
-    {
-        d.set(r, "id", 4);
-        d.set(r["params"], "subtrahend", 24);
-    }
-    return r.dump();
-}
-
-// ---------------- nlohmann::json ----------------
-
-static std::string edit_json(const std::string& name, const std::string& s, bool update)
-{
-    json r = json::parse(s);
-    if (name == "twitter")
-    {
-        if (update)
-        {
-            std::int64_t i = 0;
-            for (auto& st : r["statuses"])
-            {
-                st["retweet_count"] = i++;
-                st["favorited"] = true;
-                st["text"] = "redacted";
-                st.erase("entities");
-                st["edited"] = true;
-            }
-        }
-        else
-        {
-            r["search_metadata"]["count"] = 200;
-            r["statuses"][0]["text"] = "patched";
-            r["statuses"][0]["user"]["followers_count"] = 1;
-            r["statuses"][99]["favorited"] = true;
-            r["patched"] = true;
-        }
-    }
-    else if (name == "citm_catalog")
-    {
-        if (update)
-        {
-            for (auto& p : r["performances"])
-            {
-                p["name"] = "performance";
-                p["start"] = p["start"].get<std::int64_t>() + 1;
-                p.erase("seatMapImage");
-                p["edited"] = true;
-            }
-        }
-        else
-        {
-            r["events"]["138586341"]["name"] = "patched";
-            r["performances"][0]["start"] = 0;
-            r["venueNames"]["PLEYEL_PLEYEL"] = "Salle";
-            r["patched"] = true;
-        }
-    }
-    else if (name == "canada")
-    {
-        json& coords = r["features"][0]["geometry"]["coordinates"];
-        if (update)
-        {
-            for (auto& ring : coords)
-            {
-                ring[0] = json::array({0.5, 0.5});
-            }
-        }
-        else
-        {
-            r["features"][0]["properties"]["name"] = "patched";
-            r["type"] = "FeatureCollection2";
-            coords[0][0] = json::array({0.0, 0.0});
-        }
-    }
-    else if (name == "jeopardy")
-    {
-        if (update)
-        {
-            for (auto& q : r)
-            {
-                q["value"] = "$1";
-                q.erase("air_date");
-            }
-        }
-        else
-        {
-            r[0]["value"] = "$0";
-            r[100000]["answer"] = "patched";
-            r[216929]["round"] = "x";
-            r.push_back(json::object({{"category", "NEW"}, {"value", "$5"}}));
-        }
-    }
-    else if (name == "status")
-    {
-        r["retweet_count"] = 1;
-        r["user"]["name"] = "x";
-    }
-    else if (name == "rpc")
-    {
-        r["id"] = 4;
-        r["params"]["subtrahend"] = 24;
-    }
-    return r.dump();
-}
-
-// ---------------- yyjson ----------------
-
-static std::string edit_yyjson(const std::string& name, const std::string& s, bool update)
-{
-    yyjson_doc* idoc = yyjson_read(s.data(), s.size(), 0);
-    yyjson_mut_doc* d = yyjson_doc_mut_copy(idoc, nullptr);
-    yyjson_doc_free(idoc);
-    yyjson_mut_val* r = yyjson_mut_doc_get_root(d);
-    auto get = [](yyjson_mut_val * o, const char* k)
-    {
-        return yyjson_mut_obj_get(o, k);
-    };
-    if (name == "twitter")
-    {
-        yyjson_mut_val* sts = get(r, "statuses");
-        if (update)
-        {
-            std::size_t idx, max;
-            yyjson_mut_val* st;
-            std::int64_t i = 0;
-            yyjson_mut_arr_foreach(sts, idx, max, st)
-            {
-                yyjson_mut_set_sint(get(st, "retweet_count"), i++);
-                yyjson_mut_set_bool(get(st, "favorited"), true);
-                yyjson_mut_set_str(get(st, "text"), "redacted");
-                yyjson_mut_obj_remove_key(st, "entities");
-                yyjson_mut_obj_add_bool(d, st, "edited", true);
-            }
-        }
-        else
-        {
-            yyjson_mut_set_sint(get(get(r, "search_metadata"), "count"), 200);
-            yyjson_mut_val* s0 = yyjson_mut_arr_get(sts, 0);
-            yyjson_mut_set_str(get(s0, "text"), "patched");
-            yyjson_mut_set_sint(get(get(s0, "user"), "followers_count"), 1);
-            yyjson_mut_set_bool(get(yyjson_mut_arr_get(sts, 99), "favorited"), true);
-            yyjson_mut_obj_add_bool(d, r, "patched", true);
-        }
-    }
-    else if (name == "citm_catalog")
-    {
-        if (update)
-        {
-            std::size_t idx, max;
-            yyjson_mut_val* p;
-            yyjson_mut_arr_foreach(get(r, "performances"), idx, max, p)
-            {
-                yyjson_mut_set_str(get(p, "name"), "performance");
-                yyjson_mut_val* start = get(p, "start");
-                yyjson_mut_set_sint(start, yyjson_mut_get_sint(start) + 1);
-                yyjson_mut_obj_remove_key(p, "seatMapImage");
-                yyjson_mut_obj_add_bool(d, p, "edited", true);
-            }
-        }
-        else
-        {
-            yyjson_mut_set_str(get(get(get(r, "events"), "138586341"), "name"), "patched");
-            yyjson_mut_set_sint(get(yyjson_mut_arr_get(get(r, "performances"), 0), "start"), 0);
-            yyjson_mut_set_str(get(get(r, "venueNames"), "PLEYEL_PLEYEL"), "Salle");
-            yyjson_mut_obj_add_bool(d, r, "patched", true);
-        }
-    }
-    else if (name == "canada")
-    {
-        yyjson_mut_val* f0 = yyjson_mut_arr_get(get(r, "features"), 0);
-        yyjson_mut_val* coords = get(get(f0, "geometry"), "coordinates");
-        if (update)
-        {
-            static const double half[2] = {0.5, 0.5};
-            std::size_t idx, max;
-            yyjson_mut_val* ring;
-            yyjson_mut_arr_foreach(coords, idx, max, ring)
-            {
-                yyjson_mut_arr_replace(ring, 0, yyjson_mut_arr_with_real(d, half, 2));
-            }
-        }
-        else
-        {
-            static const double zero[2] = {0.0, 0.0};
-            yyjson_mut_set_str(get(get(f0, "properties"), "name"), "patched");
-            yyjson_mut_set_str(get(r, "type"), "FeatureCollection2");
-            yyjson_mut_arr_replace(yyjson_mut_arr_get(coords, 0), 0, yyjson_mut_arr_with_real(d, zero, 2));
-        }
-    }
-    else if (name == "jeopardy")
-    {
-        if (update)
-        {
-            std::size_t idx, max;
-            yyjson_mut_val* q;
-            yyjson_mut_arr_foreach(r, idx, max, q)
-            {
-                yyjson_mut_set_str(get(q, "value"), "$1");
-                yyjson_mut_obj_remove_key(q, "air_date");
-            }
-        }
-        else
-        {
-            yyjson_mut_set_str(get(yyjson_mut_arr_get(r, 0), "value"), "$0");
-            yyjson_mut_set_str(get(yyjson_mut_arr_get(r, 100000), "answer"), "patched");
-            yyjson_mut_set_str(get(yyjson_mut_arr_get(r, 216929), "round"), "x");
-            yyjson_mut_val* o = yyjson_mut_obj(d);
-            yyjson_mut_obj_add_str(d, o, "category", "NEW");
-            yyjson_mut_obj_add_str(d, o, "value", "$5");
-            yyjson_mut_arr_append(r, o);
-        }
-    }
-    else if (name == "status")
-    {
-        yyjson_mut_set_sint(get(r, "retweet_count"), 1);
-        yyjson_mut_set_str(get(get(r, "user"), "name"), "x");
-    }
-    else if (name == "rpc")
-    {
-        yyjson_mut_set_sint(get(r, "id"), 4);
-        yyjson_mut_set_sint(get(get(r, "params"), "subtrahend"), 24);
-    }
-    std::size_t n = 0;
-    char* out = yyjson_mut_write(d, 0, &n);
-    std::string result(out, n);
-    std::free(out);
-    yyjson_mut_doc_free(d);
-    return result;
-}
-
-#if JSON_VIEW_BENCH_BOOST
-// ---------------- Boost.JSON ----------------
-
-static std::string edit_boost(const std::string& name, const std::string& s, bool update)
-{
-    bj::monotonic_resource mr;
-    bj::parse_options opt;
-    opt.numbers = bj::number_precision::precise; // correctly rounded, like the others
-    bj::value v = bj::parse(s, &mr, opt);
-    bj::object* const obj = v.if_object(); // nullptr for jeopardy (an array)
-    if (name == "twitter")
-    {
-        bj::array& sts = (*obj)["statuses"].as_array();
-        if (update)
-        {
-            std::int64_t i = 0;
-            for (auto& e : sts)
-            {
-                bj::object& st = e.as_object();
-                st["retweet_count"] = i++;
-                st["favorited"] = true;
-                st["text"] = "redacted";
-                st.erase("entities");
-                st["edited"] = true;
-            }
-        }
-        else
-        {
-            (*obj)["search_metadata"].as_object()["count"] = 200;
-            bj::object& s0 = sts[0].as_object();
-            s0["text"] = "patched";
-            s0["user"].as_object()["followers_count"] = 1;
-            sts[99].as_object()["favorited"] = true;
-            (*obj)["patched"] = true;
-        }
-    }
-    else if (name == "citm_catalog")
-    {
-        if (update)
-        {
-            for (auto& e : (*obj)["performances"].as_array())
-            {
-                bj::object& p = e.as_object();
-                p["name"] = "performance";
-                p["start"] = p["start"].as_int64() + 1;
-                p.erase("seatMapImage");
-                p["edited"] = true;
-            }
-        }
-        else
-        {
-            (*obj)["events"].as_object()["138586341"].as_object()["name"] = "patched";
-            (*obj)["performances"].as_array()[0].as_object()["start"] = 0;
-            (*obj)["venueNames"].as_object()["PLEYEL_PLEYEL"] = "Salle";
-            (*obj)["patched"] = true;
-        }
-    }
-    else if (name == "canada")
-    {
-        bj::object& f0 = (*obj)["features"].as_array()[0].as_object();
-        bj::array& coords = f0["geometry"].as_object()["coordinates"].as_array();
-        if (update)
-        {
-            for (auto& ring : coords)
-            {
-                ring.as_array()[0] = bj::array({0.5, 0.5});
-            }
-        }
-        else
-        {
-            f0["properties"].as_object()["name"] = "patched";
-            (*obj)["type"] = "FeatureCollection2";
-            coords[0].as_array()[0] = bj::array({0.0, 0.0});
-        }
-    }
-    else if (name == "jeopardy")
-    {
-        bj::array& a = v.as_array();
-        if (update)
-        {
-            for (auto& e : a)
-            {
-                bj::object& q = e.as_object();
-                q["value"] = "$1";
-                q.erase("air_date");
-            }
-        }
-        else
-        {
-            a[0].as_object()["value"] = "$0";
-            a[100000].as_object()["answer"] = "patched";
-            a[216929].as_object()["round"] = "x";
-            a.push_back(bj::object({{"category", "NEW"}, {"value", "$5"}}));
-        }
-    }
-    else if (name == "status")
-    {
-        (*obj)["retweet_count"] = 1;
-        (*obj)["user"].as_object()["name"] = "x";
-    }
-    else if (name == "rpc")
-    {
-        (*obj)["id"] = 4;
-        (*obj)["params"].as_object()["subtrahend"] = 24;
-    }
-    return bj::serialize(v);
-}
-#endif
-
-// ---------------- harness ----------------
-
-static std::string slurp(const std::string& p)
-{
-    std::ifstream f(p, std::ios::binary);
-    if (!f)
-    {
-        std::fprintf(stderr, "cannot open %s\n", p.c_str());
-        std::exit(1);
-    }
-    std::stringstream ss;
-    ss << f.rdbuf();
-    return ss.str();
-}
-
-int main(int argc, char** argv)
-{
-    if (argc < 2)
-    {
-        std::fprintf(stderr, "usage: %s <json_test_data directory> [rounds] [document]\n", argv[0]);
-        return 1;
-    }
-    const std::string T = std::string(argv[1]) + "/";
-    // (clamped to 1 to a million)
-    const int rounds = argc > 2 ? static_cast<int>((std::min)((std::max)(std::strtol(argv[2], nullptr, 10), 1L), 1000000L)) : 20;
-    const std::string only = argc > 3 ? argv[3] : "";
-    struct doc
-    {
-        std::string name, text;
-        int batch;
-    };
-    std::vector<doc> docs;
-    for (const char* f :
-            {"nativejson-benchmark/twitter.json", "nativejson-benchmark/citm_catalog.json", "nativejson-benchmark/canada.json", "jeopardy/jeopardy.json"
-            })
-    {
-        std::string n = std::string(f).substr(std::string(f).find('/') + 1);
-        docs.push_back({n.substr(0, n.size() - 5), slurp(T + f), 1});
-    }
-    docs.push_back({"status", json::parse(docs[0].text)["statuses"][0].dump(), 200});
-    docs.push_back({"rpc", R"({"jsonrpc": "2.0", "method": "subtract", "params": {"minuend": 42, "subtrahend": 23}, "id": 3})", 5000});
-
-    using fn = std::string (*)(const std::string&, const std::string&, bool);
-    const std::vector<std::pair<std::string, fn>> engines =
-    {
-        {"json_view", edit_view}, {"yyjson", edit_yyjson},
-#if JSON_VIEW_BENCH_BOOST
-        {"Boost.JSON", edit_boost},
-#endif
-        {"json::parse", edit_json}
-    };
-
-    std::FILE* csv = std::fopen("bench_edit.csv", "w");
-    if (csv == nullptr)
-    {
-        std::perror("bench_edit.csv");
-        return 1;
-    }
-    std::fprintf(csv, "doc,bytes,workload,engine,ns\n");
-    for (const auto& dc : docs)
-    {
-        if (!only.empty() && dc.name != only)
-        {
-            continue;
-        }
-        for (const bool update :
-                {
-                    false, true
-                })
-        {
-            if (update && (dc.name == "status" || dc.name == "rpc"))
-            {
-                continue;
-            }
-            // all engines must produce the same value
-            const json expected = json::parse(edit_json(dc.name, dc.text, update));
-            bool ok = true;
-            for (const auto& e : engines)
-            {
-                ok = ok && json::parse(e.second(dc.name, dc.text, update)) == expected;
-            }
-            std::vector<double> best(engines.size(), 1e300);
-            const int r = dc.text.size() > 10000000 ? std::max(3, rounds / 4) : rounds;
-            for (int i = 0; i < r; ++i)
-            {
-                for (std::size_t k = 0; k < engines.size(); ++k)
-                {
-                    // an untimed call first: whatever the previous engine left to the allocator
-                    // (e.g. thousands of freed json nodes) is cleaned up here, not in the timing
-                    g_sink = engines[k].second(dc.name, dc.text, update).size();
-                    const auto t0 = std::chrono::steady_clock::now();
-                    for (int b = 0; b < dc.batch; ++b)
-                    {
-                        g_sink = engines[k].second(dc.name, dc.text, update).size();
-                    }
-                    const double ns = std::chrono::duration<double, std::nano>(std::chrono::steady_clock::now() - t0).count() / dc.batch;
-                    best[k] = std::min(best[k], ns);
-                }
-            }
-            const char* wl = update ? "update" : "patch";
-            std::printf("%-13s %-7s %s", dc.name.c_str(), wl, ok ? "" : "[OUTPUT MISMATCH] ");
-            for (std::size_t k = 0; k < engines.size(); ++k)
-            {
-                const double us = best[k] / 1e3;
-                std::printf("  %s %.*fus (%.2fx)", engines[k].first.c_str(), us < 10 ? 3 : (us < 1000 ? 1 : 0), us, best[k] / best[0]);
-                std::fprintf(csv, "%s,%zu,%s,%s,%.1f\n", dc.name.c_str(), dc.text.size(), wl, engines[k].first.c_str(), best[k]);
-            }
-            std::printf("\n");
-            std::fflush(stdout);
-        }
-    }
-    std::fclose(csv);
-}
@@ -1,755 +0,0 @@
-//     __ _____ _____ _____
-//  __|  |   __|     |   | |  JSON for Modern C++ (supporting code)
-// |  |  |__   |  |  | | | |  version 3.12.0
-// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
-//
-// SPDX-FileCopyrightText: 2013-2026 Niels Lohmann <https://nlohmann.me>
-// SPDX-License-Identifier: MIT
-
-// Same-feature-set benchmark: read-only JSON documents with random access.
-//
-//   json_view      nlohmann/json_view.hpp (fresh document per parse / reused)
-//   yyjson         yyjson_read(): immutable document, random access
-//   simdjson DOM   dom::parser (reused, as recommended; "fresh": a new parser
-//                  per parse): immutable, random access
-// references (different feature sets):
-//   simdjson OD    On-Demand: forward-only, lazy
-//   Boost.JSON     owning, mutable DOM (monotonic resource)
-//   json::parse    owning, mutable DOM (nlohmann today)
-//
-// Workloads: parse (build + free), traverse (visit everything, convert every
-// number, touch every string and key), select (a few fields per document),
-// dump (compact serialization of the parsed document).
-// All engines run interleaved in every round, each timed call after an untimed
-// one of the same engine; the best round is reported.
-#include <nlohmann/json_view.hpp>
-
-#if JSON_VIEW_BENCH_BOOST
-    #include <boost/json.hpp>
-    #include <boost/json/src.hpp>
-#endif
-#include <simdjson.h>
-#include <yyjson.h>
-
-#include <algorithm>
-#include <chrono>
-#include <cmath>
-#include <cstdio>
-#include <cstdlib>
-#include <fstream>
-#include <functional>
-#include <map>
-#include <sstream>
-
-using nlohmann::json;
-using nlohmann::json_document;
-using nlohmann::json_view;
-
-static volatile double g_sink;
-
-struct stats
-{
-    double num = 0;
-    std::size_t str = 0, nodes = 0;
-};
-
-// ---------------- traversal ----------------
-
-static void walk(json_view v, stats& st)
-{
-    ++st.nodes;
-    switch (v.type())
-    {
-        case json::value_t::object:
-            for (auto it = v.begin(); it != v.end(); ++it)
-            {
-                st.str += it.key().size();
-                walk(*it, st);
-            }
-            break;
-        case json::value_t::array:
-            for (const json_view e : v)
-            {
-                walk(e, st);
-            }
-            break;
-        case json::value_t::string:
-            st.str += v.get_string().size();
-            break;
-        case json::value_t::number_integer:
-            st.num += static_cast<double>(v.get<std::int64_t>());
-            break;
-        case json::value_t::number_unsigned:
-            st.num += static_cast<double>(v.get<std::uint64_t>());
-            break;
-        case json::value_t::number_float:
-            st.num += v.get<double>();
-            break;
-        default:
-            break;
-    }
-}
-
-static void walk(const json& j, stats& st)
-{
-    ++st.nodes;
-    switch (j.type())
-    {
-        case json::value_t::object:
-            for (const auto& kv : j.get_ref<const json::object_t&>())
-            {
-                st.str += kv.first.size();
-                walk(kv.second, st);
-            }
-            break;
-        case json::value_t::array:
-            for (const auto& e : j.get_ref<const json::array_t&>())
-            {
-                walk(e, st);
-            }
-            break;
-        case json::value_t::string:
-            st.str += j.get_ref<const std::string&>().size();
-            break;
-        case json::value_t::number_integer:
-            st.num += static_cast<double>(*j.get_ptr<const json::number_integer_t*>());
-            break;
-        case json::value_t::number_unsigned:
-            st.num += static_cast<double>(*j.get_ptr<const json::number_unsigned_t*>());
-            break;
-        case json::value_t::number_float:
-            st.num += *j.get_ptr<const json::number_float_t*>();
-            break;
-        default:
-            break;
-    }
-}
-
-static void walk(yyjson_val* v, stats& st)
-{
-    ++st.nodes;
-    switch (yyjson_get_type(v))
-    {
-        case YYJSON_TYPE_OBJ:
-        {
-            std::size_t idx, max;
-            yyjson_val* k, * val;
-            yyjson_obj_foreach(v, idx, max, k, val)
-            {
-                st.str += yyjson_get_len(k);
-                walk(val, st);
-            }
-            break;
-        }
-        case YYJSON_TYPE_ARR:
-        {
-            std::size_t idx, max;
-            yyjson_val* val;
-            yyjson_arr_foreach(v, idx, max, val)
-            {
-                walk(val, st);
-            }
-            break;
-        }
-        case YYJSON_TYPE_STR:
-            st.str += yyjson_get_len(v);
-            break;
-        case YYJSON_TYPE_NUM:
-            if (yyjson_is_sint(v))
-            {
-                st.num += static_cast<double>(yyjson_get_sint(v));
-            }
-            else if (yyjson_is_uint(v))
-            {
-                st.num += static_cast<double>(yyjson_get_uint(v));
-            }
-            else
-            {
-                st.num += yyjson_get_real(v);
-            }
-            break;
-        default:
-            break;
-    }
-}
-
-static void walk(simdjson::dom::element e, stats& st)
-{
-    ++st.nodes;
-    switch (e.type())
-    {
-        case simdjson::dom::element_type::OBJECT:
-            for (auto f : simdjson::dom::object(e))
-            {
-                st.str += f.key.size();
-                walk(f.value, st);
-            }
-            break;
-        case simdjson::dom::element_type::ARRAY:
-            for (auto c : simdjson::dom::array(e))
-            {
-                walk(c, st);
-            }
-            break;
-        case simdjson::dom::element_type::STRING:
-            st.str += std::string_view(e).size();
-            break;
-        case simdjson::dom::element_type::INT64:
-            st.num += static_cast<double>(int64_t(e));
-            break;
-        case simdjson::dom::element_type::UINT64:
-            st.num += static_cast<double>(uint64_t(e));
-            break;
-        case simdjson::dom::element_type::DOUBLE:
-            st.num += double(e);
-            break;
-        default:
-            break;
-    }
-}
-
-static void walk_od(simdjson::ondemand::value v, stats& st)
-{
-    ++st.nodes;
-    switch (v.type())
-    {
-        case simdjson::ondemand::json_type::object:
-            for (auto f : v.get_object())
-            {
-                st.str += std::string_view(f.unescaped_key()).size();
-                walk_od(f.value(), st);
-            }
-            break;
-        case simdjson::ondemand::json_type::array:
-            for (auto c : v.get_array())
-            {
-                walk_od(c.value(), st);
-            }
-            break;
-        case simdjson::ondemand::json_type::string:
-            st.str += std::string_view(v.get_string()).size();
-            break;
-        case simdjson::ondemand::json_type::number:
-        {
-            simdjson::ondemand::number n = v.get_number();
-            switch (n.get_number_type())
-            {
-                case simdjson::ondemand::number_type::signed_integer:
-                    st.num += static_cast<double>(n.get_int64());
-                    break;
-                case simdjson::ondemand::number_type::unsigned_integer:
-                    st.num += static_cast<double>(n.get_uint64());
-                    break;
-                default:
-                    st.num += n.get_double();
-                    break;
-            }
-            break;
-        }
-        case simdjson::ondemand::json_type::boolean:
-            (void)bool(v.get_bool());
-            break;
-        default:
-            (void)v.is_null();
-            break;
-    }
-}
-
-#if JSON_VIEW_BENCH_BOOST
-static void walk(const boost::json::value& v, stats& st)
-{
-    ++st.nodes;
-    switch (v.kind())
-    {
-        case boost::json::kind::object:
-            for (const auto& kv : v.get_object())
-            {
-                st.str += kv.key().size();
-                walk(kv.value(), st);
-            }
-            break;
-        case boost::json::kind::array:
-            for (const auto& c : v.get_array())
-            {
-                walk(c, st);
-            }
-            break;
-        case boost::json::kind::string:
-            st.str += v.get_string().size();
-            break;
-        case boost::json::kind::int64:
-            st.num += static_cast<double>(v.get_int64());
-            break;
-        case boost::json::kind::uint64:
-            st.num += static_cast<double>(v.get_uint64());
-            break;
-        case boost::json::kind::double_:
-            st.num += v.get_double();
-            break;
-        default:
-            break;
-    }
-}
-#endif
-
-// ---------------- selective access ----------------
-// twitter: per status id, user.screen_name, retweet_count
-// citm: per performance id, eventId, #seatCategories; #events
-// canada: type, features[0].geometry.type, #coordinates
-// jeopardy: per question: round == "Final Jeopardy!", len(category)
-// status (one tweet): id, user.screen_name, retweet_count
-// rpc: method, params.minuend, id
-
-static double pick(const std::string& name, json_view r)
-{
-    double acc = 0;
-    if (name == "twitter" || name == "status")
-    {
-        auto one = [&](json_view s)
-        {
-            acc += static_cast<double>(s["id"].get<std::uint64_t>());
-            acc += static_cast<double>(s["user"]["screen_name"].get_string().size());
-            acc += static_cast<double>(s["retweet_count"].get<std::int64_t>());
-        };
-        if (name == "twitter")
-        {
-            for (const json_view s : r["statuses"])
-            {
-                one(s);
-            }
-        }
-        else
-        {
-            one(r);
-        }
-    }
-    else if (name == "citm_catalog")
-    {
-        for (const json_view p : r["performances"])
-        {
-            acc += static_cast<double>(p["id"].get<std::uint64_t>() + p["eventId"].get<std::uint64_t>() + p["seatCategories"].size());
-        }
-        acc += static_cast<double>(r["events"].size());
-    }
-    else if (name == "canada")
-    {
-        const json_view g = r["features"][0]["geometry"];
-        acc += static_cast<double>(r["type"].get_string().size() + g["type"].get_string().size() + g["coordinates"].size());
-    }
-    else if (name == "jeopardy")
-    {
-        for (const json_view q : r)
-        {
-            acc += q["round"].get_string() == "Final Jeopardy!" ? 1 : 0;
-            acc += static_cast<double>(q["category"].get_string().size());
-        }
-    }
-    else if (name == "rpc")
-    {
-        acc += static_cast<double>(r["method"].get_string().size());
-        acc += static_cast<double>(r["params"]["minuend"].get<std::int64_t>() + r["id"].get<std::int64_t>());
-    }
-    return acc;
-}
-
-static double pick(const std::string& name, const json& r)
-{
-    double acc = 0;
-    if (name == "twitter" || name == "status")
-    {
-        auto one = [&](const json & s)
-        {
-            acc += static_cast<double>(s["id"].get<std::uint64_t>());
-            acc += static_cast<double>(s["user"]["screen_name"].get_ref<const std::string&>().size());
-            acc += static_cast<double>(s["retweet_count"].get<std::int64_t>());
-        };
-        if (name == "twitter")
-        {
-            for (const auto& s : r["statuses"])
-            {
-                one(s);
-            }
-        }
-        else
-        {
-            one(r);
-        }
-    }
-    else if (name == "citm_catalog")
-    {
-        for (const auto& p : r["performances"])
-        {
-            acc += static_cast<double>(p["id"].get<std::uint64_t>() + p["eventId"].get<std::uint64_t>() + p["seatCategories"].size());
-        }
-        acc += static_cast<double>(r["events"].size());
-    }
-    else if (name == "canada")
-    {
-        const json& g = r["features"][0]["geometry"];
-        acc += static_cast<double>(r["type"].get_ref<const std::string&>().size() + g["type"].get_ref<const std::string&>().size() + g["coordinates"].size());
-    }
-    else if (name == "jeopardy")
-    {
-        for (const auto& q : r)
-        {
-            acc += q["round"].get_ref<const std::string&>() == "Final Jeopardy!" ? 1 : 0;
-            acc += static_cast<double>(q["category"].get_ref<const std::string&>().size());
-        }
-    }
-    else if (name == "rpc")
-    {
-        acc += static_cast<double>(r["method"].get_ref<const std::string&>().size());
-        acc += static_cast<double>(r["params"]["minuend"].get<std::int64_t>() + r["id"].get<std::int64_t>());
-    }
-    return acc;
-}
-
-static double pick(const std::string& name, yyjson_val* r)
-{
-    double acc = 0;
-    auto get = [](yyjson_val * o, const char* k)
-    {
-        return yyjson_obj_get(o, k);
-    };
-    if (name == "twitter" || name == "status")
-    {
-        auto one = [&](yyjson_val * s)
-        {
-            acc += static_cast<double>(yyjson_get_uint(get(s, "id")));
-            acc += static_cast<double>(yyjson_get_len(get(get(s, "user"), "screen_name")));
-            acc += static_cast<double>(yyjson_get_sint(get(s, "retweet_count")));
-        };
-        if (name == "twitter")
-        {
-            std::size_t idx, max;
-            yyjson_val* s;
-            yyjson_arr_foreach(get(r, "statuses"), idx, max, s)
-            {
-                one(s);
-            }
-        }
-        else
-        {
-            one(r);
-        }
-    }
-    else if (name == "citm_catalog")
-    {
-        std::size_t idx, max;
-        yyjson_val* p;
-        yyjson_arr_foreach(get(r, "performances"), idx, max, p)
-        {
-            acc += static_cast<double>(yyjson_get_uint(get(p, "id")) + yyjson_get_uint(get(p, "eventId")) + yyjson_arr_size(get(p, "seatCategories")));
-        }
-        acc += static_cast<double>(yyjson_obj_size(get(r, "events")));
-    }
-    else if (name == "canada")
-    {
-        yyjson_val* g = get(yyjson_arr_get(get(r, "features"), 0), "geometry");
-        acc += static_cast<double>(yyjson_get_len(get(r, "type")) + yyjson_get_len(get(g, "type")) + yyjson_arr_size(get(g, "coordinates")));
-    }
-    else if (name == "jeopardy")
-    {
-        std::size_t idx, max;
-        yyjson_val* q;
-        yyjson_arr_foreach(r, idx, max, q)
-        {
-            acc += yyjson_equals_str(get(q, "round"), "Final Jeopardy!") ? 1 : 0;
-            acc += static_cast<double>(yyjson_get_len(get(q, "category")));
-        }
-    }
-    else if (name == "rpc")
-    {
-        acc += static_cast<double>(yyjson_get_len(get(r, "method")));
-        acc += static_cast<double>(yyjson_get_sint(get(get(r, "params"), "minuend")) + yyjson_get_sint(get(r, "id")));
-    }
-    return acc;
-}
-
-static double pick(const std::string& name, simdjson::dom::element r)
-{
-    double acc = 0;
-    if (name == "twitter" || name == "status")
-    {
-        auto one = [&](simdjson::dom::element s)
-        {
-            acc += static_cast<double>(uint64_t(s["id"]));
-            acc += static_cast<double>(std::string_view(s["user"]["screen_name"]).size());
-            acc += static_cast<double>(int64_t(s["retweet_count"]));
-        };
-        if (name == "twitter")
-        {
-            for (auto s : simdjson::dom::array(r["statuses"]))
-            {
-                one(s);
-            }
-        }
-        else
-        {
-            one(r);
-        }
-    }
-    else if (name == "citm_catalog")
-    {
-        for (auto p : simdjson::dom::array(r["performances"]))
-        {
-            acc += static_cast<double>(uint64_t(p["id"]) + uint64_t(p["eventId"]) + simdjson::dom::array(p["seatCategories"]).size());
-        }
-        acc += static_cast<double>(simdjson::dom::object(r["events"]).size());
-    }
-    else if (name == "canada")
-    {
-        auto g = r["features"].at(0)["geometry"];
-        acc += static_cast<double>(std::string_view(r["type"]).size() + std::string_view(g["type"]).size() + simdjson::dom::array(g["coordinates"]).size());
-    }
-    else if (name == "jeopardy")
-    {
-        for (auto q : simdjson::dom::array(r))
-        {
-            acc += std::string_view(q["round"]) == "Final Jeopardy!" ? 1 : 0;
-            acc += static_cast<double>(std::string_view(q["category"]).size());
-        }
-    }
-    else if (name == "rpc")
-    {
-        acc += static_cast<double>(std::string_view(r["method"]).size());
-        acc += static_cast<double>(int64_t(r["params"]["minuend"]) + int64_t(r["id"]));
-    }
-    return acc;
-}
-
-static double pick_od(const std::string& name, simdjson::ondemand::document& d)
-{
-    double acc = 0;
-    if (name == "twitter" || name == "status")
-    {
-        auto one = [&](simdjson::ondemand::object s)
-        {
-            acc += static_cast<double>(uint64_t(s["id"]));
-            acc += static_cast<double>(std::string_view(s["user"]["screen_name"]).size());
-            acc += static_cast<double>(int64_t(s["retweet_count"]));
-        };
-        if (name == "twitter")
-        {
-            for (auto s : d["statuses"])
-            {
-                one(s.get_object());
-            }
-        }
-        else
-        {
-            one(d.get_object());
-        }
-    }
-    else if (name == "citm_catalog")
-    {
-        simdjson::ondemand::object ev = d["events"].get_object();
-        acc += static_cast<double>(ev.count_fields());
-        for (auto p : d["performances"])
-        {
-            simdjson::ondemand::object o = p.get_object();
-            const auto a = uint64_t(o["eventId"]) + uint64_t(o["id"]);
-            simdjson::ondemand::array sc = o["seatCategories"].get_array();
-            acc += static_cast<double>(a + sc.count_elements());
-        }
-    }
-    else if (name == "canada")
-    {
-        acc += static_cast<double>(std::string_view(d["type"]).size());
-        auto g = d["features"].at(0)["geometry"];
-        acc += static_cast<double>(std::string_view(g["type"]).size());
-        simdjson::ondemand::array co = g["coordinates"].get_array();
-        acc += static_cast<double>(co.count_elements());
-    }
-    else if (name == "jeopardy")
-    {
-        for (auto q : d)
-        {
-            simdjson::ondemand::object o = q.get_object();
-            acc += static_cast<double>(std::string_view(o["category"]).size());
-            acc += std::string_view(o["round"]) == "Final Jeopardy!" ? 1 : 0;
-        }
-    }
-    else if (name == "rpc")
-    {
-        acc += static_cast<double>(std::string_view(d["method"]).size());
-        acc += static_cast<double>(int64_t(d["params"]["minuend"]));
-        acc += static_cast<double>(int64_t(d["id"]));
-    }
-    return acc;
-}
-
-// ---------------- harness ----------------
-
-static std::string slurp(const std::string& p)
-{
-    std::ifstream f(p, std::ios::binary);
-    if (!f)
-    {
-        std::fprintf(stderr, "cannot open %s\n", p.c_str());
-        std::exit(1);
-    }
-    std::stringstream ss;
-    ss << f.rdbuf();
-    return ss.str();
-}
-
-struct engine
-{
-    std::string name;
-    std::function<void()> fn;
-};
-
-int main(int argc, char** argv)
-{
-    if (argc < 2)
-    {
-        std::fprintf(stderr, "usage: %s <json_test_data directory> [rounds] [document]\n", argv[0]);
-        return 1;
-    }
-    const std::string T = std::string(argv[1]) + "/";
-    // (clamped to 1 to a million)
-    const int rounds = argc > 2 ? static_cast<int>((std::min)((std::max)(std::strtol(argv[2], nullptr, 10), 1L), 1000000L)) : 30;
-    const std::string only = argc > 3 ? argv[3] : "";
-    struct doc
-    {
-        std::string name, text;
-        int batch;
-    };
-    std::vector<doc> docs;
-    for (const char* f :
-            {"nativejson-benchmark/twitter.json", "nativejson-benchmark/citm_catalog.json", "nativejson-benchmark/canada.json", "jeopardy/jeopardy.json"
-            })
-    {
-        std::string n = std::string(f).substr(std::string(f).find('/') + 1);
-        docs.push_back({n.substr(0, n.size() - 5), slurp(T + f), 1});
-    }
-    docs.push_back({"status", json::parse(docs[0].text)["statuses"][0].dump(), 200});
-    docs.push_back({"rpc", R"({"jsonrpc": "2.0", "method": "subtract", "params": {"minuend": 42, "subtrahend": 23}, "id": 3})", 5000});
-
-    // correctness cross-check of the workloads
-    for (const auto& dc : docs)
-    {
-        stats a, b, c, dd;
-        walk(json::parse(dc.text), a);
-        auto d = json_document::parse(dc.text);
-        walk(d.root(), b);
-        yyjson_doc* y = yyjson_read(dc.text.data(), dc.text.size(), 0);
-        walk(yyjson_doc_get_root(y), c);
-        simdjson::dom::parser p;
-        walk(p.parse(dc.text).value(), dd);
-        const bool ok = a.nodes == b.nodes && a.nodes == c.nodes && a.nodes == dd.nodes && a.str == b.str && a.str == c.str && a.str == dd.str
-                        && std::fabs(a.num - b.num) <= 1e-9 * std::fabs(a.num) && std::fabs(a.num - c.num) <= 1e-9 * std::fabs(a.num);
-        const double pa = pick(dc.name, json::parse(dc.text)), pb = pick(dc.name, d.root()), pc = pick(dc.name, yyjson_doc_get_root(y)), pd = pick(dc.name, p.parse(dc.text).value());
-        std::printf("check %-13s traverse %s select %s\n", dc.name.c_str(), ok ? "OK" : "MISMATCH", (pa == pb && pa == pc && pa == pd) ? "OK" : "MISMATCH");
-        yyjson_doc_free(y);
-    }
-
-    std::FILE* csv = std::fopen("bench_view.csv", "w");
-    if (csv == nullptr)
-    {
-        std::perror("bench_view.csv");
-        return 1;
-    }
-    std::fprintf(csv, "doc,bytes,workload,engine,ns\n");
-    json_document reused;
-    simdjson::dom::parser sj;
-    simdjson::ondemand::parser od;
-    for (const auto& dc : docs)
-    {
-        if (!only.empty() && dc.name != only)
-        {
-            continue;
-        }
-        const std::string& s = dc.text;
-        const simdjson::padded_string ps(s);
-        const std::string name = dc.name;
-        std::vector<std::pair<std::string, std::vector<engine>>> workloads;
-
-        workloads.push_back({"parse", {
-                {"json_view", [&] { auto d = json_document::parse(s); g_sink = static_cast<double>(d.node_count()); }},
-                {"json_view (reused)", [&] { reused.read(s); g_sink = static_cast<double>(reused.node_count()); }},
-                {"yyjson", [&] { yyjson_doc* d = yyjson_read(s.data(), s.size(), 0); g_sink = static_cast<double>(yyjson_doc_get_val_count(d)); yyjson_doc_free(d); }},
-                {"simdjson DOM", [&] { auto e = sj.parse(ps).value_unsafe(); g_sink = e.is_object(); }},
-                {"simdjson DOM (fresh)", [&] { simdjson::dom::parser p; auto e = p.parse(ps).value_unsafe(); g_sink = e.is_object(); }},
-#if JSON_VIEW_BENCH_BOOST
-                {"Boost.JSON", [&] { boost::json::monotonic_resource mr; auto v = boost::json::parse(s, &mr); g_sink = v.is_object(); }},
-#endif
-                {"json::parse", [&] { json j = json::parse(s); g_sink = static_cast<double>(j.size()); }},
-            }});
-        workloads.push_back({"traverse", {
-                {"json_view", [&] { auto d = json_document::parse(s); stats st; walk(d.root(), st); g_sink = st.num; }},
-                {"json_view (reused)", [&] { reused.read(s); stats st; walk(reused.root(), st); g_sink = st.num; }},
-                {"yyjson", [&] { yyjson_doc* d = yyjson_read(s.data(), s.size(), 0); stats st; walk(yyjson_doc_get_root(d), st); g_sink = st.num; yyjson_doc_free(d); }},
-                {"simdjson DOM", [&] { stats st; walk(sj.parse(ps).value_unsafe(), st); g_sink = st.num; }},
-                {"simdjson OD", [&] { auto d = od.iterate(ps).value_unsafe(); stats st; walk_od(d.get_value().value_unsafe(), st); g_sink = st.num; }},
-#if JSON_VIEW_BENCH_BOOST
-                {"Boost.JSON", [&] { boost::json::monotonic_resource mr; auto v = boost::json::parse(s, &mr); stats st; walk(v, st); g_sink = st.num; }},
-#endif
-                {"json::parse", [&] { json j = json::parse(s); stats st; walk(j, st); g_sink = st.num; }},
-            }});
-        workloads.push_back({"select", {
-                {"json_view", [&] { auto d = json_document::parse(s); g_sink = pick(name, d.root()); }},
-                {"json_view (reused)", [&] { reused.read(s); g_sink = pick(name, reused.root()); }},
-                {"yyjson", [&] { yyjson_doc* d = yyjson_read(s.data(), s.size(), 0); g_sink = pick(name, yyjson_doc_get_root(d)); yyjson_doc_free(d); }},
-                {"simdjson DOM", [&] { g_sink = pick(name, sj.parse(ps).value_unsafe()); }},
-                {"simdjson OD", [&] { auto d = od.iterate(ps).value_unsafe(); g_sink = pick_od(name, d); }},
-                {"json::parse", [&] { json j = json::parse(s); g_sink = pick(name, j); }},
-            }});
-        {
-            // serialization of an already parsed document
-            static json_document vd;
-            vd.read(s);
-            static yyjson_doc* yd = nullptr;
-            if (yd)
-            {
-                yyjson_doc_free(yd);
-            }
-            yd = yyjson_read(s.data(), s.size(), 0);
-            static simdjson::dom::parser sjd;
-            static simdjson::dom::element se;
-            se = sjd.parse(ps).value_unsafe();
-            static json jd;
-            jd = json::parse(s);
-            workloads.push_back({"dump", {
-                    {"json_view", [&] { std::string o = vd.root().dump(); g_sink = static_cast<double>(o.size()); }},
-                    {"yyjson", [&] { std::size_t n = 0; char* o = yyjson_write(yd, 0, &n); g_sink = static_cast<double>(n); std::free(o); }},
-                    {"simdjson DOM", [&] { std::string o = simdjson::to_string(se); g_sink = static_cast<double>(o.size()); }},
-                    {"json::parse", [&] { std::string o = jd.dump(); g_sink = static_cast<double>(o.size()); }},
-                }});
-        }
-
-        for (auto& wl : workloads)
-        {
-            std::vector<double> best(wl.second.size(), 1e300);
-            const int r = s.size() > 10000000 ? std::max(3, rounds / 5) : rounds;
-            for (int i = 0; i < r; ++i)
-            {
-                for (std::size_t k = 0; k < wl.second.size(); ++k)
-                {
-                    // an untimed call first: whatever the previous engine left to the allocator
-                    // (e.g. thousands of freed json nodes) is cleaned up here, not in the timing
-                    wl.second[k].fn();
-                    const auto t0 = std::chrono::steady_clock::now();
-                    for (int b = 0; b < dc.batch; ++b)
-                    {
-                        wl.second[k].fn();
-                    }
-                    const double ns = std::chrono::duration<double, std::nano>(std::chrono::steady_clock::now() - t0).count() / dc.batch;
-                    best[k] = std::min(best[k], ns);
-                }
-            }
-            const double ref = best[0];
-            std::printf("%-13s %-9s", dc.name.c_str(), wl.first.c_str());
-            for (std::size_t k = 0; k < wl.second.size(); ++k)
-            {
-                const double us = best[k] / 1e3;
-                std::printf("  %s %s%s (%.2fx)", wl.second[k].name.c_str(), us >= 100 ? "" : "", (us >= 1000 ? std::to_string(static_cast<long>(us)) + "us" : (std::to_string(us).substr(0, 5) + "us")).c_str(), best[k] / ref);
-                std::fprintf(csv, "%s,%zu,%s,%s,%.1f\n", dc.name.c_str(), s.size(), wl.first.c_str(), wl.second[k].name.c_str(), best[k]);
-            }
-            std::printf("\n");
-            std::fflush(stdout);
-        }
-    }
-    std::fclose(csv);
-}
@@ -1,342 +0,0 @@
-#!/usr/bin/env python3
-#     __ _____ _____ _____
-#  __|  |   __|     |   | |  JSON for Modern C++ (supporting code)
-# |  |  |__   |  |  | | | |  version 3.12.0
-# |_____|_____|_____|_|___|  https://github.com/nlohmann/json
-#
-# SPDX-FileCopyrightText: 2013-2026 Niels Lohmann <https://nlohmann.me>
-# SPDX-License-Identifier: MIT
-
-"""Compare json_view with yyjson, simdjson, Boost.JSON, and json::parse.
-
-Builds bench_view.cpp, bench_corpus.cpp, and bench_edit.cpp against the include/ directory of
-this checkout, runs them, and writes the results with everything needed to
-reproduce them (date, commit, CPU, OS, compiler, library versions, flags) to
-results/<date>-<host>.md and .csv next to this script.
-
-The other libraries come from the system (--system, the default: pkg-config
-or Homebrew) or are downloaded as pinned releases and checked against their
-SHA-256 (--download). Boost.JSON is optional: without Boost headers, its
-columns are skipped, and the results say so.
-
-Only the Python 3 standard library is used; a C++17 compiler is needed.
-"""
-
-import argparse
-import datetime
-import hashlib
-import os
-import platform
-import re
-import shlex
-import shutil
-# runs only the compilers and benchmark binaries this script builds
-import subprocess  # nosec B404
-import sys
-import tarfile
-import tempfile
-import urllib.request
-
-HERE = os.path.dirname(os.path.abspath(__file__))
-REPO = os.path.abspath(os.path.join(HERE, '..', '..', '..'))
-
-# seconds without data after which a download fails
-DOWNLOAD_TIMEOUT = 60
-
-# pinned releases for --download; the hashes are those of the archives
-#
-# The yyjson and simdjson archives are the tag archives GitHub generates
-# (archive/refs/tags/...), whose bytes GitHub does not guarantee to be stable. A SHA-256
-# mismatch for one of them means that GitHub regenerated the archive: check the upstream
-# tag, then pin the new hash.
-PINNED = {
-    'yyjson': {
-        'version': '0.13.0',
-        'url': 'https://github.com/ibireme/yyjson/archive/refs/tags/0.13.0.tar.gz',
-        'sha256': '34e0f62a2bc11ab20d601e8ca1cc2b2079503aa45119a19133d89d19b94a0fae',
-        'dir': 'yyjson-0.13.0',
-    },
-    'simdjson': {
-        'version': '4.6.11',
-        'url': 'https://github.com/simdjson/simdjson/archive/refs/tags/v4.6.11.tar.gz',
-        'sha256': '61d948fc24f0d793829ad658058e7597d064988a89b4607ea02e401a82df98ff',
-        'dir': 'simdjson-4.6.11',
-    },
-    'boost': {
-        'version': '1.92.0',
-        'url': 'https://archives.boost.io/release/1.92.0/source/boost_1_92_0.tar.gz',
-        'sha256': 'c4a3b310ddd2472416e091067166b0713be97c63f38c212c484ada022fd296ce',
-        'dir': 'boost_1_92_0',
-    },
-}
-
-# the documents of bench_view.cpp, relative to the json_test_data directory
-DEFAULT_CORPUS = [
-    'nativejson-benchmark/twitter.json',
-    'nativejson-benchmark/citm_catalog.json',
-    'nativejson-benchmark/canada.json',
-    'jeopardy/jeopardy.json',
-]
-
-
-def run(cmd, **kwargs):
-    print('+ ' + ' '.join(shlex.quote(c) for c in cmd), flush=True)
-    # cmd is an argument list built by this script, never a shell string
-    return subprocess.run(cmd, check=True, **kwargs)  # nosec B603
-
-
-def output(cmd):
-    try:
-        # cmd is an argument list built by this script, never a shell string
-        return subprocess.run(cmd, check=True, capture_output=True, text=True).stdout.strip()  # nosec B603
-    except (OSError, subprocess.CalledProcessError):
-        return ''
-
-
-# ---------------------------------------------------------------------------
-# libraries
-# ---------------------------------------------------------------------------
-
-class Library:
-    """include directories, sources to compile, and linker flags of a library"""
-
-    def __init__(self, name, include=None, sources=None, link=None, version=''):
-        self.name = name
-        self.include = include or []
-        self.sources = sources or []
-        self.link = link or []
-        self.version = version
-
-
-def header_version(path, pattern):
-    try:
-        with open(path, encoding='utf-8', errors='replace') as f:
-            m = re.search(pattern, f.read())
-        return m.group(1) if m else ''
-    except OSError:
-        return ''
-
-
-def library_version(name, include_dirs):
-    patterns = {
-        'yyjson': ('yyjson.h', r'#define\s+YYJSON_VERSION_STRING\s+"([^"]+)"'),
-        'simdjson': ('simdjson.h', r'#define\s+SIMDJSON_VERSION\s+"?([0-9.]+)"?'),
-        'boost': (os.path.join('boost', 'version.hpp'), r'#define\s+BOOST_LIB_VERSION\s+"([^"]+)"'),
-    }
-    header, pattern = patterns[name]
-    for d in include_dirs:
-        v = header_version(os.path.join(d, header), pattern)
-        if v:
-            return v.replace('_', '.')
-    return ''
-
-
-def system_library(name):
-    """a library found with pkg-config or Homebrew, or None"""
-    flags = output(['pkg-config', '--cflags', '--libs', name]).split()
-    if flags:
-        include = [f[2:] for f in flags if f.startswith('-I')]
-        link = [f for f in flags if f.startswith('-L') or f.startswith('-l')]
-        libdirs = [f[2:] for f in link if f.startswith('-L')]
-        link += ['-Wl,-rpath,' + d for d in libdirs]
-        return Library(name, include, [], link, library_version(name, include))
-    prefix = output(['brew', '--prefix', name]) if shutil.which('brew') else ''
-    if prefix and os.path.isdir(os.path.join(prefix, 'include')):
-        include = [os.path.join(prefix, 'include')]
-        link = []
-        if name != 'boost':
-            lib = os.path.join(prefix, 'lib')
-            link = ['-L' + lib, '-l' + name, '-Wl,-rpath,' + lib]
-        return Library(name, include, [], link, library_version(name, include))
-    if name == 'boost':
-        for d in ['/usr/include', '/usr/local/include']:
-            if os.path.isfile(os.path.join(d, 'boost', 'json.hpp')):
-                return Library(name, [d], [], [], library_version(name, [d]))
-    return None
-
-
-def sha256_file(path):
-    """SHA-256 of a file, read in chunks (the Boost archive is more than 100 MB)"""
-    h = hashlib.sha256()
-    with open(path, 'rb') as f:
-        for chunk in iter(lambda: f.read(1 << 20), b''):
-            h.update(chunk)
-    return h.hexdigest()
-
-
-def download_library(name, work):
-    """a pinned release, downloaded and checked, or an error"""
-    pin = PINNED[name]
-    archive = os.path.join(work, 'download', os.path.basename(pin['url']))
-    os.makedirs(os.path.dirname(archive), exist_ok=True)
-    if not os.path.isfile(archive):
-        print(f'downloading {pin["url"]}', flush=True)
-        # the URLs are the https constants in PINNED, and the SHA-256 is checked below
-        # (into a .part file first, so that an interrupted download is not kept)
-        with urllib.request.urlopen(pin['url'], timeout=DOWNLOAD_TIMEOUT) as response:  # nosec B310
-            with open(archive + '.part', 'wb') as f:
-                shutil.copyfileobj(response, f)
-        os.replace(archive + '.part', archive)
-    digest = sha256_file(archive)
-    if digest != pin['sha256']:
-        os.remove(archive)  # downloaded again by the next run
-        sys.exit(f'error: SHA-256 of {archive} is {digest}, expected {pin["sha256"]} (removed)')
-    src = os.path.join(work, 'download', pin['dir'])
-    if not os.path.isdir(src):
-        # extracted into a temporary directory first, so that an interrupted extraction
-        # is not mistaken for a complete one
-        tmp = tempfile.mkdtemp(prefix=pin['dir'] + '.part-', dir=os.path.join(work, 'download'))
-        try:
-            with tarfile.open(archive) as t:
-                # (the 'data' filter rejects links and paths outside the target where Python has it)
-                kwargs = {'filter': 'data'} if hasattr(tarfile, 'data_filter') else {}
-                t.extractall(tmp, **kwargs)  # noqa: S202 (checked archive)  # nosec B202
-            os.rename(os.path.join(tmp, pin['dir']), src)
-        finally:
-            shutil.rmtree(tmp, ignore_errors=True)
-    if name == 'yyjson':
-        return Library(name, [os.path.join(src, 'src')], [os.path.join(src, 'src', 'yyjson.c')], [], pin['version'])
-    if name == 'simdjson':
-        single = os.path.join(src, 'singleheader')
-        return Library(name, [single], [os.path.join(single, 'simdjson.cpp')], [], pin['version'])
-    return Library(name, [src], [], [], pin['version'])
-
-
-# ---------------------------------------------------------------------------
-# machine description
-# ---------------------------------------------------------------------------
-
-def cpu_model():
-    if sys.platform == 'darwin':
-        return output(['sysctl', '-n', 'machdep.cpu.brand_string'])
-    try:
-        with open('/proc/cpuinfo', encoding='utf-8') as f:
-            for line in f:
-                if line.startswith('model name') or line.startswith('Model'):
-                    return line.split(':', 1)[1].strip()
-    except OSError:
-        pass
-    # (AArch64 Linux: /proc/cpuinfo has no model name, lscpu knows it)
-    for line in output(['lscpu']).splitlines():
-        if line.startswith('Model name:'):
-            return line.split(':', 1)[1].strip()
-    return platform.processor() or platform.machine()
-
-
-def git_commit():
-    commit = output(['git', '-C', REPO, 'rev-parse', '--short=12', 'HEAD'])
-    dirty = output(['git', '-C', REPO, 'status', '--porcelain', '--untracked-files=no'])
-    return commit + (' (with local changes)' if dirty else '')
-
-
-# ---------------------------------------------------------------------------
-# main
-# ---------------------------------------------------------------------------
-
-def main():
-    ap = argparse.ArgumentParser(description=__doc__, formatter_class=argparse.RawDescriptionHelpFormatter)
-    ap.add_argument('--data', required=True, help='json_test_data directory (with nativejson-benchmark/ and jeopardy/)')
-    ap.add_argument('--download', action='store_true', help='use pinned downloads instead of system libraries')
-    ap.add_argument('--no-boost', action='store_true', help='skip Boost.JSON')
-    ap.add_argument('--native', action='store_true', help='compile for this CPU (-march=native / -mcpu=native)')
-    ap.add_argument('--rounds', type=int, default=30, help='rounds of bench_view (default: 30)')
-    ap.add_argument('--corpus', nargs='*', default=[], help='more files for bench_corpus')
-    ap.add_argument('--build-dir', default=os.path.join(HERE, 'build'), help='where to build (default: build/ next to this script)')
-    args = ap.parse_args()
-    # the benchmarks run in the build directory: make the paths absolute
-    args.data = os.path.abspath(args.data)
-    args.corpus = [os.path.abspath(f) for f in args.corpus]
-    args.build_dir = os.path.abspath(args.build_dir)
-
-    # (CXX and CC may contain arguments, e.g. 'ccache g++')
-    cxx = shlex.split(os.environ.get('CXX', 'c++'))
-    cc = shlex.split(os.environ.get('CC', 'cc'))
-    os.makedirs(args.build_dir, exist_ok=True)
-
-    libs = {}
-    for name in ['yyjson', 'simdjson', 'boost']:
-        if name == 'boost' and args.no_boost:
-            continue
-        lib = download_library(name, args.build_dir) if args.download else system_library(name)
-        if lib is None and name != 'boost':
-            sys.exit(f'error: {name} not found; install it, or use --download')
-        if lib is not None:
-            libs[name] = lib
-    with_boost = 'boost' in libs
-    if not with_boost:
-        print('Boost.JSON not found: its columns are skipped', flush=True)
-
-    flags = ['-std=c++17', '-O3', '-DNDEBUG', f'-DJSON_VIEW_BENCH_BOOST={1 if with_boost else 0}']
-    if args.native:
-        flags.append('-mcpu=native' if platform.machine().lower() in ('arm64', 'aarch64') else '-march=native')
-    include = ['-I' + os.path.join(REPO, 'include')] + ['-I' + d for lib in libs.values() for d in lib.include]
-    link = [f for lib in libs.values() for f in lib.link]
-
-    # C sources of downloaded libraries are compiled once
-    objects = []
-    for lib in libs.values():
-        for src in lib.sources:
-            obj = os.path.join(args.build_dir, os.path.basename(src) + '.o')
-            is_c = src.endswith('.c')
-            run((cc if is_c else cxx) + ([] if is_c else ['-std=c++17']) + ['-O3', '-DNDEBUG', '-c', src, '-o', obj]
-                + ['-I' + d for d in lib.include])
-            objects.append(obj)
-
-    binaries = {}
-    for bench in ['bench_view', 'bench_corpus', 'bench_edit']:
-        exe = os.path.join(args.build_dir, bench)
-        run(cxx + flags + include + [os.path.join(HERE, bench + '.cpp')] + objects + link + ['-o', exe])
-        binaries[bench] = exe
-
-    # run: bench_view on its documents, bench_corpus on those and the given files
-    corpus = [os.path.join(args.data, f) for f in DEFAULT_CORPUS] + args.corpus
-    outputs = {}
-    outputs['bench_view'] = run([binaries['bench_view'], args.data, str(args.rounds)], cwd=args.build_dir,
-                                capture_output=True, text=True).stdout
-    outputs['bench_corpus'] = run([binaries['bench_corpus']] + corpus, cwd=args.build_dir,
-                                  capture_output=True, text=True).stdout
-    outputs['bench_edit'] = run([binaries['bench_edit'], args.data, str(max(1, args.rounds // 2))], cwd=args.build_dir,
-                                capture_output=True, text=True).stdout
-    for name, text in outputs.items():
-        print(text)
-
-    # results with their metadata
-    now = datetime.datetime.now()
-    host = re.sub(r'[^A-Za-z0-9-]+', '-', platform.node().split('.')[0]) or 'host'
-    stem = os.path.join(HERE, 'results', f'{now:%Y-%m-%d}-{host}')
-    os.makedirs(os.path.dirname(stem), exist_ok=True)
-    cxx_version = output(cxx + ['--version'])
-    compiler_version = cxx_version.splitlines()[0] if cxx_version else ' '.join(cxx)
-    meta = [
-        ('date', f'{now:%Y-%m-%d %H:%M}'),
-        ('commit', git_commit()),
-        ('CPU', cpu_model()),
-        ('OS', f'{platform.system()} {platform.release()} ({platform.machine()})'),
-        ('compiler', compiler_version),
-        ('flags', ' '.join(flags)),
-        ('yyjson', libs['yyjson'].version),
-        ('simdjson', libs['simdjson'].version),
-        ('Boost.JSON', libs['boost'].version if with_boost else 'skipped (not found)'),
-        ('libraries from', 'pinned downloads' if args.download else 'the system'),
-        ('rounds', str(args.rounds)),
-    ]
-    with open(stem + '.md', 'w', encoding='utf-8') as f:
-        f.write(f'# json_view comparison, {now:%Y-%m-%d}\n\n')
-        f.write('Generated by `tests/benchmarks/json_view/compare.py`; best of the interleaved rounds.\n\n')
-        f.write('| | |\n|---|---|\n')
-        for key, value in meta:
-            f.write(f'| {key} | {value} |\n')
-        for name, text in outputs.items():
-            f.write(f'\n## {name}\n\n```\n{text.rstrip()}\n```\n')
-    with open(stem + '.csv', 'w', encoding='utf-8') as out:
-        out.write(''.join(f'# {key}: {value}\n' for key, value in meta))
-        for name in ['bench_view', 'bench_corpus', 'bench_edit']:
-            path = os.path.join(args.build_dir, name + '.csv')
-            if os.path.isfile(path):
-                with open(path, encoding='utf-8') as f:
-                    out.write(f'# {name}\n' + f.read())
-    print(f'results: {stem}.md, {stem}.csv')
-
-
-if __name__ == '__main__':
-    main()
@@ -8,13 +8,11 @@

 #include <benchmark/benchmark.h>
 #include <nlohmann/json.hpp>
-#include <array>
-#include <cstdio>
-#include <deque>
 #include <fstream>
+#include <array>
+#include <deque>
 #include <numeric>
 #include <set>
-#include <sstream>
 #include <vector>
 #include <test_data.hpp>

@@ -53,65 +51,6 @@ BENCHMARK_CAPTURE(ParseFile, signed_ints,       TEST_DATA_DIRECTORY "/regression
 BENCHMARK_CAPTURE(ParseFile, unsigned_ints,     TEST_DATA_DIRECTORY "/regression/unsigned_ints.json");
 BENCHMARK_CAPTURE(ParseFile, small_signed_ints, TEST_DATA_DIRECTORY "/regression/small_signed_ints.json");

-//////////////////////////////////////////////////////////////////////////////
-// parse JSON from a FILE*
-//////////////////////////////////////////////////////////////////////////////
-
-static void ParseFILE(benchmark::State& state, const char* filename)
-{
-    while (state.KeepRunning())
-    {
-        state.PauseTiming();
-        std::FILE* f = std::fopen(filename, "rb");
-        auto* j = new json();
-        state.ResumeTiming();
-
-        *j = json::parse(f);
-
-        state.PauseTiming();
-        std::fclose(f);
-        delete j;
-        state.ResumeTiming();
-    }
-
-    std::ifstream file(filename, std::ios::binary | std::ios::ate);
-    state.SetBytesProcessed(state.iterations() * file.tellg());
-}
-BENCHMARK_CAPTURE(ParseFILE, canada,       TEST_DATA_DIRECTORY "/nativejson-benchmark/canada.json");
-BENCHMARK_CAPTURE(ParseFILE, citm_catalog, TEST_DATA_DIRECTORY "/nativejson-benchmark/citm_catalog.json");
-BENCHMARK_CAPTURE(ParseFILE, twitter,      TEST_DATA_DIRECTORY "/nativejson-benchmark/twitter.json");
-
-//////////////////////////////////////////////////////////////////////////////
-// read many small values from one stream (NDJSON)
-//////////////////////////////////////////////////////////////////////////////
-
-static void ParseStreamValues(benchmark::State& state, bool numbers)
-{
-    std::string input;
-    for (int i = 0; i < 10000; ++i)
-    {
-        input += numbers ? std::to_string(i * 7919) + " "
-                 : R"({"id":)" + std::to_string(i) + R"(,"name":"user)" + std::to_string(i) + R"(","active":true,"score":)" + std::to_string(i * 0.25) + "}\n";
-    }
-
-    for (auto _ : state)
-    {
-        std::istringstream is(input);
-        json j;
-        std::size_t count = 0;
-        while (!(is >> std::ws).eof())
-        {
-            is >> j;
-            ++count;
-        }
-        benchmark::DoNotOptimize(count);
-    }
-
-    state.SetBytesProcessed(static_cast<int64_t>(state.iterations() * input.size()));
-}
-BENCHMARK_CAPTURE(ParseStreamValues, ndjson,  false);
-BENCHMARK_CAPTURE(ParseStreamValues, numbers, true);
-
 //////////////////////////////////////////////////////////////////////////////
 // parse JSON from string
 //////////////////////////////////////////////////////////////////////////////
@@ -1,239 +0,0 @@
-//     __ _____ _____ _____
-//  __|  |   __|     |   | |  JSON for Modern C++ (supporting code)
-// |  |  |__   |  |  | | | |  version 3.12.0
-// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
-//
-// SPDX-FileCopyrightText: 2013-2026 Niels Lohmann <https://nlohmann.me>
-// SPDX-License-Identifier: MIT
-
-#include "doctest_compatibility.h"
-
-#include <nlohmann/json.hpp>
-using nlohmann::json;
-
-#include <array>
-#include <cstdint>
-#include <cstdio>
-#include <fstream>
-#include <memory>
-#include <random>
-#include <string>
-#include <thread>
-#include <vector>
-
-// Parsing from a FILE* locks the file once and reads it with the unlocked
-// stdio functions (see JSON_DISABLE_UNLOCKED_FILE_IO). These tests pin that
-// this is not observable: the results are the same, the file is unlocked
-// again when parsing ends - also with an exception - and the same thread can
-// keep using the file while it is locked, e.g., from a SAX callback.
-
-namespace
-{
-// a file name of its own for every run: the test runs for several C++
-// standards and configurations at the same time, in the same directory
-std::string temp_file_name()
-{
-    std::random_device rd;
-    return "unit-file_input-" + std::to_string(rd()) + ".tmp";
-}
-
-using file_ptr = std::unique_ptr<std::FILE, int (*)(std::FILE*)>;
-
-// write @a content to the file @a name and open it for reading
-file_ptr open_with(const char* name, const std::string& content)
-{
-    {
-        std::ofstream file(name, std::ios::binary);
-        file << content;
-    }
-    return {std::fopen(name, "rb"), &std::fclose};
-}
-
-// The stdio lock is recursive, so whether parsing released it can only be
-// seen from another thread: ftrylockfile() fails there while this thread
-// holds the lock. ftrylockfile() is POSIX; elsewhere, the check is skipped.
-#if defined(__GLIBC__) || defined(__APPLE__) || defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__)
-void check_unlocked(std::FILE* f)
-{
-    int result = -1;
-    std::thread other([f, &result]
-    {
-        result = ftrylockfile(f);
-        if (result == 0)
-        {
-            funlockfile(f);
-        }
-    });
-    other.join();
-    CHECK(result == 0);
-}
-#else
-void check_unlocked(std::FILE* /*f*/) {}
-#endif
-
-// SAX consumer that also reads the position of the file it is parsing, which
-// takes the file's lock again on the same thread
-class position_reading_sax : public nlohmann::json_sax<json>
-{
-  public:
-    explicit position_reading_sax(std::FILE* f) : m_file(f) {}
-    position_reading_sax(const position_reading_sax&) = delete;
-    position_reading_sax(position_reading_sax&&) = delete;
-    position_reading_sax& operator=(const position_reading_sax&) = delete;
-    position_reading_sax& operator=(position_reading_sax&&) = delete;
-    ~position_reading_sax() override = default;
-
-    bool null() override
-    {
-        return record();
-    }
-    bool boolean(bool /*val*/) override
-    {
-        return record();
-    }
-    bool number_integer(number_integer_t /*val*/) override
-    {
-        return record();
-    }
-    bool number_unsigned(number_unsigned_t /*val*/) override
-    {
-        return record();
-    }
-    bool number_float(number_float_t /*val*/, const string_t& /*s*/) override
-    {
-        return record();
-    }
-    bool string(string_t& /*val*/) override
-    {
-        return record();
-    }
-    bool binary(binary_t& /*val*/) override
-    {
-        return record();
-    }
-    bool start_object(std::size_t /*elements*/) override
-    {
-        return record();
-    }
-    bool key(string_t& /*val*/) override
-    {
-        return record();
-    }
-    bool end_object() override
-    {
-        return record();
-    }
-    bool start_array(std::size_t /*elements*/) override
-    {
-        return record();
-    }
-    bool end_array() override
-    {
-        return record();
-    }
-    bool parse_error(std::size_t /*position*/, const std::string& /*last_token*/, const nlohmann::detail::exception& /*ex*/) override
-    {
-        return false;
-    }
-
-    const std::vector<long>& positions() const
-    {
-        return m_positions;
-    }
-
-  private:
-    bool record()
-    {
-        m_positions.push_back(std::ftell(m_file));
-        return true;
-    }
-
-    std::FILE* m_file;
-    std::vector<long> m_positions{}; // NOLINT(readability-redundant-member-init)
-};
-}  // namespace
-
-TEST_CASE("parsing from a FILE*")
-{
-    const std::string temp_name = temp_file_name();
-    const char* const name = temp_name.c_str();
-    const std::string input = "{\"a\": [1, -2.5, \"three\", true, null], \"b\": {\"c\": \"caf\xc3\xa9\"}}";
-
-    SECTION("values are the same as when parsing from a string")
-    {
-        const file_ptr f = open_with(name, input);
-        REQUIRE(f != nullptr);
-        CHECK(json::parse(f.get()) == json::parse(input));
-        // the whole input was consumed
-        std::array<char, 8> rest{};
-        CHECK(std::fgets(rest.data(), static_cast<int>(rest.size()), f.get()) == nullptr);
-        check_unlocked(f.get());
-    }
-
-#if !defined(JSON_NOEXCEPTION)
-    SECTION("the file is unlocked after a parse error")
-    {
-        const file_ptr f = open_with(name, "[1, 2, x]");
-        REQUIRE(f != nullptr);
-        json _;
-        CHECK_THROWS_WITH_AS(_ = json::parse(f.get()),
-                             "[json.exception.parse_error.101] parse error at line 1, column 8: syntax error while parsing value - invalid literal; last read: '2, x'",
-                             json::parse_error&);
-        check_unlocked(f.get());
-
-        // the file is still usable: the rest of the input is there
-        std::array<char, 8> rest{};
-        CHECK(std::fgets(rest.data(), static_cast<int>(rest.size()), f.get()) != nullptr);
-        CHECK(std::string(rest.data()) == "]");
-    }
-
-#endif // !defined(JSON_NOEXCEPTION)
-
-    SECTION("the file can be parsed again and read with stdio afterwards")
-    {
-        const file_ptr f = open_with(name, "[1] [2] tail");
-        REQUIRE(f != nullptr);
-
-        // sax_parse with strict == false stops after the first value; an array
-        // ends with its closing bracket, so the space after it is not read
-        json j;
-        nlohmann::detail::json_sax_dom_parser<json, nlohmann::detail::string_input_adapter_type> sax1(j);
-        CHECK(json::sax_parse(f.get(), &sax1, json::input_format_t::json, false));
-        CHECK(j == json({1}));
-        check_unlocked(f.get());
-
-        json k;
-        nlohmann::detail::json_sax_dom_parser<json, nlohmann::detail::string_input_adapter_type> sax2(k);
-        CHECK(json::sax_parse(f.get(), &sax2, json::input_format_t::json, false));
-        CHECK(k == json({2}));
-        check_unlocked(f.get());
-
-        std::array<char, 8> rest{};
-        CHECK(std::fgets(rest.data(), static_cast<int>(rest.size()), f.get()) != nullptr);
-        CHECK(std::string(rest.data()) == " tail");
-    }
-
-    SECTION("the same thread can use the file while it is parsed")
-    {
-        const file_ptr f = open_with(name, "[10, 20, 30]");
-        REQUIRE(f != nullptr);
-        position_reading_sax sax(f.get());
-        CHECK(json::sax_parse(f.get(), &sax));
-        // start_array, three numbers, end_array
-        CHECK(sax.positions().size() == 5);
-        CHECK(sax.positions().front() == 1);
-        check_unlocked(f.get());
-    }
-
-    SECTION("binary formats read from a FILE*")
-    {
-        const json j = {{"string", std::string(300, 'x')}, {"array", {1, 2, 3}}, {"number", 1.5}};
-        const std::vector<std::uint8_t> cbor = json::to_cbor(j);
-        const file_ptr f = open_with(name, std::string(reinterpret_cast<const char*>(cbor.data()), cbor.size()));
-        REQUIRE(f != nullptr);
-        CHECK(json::from_cbor(f.get()) == j);
-        check_unlocked(f.get());
-    }
-
-    static_cast<void>(std::remove(name));
-}
@@ -1,503 +0,0 @@
-//     __ _____ _____ _____
-//  __|  |   __|     |   | |  JSON for Modern C++ (supporting code)
-// |  |  |__   |  |  | | | |  version 3.12.0
-// |_____|_____|_____|_|___|  https://github.com/nlohmann/json
-//
-// SPDX-FileCopyrightText: 2013-2026 Niels Lohmann <https://nlohmann.me>
-// SPDX-License-Identifier: MIT
-
-// The fast paths for contiguous input (bulk string scanning, SWAR searches,
-// UTF-8 prefix validation, the 8-digit number loop, the 8-byte indentation
-// skip, the BSON/BON8 bulk string readers) load several bytes at a time. This
-// test places every input directly in front of (or directly behind) an
-// inaccessible page, so reading even one byte outside the input crashes, with
-// or without sanitizers. ASan alone misses over-reads into the slack of the
-// same heap allocation.
-
-#include "doctest_compatibility.h"
-
-#include <nlohmann/json.hpp>
-using nlohmann::json;
-
-#include <algorithm>
-#include <cstdint>
-#include <cstring>
-#include <string>
-#include <utility>
-#include <vector>
-
-#if defined(_WIN32)
-    #define JSON_TEST_GUARD_PAGE_WINDOWS
-    #ifndef NOMINMAX
-        #define NOMINMAX
-    #endif
-    #ifndef WIN32_LEAN_AND_MEAN
-        #define WIN32_LEAN_AND_MEAN
-    #endif
-    #include <windows.h>
-#elif defined(__unix__) || defined(__APPLE__)
-    #define JSON_TEST_GUARD_PAGE_POSIX
-    #include <sys/mman.h>
-    #include <unistd.h>
-#endif
-
-#if defined(JSON_TEST_GUARD_PAGE_WINDOWS) || defined(JSON_TEST_GUARD_PAGE_POSIX)
-
-namespace
-{
-// Three pages: an inaccessible one, a readable one, an inaccessible one. An
-// input is copied either to the end of the middle page (any read past its last
-// byte faults) or to its start (any read before its first byte faults).
-class guarded_buffer
-{
-  public:
-    guarded_buffer()
-        : page(page_size())
-    {
-#if defined(JSON_TEST_GUARD_PAGE_WINDOWS)
-        void* const p = VirtualAlloc(nullptr, 3 * page, MEM_RESERVE | MEM_COMMIT, PAGE_NOACCESS);
-        REQUIRE(p != nullptr);
-        base = static_cast<unsigned char*>(p);
-        DWORD old_protect = 0;
-        REQUIRE(VirtualProtect(base + page, page, PAGE_READWRITE, &old_protect) != 0);
-#else
-        void* const p = mmap(nullptr, 3 * page, PROT_NONE, MAP_PRIVATE | MAP_ANON, -1, 0);
-        REQUIRE(p != MAP_FAILED);
-        base = static_cast<unsigned char*>(p);
-        REQUIRE(mprotect(base + page, page, PROT_READ | PROT_WRITE) == 0);
-#endif
-    }
-
-    ~guarded_buffer()
-    {
-#if defined(JSON_TEST_GUARD_PAGE_WINDOWS)
-        VirtualFree(base, 0, MEM_RELEASE);
-#else
-        munmap(base, 3 * page);
-#endif
-    }
-
-    guarded_buffer(const guarded_buffer&) = delete;
-    guarded_buffer& operator=(const guarded_buffer&) = delete;
-    guarded_buffer(guarded_buffer&&) = delete;
-    guarded_buffer& operator=(guarded_buffer&&) = delete;
-
-    // copies @a input so its last byte is the last readable byte
-    const std::uint8_t* at_end(const std::string& input)
-    {
-        REQUIRE(input.size() <= page);
-        unsigned char* const first = base + (2 * page) - input.size();
-        std::transform(input.begin(), input.end(), first, [](const char c)
-        {
-            return static_cast<unsigned char>(c);
-        });
-        return first;
-    }
-
-    // copies @a input so its first byte is the first readable byte
-    const std::uint8_t* at_start(const std::string& input)
-    {
-        REQUIRE(input.size() <= page);
-        unsigned char* const first = base + page;
-        std::transform(input.begin(), input.end(), first, [](const char c)
-        {
-            return static_cast<unsigned char>(c);
-        });
-        return first;
-    }
-
-  private:
-    static std::size_t page_size()
-    {
-#if defined(JSON_TEST_GUARD_PAGE_WINDOWS)
-        SYSTEM_INFO info;
-        GetSystemInfo(&info);
-        return static_cast<std::size_t>(info.dwPageSize);
-#else
-        return static_cast<std::size_t>(sysconf(_SC_PAGESIZE));
-#endif
-    }
-
-    std::size_t page = 0;
-    unsigned char* base = nullptr;
-};
-
-// the serialization of the result of @a f, or the exception message; @a f
-// takes the allow_exceptions flag, which is false without exceptions, where
-// an error yields a discarded value instead
-template<typename F>
-std::string outcome(F f)
-{
-#if defined(JSON_NOEXCEPTION)
-    return "value: " + f(false).dump(-1, ' ', false, json::error_handler_t::keep);
-#else
-    try
-    {
-        return "value: " + f(true).dump(-1, ' ', false, json::error_handler_t::keep);
-    }
-    catch (const json::exception& e)
-    {
-        return std::string("error: ") + e.what();
-    }
-#endif
-}
-
-// a SAX handler that only counts events, so sax_parse runs without a DOM
-struct counting_sax : nlohmann::json_sax<json>
-{
-    std::size_t events = 0;
-    std::string error{}; // NOLINT(readability-redundant-member-init)
-
-    bool null() override
-    {
-        return count();
-    }
-    bool boolean(bool /*val*/) override
-    {
-        return count();
-    }
-    bool number_integer(number_integer_t /*val*/) override
-    {
-        return count();
-    }
-    bool number_unsigned(number_unsigned_t /*val*/) override
-    {
-        return count();
-    }
-    bool number_float(number_float_t /*val*/, const string_t& /*s*/) override
-    {
-        return count();
-    }
-    bool string(string_t& /*val*/) override
-    {
-        return count();
-    }
-    bool binary(binary_t& /*val*/) override
-    {
-        return count();
-    }
-    bool start_object(std::size_t /*elements*/) override
-    {
-        return count();
-    }
-    bool key(string_t& /*val*/) override
-    {
-        return count();
-    }
-    bool end_object() override
-    {
-        return count();
-    }
-    bool start_array(std::size_t /*elements*/) override
-    {
-        return count();
-    }
-    bool end_array() override
-    {
-        return count();
-    }
-    bool parse_error(std::size_t position, const std::string& /*last_token*/, const nlohmann::detail::exception& ex) override
-    {
-        error = std::to_string(position) + " " + ex.what();
-        return false;
-    }
-
-  private:
-    bool count()
-    {
-        ++events;
-        return true;
-    }
-};
-
-// all prefixes of each seed, so the input ends at every byte of it
-std::vector<std::string> all_prefixes(const std::vector<std::string>& seeds)
-{
-    std::vector<std::string> result;
-    for (const auto& seed : seeds)
-    {
-        for (std::size_t n = 0; n <= seed.size(); ++n)
-        {
-            result.push_back(seed.substr(0, n));
-        }
-    }
-    return result;
-}
-
-std::vector<std::string> json_seeds()
-{
-    std::vector<std::string> seeds =
-    {
-        // string runs: ASCII, escapes, \u escapes, surrogate pairs
-        "\"abcdefghijklmnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"",
-        R"("ab\ncd\"ef\\gh\u00e4ij\uD83D\uDE00kl\u12")",
-        // 2-, 3- and 4-byte UTF-8 sequences, then invalid UTF-8
-        std::string("\"\xC3\xA4\xE2\x82\xAC\xF0\x9F\x98\x80\xC3\xA4\xE2\x82\xAC\xF0\x9F\x98\x80") + "abcdefgh\"",
-        "\"abcdefgh\xC3\x28 \xED\xA0\x80 \xF4\x90\x80\x80 \xF8 \xC0\xAF\"",
-        std::string("\"abcdefg\x01") + "abcdefgh\"",
-        // numbers, so the 8-digit loop runs up to the end
-        "12345678",
-        "1234567890123456",
-        "12345678901234567890123",
-        "-0.000000001234567890123456789",
-        "3.14159265358979323846264338327950288e+100",
-        "-1.2345678901234567e-12",
-        "1E-5",
-        "[1.5,2e10,-3E-5,0.000000001,123456789012345678]",
-        // literals
-        "[true,false,null]",
-        // comments (only parsed with ignore_comments)
-        "/* comment */ [1, // line comment\n 2] /**/",
-        // a pretty-printed document
-        json::parse(R"({"a": [1, 2.5, "three", {"b": null, "c": [true, false]}], "d": {"e": {"f": {"g": "h"}}}})").dump(4),
-        json::parse(R"({"a": [1, 2.5, "three", {"b": null, "c": [true, false]}], "d": {"e": {"f": {"g": "h"}}}})").dump(8, '\t'),
-    };
-
-    // indentation runs of every length, with and without a closing bracket
-    for (std::size_t n = 0; n <= 20; ++n)
-    {
-        seeds.push_back("[\n" + std::string(n, ' ') + "1,\n" + std::string(n, ' ') + "2\n]");
-    }
-
-    return all_prefixes(seeds);
-}
-
-// a value whose binary serializations contain long strings and keys, numbers
-// of every width, and nested containers
-json binary_document()
-{
-    json j;
-    j["a key that is longer than eight bytes"] = "a string value that is longer than eight bytes";
-    j["\xC3\xA4\xE2\x82\xAC\xF0\x9F\x98\x80"] = "\xF0\x9F\x98\x80\xE2\x82\xAC\xC3\xA4 utf-8 0123456789";
-    j["numbers"] = {0, 1, -1, 255, -256, 65536, -2147483649LL, 4294967296ULL, 1.5, -2.25e100};
-    j["nested"] = {{"x", {{"y", {true, false, nullptr}}}}};
-    j["s"] = "";
-    return j;
-}
-
-// readers for check_binary(), callable with a container or an iterator range
-// followed by the allow_exceptions flag
-#define JSON_TEST_GUARD_PAGE_READER(name, from)                                     \
-    struct name                                                                     \
-    {                                                                               \
-        template<typename... Args>                                                  \
-        json operator()(bool allow_exceptions, Args&& ... args) const               \
-        {                                                                           \
-            return json::from(std::forward<Args>(args)..., true, allow_exceptions); \
-        }                                                                           \
-    };
-JSON_TEST_GUARD_PAGE_READER(read_bson, from_bson)
-JSON_TEST_GUARD_PAGE_READER(read_bon8, from_bon8)
-JSON_TEST_GUARD_PAGE_READER(read_cbor, from_cbor)
-JSON_TEST_GUARD_PAGE_READER(read_msgpack, from_msgpack)
-JSON_TEST_GUARD_PAGE_READER(read_ubjson, from_ubjson)
-JSON_TEST_GUARD_PAGE_READER(read_bjdata, from_bjdata)
-#undef JSON_TEST_GUARD_PAGE_READER
-
-// @a bytes as characters (explicitly converted: the iterator-range constructor
-// would convert implicitly, which -fsanitize=integer reports)
-std::string as_chars(const std::vector<std::uint8_t>& bytes)
-{
-    std::string result;
-    result.reserve(bytes.size());
-    for (const std::uint8_t b : bytes)
-    {
-        result.push_back(static_cast<char>(b));
-    }
-    return result;
-}
-
-// reads every prefix of @a bytes at both ends of the guarded page and from a
-// std::string, which must give the same outcome
-template<typename Reader>
-void check_binary(guarded_buffer& guard, const std::vector<std::uint8_t>& bytes, Reader parse)
-{
-    for (const auto& input : all_prefixes({as_chars(bytes)}))
-    {
-        CAPTURE(input)
-        const std::string expected = outcome([&](bool allow)
-        {
-            return parse(allow, input);
-        });
-        for (int placement = 0; placement < 2; ++placement)
-        {
-            const std::uint8_t* const first = placement == 0 ? guard.at_end(input) : guard.at_start(input);
-            CHECK(outcome([&](bool allow)
-            {
-                return parse(allow, first, first + input.size());
-            }) == expected);
-        }
-    }
-}
-
-// parse_float_native() at both ends of the guarded page, compared bit for bit
-// with converting the same token from a std::string
-template<typename FloatType>
-std::uint64_t float_bits(FloatType value)
-{
-    static_assert(sizeof(FloatType) <= sizeof(std::uint64_t), "unsupported floating-point width");
-    std::uint64_t bits = 0;
-    std::memcpy(&bits, &value, sizeof(value));
-    return bits;
-}
-
-template<typename FloatType>
-void check_float_native(guarded_buffer& guard, const std::string& token)
-{
-    const auto decimal_point = token.find('.');
-    const auto exponent = token.find_first_of("eE");
-    const auto mantissa_end = exponent == std::string::npos ? token.size() : exponent;
-    const auto expected = nlohmann::detail::parse_float_native<FloatType>(token.data(), token.data() + token.size(), decimal_point, mantissa_end);
-    for (int placement = 0; placement < 2; ++placement)
-    {
-        const char* const first = reinterpret_cast<const char*>(placement == 0 ? guard.at_end(token) : guard.at_start(token));
-        const auto value = nlohmann::detail::parse_float_native<FloatType>(first, first + token.size(), decimal_point, mantissa_end);
-        CHECK(float_bits(value) == float_bits(expected));
-    }
-}
-} // namespace
-
-TEST_CASE("guard page")
-{
-    guarded_buffer guard;
-
-    SECTION("string scanning")
-    {
-        // fills that drive each function to a different stop
-        const std::vector<std::string> fills =
-        {
-            std::string(64, 'a'),
-            std::string(64, '"'),
-            std::string(64, '\\'),
-            std::string(64, '\x01'),
-            std::string(64, '\x7F'),
-            std::string(64, '\xFF'),
-        };
-        std::vector<std::string> patterns = fills;
-        {
-            std::string utf8;
-            while (utf8.size() < 64)
-            {
-                utf8 += "\xC3\xA4\xE2\x82\xAC\xF0\x9F\x98\x80" "ab";
-            }
-            patterns.push_back(utf8);
-        }
-        {
-            std::string bytes;
-            for (unsigned int i = 0; i < 64; ++i)
-            {
-                bytes.push_back(static_cast<char>((i * 37u) & 0xFFu));
-            }
-            patterns.push_back(bytes);
-        }
-
-        for (const auto& pattern : patterns)
-        {
-            for (std::size_t n = 0; n <= 64; ++n)
-            {
-                const std::string input = pattern.substr(0, n);
-                for (int placement = 0; placement < 2; ++placement)
-                {
-                    const unsigned char* const p = placement == 0 ? guard.at_end(input) : guard.at_start(input);
-
-                    CHECK(nlohmann::detail::find_string_special(p, n) <= n);
-                    CHECK(nlohmann::detail::find_ascii_copyable_run(p, n) <= n);
-                    CHECK(nlohmann::detail::valid_utf8_prefix(p, n) <= n);
-#if defined(JSON_USE_SIMDUTF) && defined(JSON_HAS_CPP_17)
-                    CHECK(nlohmann::detail::find_string_delimiter(p, n) <= n);
-#endif
-                    CHECK(nlohmann::detail::string_bulk_run(p, n) <= n);
-                    CHECK(nlohmann::detail::scalar_string_bulk_run(p, n) <= n);
-                    for (std::size_t i = 0; i < n; ++i)
-                    {
-                        CHECK(nlohmann::detail::validate_one_utf8(p + i, n - i) <= n - i);
-                    }
-                }
-            }
-        }
-    }
-
-    SECTION("float conversion")
-    {
-        // the lexer converts floats from its token buffer, so the JSON section
-        // below never places a float token at the page boundary; this calls the
-        // conversion directly: the 8-digit loops of parse_float_significand()
-        // and digit_comparison() read up to the end of the token
-        const std::vector<std::string> tokens = all_prefixes(
-        {
-            "1234567812345678123456781234567812345678",
-            "-1.2345678901234567890123456789e-123",
-            "0.00000000000000000000000000000000000001",
-            "98765432.10987654",
-            "123456789012345678901234567890e-30",
-            // halfway between 1 and the next double, then just above it
-            "1.00000000000000011102230246251565404236316680908203125",
-            "1.000000000000000111022302462515654042363166809082031250000000001",
-        });
-        for (const auto& token : tokens)
-        {
-            // only complete number tokens: the conversion expects validated input
-            if (!token.empty() && json::accept(token))
-            {
-                CAPTURE(token)
-                check_float_native<double>(guard, token);
-                check_float_native<float>(guard, token);
-            }
-        }
-    }
-
-    SECTION("JSON")
-    {
-        for (const auto& input : json_seeds())
-        {
-            CAPTURE(input)
-            const std::string expected = outcome([&](bool allow)
-            {
-                return json::parse(input, nullptr, allow);
-            });
-            const std::string expected_comments = outcome([&](bool allow)
-            {
-                return json::parse(input, nullptr, allow, true);
-            });
-            const bool expected_accept = json::accept(input);
-            counting_sax expected_sax;
-            const bool expected_sax_result = json::sax_parse(input, &expected_sax);
-
-            for (int placement = 0; placement < 2; ++placement)
-            {
-                const std::uint8_t* const first = placement == 0 ? guard.at_end(input) : guard.at_start(input);
-                const std::uint8_t* const last = first + input.size();
-
-                CHECK(outcome([&](bool allow)
-                {
-                    return json::parse(first, last, nullptr, allow);
-                }) == expected);
-                CHECK(outcome([&](bool allow)
-                {
-                    return json::parse(first, last, nullptr, allow, true);
-                }) == expected_comments);
-                CHECK(json::accept(first, last) == expected_accept);
-
-                counting_sax sax;
-                CHECK(json::sax_parse(first, last, &sax) == expected_sax_result);
-                CHECK(sax.events == expected_sax.events);
-                CHECK(sax.error == expected_sax.error);
-            }
-        }
-    }
-
-    SECTION("binary formats")
-    {
-        // every prefix ends inside a value, e.g., inside a BSON key or BON8
-        // string without its terminator
-        const json j = binary_document();
-        check_binary(guard, json::to_bson(j), read_bson());
-        check_binary(guard, json::to_bon8(j), read_bon8());
-        check_binary(guard, json::to_cbor(j), read_cbor());
-        check_binary(guard, json::to_msgpack(j), read_msgpack());
-        check_binary(guard, json::to_ubjson(j), read_ubjson());
-        check_binary(guard, json::to_bjdata(j), read_bjdata());
-    }
-}
-
-#endif
@@ -470,31 +470,27 @@ TEST_CASE("json_view")
    {
        using nlohmann::detail::is_detected;

+        // a length is not a flag: parse(ptr, len) would convert len to
+        // allow_exceptions and read ptr as a C string, which need not end
        static_assert(is_detected<parse_call_t, const char*, bool>::value, "parse(ptr, bool) is valid");
        static_assert(is_detected<parse_call_t, const char*, bool, bool, bool>::value, "parse(ptr, bool, bool, bool) is valid");
        static_assert(is_detected<parse_call_t, const char*, const char*>::value, "parse(first, last) is valid");
        static_assert(is_detected<parse_call_t, const char*, const char*, bool>::value, "parse(first, last, bool) is valid");
-        static_assert(is_detected<parse_copy_call_t, const char*, bool>::value, "parse_copy(ptr, bool) is valid");
-        static_assert(is_detected<accept_call_t, const char*, bool>::value, "accept(ptr, bool) is valid");
-        static_assert(is_detected<read_call_t, const char*, bool>::value, "read(ptr, bool) is valid");
-
-        // a length is not a flag: parse(ptr, len) would convert len to
-        // allow_exceptions and read ptr as a C string, which need not end
-        //
-        // MSVC 2015 does not treat selecting a deleted function in decltype as
-        // a substitution failure, so it detects the deleted overloads as
-        // callable; calling them still fails to compile
-#if !(defined(_MSC_VER) && _MSC_VER < 1910)
        static_assert(!is_detected<parse_call_t, const char*, std::size_t>::value, "parse(ptr, len) must not compile");
        static_assert(!is_detected<parse_call_t, const char*, int>::value, "parse(ptr, int) must not compile");
        static_assert(!is_detected<parse_call_t, const char*, char>::value, "parse(ptr, char) must not compile");
        static_assert(!is_detected<parse_call_t, const char*, std::size_t, bool>::value, "parse(ptr, len, bool) must not compile");
        static_assert(!is_detected<parse_call_t, const std::string&, std::size_t>::value, "parse(string, len) must not compile");
        static_assert(!is_detected<parse_call_t, const std::vector<char>&, std::size_t>::value, "parse(vector, len) must not compile");
+
+        static_assert(is_detected<parse_copy_call_t, const char*, bool>::value, "parse_copy(ptr, bool) is valid");
        static_assert(!is_detected<parse_copy_call_t, const char*, std::size_t>::value, "parse_copy(ptr, len) must not compile");
+
+        static_assert(is_detected<accept_call_t, const char*, bool>::value, "accept(ptr, bool) is valid");
        static_assert(!is_detected<accept_call_t, const char*, std::size_t>::value, "accept(ptr, len) must not compile");
+
+        static_assert(is_detected<read_call_t, const char*, bool>::value, "read(ptr, bool) is valid");
        static_assert(!is_detected<read_call_t, const char*, std::size_t>::value, "read(ptr, len) must not compile");
-#endif

        // json_view has no conversion to bool: unlike basic_json's, it would
        // mean "exists", not "is not null"; use is_discarded()
@@ -686,12 +682,7 @@ void check_access(const ordered_json_view& v, const ordered_json& j)
            ++members;
            const std::string key(it.key().data(), it.key().size());
            CHECK(v.contains(key));
-            std::size_t occurrences = 0;
-            for (auto other = v.begin(); other != v.end(); ++other)
-            {
-                occurrences += other.key() == it.key() ? 1u : 0u;
-            }
-            CHECK(v.count(key) == occurrences);
+            CHECK(v.count(key) == 1);
            // lookups find the first member with the key, which is this one if
            // there is no earlier one
            if (std::find(keys.begin(), keys.end(), key) != keys.end())
@@ -799,8 +790,7 @@ TEST_CASE("json_view element access and iteration")
        CHECK(v.find("a") == v.begin());
        CHECK(v.find("a").value().materialize() == 1);
        CHECK(v.find("b") == std::next(v.begin()));
-        CHECK(v.count("a") == 2); // every member, unlike materialize()
-        CHECK(v.count("b") == 1);
+        CHECK(v.count("a") == 1);
        CHECK(v.contains("a"));
        CHECK(v.value("a", 0) == 1);
        CHECK(v.materialize()["a"] == 3); // materialize() keeps the last value, unlike the lookups
@@ -1197,25 +1187,6 @@ void from_json(const json& j, record& r)
    j.at("name").get_to(r.name);
    j.at("count").get_to(r.count);
 }
-
-struct defaults
-{
-    int a = 1;
-    int b = 2;
-};
-
-// sets only the members the JSON value has
-void from_json(const json& j, defaults& d)
-{
-    if (j.contains("a"))
-    {
-        j.at("a").get_to(d.a);
-    }
-    if (j.contains("b"))
-    {
-        j.at("b").get_to(d.b);
-    }
-}
 } // namespace

 TEST_CASE("json_view values")
@@ -1345,14 +1316,6 @@ TEST_CASE("json_view values")
        CHECK(name == "widget");
        CHECK(count == 3);

-        // other types go to from_json with the existing value, as basic_json::get_to()
-        defaults def;
-        def.b = 5;
-        const json_document partial = json_document::parse(R"({"a":4})");
-        partial.root().get_to(def);
-        CHECK(def.a == 4);
-        CHECK(def.b == 5);
-
        // a duplicate key: the last value, as parse()
        const json_document dup = json_document::parse(R"({"a":1,"a":2})");
        CHECK((dup.root().get<std::map<std::string, int>>() == std::map<std::string, int> {{"a", 2}}));
@@ -418,13 +418,11 @@ TEST_CASE("json_view large objects")
            std::string text = "{";
            std::map<std::string, std::size_t> first;
            std::map<std::string, std::size_t> last;
-            std::map<std::string, std::size_t> occurrences;
            for (const member& m : members)
            {
                text += (text.size() > 1 ? ",\"" : "\"") + m.key + "\":" + std::to_string(m.position);
                first.insert({m.key, m.position});
                last[m.key] = m.position;
-                ++occurrences[m.key];
            }
            text += '}';
            REQUIRE(first.size() < members.size());
@@ -443,7 +441,7 @@ TEST_CASE("json_view large objects")
                CHECK(v.find(entry.first).value().get<std::size_t>() == expected);
                CHECK(v.value(entry.first, std::size_t{0}) == expected);
                CHECK(v.contains(entry.first));
-                CHECK(v.count(entry.first) == occurrences[entry.first]);
+                CHECK(v.count(entry.first) == 1);
                const std::string pointer = "/" + entry.first;
                CHECK(v[json::json_pointer(pointer)].get<std::size_t>() == expected);
                CHECK(v.at(json::json_pointer(pointer)).get<std::size_t>() == expected);
@@ -466,7 +464,7 @@ TEST_CASE("json_view large objects")
        // make the table build quadratic: such an object gets no table and is
        // searched linearly
        constexpr std::size_t members = 300;
-        constexpr std::size_t table_size = 1024; // the table size for 300 members: the next power of two >= 600
+        constexpr std::size_t slots = 1024; // the table size for 300 members: the next power of two >= 600
        std::vector<std::string> colliding;
        std::vector<std::string> spread;
        for (std::uint64_t counter = 0; colliding.size() < members || spread.size() < members; ++counter)
@@ -477,7 +475,7 @@ TEST_CASE("json_view large objects")
            {
                key[i] = static_cast<char>('a' + (x % 26));
            }
-            const bool lands_in_slot_zero = (nlohmann::detail::view::key_hash(key.data(), key.size()) & (table_size - 1)) == 0;
+            const bool lands_in_slot_zero = (nlohmann::detail::view::key_hash(key.data(), key.size()) & (slots - 1)) == 0;
            if (lands_in_slot_zero && colliding.size() < members)
            {
                colliding.push_back(key);
@@ -524,7 +522,7 @@ TEST_CASE("json_view large objects")
        // same length, so the tables are the only difference)
        with_collisions.shrink_to_fit();
        without_collisions.shrink_to_fit();
-        CHECK(without_collisions.memory_usage() >= with_collisions.memory_usage() + (table_size * sizeof(std::uint32_t)));
+        CHECK(without_collisions.memory_usage() >= with_collisions.memory_usage() + (slots * sizeof(std::uint32_t)));
    }

    SECTION("shrink_to_fit releases the tables' spare capacity")
@@ -31,7 +31,6 @@ using ptr_t = ordered_json::json_pointer;
 #include <iterator>
 #include <limits>
 #include <map>
-#include <memory>
 #include <random>
 #include <set>
 #include <string>
@@ -229,17 +228,6 @@ std::string text_with_duplicates(const ordered_json& j)
    return j.dump();
 }

-// the number of members of an object view with this key, by iteration
-std::size_t occurrences(const ordered_json_editable_view& v, const std::string& key)
-{
-    std::size_t result = 0;
-    for (const auto& item : v.items())
-    {
-        result += std::string(item.key().data(), item.key().size()) == key ? 1u : 0u;
-    }
-    return result;
-}
-
 // every lookup of the edited view finds the first member of its key, which
 // the iteration of the view shows
 void check_lookups(const ordered_json_editable_view& v)
@@ -265,7 +253,7 @@ void check_lookups(const ordered_json_editable_view& v)
            CHECK(v.at(ptr).materialize() == expected);
            CHECK(v.contains(key));
            CHECK(v.contains(ptr));
-            CHECK(v.count(key) == occurrences(v, key));
+            CHECK(v.count(key) == 1);
            const auto it = v.find(key);
            REQUIRE(it != v.end());
            CHECK((*it).materialize() == expected);
@@ -303,7 +291,7 @@ void check_first_members(const ordered_json_editable_view& v, const ordered_json
            CAPTURE(key)
            REQUIRE(v.contains(key));
            CHECK(v.contains(ptr));
-            CHECK(v.count(key) == occurrences(v, key));
+            CHECK(v.count(key) == 1);
            CHECK(v.find(key) != v.end());
            CHECK(v.at(ptr).type() == kv.value().type());
            check_first_members(v[key], kv.value());
@@ -593,32 +581,6 @@ TEST_CASE("json_view edits: the size of a text arena")
 }
 #endif

-TEST_CASE("json_view edits: the chunks of new nodes")
-{
-    using nlohmann::detail::view::alloc_nodes;
-    using nlohmann::detail::view::document_data;
-    const std::unique_ptr<document_data, document_data::deleter> d(document_data::create(0));
-    // the first chunk has room for 64 nodes, the next one for 128
-    const nlohmann::detail::view::node* const first = alloc_nodes(*d, 10);
-    CHECK(d->edits->chunks.size() == 1);
-    // a request of half of the next chunk (128 nodes) or more gets a chunk of
-    // its own
-    const nlohmann::detail::view::node* const large = alloc_nodes(*d, 100);
-    CHECK(d->edits->chunks.size() == 2);
-    CHECK(large == d->edits->chunks.back().get());
-    // and the rest of the first chunk is still used
-    CHECK(alloc_nodes(*d, 50) == first + 10);
-    CHECK(d->edits->chunks.size() == 2);
-    // a smaller request that does not fit starts a new (doubled) chunk; the
-    // call is a statement of its own, as the operands of == are unsequenced
-    // and MSVC reads chunks.back() before the call adds the chunk
-    const nlohmann::detail::view::node* const doubled = alloc_nodes(*d, 10);
-    CHECK(doubled == d->edits->chunks.back().get());
-    CHECK(d->edits->chunks.size() == 3);
-    CHECK(d->edits->chunk_end - d->edits->chunk_cur == 128 - 10);
-    CHECK(d->edits->bytes == (64 + 100 + 128) * sizeof(nlohmann::detail::view::node));
-}
-
 TEST_CASE("json_view edits: replacing arrays and objects by scalars")
 {
    // the first assignment switches the parent to links; the later ones do
@@ -678,12 +640,7 @@ void check_first_wins(const View& o, int expected)
    CHECK(o.value(json::json_pointer("/a"), -1) == expected);
    CHECK(o.contains("a"));
    CHECK(o.contains(json::json_pointer("/a")));
-    std::size_t members_a = 0;
-    for (const auto& item : o.items())
-    {
-        members_a += std::string(item.key().data(), item.key().size()) == "a" ? 1u : 0u;
-    }
-    CHECK(o.count("a") == members_a); // every member, unlike the lookups
+    CHECK(o.count("a") == 1);
 }
 } // namespace

@@ -294,7 +294,7 @@ TEST_CASE("json_view images: round trips")
    {
        // the hash is not seeded: keys can be found that land in one slot of
        // a table (see json_view: "colliding keys")
-        const auto keys_for = [](std::size_t table_size, std::size_t colliding_count, std::size_t spread_count)
+        const auto keys_for = [](std::size_t slots, std::size_t colliding_count, std::size_t spread_count)
        {
            std::vector<std::string> colliding;
            std::vector<std::string> spread;
@@ -306,7 +306,7 @@ TEST_CASE("json_view images: round trips")
                {
                    key[i] = static_cast<char>('a' + (x % 26));
                }
-                const bool lands_in_slot_zero = (nlohmann::detail::view::key_hash(key.data(), key.size()) & (table_size - 1)) == 0;
+                const bool lands_in_slot_zero = (nlohmann::detail::view::key_hash(key.data(), key.size()) & (slots - 1)) == 0;
                if (lands_in_slot_zero && colliding.size() < colliding_count)
                {
                    colliding.push_back(key);
@@ -335,14 +335,14 @@ TEST_CASE("json_view images: round trips")
        // long chain
        const struct // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays): an unnamed type
        {
-            std::size_t table_size;
+            std::size_t slots;
            std::size_t colliding;
            std::size_t spread;
        } cases[] = {{1024, 300, 0}, {512, 40, 160}};
        for (const auto& c : cases)
        {
-            CAPTURE(c.table_size)
-            std::vector<std::string> keys = keys_for(c.table_size, c.colliding, c.spread);
+            CAPTURE(c.slots)
+            std::vector<std::string> keys = keys_for(c.slots, c.colliding, c.spread);
            const std::size_t members = keys.size();
            // a duplicate of a colliding key, of the first and of a spread key
            const std::vector<std::string> duplicated = {keys[c.colliding - 1], keys[0], keys[members - 1]};