deploy: 1bcf71bd85

.appveyor.yml

@@ -1,46 +0,0 @@
-version: '{build}'
-branches: { only: [ master ] }
-configuration: Release
-image: Visual Studio 2019
-platform: x64
-
-environment:
-  matrix:
-    - job_name: VS2019
-      CMAKE_ARGS:  -A %Platform%
-    - job_name: VS2019ARM
-      CMAKE_ARGS: -A ARM64 -DCMAKE_CROSSCOMPILING=1 -D SIMDJSON_GOOGLE_BENCHMARKS=OFF # Does Google Benchmark builds under VS ARM?
-    - job_name: VS2017 (Static, No Threads)
-      image: Visual Studio 2017
-      CMAKE_ARGS:  -A %Platform% -DSIMDJSON_BUILD_STATIC=ON -DSIMDJSON_ENABLE_THREADS=OFF
-      CTEST_ARGS: -E checkperf
-    - job_name: VS2019 (Win32)
-      platform: Win32
-      CMAKE_ARGS:  -A %Platform% -DSIMDJSON_BUILD_STATIC=OFF -DSIMDJSON_ENABLE_THREADS=ON # This should be the default. Testing anyway.
-      CTEST_ARGS: -E "checkperf|ondemand_basictests"
-    - job_name: VS2015
-      image: Visual Studio 2015
-      CMAKE_ARGS:  -A %Platform% -DSIMDJSON_BUILD_STATIC=ON -DSIMDJSON_ENABLE_THREADS=OFF
-      CTEST_ARGS: -E checkperf
-
-build_script:
-  - mkdir build
-  - cd build
-  - cmake --version
-  - cmake %CMAKE_ARGS% --parallel ..
-  - cmake -LH ..
-  - cmake --build . --config %Configuration% --verbose --parallel
-
-for:
--
-  matrix:
-    except:
-      - job_name: VS2019ARM
-
-  test_script:
-    - ctest --output-on-failure -C %Configuration% --verbose %CTEST_ARGS% --parallel
-
-clone_folder: c:\projects\simdjson
-
-matrix:
-  fast_finish: true

.circleci/config.yml

@@ -1,269 +0,0 @@
-version: 2.1
-
-
-# We constantly run out of memory so please do not use parallelism (-j, -j4). 
-
-# Reusable image / compiler definitions
-executors:
-  gcc8:
-    docker:
-      - image: conanio/gcc8
-        environment:
-          CXX: g++-8
-          CC: gcc-8
-          BUILD_FLAGS: 
-          CTEST_FLAGS: --output-on-failure
-
-  gcc9:
-    docker:
-      - image: conanio/gcc9
-        environment:
-          CXX: g++-9
-          CC: gcc-9
-          BUILD_FLAGS:
-          CTEST_FLAGS: --output-on-failure
-
-  gcc10:
-    docker:
-      - image: conanio/gcc10
-        environment:
-          CXX: g++-10
-          CC: gcc-10
-          BUILD_FLAGS:
-          CTEST_FLAGS: --output-on-failure
-
-  clang10:
-    docker:
-      - image: conanio/clang10
-        environment:
-          CXX: clang++-10
-          CC: clang-10
-          BUILD_FLAGS:
-          CTEST_FLAGS: --output-on-failure
-
-  clang9:
-    docker:
-      - image: conanio/clang9
-        environment:
-          CXX: clang++-9
-          CC: clang-9
-          BUILD_FLAGS:
-          CTEST_FLAGS: --output-on-failure 
-
-  clang6:
-    docker:
-      - image: conanio/clang60
-        environment:
-          CXX: clang++-6.0
-          CC: clang-6.0
-          BUILD_FLAGS:
-          CTEST_FLAGS: --output-on-failure
-
-# Reusable test commands (and initializer for clang 6)
-commands:
-  install_cmake:
-    steps:
-      - run: apt-get update -qq
-      - run: apt-get install -y cmake
-
-  cmake_prep:
-    steps:
-      - checkout
-      - run: mkdir -p build
-
-  cmake_build_cache:
-    steps:
-      - cmake_prep
-      - run: cmake $CMAKE_FLAGS -DCMAKE_INSTALL_PREFIX:PATH=destination -B build . 
-
-  cmake_build:
-    steps:
-      - cmake_build_cache
-      - run: cmake --build build
-
-  cmake_test:
-    steps:
-      - cmake_build
-      - run: |
-          cd build &&
-          tools/json2json -h &&
-          ctest $CTEST_FLAGS -L acceptance &&
-          ctest $CTEST_FLAGS -LE acceptance -E checkperf
-
-  cmake_test_all:
-    steps:
-      - cmake_build
-      - run: |
-          cd build &&
-          tools/json2json -h &&
-          ctest $CTEST_FLAGS -DSIMDJSON_IMPLEMENTATION="haswell;westmere;fallback" -L acceptance -LE per_implementation &&
-          SIMDJSON_FORCE_IMPLEMENTATION=haswell ctest $CTEST_FLAGS -L per_implementation -E checkperf &&
-          SIMDJSON_FORCE_IMPLEMENTATION=westmere ctest $CTEST_FLAGS -L per_implementation -E checkperf &&
-          SIMDJSON_FORCE_IMPLEMENTATION=fallback ctest $CTEST_FLAGS -L per_implementation -E checkperf &&
-          ctest $CTEST_FLAGS -LE "acceptance|per_implementation" # Everything we haven't run yet, run now.
-
-
-  cmake_perftest:
-    steps:
-      - cmake_build_cache
-      - run: |
-          cmake --build  build --target checkperf &&
-          cd build && 
-          ctest --output-on-failure -R checkperf
-
-  # we not only want cmake to build and run tests, but we want also a successful installation from which we can build, link and run programs
-  cmake_install_test: # this version builds, install, test and then verify from the installation
-    steps:
-      - run: cd build && make install
-      - run: echo -e '#include <simdjson.h>\nint main(int argc,char**argv) {simdjson::dom::parser parser;simdjson::dom::element tweets = parser.load(argv[1]); }' > tmp.cpp && c++ -Ibuild/destination/include -Lbuild/destination/lib -std=c++17 -Wl,-rpath,build/destination/lib -o linkandrun tmp.cpp -lsimdjson && ./linkandrun jsonexamples/twitter.json
-
-  cmake_installed_test_cxx20: # assuming that it was installed, this tries to build using C++20
-    steps:
-      - run: echo -e '#include <simdjson.h>\nint main(int argc,char**argv) {simdjson::dom::parser parser;simdjson::dom::element tweets = parser.load(argv[1]); }' > tmp.cpp && c++ -Ibuild/destination/include -Lbuild/destination/lib -std=c++20 -Wl,-rpath,build/destination/lib -o linkandrun tmp.cpp -lsimdjson && ./linkandrun jsonexamples/twitter.json
-
-jobs:
-
-  # static
-  justlib-gcc10:
-    description: Build just the library, install it and do a basic test
-    executor: gcc10
-    environment: { CMAKE_FLAGS: -DSIMDJSON_JUST_LIBRARY=ON }
-    steps: [ cmake_build, cmake_install_test, cmake_installed_test_cxx20 ]
-  gcc10-perftest:
-    description: Build and run performance tests on GCC 10 and AVX 2 with a cmake static build, this test performance regression
-    executor: gcc10
-    environment: { CMAKE_FLAGS: -DSIMDJSON_GOOGLE_BENCHMARKS=OFF -DSIMDJSON_BUILD_STATIC=ON }
-    steps: [ cmake_perftest ]
-  gcc10:
-    description: Build and run tests on GCC 10 and AVX 2 with a cmake static build
-    executor: gcc10
-    environment: { CMAKE_FLAGS: -DSIMDJSON_GOOGLE_BENCHMARKS=ON -DSIMDJSON_BUILD_STATIC=ON }
-    steps: [ cmake_test, cmake_install_test, cmake_installed_test_cxx20 ]
-  clang6:
-    description: Build and run tests on clang 6 and AVX 2 with a cmake static build
-    executor: clang6
-    environment: { CMAKE_FLAGS: -DSIMDJSON_GOOGLE_BENCHMARKS=ON -DSIMDJSON_BUILD_STATIC=ON }
-    steps: [ cmake_test, cmake_install_test ]
-  clang10:
-    description: Build and run tests on clang 10 and AVX 2 with a cmake static build
-    executor: clang10
-    environment: { CMAKE_FLAGS: -DSIMDJSON_GOOGLE_BENCHMARKS=ON  -DSIMDJSON_BUILD_STATIC=ON }
-    steps: [ cmake_test, cmake_install_test, cmake_installed_test_cxx20 ]
-  # libcpp
-  libcpp-clang10:
-    description: Build and run tests on clang 10 and AVX 2 with a cmake static build and libc++
-    executor: clang10
-    environment: { CMAKE_FLAGS: -DSIMDJSON_USE_LIBCPP=ON  -DSIMDJSON_BUILD_STATIC=ON }
-    steps: [ cmake_test, cmake_install_test, cmake_installed_test_cxx20 ]
-  # sanitize
-  sanitize-gcc10:
-    description: Build and run tests on GCC 10 and AVX 2 with a cmake sanitize build
-    executor: gcc10
-    environment: { CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=OFF -DSIMDJSON_SANITIZE=ON, BUILD_FLAGS: "", CTEST_FLAGS: --output-on-failure -E checkperf }
-    steps: [ cmake_test ]
-  sanitize-clang10:
-    description: Build and run tests on clang 10 and AVX 2 with a cmake sanitize build
-    executor: clang10
-    environment: { CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=OFF -DSIMDJSON_SANITIZE=ON, CTEST_FLAGS: --output-on-failure -E checkperf }
-    steps: [ cmake_test ]
-
-  # dynamic
-  dynamic-gcc10:
-    description: Build and run tests on GCC 10 and AVX 2 with a cmake dynamic build
-    executor: gcc10
-    environment: { CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=OFF }
-    steps: [ cmake_test, cmake_install_test ]
-  dynamic-clang10:
-    description: Build and run tests on clang 10 and AVX 2 with a cmake dynamic build
-    executor: clang10
-    environment: { CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=OFF }
-    steps: [ cmake_test, cmake_install_test ]
-
-  # unthreaded
-  unthreaded-gcc10:
-    description: Build and run tests on GCC 10 and AVX 2 *without* threads
-    executor: gcc10
-    environment: { CMAKE_FLAGS: -DSIMDJSON_ENABLE_THREADS=OFF }
-    steps: [ cmake_test, cmake_install_test ]
-  unthreaded-clang10:
-    description: Build and run tests on Clang 10 and AVX 2 *without* threads
-    executor: clang10
-    environment: { CMAKE_FLAGS: -DSIMDJSON_ENABLE_THREADS=OFF }
-    steps: [ cmake_test, cmake_install_test ]
-
-  # noexcept
-  noexcept-gcc10:
-    description: Build and run tests on GCC 10 and AVX 2 with exceptions off
-    executor: gcc10
-    environment: { CMAKE_FLAGS: -DSIMDJSON_EXCEPTIONS=OFF }
-    steps: [ cmake_test, cmake_install_test ]
-  noexcept-clang10:
-    description: Build and run tests on Clang 10 and AVX 2 with exceptions off
-    executor: clang10
-    environment: { CMAKE_FLAGS: -DSIMDJSON_EXCEPTIONS=OFF }
-    steps: [ cmake_test, cmake_install_test ]
-
-  #
-  # Misc.
-  #
-
-  # make (test and checkperf)
-  arch-haswell-gcc10:
-    description: Build, run tests and check performance on GCC 10 with -march=haswell
-    executor: gcc10
-    environment: { CXXFLAGS: -march=haswell }
-    steps: [ cmake_test ]
-  arch-nehalem-gcc10:
-    description: Build, run tests and check performance on GCC 10 with -march=nehalem
-    executor: gcc10
-    environment: { CXXFLAGS: -march=nehalem }
-    steps: [ cmake_test ]
-  sanitize-haswell-gcc10:
-    description: Build and run tests on GCC 10 and AVX 2 with a cmake sanitize build
-    executor: gcc10
-    environment: {  CXXFLAGS: -march=haswell, CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=OFF -DSIMDJSON_SANITIZE=ON, BUILD_FLAGS: "", CTEST_FLAGS: --output-on-failure -E checkperf }
-    steps: [ cmake_test ]
-  sanitize-haswell-clang10:
-    description: Build and run tests on clang 10 and AVX 2 with a cmake sanitize build
-    executor: clang10
-    environment: { CXXFLAGS: -march=haswell, CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=OFF -DSIMDJSON_SANITIZE=ON, CTEST_FLAGS: --output-on-failure -E checkperf }
-    steps: [ cmake_test ]
-
-workflows:
-  version: 2.1
-  build_and_test:
-    jobs:
-      # full multi-implementation tests
-      #- gcc7 tested on GitHub actions
-      - gcc10 # do not delete this as it tests our performance
-      - clang6
-      #- clang10 # this gets tested a lot below
-
-      # libc++
-      - libcpp-clang10
-
-      # full single-implementation tests
-      - sanitize-gcc10
-      - sanitize-clang10
-      - dynamic-gcc10
-      - dynamic-clang10
-      - unthreaded-gcc10
-      - unthreaded-clang10
-
-      # no exceptions
-      - noexcept-gcc10
-      - noexcept-clang10
-
-      # quicker make single-implementation tests
-      - arch-haswell-gcc10
-      - arch-nehalem-gcc10
-
-
-      # sanitized single-implementation tests
-      - sanitize-haswell-gcc10
-      - sanitize-haswell-clang10
-
-      # testing "just the library"
-      - justlib-gcc10
-
-      # TODO add windows: https://circleci.com/docs/2.0/configuration-reference/#windows

.cirrus.yml

@@ -1,21 +0,0 @@
-task:
-  timeout_in: 120m
-  freebsd_instance:
-    matrix:
-      - image_family: freebsd-13-0-snap
-
-  env:
-    ASSUME_ALWAYS_YES: YES
-  setup_script:
-    - pkg update -f
-    - pkg install bash
-    - pkg install cmake
-    - pkg install git
-  build_script:
-    - mkdir build
-    - cd build
-    - cmake -DSIMDJSON_BASH=OFF  -DSIMDJSON_GIT=OFF ..
-    - make
-  test_script:
-    - cd build
-    - ctest --output-on-failure -E checkperf

.clang-format

@@ -1 +0,0 @@
-BasedOnStyle: LLVM

.dockerignore

@@ -1,15 +0,0 @@
-*
-!.git
-!Makefile
-!amalgamate.sh
-!benchmark
-!dependencies
-!include
-!jsonchecker
-!jsonexamples
-!scripts
-!singleheader
-!src
-!style
-!tests
-!tools

.drone.yml

@@ -1,413 +0,0 @@
-kind: pipeline
-name: i386-gcc # we do not support 32-bit systems, but we run tests
-platform: { os: linux, arch: amd64 }
-steps:
-- name: Build and Test
-  image: i386/ubuntu
-  environment:
-    CC: gcc
-    CXX: g++
-    BUILD_FLAGS: -- -j
-    CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=ON
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf 
-  commands:
-    - apt-get update -qq
-    - apt-get install -y g++ cmake gcc
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ctest $CTEST_FLAGS 
----
-kind: pipeline
-name: i386-clang # we do not support 32-bit systems, but we run tests
-platform: { os: linux, arch: amd64 }
-steps:
-- name: Build and Test
-  image: i386/ubuntu
-  environment:
-    CC: clang-6.0
-    CXX: clang++-6.0
-    BUILD_FLAGS: -- -j
-    CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=ON
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf 
-  commands:
-    - apt-get update -qq
-    - apt-get install -y clang++-6.0 cmake
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ctest $CTEST_FLAGS 
----
-kind: pipeline
-name: gcc9
-platform: { os: linux, arch: amd64 }
-steps:
-- name: Build and Test
-  image: gcc:9
-  environment:
-    CC: gcc
-    CXX: g++
-    BUILD_FLAGS: -- -j
-    CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=ON -DSIMDJSON_IMPLEMENTATION=haswell;westmere;fallback
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf
-  commands:
-    - apt-get update -qq
-    - apt-get install -y cmake
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ctest $CTEST_FLAGS -L acceptance -LE per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=haswell ctest $CTEST_FLAGS -L per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=westmere ctest $CTEST_FLAGS -L per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=fallback ctest $CTEST_FLAGS -L per_implementation
-    - ctest $CTEST_FLAGS -LE "acceptance|per_implementation" # Everything we haven't run yet, run now.
----
-kind: pipeline
-name: clang6
-platform: { os: linux, arch: amd64 }
-steps:
-- name: Build and Test
-  image: conanio/clang60
-  user: root
-  environment:
-    CC: clang-6.0
-    CXX: clang++-6.0
-    BUILD_FLAGS: -- -j
-    CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=ON -DSIMDJSON_IMPLEMENTATION=haswell;westmere;fallback
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf
-  commands:
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ctest $CTEST_FLAGS -L acceptance -LE per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=haswell ctest $CTEST_FLAGS -L per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=westmere ctest $CTEST_FLAGS -L per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=fallback ctest $CTEST_FLAGS -L per_implementation
-    - ctest $CTEST_FLAGS -LE "acceptance|per_implementation" # Everything we haven't run yet, run now.
----
-kind: pipeline
-name: dynamic-gcc9
-platform: { os: linux, arch: amd64 }
-steps:
-- name: Build and Test
-  image: gcc:9
-  environment:
-    CC: gcc
-    CXX: g++
-    BUILD_FLAGS: -- -j
-    CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=OFF
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf
-  commands:
-    - apt-get update -qq
-    - apt-get install -y cmake
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ctest $CTEST_FLAGS
----
-kind: pipeline
-name: dynamic-clang9
-platform: { os: linux, arch: amd64 }
-steps:
-- name: Build and Test
-  image: conanio/clang9
-  user: root
-  environment:
-    CC: clang-9
-    CXX: clang++-9
-    CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=OFF
-    BUILD_FLAGS: -- -j
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf
-  commands:
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ctest $CTEST_FLAGS
----
-kind: pipeline
-name: sanitize-gcc9
-platform: { os: linux, arch: amd64 }
-steps:
-- name: Build and Test
-  image: gcc:9
-  environment:
-    CC: gcc
-    CXX: g++
-    BUILD_FLAGS: -- -j
-    CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=ON -DSIMDJSON_IMPLEMENTATION=haswell;westmere;fallback
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf
-  commands:
-    - apt-get update -qq
-    - apt-get install -y cmake
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -L acceptance -LE per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=haswell ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -L per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=westmere ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -L per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=fallback ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -L per_implementation
-    - ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -LE "acceptance|per_implementation" # Everything we haven't run yet, run now.
----
-kind: pipeline
-name: sanitize-clang9
-platform: { os: linux, arch: amd64 }
-steps:
-- name: Build and Test
-  image: conanio/clang9
-  user: root
-  environment:
-    CC: clang-9
-    CXX: clang++-9
-    CMAKE_FLAGS: -DSIMDJSON_SANITIZE=ON -DSIMDJSON_IMPLEMENTATION=haswell;westmere;fallback
-    BUILD_FLAGS: -- -j
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf
-  commands:
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -L acceptance -LE per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=haswell ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -L per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=westmere ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -L per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=fallback ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -L per_implementation
-    - ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -LE "acceptance|per_implementation" # Everything we haven't run yet, run now.
----
-kind: pipeline
-name: arm64-gcc8
-platform: { os: linux, arch: arm64 }
-steps:
-- name: Build and Test
-  image: gcc:8
-  environment:
-    CC: gcc
-    CXX: g++
-    BUILD_FLAGS: -- -j
-    CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=ON -DSIMDJSON_IMPLEMENTATION=arm64;fallback
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf
-  commands:
-    - apt-get update -qq
-    - apt-get install -y cmake
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ctest $CTEST_FLAGS -L acceptance -LE per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=arm64 ctest $CTEST_FLAGS -L per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=fallback ctest $CTEST_FLAGS -L per_implementation
-    - ctest $CTEST_FLAGS -LE "acceptance|per_implementation" # Everything we haven't run yet, run now.
----
-kind: pipeline
-name: arm64-clang6
-platform: { os: linux, arch: arm64 }
-steps:
-- name: Build and Test
-  image: ubuntu:18.04
-  environment:
-    CC: clang-6.0
-    CXX: clang++-6.0
-    CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=OFF
-    BUILD_FLAGS: -- -j
-    CTEST_FLAGS: -j4 --output-on-failure  -E checkperf
-  commands:
-    - apt-get update -qq
-    - apt-get install -y clang cmake git
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ctest $CTEST_FLAGS
----
-kind: pipeline
-name: arm64-dynamic-gcc8
-platform: { os: linux, arch: arm64 }
-steps:
-- name: Build and Test
-  image: gcc:8
-  environment:
-    CC: gcc
-    CXX: g++
-    BUILD_FLAGS: -- -j
-    CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=OFF
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf
-  commands:
-    - apt-get update -qq
-    - apt-get install -y cmake
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ctest $CTEST_FLAGS
----
-kind: pipeline
-name: arm64-dynamic-clang6
-platform: { os: linux, arch: arm64 }
-steps:
-- name: Build and Test
-  image: ubuntu:18.04
-  environment:
-    CC: clang-6.0
-    CXX: clang++-6.0
-    CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=OFF
-    BUILD_FLAGS: -- -j
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf
-  commands:
-    - apt-get update -qq
-    - apt-get install -y clang cmake git
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ctest $CTEST_FLAGS
----
-kind: pipeline
-name: arm64-sanitize-gcc8
-platform: { os: linux, arch: arm64 }
-steps:
-- name: Build and Test
-  image: gcc:8
-  environment:
-    BUILD_FLAGS: -- -j
-    CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=ON -DSIMDJSON_IMPLEMENTATION=arm64;fallback
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf
-    CC: gcc
-    CXX: g++
-  commands:
-    - apt-get update -qq
-    - apt-get install -y cmake libstdc++6
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -L acceptance -LE per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=arm64 ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -L per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=fallback ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -L per_implementation
-    - ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -LE "acceptance|per_implementation" # Everything we haven't run yet, run now.
----
-kind: pipeline
-name: arm64-sanitize-clang6
-platform: { os: linux, arch: arm64 }
-steps:
-- name: Build and Test
-  image: ubuntu:18.04
-  environment:
-    CC: clang-6.0
-    CXX: clang++-6.0
-    CMAKE_FLAGS: -DSIMDJSON_SANITIZE=ON -DSIMDJSON_IMPLEMENTATION=arm64;fallback
-    BUILD_FLAGS: -- -j
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf
-  commands:
-    - apt-get update -qq
-    - apt-get install -y clang cmake git
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -L acceptance -LE per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=arm64 ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -L per_implementation
-    - SIMDJSON_FORCE_IMPLEMENTATION=fallback ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -L per_implementation
-    - ASAN_OPTIONS="detect_leaks=0" ctest $CTEST_FLAGS -LE "acceptance|per_implementation" # Everything we haven't run yet, run now.
----
-kind: pipeline
-name: ninja-clang9
-platform: { os: linux, arch: amd64 }
-steps:
-- name: Build and Test
-  image: conanio/clang9
-  user: root
-  environment:
-    CC: clang-9
-    CXX: clang++-9
-    BUILD_FLAGS: -- -j 4
-    CMAKE_FLAGS: -GNinja -DSIMDJSON_BUILD_STATIC=ON
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf
-    CXXFLAGS: -stdlib=libc++
-  commands:
-    - apt-get update -qq
-    - apt-get install -y cmake
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ctest $CTEST_FLAGS
----
-kind: pipeline
-name: libcpp-clang9
-platform: { os: linux, arch: amd64 }
-steps:
-- name: Build and Test
-  image: conanio/clang9
-  user: root
-  environment:
-    CC: clang-9
-    CXX: clang++-9
-    BUILD_FLAGS: -- -j
-    CMAKE_FLAGS: -DSIMDJSON_BUILD_STATIC=ON
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf
-    CXXFLAGS: -stdlib=libc++
-  commands:
-    - apt-get update -qq
-    - apt-get install -y cmake
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ctest $CTEST_FLAGS
----
-kind: pipeline
-name: noexceptions-gcc9
-platform: { os: linux, arch: amd64 }
-steps:
-- name: Build and Test
-  image: gcc:9
-  environment:
-    CC: gcc
-    CXX: g++
-    BUILD_FLAGS: -- -j
-    CMAKE_FLAGS: -DSIMDJSON_EXCEPTIONS=OFF
-    CTEST_FLAGS: -j4 --output-on-failure -E checkperf
-  commands:
-    - apt-get update -qq
-    - apt-get install -y cmake
-    - mkdir build
-    - cd build
-    - cmake $CMAKE_FLAGS ..
-    - cmake --build . $BUILD_FLAGS
-    - ctest $CTEST_FLAGS
----
-kind: pipeline
-name: arm64-fuzz
-platform: { os: linux, arch: arm64 }
-steps:
-- name: Build and run fuzzers shortly
-  image: ubuntu:20.04
-  environment:
-    CC: clang
-    CXX: clang++
-    DEBIAN_FRONTEND: noninteractive
-    ASAN_OPTIONS: detect_leaks=0
-  commands:
-    - apt-get update -qq
-    - apt-get install -q -y clang cmake git wget zip ninja-build
-    - wget --quiet https://dl.bintray.com/pauldreik/simdjson-fuzz-corpus/corpus/corpus.tar
-    - tar xf corpus.tar && rm corpus.tar
-    - fuzz/build_like_ossfuzz.sh
-    - mkdir -p common_out
-    - for fuzzer in build/fuzz/fuzz_* ; do echo $fuzzer;$fuzzer common_out out/* -max_total_time=40; done
----
-kind: pipeline
-name: stylecheck
-platform: { os: linux, arch: amd64 }
-steps:
-- name: Build and Test
-  image: ubuntu:18.04
-  commands:
-    - apt-get update -y
-    - apt-get install -y python clang-format
-    - ./style/run-clang-format.py -r include/ benchmark/ src/ tests/

.gitattributes

@@ -1,117 +0,0 @@
-# Set the default behavior, in case people don't have core.autocrlf set.
-# Uncomment next line to adjust line endings
-* text=auto
-
-# we don't want json files to be modified for this project
-*.json binary 
-
-
-# Common settings that generally should always be used with your language specific settings
-
-#
-# From generator:
-# https://www.davidlaing.com/2012/09/19/customise-your-gitattributes-to-become-a-git-ninja/
-#
-
-# Documents
-*.bibtex   text diff=bibtex
-*.doc	        diff=astextplain
-*.DOC	        diff=astextplain
-*.docx          diff=astextplain
-*.DOCX          diff=astextplain
-*.dot           diff=astextplain
-*.DOT           diff=astextplain
-*.pdf           diff=astextplain
-*.PDF           diff=astextplain
-*.rtf           diff=astextplain
-*.RTF	        diff=astextplain
-*.md       text
-*.tex      text diff=tex
-*.adoc     text
-*.textile  text
-*.mustache text
-*.csv      text
-*.tab      text
-*.tsv      text
-*.txt      text
-*.sql      text
-
-# Graphics
-*.png      binary
-*.jpg      binary
-*.jpeg     binary
-*.gif      binary
-*.tif      binary
-*.tiff     binary
-*.ico      binary
-# SVG treated as an asset (binary) by default.
-*.svg      text
-# If you want to treat it as binary,
-# use the following line instead.
-# *.svg    binary
-*.eps      binary
-
-# Scripts
-*.bash     text eol=lf
-*.sh       text eol=lf
-# These are explicitly windows files and should use crlf
-*.bat      text eol=crlf
-*.cmd      text eol=crlf
-*.ps1      text eol=crlf
-
-# Serialisation
-#*.json     text
-*.toml     text
-*.xml      text
-*.yaml     text
-*.yml      text
-
-# Archives
-*.7z       binary
-*.gz       binary
-*.tar      binary
-*.zip      binary
-
-#
-# Exclude files from exporting
-#
-
-.gitattributes export-ignore
-.gitignore     export-ignore
-
-# Sources
-*.c     text eol=lf diff=c
-*.cc    text eol=lf diff=cpp
-*.cxx   text eol=lf diff=cpp
-*.cpp   text eol=lf diff=cpp
-*.c++   text eol=lf diff=cpp
-*.hpp   text eol=lf diff=cpp
-*.h     text eol=lf diff=c
-*.h++   text eol=lf diff=cpp
-*.hh    text eol=lf diff=cpp
-
-# Compiled Object files
-*.slo   binary
-*.lo    binary
-*.o     binary
-*.obj   binary
-
-# Precompiled Headers
-*.gch   binary
-*.pch   binary
-
-# Compiled Dynamic libraries
-*.so    binary
-*.dylib binary
-*.dll   binary
-
-# Compiled Static libraries
-*.lai   binary
-*.la    binary
-*.a     binary
-*.lib   binary
-
-# Executables
-*.exe   binary
-*.out   binary
-*.app   binary

.github/ISSUE_TEMPLATE/bug_report.md

@@ -1,41 +0,0 @@
----
-name: Bug report
-about: Create a report to help us improve
-title: ''
-labels: bug (unverified)
-assignees: ''
-
----
-
-Before submitting an issue, please ensure that you have read the documentation:
-
-* Basics is an overview of how to use simdjson and its APIs: https://github.com/simdjson/simdjson/blob/master/doc/basics.md
-* Performance shows some more advanced scenarios and how to tune for them: https://github.com/simdjson/simdjson/blob/master/doc/performance.md
-* Contributing: https://github.com/simdjson/simdjson/blob/master/CONTRIBUTING.md
-* We follow the [JSON specification as described by RFC 8259](https://www.rfc-editor.org/rfc/rfc8259.txt) (T. Bray, 2017).
-
-
-**Describe the bug**
-A clear and concise description of what the bug is.
-
-Note that a compiler warning is not a bug. 
-
-**To Reproduce**
-Steps to reproduce the behaviour: provide a code sample if possible.
-
-If we cannot reproduce the issue, then we cannot address it.
-
-Note that a stack trace from your own program is not enough.
-
-**Configuration (please complete the following information if relevant):**
- - OS: [e.g. Ubuntu 16.04.6 LTS]
- - Compiler [e.g. Apple clang version 11.0.3 (clang-1103.0.32.59) x86_64-apple-darwin19.4.0]
- - Version [e.g. 22]
-
-We support up-to-date 64-bit ARM and x64 FreeBSD, macOS, Windows and Linux systems. Please ensure that your configuration is supported before labelling the issue as a bug. In particular, we do not support legacy 32-bit systems. 
-
-**Indicate whether you are willing or able to provide a bug fix as a pull request**
-
-If you plan to contribute to simdjson, please read our 
-* CONTRIBUTING guide: https://github.com/simdjson/simdjson/blob/master/CONTRIBUTING.md and our
-* HACKING guide: https://github.com/simdjson/simdjson/blob/master/HACKING.md

.github/ISSUE_TEMPLATE/feature_request.md

@@ -1,37 +0,0 @@
----
-name: Feature request
-about: Suggest an idea for this project
-title: ''
-labels: ''
-assignees: ''
-
----
-
-Before submitting an issue, please ensure that you have read the documentation:
-
-* Basics is an overview of how to use simdjson and its APIs: https://github.com/simdjson/simdjson/blob/master/doc/basics.md
-* Performance shows some more advanced scenarios and how to tune for them: https://github.com/simdjson/simdjson/blob/master/doc/performance.md
-* Contributing: https://github.com/simdjson/simdjson/blob/master/CONTRIBUTING.md
-* We follow the [JSON specification as described by RFC 8259](https://www.rfc-editor.org/rfc/rfc8259.txt) (T. Bray, 2017).
-
-We do not make changes to simdjson without clearly identifiable benefits, which typically means either performance improvements, bug fixes or new features. Avoid bike-shedding: we all have opinions about how to write code, but we want to focus on what makes simdjson objectively better.
-
-
-**Is your feature request related to a problem? Please describe.**
-A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]
-
-**Describe the solution you'd like**
-A clear and concise description of what you want to happen.
-
- Please provide a clear rationale for the feature. Be advised that simdjson is a community-based project: you should consider providing help.
-
-**Describe alternatives you've considered**
-A clear and concise description of any alternative solutions or features you've considered.
-
-**Additional context**
-Add any other context or screenshots about the feature request here.
-
-** Are you willing to contribute code or documentation toward this new feature? **
-If you plan to contribute to simdjson, please read our 
-* CONTRIBUTING guide: https://github.com/simdjson/simdjson/blob/master/CONTRIBUTING.md and our
-* HACKING guide: https://github.com/simdjson/simdjson/blob/master/HACKING.md

.github/ISSUE_TEMPLATE/standard-issue-template.md

@@ -1,32 +0,0 @@
----
-name: Standard issue template
-about: Issue
-title: ''
-labels: ''
-assignees: ''
-
----
-
-Before submitting an issue, please ensure that you have read the documentation:
-
-* Basics is an overview of how to use simdjson and its APIs: https://github.com/simdjson/simdjson/blob/master/doc/basics.md
-* Performance shows some more advanced scenarios and how to tune for them: https://github.com/simdjson/simdjson/blob/master/doc/performance.md
-* Contributing: https://github.com/simdjson/simdjson/blob/master/CONTRIBUTING.md
-* We follow the [JSON specification as described by RFC 8259](https://www.rfc-editor.org/rfc/rfc8259.txt) (T. Bray, 2017).
-
-We do not make changes to simdjson without clearly identifiable benefits, which typically means either performance improvements, bug fixes or new features. Avoid bike-shedding: we all have opinions about how to write code, but we want to focus on what makes simdjson objectively better.
-
-Is your issue:
-
-1. A bug report? If so, please point at a reproducible test. Indicate whether you are willing or able to provide a bug fix as a pull request.
-
-2. A build issue? If so, provide all possible details regarding your system configuration. If we cannot reproduce your issue, we cannot fix it.
-
-3. A feature request? Please provide a clear rationale for the feature. Be advised that simdjson is a community-based project: you should consider providing help.
-
-4. A documentation issue? Can you suggest an improvement?
-
-
-If you plan to contribute to simdjson, please read our 
-* CONTRIBUTING guide: https://github.com/simdjson/simdjson/blob/master/CONTRIBUTING.md and our
-* HACKING guide: https://github.com/simdjson/simdjson/blob/master/HACKING.md

.github/workflows/alpine.yml

@@ -1,27 +0,0 @@
-name: Alpine Linux
-'on':
-  - push
-  - pull_request
-jobs:
-  ubuntu-build:
-    runs-on: ubuntu-latest
-    steps:
-      - uses: actions/checkout@v2
-      - name: start docker
-        run: |
-          docker run -w /src -dit --name alpine -v $PWD:/src alpine:latest
-          echo 'docker exec alpine "$@";' > ./alpine.sh
-          chmod +x ./alpine.sh
-      - name: install packages
-        run: |
-          ./alpine.sh apk update
-          ./alpine.sh apk add build-base cmake g++ linux-headers git bash
-      - name: cmake
-        run: |
-          ./alpine.sh cmake -B build_for_alpine
-      - name: build
-        run: |
-          ./alpine.sh cmake --build build_for_alpine
-      - name: test
-        run: |
-          ./alpine.sh bash -c "cd build_for_alpine && ctest"

.github/workflows/fuzzers.yml

@@ -1,152 +0,0 @@
-name: Fuzz and run valgrind
-
-on:
-  push:
-    branches:
-      - master
-  pull_request:
-  schedule:
-    - cron: 23 */8 * * *
-
-jobs:
-  build:    
-    runs-on: ubuntu-latest
-    env:
-      # fuzzers that use the default implementation
-      defaultimplfuzzers: atpointer dump dump_raw_tape element minify  parser print_json
-      # fuzzers that loop over the implementations themselves
-      implfuzzers: implementations minifyimpl utf8
-      implementations: haswell westmere fallback
-      UBSAN_OPTIONS: halt_on_error=1
-      MAXLEN: -max_len=4000
-
-    steps:
-    - name: Install packages necessary for building
-      run: |
-        sudo apt update
-        sudo apt-get install --quiet ninja-build valgrind zip unzip
-        wget https://apt.llvm.org/llvm.sh
-        chmod +x llvm.sh
-        sudo ./llvm.sh 10
-
-    - uses: actions/checkout@v1
-
-    - name: Create and prepare the initial seed corpus
-      run: |
-        fuzz/build_corpus.sh
-        mv corpus.zip seed_corpus.zip
-        mkdir seedcorpus
-        unzip -q -d seedcorpus seed_corpus.zip
-
-    - name: Download the corpus from the last run
-      run: |
-        wget --quiet https://dl.bintray.com/pauldreik/simdjson-fuzz-corpus/corpus/corpus.tar
-        tar xf corpus.tar
-        rm corpus.tar
-
-    - name: List clang versions
-      run: |
-        ls /usr/bin/clang*
-        which clang++
-        clang++ --version
-
-    - name: Build all the variants
-      run: fuzz/build_fuzzer_variants.sh
-
-    - name: Explore fast (release build, default implementation)
-      run: |
-        set -eux
-        for fuzzer in $defaultimplfuzzers $implfuzzers; do
-          mkdir -p out/$fuzzer # in case this is a new fuzzer, or corpus.tar is broken
-          # get input from everyone else (corpus cross pollination)
-          others=$(find out -type d -not -name $fuzzer -not -name out -not -name cmin)
-          build-fast/fuzz/fuzz_$fuzzer out/$fuzzer $others seedcorpus -max_total_time=30 $MAXLEN
-        done
-
-    - name: Fuzz default impl. fuzzers with sanitizer+asserts (good at detecting errors)
-      run: |
-        set -eux
-        for fuzzer in $defaultimplfuzzers; do
-          # get input from everyone else (corpus cross pollination)
-          others=$(find out -type d -not -name $fuzzer -not -name out -not -name cmin)
-          for implementation in $implementations; do
-            export SIMDJSON_FORCE_IMPLEMENTATION=$implementation
-            build-sanitizers/fuzz/fuzz_$fuzzer out/$fuzzer $others seedcorpus -max_total_time=20 $MAXLEN
-          done
-          echo now have $(ls out/$fuzzer |wc -l) files in corpus        
-        done
-
-    - name: Fuzz differential impl. fuzzers with sanitizer+asserts (good at detecting errors)
-      run: |
-        set -eux
-        for fuzzer in $implfuzzers; do
-          # get input from everyone else (corpus cross pollination)
-          others=$(find out -type d -not -name $fuzzer -not -name out -not -name cmin)
-          build-sanitizers/fuzz/fuzz_$fuzzer out/$fuzzer $others seedcorpus -max_total_time=20 $MAXLEN
-          echo now have $(ls out/$fuzzer |wc -l) files in corpus
-        done
-
-    - name: Minimize the corpus with the fast fuzzer on the default implementation
-      run: |
-        set -eux
-        for fuzzer in $defaultimplfuzzers $implfuzzers; do
-          mkdir -p out/cmin/$fuzzer
-          # get input from everyone else (corpus cross pollination)
-          others=$(find out -type d -not -name $fuzzer -not -name out -not -name cmin)
-          build-fast/fuzz/fuzz_$fuzzer -merge=1 $MAXLEN out/cmin/$fuzzer out/$fuzzer $others seedcorpus
-          rm -rf out/$fuzzer
-          mv out/cmin/$fuzzer out/$fuzzer
-        done
-
-    - name: Package the corpus into an artifact
-      run: |
-        for fuzzer in $defaultimplfuzzers $implfuzzers; do      
-          tar rf corpus.tar out/$fuzzer
-        done
-
-    - name: Save the corpus as a github artifact
-      uses: actions/upload-artifact@v2
-      with:
-        name: corpus
-        path: corpus.tar
-
-    # This takes a subset of the minimized corpus and run it through valgrind. It is slow,
-    # therefore take a "random" subset. The random selection is accomplished by sorting on filenames,
-    # which are hashes of the content.
-    - name: Run some of the minimized corpus through valgrind (replay build, default implementation)
-      run: |
-        for fuzzer in $defaultimplfuzzers $implfuzzers; do
-          find out/$fuzzer -type f |sort|head -n200|xargs -n40 valgrind build-replay/fuzz/fuzz_$fuzzer 2>&1|tee valgrind-$fuzzer.txt
-        done 
-
-    - name: Compress the valgrind output
-      run: tar cf valgrind.tar valgrind-*.txt
-
-    - name: Save valgrind output as a github artifact
-      uses: actions/upload-artifact@v2
-      if: always()
-      with:
-        name: valgrindresults
-        path: valgrind.tar
-        if-no-files-found: ignore
-
-    - name: Upload the corpus and results to bintray if we are on master
-      if: ${{ github.event_name == 'schedule' }} 
-      run: |
-        echo uploading each artifact twice, otherwise it will not be published
-        curl -T corpus.tar -upauldreik:${{ secrets.bintrayApiKey }} https://api.bintray.com/content/pauldreik/simdjson-fuzz-corpus/corpus/0/corpus/corpus.tar";publish=1;override=1"
-        curl -T corpus.tar -upauldreik:${{ secrets.bintrayApiKey }} https://api.bintray.com/content/pauldreik/simdjson-fuzz-corpus/corpus/0/corpus/corpus.tar";publish=1;override=1"
-        curl -T valgrind.tar -upauldreik:${{ secrets.bintrayApiKey }} https://api.bintray.com/content/pauldreik/simdjson-fuzz-corpus/corpus/0/corpus/valgrind.tar";publish=1;override=1"
-        curl -T valgrind.tar -upauldreik:${{ secrets.bintrayApiKey }} https://api.bintray.com/content/pauldreik/simdjson-fuzz-corpus/corpus/0/corpus/valgrind.tar";publish=1;override=1"
-
-    - name: Archive any crashes as an artifact
-      uses: actions/upload-artifact@v2
-      if: always()
-      with:
-        name: crashes
-        path: |
-          crash-*
-          leak-*
-          timeout-*
-        if-no-files-found: ignore
-

.github/workflows/mingw-ci.yml

@@ -1,53 +0,0 @@
-name: MinGW32-CI
-
-on: [push, pull_request]
-
-# Important: scoop will either install 32-bit GCC or 64-bit GCC, not both.
-
-# It is important to build static libraries because cmake is not smart enough under Windows/mingw to take care of the path. So
-# with a dynamic library, you could get failures due to the fact that the EXE can't find its DLL.
-
-jobs:
-  ci:
-    name: windows-gcc
-    runs-on: windows-2016
-
-    env:
-      CMAKE_GENERATOR: Ninja # This is critical, try ' cmake  -GNinja-DSIMDJSON_BUILD_STATIC=ON .. ' if using the command line
-      CC: gcc
-      CXX: g++
-
-    steps: # To reproduce what is below, start a powershell with administrative rights, using scoop *is* a good idea
-      - uses: actions/checkout@v2
-
-      - uses: actions/cache@v2 # we cache the scoop setup with 32-bit GCC
-        id: cache
-        with:
-          path: |
-            C:\ProgramData\scoop
-          key: scoop32 # static key: should be good forever
-      - name: Setup Windows # This should almost never run if the cache works.
-        if: steps.cache.outputs.cache-hit != 'true'
-        shell: powershell
-        run: |
-          Invoke-Expression (New-Object System.Net.WebClient).DownloadString('https://get.scoop.sh')
-          scoop install sudo --global
-          sudo scoop install git --global 
-          sudo scoop install ninja --global
-          sudo scoop install cmake --global
-          sudo scoop install gcc --arch 32bit --global
-          $env:path
-          Write-Host 'Everything has been installed, you are good!'
-      - name: Build and Test 32-bit x86
-        shell: powershell
-        run: |
-          $ENV:PATH="C:\ProgramData\scoop\shims;C:\ProgramData\scoop\apps\gcc\current\bin;C:\ProgramData\scoop\apps\ninja\current;$ENV:PATH"
-          g++ --version
-          cmake --version
-          ninja --version
-          git --version
-          mkdir build32
-          cd build32
-          cmake -DSIMDJSON_BUILD_STATIC=ON -DSIMDJSON_COMPETITION=OFF -DSIMDJSON_GOOGLE_BENCHMARKS=OFF -DSIMDJSON_ENABLE_THREADS=OFF ..
-          cmake --build . --target parse_many_test jsoncheck basictests ondemand_basictests numberparsingcheck stringparsingcheck errortests integer_tests pointercheck --verbose
-          ctest -R "(parse_many_test|jsoncheck|basictests|stringparsingcheck|numberparsingcheck|errortests|integer_tests|pointercheck)"  --output-on-failure

.github/workflows/mingw64-ci.yml

@@ -1,59 +0,0 @@
-name: MinGW64-CI
-
-on: [push, pull_request]
-
-# Important: scoop will either install 32-bit GCC or 64-bit GCC, not both.
-
-# It is important to build static libraries because cmake is not smart enough under Windows/mingw to take care of the path. So
-# with a dynamic library, you could get failures due to the fact that the EXE can't find its DLL.
-
-jobs:
-  ci:
-    name: windows-gcc
-    runs-on: windows-2016
-
-    env:
-      CMAKE_GENERATOR: Ninja # This is critical, try ' cmake  -GNinja-DSIMDJSON_BUILD_STATIC=ON .. ' if using the command line
-      CC: gcc
-      CXX: g++
-
-    steps: # To reproduce what is below, start a powershell with administrative rights, using scoop *is* a good idea
-      - uses: actions/checkout@v2
-
-      - uses: actions/cache@v2 # we cache the scoop setup with 64-bit GCC
-        id: cache
-        with:
-          path: |
-            C:\ProgramData\scoop
-          key: scoop64 # static key: should be good forever
-      - name: Setup Windows # This should almost never run if the cache works.
-        if: steps.cache.outputs.cache-hit != 'true'
-        shell: powershell
-        run: |
-          Invoke-Expression (New-Object System.Net.WebClient).DownloadString('https://get.scoop.sh')
-          scoop install sudo --global
-          sudo scoop install git --global
-          sudo scoop install ninja --global
-          sudo scoop install cmake --global
-          sudo scoop install gcc --arch 64bit --global
-          $env:path
-          Write-Host 'Everything has been installed, you are good!'
-      - name: Build and Test 64-bit x64
-        shell: powershell
-        run: |
-          $ENV:PATH="C:\ProgramData\scoop\shims;C:\ProgramData\scoop\apps\gcc\current\bin;C:\ProgramData\scoop\apps\ninja\current;$ENV:PATH"
-          g++ --version
-          cmake --version
-          ninja --version
-          git --version
-          mkdir build64
-          cd build64
-          cmake -DSIMDJSON_BUILD_STATIC=ON -DSIMDJSON_COMPETITION=OFF -DSIMDJSON_GOOGLE_BENCHMARKS=OFF -DSIMDJSON_ENABLE_THREADS=OFF ..
-          cmake --build . --target parse_many_test jsoncheck basictests ondemand_basictests numberparsingcheck stringparsingcheck errortests integer_tests pointercheck --verbose
-          ctest -R "(parse_many_test|jsoncheck|basictests|stringparsingcheck|numberparsingcheck|errortests|integer_tests|pointercheck)"  --output-on-failure
-          cd ..
-          mkdir build64debug
-          cd build64debug
-          cmake -DCMAKE_BUILD_TYPE=Debug -DSIMDJSON_BUILD_STATIC=ON -DSIMDJSON_COMPETITION=OFF -DSIMDJSON_GOOGLE_BENCHMARKS=OFF -DSIMDJSON_ENABLE_THREADS=OFF ..
-          cmake --build . --target parse_many_test jsoncheck basictests ondemand_basictests numberparsingcheck stringparsingcheck errortests integer_tests pointercheck --verbose
-          ctest -R "(parse_many_test|jsoncheck|basictests|stringparsingcheck|numberparsingcheck|errortests|integer_tests|pointercheck)"  --output-on-failure

.github/workflows/msys2.yml

@@ -1,44 +0,0 @@
-name: MSYS2-CI
-
-on: [push, pull_request]
-
-jobs:
-  windows-mingw:
-    name: ${{ matrix.msystem }}
-    runs-on: windows-latest
-    defaults:
-      run:
-        shell: msys2 {0}
-    strategy:
-      fail-fast: false
-      matrix:
-        include:
-          - msystem: "MINGW64"
-            install: mingw-w64-x86_64-cmake mingw-w64-x86_64-ninja mingw-w64-x86_64-gcc
-            type: Release
-          - msystem: "MINGW32"
-            install: mingw-w64-i686-cmake mingw-w64-i686-ninja mingw-w64-i686-gcc
-            type: Release
-          - msystem: "MINGW64"
-            install: mingw-w64-x86_64-cmake mingw-w64-x86_64-ninja mingw-w64-x86_64-gcc
-            type: Debug
-          - msystem: "MINGW32"
-            install: mingw-w64-i686-cmake mingw-w64-i686-ninja mingw-w64-i686-gcc
-            type: Debug
-    env:
-      CMAKE_GENERATOR: Ninja
-
-    steps:
-      - uses: actions/checkout@v2
-      - uses: msys2/setup-msys2@v2
-        with:
-          update: true
-          msystem: ${{ matrix.msystem }}
-          install: ${{ matrix.install }}
-      - name: Build and Test
-        run: |
-          mkdir build
-          cd build
-          cmake -DCMAKE_BUILD_TYPE=${{ matrix.type }} -DSIMDJSON_BUILD_STATIC=ON -DSIMDJSON_DO_NOT_USE_THREADS_NO_MATTER_WHAT=ON ..
-          cmake --build . --verbose
-          ctest -j4 --output-on-failure -E checkperf

.github/workflows/ubuntu18-checkperf.yml

@@ -1,21 +0,0 @@
-name: Performance check on Ubuntu 18.04 CI (GCC 7)
-
-on: [push, pull_request]
-
-jobs:
-  ubuntu-build:
-    runs-on: ubuntu-18.04
-    steps:
-      - uses: actions/checkout@v2
-      - name: Setup cmake
-        uses: jwlawson/actions-setup-cmake@v1.0
-        with:
-          cmake-version: '3.9.x'
-      - name: Use cmake
-        run: |
-          mkdir build &&
-          cd build &&
-          cmake  -DSIMDJSON_GOOGLE_BENCHMARKS=ON -DSIMDJSON_BUILD_STATIC=ON -DCMAKE_INSTALL_PREFIX:PATH=destination ..  &&
-          cmake --build . --target checkperf  &&
-          ctest --output-on-failure -R checkperf  ubuntu18-checkperf.yml
-

.github/workflows/ubuntu18.yml

@@ -1,22 +0,0 @@
-name: Ubuntu 18.04 CI (GCC 7)
-
-on: [push, pull_request]
-
-jobs:
-  ubuntu-build:
-    runs-on: ubuntu-18.04
-    steps:
-      - uses: actions/checkout@v2
-      - name: Setup cmake
-        uses: jwlawson/actions-setup-cmake@v1.0
-        with:
-          cmake-version: '3.9.x'
-      - name: Use cmake
-        run: |
-          mkdir build &&
-          cd build &&
-          cmake  -DSIMDJSON_GOOGLE_BENCHMARKS=ON -DSIMDJSON_BUILD_STATIC=ON -DCMAKE_INSTALL_PREFIX:PATH=destination ..  &&
-          cmake --build .   &&
-          ctest -j --output-on-failure -E checkperf   &&
-          make install  &&
-          echo -e '#include <simdjson.h>\nint main(int argc,char**argv) {simdjson::dom::parser parser;simdjson::dom::element tweets = parser.load(argv[1]); }' > tmp.cpp && c++ -Idestination/include -Ldestination/lib -std=c++17 -Wl,-rpath,destination/lib -o linkandrun tmp.cpp -lsimdjson && ./linkandrun jsonexamples/twitter.json

.github/workflows/ubuntu20-checkperf.yml

@@ -1,20 +0,0 @@
-name: Performance check on Ubuntu 20.04 CI (GCC 9)
-
-on: [push, pull_request]
-
-jobs:
-  ubuntu-build:
-    runs-on: ubuntu-20.04
-    steps:
-      - uses: actions/checkout@v2
-      - name: Setup cmake
-        uses: jwlawson/actions-setup-cmake@v1.0
-        with:
-          cmake-version: '3.9.x'
-      - name: Use cmake
-        run: |
-          mkdir build &&
-          cd build &&
-          cmake  -DSIMDJSON_GOOGLE_BENCHMARKS=ON -DSIMDJSON_BUILD_STATIC=ON -DCMAKE_INSTALL_PREFIX:PATH=destination ..  &&
-          cmake --build . --target checkperf  &&
-          ctest --output-on-failure -R checkperf 

.github/workflows/ubuntu20.yml

@@ -1,22 +0,0 @@
-name: Ubuntu 20.04 CI (GCC 9)
-
-on: [push, pull_request]
-
-jobs:
-  ubuntu-build:
-    runs-on: ubuntu-20.04
-    steps:
-      - uses: actions/checkout@v2
-      - name: Setup cmake
-        uses: jwlawson/actions-setup-cmake@v1.0
-        with:
-          cmake-version: '3.9.x'
-      - name: Use cmake
-        run: |
-          mkdir build &&
-          cd build &&
-          cmake  -DSIMDJSON_GOOGLE_BENCHMARKS=ON -DSIMDJSON_BUILD_STATIC=ON -DCMAKE_INSTALL_PREFIX:PATH=destination ..  &&
-          cmake --build .   &&
-          ctest -j --output-on-failure -E checkperf   &&
-          make install  &&
-          echo -e '#include <simdjson.h>\nint main(int argc,char**argv) {simdjson::dom::parser parser;simdjson::dom::element tweets = parser.load(argv[1]); }' > tmp.cpp && c++ -Idestination/include -Ldestination/lib -std=c++17 -Wl,-rpath,destination/lib -o linkandrun tmp.cpp -lsimdjson && ./linkandrun jsonexamples/twitter.json

.github/workflows/vs16-ci.yml

@@ -1,26 +0,0 @@
-name: VS16-CI
-
-on: [push, pull_request]
-
-jobs:
-  ci:
-    name: windows-vs16
-    runs-on: windows-latest
-    steps:
-    - uses: actions/checkout@v2
-    - name: 'Run CMake with VS16'
-      uses: lukka/run-cmake@v2
-      with:
-        cmakeListsOrSettingsJson: CMakeListsTxtAdvanced
-        cmakeListsTxtPath: '${{ github.workspace }}/CMakeLists.txt'
-        buildDirectory: "${{ github.workspace }}/../../_temp/windows"
-        cmakeBuildType: Release   
-        buildWithCMake: true
-        cmakeGenerator: VS16Win64 
-        cmakeAppendedArgs: -DSIMDJSON_COMPETITION=OFF
-        buildWithCMakeArgs: --config Release  
-        
-    - name: 'Run CTest'
-      run: ctest -C Release  -E checkperf  --output-on-failure 
-      working-directory: "${{ github.workspace }}/../../_temp/windows"
-  

.github/workflows/vs16-clang-ci.yml

@@ -1,25 +0,0 @@
-name: VS16-CLANG-CI
-
-on: [push, pull_request]
-
-jobs:
-  ci:
-    name: windows-vs16
-    runs-on: windows-latest
-    steps:
-    - uses: actions/checkout@v2
-    - name: 'Run CMake with VS16'
-      uses: lukka/run-cmake@v2
-      with:
-        cmakeListsOrSettingsJson: CMakeListsTxtAdvanced
-        cmakeListsTxtPath: '${{ github.workspace }}/CMakeLists.txt'
-        buildDirectory: "${{ github.workspace }}/../../_temp/windows"
-        cmakeBuildType: Release   
-        buildWithCMake: true
-        cmakeGenerator: VS16Win64 
-        cmakeAppendedArgs:  -T ClangCL -DSIMDJSON_COMPETITION=OFF  -DSIMDJSON_BUILD_STATIC=ON
-        buildWithCMakeArgs: --config Release  
-        
-    - name: 'Run CTest'
-      run: ctest -C Release -E checkperf  --output-on-failure 
-      working-directory: "${{ github.workspace }}/../../_temp/windows"

.github/workflows/vs16-ninja-ci.yml

@@ -1,26 +0,0 @@
-name: VS16-Ninja-CI
-
-on: [push, pull_request]
-
-jobs:
-  ci:
-    name: windows-vs16
-    runs-on: windows-latest
-    steps:
-    - uses: actions/checkout@v2
-    - name: 'Run CMake with VS16'
-      uses: lukka/run-cmake@v2
-      with:
-        cmakeListsOrSettingsJson: CMakeListsTxtAdvanced
-        cmakeListsTxtPath: '${{ github.workspace }}/CMakeLists.txt'
-        buildDirectory: "${{ github.workspace }}/../../_temp/windows"
-        cmakeBuildType: Release   
-        buildWithCMake: true
-        cmakeGenerator: VS16Win64 
-        cmakeAppendedArgs:  -G Ninja -DSIMDJSON_COMPETITION=OFF   -DSIMDJSON_BUILD_STATIC=ON
-        buildWithCMakeArgs: --config Release  
-        
-    - name: 'Run CTest'
-      run: ctest -C Release  -E checkperf  --output-on-failure 
-      working-directory: "${{ github.workspace }}/../../_temp/windows"
-  

.gitignore

@@ -1,98 +0,0 @@
-# eclipse project files
-.cproject
-.project
-.settings
-
-# emacs temp files
-*~
-
-# vim temp files
-.*.swp
-
-# XCode
-^build/
-*.pbxuser
-!default.pbxuser
-*.mode1v3
-!default.mode1v3
-*.mode2v3
-!default.mode2v3
-*.perspectivev3
-!default.perspectivev3
-xcuserdata
-*.xccheckout
-*.moved-aside
-DerivedData
-*.hmap
-*.ipa
-*.xcuserstate
-*.DS_Store
-
-# IDE specific folder for JetBrains IDEs
-.idea/
-cmake-build-debug/
-cmake-build-release/
-
-# Visual Studio Code artifacts
-.vscode/*
-.history/
-
-# Visual Studio artifacts
-/VS/
-
-# C/C++ build outputs
-.build/
-bins
-gens
-libs
-objs
-
-# C++ ignore from https://github.com/github/gitignore/blob/master/C%2B%2B.gitignore
-
-# Prerequisites
-*.d
-
-# Compiled Object files
-*.slo
-*.lo
-*.o
-*.obj
-
-# Precompiled Headers
-*.gch
-*.pch
-
-# Compiled Dynamic libraries
-*.so
-*.dylib
-*.dll
-
-# Fortran module files
-*.mod
-*.smod
-
-# Compiled Static libraries
-*.lai
-*.la
-*.a
-*.lib
-
-# Executables
-*.exe
-*.out
-*.app
-
-
-# CMake files that may be specific to our installation
-
-# Build outputs
-/build*/
-/visual_studio/
-
-# Fuzzer outputs generated by instructions in fuzz/Fuzzing.md
-/corpus.zip
-/ossfuzz-out/
-/out/
-
-# Generated docs
-/doc/api

.gitmodules

@@ -1,42 +0,0 @@
-[submodule "scalarvssimd/rapidjson"]
-	path = dependencies/rapidjson
-	url = https://github.com/Tencent/rapidjson.git
-[submodule "dependencies/sajson"]
-	path = dependencies/sajson
-	url = https://github.com/chadaustin/sajson.git
-[submodule "dependencies/json11"]
-	path = dependencies/json11
-	url = https://github.com/dropbox/json11.git
-[submodule "dependencies/fastjson"]
-	path = dependencies/fastjson
-	url = https://github.com/mikeando/fastjson.git
-[submodule "dependencies/gason"]
-	path = dependencies/gason
-	url = https://github.com/vivkin/gason.git
-[submodule "dependencies/ujson4c"]
-	path = dependencies/ujson4c
-	url = https://github.com/esnme/ujson4c.git
-[submodule "dependencies/jsmn"]
-	path = dependencies/jsmn
-	url = https://github.com/zserge/jsmn.git
-[submodule "dependencies/cJSON"]
-	path = dependencies/cJSON
-	url = https://github.com/DaveGamble/cJSON.git
-[submodule "dependencies/jsoncpp"]
-	path = dependencies/jsoncpp
-	url = https://github.com/open-source-parsers/jsoncpp.git
-[submodule "dependencies/json"]
-	path = dependencies/json
-	url = https://github.com/nlohmann/json.git
-[submodule "dependencies/benchmark"]
-	path = dependencies/benchmark
-	url = https://github.com/google/benchmark.git
-[submodule "dependencies/cxxopts"]
-	path = dependencies/cxxopts
-	url = https://github.com/jarro2783/cxxopts
-[submodule "dependencies/boost.json"]
-	path = dependencies/boost.json
-	url = https://github.com/CPPAlliance/json.git
-[submodule "dependencies/yyjson"]
-	path = dependencies/yyjson
-	url = https://github.com/ibireme/yyjson.git

.travis.yml

@@ -1,30 +0,0 @@
-language: cpp
-sudo: false
-addons:
-  apt:
-    sources:
-      - ubuntu-toolchain-r-test
-    packages:
-      - gcc-7
-      - g++-7
-      - clang-format
-      - python
-branches:
-  only:
-    - master
-
-script: 
-   - export CXX=g++-7
-   - export CC=gcc-7
-   - make
-   - make test 
-   - make everything
-   - make amalgamate
-   - make clean
-   - make SANITIZEGOLD=1 test
-   - make clean
-   - ARCHFLAGS="-march=nehalem" make 
-   - ARCHFLAGS="-march=nehalem" make test
-   - ARCHFLAGS="-march=nehalem" make everything
-   - ./style/run-clang-format.py -r include/ benchmark/ src/ tests/
-

AUTHORS

@@ -1,4 +0,0 @@
-# List of authors for copyright purposes, in no particular order
-Daniel Lemire
-Geoff Langdale
-John Keiser

CMakeLists.txt

@@ -1,87 +0,0 @@
-cmake_minimum_required(VERSION 3.9) # CMP0069 NEW
-
-project(simdjson
-  DESCRIPTION "Parsing gigabytes of JSON per second"
-  LANGUAGES CXX C
-)
-
-set(PROJECT_VERSION_MAJOR 0)
-set(PROJECT_VERSION_MINOR 6)
-set(PROJECT_VERSION_PATCH 0)
-set(SIMDJSON_SEMANTIC_VERSION "0.6.0" CACHE STRING "simdjson semantic version")
-set(SIMDJSON_LIB_VERSION "4.0.0" CACHE STRING "simdjson library version")
-set(SIMDJSON_LIB_SOVERSION "4" CACHE STRING "simdjson library soversion")
-set(SIMDJSON_GITHUB_REPOSITORY https://github.com/simdjson/simdjson)
-
-include(GNUInstallDirs)
-include(cmake/simdjson-flags.cmake)
-include(cmake/simdjson-user-cmakecache.cmake)
-
-
-
-if(SIMDJSON_JUST_LIBRARY)
-  message( STATUS "Building just the library, omitting all tests, tools and benchmarks." )
-else(SIMDJSON_JUST_LIBRARY)
-  # Setup tests
-  enable_testing()
-  add_subdirectory(jsonchecker)
-  add_subdirectory(jsonexamples)
-  add_library(test-data INTERFACE)
-  target_link_libraries(test-data INTERFACE jsonchecker-data jsonchecker-minefield-data jsonexamples-data)
-endif(SIMDJSON_JUST_LIBRARY)
-
-# Create the top level simdjson library (must be done at this level to use both src/ and include/
-# directories) and tools
-#
-add_subdirectory(include)
-add_subdirectory(src)
-add_subdirectory(windows)
-if(NOT(SIMDJSON_JUST_LIBRARY))
-  add_subdirectory(dependencies) ## This needs to be before tools because of cxxopts
-  add_subdirectory(tools)  ## This needs to be before tests because of cxxopts
-  add_subdirectory(singleheader)
-endif()
-install(FILES singleheader/simdjson.h DESTINATION ${CMAKE_INSTALL_INCLUDEDIR})
-
-#
-# Compile tools / tests / benchmarks
-#
-if(NOT(SIMDJSON_JUST_LIBRARY))
-  add_subdirectory(tests)
-  add_subdirectory(examples)
-  add_subdirectory(benchmark)
-  add_subdirectory(fuzz)
-endif()
-
-#
-# Source files should be just ASCII
-#
-find_program(FIND find)
-find_program(FILE file)
-find_program(GREP grep)
-if((FIND) AND (FILE) AND (GREP))
-    add_test(
-      NAME "just_ascii"
-      COMMAND sh -c "${FIND}  include src windows tools singleheader tests examples benchmark -path benchmark/checkperf-reference -prune -name '*.h'  -o -name '*.cpp' -type f  -exec ${FILE} '{}' \; |${GREP} -v ASCII || exit 0  && exit 1"
-      WORKING_DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR}
-    )
-endif()
-
-
-#
-# CPack
-#
-set(CPACK_PACKAGE_VENDOR "Daniel Lemire")
-set(CPACK_PACKAGE_CONTACT "lemire@gmail.com")
-set(CPACK_PACKAGE_DESCRIPTION_SUMMARY "Parsing gigabytes of JSON per second")
-set(CPACK_PACKAGE_VERSION_MAJOR ${PROJECT_VERSION_MAJOR})
-set(CPACK_PACKAGE_VERSION_MINOR ${PROJECT_VERSION_MINOR})
-set(CPACK_PACKAGE_VERSION_PATCH ${PROJECT_VERSION_PATCH})
-set(CPACK_RESOURCE_FILE_LICENSE "${CMAKE_CURRENT_SOURCE_DIR}/LICENSE")
-set(CPACK_RESOURCE_FILE_README "${CMAKE_CURRENT_SOURCE_DIR}/README.md")
-
-set(CPACK_RPM_PACKAGE_LICENSE "${CMAKE_CURRENT_SOURCE_DIR}/LICENSE")
-
-set(CPACK_SOURCE_GENERATOR "TGZ;ZIP")
-
-include(CPack)

CONTRIBUTING.md

@@ -1,99 +0,0 @@
-Contributing
-============
-
-The simdjson library is an open project written in C++. Contributions are invited. Contributors
-agree to the project's license.
-
-We have an extensive list of issues, and contributions toward any of these issues is invited.
-Contributions can take the form of code samples, better documentation or design ideas.
-
-In particular, the following contributions are invited:
-
-- The library is focused on performance. Well-documented performance optimization are invited.
-- Fixes to known or newly discovered bugs are always welcome. Typically, a bug fix should come with
-  a test demonstrating that the bug has been fixed.
-- The simdjson library is advanced software and maintainability and flexibility are always a
-  concern. Specific contributions to improve maintainability and flexibility are invited.
-
-We discourage the following types of contributions:
-
-- Code refactoring. We all have our preferences as to how code should be written, but unnecessary
-  refactoring can waste time and introduce new bugs. If you believe that refactoring is needed, you
-  first must explain how it helps in concrete terms. Does it improve the performance?
-- Applications of new language features for their own sake. Using advanced C++ language constructs
-  is actually a negative as it may reduce portability (to old compilers, old standard libraries and
-  systems) and reduce accessibility (to programmers that have not kept up), so it must be offsetted
-  by clear gains like performance or maintainability. When in doubt, avoid advanced C++ features
-  (beyond C++11).
-- Style formatting. In general, please abstain from reformatting code just to make it look prettier.
-  Though code formatting is important, it can also be a waste of time if several contributors try to
-  tweak the code base toward their own preference. Please do not introduce unneeded white-space
-  changes.
-
-In short, most code changes should either bring new features or better performance. We want to avoid unmotivated code changes.
-
-
-Specific rules
-----------
-
-We have few hard rules, but we have some:
-
-- Printing to standard output or standard error (`stderr`, `stdout`, `std::cerr`, `std::cout`) in the core library is forbidden. This follows from the [Writing R Extensions](https://cran.r-project.org/doc/manuals/R-exts.html) manual which states that "Compiled code should not write to stdout or stderr".
-- Calls to `abort()` are forbidden in the core library. This follows from the [Writing R Extensions](https://cran.r-project.org/doc/manuals/R-exts.html) manual which states that "Under no circumstances should your compiled code ever call abort or exit".
-- All source code files (.h, .cpp) must be ASCII.
-- All C macros introduced in public headers need to be prefixed with either `SIMDJSON_` or `simdjson_`.
-
-Tools, tests and benchmarks are not held to these same strict rules.
-
-General Guidelines
-----------
-
-Contributors are encouraged to :
-
-- Document their changes. Though we do not enforce a rule regarding code comments, we prefer that non-trivial algorithms and techniques be somewhat documented in the code.
-- Follow as much as possible the existing code style. We do not enforce a specific code style, but we prefer consistency.
-- Modify as few lines of code as possible when working on an issue. The more lines you modify, the harder it is for your fellow human beings to understand what is going on.
-- Tools may report "problems" with the code, but we never delegate programming to tools: if there is a problem with the code, we need to understand it. Thus we will not "fix" code merely to please a static analyzer if we do not understand.
-- Provide tests for any new feature. We will not merge a new feature without tests.
-
-Pull Requests
---------------
-
-Pull requests are always invited. However, we ask that you follow these guidelines:
-
-- It is wiser to discuss your ideas first as part of an issue before you start coding. If you omit this step and code first, be prepare to have your code receive scrutiny and be dropped.
-- Users should provide a rationale for their changes. Does it improve performance? Does it add a feature? Does it improve maintainability? Does fix a bug? This must be explicitly stated as part of the pull request. Do not propose changes based on taste or intuition. We do not delegate programming to tools: that some tool suggested a code change is not reason enough to change the code.
-   1. When your code improves performance, please document the gains with a benchmark using hard numbers.
-   2. If your code fixes a bug, please be either fix a failing test, or propose a new test.
-   3. Other types of changes must be clearly motivated. We openly discourage changes with no identifiable benefits.
-- Changes should be focused and minimal. You should change as few lines of code as possible. Please do not reformat or touch files needlessly.
-- New features must be accompanied of new tests, in general.
-- Your code should pass our continuous-integration tests. It is your responsability to ensure that your proposal pass the tests. We do not merge pull requests that would break our build.
-
-If the benefits of your proposed code remain unclear, we may choose to discard your code: that is not an insult, we frequently discard our own code. We may also consider various alternatives and choose another path. Again, that is not an insult or a sign that you have wasted your time.
-
-Style
------
-
-Our formatting style is inspired by the LLVM style.
-The simdjson library is written using the snake case: when a variable or a function is a phrase,  each space is replaced by an underscore character, and the first letter of each word written in lowercase.  Compile-time constants are written entirely in uppercase with the same underscore convention.
-
-Code of Conduct
----------------
-
-Though we do not have a formal code of conduct, we will not tolerate bullying, bigotry or
-intimidation. Everyone is welcome to contribute. If you have concerns, you can raise them privately with the core team members (e.g., D. Lemire, J. Keiser).
-
-We welcome contributions from women and less represented groups. If you need help, please reach out.
-
-Consider the following points when engaging with the project:
-
-- We discourage arguments from authority: ideas are discusssed on their own merits and not based on who stated it.
-- Be mindful that what you may view as an aggression is maybe merely a difference of opinion or a misunderstanding.
-- Be mindful that a collection of small aggressions, even if mild in isolation, can become harmful.
-
-Getting Started Hacking
------------------------
-
-An overview of simdjson's directory structure, with pointers to architecture and design
-considerations and other helpful notes, can be found at [HACKING.md](HACKING.md).

CONTRIBUTORS

@@ -1,39 +0,0 @@
-# contributors (in no particular order)
-Thomas Navennec
-Kai Wolf
-Tyler Kennedy
-Frank Wessels
-George Fotopoulos
-Heinz N. Gies
-Emil Gedda
-Wojciech Muła
-Georgios Floros
-Dong Xie
-Nan Xiao
-Egor Bogatov
-Jinxi Wang
-Luiz Fernando Peres
-Wouter Bolsterlee
-Anish Karandikar
-Reini Urban
-Tom Dyson
-Ihor Dotsenko
-Alexey Milovidov
-Chang Liu
-Sunny Gleason
-John Keiser
-Zach Bjornson
-Vitaly Baranov
-Juho Lauri
-Michael Eisel
-Io Daza Dillon
-Paul Dreik
-Jeremie Piotte
-Matthew Wilson
-Dušan Jovanović
-Matjaž Ostroveršnik
-Nong Li
-Furkan Taşkale
-Brendan Knapp
-# if you have contributed to the project and your name does not 
-# appear in this list, please let us know!

Dockerfile

@@ -1,88 +0,0 @@
-###
-#
-# Though simdjson requires only commonly available compilers and tools, it can
-# be convenient to build it and test it inside a docker container: it makes it
-# possible to test and benchmark simdjson under even relatively out-of-date
-# Linux servers. It should also work under macOS and Windows, though not
-# at native speeds, maybe.
-#
-# Assuming that you have a working docker server, this file
-# allows you to build, test and benchmark simdjson.
-#
-#  We build the library and associated files in the dockerbuild subdirectory.
-# It may be necessary to delete it before creating the image:
-#
-# rm -r -f dockerbuild
-#
-# The need to delete the directory has nothing to do with docker per se: it is
-# simply cleaner in CMake to start from a fresh directory. This is important: if you
-# reuse the same directory with different configurations, you may get broken builds.
-#
-#
-# Then you can build the image as follows:
-#
-# docker build -t simdjson --build-arg USER_ID=$(id -u)  --build-arg GROUP_ID=$(id -g) .
-#
-# Please note that the image does not contain a copy of the code. However, the image will contain the
-# the compiler and the build system. This means that if you change the source code, after you have built
-# the image, you won't need to rebuild the image. In fact, unless you want to try a different compiler, you
-# do not need to ever rebuild the image, even if you do a lot of work on the source code.
-#
-# We specify the users to avoid having files owned by a privileged user (root) in our directory. Some
-# people like to run their machine as the "root" user. We do not think it is cool.
-#
-# Then you need to build the project:
-#
-# docker run  -v $(pwd):/project:Z  simdjson
-#
-# Should you change a source file, you may need to call this command again. Because the output
-# files are persistent between calls to this command (they reside in the dockerbuild directory),
-# this command can be fast.
-#
-# Next you can test it as follows:
-#
-# docker run -it -v $(pwd):/project:Z   simdjson sh -c "cd dockerbuild && ctest . --output-on-failure -E checkperf"
-#
-# The run the complete tests requires you to have built all of simdjson.
-#
-# Building all of simdjson takes a long time. Instead, you can build just one target:
-#
-# docker run -it -v $(pwd):/project:Z  simdjson sh -c "[ -d dockerbuild ] || mkdir dockerbuild && cd dockerbuild && cmake ..  && cmake --build . --target parse"
-#
-# Note that it is safe to remove dockerbuild before call the previous command, as the repository gets rebuild. It is also possible, by changing the command, to use a different directory name.
-#
-# You can run performance tests:
-#
-# docker run -it --privileged -v $(pwd):/project:Z  simdjson sh -c "cd dockerbuild && for i in ../jsonexamples/*.json; do echo \$i; ./benchmark/parse \$i;  done"
-#
-# The "--privileged" is recommended so you can get performance counters under Linux.
-#
-# You can also grab a fresh copy of simdjson and rebuild it, to make comparisons:
-#
-# docker run -it -v $(pwd):/project:Z  simdjson sh -c "git clone https://github.com/simdjson/simdjson.git && cd simdjson && mkdir build && cd build && cmake .. && cmake --build . --target parse "
-#
-# Then you can run comparisons:
-#
-# docker run -it --privileged -v $(pwd):/project:Z  simdjson sh -c "for i in jsonexamples/*.json; do echo \$i; dockerbuild/benchmark/parse \$i| grep GB| head -n 1; simdjson/build/benchmark/parse \$i | grep GB |head -n 1;  done"
-#
-####
-FROM ubuntu:20.10
-################
-# We would prefer to use the conan io images but they do not support 64-bit ARM? The small gcc images appear to
-# be broken on ARM.
-# Furthermore, we would not expect users to frequently rebuild the container, so using ubuntu is probably fine.
-###############
-ARG USER_ID
-ARG GROUP_ID
-RUN apt-get update -qq
-RUN DEBIAN_FRONTEND="noninteractive" apt-get -y install tzdata
-RUN apt-get install -y cmake g++ git
-RUN mkdir project
-
-RUN addgroup --gid $GROUP_ID user; exit 0
-RUN adduser --disabled-password --gecos '' --uid $USER_ID --gid $GROUP_ID user; exit 0
-USER user
-RUN gcc --version
-WORKDIR /project
-
-CMD ["sh","-c","[ -d dockerbuild ] || mkdir dockerbuild && cd dockerbuild && cmake .. && cmake --build . "]

HACKING.md

@@ -1,292 +0,0 @@
-Hacking simdjson
-================
-
-Here is wisdom about how to build, test and run simdjson from within the repository. This is mostly useful for people who plan to contribute simdjson, or maybe study the design.
-
-If you plan to contribute to simdjson, please read our [CONTRIBUTING](https://github.com/simdjson/simdjson/blob/master/CONTRIBUTING.md) guide.
-
-
-Design notes
-------------------------------
-
-The parser works in two stages:
-
-- Stage 1. (Find marks) Identifies quickly structure elements, strings, and so forth. We validate UTF-8 encoding at that stage.
-- Stage 2. (Structure building) Involves constructing a "tree" of sort (materialized as a tape) to navigate through the data. Strings and numbers are parsed at this stage.
-
-
-The role of stage 1 is to identify pseudo-structural characters as quickly as possible. A character is pseudo-structural if and only if:
-
-1. Not enclosed in quotes, AND
-2. Is a non-whitespace character, AND
-3. Its preceding character is either:
-   (a) a structural character, OR
-   (b) whitespace OR
-   (c) the final quote in a string.
-
-This helps as we redefine some new characters as pseudo-structural such as the characters 1, G, n in the following:
-
-> { "foo" : 1.5, "bar" : 1.5 GEOFF_IS_A_DUMMY bla bla , "baz", null }
-
-Stage 1 also does unicode validation.
-
-Stage 2 handles all of the rest: number parsings, recognizing atoms like true, false, null, and so forth.
-
-
-Directory Structure and Source
-------------------------------
-
-simdjson's source structure, from the top level, looks like this:
-
-* **CMakeLists.txt:** The main build system.
-* **include:** User-facing declarations and inline definitions (most user-facing functions are inlined).
-  * simdjson.h: A "main include" that includes files from include/simdjson/. This is equivalent to
-    the distributed simdjson.h.
-  * simdjson/*.h: Declarations for public simdjson classes and functions.
-  * simdjson/*-inl.h: Definitions for public simdjson classes and functions.
-* **src:** The source files for non-inlined functionality (e.g. the architecture-specific parser
-  implementations).
-  * simdjson.cpp: A "main source" that includes all implementation files from src/. This is
-    equivalent to the distributed simdjson.cpp.
-  * arm64/|fallback/|haswell/|westmere/: Architecture-specific implementations. All functions are
-    Each architecture defines its own namespace, e.g. simdjson::haswell.
-  * generic/: Generic implementations of the simdjson parser. These files may be included and
-    compiled multiple times, from whichever architectures use them. They assume they are already
-    enclosed in a namespace, e.g.:
-    ```c++
-    namespace simdjson {
-      namespace haswell {
-        #include "generic/stage1/json_structural_indexer.h"
-      }
-    }
-    ```
-
-Other important files and directories:
-* **.drone.yml:** Definitions for Drone CI.
-* **.appveyor.yml:** Definitions for Appveyor CI (Windows).
-* **.circleci:** Definitions for Circle CI.
-* **.github/workflows:** Definitions for GitHub Actions (CI).
-* **singleheader:** Contains generated `simdjson.h` and `simdjson.cpp` that we release. The files `singleheader/simdjson.h` and `singleheader/simdjson.cpp` should never be edited by hand.
-* **singleheader/amalgamate.sh:** Generates `singleheader/simdjson.h` and `singleheader/simdjson.cpp` for release (bash script). 
-* **benchmark:** This is where we do benchmarking. Benchmarking is core to every change we make; the
-  cardinal rule is don't regress performance without knowing exactly why, and what you're trading
-  for it. Many of our benchmarks are microbenchmarks. We are effectively doing controlled scientific experiments for the purpose of understanding what affects our performance. So we simplify as much as possible. We try to avoid irrelevant factors such as page faults, interrupts, unnnecessary system calls. We recommend checking the performance as follows:
-  ```bash
-  mkdir build
-  cd build
-  cmake ..
-  cmake --build . --config Release
-  benchmark/parse ../jsonexamples/twitter.json
-  ```
-  The last line becomes `./benchmark/Release/parse.exe ../jsonexample/twitter.json` under Windows. You may also use Google Benchmark:
-  ```bash
-  mkdir build
-  cd build
-  cmake ..
-  cmake --build . --target bench_parse_call --config Release
-  ./benchmark/bench_parse_call
-  ```
-  The last line becomes `./benchmark/Release/bench_parse_call.exe` under Windows. Under Windows, you can also build with the clang compiler by adding `-T ClangCL` to the call to `cmake ..`: `cmake .. - TClangCL`.
-* **fuzz:** The source for fuzz testing. This lets us explore important edge and middle cases
-* **fuzz:** The source for fuzz testing. This lets us explore important edge and middle cases
-  automatically, and is run in CI.
-* **jsonchecker:** A set of JSON files used to check different functionality of the parser.
-  * **pass*.json:** Files that should pass validation.
-  * **fail*.json:** Files that should fail validation.
-  * **jsonchecker/minefield/y_*.json:** Files that should pass validation.
-  * **jsonchecker/minefield/n_*.json:** Files that should fail validation.
-* **jsonexamples:** A wide spread of useful, real-world JSON files with different characteristics
-  and sizes.
-* **test:** The tests are here. basictests.cpp and errortests.cpp are the primary ones.
-* **tools:** Source for executables that can be distributed with simdjson. Some examples:
-  * `json2json mydoc.json` parses the document, constructs a model and then dumps back the result to standard output.
-  * `json2json -d mydoc.json` parses the document, constructs a model and then dumps model (as a tape) to standard output. The tape format is described in the accompanying file `tape.md`.
-  * `minify mydoc.json` minifies the JSON document, outputting the result to standard output. Minifying means to remove the unneeded white space characters.
-  *`jsonpointer mydoc.json <jsonpath> <jsonpath> ... <jsonpath>` parses the document, constructs a model and then processes a series of [JSON Pointer paths](https://tools.ietf.org/html/rfc6901). The result is itself a JSON document.
-
-
-> **Don't modify the files in singleheader/ directly; these are automatically generated.**
-
-
-While simdjson distributes just two files from the singleheader/ directory, we *maintain* the code in
-multiple files under include/ and src/. The files include/simdjson.h and src/simdjson.cpp are the "spine" for
-these, and you can include them as if they were the corresponding singleheader/ files.
-
-
-
-Runtime Dispatching
---------------------
-
-A key feature of simdjson is the ability to compile different processing kernels, optimized for specific instruction sets, and to select
-the most appropriate kernel at runtime. This ensures that users get the very best performance while still enabling simdjson to run everywhere.
-This technique is frequently called runtime dispatching. The simdjson achieves runtime dispatching entirely in C++: we do not assume
-that the user is building the code using CMake, for example.
-
-To make runtime dispatching work, it is critical that the code be compiled for the lowest supported processor. In particular, you should
-not use flags such as -mavx2, /arch:AVX2 and so forth while compiling simdjson. When you do so, you allow the compiler to use advanced
-instructions. In turn, these advanced instructions present in the code may cause a runtime failure if the runtime processor does not
-support them. Even a simple loop, compiled with these flags, might generate binary code that only run on advanced processors.
-
-So we compile simdjson for a generic processor. Our users should do the same if they want simdjson's runtime dispatch to work. It is important
-to understand that if runtime dispatching does not work, then simdjson will cause crashes on older processors. Of course, if a user chooses
-to compile their code for a specific instruction set (e.g., AVX2), they are responsible for the failures if they later run their code
-on a processor that does not support AVX2. Yet, if we were to entice these users to do so, we would share the blame: thus we carefully instruct
-users to compile their code in a generic way without doing anything to enable advanced instructions.
-
-
-We only use runtime dispatching on x64 (AMD/Intel) platforms, at the moment. On ARM processors, we would need a standard way to query, at runtime,
-the processor for its supported features. We do not know how to do so on ARM systems in general. Thankfully it is not yet a concern: 64-bit ARM
-processors are fairly uniform as far as the instruction sets they support.
-
-
-In all cases, simdjson uses advanced instructions by relying on  "intrinsic functions": we do not write assembly code. The intrinsic functions
-are special functions that the compiler might recognize and translate into fast code. To make runtime dispatching work, we rely on the fact that
-the header providing these instructions
-(intrin.h under Visual Studio, x86intrin.h elsewhere) defines all of the intrinsic functions, including those that are not supported
-processor.
-
-At this point, we are require to use one of two main strategies.
-
-1. On POSIX systems, the main compilers (LLVM clang, GNU gcc) allow us to use any intrinsic function after including the header, but they fail to inline the resulting instruction if the target processor does not support them. Because we compile for a generic processor, we would not be able to use most intrinsic functions. Thankfully, more recent versions of these compilers allow us to flag a region of code with a specific target, so that we can compile only some of the code with support for advanced instructions. Thus in our C++, one might notice macros like `TARGET_HASWELL`. It is then our responsability, at runtime, to only run the regions of code (that we call kernels) matching the properties of the runtime processor. The benefit of this approach is that the compiler not only let us use intrinsic functions, but it can also optimize the rest of the code in the kernel with advanced instructions we enabled.
-
-2. Under Visual Studio, the problem is somewhat simpler. Visual Studio will not only provide the intrinsic functions, but it will also allow us to use them. They will compile just fine. It is at runtime that they may cause a crash. So we do not need to mark regions of code for compilation toward advanced processors (e.g., with  `TARGET_HASWELL` macros). The downside of the Visual Studio approach is that the compiler is not allowed to use advanced instructions others than those we specify. In principle, this means that Visual Studio has weaker optimization opportunities.
-
-
-
-We also handle the special case where a user is compiling using LLVM clang under Windows, [using the Visual Studio toolchain](https://devblogs.microsoft.com/cppblog/clang-llvm-support-in-visual-studio/). If you compile with LLVM clang under Visual Studio, then the header files (intrin.h or x86intrin.h) no longer provides the intrinsic functions that are unsupported by the processor. This appears to be deliberate on the part of the LLVM engineers. With a few lines of code, we handle this scenario just like LLVM clang under a POSIX system, but forcing the inclusion of the specific headers, and rolling our own intrinsic function as needed.
-
-
-
-
-
-Regenerating Single-Header Files
----------------------------------------
-
-The simdjson.h and simdjson.cpp files in the singleheader directory are not always up-to-date with the rest of the code; they are only ever
-systematically regenerated on releases. To ensure you have the latest code, you can regenerate them by running this at the top level:
-
-```bash
-mkdir build
-cd build
-cmake ..
-cmake --build . --target amalgamate
-```
-
-You need to have a working bash on your system.
-
-The amalgamator script is `amalgamate.sh` generates singleheader/simdjson.h by
-reading through include/simdjson.h, copy/pasting each header file into the amalgamated file at the
-point it gets included (but only once per header). singleheader/simdjson.cpp is generated from
-src/simdjson.cpp the same way, except files under generic/ may be included and copy/pasted multiple
-times.
-
-### Usage (CMake on 64-bit platforms like Linux, FreeBSD or macOS)
-
-Requirements: In addition to git, we require a recent version of CMake as well as bash.
-
-1. On macOS, the easiest way to install cmake might be to use [brew](https://brew.sh) and then type
-```
-brew install cmake
-```
-2. Under Linux, you might be able to install CMake as follows:
-```
-apt-get update -qq
-apt-get install -y cmake
-```
-3. On FreeBSD, you might be able to install bash and CMake as follows:
-```
-pkg update -f
-pkg install bash
-pkg install cmake
-```
-
-You need a recent compiler like clang or gcc. We recommend at least GNU GCC/G++ 7 or LLVM clang 6.
-
-
-Building: While in the project repository, do the following:
-
-```
-mkdir build
-cd build
-cmake ..
-cmake --build .
-ctest
-```
-
-CMake will build a library. By default, it builds a shared library (e.g., libsimdjson.so on Linux).
-
-You can build a static library:
-
-```
-mkdir buildstatic
-cd buildstatic
-cmake -DSIMDJSON_BUILD_STATIC=ON ..
-cmake --build .
-ctest
-```
-
-In some cases, you may want to specify your compiler, especially if the default compiler on your system is too old.  You need to tell cmake which compiler you wish to use by setting the CC and CXX variables. Under bash, you can do so with commands such as `export CC=gcc-7` and `export CXX=g++-7`. You can also do it as part of the `cmake` command: `cmake .. -DCMAKE_CXX_COMPILER=g++`.  You may proceed as follows:
-
-```
-brew install gcc@8
-mkdir build
-cd build
-export CXX=g++-8 CC=gcc-8
-cmake ..
-cmake --build .
-ctest
-```
-
-If your compiler does not default on C++11 support or better you may get failing tests. If so, you may be able to exclude the failing  tests by replacing `ctest` with `ctest  -E "^quickstart$"`.
-
-Note that the name of directory (`build`) is arbitrary, you can name it as you want (e.g., `buildgcc`) and you can have as many different such directories as you would like (one per configuration).
-
-
-
-### Usage (CMake on 64-bit Windows using Visual Studio 2019)
-
-We assume you have a common 64-bit Windows PC with at least Visual Studio 2019.
-
-- Grab the simdjson code from GitHub, e.g., by cloning it using [GitHub Desktop](https://desktop.github.com/).
-- Install [CMake](https://cmake.org/download/). When you install it, make sure to ask that `cmake` be made available from the command line. Please choose a recent version of cmake.
-- Create a subdirectory within simdjson, such as `build`.
-- Using a shell, go to this newly created directory. You can start a shell directly from GitHub Desktop (Repository > Open in Command Prompt).
-- Type `cmake  ..` in the shell while in the `build` repository. 
-- This last command (`cmake ...`) created a Visual Studio solution file in the newly created directory (e.g., `simdjson.sln`). Open this file in Visual Studio. You should now be able to build the project and run the tests. For example, in the `Solution Explorer` window (available from the `View` menu), right-click `ALL_BUILD` and select `Build`. To test the code, still in the `Solution Explorer` window, select `RUN_TESTS` and select `Build`.
-
-
-Though having Visual Studio installed is necessary, one can build simdjson using only cmake commands:
-
-- `mkdir build`
-- `cd build`
-- `cmake ..`
-- `cmake --build . -config Release`
-
-
-Furthermore, if you have installed LLVM clang on Windows, for example as a component of Visual Studio 2019, you can configure and build simdjson using LLVM clang on Windows using cmake:
-
-
-- `mkdir build`
-- `cd build`
-- `cmake ..  -T ClangCL`
-- `cmake --build . -config Release`
-
-
-### Various References
-
-- [How to implement atoi using SIMD?](https://stackoverflow.com/questions/35127060/how-to-implement-atoi-using-simd)
-- [Parsing JSON is a Minefield 💣](http://seriot.ch/parsing_json.php)
-- https://tools.ietf.org/html/rfc7159
-- http://rapidjson.org/md_doc_sax.html
-- https://github.com/Geal/parser_benchmarks/tree/master/json
-- Gron: A command line tool that makes JSON greppable https://news.ycombinator.com/item?id=16727665
-- GoogleGson https://github.com/google/gson
-- Jackson https://github.com/FasterXML/jackson
-- https://www.yelp.com/dataset_challenge
-- RapidJSON. http://rapidjson.org/
-
-Inspiring links:
-
-- https://auth0.com/blog/beating-json-performance-with-protobuf/
-- https://gist.github.com/shijuvar/25ad7de9505232c87034b8359543404a
-- https://github.com/frankmcsherry/blog/blob/master/posts/2018-02-11.md

LICENSE

@@ -1,201 +0,0 @@
-                                 Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2018-2019 The simdjson authors 
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.

README.md

@@ -1,206 +0,0 @@
-[![Fuzzing Status](https://oss-fuzz-build-logs.storage.googleapis.com/badges/simdjson.svg)](https://bugs.chromium.org/p/oss-fuzz/issues/list?sort=-opened&q=proj%3Asimdjson&can=2)
-![Ubuntu 18.04 CI](https://github.com/simdjson/simdjson/workflows/Ubuntu%2018.04%20CI%20(GCC%207)/badge.svg)
-[![Ubuntu 20.04 CI](https://github.com/simdjson/simdjson/workflows/Ubuntu%2020.04%20CI%20(GCC%209)/badge.svg)](https://simdjson.org/plots.html)
-![VS16-CI](https://github.com/simdjson/simdjson/workflows/VS16-CI/badge.svg)
-![MinGW64-CI](https://github.com/simdjson/simdjson/workflows/MinGW64-CI/badge.svg)
-[![][license img]][license]  [![Doxygen Documentation](https://img.shields.io/badge/docs-doxygen-green.svg)](https://simdjson.org/api/0.6.0/index.html)
-
-simdjson : Parsing gigabytes of JSON per second
-===============================================
-
-<img src="images/logo.png" width="10%" style="float: right">
-JSON is everywhere on the Internet. Servers spend a *lot* of time parsing it. We need a fresh
-approach. The simdjson library uses commonly available SIMD instructions and microparallel algorithms
-to parse JSON 2.5x  faster than RapidJSON and 25x faster than JSON for Modern C++.
-
-* **Fast:** Over 2.5x faster than commonly used production-grade JSON parsers.
-* **Record Breaking Features:** Minify JSON  at 6 GB/s, validate UTF-8  at 13 GB/s,  NDJSON at 3.5 GB/s.
-* **Easy:** First-class, easy to use and carefully documented APIs.
-* **Beyond DOM:** Try the new On Demand API for twice the speed (>4GB/s).
-* **Strict:** Full JSON and UTF-8 validation, lossless parsing. Performance with no compromises.
-* **Automatic:** Selects a CPU-tailored parser at runtime. No configuration needed.
-* **Reliable:** From memory allocation to error handling, simdjson's design avoids surprises.
-* **Peer Reviewed:** Our research appears in venues like VLDB Journal, Software: Practice and Experience.
-
-This library is part of the [Awesome Modern C++](https://awesomecpp.com) list.
-
-Table of Contents
------------------
-
-* [Quick Start](#quick-start)
-* [Documentation](#documentation)
-* [Performance results](#performance-results)
-* [Real-world usage](#real-world-usage)
-* [Bindings and Ports of simdjson](#bindings-and-ports-of-simdjson)
-* [About simdjson](#about-simdjson)
-* [Funding](#funding)
-* [Contributing to simdjson](#contributing-to-simdjson)
-* [License](#license)
-
-Quick Start
------------
-
-          
-The simdjson library is easily consumable with a single .h and .cpp file.
-
-0. Prerequisites: `g++` (version 7 or better) or `clang++` (version 6 or better), and a 64-bit system with a command-line shell (e.g., Linux, macOS, freeBSD). We also support programming environnements like Visual Studio and Xcode, but different steps are needed.
-1. Pull [simdjson.h](singleheader/simdjson.h) and [simdjson.cpp](singleheader/simdjson.cpp) into a directory, along with the sample file [twitter.json](jsonexamples/twitter.json).
-   ```
-   wget https://raw.githubusercontent.com/simdjson/simdjson/master/singleheader/simdjson.h https://raw.githubusercontent.com/simdjson/simdjson/master/singleheader/simdjson.cpp https://raw.githubusercontent.com/simdjson/simdjson/master/jsonexamples/twitter.json
-   ```
-2. Create `quickstart.cpp`:
-
-   ```c++
-   #include "simdjson.h"
-   int main(void) {
-     simdjson::dom::parser parser;
-     simdjson::dom::element tweets = parser.load("twitter.json");
-     std::cout << tweets["search_metadata"]["count"] << " results." << std::endl;
-   }
-   ```
-3. `c++ -o quickstart quickstart.cpp simdjson.cpp`
-4. `./quickstart`
-   ```
-   100 results.
-   ```
-
-Documentation
--------------
-
-Usage documentation is available:
-
-* [Basics](doc/basics.md) is an overview of how to use simdjson and its APIs.
-* [Performance](doc/performance.md) shows some more advanced scenarios and how to tune for them.
-* [Implementation Selection](doc/implementation-selection.md) describes runtime CPU detection and
-  how you can work with it.
-* [API](https://simdjson.org/api/0.6.0/annotated.html) contains the automatically generated API documentation.
-
-Performance results
--------------------
-
-The simdjson library uses three-quarters less instructions than state-of-the-art parser [RapidJSON](https://rapidjson.org) and
-fifty percent less than sajson. To our knowledge, simdjson is the first fully-validating JSON parser
-to run at [gigabytes per second](https://en.wikipedia.org/wiki/Gigabyte) (GB/s) on commodity processors. It can parse millions of JSON documents per second on a single core.
-
-The following figure represents parsing speed in GB/s for parsing various files
-on an Intel Skylake processor (3.4 GHz) using the GNU GCC 9 compiler (with the -O3 flag).
-We compare against the best and fastest C++ libraries.
-The simdjson library offers full unicode ([UTF-8](https://en.wikipedia.org/wiki/UTF-8)) validation and exact
-number parsing. The RapidJSON library is tested in two modes: fast and
-exact number parsing. The sajson library offers fast (but not exact)
-number parsing and partial unicode validation. In this data set, the file
-sizes range from 65KB (github_events) all the way to 3.3GB (gsoc-2018).
-Many files are mostly made of numbers: canada, mesh.pretty, mesh, random
-and numbers: in such instances, we see lower JSON parsing speeds due to the
-high cost of number parsing. The simdjson library uses exact number parsing which
-is particular taxing.
-
-<img src="doc/gbps.png" width="90%">
-
-On a Skylake processor, the parsing speeds (in GB/s) of various processors on the twitter.json file are as follows, using again GNU GCC 9.1 (with the -O3 flag). The popular JSON for Modern C++ library is particularly slow: it obviously trades parsing speed for other desirable features.
-
-| parser                                | GB/s |
-| ------------------------------------- | ---- |
-| simdjson                              | 2.5  |
-| RapidJSON UTF8-validation             | 0.29 |
-| RapidJSON UTF8-valid., exact numbers  | 0.28 |
-| RapidJSON insitu, UTF8-validation     | 0.41 |
-| RapidJSON insitu, UTF8-valid., exact  | 0.39 |
-| sajson (insitu, dynamic)              | 0.62 |
-| sajson (insitu, static)               | 0.88 |
-| dropbox                               | 0.13 |
-| fastjson                              | 0.27 |
-| gason                                 | 0.59 |
-| ultrajson                             | 0.34 |
-| jsmn                                  | 0.25 |
-| cJSON                                 | 0.31 |
-| JSON for Modern C++ (nlohmann/json)   | 0.11 |
-
-
-The simdjson library offers high speed whether it processes tiny files (e.g., 300 bytes)
-or larger files (e.g., 3MB). The following plot presents parsing
-speed for [synthetic files over various sizes generated with a script](https://github.com/simdjson/simdjson_experiments_vldb2019/blob/master/experiments/growing/gen.py) on a 3.4 GHz Skylake processor (GNU GCC 9, -O3).
-<img src="doc/growing.png" width="90%">
-
-[All our experiments are reproducible](https://github.com/simdjson/simdjson_experiments_vldb2019).
-
-
-You can go beyond 4 GB/s with our new [On Demand API](https://github.com/simdjson/simdjson/blob/master/doc/ondemand.md).
-For NDJSON files, we can exceed 3 GB/s with [our  multithreaded parsing functions](https://github.com/simdjson/simdjson/blob/master/doc/parse_many.md).
-
-
-
-Real-world usage
-----------------
-
-- [Microsoft FishStore](https://github.com/microsoft/FishStore)
-- [Yandex ClickHouse](https://github.com/yandex/ClickHouse)
-- [Clang Build Analyzer](https://github.com/aras-p/ClangBuildAnalyzer)
-- [Shopify HeapProfiler](https://github.com/Shopify/heap-profiler)
-
-If you are planning to use simdjson in a product, please work from one of our releases.
-
-Bindings and Ports of simdjson
-------------------------------
-
-We distinguish between "bindings" (which just wrap the C++ code) and a port to another programming language (which reimplements everything).
-
-- [ZippyJSON](https://github.com/michaeleisel/zippyjson): Swift bindings for the simdjson project.
-- [libpy_simdjson](https://github.com/gerrymanoim/libpy_simdjson/): high-speed Python bindings for simdjson using [libpy](https://github.com/quantopian/libpy).
-- [pysimdjson](https://github.com/TkTech/pysimdjson): Python bindings for the simdjson project.
-- [simdjson-rs](https://github.com/simd-lite): Rust port.
-- [simdjson-rust](https://github.com/SunDoge/simdjson-rust): Rust wrapper (bindings).
-- [SimdJsonSharp](https://github.com/EgorBo/SimdJsonSharp): C# version for .NET Core (bindings and full port).
-- [simdjson_nodejs](https://github.com/luizperes/simdjson_nodejs): Node.js bindings for the simdjson project.
-- [simdjson_php](https://github.com/crazyxman/simdjson_php): PHP bindings for the simdjson project.
-- [simdjson_ruby](https://github.com/saka1/simdjson_ruby): Ruby bindings for the simdjson project.
-- [fast_jsonparser](https://github.com/anilmaurya/fast_jsonparser): Ruby bindings for the simdjson project.
-- [simdjson-go](https://github.com/minio/simdjson-go): Go port using Golang assembly.
-- [rcppsimdjson](https://github.com/eddelbuettel/rcppsimdjson): R bindings.
-- [simdjson_erlang](https://github.com/ChomperT/simdjson_erlang): erlang bindings.
-
-
-About simdjson
---------------
-
-The simdjson library takes advantage of modern microarchitectures, parallelizing with SIMD vector
-instructions, reducing branch misprediction, and reducing data dependency to take advantage of each
-CPU's multiple execution cores.
-
-Some people [enjoy reading our paper](https://arxiv.org/abs/1902.08318): A description of the design
-and implementation of simdjson is in our research article: 
-- Geoff Langdale, Daniel Lemire, [Parsing Gigabytes of JSON per Second](https://arxiv.org/abs/1902.08318), VLDB Journal 28 (6), 2019.
-
-We have an in-depth paper focused on the UTF-8 validation:
-
-- John Keiser, Daniel Lemire, [Validating UTF-8 In Less Than One Instruction Per Byte](https://arxiv.org/abs/2010.03090), Software: Practice & Experience (to appear)
-
-We also have an informal [blog post providing some background and context](https://branchfree.org/2019/02/25/paper-parsing-gigabytes-of-json-per-second/).
-
-For the video inclined, <br />
-[![simdjson at QCon San Francisco 2019](http://img.youtube.com/vi/wlvKAT7SZIQ/0.jpg)](http://www.youtube.com/watch?v=wlvKAT7SZIQ)<br />
-(it was the best voted talk, we're kinda proud of it).
-
-Funding
--------
-
-The work is supported by the Natural Sciences and Engineering Research Council of Canada under grant
-number RGPIN-2017-03910.
-
-[license]: LICENSE
-[license img]: https://img.shields.io/badge/License-Apache%202-blue.svg
-
-Contributing to simdjson
-------------------------
-
-Head over to [CONTRIBUTING.md](CONTRIBUTING.md) for information on contributing to simdjson, and
-[HACKING.md](HACKING.md) for information on source, building, and architecture/design.
-
-License
--------
-
-This code is made available under the [Apache License 2.0](https://www.apache.org/licenses/LICENSE-2.0.html).
-
-Under Windows, we build some tools using the windows/dirent_portable.h file (which is outside our library code): it under the liberal (business-friendly) MIT license.
-
-For compilers that do not support [C++17](https://en.wikipedia.org/wiki/C%2B%2B17), we bundle the string-view library which is published under the Boost license (http://www.boost.org/LICENSE_1_0.txt). Like the Apache license, the Boost license is a permissive license allowing commercial redistribution.

RELEASES.md

@@ -1,69 +0,0 @@
-# 0.5
-
-## Highlights
-
-Performance
-* Faster and simpler UTF-8 validation with the lookup4 algorithm https://github.com/simdjson/simdjson/pull/993
-* We improved the performance of simdjson under Visual Studio by about 25%. Users will still get better performance with clang-cl (+30%) but the gap has been reduced. https://github.com/simdjson/simdjson/pull/1031
-
-Code usability
-* In `parse_many`, when parsing streams of JSON documetns, we give to the users runtime control as to whether threads are used (via the parser.threaded attribute). https://github.com/simdjson/simdjson/issues/925
-* Prefixed public macros to avoid name clashes with other libraries. https://github.com/simdjson/simdjson/issues/1035
-* Better documentation regarding package managers (brew, MSYS2, conan, apt, vcpkg, FreeBSD package manager, etc.).
-* Better documentation regarding  CMake usage.
-
-Standards
-* We improved standard compliance with respect to both the JSON RFC 8259 and JSON Pointer RFC 6901. We added the at_pointer method to nodes for standard-compliant JSON Pointer queries. The legacy `at(std::string_view)` method remains but is deprecated since it is not standard-compliant as per  RFC 6901.
-* We removed computed GOTOs without sacrificing performance thus improving the C++ standard compliance (since computed GOTOs are compiler-specific extensions).
-* Better support for C++20 https://github.com/simdjson/simdjson/pull/1050
-
-# 0.4
-
-## Highlights
-
-- Test coverage has been greatly improved and we have resolved many static-analysis warnings on different systems.
-- We added a fast (8GB/s) minifier that works directly on JSON strings.
-- We added fast (10GB/s) UTF-8 validator that works directly on strings (any strings, including non-JSON).
-- The array and object elements have a constant-time size() method.
-- Performance improvements to the API (type(), get<>()).
-- The parse_many function (ndjson) has been entirely reworked. It now uses a single secondary thread instead of several new threads.
-- We have introduced a faster UTF-8 validation algorithm (lookup3) for all kernels (ARM, x64 SSE, x64 AVX).
-- C++11 support for older compilers and systems.
-- FreeBSD support (and tests).
-- We support the clang front-end compiler (clangcl) under Visual Studio.
-- It is now possible to target ARM platforms under Visual Studio.
-- The simdjson library will never abort or print to standard output/error.
-
-# 0.3
-
-## Highlights
-
-- **Multi-Document Parsing:** Read a bundle of JSON documents (ndjson) 2-4x faster than doing it
-  individually. [API docs](https://github.com/simdjson/simdjson/blob/master/doc/basics.md#newline-delimited-json-ndjson-and-json-lines) / [Design Details](https://github.com/simdjson/simdjson/blob/master/doc/parse_many.md)
-- **Simplified API:** The API has been completely revamped for ease of use, including a new JSON
-  navigation API and fluent support for error code *and* exception styles of error handling with a
-  single API. [Docs](https://github.com/simdjson/simdjson/blob/master/doc/basics.md#the-basics-loading-and-parsing-json-documents)
-- **Exact Float Parsing:** Now simdjson parses floats flawlessly *without* any performance loss,
-  thanks to [great work by @michaeleisel and @lemire](https://github.com/simdjson/simdjson/pull/558).
-  [Blog Post](https://lemire.me/blog/2020/03/10/fast-float-parsing-in-practice/)
-- **Even Faster:** The fastest parser got faster! With a [shiny new UTF-8 validator](https://github.com/simdjson/simdjson/pull/387)
-  and meticulously refactored SIMD core, simdjson 0.3 is 15% faster than before, running at 2.5 GB/s
-  (where 0.2 ran at 2.2 GB/s).
-
-## Minor Highlights
-
-- Fallback implementation: simdjson now has a non-SIMD fallback implementation, and can run even on
-  very old 64-bit machines.
-- Automatic allocation: as part of API simplification, the parser no longer has to be preallocated--
-  it will adjust automatically when it encounters larger files.
-- Runtime selection API: We've exposed simdjson's runtime CPU detection and implementation selection
-  as an API, so you can tell what implementation we detected and test with other implementations.
-- Error handling your way: Whether you use exceptions or check error codes, simdjson lets you handle
-  errors in your style. APIs that can fail return simdjson_result<T>, letting you check the error
-  code before using the result. But if you are more comfortable with exceptions, skip the error code
-  and cast straight to T, and exceptions will be thrown automatically if an error happens. Use the
-  same API either way!
-- Error chaining: We also worked to keep non-exception error-handling short and sweet. Instead of
-  having to check the error code after every single operation, now you can *chain* JSON navigation
-  calls like looking up an object field or array element, or casting to a string, so that you only
-  have to check the error code once at the very end.

amalgamated_8h_source.html

@@ -0,0 +1,127 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/generic/amalgamated.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('amalgamated_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">amalgamated.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#if defined(SIMDJSON_CONDITIONAL_INCLUDE) &amp;&amp; !defined(SIMDJSON_GENERIC_DEPENDENCIES_H)</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#error simdjson/generic/dependencies.h must be included before simdjson/generic/amalgamated.h!</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/generic/base.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &quot;simdjson/generic/jsoncharutils.h&quot;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &quot;simdjson/generic/atomparsing.h&quot;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &quot;simdjson/generic/dom_parser_implementation.h&quot;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &quot;simdjson/generic/implementation_simdjson_result_base.h&quot;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &quot;simdjson/generic/numberparsing.h&quot;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &quot;simdjson/generic/implementation_simdjson_result_base-inl.h&quot;</span></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_53368a02099cf3699f2996a5d88d70b6.html">generic</a></li><li class="navelem"><b>amalgamated.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

annotated.html

@@ -0,0 +1,167 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: Class List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('annotated.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">Class List</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="textblock">Here are the classes, structs, unions and interfaces with brief descriptions:</div><div class="directory">
+<div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span><span onclick="javascript:toggleLevel(3);">3</span><span onclick="javascript:toggleLevel(4);">4</span><span onclick="javascript:toggleLevel(5);">5</span>]</div><table class="directory">
+<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacesimdjson.html" target="_self">simdjson</a></td><td class="desc">The top level simdjson namespace, containing everything the library provides </td></tr>
+<tr id="row_0_0_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_0_" class="arrow" onclick="toggleFolder('0_0_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacesimdjson_1_1dom.html" target="_self">dom</a></td><td class="desc">A DOM API on top of the simdjson parser </td></tr>
+<tr id="row_0_0_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_0_0_0_" class="arrow" onclick="toggleFolder('0_0_0_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1dom_1_1array.html" target="_self">array</a></td><td class="desc">JSON array </td></tr>
+<tr id="row_0_0_0_0_" class="odd"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1dom_1_1array_1_1iterator.html" target="_self">iterator</a></td><td class="desc"></td></tr>
+<tr id="row_0_0_1_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1dom_1_1document.html" target="_self">document</a></td><td class="desc">A parsed JSON document </td></tr>
+<tr id="row_0_0_2_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_0_0_2_" class="arrow" onclick="toggleFolder('0_0_2_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1dom_1_1document__stream.html" target="_self">document_stream</a></td><td class="desc">A forward-only stream of documents </td></tr>
+<tr id="row_0_0_2_0_" class="even"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1dom_1_1document__stream_1_1iterator.html" target="_self">iterator</a></td><td class="desc">An iterator through a forward-only stream of documents </td></tr>
+<tr id="row_0_0_3_" class="odd"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1dom_1_1element.html" target="_self">element</a></td><td class="desc">A JSON element </td></tr>
+<tr id="row_0_0_4_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1dom_1_1key__value__pair.html" target="_self">key_value_pair</a></td><td class="desc">Key/value pair in an object </td></tr>
+<tr id="row_0_0_5_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_0_0_5_" class="arrow" onclick="toggleFolder('0_0_5_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1dom_1_1object.html" target="_self">object</a></td><td class="desc">JSON object </td></tr>
+<tr id="row_0_0_5_0_" class="even"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1dom_1_1object_1_1iterator.html" target="_self">iterator</a></td><td class="desc"></td></tr>
+<tr id="row_0_0_6_" class="odd"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1dom_1_1parser.html" target="_self">parser</a></td><td class="desc">A persistent document parser </td></tr>
+<tr id="row_0_1_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_1_" class="arrow" onclick="toggleFolder('0_1_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><b>SIMDJSON_IMPLEMENTATION</b></td><td class="desc"></td></tr>
+<tr id="row_0_1_0_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_0_1_0_" class="arrow" onclick="toggleFolder('0_1_0_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><b>builder</b></td><td class="desc"></td></tr>
+<tr id="row_0_1_0_0_" class="even"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1builder_1_1string__builder.html" target="_self">string_builder</a></td><td class="desc">A builder for JSON strings representing documents </td></tr>
+<tr id="row_0_1_1_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_0_1_1_" class="arrow" onclick="toggleFolder('0_1_1_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacesimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand.html" target="_self">ondemand</a></td><td class="desc">A fast, simple, DOM-like interface that parses JSON as you use it </td></tr>
+<tr id="row_0_1_1_0_" class="even"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array.html" target="_self">array</a></td><td class="desc">A forward-only JSON array </td></tr>
+<tr id="row_0_1_1_1_" class="odd"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html" target="_self">array_iterator</a></td><td class="desc">A forward-only JSON array </td></tr>
+<tr id="row_0_1_1_2_" class="even"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1document.html" target="_self">document</a></td><td class="desc">A JSON document </td></tr>
+<tr id="row_0_1_1_3_" class="odd"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1document__reference.html" target="_self">document_reference</a></td><td class="desc">A <a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1document__reference.html" title="A document_reference is a thin wrapper around a document reference instance.">document_reference</a> is a thin wrapper around a document reference instance </td></tr>
+<tr id="row_0_1_1_4_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span id="arr_0_1_1_4_" class="arrow" onclick="toggleFolder('0_1_1_4_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1document__stream.html" target="_self">document_stream</a></td><td class="desc">A forward-only stream of documents </td></tr>
+<tr id="row_0_1_1_4_0_" class="odd"><td class="entry"><span style="width:80px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1document__stream_1_1iterator.html" target="_self">iterator</a></td><td class="desc"></td></tr>
+<tr id="row_0_1_1_5_" class="even"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1field.html" target="_self">field</a></td><td class="desc">A JSON field (key/value pair) in an object </td></tr>
+<tr id="row_0_1_1_6_" class="odd"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1number.html" target="_self">number</a></td><td class="desc">A type representing a JSON number </td></tr>
+<tr id="row_0_1_1_7_" class="even"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1object.html" target="_self">object</a></td><td class="desc">A forward-only JSON object field iterator </td></tr>
+<tr id="row_0_1_1_8_" class="odd"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1object__iterator.html" target="_self">object_iterator</a></td><td class="desc"></td></tr>
+<tr id="row_0_1_1_9_" class="even"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1parser.html" target="_self">parser</a></td><td class="desc">A JSON fragment iterator </td></tr>
+<tr id="row_0_1_1_10_" class="odd"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1raw__json__string.html" target="_self">raw_json_string</a></td><td class="desc">A string escaped per JSON rules, terminated with quote (") </td></tr>
+<tr id="row_0_1_1_11_" class="even"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1value.html" target="_self">value</a></td><td class="desc">An ephemeral JSON value returned during iteration </td></tr>
+<tr id="row_0_1_2_" class="odd"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1dom__parser__implementation.html" target="_self">dom_parser_implementation</a></td><td class="desc"></td></tr>
+<tr id="row_0_1_3_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1implementation__simdjson__result__base.html" target="_self">implementation_simdjson_result_base</a></td><td class="desc">The result of a simdjson operation that could fail </td></tr>
+<tr id="row_0_1_4_" class="odd"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1open__container.html" target="_self">open_container</a></td><td class="desc"></td></tr>
+<tr id="row_0_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1fractured__json__options.html" target="_self">fractured_json_options</a></td><td class="desc">Configuration options for FracturedJson formatting </td></tr>
+<tr id="row_0_3_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1has__custom__serialization.html" target="_self">has_custom_serialization</a></td><td class="desc"></td></tr>
+<tr id="row_0_4_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1implementation.html" target="_self">implementation</a></td><td class="desc">An implementation of simdjson for a particular CPU architecture </td></tr>
+<tr id="row_0_5_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1padded__memory__map.html" target="_self">padded_memory_map</a></td><td class="desc">A class representing a memory-mapped file with padding </td></tr>
+<tr id="row_0_6_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1padded__string.html" target="_self">padded_string</a></td><td class="desc">String with extra allocation for ease of use with parser::parse() </td></tr>
+<tr id="row_0_7_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1padded__string__builder.html" target="_self">padded_string_builder</a></td><td class="desc">Builder for constructing <a class="el" href="structsimdjson_1_1padded__string.html" title="String with extra allocation for ease of use with parser::parse()">padded_string</a> incrementally </td></tr>
+<tr id="row_0_8_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classsimdjson_1_1padded__string__view.html" target="_self">padded_string_view</a></td><td class="desc">User-provided string that promises it has extra padded bytes at the end for use with parser::parse() </td></tr>
+<tr id="row_0_9_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__error.html" target="_self">simdjson_error</a></td><td class="desc">Exception thrown when an exception-supporting simdjson method is called </td></tr>
+<tr id="row_0_10_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__result.html" target="_self">simdjson_result</a></td><td class="desc">The result of a simdjson operation that could fail </td></tr>
+<tr id="row_0_11_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__result_3_01dom_1_1array_01_4.html" target="_self">simdjson_result&lt; dom::array &gt;</a></td><td class="desc">The result of a JSON conversion that may fail </td></tr>
+<tr id="row_0_12_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__result_3_01dom_1_1document__stream_01_4.html" target="_self">simdjson_result&lt; dom::document_stream &gt;</a></td><td class="desc"></td></tr>
+<tr id="row_0_13_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__result_3_01dom_1_1element_01_4.html" target="_self">simdjson_result&lt; dom::element &gt;</a></td><td class="desc">The result of a JSON navigation that may fail </td></tr>
+<tr id="row_0_14_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__result_3_01dom_1_1object_01_4.html" target="_self">simdjson_result&lt; dom::object &gt;</a></td><td class="desc">The result of a JSON conversion that may fail </td></tr>
+<tr id="row_0_15_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array_01_4.html" target="_self">simdjson_result&lt; SIMDJSON_IMPLEMENTATION::ondemand::array &gt;</a></td><td class="desc"></td></tr>
+<tr id="row_0_16_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1document__reference_01_4.html" target="_self">simdjson_result&lt; SIMDJSON_IMPLEMENTATION::ondemand::document_reference &gt;</a></td><td class="desc"></td></tr>
+<tr id="row_0_17_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1field_01_4.html" target="_self">simdjson_result&lt; SIMDJSON_IMPLEMENTATION::ondemand::field &gt;</a></td><td class="desc"></td></tr>
+<tr id="row_0_18_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1json__iterator_01_4.html" target="_self">simdjson_result&lt; SIMDJSON_IMPLEMENTATION::ondemand::json_iterator &gt;</a></td><td class="desc"></td></tr>
+<tr id="row_0_19_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1json__type_01_4.html" target="_self">simdjson_result&lt; SIMDJSON_IMPLEMENTATION::ondemand::json_type &gt;</a></td><td class="desc"></td></tr>
+<tr id="row_0_20_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1object_01_4.html" target="_self">simdjson_result&lt; SIMDJSON_IMPLEMENTATION::ondemand::object &gt;</a></td><td class="desc"></td></tr>
+<tr id="row_0_21_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1token__iterator_01_4.html" target="_self">simdjson_result&lt; SIMDJSON_IMPLEMENTATION::ondemand::token_iterator &gt;</a></td><td class="desc"></td></tr>
+<tr id="row_0_22_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1value_01_4.html" target="_self">simdjson_result&lt; SIMDJSON_IMPLEMENTATION::ondemand::value &gt;</a></td><td class="desc"></td></tr>
+<tr id="row_0_23_" class="odd"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1value__iterator_01_4.html" target="_self">simdjson_result&lt; SIMDJSON_IMPLEMENTATION::ondemand::value_iterator &gt;</a></td><td class="desc"></td></tr>
+</table>
+</div><!-- directory -->
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

annotated_dup.js

@@ -0,0 +1,58 @@
+var annotated_dup =
+[
+    [ "simdjson", "namespacesimdjson.html", [
+      [ "dom", "namespacesimdjson_1_1dom.html", [
+        [ "array", "classsimdjson_1_1dom_1_1array.html", "classsimdjson_1_1dom_1_1array" ],
+        [ "document", "classsimdjson_1_1dom_1_1document.html", "classsimdjson_1_1dom_1_1document" ],
+        [ "document_stream", "classsimdjson_1_1dom_1_1document__stream.html", "classsimdjson_1_1dom_1_1document__stream" ],
+        [ "element", "classsimdjson_1_1dom_1_1element.html", "classsimdjson_1_1dom_1_1element" ],
+        [ "key_value_pair", "classsimdjson_1_1dom_1_1key__value__pair.html", "classsimdjson_1_1dom_1_1key__value__pair" ],
+        [ "object", "classsimdjson_1_1dom_1_1object.html", "classsimdjson_1_1dom_1_1object" ],
+        [ "parser", "classsimdjson_1_1dom_1_1parser.html", "classsimdjson_1_1dom_1_1parser" ]
+      ] ],
+      [ "SIMDJSON_IMPLEMENTATION", null, [
+        [ "builder", null, [
+          [ "string_builder", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1builder_1_1string__builder.html", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1builder_1_1string__builder" ]
+        ] ],
+        [ "ondemand", "namespacesimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand.html", [
+          [ "array", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array.html", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array" ],
+          [ "array_iterator", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator" ],
+          [ "document", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1document.html", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1document" ],
+          [ "document_reference", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1document__reference.html", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1document__reference" ],
+          [ "document_stream", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1document__stream.html", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1document__stream" ],
+          [ "field", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1field.html", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1field" ],
+          [ "number", "structsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1number.html", "structsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1number" ],
+          [ "object", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1object.html", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1object" ],
+          [ "object_iterator", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1object__iterator.html", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1object__iterator" ],
+          [ "parser", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1parser.html", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1parser" ],
+          [ "raw_json_string", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1raw__json__string.html", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1raw__json__string" ],
+          [ "value", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1value.html", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1value" ]
+        ] ],
+        [ "dom_parser_implementation", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1dom__parser__implementation.html", "classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1dom__parser__implementation" ],
+        [ "implementation_simdjson_result_base", "structsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1implementation__simdjson__result__base.html", "structsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1implementation__simdjson__result__base" ],
+        [ "open_container", "structsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1open__container.html", null ]
+      ] ],
+      [ "fractured_json_options", "structsimdjson_1_1fractured__json__options.html", "structsimdjson_1_1fractured__json__options" ],
+      [ "has_custom_serialization", "structsimdjson_1_1has__custom__serialization.html", null ],
+      [ "implementation", "classsimdjson_1_1implementation.html", "classsimdjson_1_1implementation" ],
+      [ "padded_memory_map", "classsimdjson_1_1padded__memory__map.html", "classsimdjson_1_1padded__memory__map" ],
+      [ "padded_string", "structsimdjson_1_1padded__string.html", "structsimdjson_1_1padded__string" ],
+      [ "padded_string_builder", "classsimdjson_1_1padded__string__builder.html", "classsimdjson_1_1padded__string__builder" ],
+      [ "padded_string_view", "classsimdjson_1_1padded__string__view.html", "classsimdjson_1_1padded__string__view" ],
+      [ "simdjson_error", "structsimdjson_1_1simdjson__error.html", "structsimdjson_1_1simdjson__error" ],
+      [ "simdjson_result", "structsimdjson_1_1simdjson__result.html", "structsimdjson_1_1simdjson__result" ],
+      [ "simdjson_result< dom::array >", "structsimdjson_1_1simdjson__result_3_01dom_1_1array_01_4.html", null ],
+      [ "simdjson_result< dom::document_stream >", "structsimdjson_1_1simdjson__result_3_01dom_1_1document__stream_01_4.html", null ],
+      [ "simdjson_result< dom::element >", "structsimdjson_1_1simdjson__result_3_01dom_1_1element_01_4.html", null ],
+      [ "simdjson_result< dom::object >", "structsimdjson_1_1simdjson__result_3_01dom_1_1object_01_4.html", null ],
+      [ "simdjson_result< SIMDJSON_IMPLEMENTATION::ondemand::array >", "structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array_01_4.html", null ],
+      [ "simdjson_result< SIMDJSON_IMPLEMENTATION::ondemand::document_reference >", "structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1document__reference_01_4.html", "structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1document__reference_01_4" ],
+      [ "simdjson_result< SIMDJSON_IMPLEMENTATION::ondemand::field >", "structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1field_01_4.html", null ],
+      [ "simdjson_result< SIMDJSON_IMPLEMENTATION::ondemand::json_iterator >", "structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1json__iterator_01_4.html", null ],
+      [ "simdjson_result< SIMDJSON_IMPLEMENTATION::ondemand::json_type >", "structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1json__type_01_4.html", null ],
+      [ "simdjson_result< SIMDJSON_IMPLEMENTATION::ondemand::object >", "structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1object_01_4.html", null ],
+      [ "simdjson_result< SIMDJSON_IMPLEMENTATION::ondemand::token_iterator >", "structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1token__iterator_01_4.html", null ],
+      [ "simdjson_result< SIMDJSON_IMPLEMENTATION::ondemand::value >", "structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1value_01_4.html", "structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1value_01_4" ],
+      [ "simdjson_result< SIMDJSON_IMPLEMENTATION::ondemand::value_iterator >", "structsimdjson_1_1simdjson__result_3_01_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1value__iterator_01_4.html", null ]
+    ] ]
+];

arm64_2base_8h_source.html

@@ -0,0 +1,143 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/arm64/base.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('arm64_2base_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">base.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_ARM64_BASE_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#define SIMDJSON_ARM64_BASE_H</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#ifndef SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/base.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="foldopen" id="foldopen00008" data-start="{" data-end="}">
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"><a class="line" href="namespacesimdjson.html">    8</a></span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a> {</div>
+<div class="foldopen" id="foldopen00012" data-start="{" data-end="}">
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"><a class="line" href="namespacesimdjson_1_1arm64.html">   12</a></span><span class="keyword">namespace </span>arm64 {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="keyword">class </span>implementation;</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="keyword">namespace </span>{</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keyword">namespace </span>simd {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt; <span class="keyword">struct </span>simd8;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt; <span class="keyword">struct </span>simd8x64;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>} <span class="comment">// namespace simd</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>} <span class="comment">// unnamed namespace</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>} <span class="comment">// namespace arm64</span></div>
+</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>} <span class="comment">// namespace simdjson</span></div>
+</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_ARM64_BASE_H</span></div>
+<div class="ttc" id="anamespacesimdjson_html"><div class="ttname"><a href="namespacesimdjson.html">simdjson</a></div><div class="ttdoc">The top level simdjson namespace, containing everything the library provides.</div><div class="ttdef"><b>Definition</b> <a href="arm64_2base_8h_source.html#l00008">base.h:8</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_76d8247d4498211a7d04a3794a38eb71.html">arm64</a></li><li class="navelem"><b>base.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

arm64_2begin_8h_source.html

@@ -0,0 +1,125 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/arm64/begin.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('arm64_2begin_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">begin.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#define SIMDJSON_IMPLEMENTATION arm64</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &quot;simdjson/arm64/base.h&quot;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &quot;simdjson/arm64/intrinsics.h&quot;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &quot;simdjson/arm64/bitmanipulation.h&quot;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/arm64/bitmask.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &quot;simdjson/arm64/numberparsing_defs.h&quot;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &quot;simdjson/arm64/simd.h&quot;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &quot;simdjson/arm64/stringparsing_defs.h&quot;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#define SIMDJSON_SKIP_BACKSLASH_SHORT_CIRCUIT 1</span></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_76d8247d4498211a7d04a3794a38eb71.html">arm64</a></li><li class="navelem"><b>begin.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

arm64_2bitmanipulation_8h_source.html

@@ -0,0 +1,216 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/arm64/bitmanipulation.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('arm64_2bitmanipulation_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">bitmanipulation.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_ARM64_BITMANIPULATION_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#define SIMDJSON_ARM64_BITMANIPULATION_H</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#ifndef SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/arm64/base.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &quot;simdjson/arm64/intrinsics.h&quot;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a> {</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="keyword">namespace </span>arm64 {</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keyword">namespace </span>{</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment">// We sometimes call trailing_zero on inputs that are zero,</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment">// but the algorithms do not end up using the returned value.</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment">// Sadly, sanitizers are not smart enough to figure it out.</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>SIMDJSON_NO_SANITIZE_UNDEFINED</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment">// This function can be used safely even if not all bytes have been</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment">// initialized.</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment">// See issue https://github.com/simdjson/simdjson/issues/1965</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>SIMDJSON_NO_SANITIZE_MEMORY</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>simdjson_inline <span class="keywordtype">int</span> trailing_zeroes(uint64_t input_num) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#if SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> ret;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>  <span class="comment">// Search the mask data from least significant bit (LSB)</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>  <span class="comment">// to the most significant bit (MSB) for a set bit (1).</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>  _BitScanForward64(&amp;ret, input_num);</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>  <span class="keywordflow">return</span> (<span class="keywordtype">int</span>)ret;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#else </span><span class="comment">// SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>  <span class="keywordflow">return</span> __builtin_ctzll(input_num);</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>}</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="comment">/* result might be undefined when input_num is zero */</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>simdjson_inline uint64_t clear_lowest_bit(uint64_t input_num) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>  <span class="keywordflow">return</span> input_num &amp; (input_num-1);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>}</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="comment">// We sometimes call leading_zeroes on inputs that are zero,</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="comment">// but the algorithms do not end up using the returned value.</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="comment">// Sadly, sanitizers are not smart enough to figure it out.</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="comment">// Applies only when SIMDJSON_PREFER_REVERSE_BITS is defined and true.</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="comment">// (See below.)</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>SIMDJSON_NO_SANITIZE_UNDEFINED</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="comment">/* result might be undefined when input_num is zero */</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>simdjson_inline <span class="keywordtype">int</span> leading_zeroes(uint64_t input_num) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#if SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> leading_zero = 0;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>  <span class="comment">// Search the mask data from most significant bit (MSB)</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>  <span class="comment">// to least significant bit (LSB) for a set bit (1).</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>  <span class="keywordflow">if</span> (_BitScanReverse64(&amp;leading_zero, input_num))</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">return</span> (<span class="keywordtype">int</span>)(63 - leading_zero);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>  <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">return</span> 64;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>  <span class="keywordflow">return</span> __builtin_clzll(input_num);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="preprocessor">#endif</span><span class="comment">// SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>}</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="comment">/* result might be undefined when input_num is zero */</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>simdjson_inline <span class="keywordtype">int</span> count_ones(uint64_t input_num) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>   <span class="keywordflow">return</span> vaddv_u8(vcnt_u8(vcreate_u8(input_num)));</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="preprocessor">#if defined(__GNUC__) </span><span class="comment">// catches clang and gcc</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="comment"> * We use SIMDJSON_PREFER_REVERSE_BITS as a hint that algorithms that</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="comment"> * work well with bit reversal may use it.</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="comment"> */</span><span class="preprocessor"></span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="preprocessor">#define SIMDJSON_PREFER_REVERSE_BITS 1</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><span class="comment">/* reverse the bits */</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>simdjson_inline uint64_t reverse_bits(uint64_t input_num) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>  uint64_t rev_bits;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>  __asm(<span class="stringliteral">&quot;rbit %0, %1&quot;</span> : <span class="stringliteral">&quot;=r&quot;</span>(rev_bits) : <span class="stringliteral">&quot;r&quot;</span>(input_num));</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>  <span class="keywordflow">return</span> rev_bits;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>}</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>SIMDJSON_NO_SANITIZE_UNDEFINED</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>simdjson_inline uint64_t zero_leading_bit(uint64_t rev_bits, <span class="keywordtype">int</span> leading_zeroes) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>  <span class="keywordflow">return</span> rev_bits ^ (uint64_t(0x8000000000000000) &gt;&gt; leading_zeroes);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>}</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>simdjson_inline <span class="keywordtype">bool</span> add_overflow(uint64_t value1, uint64_t value2, uint64_t *result) {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span><span class="preprocessor">#if SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>  *result = value1 + value2;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>  <span class="keywordflow">return</span> *result &lt; value1;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>  <span class="keywordflow">return</span> __builtin_uaddll_overflow(value1, value2,</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>                                   <span class="keyword">reinterpret_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> *<span class="keyword">&gt;</span>(result));</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>}</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>} <span class="comment">// unnamed namespace</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>} <span class="comment">// namespace arm64</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>} <span class="comment">// namespace simdjson</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_ARM64_BITMANIPULATION_H</span></div>
+<div class="ttc" id="anamespacesimdjson_html"><div class="ttname"><a href="namespacesimdjson.html">simdjson</a></div><div class="ttdoc">The top level simdjson namespace, containing everything the library provides.</div><div class="ttdef"><b>Definition</b> <a href="arm64_2base_8h_source.html#l00008">base.h:8</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_76d8247d4498211a7d04a3794a38eb71.html">arm64</a></li><li class="navelem"><b>bitmanipulation.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

arm64_2bitmask_8h_source.html

@@ -0,0 +1,158 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/arm64/bitmask.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('arm64_2bitmask_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">bitmask.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_ARM64_BITMASK_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#define SIMDJSON_ARM64_BITMASK_H</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#ifndef SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/arm64/base.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a> {</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="keyword">namespace </span>arm64 {</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="keyword">namespace </span>{</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment">//</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment">// Perform a &quot;cumulative bitwise xor,&quot; flipping bits each time a 1 is encountered.</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment">//</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment">// For example, prefix_xor(00100100) == 00011100</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment">//</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>simdjson_inline uint64_t prefix_xor(uint64_t bitmask) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>  <span class="comment">// We could do this with PMULL, but it is apparently slow.</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>  <span class="comment">//</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>  <span class="comment">//#ifdef __ARM_FEATURE_CRYPTO // some ARM processors lack this extension</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>  <span class="comment">//return vmull_p64(-1ULL, bitmask);</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>  <span class="comment">//#else</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>  <span class="comment">// Analysis by @sebpop:</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>  <span class="comment">// When diffing the assembly for src/stage1_find_marks.cpp I see that the eors are all spread out</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>  <span class="comment">// in between other vector code, so effectively the extra cycles of the sequence do not matter</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>  <span class="comment">// because the GPR units are idle otherwise and the critical path is on the FP side.</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>  <span class="comment">// Also the PMULL requires two extra fmovs: GPR-&gt;FP (3 cycles in N1, 5 cycles in A72 )</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>  <span class="comment">// and FP-&gt;GPR (2 cycles on N1 and 5 cycles on A72.)</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>  bitmask ^= bitmask &lt;&lt; 1;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>  bitmask ^= bitmask &lt;&lt; 2;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>  bitmask ^= bitmask &lt;&lt; 4;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>  bitmask ^= bitmask &lt;&lt; 8;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>  bitmask ^= bitmask &lt;&lt; 16;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>  bitmask ^= bitmask &lt;&lt; 32;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>  <span class="keywordflow">return</span> bitmask;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>}</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>} <span class="comment">// unnamed namespace</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>} <span class="comment">// namespace arm64</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>} <span class="comment">// namespace simdjson</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#endif</span></div>
+<div class="ttc" id="anamespacesimdjson_html"><div class="ttname"><a href="namespacesimdjson.html">simdjson</a></div><div class="ttdoc">The top level simdjson namespace, containing everything the library provides.</div><div class="ttdef"><b>Definition</b> <a href="arm64_2base_8h_source.html#l00008">base.h:8</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_76d8247d4498211a7d04a3794a38eb71.html">arm64</a></li><li class="navelem"><b>bitmask.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

arm64_2builder_8h_source.html

@@ -0,0 +1,123 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/arm64/builder.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('arm64_2builder_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">builder.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_ARM64_BUILDER_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#define SIMDJSON_ARM64_BUILDER_H</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &quot;simdjson/arm64/begin.h&quot;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/generic/builder/amalgamated.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &quot;simdjson/arm64/end.h&quot;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_ARM64_BUILDER_H</span></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_76d8247d4498211a7d04a3794a38eb71.html">arm64</a></li><li class="navelem"><b>builder.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

arm64_2end_8h_source.html

@@ -0,0 +1,121 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/arm64/end.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('arm64_2end_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">end.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &quot;simdjson/arm64/base.h&quot;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#undef SIMDJSON_SKIP_BACKSLASH_SHORT_CIRCUIT</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#undef SIMDJSON_IMPLEMENTATION</span></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_76d8247d4498211a7d04a3794a38eb71.html">arm64</a></li><li class="navelem"><b>end.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

arm64_2implementation_8h_source.html

@@ -0,0 +1,148 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/arm64/implementation.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('arm64_2implementation_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">implementation.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_ARM64_IMPLEMENTATION_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#define SIMDJSON_ARM64_IMPLEMENTATION_H</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#ifndef SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/base.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &quot;simdjson/implementation.h&quot;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &quot;simdjson/internal/instruction_set.h&quot;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a> {</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keyword">namespace </span>arm64 {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="keyword">class </span>implementation final : <span class="keyword">public</span> <a class="code hl_class" href="classsimdjson_1_1implementation.html">simdjson::implementation</a> {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keyword">public</span>:</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>  simdjson_inline implementation() : <a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a>::implementation(<span class="stringliteral">&quot;arm64&quot;</span>, <span class="stringliteral">&quot;ARM NEON&quot;</span>, internal::instruction_set::NEON) {}</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>  simdjson_warn_unused <a class="code hl_enumeration" href="namespacesimdjson.html#a7b735a3a50ba79e3f7f14df5f77d8da9">error_code</a> create_dom_parser_implementation(</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordtype">size_t</span> capacity,</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordtype">size_t</span> max_length,</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    std::unique_ptr&lt;internal::dom_parser_implementation&gt;&amp; dst</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>  ) <span class="keyword">const</span> <span class="keyword">noexcept</span> <span class="keyword">final</span>;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>  simdjson_warn_unused <a class="code hl_enumeration" href="namespacesimdjson.html#a7b735a3a50ba79e3f7f14df5f77d8da9">error_code</a> <a class="code hl_function" href="namespacesimdjson.html#aeb4ef5cab43d52da3fdd99cb689aff2c">minify</a>(<span class="keyword">const</span> uint8_t *buf, <span class="keywordtype">size_t</span> len, uint8_t *dst, <span class="keywordtype">size_t</span> &amp;dst_len) <span class="keyword">const</span> <span class="keyword">noexcept</span> <span class="keyword">final</span>;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>  simdjson_warn_unused <span class="keywordtype">bool</span> <a class="code hl_function" href="namespacesimdjson.html#a53546f3af0ed6840ffbeefcbefd305a1">validate_utf8</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> *buf, <span class="keywordtype">size_t</span> len) <span class="keyword">const</span> <span class="keyword">noexcept</span> <span class="keyword">final</span>;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>};</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>} <span class="comment">// namespace arm64</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>} <span class="comment">// namespace simdjson</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_ARM64_IMPLEMENTATION_H</span></div>
+<div class="ttc" id="aclasssimdjson_1_1implementation_html"><div class="ttname"><a href="classsimdjson_1_1implementation.html">simdjson::implementation</a></div><div class="ttdoc">An implementation of simdjson for a particular CPU architecture.</div><div class="ttdef"><b>Definition</b> <a href="implementation_8h_source.html#l00045">implementation.h:45</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html"><div class="ttname"><a href="namespacesimdjson.html">simdjson</a></div><div class="ttdoc">The top level simdjson namespace, containing everything the library provides.</div><div class="ttdef"><b>Definition</b> <a href="arm64_2base_8h_source.html#l00008">base.h:8</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html_a53546f3af0ed6840ffbeefcbefd305a1"><div class="ttname"><a href="namespacesimdjson.html#a53546f3af0ed6840ffbeefcbefd305a1">simdjson::validate_utf8</a></div><div class="ttdeci">simdjson_warn_unused bool validate_utf8(const char *buf, size_t len) noexcept</div><div class="ttdoc">Validate the UTF-8 string.</div></div>
+<div class="ttc" id="anamespacesimdjson_html_a7b735a3a50ba79e3f7f14df5f77d8da9"><div class="ttname"><a href="namespacesimdjson.html#a7b735a3a50ba79e3f7f14df5f77d8da9">simdjson::error_code</a></div><div class="ttdeci">error_code</div><div class="ttdoc">All possible errors returned by simdjson.</div><div class="ttdef"><b>Definition</b> <a href="error_8h_source.html#l00019">error.h:19</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html_aeb4ef5cab43d52da3fdd99cb689aff2c"><div class="ttname"><a href="namespacesimdjson.html#aeb4ef5cab43d52da3fdd99cb689aff2c">simdjson::minify</a></div><div class="ttdeci">std::string minify(T x)</div><div class="ttdoc">Minifies a JSON element or document, printing the smallest possible valid JSON.</div><div class="ttdef"><b>Definition</b> <a href="dom_2serialization_8h_source.html#l00274">serialization.h:274</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_76d8247d4498211a7d04a3794a38eb71.html">arm64</a></li><li class="navelem"><b>implementation.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

arm64_2intrinsics_8h_source.html

@@ -0,0 +1,130 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/arm64/intrinsics.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('arm64_2intrinsics_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">intrinsics.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_ARM64_INTRINSICS_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#define SIMDJSON_ARM64_INTRINSICS_H</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#ifndef SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/arm64/base.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment">// This should be the correct header whether</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment">// you use visual studio or other compilers.</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;arm_neon.h&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keyword">static_assert</span>(<span class="keyword">sizeof</span>(uint8x16_t) &lt;= <a class="code hl_variable" href="namespacesimdjson.html#aecdd750132f0eb123a6d61113b4197bf">simdjson::SIMDJSON_PADDING</a>, <span class="stringliteral">&quot;insufficient padding for arm64&quot;</span>);</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#endif </span><span class="comment">//  SIMDJSON_ARM64_INTRINSICS_H</span></div>
+<div class="ttc" id="anamespacesimdjson_html_aecdd750132f0eb123a6d61113b4197bf"><div class="ttname"><a href="namespacesimdjson.html#aecdd750132f0eb123a6d61113b4197bf">simdjson::SIMDJSON_PADDING</a></div><div class="ttdeci">constexpr size_t SIMDJSON_PADDING</div><div class="ttdoc">The amount of padding needed in a buffer to parse JSON.</div><div class="ttdef"><b>Definition</b> <a href="base_8h_source.html#l00033">base.h:33</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_76d8247d4498211a7d04a3794a38eb71.html">arm64</a></li><li class="navelem"><b>intrinsics.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

arm64_2numberparsing__defs_8h_source.html

@@ -0,0 +1,177 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/arm64/numberparsing_defs.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('arm64_2numberparsing__defs_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">numberparsing_defs.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_ARM64_NUMBERPARSING_DEFS_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#define SIMDJSON_ARM64_NUMBERPARSING_DEFS_H</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#ifndef SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/arm64/base.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &quot;simdjson/arm64/intrinsics.h&quot;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &quot;simdjson/internal/numberparsing_tables.h&quot;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#if SIMDJSON_REGULAR_VISUAL_STUDIO &amp;&amp; SIMDJSON_IS_ARM64</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment">// __umulh requires intrin.h</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;intrin.h&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_REGULAR_VISUAL_STUDIO &amp;&amp; SIMDJSON_IS_ARM64</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a> {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">namespace </span>arm64 {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="keyword">namespace </span>numberparsing {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment">// we don&#39;t have SSE, so let us use a scalar function</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment">// credit: https://johnnylee-sde.github.io/Fast-numeric-string-to-int/</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">static</span> simdjson_inline uint32_t parse_eight_digits_unrolled(<span class="keyword">const</span> uint8_t *chars) {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>  uint64_t val;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>  std::memcpy(&amp;val, chars, <span class="keyword">sizeof</span>(uint64_t));</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>  val = (val &amp; 0x0F0F0F0F0F0F0F0F) * 2561 &gt;&gt; 8;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>  val = (val &amp; 0x00FF00FF00FF00FF) * 6553601 &gt;&gt; 16;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>  <span class="keywordflow">return</span> uint32_t((val &amp; 0x0000FFFF0000FFFF) * 42949672960001 &gt;&gt; 32);</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>}</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>simdjson_inline internal::value128 full_multiplication(uint64_t value1, uint64_t value2) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>  internal::value128 answer;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#if SIMDJSON_REGULAR_VISUAL_STUDIO || SIMDJSON_IS_32BITS</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#if SIMDJSON_IS_ARM64</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>  <span class="comment">// ARM64 has native support for 64-bit multiplications, no need to emultate</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>  answer.high = __umulh(value1, value2);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>  answer.low = value1 * value2;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>  answer.low = _umul128(value1, value2, &amp;answer.high); <span class="comment">// _umul128 not available on ARM64</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_IS_ARM64</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#else </span><span class="comment">// SIMDJSON_REGULAR_VISUAL_STUDIO || SIMDJSON_IS_32BITS</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>  __uint128_t r = (<span class="keyword">static_cast&lt;</span>__uint128_t<span class="keyword">&gt;</span>(value1)) * value2;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>  answer.low = uint64_t(r);</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>  answer.high = uint64_t(r &gt;&gt; 64);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>  <span class="keywordflow">return</span> answer;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>} <span class="comment">// namespace numberparsing</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>} <span class="comment">// namespace arm64</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>} <span class="comment">// namespace simdjson</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="preprocessor">#ifndef SIMDJSON_SWAR_NUMBER_PARSING</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="preprocessor">#if SIMDJSON_IS_BIG_ENDIAN</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="preprocessor">#define SIMDJSON_SWAR_NUMBER_PARSING 0</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="preprocessor">#define SIMDJSON_SWAR_NUMBER_PARSING 1</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_ARM64_NUMBERPARSING_DEFS_H</span></div>
+<div class="ttc" id="anamespacesimdjson_html"><div class="ttname"><a href="namespacesimdjson.html">simdjson</a></div><div class="ttdoc">The top level simdjson namespace, containing everything the library provides.</div><div class="ttdef"><b>Definition</b> <a href="arm64_2base_8h_source.html#l00008">base.h:8</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_76d8247d4498211a7d04a3794a38eb71.html">arm64</a></li><li class="navelem"><b>numberparsing_defs.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

arm64_2ondemand_8h_source.html

@@ -0,0 +1,123 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/arm64/ondemand.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('arm64_2ondemand_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">ondemand.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_ARM64_ONDEMAND_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#define SIMDJSON_ARM64_ONDEMAND_H</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &quot;simdjson/arm64/begin.h&quot;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/generic/ondemand/amalgamated.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &quot;simdjson/arm64/end.h&quot;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_ARM64_ONDEMAND_H</span></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_76d8247d4498211a7d04a3794a38eb71.html">arm64</a></li><li class="navelem"><b>ondemand.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

arm64_2simd_8h_source.html

@@ -0,0 +1,626 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/arm64/simd.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('arm64_2simd_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">simd.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_ARM64_SIMD_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#define SIMDJSON_ARM64_SIMD_H</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#ifndef SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/arm64/base.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &quot;simdjson/arm64/bitmanipulation.h&quot;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &quot;simdjson/internal/simdprune_tables.h&quot;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a> {</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keyword">namespace </span>arm64 {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keyword">namespace </span>{</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="keyword">namespace </span>simd {</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#if SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="keyword">namespace </span>{</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment">// Start of private section with Visual Studio workaround</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#ifndef simdjson_make_uint8x16_t</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#define simdjson_make_uint8x16_t(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, \</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">                             x13, x14, x15, x16)                                   \</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">   ([=]() {                                                                        \</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">     uint8_t array[16] = {x1, x2,  x3,  x4,  x5,  x6,  x7,  x8,                    \</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">                                 x9, x10, x11, x12, x13, x14, x15, x16};           \</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">     return vld1q_u8(array);                                                       \</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">   }())</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#ifndef simdjson_make_int8x16_t</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#define simdjson_make_int8x16_t(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, \</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">                             x13, x14, x15, x16)                                  \</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">   ([=]() {                                                                       \</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">     int8_t array[16] = {x1, x2,  x3,  x4,  x5,  x6,  x7,  x8,                    \</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">                                 x9, x10, x11, x12, x13, x14, x15, x16};          \</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">     return vld1q_s8(array);                                                      \</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">   }())</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#ifndef simdjson_make_uint8x8_t</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#define simdjson_make_uint8x8_t(x1, x2, x3, x4, x5, x6, x7, x8)                \</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">   ([=]() {                                                                    \</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">     uint8_t array[8] = {x1, x2,  x3,  x4,  x5,  x6,  x7,  x8};                \</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">     return vld1_u8(array);                                                    \</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">   }())</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#ifndef simdjson_make_int8x8_t</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="preprocessor">#define simdjson_make_int8x8_t(x1, x2, x3, x4, x5, x6, x7, x8)                 \</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="preprocessor">   ([=]() {                                                                    \</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="preprocessor">     int8_t array[8] = {x1, x2,  x3,  x4,  x5,  x6,  x7,  x8};                 \</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="preprocessor">     return vld1_s8(array);                                                    \</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="preprocessor">   }())</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="preprocessor">#ifndef simdjson_make_uint16x8_t</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="preprocessor">#define simdjson_make_uint16x8_t(x1, x2, x3, x4, x5, x6, x7, x8)               \</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="preprocessor">   ([=]() {                                                                    \</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="preprocessor">     uint16_t array[8] = {x1, x2,  x3,  x4,  x5,  x6,  x7,  x8};               \</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="preprocessor">     return vld1q_u16(array);                                                  \</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="preprocessor">   }())</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="preprocessor">#ifndef simdjson_make_int16x8_t</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="preprocessor">#define simdjson_make_int16x8_t(x1, x2, x3, x4, x5, x6, x7, x8)                \</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="preprocessor">   ([=]() {                                                                    \</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="preprocessor">     int16_t array[8] = {x1, x2,  x3,  x4,  x5,  x6,  x7,  x8};                \</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="preprocessor">     return vld1q_s16(array);                                                  \</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="preprocessor">   }())</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment">// End of private section with Visual Studio workaround</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>} <span class="comment">// namespace</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>  <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>  <span class="keyword">struct </span>simd8;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>  <span class="comment">//</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>  <span class="comment">// Base class of simd8&lt;uint8_t&gt; and simd8&lt;bool&gt;, both of which use uint8x16_t internally.</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>  <span class="comment">//</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>  <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> Mask=simd8&lt;<span class="keywordtype">bool</span>&gt;&gt;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>  <span class="keyword">struct </span>base_u8 {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    uint8x16_t value;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> SIZE = <span class="keyword">sizeof</span>(value);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="comment">// Conversion from/to SIMD register</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    simdjson_inline base_u8(<span class="keyword">const</span> uint8x16_t _value) : value(_value) {}</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    simdjson_inline <span class="keyword">operator</span> <span class="keyword">const</span> uint8x16_t&amp;() <span class="keyword">const</span> { <span class="keywordflow">return</span> this-&gt;value; }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    simdjson_inline <span class="keyword">operator</span> uint8x16_t&amp;() { <span class="keywordflow">return</span> this-&gt;value; }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="comment">// Bit operations</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    simdjson_inline simd8&lt;T&gt; operator|(<span class="keyword">const</span> simd8&lt;T&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vorrq_u8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    simdjson_inline simd8&lt;T&gt; operator&amp;(<span class="keyword">const</span> simd8&lt;T&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vandq_u8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    simdjson_inline simd8&lt;T&gt; operator^(<span class="keyword">const</span> simd8&lt;T&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> veorq_u8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    simdjson_inline simd8&lt;T&gt; bit_andnot(<span class="keyword">const</span> simd8&lt;T&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vbicq_u8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    simdjson_inline simd8&lt;T&gt; operator~()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> *<span class="keyword">this</span> ^ 0xFFu; }</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    simdjson_inline simd8&lt;T&gt;&amp; operator|=(<span class="keyword">const</span> simd8&lt;T&gt; other) { <span class="keyword">auto</span> this_cast = <span class="keyword">static_cast&lt;</span>simd8&lt;T&gt;*<span class="keyword">&gt;</span>(<span class="keyword">this</span>); *this_cast = *this_cast | other; <span class="keywordflow">return</span> *this_cast; }</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    simdjson_inline simd8&lt;T&gt;&amp; operator&amp;=(<span class="keyword">const</span> simd8&lt;T&gt; other) { <span class="keyword">auto</span> this_cast = <span class="keyword">static_cast&lt;</span>simd8&lt;T&gt;*<span class="keyword">&gt;</span>(<span class="keyword">this</span>); *this_cast = *this_cast &amp; other; <span class="keywordflow">return</span> *this_cast; }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    simdjson_inline simd8&lt;T&gt;&amp; operator^=(<span class="keyword">const</span> simd8&lt;T&gt; other) { <span class="keyword">auto</span> this_cast = <span class="keyword">static_cast&lt;</span>simd8&lt;T&gt;*<span class="keyword">&gt;</span>(<span class="keyword">this</span>); *this_cast = *this_cast ^ other; <span class="keywordflow">return</span> *this_cast; }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keyword">friend</span> simdjson_inline Mask <a class="code hl_function" href="namespacesimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand.html#aab771b17058b0c93bdd0a8679c2c4d84">operator==</a>(<span class="keyword">const</span> simd8&lt;T&gt; lhs, <span class="keyword">const</span> simd8&lt;T&gt; rhs) { <span class="keywordflow">return</span> vceqq_u8(lhs, rhs); }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> N=1&gt;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    simdjson_inline simd8&lt;T&gt; prev(<span class="keyword">const</span> simd8&lt;T&gt; prev_chunk)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>      <span class="keywordflow">return</span> vextq_u8(prev_chunk, *<span class="keyword">this</span>, 16 - N);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    }</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>  };</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>  <span class="comment">// SIMD byte mask type (returned by things like eq and gt)</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>  <span class="keyword">template</span>&lt;&gt;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>  <span class="keyword">struct </span>simd8&lt;bool&gt;: base_u8&lt;bool&gt; {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keyword">typedef</span> uint16_t bitmask_t;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="keyword">typedef</span> uint32_t bitmask2_t;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="keyword">static</span> simdjson_inline simd8&lt;bool&gt; splat(<span class="keywordtype">bool</span> _value) { <span class="keywordflow">return</span> vmovq_n_u8(uint8_t(-(!!_value))); }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    simdjson_inline simd8(<span class="keyword">const</span> uint8x16_t _value) : base_u8&lt;bool&gt;(_value) {}</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="comment">// False constructor</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    simdjson_inline simd8() : simd8(vdupq_n_u8(0)) {}</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="comment">// Splat constructor</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    simdjson_inline simd8(<span class="keywordtype">bool</span> _value) : simd8(splat(_value)) {}</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="comment">// We return uint32_t instead of uint16_t because that seems to be more efficient for most</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="comment">// purposes (cutting it down to uint16_t costs performance in some compilers).</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    simdjson_inline uint32_t to_bitmask()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span><span class="preprocessor">#if SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>      <span class="keyword">const</span> uint8x16_t bit_mask =  simdjson_make_uint8x16_t(0x01, 0x02, 0x4, 0x8, 0x10, 0x20, 0x40, 0x80,</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                                                   0x01, 0x02, 0x4, 0x8, 0x10, 0x20, 0x40, 0x80);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>      <span class="keyword">const</span> uint8x16_t bit_mask =  {0x01, 0x02, 0x4, 0x8, 0x10, 0x20, 0x40, 0x80,</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>                                    0x01, 0x02, 0x4, 0x8, 0x10, 0x20, 0x40, 0x80};</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>      <span class="keyword">auto</span> minput = *<span class="keyword">this</span> &amp; bit_mask;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>      uint8x16_t tmp = vpaddq_u8(minput, minput);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>      tmp = vpaddq_u8(tmp, tmp);</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>      tmp = vpaddq_u8(tmp, tmp);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>      <span class="keywordflow">return</span> vgetq_lane_u16(vreinterpretq_u16_u8(tmp), 0);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    }</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <span class="comment">// Returns 4-bit out of each byte, alternating between the high 4 bits and low</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <span class="comment">// bits result it is 64 bit.</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    simdjson_inline uint64_t to_bitmask64()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>      <span class="keywordflow">return</span> vget_lane_u64(</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>          vreinterpret_u64_u8(vshrn_n_u16(vreinterpretq_u16_u8(*<span class="keyword">this</span>), 4)), 0);</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    }</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    simdjson_inline <span class="keywordtype">bool</span> any()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vmaxvq_u32(vreinterpretq_u32_u8(*<span class="keyword">this</span>)) != 0; }</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>  };</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span> </div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>  <span class="comment">// Unsigned bytes</span></div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>  <span class="keyword">template</span>&lt;&gt;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>  <span class="keyword">struct </span>simd8&lt;uint8_t&gt;: base_u8&lt;uint8_t&gt; {</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="keyword">static</span> simdjson_inline uint8x16_t splat(uint8_t _value) { <span class="keywordflow">return</span> vmovq_n_u8(_value); }</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="keyword">static</span> simdjson_inline uint8x16_t zero() { <span class="keywordflow">return</span> vdupq_n_u8(0); }</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    <span class="keyword">static</span> simdjson_inline uint8x16_t load(<span class="keyword">const</span> uint8_t* values) { <span class="keywordflow">return</span> vld1q_u8(values); }</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span> </div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    simdjson_inline simd8(<span class="keyword">const</span> uint8x16_t _value) : base_u8&lt;uint8_t&gt;(_value) {}</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="comment">// Zero constructor</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    simdjson_inline simd8() : simd8(zero()) {}</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="comment">// Array constructor</span></div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    simdjson_inline simd8(<span class="keyword">const</span> uint8_t values[16]) : simd8(load(values)) {}</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="comment">// Splat constructor</span></div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    simdjson_inline simd8(uint8_t _value) : simd8(splat(_value)) {}</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <span class="comment">// Member-by-member initialization</span></div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span><span class="preprocessor">#if SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    simdjson_inline simd8(</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>      uint8_t v0,  uint8_t v1,  uint8_t v2,  uint8_t v3,  uint8_t v4,  uint8_t v5,  uint8_t v6,  uint8_t v7,</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>      uint8_t v8,  uint8_t v9,  uint8_t v10, uint8_t v11, uint8_t v12, uint8_t v13, uint8_t v14, uint8_t v15</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    ) : simd8(simdjson_make_uint8x16_t(</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>      v0, v1, v2, v3, v4, v5, v6, v7,</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>      v8, v9, v10,v11,v12,v13,v14,v15</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    )) {}</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    simdjson_inline simd8(</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>      uint8_t v0,  uint8_t v1,  uint8_t v2,  uint8_t v3,  uint8_t v4,  uint8_t v5,  uint8_t v6,  uint8_t v7,</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>      uint8_t v8,  uint8_t v9,  uint8_t v10, uint8_t v11, uint8_t v12, uint8_t v13, uint8_t v14, uint8_t v15</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    ) : simd8(uint8x16_t{</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>      v0, v1, v2, v3, v4, v5, v6, v7,</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>      v8, v9, v10,v11,v12,v13,v14,v15</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    }) {}</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <span class="comment">// Repeat 16 values as many times as necessary (usually for lookup tables)</span></div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    simdjson_inline <span class="keyword">static</span> simd8&lt;uint8_t&gt; repeat_16(</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>      uint8_t v0,  uint8_t v1,  uint8_t v2,  uint8_t v3,  uint8_t v4,  uint8_t v5,  uint8_t v6,  uint8_t v7,</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>      uint8_t v8,  uint8_t v9,  uint8_t v10, uint8_t v11, uint8_t v12, uint8_t v13, uint8_t v14, uint8_t v15</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    ) {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>      <span class="keywordflow">return</span> simd8&lt;uint8_t&gt;(</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        v0, v1, v2, v3, v4, v5, v6, v7,</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        v8, v9, v10,v11,v12,v13,v14,v15</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>      );</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    }</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span> </div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <span class="comment">// Store to array</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    simdjson_inline <span class="keywordtype">void</span> store(uint8_t dst[16])<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vst1q_u8(dst, *<span class="keyword">this</span>); }</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span> </div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    <span class="comment">// Saturated math</span></div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    simdjson_inline simd8&lt;uint8_t&gt; saturating_add(<span class="keyword">const</span> simd8&lt;uint8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vqaddq_u8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    simdjson_inline simd8&lt;uint8_t&gt; saturating_sub(<span class="keyword">const</span> simd8&lt;uint8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vqsubq_u8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span> </div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    <span class="comment">// Addition/subtraction are the same for signed and unsigned</span></div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    simdjson_inline simd8&lt;uint8_t&gt; operator+(<span class="keyword">const</span> simd8&lt;uint8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vaddq_u8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    simdjson_inline simd8&lt;uint8_t&gt; operator-(<span class="keyword">const</span> simd8&lt;uint8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vsubq_u8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    simdjson_inline simd8&lt;uint8_t&gt;&amp; operator+=(<span class="keyword">const</span> simd8&lt;uint8_t&gt; other) { *<span class="keyword">this</span> = *<span class="keyword">this</span> + other; <span class="keywordflow">return</span> *<span class="keyword">this</span>; }</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    simdjson_inline simd8&lt;uint8_t&gt;&amp; operator-=(<span class="keyword">const</span> simd8&lt;uint8_t&gt; other) { *<span class="keyword">this</span> = *<span class="keyword">this</span> - other; <span class="keywordflow">return</span> *<span class="keyword">this</span>; }</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <span class="comment">// Order-specific operations</span></div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    simdjson_inline uint8_t max_val()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vmaxvq_u8(*<span class="keyword">this</span>); }</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    simdjson_inline uint8_t min_val()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vminvq_u8(*<span class="keyword">this</span>); }</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    simdjson_inline simd8&lt;uint8_t&gt; max_val(<span class="keyword">const</span> simd8&lt;uint8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vmaxq_u8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    simdjson_inline simd8&lt;uint8_t&gt; min_val(<span class="keyword">const</span> simd8&lt;uint8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vminq_u8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    simdjson_inline simd8&lt;bool&gt; operator&lt;=(<span class="keyword">const</span> simd8&lt;uint8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vcleq_u8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    simdjson_inline simd8&lt;bool&gt; operator&gt;=(<span class="keyword">const</span> simd8&lt;uint8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vcgeq_u8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    simdjson_inline simd8&lt;bool&gt; operator&lt;(<span class="keyword">const</span> simd8&lt;uint8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vcltq_u8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    simdjson_inline simd8&lt;bool&gt; operator&gt;(<span class="keyword">const</span> simd8&lt;uint8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vcgtq_u8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    <span class="comment">// Same as &gt;, but instead of guaranteeing all 1&#39;s == true, false = 0 and true = nonzero. For ARM, returns all 1&#39;s.</span></div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    simdjson_inline simd8&lt;uint8_t&gt; gt_bits(<span class="keyword">const</span> simd8&lt;uint8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> simd8&lt;uint8_t&gt;(*<span class="keyword">this</span> &gt; other); }</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    <span class="comment">// Same as &lt;, but instead of guaranteeing all 1&#39;s == true, false = 0 and true = nonzero. For ARM, returns all 1&#39;s.</span></div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    simdjson_inline simd8&lt;uint8_t&gt; lt_bits(<span class="keyword">const</span> simd8&lt;uint8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> simd8&lt;uint8_t&gt;(*<span class="keyword">this</span> &lt; other); }</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    <span class="comment">// Bit-specific operations</span></div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    simdjson_inline simd8&lt;bool&gt; any_bits_set(simd8&lt;uint8_t&gt; bits)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vtstq_u8(*<span class="keyword">this</span>, bits); }</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    simdjson_inline <span class="keywordtype">bool</span> any_bits_set_anywhere()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vmaxvq_u32(vreinterpretq_u32_u8(*<span class="keyword">this</span>)) != 0; }</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    simdjson_inline <span class="keywordtype">bool</span> any_bits_set_anywhere(simd8&lt;uint8_t&gt; bits)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (*<span class="keyword">this</span> &amp; bits).any_bits_set_anywhere(); }</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> N&gt;</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    simdjson_inline simd8&lt;uint8_t&gt; shr()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vshrq_n_u8(*<span class="keyword">this</span>, N); }</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> N&gt;</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    simdjson_inline simd8&lt;uint8_t&gt; shl()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vshlq_n_u8(*<span class="keyword">this</span>, N); }</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span> </div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    <span class="comment">// Perform a lookup assuming the value is between 0 and 16 (undefined behavior for out of range values)</span></div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> L&gt;</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    simdjson_inline simd8&lt;L&gt; lookup_16(simd8&lt;L&gt; lookup_table)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>      <span class="keywordflow">return</span> lookup_table.apply_lookup_16_to(*<span class="keyword">this</span>);</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    }</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span> </div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    <span class="comment">// Returns 4-bit out of each byte, alternating between the high 4 bits and low</span></div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    <span class="comment">// bits result it is 64 bit.</span></div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    simdjson_inline uint64_t to_bitmask64()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>      <span class="keywordflow">return</span> vget_lane_u64(</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>          vreinterpret_u64_u8(vshrn_n_u16(vreinterpretq_u16_u8(*<span class="keyword">this</span>), 4)), 0);</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    }</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    <span class="comment">// Copies to &#39;output&quot; all bytes corresponding to a 0 in the mask (interpreted as a bitset).</span></div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    <span class="comment">// Passing a 0 value for mask would be equivalent to writing out every byte to output.</span></div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    <span class="comment">// Only the first 16 - count_ones(mask) bytes of the result are significant but 16 bytes</span></div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    <span class="comment">// get written.</span></div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    <span class="comment">// Design consideration: it seems like a function with the</span></div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    <span class="comment">// signature simd8&lt;L&gt; compress(uint16_t mask) would be</span></div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    <span class="comment">// sensible, but the AVX ISA makes this kind of approach difficult.</span></div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> L&gt;</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    simdjson_inline <span class="keywordtype">void</span> compress(uint16_t mask, L * output)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>      <span class="keyword">using </span>internal::thintable_epi8;</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>      <span class="keyword">using </span>internal::BitsSetTable256mul2;</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>      <span class="keyword">using </span>internal::pshufb_combine_table;</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>      <span class="comment">// this particular implementation was inspired by work done by @animetosho</span></div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>      <span class="comment">// we do it in two steps, first 8 bytes and then second 8 bytes</span></div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>      uint8_t mask1 = uint8_t(mask); <span class="comment">// least significant 8 bits</span></div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>      uint8_t mask2 = uint8_t(mask &gt;&gt; 8); <span class="comment">// most significant 8 bits</span></div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>      <span class="comment">// next line just loads the 64-bit values thintable_epi8[mask1] and</span></div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>      <span class="comment">// thintable_epi8[mask2] into a 128-bit register, using only</span></div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>      <span class="comment">// two instructions on most compilers.</span></div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>      uint64x2_t shufmask64 = {thintable_epi8[mask1], thintable_epi8[mask2]};</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>      uint8x16_t shufmask = vreinterpretq_u8_u64(shufmask64);</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>      <span class="comment">// we increment by 0x08 the second half of the mask</span></div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span><span class="preprocessor">#if SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>      uint8x16_t inc = simdjson_make_uint8x16_t(0, 0, 0, 0, 0, 0, 0, 0, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08);</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>      uint8x16_t inc = {0, 0, 0, 0, 0, 0, 0, 0, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08};</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>      shufmask = vaddq_u8(shufmask, inc);</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>      <span class="comment">// this is the version &quot;nearly pruned&quot;</span></div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>      uint8x16_t pruned = vqtbl1q_u8(*<span class="keyword">this</span>, shufmask);</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>      <span class="comment">// we still need to put the two halves together.</span></div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>      <span class="comment">// we compute the popcount of the first half:</span></div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>      <span class="keywordtype">int</span> pop1 = BitsSetTable256mul2[mask1];</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>      <span class="comment">// then load the corresponding mask, what it does is to write</span></div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>      <span class="comment">// only the first pop1 bytes from the first 8 bytes, and then</span></div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>      <span class="comment">// it fills in with the bytes from the second 8 bytes + some filling</span></div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>      <span class="comment">// at the end.</span></div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>      uint8x16_t compactmask = vld1q_u8(<span class="keyword">reinterpret_cast&lt;</span><span class="keyword">const </span>uint8_t *<span class="keyword">&gt;</span>(pshufb_combine_table + pop1 * 8));</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>      uint8x16_t answer = vqtbl1q_u8(pruned, compactmask);</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>      vst1q_u8(<span class="keyword">reinterpret_cast&lt;</span>uint8_t*<span class="keyword">&gt;</span>(output), answer);</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    }</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span> </div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>    <span class="comment">// Copies all bytes corresponding to a 0 in the low half of the mask (interpreted as a</span></div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    <span class="comment">// bitset) to output1, then those corresponding to a 0 in the high half to output2.</span></div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> L&gt;</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    simdjson_inline <span class="keywordtype">void</span> compress_halves(uint16_t mask, L *output1, L *output2)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>      <span class="keyword">using </span>internal::thintable_epi8;</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>      uint8_t mask1 = uint8_t(mask); <span class="comment">// least significant 8 bits</span></div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>      uint8_t mask2 = uint8_t(mask &gt;&gt; 8); <span class="comment">// most significant 8 bits</span></div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>      uint8x8_t compactmask1 = vcreate_u8(thintable_epi8[mask1]);</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>      uint8x8_t compactmask2 = vcreate_u8(thintable_epi8[mask2]);</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>      <span class="comment">// we increment by 0x08 the second half of the mask</span></div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span><span class="preprocessor">#if SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>      uint8x8_t inc = simdjson_make_uint8x8_t(0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08);</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>      uint8x8_t inc = {0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08};</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>      compactmask2 = vadd_u8(compactmask2, inc);</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>      <span class="comment">// store each result (with the second store possibly overlapping the first)</span></div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>      vst1_u8((uint8_t*)output1, vqtbl1_u8(*<span class="keyword">this</span>, compactmask1));</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>      vst1_u8((uint8_t*)output2, vqtbl1_u8(*<span class="keyword">this</span>, compactmask2));</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>    }</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span> </div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> L&gt;</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    simdjson_inline simd8&lt;L&gt; lookup_16(</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>        L replace0,  L replace1,  L replace2,  L replace3,</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>        L replace4,  L replace5,  L replace6,  L replace7,</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>        L replace8,  L replace9,  L replace10, L replace11,</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>        L replace12, L replace13, L replace14, L replace15)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>      <span class="keywordflow">return</span> lookup_16(simd8&lt;L&gt;::repeat_16(</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>        replace0,  replace1,  replace2,  replace3,</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>        replace4,  replace5,  replace6,  replace7,</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>        replace8,  replace9,  replace10, replace11,</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>        replace12, replace13, replace14, replace15</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>      ));</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>    }</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span> </div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>    simdjson_inline simd8&lt;uint8_t&gt; apply_lookup_16_to(<span class="keyword">const</span> simd8&lt;T&gt; original) {</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>      <span class="keywordflow">return</span> vqtbl1q_u8(*<span class="keyword">this</span>, simd8&lt;uint8_t&gt;(original));</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>    }</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>  };</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span> </div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>  <span class="comment">// Signed bytes</span></div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>  <span class="keyword">template</span>&lt;&gt;</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>  <span class="keyword">struct </span>simd8&lt;int8_t&gt; {</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    int8x16_t value;</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span> </div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>    <span class="keyword">static</span> simdjson_inline simd8&lt;int8_t&gt; splat(int8_t _value) { <span class="keywordflow">return</span> vmovq_n_s8(_value); }</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>    <span class="keyword">static</span> simdjson_inline simd8&lt;int8_t&gt; zero() { <span class="keywordflow">return</span> vdupq_n_s8(0); }</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>    <span class="keyword">static</span> simdjson_inline simd8&lt;int8_t&gt; load(<span class="keyword">const</span> int8_t values[16]) { <span class="keywordflow">return</span> vld1q_s8(values); }</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span> </div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>    <span class="comment">// Conversion from/to SIMD register</span></div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>    simdjson_inline simd8(<span class="keyword">const</span> int8x16_t _value) : value{_value} {}</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>    simdjson_inline <span class="keyword">operator</span> <span class="keyword">const</span> int8x16_t&amp;() <span class="keyword">const</span> { <span class="keywordflow">return</span> this-&gt;value; }</div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>    simdjson_inline <span class="keyword">operator</span> int8x16_t&amp;() { <span class="keywordflow">return</span> this-&gt;value; }</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span> </div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>    <span class="comment">// Zero constructor</span></div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    simdjson_inline simd8() : simd8(zero()) {}</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>    <span class="comment">// Splat constructor</span></div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>    simdjson_inline simd8(int8_t _value) : simd8(splat(_value)) {}</div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>    <span class="comment">// Array constructor</span></div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>    simdjson_inline simd8(<span class="keyword">const</span> int8_t* values) : simd8(load(values)) {}</div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>    <span class="comment">// Member-by-member initialization</span></div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span><span class="preprocessor">#if SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>    simdjson_inline simd8(</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>      int8_t v0,  int8_t v1,  int8_t v2,  int8_t v3, int8_t v4,  int8_t v5,  int8_t v6,  int8_t v7,</div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>      int8_t v8,  int8_t v9,  int8_t v10, int8_t v11, int8_t v12, int8_t v13, int8_t v14, int8_t v15</div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>    ) : simd8(simdjson_make_int8x16_t(</div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>      v0, v1, v2, v3, v4, v5, v6, v7,</div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>      v8, v9, v10,v11,v12,v13,v14,v15</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>    )) {}</div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>    simdjson_inline simd8(</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>      int8_t v0,  int8_t v1,  int8_t v2,  int8_t v3, int8_t v4,  int8_t v5,  int8_t v6,  int8_t v7,</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>      int8_t v8,  int8_t v9,  int8_t v10, int8_t v11, int8_t v12, int8_t v13, int8_t v14, int8_t v15</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>    ) : simd8(int8x16_t{</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>      v0, v1, v2, v3, v4, v5, v6, v7,</div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>      v8, v9, v10,v11,v12,v13,v14,v15</div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>    }) {}</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>    <span class="comment">// Repeat 16 values as many times as necessary (usually for lookup tables)</span></div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>    simdjson_inline <span class="keyword">static</span> simd8&lt;int8_t&gt; repeat_16(</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>      int8_t v0,  int8_t v1,  int8_t v2,  int8_t v3,  int8_t v4,  int8_t v5,  int8_t v6,  int8_t v7,</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>      int8_t v8,  int8_t v9,  int8_t v10, int8_t v11, int8_t v12, int8_t v13, int8_t v14, int8_t v15</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>    ) {</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>      <span class="keywordflow">return</span> simd8&lt;int8_t&gt;(</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>        v0, v1, v2, v3, v4, v5, v6, v7,</div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>        v8, v9, v10,v11,v12,v13,v14,v15</div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>      );</div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>    }</div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span> </div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>    <span class="comment">// Store to array</span></div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>    simdjson_inline <span class="keywordtype">void</span> store(int8_t dst[16])<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vst1q_s8(dst, *<span class="keyword">this</span>); }</div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span> </div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>    <span class="comment">// Explicit conversion to/from unsigned</span></div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>    <span class="comment">//</span></div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>    <span class="comment">// Under Visual Studio/ARM64 uint8x16_t and int8x16_t are apparently the same type.</span></div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>    <span class="comment">// In theory, we could check this occurrence with std::same_as and std::enabled_if but it is C++14</span></div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>    <span class="comment">// and relatively ugly and hard to read.</span></div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span><span class="preprocessor">#ifndef SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>    simdjson_inline <span class="keyword">explicit</span> simd8(<span class="keyword">const</span> uint8x16_t other): simd8(vreinterpretq_s8_u8(other)) {}</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>    simdjson_inline <span class="keyword">explicit</span> <span class="keyword">operator</span> simd8&lt;uint8_t&gt;()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vreinterpretq_u8_s8(this-&gt;value); }</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span> </div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>    <span class="comment">// Math</span></div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>    simdjson_inline simd8&lt;int8_t&gt; operator+(<span class="keyword">const</span> simd8&lt;int8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vaddq_s8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>    simdjson_inline simd8&lt;int8_t&gt; operator-(<span class="keyword">const</span> simd8&lt;int8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vsubq_s8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>    simdjson_inline simd8&lt;int8_t&gt;&amp; operator+=(<span class="keyword">const</span> simd8&lt;int8_t&gt; other) { *<span class="keyword">this</span> = *<span class="keyword">this</span> + other; <span class="keywordflow">return</span> *<span class="keyword">this</span>; }</div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>    simdjson_inline simd8&lt;int8_t&gt;&amp; operator-=(<span class="keyword">const</span> simd8&lt;int8_t&gt; other) { *<span class="keyword">this</span> = *<span class="keyword">this</span> - other; <span class="keywordflow">return</span> *<span class="keyword">this</span>; }</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span> </div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>    <span class="comment">// Order-sensitive comparisons</span></div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>    simdjson_inline simd8&lt;int8_t&gt; max_val(<span class="keyword">const</span> simd8&lt;int8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vmaxq_s8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>    simdjson_inline simd8&lt;int8_t&gt; min_val(<span class="keyword">const</span> simd8&lt;int8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vminq_s8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>    simdjson_inline simd8&lt;bool&gt; operator&gt;(<span class="keyword">const</span> simd8&lt;int8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vcgtq_s8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>    simdjson_inline simd8&lt;bool&gt; operator&lt;(<span class="keyword">const</span> simd8&lt;int8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vcltq_s8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>    simdjson_inline simd8&lt;bool&gt; <a class="code hl_function" href="namespacesimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand.html#aab771b17058b0c93bdd0a8679c2c4d84">operator==</a>(<span class="keyword">const</span> simd8&lt;int8_t&gt; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vceqq_s8(*<span class="keyword">this</span>, other); }</div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span> </div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> N=1&gt;</div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>    simdjson_inline simd8&lt;int8_t&gt; prev(<span class="keyword">const</span> simd8&lt;int8_t&gt; prev_chunk)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>      <span class="keywordflow">return</span> vextq_s8(prev_chunk, *<span class="keyword">this</span>, 16 - N);</div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>    }</div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span> </div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>    <span class="comment">// Perform a lookup assuming no value is larger than 16</span></div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> L&gt;</div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>    simdjson_inline simd8&lt;L&gt; lookup_16(simd8&lt;L&gt; lookup_table)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>      <span class="keywordflow">return</span> lookup_table.apply_lookup_16_to(*<span class="keyword">this</span>);</div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>    }</div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> L&gt;</div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>    simdjson_inline simd8&lt;L&gt; lookup_16(</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>        L replace0,  L replace1,  L replace2,  L replace3,</div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>        L replace4,  L replace5,  L replace6,  L replace7,</div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>        L replace8,  L replace9,  L replace10, L replace11,</div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>        L replace12, L replace13, L replace14, L replace15)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>      <span class="keywordflow">return</span> lookup_16(simd8&lt;L&gt;::repeat_16(</div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>        replace0,  replace1,  replace2,  replace3,</div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>        replace4,  replace5,  replace6,  replace7,</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>        replace8,  replace9,  replace10, replace11,</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>        replace12, replace13, replace14, replace15</div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>      ));</div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>    }</div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span> </div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>    simdjson_inline simd8&lt;int8_t&gt; apply_lookup_16_to(<span class="keyword">const</span> simd8&lt;T&gt; original) {</div>
+<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>      <span class="keywordflow">return</span> vqtbl1q_s8(*<span class="keyword">this</span>, simd8&lt;uint8_t&gt;(original));</div>
+<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>    }</div>
+<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>  };</div>
+<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span> </div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>  <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>  <span class="keyword">struct </span>simd8x64 {</div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>    <span class="keyword">static</span> <span class="keyword">constexpr</span> <span class="keywordtype">int</span> NUM_CHUNKS = 64 / <span class="keyword">sizeof</span>(simd8&lt;T&gt;);</div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>    <span class="keyword">static_assert</span>(NUM_CHUNKS == 4, <span class="stringliteral">&quot;ARM kernel should use four registers per 64-byte block.&quot;</span>);</div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>    <span class="keyword">const</span> simd8&lt;T&gt; chunks[NUM_CHUNKS];</div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>    <span class="keyword">template</span>&lt;<span class="keywordtype">int</span> <span class="keywordtype">id</span>x&gt; simd8&lt;uint8_t&gt; get()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> idx &lt; NUM_CHUNKS ? chunks[idx] : simd8&lt;T&gt;(); }</div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span> </div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>    simd8x64(<span class="keyword">const</span> simd8x64&lt;T&gt;&amp; o) = <span class="keyword">delete</span>; <span class="comment">// no copy allowed</span></div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>    simd8x64&lt;T&gt;&amp; operator=(<span class="keyword">const</span> simd8&lt;T&gt;&amp; other) = <span class="keyword">delete</span>; <span class="comment">// no assignment allowed</span></div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>    simd8x64() = <span class="keyword">delete</span>; <span class="comment">// no default constructor allowed</span></div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span> </div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>    simdjson_inline simd8x64(<span class="keyword">const</span> simd8&lt;T&gt; chunk0, <span class="keyword">const</span> simd8&lt;T&gt; chunk1, <span class="keyword">const</span> simd8&lt;T&gt; chunk2, <span class="keyword">const</span> simd8&lt;T&gt; chunk3) : chunks{chunk0, chunk1, chunk2, chunk3} {}</div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>    simdjson_inline simd8x64(<span class="keyword">const</span> T ptr[64]) : chunks{simd8&lt;T&gt;::load(ptr), simd8&lt;T&gt;::load(ptr+16), simd8&lt;T&gt;::load(ptr+32), simd8&lt;T&gt;::load(ptr+48)} {}</div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span> </div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>    simdjson_inline <span class="keywordtype">void</span> store(T ptr[64])<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>      this-&gt;chunks[0].store(ptr+<span class="keyword">sizeof</span>(simd8&lt;T&gt;)*0);</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>      this-&gt;chunks[1].store(ptr+<span class="keyword">sizeof</span>(simd8&lt;T&gt;)*1);</div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>      this-&gt;chunks[2].store(ptr+<span class="keyword">sizeof</span>(simd8&lt;T&gt;)*2);</div>
+<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>      this-&gt;chunks[3].store(ptr+<span class="keyword">sizeof</span>(simd8&lt;T&gt;)*3);</div>
+<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>    }</div>
+<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span> </div>
+<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>    simdjson_inline simd8&lt;T&gt; reduce_or()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>      <span class="keywordflow">return</span> (this-&gt;chunks[0] | this-&gt;chunks[1]) | (this-&gt;chunks[2] | this-&gt;chunks[3]);</div>
+<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>    }</div>
+<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span> </div>
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span> </div>
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>    simdjson_inline uint64_t compress(uint64_t mask, T * output)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>      uint64_t popcounts = vget_lane_u64(vreinterpret_u64_u8(vcnt_u8(vcreate_u8(~mask))), 0);</div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>      <span class="comment">// compute the prefix sum of the popcounts of each byte</span></div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>      uint64_t offsets = popcounts * 0x0101010101010101;</div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>      this-&gt;chunks[0].compress_halves(uint16_t(mask), output, &amp;output[popcounts &amp; 0xFF]);</div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>      this-&gt;chunks[1].compress_halves(uint16_t(mask &gt;&gt; 16), &amp;output[(offsets &gt;&gt; 8) &amp; 0xFF], &amp;output[(offsets &gt;&gt; 16) &amp; 0xFF]);</div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>      this-&gt;chunks[2].compress_halves(uint16_t(mask &gt;&gt; 32), &amp;output[(offsets &gt;&gt; 24) &amp; 0xFF], &amp;output[(offsets &gt;&gt; 32) &amp; 0xFF]);</div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>      this-&gt;chunks[3].compress_halves(uint16_t(mask &gt;&gt; 48), &amp;output[(offsets &gt;&gt; 40) &amp; 0xFF], &amp;output[(offsets &gt;&gt; 48) &amp; 0xFF]);</div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>      <span class="keywordflow">return</span> offsets &gt;&gt; 56;</div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>    }</div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span> </div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>    simdjson_inline uint64_t to_bitmask()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span><span class="preprocessor">#if SIMDJSON_REGULAR_VISUAL_STUDIO</span></div>
+<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>      <span class="keyword">const</span> uint8x16_t bit_mask = simdjson_make_uint8x16_t(</div>
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>        0x01, 0x02, 0x4, 0x8, 0x10, 0x20, 0x40, 0x80,</div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>        0x01, 0x02, 0x4, 0x8, 0x10, 0x20, 0x40, 0x80</div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>      );</div>
+<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>      <span class="keyword">const</span> uint8x16_t bit_mask = {</div>
+<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>        0x01, 0x02, 0x4, 0x8, 0x10, 0x20, 0x40, 0x80,</div>
+<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>        0x01, 0x02, 0x4, 0x8, 0x10, 0x20, 0x40, 0x80</div>
+<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>      };</div>
+<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>      <span class="comment">// Add each of the elements next to each other, successively, to stuff each 8 byte mask into one.</span></div>
+<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>      uint8x16_t sum0 = vpaddq_u8(this-&gt;chunks[0] &amp; bit_mask, this-&gt;chunks[1] &amp; bit_mask);</div>
+<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>      uint8x16_t sum1 = vpaddq_u8(this-&gt;chunks[2] &amp; bit_mask, this-&gt;chunks[3] &amp; bit_mask);</div>
+<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>      sum0 = vpaddq_u8(sum0, sum1);</div>
+<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>      sum0 = vpaddq_u8(sum0, sum0);</div>
+<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>      <span class="keywordflow">return</span> vgetq_lane_u64(vreinterpretq_u64_u8(sum0), 0);</div>
+<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>    }</div>
+<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span> </div>
+<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>    simdjson_inline uint64_t eq(<span class="keyword">const</span> T m)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>      <span class="keyword">const</span> simd8&lt;T&gt; mask = simd8&lt;T&gt;::splat(m);</div>
+<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>      <span class="keywordflow">return</span>  simd8x64&lt;bool&gt;(</div>
+<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>        this-&gt;chunks[0] == mask,</div>
+<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>        this-&gt;chunks[1] == mask,</div>
+<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>        this-&gt;chunks[2] == mask,</div>
+<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span>        this-&gt;chunks[3] == mask</div>
+<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>      ).to_bitmask();</div>
+<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>    }</div>
+<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span> </div>
+<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>    simdjson_inline uint64_t lteq(<span class="keyword">const</span> T m)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>      <span class="keyword">const</span> simd8&lt;T&gt; mask = simd8&lt;T&gt;::splat(m);</div>
+<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>      <span class="keywordflow">return</span>  simd8x64&lt;bool&gt;(</div>
+<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>        this-&gt;chunks[0] &lt;= mask,</div>
+<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>        this-&gt;chunks[1] &lt;= mask,</div>
+<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>        this-&gt;chunks[2] &lt;= mask,</div>
+<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>        this-&gt;chunks[3] &lt;= mask</div>
+<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>      ).to_bitmask();</div>
+<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>    }</div>
+<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>  }; <span class="comment">// struct simd8x64&lt;T&gt;</span></div>
+<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span> </div>
+<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>} <span class="comment">// namespace simd</span></div>
+<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>} <span class="comment">// unnamed namespace</span></div>
+<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>} <span class="comment">// namespace arm64</span></div>
+<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>} <span class="comment">// namespace simdjson</span></div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span> </div>
+<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_ARM64_SIMD_H</span></div>
+<div class="ttc" id="anamespacesimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_html_aab771b17058b0c93bdd0a8679c2c4d84"><div class="ttname"><a href="namespacesimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand.html#aab771b17058b0c93bdd0a8679c2c4d84">simdjson::SIMDJSON_IMPLEMENTATION::ondemand::operator==</a></div><div class="ttdeci">simdjson_unused simdjson_inline bool operator==(const raw_json_string &amp;a, std::string_view c) noexcept</div><div class="ttdoc">Comparisons between raw_json_string and std::string_view instances are potentially unsafe: the user i...</div><div class="ttdef"><b>Definition</b> <a href="raw__json__string-inl_8h_source.html#l00147">raw_json_string-inl.h:147</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html"><div class="ttname"><a href="namespacesimdjson.html">simdjson</a></div><div class="ttdoc">The top level simdjson namespace, containing everything the library provides.</div><div class="ttdef"><b>Definition</b> <a href="arm64_2base_8h_source.html#l00008">base.h:8</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_76d8247d4498211a7d04a3794a38eb71.html">arm64</a></li><li class="navelem"><b>simd.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

arm64_2stringparsing__defs_8h_source.html

@@ -0,0 +1,196 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/arm64/stringparsing_defs.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('arm64_2stringparsing__defs_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">stringparsing_defs.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_ARM64_STRINGPARSING_DEFS_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#define SIMDJSON_ARM64_STRINGPARSING_DEFS_H</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#ifndef SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/arm64/base.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &quot;simdjson/arm64/simd.h&quot;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &quot;simdjson/arm64/bitmanipulation.h&quot;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a> {</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keyword">namespace </span>arm64 {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keyword">namespace </span>{</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="keyword">using namespace </span>simd;</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment">// Holds backslashes and quotes locations.</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keyword">struct </span>backslash_and_quote {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">public</span>:</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>  <span class="keyword">static</span> <span class="keyword">constexpr</span> uint32_t BYTES_PROCESSED = 32;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>  simdjson_inline backslash_and_quote copy_and_find(<span class="keyword">const</span> uint8_t *src, uint8_t *dst);</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>  simdjson_inline <span class="keywordtype">bool</span> has_quote_first() { <span class="keywordflow">return</span> ((bs_bits - 1) &amp; quote_bits) != 0; }</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>  simdjson_inline <span class="keywordtype">bool</span> has_backslash() { <span class="keywordflow">return</span> bs_bits != 0; }</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>  simdjson_inline <span class="keywordtype">int</span> quote_index() { <span class="keywordflow">return</span> trailing_zeroes(quote_bits); }</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>  simdjson_inline <span class="keywordtype">int</span> backslash_index() { <span class="keywordflow">return</span> trailing_zeroes(bs_bits); }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>  uint32_t bs_bits;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>  uint32_t quote_bits;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>}; <span class="comment">// struct backslash_and_quote</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>simdjson_inline backslash_and_quote backslash_and_quote::copy_and_find(<span class="keyword">const</span> uint8_t *src, uint8_t *dst) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>  <span class="comment">// this can read up to 31 bytes beyond the buffer size, but we require</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>  <span class="comment">// SIMDJSON_PADDING of padding</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>  <span class="keyword">static_assert</span>(<a class="code hl_variable" href="namespacesimdjson.html#aecdd750132f0eb123a6d61113b4197bf">SIMDJSON_PADDING</a> &gt;= (BYTES_PROCESSED - 1), <span class="stringliteral">&quot;backslash and quote finder must process fewer than SIMDJSON_PADDING bytes&quot;</span>);</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>  simd8&lt;uint8_t&gt; v0(src);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>  simd8&lt;uint8_t&gt; v1(src + <span class="keyword">sizeof</span>(v0));</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>  v0.store(dst);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>  v1.store(dst + <span class="keyword">sizeof</span>(v0));</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>  <span class="comment">// Getting a 64-bit bitmask is much cheaper than multiple 16-bit bitmasks on ARM; therefore, we</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>  <span class="comment">// smash them together into a 64-byte mask and get the bitmask from there.</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>  uint64_t bs_and_quote = simd8x64&lt;bool&gt;(v0 == <span class="charliteral">&#39;\\&#39;</span>, v1 == <span class="charliteral">&#39;\\&#39;</span>, v0 == <span class="charliteral">&#39;&quot;&#39;</span>, v1 == <span class="charliteral">&#39;&quot;&#39;</span>).to_bitmask();</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>  <span class="keywordflow">return</span> {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    uint32_t(bs_and_quote),      <span class="comment">// bs_bits</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    uint32_t(bs_and_quote &gt;&gt; 32) <span class="comment">// quote_bits</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>  };</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>}</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="keyword">struct </span>escaping {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>  <span class="keyword">static</span> <span class="keyword">constexpr</span> uint32_t BYTES_PROCESSED = 16;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>  simdjson_inline <span class="keyword">static</span> escaping copy_and_find(<span class="keyword">const</span> uint8_t *src, uint8_t *dst);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>  simdjson_inline <span class="keywordtype">bool</span> has_escape() { <span class="keywordflow">return</span> escape_bits != 0; }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>  simdjson_inline <span class="keywordtype">int</span> escape_index() { <span class="keywordflow">return</span> trailing_zeroes(escape_bits) / 4; }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>  uint64_t escape_bits;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>}; <span class="comment">// struct escaping</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>simdjson_inline escaping escaping::copy_and_find(<span class="keyword">const</span> uint8_t *src, uint8_t *dst) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>  <span class="keyword">static_assert</span>(<a class="code hl_variable" href="namespacesimdjson.html#aecdd750132f0eb123a6d61113b4197bf">SIMDJSON_PADDING</a> &gt;= (BYTES_PROCESSED - 1), <span class="stringliteral">&quot;escaping finder must process fewer than SIMDJSON_PADDING bytes&quot;</span>);</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>  simd8&lt;uint8_t&gt; v(src);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>  v.store(dst);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>  simd8&lt;bool&gt; is_quote = (v == <span class="charliteral">&#39;&quot;&#39;</span>);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>  simd8&lt;bool&gt; is_backslash = (v == <span class="charliteral">&#39;\\&#39;</span>);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>  simd8&lt;bool&gt; is_control = (v &lt; 32);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>  <span class="keywordflow">return</span> {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    (is_backslash | is_quote | is_control).to_bitmask64()</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>  };</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>} <span class="comment">// unnamed namespace</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>} <span class="comment">// namespace arm64</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>} <span class="comment">// namespace simdjson</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_ARM64_STRINGPARSING_DEFS_H</span></div>
+<div class="ttc" id="anamespacesimdjson_html"><div class="ttname"><a href="namespacesimdjson.html">simdjson</a></div><div class="ttdoc">The top level simdjson namespace, containing everything the library provides.</div><div class="ttdef"><b>Definition</b> <a href="arm64_2base_8h_source.html#l00008">base.h:8</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html_aecdd750132f0eb123a6d61113b4197bf"><div class="ttname"><a href="namespacesimdjson.html#aecdd750132f0eb123a6d61113b4197bf">simdjson::SIMDJSON_PADDING</a></div><div class="ttdeci">constexpr size_t SIMDJSON_PADDING</div><div class="ttdoc">The amount of padding needed in a buffer to parse JSON.</div><div class="ttdef"><b>Definition</b> <a href="base_8h_source.html#l00033">base.h:33</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_76d8247d4498211a7d04a3794a38eb71.html">arm64</a></li><li class="navelem"><b>stringparsing_defs.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

arm64_8h_source.html

@@ -0,0 +1,123 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/arm64.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('arm64_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">arm64.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_ARM64_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#define SIMDJSON_ARM64_H</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &quot;simdjson/arm64/begin.h&quot;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/generic/amalgamated.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &quot;simdjson/arm64/end.h&quot;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_ARM64_H</span></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><b>arm64.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

array__iterator-inl_8h_source.html

@@ -0,0 +1,227 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/generic/ondemand/array_iterator-inl.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('array__iterator-inl_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">array_iterator-inl.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_GENERIC_ONDEMAND_ARRAY_ITERATOR_INL_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span> </div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#ifndef SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#define SIMDJSON_GENERIC_ONDEMAND_ARRAY_ITERATOR_INL_H</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/generic/ondemand/base.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &quot;simdjson/generic/ondemand/array_iterator.h&quot;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &quot;simdjson/generic/ondemand/value-inl.h&quot;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &quot;simdjson/generic/ondemand/value_iterator-inl.h&quot;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a> {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keyword">namespace </span>SIMDJSON_IMPLEMENTATION {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="keyword">namespace </span>ondemand {</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>simdjson_inline <a class="code hl_function" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#aa330b23feb572f33d77516431572b643">array_iterator::array_iterator</a>(<span class="keyword">const</span> value_iterator &amp;_iter) noexcept</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>  : iter{_iter}</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>{}</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="foldopen" id="foldopen00019" data-start="{" data-end="}">
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"><a class="line" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#a1577fb5a95f92a4a1aaa8eee6440d572">   19</a></span>simdjson_inline <a class="code hl_struct" href="structsimdjson_1_1simdjson__result.html">simdjson_result&lt;value&gt;</a> <a class="code hl_function" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#a1577fb5a95f92a4a1aaa8eee6440d572">array_iterator::operator*</a>() noexcept {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#if SIMDJSON_DEVELOPMENT_CHECKS</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>   SIMDJSON_ASSUME(!has_been_referenced);</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>   has_been_referenced = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>  <span class="keywordflow">if</span> (iter.error()) { iter.abandon(); <span class="keywordflow">return</span> iter.error(); }</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>  <span class="keywordflow">return</span> <a class="code hl_class" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1value.html">value</a>(iter.child());</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00027" data-start="{" data-end="}">
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#a20cd55e63cf5bdc1561f771b4db1ac1b">   27</a></span>simdjson_inline <span class="keywordtype">bool</span> <a class="code hl_function" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#a20cd55e63cf5bdc1561f771b4db1ac1b">array_iterator::operator==</a>(<span class="keyword">const</span> <a class="code hl_class" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html">array_iterator</a> &amp;other) <span class="keyword">const</span> <span class="keyword">noexcept</span> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>  <span class="keywordflow">return</span> !(*<span class="keyword">this</span> != other);</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00030" data-start="{" data-end="}">
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#abbca17b48bd6c2b045b659076f1f64ce">   30</a></span>simdjson_inline <span class="keywordtype">bool</span> <a class="code hl_function" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#abbca17b48bd6c2b045b659076f1f64ce">array_iterator::operator!=</a>(<span class="keyword">const</span> <a class="code hl_class" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html">array_iterator</a> &amp;) <span class="keyword">const</span> <span class="keyword">noexcept</span> {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>  <span class="keywordflow">return</span> iter.is_open();</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00033" data-start="{" data-end="}">
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#a55e0ae33e5e5835c841fd082edab5937">   33</a></span>simdjson_inline <a class="code hl_class" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html">array_iterator</a> &amp;<a class="code hl_function" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#a55e0ae33e5e5835c841fd082edab5937">array_iterator::operator++</a>() noexcept {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#if SIMDJSON_DEVELOPMENT_CHECKS</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>   has_been_referenced = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>  <a class="code hl_enumeration" href="namespacesimdjson.html#a7b735a3a50ba79e3f7f14df5f77d8da9">error_code</a> error;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>  <span class="comment">// PERF NOTE this is a safety rail ... users should exit loops as soon as they receive an error, so we&#39;ll never get here.</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>  <span class="comment">// However, it does not seem to make a perf difference, so we add it out of an abundance of caution.</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>  <span class="keywordflow">if</span> (( error = iter.error() )) { <span class="keywordflow">return</span> *<span class="keyword">this</span>; }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>  <span class="keywordflow">if</span> (( error = iter.skip_child() )) { <span class="keywordflow">return</span> *<span class="keyword">this</span>; }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>  <span class="keywordflow">if</span> (( error = iter.has_next_element().error() )) { <span class="keywordflow">return</span> *<span class="keyword">this</span>; }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>}</div>
+</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="foldopen" id="foldopen00046" data-start="{" data-end="}">
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#ae7629ba7c3cec3be3bc61d5d79c154c1">   46</a></span>simdjson_inline <span class="keywordtype">bool</span> <a class="code hl_function" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#ae7629ba7c3cec3be3bc61d5d79c154c1">array_iterator::at_end</a>() const noexcept {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>  <span class="keywordflow">return</span> iter.at_end();</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>} <span class="comment">// namespace ondemand</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>} <span class="comment">// namespace SIMDJSON_IMPLEMENTATION</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>} <span class="comment">// namespace simdjson</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a> {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>simdjson_inline simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt;::simdjson_result(</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>  SIMDJSON_IMPLEMENTATION::ondemand::array_iterator &amp;&amp;value</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>) noexcept</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>  : SIMDJSON_IMPLEMENTATION::implementation_simdjson_result_base&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt;(std::forward&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt;(value))</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>{</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>  first.iter.assert_is_valid();</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>}</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>simdjson_inline simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt;::simdjson_result(<a class="code hl_enumeration" href="namespacesimdjson.html#a7b735a3a50ba79e3f7f14df5f77d8da9">error_code</a> error) noexcept</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>  : SIMDJSON_IMPLEMENTATION::implementation_simdjson_result_base&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt;({}, error)</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>{</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>}</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>simdjson_inline simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::value&gt; simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt;::operator*() noexcept {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>  <span class="keywordflow">if</span> (error()) { <span class="keywordflow">return</span> error(); }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>  <span class="keywordflow">return</span> *first;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>simdjson_inline <span class="keywordtype">bool</span> simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt;::operator==(<span class="keyword">const</span> simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt; &amp;other) <span class="keyword">const</span> <span class="keyword">noexcept</span> {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>  <span class="keywordflow">if</span> (!first.iter.is_valid()) { <span class="keywordflow">return</span> !error(); }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>  <span class="keywordflow">return</span> first == other.first;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>simdjson_inline <span class="keywordtype">bool</span> simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt;::operator!=(<span class="keyword">const</span> simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt; &amp;other) <span class="keyword">const</span> <span class="keyword">noexcept</span> {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>  <span class="keywordflow">if</span> (!first.iter.is_valid()) { <span class="keywordflow">return</span> error(); }</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>  <span class="keywordflow">return</span> first != other.first;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>}</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>simdjson_inline simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt; &amp;simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt;::operator++() noexcept {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>  <span class="comment">// Clear the error if there is one, so we don&#39;t yield it twice</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>  <span class="keywordflow">if</span> (error()) { second = <a class="code hl_enumvalue" href="namespacesimdjson.html#a7b735a3a50ba79e3f7f14df5f77d8da9aa4ffc800804829a88c5b52ac3c4c6681">SUCCESS</a>; <span class="keywordflow">return</span> *<span class="keyword">this</span>; }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>  ++(first);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>simdjson_inline <span class="keywordtype">bool</span> simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt;::at_end() const noexcept {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>  <span class="keywordflow">return</span> !first.iter.is_valid() || first.at_end();</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>}</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>} <span class="comment">// namespace simdjson</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_GENERIC_ONDEMAND_ARRAY_ITERATOR_INL_H</span></div>
+<div class="ttc" id="aclasssimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator_html"><div class="ttname"><a href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html">simdjson::SIMDJSON_IMPLEMENTATION::ondemand::array_iterator</a></div><div class="ttdoc">A forward-only JSON array.</div><div class="ttdef"><b>Definition</b> <a href="array__iterator_8h_source.html#l00024">array_iterator.h:24</a></div></div>
+<div class="ttc" id="aclasssimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator_html_a1577fb5a95f92a4a1aaa8eee6440d572"><div class="ttname"><a href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#a1577fb5a95f92a4a1aaa8eee6440d572">simdjson::SIMDJSON_IMPLEMENTATION::ondemand::array_iterator::operator*</a></div><div class="ttdeci">simdjson_inline simdjson_result&lt; value &gt; operator*() noexcept</div><div class="ttdoc">Get the current element.</div><div class="ttdef"><b>Definition</b> <a href="array__iterator-inl_8h_source.html#l00019">array_iterator-inl.h:19</a></div></div>
+<div class="ttc" id="aclasssimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator_html_a20cd55e63cf5bdc1561f771b4db1ac1b"><div class="ttname"><a href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#a20cd55e63cf5bdc1561f771b4db1ac1b">simdjson::SIMDJSON_IMPLEMENTATION::ondemand::array_iterator::operator==</a></div><div class="ttdeci">simdjson_inline bool operator==(const array_iterator &amp;) const noexcept</div><div class="ttdoc">Check if we are at the end of the JSON.</div><div class="ttdef"><b>Definition</b> <a href="array__iterator-inl_8h_source.html#l00027">array_iterator-inl.h:27</a></div></div>
+<div class="ttc" id="aclasssimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator_html_a55e0ae33e5e5835c841fd082edab5937"><div class="ttname"><a href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#a55e0ae33e5e5835c841fd082edab5937">simdjson::SIMDJSON_IMPLEMENTATION::ondemand::array_iterator::operator++</a></div><div class="ttdeci">simdjson_inline array_iterator &amp; operator++() noexcept</div><div class="ttdoc">Move to the next element.</div><div class="ttdef"><b>Definition</b> <a href="array__iterator-inl_8h_source.html#l00033">array_iterator-inl.h:33</a></div></div>
+<div class="ttc" id="aclasssimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator_html_aa330b23feb572f33d77516431572b643"><div class="ttname"><a href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#aa330b23feb572f33d77516431572b643">simdjson::SIMDJSON_IMPLEMENTATION::ondemand::array_iterator::array_iterator</a></div><div class="ttdeci">simdjson_inline array_iterator() noexcept=default</div><div class="ttdoc">Create a new, invalid array iterator.</div></div>
+<div class="ttc" id="aclasssimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator_html_abbca17b48bd6c2b045b659076f1f64ce"><div class="ttname"><a href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#abbca17b48bd6c2b045b659076f1f64ce">simdjson::SIMDJSON_IMPLEMENTATION::ondemand::array_iterator::operator!=</a></div><div class="ttdeci">simdjson_inline bool operator!=(const array_iterator &amp;) const noexcept</div><div class="ttdoc">Check if there are more elements in the JSON array.</div><div class="ttdef"><b>Definition</b> <a href="array__iterator-inl_8h_source.html#l00030">array_iterator-inl.h:30</a></div></div>
+<div class="ttc" id="aclasssimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator_html_ae7629ba7c3cec3be3bc61d5d79c154c1"><div class="ttname"><a href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#ae7629ba7c3cec3be3bc61d5d79c154c1">simdjson::SIMDJSON_IMPLEMENTATION::ondemand::array_iterator::at_end</a></div><div class="ttdeci">simdjson_warn_unused simdjson_inline bool at_end() const noexcept</div><div class="ttdoc">Check if the array is at the end.</div><div class="ttdef"><b>Definition</b> <a href="array__iterator-inl_8h_source.html#l00046">array_iterator-inl.h:46</a></div></div>
+<div class="ttc" id="aclasssimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1value_html"><div class="ttname"><a href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1value.html">simdjson::SIMDJSON_IMPLEMENTATION::ondemand::value</a></div><div class="ttdoc">An ephemeral JSON value returned during iteration.</div><div class="ttdef"><b>Definition</b> <a href="value_8h_source.html#l00022">value.h:22</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html"><div class="ttname"><a href="namespacesimdjson.html">simdjson</a></div><div class="ttdoc">The top level simdjson namespace, containing everything the library provides.</div><div class="ttdef"><b>Definition</b> <a href="arm64_2base_8h_source.html#l00008">base.h:8</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html_a7b735a3a50ba79e3f7f14df5f77d8da9"><div class="ttname"><a href="namespacesimdjson.html#a7b735a3a50ba79e3f7f14df5f77d8da9">simdjson::error_code</a></div><div class="ttdeci">error_code</div><div class="ttdoc">All possible errors returned by simdjson.</div><div class="ttdef"><b>Definition</b> <a href="error_8h_source.html#l00019">error.h:19</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html_a7b735a3a50ba79e3f7f14df5f77d8da9aa4ffc800804829a88c5b52ac3c4c6681"><div class="ttname"><a href="namespacesimdjson.html#a7b735a3a50ba79e3f7f14df5f77d8da9aa4ffc800804829a88c5b52ac3c4c6681">simdjson::SUCCESS</a></div><div class="ttdeci">@ SUCCESS</div><div class="ttdoc">No error.</div><div class="ttdef"><b>Definition</b> <a href="error_8h_source.html#l00020">error.h:20</a></div></div>
+<div class="ttc" id="astructsimdjson_1_1simdjson__result_html"><div class="ttname"><a href="structsimdjson_1_1simdjson__result.html">simdjson::simdjson_result</a></div><div class="ttdoc">The result of a simdjson operation that could fail.</div><div class="ttdef"><b>Definition</b> <a href="error_8h_source.html#l00280">error.h:280</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_53368a02099cf3699f2996a5d88d70b6.html">generic</a></li><li class="navelem"><a class="el" href="dir_7796bb4b727f918c96faee1bdd50e49a.html">ondemand</a></li><li class="navelem"><b>array_iterator-inl.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

array__iterator_8h_source.html

@@ -0,0 +1,208 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/generic/ondemand/array_iterator.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('array__iterator_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">array_iterator.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_GENERIC_ONDEMAND_ARRAY_ITERATOR_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span> </div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#ifndef SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#define SIMDJSON_GENERIC_ONDEMAND_ARRAY_ITERATOR_H</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;iterator&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &quot;simdjson/generic/implementation_simdjson_result_base.h&quot;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &quot;simdjson/generic/ondemand/base.h&quot;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &quot;simdjson/generic/ondemand/value_iterator.h&quot;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a> {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="keyword">namespace </span>SIMDJSON_IMPLEMENTATION {</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="keyword">namespace </span>ondemand {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="foldopen" id="foldopen00024" data-start="{" data-end="};">
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"><a class="line" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html">   24</a></span><span class="keyword">class </span><a class="code hl_class" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html">array_iterator</a> {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">public</span>:</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>  <span class="keyword">using </span>iterator_category = std::input_iterator_tag;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>  <span class="keyword">using </span><a class="code hl_struct" href="structsimdjson_1_1simdjson__result.html">value_type</a> = <a class="code hl_struct" href="structsimdjson_1_1simdjson__result.html">simdjson_result&lt;value&gt;</a>;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>  <span class="keyword">using </span>difference_type = std::ptrdiff_t;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>  <span class="keyword">using </span>pointer = void;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>  <span class="keyword">using </span><a class="code hl_struct" href="structsimdjson_1_1simdjson__result.html">reference</a> = <a class="code hl_struct" href="structsimdjson_1_1simdjson__result.html">value_type</a>;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#aa330b23feb572f33d77516431572b643">   33</a></span>  simdjson_inline <a class="code hl_function" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#aa330b23feb572f33d77516431572b643">array_iterator</a>() noexcept = default;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>  <span class="comment">//</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>  <span class="comment">// Iterator interface</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>  <span class="comment">//</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>  simdjson_inline <a class="code hl_struct" href="structsimdjson_1_1simdjson__result.html">simdjson_result</a>&lt;<a class="code hl_class" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1value.html">value</a>&gt;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>  operator*() noexcept; <span class="comment">// MUST ONLY BE CALLED ONCE PER ITERATION.</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>  simdjson_inline <span class="keywordtype">bool</span> operator==(const <a class="code hl_class" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html">array_iterator</a> &amp;) const noexcept;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>  simdjson_inline <span class="keywordtype">bool</span> operator!=(const <a class="code hl_class" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html">array_iterator</a> &amp;) const noexcept;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>  simdjson_inline <a class="code hl_class" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html">array_iterator</a> &amp;operator++() noexcept;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>  simdjson_warn_unused simdjson_inline <span class="keywordtype">bool</span> <a class="code hl_function" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#ae7629ba7c3cec3be3bc61d5d79c154c1">at_end</a>() const noexcept;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>private:</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="preprocessor">#if SIMDJSON_DEVELOPMENT_CHECKS</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>   <span class="keywordtype">bool</span> has_been_referenced{<span class="keyword">false</span>};</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>  value_iterator iter{};</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>  simdjson_inline <a class="code hl_function" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#aa330b23feb572f33d77516431572b643">array_iterator</a>(<span class="keyword">const</span> value_iterator &amp;iter) <span class="keyword">noexcept</span>;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>  <span class="keyword">friend</span> <span class="keyword">class </span>array;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>  <span class="keyword">friend</span> <span class="keyword">class </span>value;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>  <span class="keyword">friend</span> <span class="keyword">struct </span><a class="code hl_struct" href="structsimdjson_1_1simdjson__result.html">simdjson_result</a>&lt;<a class="code hl_function" href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#aa330b23feb572f33d77516431572b643">array_iterator</a>&gt;;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>};</div>
+</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>} <span class="comment">// namespace ondemand</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>} <span class="comment">// namespace SIMDJSON_IMPLEMENTATION</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>} <span class="comment">// namespace simdjson</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a> {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="keyword">template</span>&lt;&gt;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="keyword">struct </span>simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt; : <span class="keyword">public</span> SIMDJSON_IMPLEMENTATION::implementation_simdjson_result_base&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt; {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>  <span class="keyword">using </span>iterator_category = std::input_iterator_tag;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>  <span class="keyword">using </span>value_type = simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::value&gt;;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>  <span class="keyword">using </span>difference_type = std::ptrdiff_t;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>  <span class="keyword">using </span>pointer = void;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>  <span class="keyword">using </span>reference = value_type;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>  simdjson_inline simdjson_result(SIMDJSON_IMPLEMENTATION::ondemand::array_iterator &amp;&amp;value) <span class="keyword">noexcept</span>; </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>  simdjson_inline simdjson_result(<a class="code hl_enumeration" href="namespacesimdjson.html#a7b735a3a50ba79e3f7f14df5f77d8da9">error_code</a> <a class="code hl_function" href="structsimdjson_1_1simdjson__result.html#a23470fcc7f01262019e96d3f3010b4a1">error</a>) <span class="keyword">noexcept</span>; </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>  simdjson_inline simdjson_result() noexcept = default;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>  <span class="comment">//</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>  <span class="comment">// Iterator interface</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>  <span class="comment">//</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>  simdjson_inline simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::value&gt; operator*() noexcept; <span class="comment">// MUST ONLY BE CALLED ONCE PER ITERATION.</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>  simdjson_inline <span class="keywordtype">bool</span> operator==(const simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt; &amp;) const noexcept;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>  simdjson_inline <span class="keywordtype">bool</span> operator!=(const simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt; &amp;) const noexcept;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>  simdjson_inline simdjson_result&lt;SIMDJSON_IMPLEMENTATION::ondemand::array_iterator&gt; &amp;operator++() noexcept;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>  simdjson_warn_unused simdjson_inline <span class="keywordtype">bool</span> at_end() const noexcept;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>};</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>} <span class="comment">// namespace simdjson</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_GENERIC_ONDEMAND_ARRAY_ITERATOR_H</span></div>
+<div class="ttc" id="aclasssimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator_html"><div class="ttname"><a href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html">simdjson::SIMDJSON_IMPLEMENTATION::ondemand::array_iterator</a></div><div class="ttdoc">A forward-only JSON array.</div><div class="ttdef"><b>Definition</b> <a href="array__iterator_8h_source.html#l00024">array_iterator.h:24</a></div></div>
+<div class="ttc" id="aclasssimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator_html_aa330b23feb572f33d77516431572b643"><div class="ttname"><a href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#aa330b23feb572f33d77516431572b643">simdjson::SIMDJSON_IMPLEMENTATION::ondemand::array_iterator::array_iterator</a></div><div class="ttdeci">simdjson_inline array_iterator() noexcept=default</div><div class="ttdoc">Create a new, invalid array iterator.</div></div>
+<div class="ttc" id="aclasssimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator_html_ae7629ba7c3cec3be3bc61d5d79c154c1"><div class="ttname"><a href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1array__iterator.html#ae7629ba7c3cec3be3bc61d5d79c154c1">simdjson::SIMDJSON_IMPLEMENTATION::ondemand::array_iterator::at_end</a></div><div class="ttdeci">simdjson_warn_unused simdjson_inline bool at_end() const noexcept</div><div class="ttdoc">Check if the array is at the end.</div><div class="ttdef"><b>Definition</b> <a href="array__iterator-inl_8h_source.html#l00046">array_iterator-inl.h:46</a></div></div>
+<div class="ttc" id="aclasssimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1value_html"><div class="ttname"><a href="classsimdjson_1_1_s_i_m_d_j_s_o_n___i_m_p_l_e_m_e_n_t_a_t_i_o_n_1_1ondemand_1_1value.html">simdjson::SIMDJSON_IMPLEMENTATION::ondemand::value</a></div><div class="ttdoc">An ephemeral JSON value returned during iteration.</div><div class="ttdef"><b>Definition</b> <a href="value_8h_source.html#l00022">value.h:22</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html"><div class="ttname"><a href="namespacesimdjson.html">simdjson</a></div><div class="ttdoc">The top level simdjson namespace, containing everything the library provides.</div><div class="ttdef"><b>Definition</b> <a href="arm64_2base_8h_source.html#l00008">base.h:8</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html_a7b735a3a50ba79e3f7f14df5f77d8da9"><div class="ttname"><a href="namespacesimdjson.html#a7b735a3a50ba79e3f7f14df5f77d8da9">simdjson::error_code</a></div><div class="ttdeci">error_code</div><div class="ttdoc">All possible errors returned by simdjson.</div><div class="ttdef"><b>Definition</b> <a href="error_8h_source.html#l00019">error.h:19</a></div></div>
+<div class="ttc" id="astructsimdjson_1_1simdjson__result_html"><div class="ttname"><a href="structsimdjson_1_1simdjson__result.html">simdjson::simdjson_result</a></div><div class="ttdoc">The result of a simdjson operation that could fail.</div><div class="ttdef"><b>Definition</b> <a href="error_8h_source.html#l00280">error.h:280</a></div></div>
+<div class="ttc" id="astructsimdjson_1_1simdjson__result_html_a23470fcc7f01262019e96d3f3010b4a1"><div class="ttname"><a href="structsimdjson_1_1simdjson__result.html#a23470fcc7f01262019e96d3f3010b4a1">simdjson::simdjson_result::error</a></div><div class="ttdeci">simdjson_inline error_code error() const noexcept</div><div class="ttdoc">The error.</div><div class="ttdef"><b>Definition</b> <a href="error-inl_8h_source.html#l00168">error-inl.h:168</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_53368a02099cf3699f2996a5d88d70b6.html">generic</a></li><li class="navelem"><a class="el" href="dir_7796bb4b727f918c96faee1bdd50e49a.html">ondemand</a></li><li class="navelem"><b>array_iterator.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

atomic__ptr_8h_source.html

@@ -0,0 +1,147 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/internal/atomic_ptr.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('atomic__ptr_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">atomic_ptr.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_INTERNAL_ATOMIC_PTR_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#define SIMDJSON_INTERNAL_ATOMIC_PTR_H</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &quot;simdjson/base.h&quot;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;atomic&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a> {</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="keyword">namespace </span>internal {</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keyword">class </span>atomic_ptr {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keyword">public</span>:</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>  atomic_ptr(T *_ptr) : ptr{_ptr} {}</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>  <span class="keyword">operator</span> <span class="keyword">const</span> T*() <span class="keyword">const</span> { <span class="keywordflow">return</span> ptr.load(); }</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>  <span class="keyword">const</span> T&amp; operator*()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> *ptr; }</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>  <span class="keyword">const</span> T* operator-&gt;()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> ptr.load(); }</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>  <span class="keyword">operator</span> T*() { <span class="keywordflow">return</span> ptr.load(); }</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>  T&amp; operator*() { <span class="keywordflow">return</span> *ptr; }</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>  T* operator-&gt;() { <span class="keywordflow">return</span> ptr.load(); }</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>  atomic_ptr&amp; operator=(T *_ptr) { ptr = _ptr; <span class="keywordflow">return</span> *<span class="keyword">this</span>; }</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">private</span>:</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>  std::atomic&lt;T*&gt; ptr;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>};</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>} <span class="comment">// namespace internal</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>} <span class="comment">// namespace simdjson</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_INTERNAL_ATOMIC_PTR_H</span></div>
+<div class="ttc" id="anamespacesimdjson_html"><div class="ttname"><a href="namespacesimdjson.html">simdjson</a></div><div class="ttdoc">The top level simdjson namespace, containing everything the library provides.</div><div class="ttdef"><b>Definition</b> <a href="arm64_2base_8h_source.html#l00008">base.h:8</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_0fee190c3bc9a7d22e6d44901a62fa54.html">internal</a></li><li class="navelem"><b>atomic_ptr.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

atomparsing_8h_source.html

@@ -0,0 +1,193 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/generic/atomparsing.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('atomparsing_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">atomparsing.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#ifndef SIMDJSON_GENERIC_ATOMPARSING_H</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span> </div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#ifndef SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#define SIMDJSON_GENERIC_ATOMPARSING_H</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;simdjson/generic/base.h&quot;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &quot;simdjson/generic/jsoncharutils.h&quot;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_CONDITIONAL_INCLUDE</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a> {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keyword">namespace </span>SIMDJSON_IMPLEMENTATION {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="keyword">namespace </span>{</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="keyword">namespace </span>atomparsing {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment">// The string_to_uint32 is exclusively used to map literal strings to 32-bit values.</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment">// We use memcpy instead of a pointer cast to avoid undefined behaviors since we cannot</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment">// be certain that the character pointer will be properly aligned.</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment">// You might think that using memcpy makes this function expensive, but you&#39;d be wrong.</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment">// All decent optimizing compilers (GCC, clang, Visual Studio) will compile string_to_uint32(&quot;false&quot;);</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment">// to the compile-time constant 1936482662.</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>simdjson_inline uint32_t string_to_uint32(<span class="keyword">const</span> <span class="keywordtype">char</span>* str) { uint32_t val; std::memcpy(&amp;val, str, <span class="keyword">sizeof</span>(uint32_t)); <span class="keywordflow">return</span> val; }</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment">// Again in str4ncmp we use a memcpy to avoid undefined behavior. The memcpy may appear expensive.</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment">// Yet all decent optimizing compilers will compile memcpy to a single instruction, just about.</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>simdjson_warn_unused</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>simdjson_inline uint32_t str4ncmp(<span class="keyword">const</span> uint8_t *src, <span class="keyword">const</span> <span class="keywordtype">char</span>* atom) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>  uint32_t srcval; <span class="comment">// we want to avoid unaligned 32-bit loads (undefined in C/C++)</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>  <span class="keyword">static_assert</span>(<span class="keyword">sizeof</span>(uint32_t) &lt;= <a class="code hl_variable" href="namespacesimdjson.html#aecdd750132f0eb123a6d61113b4197bf">SIMDJSON_PADDING</a>, <span class="stringliteral">&quot;SIMDJSON_PADDING must be larger than 4 bytes&quot;</span>);</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>  std::memcpy(&amp;srcval, src, <span class="keyword">sizeof</span>(uint32_t));</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>  <span class="keywordflow">return</span> srcval ^ string_to_uint32(atom);</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>}</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>simdjson_warn_unused</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>simdjson_inline <span class="keywordtype">bool</span> is_valid_true_atom(<span class="keyword">const</span> uint8_t *src) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>  <span class="keywordflow">return</span> (str4ncmp(src, <span class="stringliteral">&quot;true&quot;</span>) | jsoncharutils::is_not_structural_or_whitespace(src[4])) == 0;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>}</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>simdjson_warn_unused</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>simdjson_inline <span class="keywordtype">bool</span> is_valid_true_atom(<span class="keyword">const</span> uint8_t *src, <span class="keywordtype">size_t</span> len) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>  <span class="keywordflow">if</span> (len &gt; 4) { <span class="keywordflow">return</span> is_valid_true_atom(src); }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (len == 4) { <span class="keywordflow">return</span> !str4ncmp(src, <span class="stringliteral">&quot;true&quot;</span>); }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>  <span class="keywordflow">else</span> { <span class="keywordflow">return</span> <span class="keyword">false</span>; }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>}</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>simdjson_warn_unused</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>simdjson_inline <span class="keywordtype">bool</span> is_valid_false_atom(<span class="keyword">const</span> uint8_t *src) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>  <span class="keywordflow">return</span> (str4ncmp(src+1, <span class="stringliteral">&quot;alse&quot;</span>) | jsoncharutils::is_not_structural_or_whitespace(src[5])) == 0;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>}</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>simdjson_warn_unused</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>simdjson_inline <span class="keywordtype">bool</span> is_valid_false_atom(<span class="keyword">const</span> uint8_t *src, <span class="keywordtype">size_t</span> len) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>  <span class="keywordflow">if</span> (len &gt; 5) { <span class="keywordflow">return</span> is_valid_false_atom(src); }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (len == 5) { <span class="keywordflow">return</span> !str4ncmp(src+1, <span class="stringliteral">&quot;alse&quot;</span>); }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>  <span class="keywordflow">else</span> { <span class="keywordflow">return</span> <span class="keyword">false</span>; }</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>simdjson_warn_unused</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>simdjson_inline <span class="keywordtype">bool</span> is_valid_null_atom(<span class="keyword">const</span> uint8_t *src) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>  <span class="keywordflow">return</span> (str4ncmp(src, <span class="stringliteral">&quot;null&quot;</span>) | jsoncharutils::is_not_structural_or_whitespace(src[4])) == 0;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>}</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>simdjson_warn_unused</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>simdjson_inline <span class="keywordtype">bool</span> is_valid_null_atom(<span class="keyword">const</span> uint8_t *src, <span class="keywordtype">size_t</span> len) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>  <span class="keywordflow">if</span> (len &gt; 4) { <span class="keywordflow">return</span> is_valid_null_atom(src); }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (len == 4) { <span class="keywordflow">return</span> !str4ncmp(src, <span class="stringliteral">&quot;null&quot;</span>); }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>  <span class="keywordflow">else</span> { <span class="keywordflow">return</span> <span class="keyword">false</span>; }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>} <span class="comment">// namespace atomparsing</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>} <span class="comment">// unnamed namespace</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>} <span class="comment">// namespace SIMDJSON_IMPLEMENTATION</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>} <span class="comment">// namespace simdjson</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_GENERIC_ATOMPARSING_H</span></div>
+<div class="ttc" id="anamespacesimdjson_html"><div class="ttname"><a href="namespacesimdjson.html">simdjson</a></div><div class="ttdoc">The top level simdjson namespace, containing everything the library provides.</div><div class="ttdef"><b>Definition</b> <a href="arm64_2base_8h_source.html#l00008">base.h:8</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html_aecdd750132f0eb123a6d61113b4197bf"><div class="ttname"><a href="namespacesimdjson.html#aecdd750132f0eb123a6d61113b4197bf">simdjson::SIMDJSON_PADDING</a></div><div class="ttdeci">constexpr size_t SIMDJSON_PADDING</div><div class="ttdoc">The amount of padding needed in a buffer to parse JSON.</div><div class="ttdef"><b>Definition</b> <a href="base_8h_source.html#l00033">base.h:33</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><a class="el" href="dir_53368a02099cf3699f2996a5d88d70b6.html">generic</a></li><li class="navelem"><b>atomparsing.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

base_8h_source.html

@@ -0,0 +1,165 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.9.8"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>simdjson: include/simdjson/base.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only.css" rel="stylesheet" type="text/css"/>
+<link href="doxygen-awesome-sidebar-only-darkmode-toggle.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="logotiny.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">simdjson<span id="projectnumber">&#160;4.6.4</span>
+   </div>
+   <div id="projectbrief">Ridiculously Fast JSON</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.9.8 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function() { init_codefold(0); });
+/* @license-end */
+</script>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(document).ready(function(){initNavTree('base_8h_source.html',''); initResizable(); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">base.h</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#ifndef SIMDJSON_BASE_H</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#define SIMDJSON_BASE_H</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &quot;simdjson/common_defs.h&quot;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &quot;simdjson/compiler_check.h&quot;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &quot;simdjson/error.h&quot;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &quot;simdjson/portability.h&quot;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &quot;simdjson/concepts.h&quot;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &quot;simdjson/constevalutil.h&quot;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacesimdjson.html">simdjson</a> {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>SIMDJSON_PUSH_DISABLE_UNUSED_WARNINGS</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"><a class="line" href="namespacesimdjson.html#ad0bad3783275be4012bd5cfd0327875a">   23</a></span><span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> <a class="code hl_variable" href="namespacesimdjson.html#ad0bad3783275be4012bd5cfd0327875a">SIMDJSON_MAXSIZE_BYTES</a> = 0xFFFFFFFF;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="namespacesimdjson.html#aecdd750132f0eb123a6d61113b4197bf">   33</a></span><span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> <a class="code hl_variable" href="namespacesimdjson.html#aecdd750132f0eb123a6d61113b4197bf">SIMDJSON_PADDING</a> = 64;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="namespacesimdjson.html#a6df2598eb1d4e1ea669c41831cc7325d">   40</a></span><span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> <a class="code hl_variable" href="namespacesimdjson.html#a6df2598eb1d4e1ea669c41831cc7325d">DEFAULT_MAX_DEPTH</a> = 1024;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>SIMDJSON_POP_DISABLE_UNUSED_WARNINGS</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="keyword">class </span><a class="code hl_class" href="classsimdjson_1_1implementation.html">implementation</a>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="keyword">struct </span><a class="code hl_struct" href="structsimdjson_1_1padded__string.html">padded_string</a>;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="keyword">class </span><a class="code hl_class" href="classsimdjson_1_1padded__string__view.html">padded_string_view</a>;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="keyword">enum class</span> <a class="code hl_enumeration" href="namespacesimdjson.html#ae6ec9f0ce23fc51d87116b64fdbeb811">stage1_mode</a>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="keyword">namespace </span>internal {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="keyword">class </span>atomic_ptr;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="keyword">class </span>dom_parser_implementation;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="keyword">class </span>escape_json_string;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="keyword">class </span>tape_ref;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="keyword">struct </span>value128;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="keyword">enum class</span> tape_type;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>} <span class="comment">// namespace internal</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>} <span class="comment">// namespace simdjson</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="preprocessor">#endif </span><span class="comment">// SIMDJSON_BASE_H</span></div>
+<div class="ttc" id="aclasssimdjson_1_1implementation_html"><div class="ttname"><a href="classsimdjson_1_1implementation.html">simdjson::implementation</a></div><div class="ttdoc">An implementation of simdjson for a particular CPU architecture.</div><div class="ttdef"><b>Definition</b> <a href="implementation_8h_source.html#l00045">implementation.h:45</a></div></div>
+<div class="ttc" id="aclasssimdjson_1_1padded__string__view_html"><div class="ttname"><a href="classsimdjson_1_1padded__string__view.html">simdjson::padded_string_view</a></div><div class="ttdoc">User-provided string that promises it has extra padded bytes at the end for use with parser::parse().</div><div class="ttdef"><b>Definition</b> <a href="padded__string__view_8h_source.html#l00018">padded_string_view.h:18</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html"><div class="ttname"><a href="namespacesimdjson.html">simdjson</a></div><div class="ttdoc">The top level simdjson namespace, containing everything the library provides.</div><div class="ttdef"><b>Definition</b> <a href="arm64_2base_8h_source.html#l00008">base.h:8</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html_a6df2598eb1d4e1ea669c41831cc7325d"><div class="ttname"><a href="namespacesimdjson.html#a6df2598eb1d4e1ea669c41831cc7325d">simdjson::DEFAULT_MAX_DEPTH</a></div><div class="ttdeci">constexpr size_t DEFAULT_MAX_DEPTH</div><div class="ttdoc">By default, simdjson supports this many nested objects and arrays.</div><div class="ttdef"><b>Definition</b> <a href="base_8h_source.html#l00040">base.h:40</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html_ad0bad3783275be4012bd5cfd0327875a"><div class="ttname"><a href="namespacesimdjson.html#ad0bad3783275be4012bd5cfd0327875a">simdjson::SIMDJSON_MAXSIZE_BYTES</a></div><div class="ttdeci">SIMDJSON_PUSH_DISABLE_UNUSED_WARNINGS constexpr size_t SIMDJSON_MAXSIZE_BYTES</div><div class="ttdoc">The maximum document size supported by simdjson.</div><div class="ttdef"><b>Definition</b> <a href="base_8h_source.html#l00023">base.h:23</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html_ae6ec9f0ce23fc51d87116b64fdbeb811"><div class="ttname"><a href="namespacesimdjson.html#ae6ec9f0ce23fc51d87116b64fdbeb811">simdjson::stage1_mode</a></div><div class="ttdeci">stage1_mode</div><div class="ttdoc">This enum is used with the dom_parser_implementation::stage1 function.</div><div class="ttdef"><b>Definition</b> <a href="internal_2dom__parser__implementation_8h_source.html#l00022">dom_parser_implementation.h:22</a></div></div>
+<div class="ttc" id="anamespacesimdjson_html_aecdd750132f0eb123a6d61113b4197bf"><div class="ttname"><a href="namespacesimdjson.html#aecdd750132f0eb123a6d61113b4197bf">simdjson::SIMDJSON_PADDING</a></div><div class="ttdeci">constexpr size_t SIMDJSON_PADDING</div><div class="ttdoc">The amount of padding needed in a buffer to parse JSON.</div><div class="ttdef"><b>Definition</b> <a href="base_8h_source.html#l00033">base.h:33</a></div></div>
+<div class="ttc" id="astructsimdjson_1_1padded__string_html"><div class="ttname"><a href="structsimdjson_1_1padded__string.html">simdjson::padded_string</a></div><div class="ttdoc">String with extra allocation for ease of use with parser::parse()</div><div class="ttdef"><b>Definition</b> <a href="padded__string_8h_source.html#l00023">padded_string.h:23</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_49a0b2767ded4a45005c5d6720a18cd1.html">simdjson</a></li><li class="navelem"><b>base.h</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
+  </ul>
+</div>
+</body>
+</html>

benchmark/CMakeLists.txt

@@ -1,50 +0,0 @@
-include_directories( . linux )
-link_libraries(simdjson-windows-headers test-data)
-
-
-if (TARGET benchmark::benchmark)
-  add_executable(bench_sax bench_sax.cpp)
-  target_link_libraries(bench_sax simdjson-internal-flags simdjson-include-source benchmark::benchmark)
-endif (TARGET benchmark::benchmark)
-
-link_libraries(simdjson simdjson-flags)
-add_executable(benchfeatures benchfeatures.cpp)
-add_executable(get_corpus_benchmark get_corpus_benchmark.cpp)
-add_executable(perfdiff perfdiff.cpp)
-add_executable(parse parse.cpp)
-add_executable(parse_stream parse_stream.cpp)
-add_executable(statisticalmodel statisticalmodel.cpp)
-
-add_executable(parse_noutf8validation parse.cpp)
-target_compile_definitions(parse_noutf8validation PRIVATE SIMDJSON_SKIPUTF8VALIDATION)
-add_executable(parse_nonumberparsing parse.cpp)
-target_compile_definitions(parse_nonumberparsing PRIVATE SIMDJSON_SKIPNUMBERPARSING)
-add_executable(parse_nostringparsing parse.cpp)
-target_compile_definitions(parse_nostringparsing PRIVATE SIMDJSON_SKIPSTRINGPARSING)
-
-if (TARGET competition-all)
-  add_executable(distinctuseridcompetition distinctuseridcompetition.cpp)
-  target_link_libraries(distinctuseridcompetition competition-core)
-
-  add_executable(minifiercompetition minifiercompetition.cpp)
-  target_link_libraries(minifiercompetition competition-core)
-
-  add_executable(parseandstatcompetition parseandstatcompetition.cpp)
-  target_link_libraries(parseandstatcompetition competition-core)
-
-  add_executable(parsingcompetition parsingcompetition.cpp)
-  target_link_libraries(parsingcompetition competition-core)
-
-  add_executable(allparsingcompetition parsingcompetition.cpp)
-  target_link_libraries(allparsingcompetition competition-all)
-  target_compile_definitions(allparsingcompetition PRIVATE ALLPARSER)
-endif()
-
-if (TARGET benchmark::benchmark)
-  link_libraries(benchmark::benchmark)
-  add_executable(bench_parse_call bench_parse_call.cpp)
-  add_executable(bench_dom_api bench_dom_api.cpp)
-  add_executable(bench_ondemand bench_ondemand.cpp)
-endif()
-
-include(checkperf.cmake)

benchmark/Dockerfile

@@ -1,19 +0,0 @@
-# From the ROOT, run:
-# docker build -t simdjsonbench -f benchmark/Dockerfile . && docker run --privileged -t simdjsonbench
-FROM gcc:8.3
-
-# # Build latest
-# ENV latest_release=v0.2.1
-# WORKDIR /usr/src/$latest_release/
-# RUN git clone --depth 1 https://github.com/lemire/simdjson/ -b $latest_release .
-# RUN make parse
-
-# # Build master
-# WORKDIR /usr/src/master/
-# RUN git clone --depth 1 https://github.com/lemire/simdjson/ .
-# RUN make parse
-
-# Build the current source
-COPY . /usr/src/current/
-WORKDIR /usr/src/current/
-RUN make checkperf

benchmark/bench_dom_api.cpp

@@ -1,732 +0,0 @@
-#include <benchmark/benchmark.h>
-#include "simdjson.h"
-#include <sstream>
-
-using namespace simdjson;
-using namespace benchmark;
-using namespace std;
-
-const padded_string EMPTY_ARRAY("[]", 2);
-
-const char *TWITTER_JSON = SIMDJSON_BENCHMARK_DATA_DIR "twitter.json";
-const char *NUMBERS_JSON = SIMDJSON_BENCHMARK_DATA_DIR "numbers.json";
-
-static void recover_one_string(State& state) {
-  dom::parser parser;
-  const std::string_view data = "\"one string\"";
-  padded_string docdata{data};
-  // we do not want mem. alloc. in the loop.
-  auto error = parser.allocate(docdata.size());
-  if(error) {
-      cout << error << endl;
-      return;
-  }
-  dom::element doc;
-  if ((error = parser.parse(docdata).get(doc))) {
-    cerr << "could not parse string" << error << endl;
-    return;
-  }
-  for (simdjson_unused auto _ : state) {
-      std::string_view v;
-      error = doc.get(v);
-      if (error) {
-        cerr << "could not get string" << error << endl;
-        return;
-      }
-      benchmark::DoNotOptimize(v);
-  }
-}
-BENCHMARK(recover_one_string);
-
-
-static void serialize_twitter(State& state) {
-  dom::parser parser;
-  padded_string docdata;
-  auto error = padded_string::load(TWITTER_JSON).get(docdata);
-  if(error) {
-      cerr << "could not parse twitter.json" << error << endl;
-      return;
-  }
-  // we do not want mem. alloc. in the loop.
-  if((error = parser.allocate(docdata.size()))) {
-      cout << error << endl;
-      return;
-  }
-  dom::element doc;
-  if ((error = parser.parse(docdata).get(doc))) {
-    cerr << "could not parse twitter.json" << error << endl;
-    return;
-  }
-  size_t bytes = 0;
-  for (simdjson_unused auto _ : state) {
-    std::string serial = simdjson::minify(doc);
-    bytes += serial.size();
-    benchmark::DoNotOptimize(serial);
-  }
-  // we validate the result
-  {
-    auto serial = simdjson::minify(doc);
-    dom::element doc2; // we parse the minified output
-    if ((error = parser.parse(serial).get(doc2))) { throw std::runtime_error("serialization error"); }
-    auto serial2 = simdjson::minify(doc2); // we minify a second time
-    if(serial != serial2) { throw std::runtime_error("serialization mismatch"); }
-  }
-  // Gigabyte: https://en.wikipedia.org/wiki/Gigabyte
-  state.counters["Gigabytes"] = benchmark::Counter(
-	        double(bytes), benchmark::Counter::kIsRate,
-	        benchmark::Counter::OneK::kIs1000); // For GiB : kIs1024
-  state.counters["docs"] = Counter(double(state.iterations()), benchmark::Counter::kIsRate);
-}
-BENCHMARK(serialize_twitter)->ComputeStatistics("max", [](const std::vector<double>& v) -> double {
-    return *(std::max_element(std::begin(v), std::end(v)));
-  })->DisplayAggregatesOnly(true);
-
-
-static void serialize_big_string_to_string(State& state) {
-  dom::parser parser;
-  std::vector<char> content;
-  content.push_back('\"');
-  for(size_t i = 0 ; i < 100000; i ++) {
-    content.push_back('0' + char(i%10)); // we add what looks like a long list of digits 
-  } 
-  content.push_back('\"');
-  dom::element doc;
-  simdjson::error_code error;
-  if ((error = parser.parse(content.data(), content.size()).get(doc))) {
-    cerr << "could not parse big string" << error << endl;
-    return;
-  }
-  size_t bytes = 0;
-  for (simdjson_unused auto _ : state) {
-    auto serial = simdjson::to_string(doc);
-    bytes += serial.size();
-    benchmark::DoNotOptimize(serial);
-  }
-  // Gigabyte: https://en.wikipedia.org/wiki/Gigabyte
-  state.counters["Gigabytes"] = benchmark::Counter(
-	        double(bytes), benchmark::Counter::kIsRate,
-	        benchmark::Counter::OneK::kIs1000); // For GiB : kIs1024
-  state.counters["docs"] = Counter(double(state.iterations()), benchmark::Counter::kIsRate);
-}
-BENCHMARK(serialize_big_string_to_string)->ComputeStatistics("max", [](const std::vector<double>& v) -> double {
-    return *(std::max_element(std::begin(v), std::end(v)));
-  })->DisplayAggregatesOnly(true);
-
-
-static void serialize_twitter_to_string(State& state) {
-  dom::parser parser;
-  padded_string docdata;
-  auto error = padded_string::load(TWITTER_JSON).get(docdata);
-  if(error) {
-      cerr << "could not parse twitter.json" << error << endl;
-      return;
-  }
-  // we do not want mem. alloc. in the loop.
-  if((error = parser.allocate(docdata.size()))) {
-      cout << error << endl;
-      return;
-  }
-  dom::element doc;
-  if ((error = parser.parse(docdata).get(doc))) {
-    cerr << "could not parse twitter.json" << error << endl;
-    return;
-  }
-  size_t bytes = 0;
-  for (simdjson_unused auto _ : state) {
-    auto serial = simdjson::to_string(doc);
-    bytes += serial.size();
-    benchmark::DoNotOptimize(serial);
-  }
-  // we validate the result
-  {
-    auto serial = simdjson::to_string(doc); 
-    dom::element doc2; // we parse the stringify output
-    if ((error = parser.parse(serial).get(doc2))) { throw std::runtime_error("serialization error"); }
-    auto serial2 = simdjson::to_string(doc2); // we stringify again
-    if(serial != serial2) { throw std::runtime_error("serialization mismatch"); }
-  }
-  // Gigabyte: https://en.wikipedia.org/wiki/Gigabyte
-  state.counters["Gigabytes"] = benchmark::Counter(
-	        double(bytes), benchmark::Counter::kIsRate,
-	        benchmark::Counter::OneK::kIs1000); // For GiB : kIs1024
-  state.counters["docs"] = Counter(double(state.iterations()), benchmark::Counter::kIsRate);
-}
-BENCHMARK(serialize_twitter_to_string)->ComputeStatistics("max", [](const std::vector<double>& v) -> double {
-    return *(std::max_element(std::begin(v), std::end(v)));
-  })->DisplayAggregatesOnly(true);
-
-static void serialize_twitter_string_builder(State& state) {
-  dom::parser parser;
-  padded_string docdata;
-  auto error = padded_string::load(TWITTER_JSON).get(docdata);
-  if(error) {
-      cerr << "could not parse twitter.json" << error << endl;
-      return;
-  }
-  // we do not want mem. alloc. in the loop.
-  if((error = parser.allocate(docdata.size()))) {
-      cout << error << endl;
-      return;
-  }
-  dom::element doc;
-  if ((error = parser.parse(docdata).get(doc))) {
-    cerr << "could not parse twitter.json" << error << endl;
-    return;
-  }
-  size_t bytes = 0;
-  simdjson::internal::string_builder<> sb;// not part of our public API, for internal use
-  for (simdjson_unused auto _ : state) {
-    sb.clear();
-    sb.append(doc);
-    std::string_view serial = sb.str();
-    bytes += serial.size();
-    benchmark::DoNotOptimize(serial);
-  }
-  // Gigabyte: https://en.wikipedia.org/wiki/Gigabyte
-  state.counters["Gigabytes"] = benchmark::Counter(
-	        double(bytes), benchmark::Counter::kIsRate,
-	        benchmark::Counter::OneK::kIs1000); // For GiB : kIs1024
-  state.counters["docs"] = Counter(double(state.iterations()), benchmark::Counter::kIsRate);
-}
-BENCHMARK(serialize_twitter_string_builder)->ComputeStatistics("max", [](const std::vector<double>& v) -> double {
-    return *(std::max_element(std::begin(v), std::end(v)));
-  })->DisplayAggregatesOnly(true);
-
-
-static void numbers_scan(State& state) {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-  dom::array arr;
-  simdjson::error_code error;
-  if ((error = parser.load(NUMBERS_JSON).get(arr))) {
-    cerr << "could not read " << NUMBERS_JSON << " as an array: " << error << endl;
-    return;
-  }
-  for (simdjson_unused auto _ : state) {
-    std::vector<double> container;
-    for (auto e : arr) {
-      double x;
-      if ((error = e.get(x))) { cerr << "found a node that is not an number: " << error << endl; break;}
-      container.push_back(x);
-    }
-    benchmark::DoNotOptimize(container.data());
-    benchmark::ClobberMemory();
-  }  
-}
-BENCHMARK(numbers_scan);
-
-static void numbers_size_scan(State& state) {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-  dom::array arr;
-  simdjson::error_code error;
-  if ((error = parser.load(NUMBERS_JSON).get(arr))) {
-    cerr << "could not read " << NUMBERS_JSON << " as an array: " << error << endl;
-    return;
-  }
-  for (simdjson_unused auto _ : state) {
-    std::vector<double> container;
-    container.resize(arr.size());
-    size_t pos = 0;
-    for (auto e : arr) {
-      double x;
-      if ((error = e.get(x))) { cerr << "found a node that is not an number: " << error << endl; break;}
-      container[pos++] = x;
-    }
-    if(pos != container.size()) { cerr << "bad count" << endl; }
-    benchmark::DoNotOptimize(container.data());
-    benchmark::ClobberMemory();
-  }  
-}
-BENCHMARK(numbers_size_scan);
-
-
-static void numbers_type_scan(State& state) {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-  dom::array arr;
-  simdjson::error_code error;
-  if ((error = parser.load(NUMBERS_JSON).get(arr))) {
-    cerr << "could not read " << NUMBERS_JSON << " as an array" << endl;
-    return;
-  }
-  for (simdjson_unused auto _ : state) {
-    std::vector<double> container;
-    for (auto e : arr) {
-      dom::element_type actual_type = e.type();
-      if(actual_type != dom::element_type::DOUBLE) {
-        cerr << "found a node that is not an number?" << endl; break;
-      }
-      double x;
-      error = e.get(x);
-      container.push_back(x);
-    }
-    benchmark::DoNotOptimize(container.data());
-    benchmark::ClobberMemory();
-  }
-}
-BENCHMARK(numbers_type_scan);
-
-static void numbers_type_size_scan(State& state) {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-  dom::array arr;
-  simdjson::error_code error;
-  if ((error = parser.load(NUMBERS_JSON).get(arr))) {
-    cerr << "could not read " << NUMBERS_JSON << " as an array: " << error << endl;
-    return;
-  }
-  for (simdjson_unused auto _ : state) {
-    std::vector<double> container;
-    container.resize(arr.size());
-    size_t pos = 0;
-    for (auto e : arr) {
-      dom::element_type actual_type = e.type();
-      if(actual_type != dom::element_type::DOUBLE) {
-        cerr << "found a node that is not an number?" << endl; break;
-      }
-      double x;
-      error = e.get(x);
-      container[pos++] = x;
-    }
-    if(pos != container.size()) { cerr << "bad count" << endl; }
-    benchmark::DoNotOptimize(container.data());
-    benchmark::ClobberMemory();
-  }
-}
-BENCHMARK(numbers_type_size_scan);
-
-static void numbers_load_scan(State& state) {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-  dom::array arr;
-  simdjson::error_code error;
-  for (simdjson_unused auto _ : state) {
-    // this may hit the disk, but probably just once
-    if ((error = parser.load(NUMBERS_JSON).get(arr))) {
-      cerr << "could not read " << NUMBERS_JSON << " as an array: " << error << endl;
-      break;
-    }
-    std::vector<double> container;
-    for (auto e : arr) {
-      double x;
-      if ((error = e.get(x))) { cerr << "found a node that is not an number: " << error << endl; break;}
-      container.push_back(x);
-    }
-    benchmark::DoNotOptimize(container.data());
-    benchmark::ClobberMemory();
-  }  
-}
-BENCHMARK(numbers_load_scan);
-
-static void numbers_load_size_scan(State& state) {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-  dom::array arr;
-  simdjson::error_code error;
-  for (simdjson_unused auto _ : state) {
-    // this may hit the disk, but probably just once
-    if ((error = parser.load(NUMBERS_JSON).get(arr))) {
-      cerr << "could not read " << NUMBERS_JSON << " as an array" << endl;
-      break;
-    }
-    std::vector<double> container;
-    container.resize(arr.size());
-    size_t pos = 0;
-    for (auto e : arr) {
-      double x;
-      if ((error = e.get(x))) { cerr << "found a node that is not an number?" << endl; break;}
-      container[pos++] = x;
-    }
-    if(pos != container.size()) { cerr << "bad count" << endl; }
-    benchmark::DoNotOptimize(container.data());
-    benchmark::ClobberMemory();
-  }  
-}
-BENCHMARK(numbers_load_size_scan);
-
-
-#if SIMDJSON_EXCEPTIONS
-
-
-static void numbers_exceptions_scan(State& state) {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-  dom::array arr = parser.load(NUMBERS_JSON);
-  for (simdjson_unused auto _ : state) {
-    std::vector<double> container;
-    for (double x : arr) {
-      container.push_back(x);
-    }
-    benchmark::DoNotOptimize(container.data());
-    benchmark::ClobberMemory();
-  }  
-}
-BENCHMARK(numbers_exceptions_scan);
-
-static void numbers_exceptions_size_scan(State& state) {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-  dom::array arr = parser.load(NUMBERS_JSON);
-  for (simdjson_unused auto _ : state) {
-    std::vector<double> container;
-    container.resize(arr.size());
-    size_t pos = 0;
-    for (auto e : arr) {
-      container[pos++] = double(e);
-    }
-    if(pos != container.size()) { cerr << "bad count" << endl; }
-    benchmark::DoNotOptimize(container.data());
-    benchmark::ClobberMemory();
-  }  
-}
-BENCHMARK(numbers_exceptions_size_scan);
-
-
-
-static void numbers_type_exceptions_scan(State& state) {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-  dom::array arr = parser.load(NUMBERS_JSON);
-  for (simdjson_unused auto _ : state) {
-    std::vector<double> container;
-    for (auto e : arr) {
-      dom::element_type actual_type = e.type();
-      if(actual_type != dom::element_type::DOUBLE) {
-        cerr << "found a node that is not an number?" << endl; break;
-      }
-      container.push_back(double(e));
-    }
-    benchmark::DoNotOptimize(container.data());
-    benchmark::ClobberMemory();
-  }
-}
-BENCHMARK(numbers_type_exceptions_scan);
-
-static void numbers_type_exceptions_size_scan(State& state) {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-  dom::array arr = parser.load(NUMBERS_JSON);
-  for (simdjson_unused auto _ : state) {
-    std::vector<double> container;
-    container.resize(arr.size());
-    size_t pos = 0;
-    for (auto e : arr) {
-      dom::element_type actual_type = e.type();
-      if(actual_type != dom::element_type::DOUBLE) {
-        cerr << "found a node that is not an number?" << endl; break;
-      }
-      container[pos++] = double(e);
-    }
-    if(pos != container.size()) { cerr << "bad count" << endl; }
-    benchmark::DoNotOptimize(container.data());
-    benchmark::ClobberMemory();
-  }
-}
-BENCHMARK(numbers_type_exceptions_size_scan);
-
-static void numbers_exceptions_load_scan(State& state) {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-  for (simdjson_unused auto _ : state) {
-    // this may hit the disk, but probably just once
-    dom::array arr = parser.load(NUMBERS_JSON);
-    std::vector<double> container;
-    for (double x : arr) {
-      container.push_back(x);
-    }
-    benchmark::DoNotOptimize(container.data());
-    benchmark::ClobberMemory();
-  }  
-}
-BENCHMARK(numbers_exceptions_load_scan);
-
-static void numbers_exceptions_load_size_scan(State& state) {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-  for (simdjson_unused auto _ : state) {
-    // this may hit the disk, but probably just once
-    dom::array arr = parser.load(NUMBERS_JSON);
-    std::vector<double> container;
-    container.resize(arr.size());
-    size_t pos = 0;
-    for (double x : arr) {
-      container[pos++] = x;
-    }
-    if(pos != container.size()) { cerr << "bad count" << endl; }
-    benchmark::DoNotOptimize(container.data());
-    benchmark::ClobberMemory();
-  }  
-}
-BENCHMARK(numbers_exceptions_load_size_scan);
-
-
-static void twitter_count(State& state) {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-  dom::element doc = parser.load(TWITTER_JSON);
-  for (simdjson_unused auto _ : state) {
-    uint64_t result_count = doc["search_metadata"]["count"];
-    if (result_count != 100) { return; }
-  }
-}
-BENCHMARK(twitter_count);
-
-SIMDJSON_PUSH_DISABLE_WARNINGS
-SIMDJSON_DISABLE_DEPRECATED_WARNING
-static void iterator_twitter_count(State& state) {
-  // Prints the number of results in twitter.json
-  padded_string json = padded_string::load(TWITTER_JSON);
-  ParsedJson pj = build_parsed_json(json);
-  for (simdjson_unused auto _ : state) {
-    ParsedJson::Iterator iter(pj);
-    // uint64_t result_count = doc["search_metadata"]["count"];
-    if (!iter.move_to_key("search_metadata")) { return; }
-    if (!iter.move_to_key("count")) { return; }
-    if (!iter.is_integer()) { return; }
-    int64_t result_count = iter.get_integer();
-
-    if (result_count != 100) { return; }
-  }
-}
-BENCHMARK(iterator_twitter_count);
-SIMDJSON_POP_DISABLE_WARNINGS
-
-static void twitter_default_profile(State& state) {
-  // Count unique users with a default profile.
-  dom::parser parser;
-  dom::element doc = parser.load(TWITTER_JSON);
-  for (simdjson_unused auto _ : state) {
-    set<string_view> default_users;
-    for (dom::object tweet : doc["statuses"]) {
-      dom::object user = tweet["user"];
-      if (user["default_profile"]) {
-        default_users.insert(user["screen_name"]);
-      }
-    }
-    if (default_users.size() != 86) { return; }
-  }
-}
-BENCHMARK(twitter_default_profile);
-
-static void twitter_image_sizes(State& state) {
-  // Count unique image sizes
-  dom::parser parser;
-  dom::element doc = parser.load(TWITTER_JSON);
-  simdjson::error_code error;
-  for (simdjson_unused auto _ : state) {
-    set<tuple<uint64_t, uint64_t>> image_sizes;
-    for (dom::object tweet : doc["statuses"]) {
-      dom::array media;
-      if (not (error = tweet["entities"]["media"].get(media))) {
-        for (dom::object image : media) {
-          for (auto size : image["sizes"].get<dom::object>()) {
-            image_sizes.insert({ size.value["w"], size.value["h"] });
-          }
-        }
-      }
-    }
-    if (image_sizes.size() != 15) { return; };
-  }
-}
-BENCHMARK(twitter_image_sizes);
-
-#endif // SIMDJSON_EXCEPTIONS
-
-static void error_code_twitter_count(State& state) noexcept {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-  simdjson::error_code error;
-  dom::element doc;
-  if ((error = parser.load(TWITTER_JSON).get(doc))) { return; }
-  for (simdjson_unused auto _ : state) {
-    uint64_t value;
-    if ((error = doc["search_metadata"]["count"].get(value))) { return; }
-    if (value != 100) { return; }
-  }
-}
-BENCHMARK(error_code_twitter_count);
-
-static void error_code_twitter_default_profile(State& state) noexcept {
-  // Count unique users with a default profile.
-  dom::parser parser;
-  simdjson::error_code error;
-  dom::element doc;
-  if ((error = parser.load(TWITTER_JSON).get(doc))) { std::cerr << error << std::endl; return; }
-  for (simdjson_unused auto _ : state) {
-    set<string_view> default_users;
-
-    dom::array tweets;
-    if ((error = doc["statuses"].get(tweets))) { return; }
-    for (dom::element tweet : tweets) {
-      dom::object user;
-      if ((error = tweet["user"].get(user))) { return; }
-      bool default_profile;
-      if ((error = user["default_profile"].get(default_profile))) { return; }
-      if (default_profile) {
-        std::string_view screen_name;
-        if ((error = user["screen_name"].get(screen_name))) { return; }
-        default_users.insert(screen_name);
-      }
-    }
-
-    if (default_users.size() != 86) { return; }
-  }
-}
-BENCHMARK(error_code_twitter_default_profile);
-
-SIMDJSON_PUSH_DISABLE_WARNINGS
-SIMDJSON_DISABLE_DEPRECATED_WARNING
-static void iterator_twitter_default_profile(State& state) {
-  // Count unique users with a default profile.
-  padded_string json;
-  auto error = padded_string::load(TWITTER_JSON).get(json);
-  if (error) { std::cerr << error << std::endl; return; }
-  ParsedJson pj = build_parsed_json(json);
-  for (simdjson_unused auto _ : state) {
-    set<string_view> default_users;
-    ParsedJson::Iterator iter(pj);
-
-    // for (dom::object tweet : doc["statuses"]) {
-    if (!(iter.move_to_key("statuses") && iter.is_array())) { return; }
-    if (iter.down()) { // first status
-      do {
-
-        // dom::object user = tweet["user"];
-        if (!(iter.move_to_key("user") && iter.is_object())) { return; }
-
-        // if (user["default_profile"]) {
-        if (iter.move_to_key("default_profile")) {
-          if (iter.is_true()) {
-            if (!iter.up()) { return; } // back to user
-
-            // default_users.insert(user["screen_name"]);
-            if (!(iter.move_to_key("screen_name") && iter.is_string())) { return; }
-            default_users.insert(string_view(iter.get_string(), iter.get_string_length()));
-          }
-          if (!iter.up()) { return; } // back to user
-        }
-
-        if (!iter.up()) { return; } // back to status
-
-      } while (iter.next()); // next status
-    }
-
-    if (default_users.size() != 86) { return; }
-  }
-}
-SIMDJSON_POP_DISABLE_WARNINGS
-BENCHMARK(iterator_twitter_default_profile);
-
-static void error_code_twitter_image_sizes(State& state) noexcept {
-  // Count unique image sizes
-  dom::parser parser;
-  simdjson::error_code error;
-  dom::element doc;
-  if ((error = parser.load(TWITTER_JSON).get(doc))) { std::cerr << error << std::endl; return; }
-  for (simdjson_unused auto _ : state) {
-    set<tuple<uint64_t, uint64_t>> image_sizes;
-    dom::array statuses;
-    if ((error = doc["statuses"].get(statuses))) { return; }
-    for (dom::element tweet : statuses) {
-      dom::array images;
-      if (not (error = tweet["entities"]["media"].get(images))) {
-        for (dom::element image : images) {
-          dom::object sizes;
-          if ((error = image["sizes"].get(sizes))) { return; }
-          for (auto size : sizes) {
-            uint64_t width, height;
-            if ((error = size.value["w"].get(width))) { return; }
-            if ((error = size.value["h"].get(height))) { return; }
-            image_sizes.insert({ width, height });
-          }
-        }
-      }
-    }
-    if (image_sizes.size() != 15) { return; };
-  }
-}
-BENCHMARK(error_code_twitter_image_sizes);
-
-SIMDJSON_PUSH_DISABLE_WARNINGS
-SIMDJSON_DISABLE_DEPRECATED_WARNING
-static void iterator_twitter_image_sizes(State& state) {
-  // Count unique image sizes
-  padded_string json;
-  auto error = padded_string::load(TWITTER_JSON).get(json);
-  if (error) { std::cerr << error << std::endl; return; }
-  ParsedJson pj = build_parsed_json(json);
-  for (simdjson_unused auto _ : state) {
-    set<tuple<uint64_t, uint64_t>> image_sizes;
-    ParsedJson::Iterator iter(pj);
-
-    // for (dom::object tweet : doc["statuses"]) {
-    if (!(iter.move_to_key("statuses") && iter.is_array())) { return; }
-    if (iter.down()) { // first status
-      do {
-
-        // dom::object media;
-        // not_found = tweet["entities"]["media"].get(media);
-        // if (!not_found) {
-        if (iter.move_to_key("entities")) {
-          if (!iter.is_object()) { return; }
-          if (iter.move_to_key("media")) {
-            if (!iter.is_array()) { return; }
-
-            //   for (dom::object image : media) {
-            if (iter.down()) { // first media
-              do {
-
-                // for (auto [key, size] : dom::object(image["sizes"])) {
-                if (!(iter.move_to_key("sizes") && iter.is_object())) { return; }
-                if (iter.down()) { // first size
-                  do {
-                    iter.move_to_value();
-
-                    // image_sizes.insert({ size["w"], size["h"] });
-                    if (!(iter.move_to_key("w")) && !iter.is_integer()) { return; }
-                    uint64_t width = iter.get_integer();
-                    if (!iter.up()) { return; } // back to size
-                    if (!(iter.move_to_key("h")) && !iter.is_integer()) { return; }
-                    uint64_t height = iter.get_integer();
-                    if (!iter.up()) { return; } // back to size
-                    image_sizes.insert({ width, height });
-
-                  } while (iter.next()); // next size
-                  if (!iter.up()) { return; } // back to sizes
-                }
-                if (!iter.up()) { return; } // back to image
-              } while (iter.next()); // next image
-              if (!iter.up()) { return; } // back to media
-            }
-            if (!iter.up()) { return; } // back to entities
-          }
-          if (!iter.up()) { return; } // back to status
-        } 
-      } while (iter.next()); // next status
-    }
-
-    if (image_sizes.size() != 15) { return; };
-  }
-}
-BENCHMARK(iterator_twitter_image_sizes);
-
-static void print_json(State& state) noexcept {
-  // Prints the number of results in twitter.json
-  dom::parser parser;
-
-  padded_string json;
-  auto error = padded_string::load(TWITTER_JSON).get(json);
-  if (error) { std::cerr << error << std::endl; return; }
-
-  int code = json_parse(json, parser);
-  if (code) { cerr << error_message(code) << endl; return; }
-  for (simdjson_unused auto _ : state) {
-    std::stringstream s;
-    if (!parser.print_json(s)) { cerr << "print_json failed" << endl; return; }
-  }
-}
-BENCHMARK(print_json);
-SIMDJSON_POP_DISABLE_WARNINGS
-
-BENCHMARK_MAIN();

benchmark/bench_ondemand.cpp

@@ -1,26 +0,0 @@
-#include "simdjson.h"
-#include <iostream>
-#include <sstream>
-#include <random>
-#include <vector>
-SIMDJSON_PUSH_DISABLE_ALL_WARNINGS
-#include <benchmark/benchmark.h>
-SIMDJSON_POP_DISABLE_WARNINGS
-
-#include "partial_tweets/ondemand.h"
-#include "partial_tweets/iter.h"
-#include "partial_tweets/dom.h"
-
-#include "largerandom/ondemand.h"
-#include "largerandom/iter.h"
-#include "largerandom/dom.h"
-
-#include "kostya/ondemand.h"
-#include "kostya/iter.h"
-#include "kostya/dom.h"
-
-#include "distinctuserid/ondemand.h"
-#include "distinctuserid/dom.h"
-
-
-BENCHMARK_MAIN();

benchmark/bench_parse_call.cpp

@@ -1,191 +0,0 @@
-#include <benchmark/benchmark.h>
-#include "simdjson.h"
-using namespace simdjson;
-using namespace benchmark;
-using namespace std;
-
-const padded_string EMPTY_ARRAY("[]", 2);
-const char *TWITTER_JSON = SIMDJSON_BENCHMARK_DATA_DIR "twitter.json";
-const char *GSOC_JSON = SIMDJSON_BENCHMARK_DATA_DIR "gsoc-2018.json";
-
-
-
-static void unicode_validate_twitter(State& state) {
-  dom::parser parser;
-  padded_string docdata;
-  auto error = padded_string::load(TWITTER_JSON).get(docdata);
-  if(error) {
-      cerr << "could not parse twitter.json" << error << endl;
-      return;
-  }
-  // we do not want mem. alloc. in the loop.
-  error = parser.allocate(docdata.size());
-  if(error) {
-      cout << error << endl;
-      return;
-  }
-  size_t bytes = 0;
-  for (simdjson_unused auto _ : state) {
-    bool is_ok = simdjson::validate_utf8(docdata.data(), docdata.size());
-    bytes += docdata.size();
-    benchmark::DoNotOptimize(is_ok);
-  }
-  // Gigabyte: https://en.wikipedia.org/wiki/Gigabyte
-  state.counters["Gigabytes"] = benchmark::Counter(
-	        double(bytes), benchmark::Counter::kIsRate,
-	        benchmark::Counter::OneK::kIs1000); // For GiB : kIs1024
-  state.counters["docs"] = Counter(double(state.iterations()), benchmark::Counter::kIsRate);
-}
-BENCHMARK(unicode_validate_twitter)->Repetitions(10)->ComputeStatistics("max", [](const std::vector<double>& v) -> double {
-    return *(std::max_element(std::begin(v), std::end(v)));
-  })->DisplayAggregatesOnly(true);
-
-static void parse_twitter(State& state) {
-  dom::parser parser;
-  padded_string docdata;
-  auto error = padded_string::load(TWITTER_JSON).get(docdata);
-  if(error) {
-      cerr << "could not parse twitter.json" << error << endl;
-      return;
-  }
-  // we do not want mem. alloc. in the loop.
-  error = parser.allocate(docdata.size());
-  if(error) {
-      cout << error << endl;
-      return;
-  }
-  size_t bytes = 0;
-  for (simdjson_unused auto _ : state) {
-    dom::element doc;
-    bytes += docdata.size();
-    if ((error = parser.parse(docdata).get(doc))) {
-      cerr << "could not parse twitter.json" << error << endl;
-      return;
-    }
-    benchmark::DoNotOptimize(doc);
-  }
-  // Gigabyte: https://en.wikipedia.org/wiki/Gigabyte
-  state.counters["Gigabytes"] = benchmark::Counter(
-	        double(bytes), benchmark::Counter::kIsRate,
-	        benchmark::Counter::OneK::kIs1000); // For GiB : kIs1024
-  state.counters["docs"] = Counter(double(state.iterations()), benchmark::Counter::kIsRate);
-}
-BENCHMARK(parse_twitter)->Repetitions(10)->ComputeStatistics("max", [](const std::vector<double>& v) -> double {
-    return *(std::max_element(std::begin(v), std::end(v)));
-  })->DisplayAggregatesOnly(true);
-
-
-static void parse_gsoc(State& state) {
-  dom::parser parser;
-  padded_string docdata;
-  auto error = padded_string::load(GSOC_JSON).get(docdata);
-  if(error) {
-      cerr << "could not parse gsoc-2018.json" << error << endl;
-      return;
-  }
-  // we do not want mem. alloc. in the loop.
-  error = parser.allocate(docdata.size());
-  if(error) {
-      cout << error << endl;
-      return;
-  }
-  size_t bytes = 0;
-  for (simdjson_unused auto _ : state) {
-    bytes += docdata.size();
-    dom::element doc;
-    if ((error = parser.parse(docdata).get(doc))) {
-      cerr << "could not parse gsoc-2018.json" << error << endl;
-      return;
-    }
-    benchmark::DoNotOptimize(doc);
-  }
-  // Gigabyte: https://en.wikipedia.org/wiki/Gigabyte
-  state.counters["Gigabytes"] = benchmark::Counter(
-	        double(bytes), benchmark::Counter::kIsRate,
-	        benchmark::Counter::OneK::kIs1000); // For GiB : kIs1024
-  state.counters["docs"] = Counter(double(state.iterations()), benchmark::Counter::kIsRate);
-}
-BENCHMARK(parse_gsoc)->Repetitions(10)->ComputeStatistics("max", [](const std::vector<double>& v) -> double {
-    return *(std::max_element(std::begin(v), std::end(v)));
-  })->DisplayAggregatesOnly(true);
-
-
-
-SIMDJSON_PUSH_DISABLE_WARNINGS
-SIMDJSON_DISABLE_DEPRECATED_WARNING
-static void json_parse(State& state) {
-  ParsedJson pj;
-  if (!pj.allocate_capacity(EMPTY_ARRAY.length())) { return; }
-  for (simdjson_unused auto _ : state) {
-    auto error = json_parse(EMPTY_ARRAY, pj);
-    if (error) { return; }
-  }
-}
-SIMDJSON_POP_DISABLE_WARNINGS
-BENCHMARK(json_parse);
-static void parser_parse_error_code(State& state) {
-  dom::parser parser;
-  if (parser.allocate(EMPTY_ARRAY.length())) { return; }
-  for (simdjson_unused auto _ : state) {
-    auto error = parser.parse(EMPTY_ARRAY).error();
-    if (error) { return; }
-  }
-}
-BENCHMARK(parser_parse_error_code);
-
-#if SIMDJSON_EXCEPTIONS
-
-static void parser_parse_exception(State& state) {
-  dom::parser parser;
-  if (parser.allocate(EMPTY_ARRAY.length())) { return; }
-  for (simdjson_unused auto _ : state) {
-    try {
-      simdjson_unused dom::element doc = parser.parse(EMPTY_ARRAY);
-    } catch(simdjson_error &j) {
-      cout << j.what() << endl;
-      return;
-    }
-  }
-}
-BENCHMARK(parser_parse_exception);
-
-#endif // SIMDJSON_EXCEPTIONS
-
-SIMDJSON_PUSH_DISABLE_WARNINGS
-SIMDJSON_DISABLE_DEPRECATED_WARNING
-static void build_parsed_json(State& state) {
-  for (simdjson_unused auto _ : state) {
-    dom::parser parser = simdjson::build_parsed_json(EMPTY_ARRAY);
-    if (!parser.valid) { return; }
-  }
-}
-SIMDJSON_POP_DISABLE_WARNINGS
-
-BENCHMARK(build_parsed_json);
-static void document_parse_error_code(State& state) {
-  for (simdjson_unused auto _ : state) {
-    dom::parser parser;
-    auto error = parser.parse(EMPTY_ARRAY).error();
-    if (error) { return; }
-  }
-}
-BENCHMARK(document_parse_error_code);
-
-#if SIMDJSON_EXCEPTIONS
-
-static void document_parse_exception(State& state) {
-  for (simdjson_unused auto _ : state) {
-    try {
-      dom::parser parser;
-      simdjson_unused dom::element doc = parser.parse(EMPTY_ARRAY);
-    } catch(simdjson_error &j) {
-      cout << j.what() << endl;
-      return;
-    }
-  }
-}
-BENCHMARK(document_parse_exception);
-
-#endif // SIMDJSON_EXCEPTIONS
-
-BENCHMARK_MAIN();

benchmark/bench_sax.cpp

@@ -1,14 +0,0 @@
-#include "simdjson.h"
-#include "simdjson.cpp"
-#include <iostream>
-#include <sstream>
-#include <random>
-#include <vector>
-SIMDJSON_PUSH_DISABLE_ALL_WARNINGS
-#include <benchmark/benchmark.h>
-SIMDJSON_POP_DISABLE_WARNINGS
-
-#include "partial_tweets/sax.h"
-#include "largerandom/sax.h"
-
-BENCHMARK_MAIN();

benchmark/benchfeatures.cpp

@@ -1,472 +0,0 @@
-#include "event_counter.h"
-
-#include <cassert>
-#include <cctype>
-#ifndef _MSC_VER
-#include <dirent.h>
-#endif
-#include <unistd.h>
-#include <cinttypes>
-#include <initializer_list>
-
-#include <cstdio>
-#include <cstdlib>
-#include <cstring>
-
-#include <algorithm>
-#include <chrono>
-#include <cstring>
-#include <fstream>
-#include <iomanip>
-#include <iostream>
-#include <map>
-#include <set>
-#include <sstream>
-#include <string>
-#include <vector>
-
-#include "linux-perf-events.h"
-#ifdef __linux__
-#include <libgen.h>
-#endif
-
-#include "simdjson.h"
-
-#include <functional>
-
-#include "benchmarker.h"
-
-using namespace simdjson;
-using std::cerr;
-using std::cout;
-using std::endl;
-using std::string;
-using std::to_string;
-using std::vector;
-using std::ostream;
-using std::ofstream;
-using std::exception;
-
-// Stash the exe_name in main() for functions to use
-char* exe_name;
-
-void print_usage(ostream& out) {
-  out << "Usage: " << exe_name << " [-v] [-n #] [-s STAGE] [-a ARCH]" << endl;
-  out << endl;
-  out << "Runs the parser against jsonexamples/generated json files in a loop, measuring speed and other statistics." << endl;
-  out << endl;
-  out << "Options:" << endl;
-  out << endl;
-  out << "-n #       - Number of iterations per file. Default: 400" << endl;
-  out << "-i #       - Number of times to iterate a single file before moving to the next. Default: 20" << endl;
-  out << "-v         - Verbose output." << endl;
-  out << "-s STAGE   - Stop after the given stage." << endl;
-  out << "             -s stage1 - Stop after find_structural_bits." << endl;
-  out << "             -s all    - Run all stages." << endl;
-  out << "-a ARCH    - Use the parser with the designated architecture (HASWELL, WESTMERE" << endl;
-  out << "             or ARM64). By default, detects best supported architecture." << endl;
-}
-
-void exit_usage(string message) {
-  cerr << message << endl;
-  cerr << endl;
-  print_usage(cerr);
-  exit(EXIT_FAILURE);
-}
-
-struct option_struct {
-  bool stage1_only = false;
-
-  int32_t iterations = 400;
-  int32_t iteration_step = 50;
-
-  bool verbose = false;
-
-  option_struct(int argc, char **argv) {
-    int c;
-
-    while ((c = getopt(argc, argv, "vtn:i:a:s:")) != -1) {
-      switch (c) {
-      case 'n':
-        iterations = atoi(optarg);
-        break;
-      case 'i':
-        iteration_step = atoi(optarg);
-        break;
-      case 'v':
-        verbose = true;
-        break;
-      case 'a': {
-          auto impl = simdjson::available_implementations[optarg];
-          if(impl && impl->supported_by_runtime_system()) {
-            simdjson::active_implementation = impl; 
-          } else { 
-            std::cerr << "implementation " << optarg << " not found or not supported " << std::endl;
-          }
-        } 
-        break;
-      case 's':
-        if (!strcmp(optarg, "stage1")) {
-          stage1_only = true;
-        } else if (!strcmp(optarg, "all")) {
-          stage1_only = false;
-        } else {
-          exit_usage(string("Unsupported option value -s ") + optarg + ": expected -s stage1 or all");
-        }
-        break;
-      default:
-        exit_error(string("Unexpected argument ") + std::string(1,static_cast<char>(c)));
-      }
-    }
-  }
-
-  template<typename F>
-  void each_stage(const F& f) const {
-    f(BenchmarkStage::STAGE1);
-    if (!this->stage1_only) {
-      f(BenchmarkStage::STAGE2);
-      f(BenchmarkStage::ALL);
-    }
-  }
-
-};
-
-struct feature_benchmarker {
-  benchmarker utf8;
-  benchmarker utf8_miss;
-  benchmarker escape;
-  benchmarker escape_miss;
-  benchmarker empty;
-  benchmarker empty_miss;
-  benchmarker struct7;
-  benchmarker struct7_miss;
-  benchmarker struct7_full;
-  benchmarker struct15;
-  benchmarker struct15_miss;
-  benchmarker struct23;
-  benchmarker struct23_miss;
-
-  feature_benchmarker(event_collector& collector) :
-    utf8               (SIMDJSON_BENCHMARK_DATA_DIR "generated/utf-8.json", collector),
-    utf8_miss          (SIMDJSON_BENCHMARK_DATA_DIR "generated/utf-8-miss.json", collector),
-    escape               (SIMDJSON_BENCHMARK_DATA_DIR "generated/escape.json", collector),
-    escape_miss          (SIMDJSON_BENCHMARK_DATA_DIR "generated/escape-miss.json", collector),
-    empty              (SIMDJSON_BENCHMARK_DATA_DIR "generated/0-structurals.json", collector),
-    empty_miss         (SIMDJSON_BENCHMARK_DATA_DIR "generated/0-structurals-miss.json", collector),
-    struct7           (SIMDJSON_BENCHMARK_DATA_DIR "generated/7-structurals.json", collector),
-    struct7_miss      (SIMDJSON_BENCHMARK_DATA_DIR "generated/7-structurals-miss.json", collector),
-    struct7_full       (SIMDJSON_BENCHMARK_DATA_DIR "generated/7-structurals-full.json", collector),
-    struct15     (SIMDJSON_BENCHMARK_DATA_DIR "generated/15-structurals.json", collector),
-    struct15_miss(SIMDJSON_BENCHMARK_DATA_DIR "generated/15-structurals-miss.json", collector),
-    struct23     (SIMDJSON_BENCHMARK_DATA_DIR "generated/23-structurals.json", collector),
-    struct23_miss(SIMDJSON_BENCHMARK_DATA_DIR "generated/23-structurals-miss.json", collector)
-  {
-
-  }
-
-  simdjson_really_inline void run_iterations(size_t iterations, bool stage1_only=false) {
-    struct7.run_iterations(iterations, stage1_only);
-    struct7_miss.run_iterations(iterations, stage1_only);
-    struct7_full.run_iterations(iterations, stage1_only);
-    utf8.run_iterations(iterations, stage1_only);
-    utf8_miss.run_iterations(iterations, stage1_only);
-    escape.run_iterations(iterations, stage1_only);
-    escape_miss.run_iterations(iterations, stage1_only);
-    empty.run_iterations(iterations, stage1_only);
-    empty_miss.run_iterations(iterations, stage1_only);
-    struct15.run_iterations(iterations, stage1_only);
-    struct15_miss.run_iterations(iterations, stage1_only);
-    struct23.run_iterations(iterations, stage1_only);
-    struct23_miss.run_iterations(iterations, stage1_only);
-  }
-
-  double cost_per_block(BenchmarkStage stage, const benchmarker& feature, size_t feature_blocks, const benchmarker& base) const {
-    return (feature[stage].best.elapsed_ns() - base[stage].best.elapsed_ns()) / double(feature_blocks);
-  }
-
-  // Whether we're recording cache miss and branch miss events
-  bool has_events() const {
-    return empty.collector.has_events();
-  }
-
-  // Base cost of any block (including empty ones)
-  double base_cost(BenchmarkStage stage) const {
-    return (empty[stage].best.elapsed_ns() / double(empty.stats->blocks));
-  }
-
-  // Extra cost of a 1-7 structural block over an empty block
-  double struct1_7_cost(BenchmarkStage stage) const {
-    return cost_per_block(stage, struct7, struct7.stats->blocks_with_1_structural, empty);
-  }
-  // Extra cost of an 1-7-structural miss
-  double struct1_7_miss_cost(BenchmarkStage stage) const {
-    return cost_per_block(stage, struct7_miss, struct7_miss.stats->blocks_with_1_structural, struct7);
-  }
-  // Rate of 1-7-structural misses per 8-structural flip
-  double struct1_7_miss_rate(BenchmarkStage stage) const {
-    if (!has_events()) { return 1; }
-    return struct7_miss[stage].best.branch_misses() - struct7[stage].best.branch_misses() / double(struct7_miss.stats->blocks_with_1_structural_flipped);
-  }
-
-  // Extra cost of an 8-15 structural block over a 1-7 structural block
-  double struct8_15_cost(BenchmarkStage stage) const {
-    return cost_per_block(stage, struct15, struct15.stats->blocks_with_8_structurals, struct7);
-  }
-  // Extra cost of an 8-15-structural miss over a 1-7 miss
-  double struct8_15_miss_cost(BenchmarkStage stage) const {
-    return cost_per_block(stage, struct15_miss, struct15_miss.stats->blocks_with_8_structurals_flipped, struct15);
-  }
-  // Rate of 8-15-structural misses per 8-structural flip
-  double struct8_15_miss_rate(BenchmarkStage stage) const {
-    if (!has_events()) { return 1; }
-    return double(struct15_miss[stage].best.branch_misses() - struct15[stage].best.branch_misses()) / double(struct15_miss.stats->blocks_with_8_structurals_flipped);
-  }
-
-  // Extra cost of a 16+-structural block over an 8-15 structural block (actual varies based on # of structurals!)
-  double struct16_cost(BenchmarkStage stage) const {
-    return cost_per_block(stage, struct23, struct23.stats->blocks_with_16_structurals, struct15);
-  }
-  // Extra cost of a 16-structural miss over an 8-15 miss
-  double struct16_miss_cost(BenchmarkStage stage) const {
-    return cost_per_block(stage, struct23_miss, struct23_miss.stats->blocks_with_16_structurals_flipped, struct23);
-  }
-  // Rate of 16-structural misses per 16-structural flip
-  double struct16_miss_rate(BenchmarkStage stage) const {
-    if (!has_events()) { return 1; }
-    return double(struct23_miss[stage].best.branch_misses() - struct23[stage].best.branch_misses()) / double(struct23_miss.stats->blocks_with_16_structurals_flipped);
-  }
-
-  // Extra cost of having UTF-8 in a block
-  double utf8_cost(BenchmarkStage stage) const {
-    return cost_per_block(stage, utf8, utf8.stats->blocks_with_utf8, struct7_full);
-  }
-  // Extra cost of a UTF-8 miss
-  double utf8_miss_cost(BenchmarkStage stage) const {
-    return cost_per_block(stage, utf8_miss, utf8_miss.stats->blocks_with_utf8_flipped, utf8);
-  }
-  // Rate of UTF-8 misses per UTF-8 flip
-  double utf8_miss_rate(BenchmarkStage stage) const {
-    if (!has_events()) { return 1; }
-    return double(utf8_miss[stage].best.branch_misses() - utf8[stage].best.branch_misses()) / double(utf8_miss.stats->blocks_with_utf8_flipped);
-  }
-
-  // Extra cost of having escapes in a block
-  double escape_cost(BenchmarkStage stage) const {
-    return cost_per_block(stage, escape, escape.stats->blocks_with_escapes, struct7_full);
-  }
-  // Extra cost of an escape miss
-  double escape_miss_cost(BenchmarkStage stage) const {
-    return cost_per_block(stage, escape_miss, escape_miss.stats->blocks_with_escapes_flipped, escape);
-  }
-  // Rate of escape misses per escape flip
-  double escape_miss_rate(BenchmarkStage stage) const {
-    if (!has_events()) { return 1; }
-    return double(escape_miss[stage].best.branch_misses() - escape[stage].best.branch_misses()) / double(escape_miss.stats->blocks_with_escapes_flipped);
-  }
-
-  double calc_expected_feature_cost(BenchmarkStage stage, const benchmarker& file) const {
-    // Expected base ns/block (empty)
-    json_stats& stats = *file.stats;
-    double expected = base_cost(stage)       * double(stats.blocks);
-    expected +=       struct1_7_cost(stage)  * double(stats.blocks_with_1_structural);
-    expected +=       utf8_cost(stage)       * double(stats.blocks_with_utf8);
-    expected +=       escape_cost(stage)     * double(stats.blocks_with_escapes);
-    expected +=       struct8_15_cost(stage) * double(stats.blocks_with_8_structurals);
-    expected +=       struct16_cost(stage)   * double(stats.blocks_with_16_structurals);
-    return expected / double(stats.blocks);
-  }
-
-  double calc_expected_miss_cost(BenchmarkStage stage, const benchmarker& file) const {
-    // Expected base ns/block (empty)
-    json_stats& stats = *file.stats;
-    double expected = struct1_7_miss_cost(stage)  * double(stats.blocks_with_1_structural_flipped) * struct1_7_miss_rate(stage);
-    expected +=       utf8_miss_cost(stage)       * double(stats.blocks_with_utf8_flipped) * utf8_miss_rate(stage);
-    expected +=       escape_miss_cost(stage)     * double(stats.blocks_with_escapes_flipped) * escape_miss_rate(stage);
-    expected +=       struct8_15_miss_cost(stage) * double(stats.blocks_with_8_structurals_flipped) * struct8_15_miss_rate(stage);
-    expected +=       struct16_miss_cost(stage)   * double(stats.blocks_with_16_structurals_flipped) * struct16_miss_rate(stage);
-    return expected / double(stats.blocks);
-  }
-
-  double calc_expected_misses(BenchmarkStage stage, const benchmarker& file) const {
-    json_stats& stats = *file.stats;
-    double expected = double(stats.blocks_with_1_structural_flipped)   * struct1_7_miss_rate(stage);
-    expected +=       double(stats.blocks_with_utf8_flipped)           * utf8_miss_rate(stage);
-    expected +=       double(stats.blocks_with_escapes_flipped)        * escape_miss_rate(stage);
-    expected +=       double(stats.blocks_with_8_structurals_flipped)  * struct8_15_miss_rate(stage);
-    expected +=       double(stats.blocks_with_16_structurals_flipped) * struct16_miss_rate(stage);
-    return expected;
-  }
-
-  double calc_expected(BenchmarkStage stage, const benchmarker& file) const {
-    return calc_expected_feature_cost(stage, file) + calc_expected_miss_cost(stage, file);
-  }
-
-  void print(const option_struct& options) const {
-    printf("\n");
-    printf("Features in ns/block (64 bytes):\n");
-    printf("\n");
-    printf("| %-8s ",   "Stage");
-    printf("| %8s ",  "Base");
-    printf("| %8s ",  "7 Struct");
-    printf("| %8s ",  "UTF-8");
-    printf("| %8s ",  "Escape");
-    printf("| %8s ",  "15 Str.");
-    printf("| %8s ",  "16+ Str.");
-    printf("| %15s ", "7 Struct Miss");
-    printf("| %15s ", "UTF-8 Miss");
-    printf("| %15s ", "Escape Miss");
-    printf("| %15s ", "15 Str. Miss");
-    printf("| %15s ", "16+ Str. Miss");
-    printf("|\n");
-
-    printf("|%.10s",  "---------------------------------------");
-    printf("|%.10s",  "---------------------------------------");
-    printf("|%.10s",  "---------------------------------------");
-    printf("|%.10s",  "---------------------------------------");
-    printf("|%.10s",  "---------------------------------------");
-    printf("|%.10s",  "---------------------------------------");
-    printf("|%.10s",  "---------------------------------------");
-    printf("|%.17s", "---------------------------------------");
-    printf("|%.17s", "---------------------------------------");
-    printf("|%.17s", "---------------------------------------");
-    printf("|%.17s", "---------------------------------------");
-    printf("|%.17s", "---------------------------------------");
-    printf("|\n");
-
-    options.each_stage([&](auto stage) {
-      printf("| %-8s ",         benchmark_stage_name(stage));
-      printf("| %8.3g ",        base_cost(stage));
-      printf("| %8.3g ",        struct1_7_cost(stage));
-      printf("| %8.3g ",        utf8_cost(stage));
-      printf("| %8.3g ",        escape_cost(stage));
-      printf("| %8.3g ",        struct8_15_cost(stage));
-      printf("| %8.3g ",        struct16_cost(stage));
-      if (has_events()) {
-        printf("| %8.3g (%3d%%) ", struct1_7_miss_cost(stage), int(struct1_7_miss_rate(stage)*100));
-        printf("| %8.3g (%3d%%) ", utf8_miss_cost(stage), int(utf8_miss_rate(stage)*100));
-        printf("| %8.3g (%3d%%) ", escape_miss_cost(stage), int(escape_miss_rate(stage)*100));
-        printf("| %8.3g (%3d%%) ", struct8_15_miss_cost(stage), int(struct8_15_miss_rate(stage)*100));
-        printf("| %8.3g (%3d%%) ", struct16_miss_cost(stage), int(struct16_miss_rate(stage)*100));
-      } else {
-        printf("|        %8.3g ", struct1_7_miss_cost(stage));
-        printf("|        %8.3g ", utf8_miss_cost(stage));
-        printf("|        %8.3g ", escape_miss_cost(stage));
-        printf("|        %8.3g ", struct8_15_miss_cost(stage));
-        printf("|        %8.3g ", struct16_miss_cost(stage));
-      }
-      printf("|\n");
-    });
-  }
-};
-
-void print_file_effectiveness(BenchmarkStage stage, const char* filename, const benchmarker& results, const feature_benchmarker& features) {
-  double actual = results[stage].best.elapsed_ns() / double(results.stats->blocks);
-  double calc = features.calc_expected(stage, results);
-  double actual_misses = results[stage].best.branch_misses();
-  double calc_misses = features.calc_expected_misses(stage, results);
-  double calc_miss_cost = features.calc_expected_miss_cost(stage, results);
-  printf("        | %-8s ", benchmark_stage_name(stage));
-  printf("| %-15s ",   filename);
-  printf("|    %8.3g ", features.calc_expected_feature_cost(stage, results));
-  printf("|    %8.3g ", calc_miss_cost);
-  printf("| %8.3g ",  calc);
-  printf("| %8.3g ",  actual);
-  printf("| %+8.3g ", actual - calc);
-  printf("| %13llu ", (long long unsigned)(calc_misses));
-  if (features.has_events()) {
-    printf("| %13llu ", (long long unsigned)(actual_misses));
-    printf("| %+13lld ", (long long int)(actual_misses - calc_misses));
-    double miss_adjustment = calc_miss_cost * (double(int64_t(actual_misses - calc_misses)) / calc_misses);
-    printf("|      %8.3g ", calc_miss_cost + miss_adjustment);
-    printf("|      %+8.3g ", actual - (calc + miss_adjustment));
-  }
-  printf("|\n");
-}
-
-int main(int argc, char *argv[]) {
-  // Read options
-  exe_name = argv[0];
-  option_struct options(argc, argv);
-  if (options.verbose) {
-    verbose_stream = &cout;
-  }
-
-  // Initialize the event collector. We put this early so if it prints an error message, it's the
-  // first thing printed.
-  event_collector collector;
-
-  // Set up benchmarkers by reading all files
-  feature_benchmarker features(collector);
-  benchmarker gsoc_2018(SIMDJSON_BENCHMARK_DATA_DIR "gsoc-2018.json", collector);
-  benchmarker twitter(SIMDJSON_BENCHMARK_DATA_DIR "twitter.json", collector);
-  benchmarker random(SIMDJSON_BENCHMARK_DATA_DIR "random.json", collector);
-
-  // Run the benchmarks
-  progress_bar progress(options.iterations, 100);
-  // Put the if (options.stage1_only) *outside* the loop so that run_iterations will be optimized
-  if (options.stage1_only) {
-    for (int iteration = 0; iteration < options.iterations; iteration += options.iteration_step) {
-      if (!options.verbose) { progress.print(iteration); }
-      features.run_iterations(options.iteration_step, true);
-      gsoc_2018.run_iterations(options.iteration_step, true);
-      twitter.run_iterations(options.iteration_step, true);
-      random.run_iterations(options.iteration_step, true);
-    }
-  } else {
-    for (int iteration = 0; iteration < options.iterations; iteration += options.iteration_step) {
-      if (!options.verbose) { progress.print(iteration); }
-      features.run_iterations(options.iteration_step, false);
-      gsoc_2018.run_iterations(options.iteration_step, false);
-      twitter.run_iterations(options.iteration_step, false);
-      random.run_iterations(options.iteration_step, false);
-    }
-  }
-  if (!options.verbose) { progress.erase(); }
-
-  features.print(options);
-
-  // Gauge effectiveness
-  if (options.verbose) {
-    printf("\n");
-    printf("        Effectiveness Check: Estimated vs. Actual ns/block for real files:\n");
-    printf("\n");
-    printf("        | %8s ", "Stage");
-    printf("| %-15s ", "File");
-    printf("| %11s ", "Est. (Base)");
-    printf("| %11s ", "Est. (Miss)");
-    printf("| %8s ",  "Est.");
-    printf("| %8s ",  "Actual");
-    printf("| %8s ",  "Diff");
-    printf("| %13s ", "Est. Misses");
-    if (features.has_events()) {
-      printf("| %13s ", "Actual Misses");
-      printf("| %13s ", "Diff (Misses)");
-      printf("| %13s ", "Adjusted Miss");
-      printf("| %13s ", "Adjusted Diff");
-    }
-    printf("|\n");
-    printf("        |%.10s",  "---------------------------------------");
-    printf("|%.17s",  "---------------------------------------");
-    printf("|%.13s",  "---------------------------------------");
-    printf("|%.13s",  "---------------------------------------");
-    printf("|%.10s",  "---------------------------------------");
-    printf("|%.10s",  "---------------------------------------");
-    printf("|%.10s",  "---------------------------------------");
-    printf("|%.15s",  "---------------------------------------");
-    if (features.has_events()) {
-      printf("|%.15s",  "---------------------------------------");
-      printf("|%.15s",  "---------------------------------------");
-      printf("|%.15s",  "---------------------------------------");
-      printf("|%.15s",  "---------------------------------------");
-    }
-    printf("|\n");
-
-    options.each_stage([&](auto stage) {
-      print_file_effectiveness(stage, "gsoc-2018.json", gsoc_2018, features);
-      print_file_effectiveness(stage, "twitter.json", twitter, features);
-      print_file_effectiveness(stage, "random.json", random, features);
-    });
-  }
-
-  return EXIT_SUCCESS;
-}

benchmark/benchmark.h

@@ -1,109 +0,0 @@
-#ifndef _BENCHMARK_H_
-#define _BENCHMARK_H_
-
-#include "event_counter.h"
-
-/*
- * Prints the best number of operations per cycle where
- * test is the function call, answer is the expected answer generated by
- * test, repeat is the number of times we should repeat and size is the
- * number of operations represented by test.
- */
-#define BEST_TIME(name, test, expected, pre, repeat, size, verbose)            \
-  do {                                                                         \
-    if (verbose)                                                               \
-      std::printf("%-40s\t: ", name);                                          \
-    else                                                                       \
-      std::printf("\"%-40s\"", name);                                          \
-    fflush(NULL);                                                              \
-    event_collector collector;                                                 \
-    event_aggregate aggregate{};                                               \
-    for (decltype(repeat) i = 0; i < repeat; i++) {                            \
-      pre;                                                                     \
-      std::atomic_thread_fence(std::memory_order_acquire);                     \
-      collector.start();                                                       \
-      if (test != expected) {                                                  \
-        std::fprintf(stderr, "not expected (%d , %d )", (int)test,             \
-                     (int)expected);                                           \
-        break;                                                                 \
-      }                                                                        \
-      std::atomic_thread_fence(std::memory_order_release);                     \
-      event_count allocate_count = collector.end();                            \
-      aggregate << allocate_count;                                             \
-    }                                                                          \
-    if (collector.has_events()) {                                              \
-      std::printf("%7.3f",                                                     \
-                  aggregate.best.cycles() / static_cast<double>(size));        \
-      if (verbose) {                                                           \
-        std::printf(" cycles/byte ");                                          \
-      }                                                                        \
-      std::printf("\t");                                                       \
-      std::printf("%7.3f",                                                     \
-                  aggregate.best.instructions() / static_cast<double>(size));  \
-      if (verbose) {                                                           \
-        std::printf(" instructions/byte ");                                    \
-      }                                                                        \
-      std::printf("\t");                                                       \
-    }                                                                          \
-    double gb = static_cast<double>(size) / 1000000000.0;                      \
-    std::printf("%7.3f", gb / aggregate.best.elapsed_sec());                   \
-    if (verbose) {                                                             \
-      std::printf(" GB/s ");                                                   \
-    }                                                                          \
-    std::printf("\t"); \
-    std::printf("%7.3f", 1.0 / aggregate.best.elapsed_sec());                  \
-    if (verbose) {                                                             \
-      std::printf(" documents/s ");                                            \
-    }                                                                          \
-    std::printf("\n");                                                         \
-    std::fflush(NULL);                                                         \
-  } while (0)
-
-// like BEST_TIME, but no check
-#define BEST_TIME_NOCHECK(name, test, pre, repeat, size, verbose)              \
-  do {                                                                         \
-    if (verbose)                                                               \
-      std::printf("%-40s\t: ", name);                                          \
-    else                                                                       \
-      std::printf("\"%-40s\"", name);                                          \
-    std::fflush(NULL);                                                         \
-    event_collector collector;                                                 \
-    event_aggregate aggregate{};                                               \
-    for (decltype(repeat) i = 0; i < repeat; i++) {                            \
-      pre;                                                                     \
-      std::atomic_thread_fence(std::memory_order_acquire);                     \
-      collector.start();                                                       \
-      test;                                                                    \
-      std::atomic_thread_fence(std::memory_order_release);                     \
-      event_count allocate_count = collector.end();                            \
-      aggregate << allocate_count;                                             \
-    }                                                                          \
-    if (collector.has_events()) {                                              \
-      std::printf("%7.3f",                                                     \
-                  aggregate.best.cycles() / static_cast<double>(size));        \
-      if (verbose) {                                                           \
-        std::printf(" cycles/byte ");                                          \
-      }                                                                        \
-      std::printf("\t");                                                       \
-      std::printf("%7.3f",                                                     \
-                  aggregate.best.instructions() / static_cast<double>(size));  \
-      if (verbose) {                                                           \
-        std::printf(" instructions/byte ");                                    \
-      }                                                                        \
-      std::printf("\t");                                                       \
-    }                                                                          \
-    double gb = static_cast<double>(size) / 1000000000.0;                      \
-    std::printf("%7.3f", gb / aggregate.best.elapsed_sec());                   \
-    if (verbose) {                                                             \
-      std::printf(" GB/s ");                                                   \
-    }                                                                          \
-    std::printf("\t");                                                       \
-    std::printf("%7.3f", 1.0 / aggregate.best.elapsed_sec());                  \
-    if (verbose) {                                                             \
-      std::printf(" documents/s ");                                            \
-    }                                                                          \
-    std::printf("\n");                                                         \
-    std::fflush(NULL);                                                         \
-  } while (0)
-
-#endif

benchmark/benchmarker.h

@@ -1,533 +0,0 @@
-#ifndef __BENCHMARKER_H
-#define __BENCHMARKER_H
-
-#include "event_counter.h"
-#include "simdjson.h" // For SIMDJSON_DISABLE_DEPRECATED_WARNINGS
-
-#include <cassert>
-#include <cctype>
-#ifndef _MSC_VER
-#include <dirent.h>
-#endif
-#include <unistd.h>
-#include <cinttypes>
-
-#include <cstdio>
-#include <cstdlib>
-#include <cstring>
-
-#include <algorithm>
-#include <chrono>
-#include <cstring>
-#include <fstream>
-#include <iomanip>
-#include <iostream>
-#include <map>
-#include <set>
-#include <sstream>
-#include <string>
-#include <vector>
-
-#include "linux-perf-events.h"
-#ifdef __linux__
-#include <libgen.h>
-#endif
-#include "simdjson.h"
-
-#include <functional>
-
-using namespace simdjson;
-using std::cerr;
-using std::cout;
-using std::endl;
-using std::string;
-using std::to_string;
-using std::vector;
-using std::ostream;
-using std::ofstream;
-using std::exception;
-using std::min;
-using std::max;
-
-// Initialize "verbose" to go nowhere. We'll read options in main() and set to cout if verbose is true.
-std::ofstream dev_null;
-ostream *verbose_stream = &dev_null;
-const size_t BYTES_PER_BLOCK = 64;
-
-ostream& verbose() {
-  return *verbose_stream;
-}
-
-void exit_error(string message) {
-  cerr << message << endl;
-  exit(EXIT_FAILURE);
-}
-
-struct json_stats {
-  size_t bytes = 0;
-  size_t blocks = 0;
-  size_t structurals = 0;
-  size_t blocks_with_utf8 = 0;
-  size_t blocks_with_utf8_flipped = 0;
-  size_t blocks_with_escapes = 0;
-  size_t blocks_with_escapes_flipped = 0;
-  size_t blocks_with_0_structurals = 0;
-  size_t blocks_with_0_structurals_flipped = 0;
-  size_t blocks_with_1_structural = 0;
-  size_t blocks_with_1_structural_flipped = 0;
-  size_t blocks_with_8_structurals = 0;
-  size_t blocks_with_8_structurals_flipped = 0;
-  size_t blocks_with_16_structurals = 0;
-  size_t blocks_with_16_structurals_flipped = 0;
-
-  json_stats(const padded_string& json, const dom::parser& parser) {
-    bytes = json.size();
-    blocks = bytes / BYTES_PER_BLOCK;
-    if (bytes % BYTES_PER_BLOCK > 0) { blocks++; } // Account for remainder block
-    structurals = parser.implementation->n_structural_indexes-1;
-
-    // Calculate stats on blocks that will trigger utf-8 if statements / mispredictions
-    bool last_block_has_utf8 = false;
-    for (size_t block=0; block<blocks; block++) {
-      // Find utf-8 in the block
-      size_t block_start = block*BYTES_PER_BLOCK;
-      size_t block_end = block_start+BYTES_PER_BLOCK;
-      if (block_end > json.size()) { block_end = json.size(); }
-      bool block_has_utf8 = false;
-      for (size_t i=block_start; i<block_end; i++) {
-        if (json.data()[i] & 0x80) {
-          block_has_utf8 = true;
-          break;
-        }
-      }
-      if (block_has_utf8) {
-        blocks_with_utf8++;
-      }
-      if (block > 0 && last_block_has_utf8 != block_has_utf8) {
-        blocks_with_utf8_flipped++;
-      }
-      last_block_has_utf8 = block_has_utf8;
-    }
-
-    // Calculate stats on blocks that will trigger escape if statements / mispredictions
-    bool last_block_has_escapes = false;
-    for (size_t block=0; block<blocks; block++) {
-      // Find utf-8 in the block
-      size_t block_start = block*BYTES_PER_BLOCK;
-      size_t block_end = block_start+BYTES_PER_BLOCK;
-      if (block_end > json.size()) { block_end = json.size(); }
-      bool block_has_escapes = false;
-      for (size_t i=block_start; i<block_end; i++) {
-        if (json.data()[i] == '\\') {
-          block_has_escapes = true;
-          break;
-        }
-      }
-      if (block_has_escapes) {
-        blocks_with_escapes++;
-      }
-      if (block > 0 && last_block_has_escapes != block_has_escapes) {
-        blocks_with_escapes_flipped++;
-      }
-      last_block_has_escapes = block_has_escapes;
-    }
-
-    // Calculate stats on blocks that will trigger structural count if statements / mispredictions
-    bool last_block_has_0_structurals = false;
-    bool last_block_has_1_structural = false;
-    bool last_block_has_8_structurals = false;
-    bool last_block_has_16_structurals = false;
-    size_t structural=0;
-    for (size_t block=0; block<blocks; block++) {
-      // Count structurals in the block
-      int block_structurals=0;
-      while (structural < parser.implementation->n_structural_indexes && parser.implementation->structural_indexes[structural] < (block+1)*BYTES_PER_BLOCK) {
-        block_structurals++;
-        structural++;
-      }
-
-      bool block_has_0_structurals = block_structurals == 0;
-      if (block_has_0_structurals) {
-        blocks_with_0_structurals++;
-      }
-      if (block > 0 && last_block_has_0_structurals != block_has_0_structurals) {
-        blocks_with_0_structurals_flipped++;
-      }
-      last_block_has_0_structurals = block_has_0_structurals;
-
-      bool block_has_1_structural = block_structurals >= 1;
-      if (block_has_1_structural) {
-        blocks_with_1_structural++;
-      }
-      if (block > 0 && last_block_has_1_structural != block_has_1_structural) {
-        blocks_with_1_structural_flipped++;
-      }
-      last_block_has_1_structural = block_has_1_structural;
-
-      bool block_has_8_structurals = block_structurals >= 8;
-      if (block_has_8_structurals) {
-        blocks_with_8_structurals++;
-      }
-      if (block > 0 && last_block_has_8_structurals != block_has_8_structurals) {
-        blocks_with_8_structurals_flipped++;
-      }
-      last_block_has_8_structurals = block_has_8_structurals;
-
-      bool block_has_16_structurals = block_structurals >= 16;
-      if (block_has_16_structurals) {
-        blocks_with_16_structurals++;
-      }
-      if (block > 0 && last_block_has_16_structurals != block_has_16_structurals) {
-        blocks_with_16_structurals_flipped++;
-      }
-      last_block_has_16_structurals = block_has_16_structurals;
-    }
-  }
-};
-
-struct progress_bar {
-  int max_value;
-  int total_ticks;
-  double ticks_per_value;
-  int next_tick;
-  progress_bar(int _max_value, int _total_ticks) : max_value(_max_value), total_ticks(_total_ticks), ticks_per_value(double(_total_ticks)/_max_value), next_tick(0) {
-    fprintf(stderr, "[");
-    for (int i=0;i<total_ticks;i++) {
-      fprintf(stderr, " ");
-    }
-    fprintf(stderr, "]");
-    for (int i=0;i<total_ticks+1;i++) {
-      fprintf(stderr, "\b");
-    }
-  }
-
-  void print(int value) {
-    double ticks = value*ticks_per_value;
-    if (ticks >= total_ticks) {
-      ticks = total_ticks-1;
-    }
-    int tick;
-    for (tick=next_tick; tick <= ticks && tick <= total_ticks; tick++) {
-      fprintf(stderr, "=");
-    }
-    next_tick = tick;
-  }
-  void erase() const {
-    for (int i=0;i<next_tick+1;i++) {
-      fprintf(stderr, "\b");
-    }
-    for (int tick=0; tick<=total_ticks+2; tick++) {
-      fprintf(stderr, " ");
-    }
-    for (int tick=0; tick<=total_ticks+2; tick++) {
-      fprintf(stderr, "\b");
-    }
-  }
-};
-
-/**
- * The speed at which we can allocate memory is strictly system specific.
- * It depends on the OS and the runtime library. It is subject to various
- * system-specific knobs. It is not something that we can reasonably 
- * benchmark with crude timings.
- * If someone wants to optimize how simdjson allocate memory, then it will
- * almost surely require a distinct benchmarking tool. What is meant by
- * "memory allocation" also requires a definition. Doing "new char[size]" can
- * do many different things depending on the system.
- */
-
-enum class BenchmarkStage {
-  ALL, // This excludes allocation
-  ALLOCATE,
-  STAGE1,
-  STAGE2
-};
-
-const char* benchmark_stage_name(BenchmarkStage stage) {
-  switch (stage) {
-    case BenchmarkStage::ALL: return "All (Without Allocation)";
-    case BenchmarkStage::ALLOCATE: return "Allocate";
-    case BenchmarkStage::STAGE1: return "Stage 1";
-    case BenchmarkStage::STAGE2: return "Stage 2";
-    default: return "Unknown";
-  }
-}
-
-struct benchmarker {
-  // JSON text from loading the file. Owns the memory.
-  padded_string json{};
-  // JSON filename
-  const char *filename;
-  // Event collector that can be turned on to measure cycles, missed branches, etc.
-  event_collector& collector;
-
-  // Statistics about the JSON file independent of its speed (amount of utf-8, structurals, etc.).
-  // Loaded on first parse.
-  json_stats* stats;
-  // Speed and event summary for full parse (stage 1 and stage 2, but *excluding* allocation)
-  event_aggregate all_stages_without_allocation{};
-  // Speed and event summary for stage 1
-  event_aggregate stage1{};
-  // Speed and event summary for stage 2
-  event_aggregate stage2{};
-  // Speed and event summary for allocation
-  event_aggregate allocate_stage{};
-  // Speed and event summary for the repeatly-parsing mode
-  event_aggregate loop{};
-
-  benchmarker(const char *_filename, event_collector& _collector)
-    : filename(_filename), collector(_collector), stats(NULL) {
-    verbose() << "[verbose] loading " << filename << endl;
-    auto error = padded_string::load(filename).get(json);
-    if (error) {
-      exit_error(string("Could not load the file ") + filename);
-    }
-    verbose() << "[verbose] loaded " << filename << endl;
-  }
-
-  ~benchmarker() {
-    if (stats) {
-      delete stats;
-    }
-  }
-
-  benchmarker(const benchmarker&) = delete;
-  benchmarker& operator=(const benchmarker&) = delete;
-
-  const event_aggregate& operator[](BenchmarkStage stage) const {
-    switch (stage) {
-      case BenchmarkStage::ALL: return this->all_stages_without_allocation;
-      case BenchmarkStage::STAGE1: return this->stage1;
-      case BenchmarkStage::STAGE2: return this->stage2;
-      case BenchmarkStage::ALLOCATE: return this->allocate_stage;
-      default: exit_error("Unknown stage"); return this->all_stages_without_allocation;
-    }
-  }
-
-  int iterations() const {
-    return all_stages_without_allocation.iterations;
-  }
-
-  simdjson_really_inline void run_iteration(bool stage1_only, bool hotbuffers=false) {
-    // Allocate dom::parser
-    collector.start();
-    dom::parser parser;
-    // We always allocate at least 64KB. Smaller allocations may actually be slower under some systems.
-    error_code error = parser.allocate(json.size() < 65536 ? 65536 : json.size());
-    if (error) {
-      exit_error(string("Unable to allocate_stage ") + to_string(json.size()) + " bytes for the JSON result: " + error_message(error));
-    }
-    event_count allocate_count = collector.end();
-    allocate_stage << allocate_count;
-    // Run it once to get hot buffers
-    if(hotbuffers) {
-      auto result = parser.parse((const uint8_t *)json.data(), json.size());
-      if (result.error()) {
-        exit_error(string("Failed to parse ") + filename + string(":") + error_message(result.error()));
-      }
-    }
-
-    verbose() << "[verbose] allocated memory for parsed JSON " << endl;
-
-    // Stage 1 (find structurals)
-    collector.start();
-    error = parser.implementation->stage1((const uint8_t *)json.data(), json.size(), false);
-    event_count stage1_count = collector.end();
-    stage1 << stage1_count;
-    if (error) {
-      exit_error(string("Failed to parse ") + filename + " during stage 1: " + error_message(error));
-    }
-
-    // Stage 2 (unified machine) and the rest
-
-    if (stage1_only) {
-      all_stages_without_allocation << stage1_count;
-    } else {
-      event_count stage2_count;
-      collector.start();
-      error = parser.implementation->stage2(parser.doc);
-      if (error) {
-        exit_error(string("Failed to parse ") + filename + " during stage 2 parsing " + error_message(error));
-      }
-      stage2_count = collector.end();
-      stage2 << stage2_count;
-      all_stages_without_allocation << stage1_count + stage2_count;
-    }
-    // Calculate stats the first time we parse
-    if (stats == NULL) {
-      if (stage1_only) { //  we need stage 2 once
-        error = parser.implementation->stage2(parser.doc);
-        if (error) {
-          printf("Warning: failed to parse during stage 2. Unable to acquire statistics.\n");
-        }
-      }
-      stats = new json_stats(json, parser);
-    }
-  }
-
-  void run_loop(size_t iterations) {
-    dom::parser parser;
-    auto firstresult = parser.parse((const uint8_t *)json.data(), json.size());
-    if (firstresult.error()) {
-      exit_error(string("Failed to parse ") + filename + string(":") + error_message(firstresult.error()));
-    }
-
-    collector.start();
-    // some users want something closer to "number of documents per second"
-    for(size_t i = 0; i < iterations; i++) {
-      auto result = parser.parse((const uint8_t *)json.data(), json.size());
-      if (result.error()) {
-        exit_error(string("Failed to parse ") + filename + string(":") + error_message(result.error()));
-      }
-    }
-    event_count all_loop_count = collector.end();
-    loop << all_loop_count;
-  }
-
-  simdjson_really_inline void run_iterations(size_t iterations, bool stage1_only, bool hotbuffers=false) {
-    for (size_t i = 0; i<iterations; i++) {
-      run_iteration(stage1_only, hotbuffers);
-    }
-    run_loop(iterations);
-  }
-
-  // Gigabyte: https://en.wikipedia.org/wiki/Gigabyte
-  template<typename T>
-  void print_aggregate(const char* prefix, const T& stage) const {
-    printf("%s%-13s: %8.4f ns per block (%6.2f%%) - %8.4f ns per byte - %8.4f ns per structural - %8.4f GB/s\n",
-      prefix,
-      "Speed",
-      stage.elapsed_ns() / static_cast<double>(stats->blocks), // per block
-      percent(stage.elapsed_sec(), all_stages_without_allocation.elapsed_sec()), // %
-      stage.elapsed_ns() / static_cast<double>(stats->bytes), // per byte
-      stage.elapsed_ns() / static_cast<double>(stats->structurals), // per structural
-      (static_cast<double>(json.size()) / 1000000000.0) / stage.elapsed_sec() // GB/s
-    );
-
-    if (collector.has_events()) {
-      printf("%s%-13s: %8.4f per block    (%6.2f%%) - %8.4f per byte    - %8.4f per structural    - %8.3f GHz est. frequency\n",
-        prefix,
-        "Cycles",
-        stage.cycles() / static_cast<double>(stats->blocks),
-        percent(stage.cycles(), all_stages_without_allocation.cycles()),
-        stage.cycles() / static_cast<double>(stats->bytes),
-        stage.cycles() / static_cast<double>(stats->structurals),
-        (stage.cycles() / stage.elapsed_sec()) / 1000000000.0
-      );
-      printf("%s%-13s: %8.4f per block    (%6.2f%%) - %8.4f per byte    - %8.4f per structural    - %8.3f per cycle\n",
-        prefix,
-        "Instructions",
-        stage.instructions() / static_cast<double>(stats->blocks),
-        percent(stage.instructions(), all_stages_without_allocation.instructions()),
-        stage.instructions() / static_cast<double>(stats->bytes),
-        stage.instructions() / static_cast<double>(stats->structurals),
-        stage.instructions() / static_cast<double>(stage.cycles())
-      );
-
-      // NOTE: removed cycles/miss because it is a somewhat misleading stat
-      printf("%s%-13s: %7.0f branch misses (%6.2f%%) - %.0f cache misses (%6.2f%%) - %.2f cache references\n",
-        prefix,
-        "Misses",
-        stage.branch_misses(),
-        percent(stage.branch_misses(), all_stages_without_allocation.branch_misses()),
-        stage.cache_misses(),
-        percent(stage.cache_misses(), all_stages_without_allocation.cache_misses()),
-        stage.cache_references()
-      );
-    }
-  }
-
-  static double percent(size_t a, size_t b) {
-    return 100.0 * static_cast<double>(a) / static_cast<double>(b);
-  }
-  static double percent(double a, double b) {
-    return 100.0 * a / b;
-  }
-
-  void print(bool tabbed_output) const {
-    if (tabbed_output) {
-      char* filename_copy = (char*)malloc(strlen(filename)+1);
-      SIMDJSON_PUSH_DISABLE_WARNINGS
-      SIMDJSON_DISABLE_DEPRECATED_WARNING // Validated CRT_SECURE safe here
-      strcpy(filename_copy, filename);
-      SIMDJSON_POP_DISABLE_WARNINGS
-
-      #if defined(__linux__)
-      char* base = ::basename(filename_copy);
-      #else
-      char* base = filename_copy;
-      #endif
-      if (strlen(base) >= 5 && !strcmp(base+strlen(base)-5, ".json")) {
-        base[strlen(base)-5] = '\0';
-      }
-
-      double gb = static_cast<double>(json.size()) / 1000000000.0;
-      if (collector.has_events()) {
-        printf("\"%s\"\t%f\t%f\t%f\t%f\t%f\t%f\t%f\n",
-                base,
-                allocate_stage.best.cycles() / static_cast<double>(json.size()),
-                stage1.best.cycles() / static_cast<double>(json.size()),
-                stage2.best.cycles() / static_cast<double>(json.size()),
-                all_stages_without_allocation.best.cycles() / static_cast<double>(json.size()),
-                gb / all_stages_without_allocation.best.elapsed_sec(),
-                gb / stage1.best.elapsed_sec(),
-                gb / stage2.best.elapsed_sec());
-      } else {
-        printf("\"%s\"\t\t\t\t\t%f\t%f\t%f\n",
-                base,
-                gb / all_stages_without_allocation.best.elapsed_sec(),
-                gb / stage1.best.elapsed_sec(),
-                gb / stage2.best.elapsed_sec());
-      }
-      free(filename_copy);
-    } else {
-      printf("\n");
-      printf("%s\n", filename);
-      printf("%s\n", string(strlen(filename), '=').c_str());
-      printf("%9zu blocks - %10zu bytes - %5zu structurals (%5.1f %%)\n", stats->bytes / BYTES_PER_BLOCK, stats->bytes, stats->structurals, percent(stats->structurals, stats->bytes));
-      if (stats) {
-        printf("special blocks with: utf8 %9zu (%5.1f %%) - escape %9zu (%5.1f %%) - 0 structurals %9zu (%5.1f %%) - 1+ structurals %9zu (%5.1f %%) - 8+ structurals %9zu (%5.1f %%) - 16+ structurals %9zu (%5.1f %%)\n",
-          stats->blocks_with_utf8, percent(stats->blocks_with_utf8, stats->blocks),
-          stats->blocks_with_escapes, percent(stats->blocks_with_escapes, stats->blocks),
-          stats->blocks_with_0_structurals, percent(stats->blocks_with_0_structurals, stats->blocks),
-          stats->blocks_with_1_structural, percent(stats->blocks_with_1_structural, stats->blocks),
-          stats->blocks_with_8_structurals, percent(stats->blocks_with_8_structurals, stats->blocks),
-          stats->blocks_with_16_structurals, percent(stats->blocks_with_16_structurals, stats->blocks));
-        printf("special block flips: utf8 %9zu (%5.1f %%) - escape %9zu (%5.1f %%) - 0 structurals %9zu (%5.1f %%) - 1+ structurals %9zu (%5.1f %%) - 8+ structurals %9zu (%5.1f %%) - 16+ structurals %9zu (%5.1f %%)\n",
-          stats->blocks_with_utf8_flipped, percent(stats->blocks_with_utf8_flipped, stats->blocks),
-          stats->blocks_with_escapes_flipped, percent(stats->blocks_with_escapes_flipped, stats->blocks),
-          stats->blocks_with_0_structurals_flipped, percent(stats->blocks_with_0_structurals_flipped, stats->blocks),
-          stats->blocks_with_1_structural_flipped, percent(stats->blocks_with_1_structural_flipped, stats->blocks),
-          stats->blocks_with_8_structurals_flipped, percent(stats->blocks_with_8_structurals_flipped, stats->blocks),
-          stats->blocks_with_16_structurals_flipped, percent(stats->blocks_with_16_structurals_flipped, stats->blocks));
-      }
-      printf("\n");
-      printf("All Stages (excluding allocation)\n");
-      print_aggregate("|    "   , all_stages_without_allocation.best);
-      // frequently, allocation is a tiny fraction of the running time so we omit it
-      if(allocate_stage.best.elapsed_sec() > 0.01 * all_stages_without_allocation.best.elapsed_sec()) {
-        printf("|- Allocation\n");
-        print_aggregate("|    ", allocate_stage.best);
-      }
-      printf("|- Stage 1\n");
-      print_aggregate("|    ", stage1.best);
-      printf("|- Stage 2\n");
-      print_aggregate("|    ", stage2.best);
-      if (collector.has_events()) {
-        double freq1 = (stage1.best.cycles() / stage1.best.elapsed_sec()) / 1000000000.0;
-        double freq2 = (stage2.best.cycles() / stage2.best.elapsed_sec()) / 1000000000.0;
-        double freqall = (all_stages_without_allocation.best.cycles() / all_stages_without_allocation.best.elapsed_sec()) / 1000000000.0;
-        double freqmin = min(freq1, freq2);
-        double freqmax = max(freq1, freq2);
-        if((freqall < 0.95 * freqmin) or (freqall > 1.05 * freqmax)) {
-          printf("\nWarning: The processor frequency fluctuates in an expected way!!!\n"
-          "Range for stage 1 and stage 2 : [%.3f GHz, %.3f GHz], overall: %.3f GHz.\n",
-          freqmin, freqmax, freqall);
-        }
-      }
-      printf("\n%.1f documents parsed per second (best)\n", 1.0/static_cast<double>(all_stages_without_allocation.best.elapsed_sec()));
-    }
-  }
-};
-
-#endif

benchmark/checkperf.cmake

@@ -1,101 +0,0 @@
-# Relevant targets:
-# checkperf-parse: builds the reference checkperf-parse, syncing reference repository if needed
-# checkperf: builds the targets needed for checkperf (parse, perfdiff, checkperf-parse)
-# update-checkperf-repo: updates the reference repository we're checking performance against
-# checkperf-repo: initialize and sync reference repository (first time only)
-# TEST checkperf: runs the actual checkperf test
-
-# Clone the repository if it's not there
-find_package(Git QUIET)
-if (SIMDJSON_IS_UNDER_GIT AND SIMDJSON_GIT AND Git_FOUND AND (GIT_VERSION_STRING VERSION_GREATER  "2.1.4") AND (NOT CMAKE_GENERATOR MATCHES Ninja) ) # We use "-C" which requires a recent git
-  message(STATUS "Git is available and it is recent. We are enabling checkperf targets.")
-  # sync_git_repository(myrepo ...) creates two targets:
-  # myrepo - if the repo does not exist, creates and syncs it against the origin branch
-  # update_myrepo - will update the repo against the origin branch (and create if needed)
-  function(sync_git_repository name dir remote branch url)
-    # This conditionally creates the git repository
-    add_custom_command(
-      OUTPUT ${dir}/.git/config
-      COMMAND ${GIT_EXECUTABLE} init ${dir}
-      COMMAND ${GIT_EXECUTABLE} -C ${dir} remote add ${remote} ${url}
-    )
-    add_custom_target(init-${name} DEPENDS ${dir}/.git/config)
-    # This conditionally syncs the git repository, first time only
-    add_custom_command(
-      OUTPUT ${dir}/.git/FETCH_HEAD
-      COMMAND ${GIT_EXECUTABLE} remote set-url ${remote} ${url}
-      COMMAND ${GIT_EXECUTABLE} fetch --depth=1 ${remote} ${branch}
-      COMMAND ${GIT_EXECUTABLE} reset --hard ${remote}/${branch}
-      WORKING_DIRECTORY ${dir}
-      DEPENDS init-${name}
-    )
-    # This is the ${name} target, which will create and sync the repo first time only
-    add_custom_target(${name} DEPENDS ${dir}/.git/FETCH_HEAD)
-    # This is the update-${name} target, which will sync the repo (creating it if needed)
-    add_custom_target(
-      update-${name}
-      COMMAND ${GIT_EXECUTABLE} remote set-url ${remote} ${url}
-      COMMAND ${GIT_EXECUTABLE} fetch --depth=1 ${remote} ${branch}
-      COMMAND ${GIT_EXECUTABLE} reset --hard ${remote}/${branch}
-      WORKING_DIRECTORY ${dir}
-      DEPENDS init-${name}
-    )
-  endfunction(sync_git_repository)
-
-  set(SIMDJSON_CHECKPERF_REMOTE origin CACHE STRING "Remote repository to compare performance against")
-  set(SIMDJSON_CHECKPERF_BRANCH master CACHE STRING "Branch to compare performance against")
-  set(SIMDJSON_CHECKPERF_DIR ${CMAKE_CURRENT_BINARY_DIR}/checkperf-reference/${SIMDJSON_CHECKPERF_BRANCH} CACHE STRING "Location to put checkperf performance comparison repository")
-  set(SIMDJSON_CHECKPERF_ARGS ${EXAMPLE_JSON} CACHE STRING "Arguments to pass to parse during checkperf")
-  sync_git_repository(checkperf-repo ${SIMDJSON_CHECKPERF_DIR} ${SIMDJSON_CHECKPERF_REMOTE} ${SIMDJSON_CHECKPERF_BRANCH} ${SIMDJSON_GITHUB_REPOSITORY})
-
-  # Commands to cause cmake on benchmark/checkperf-master/build/
-  # - first, copy CMakeCache.txt
-  add_custom_command(
-    OUTPUT ${SIMDJSON_CHECKPERF_DIR}/build/CMakeCache.txt
-    COMMAND ${CMAKE_COMMAND} -E make_directory ${SIMDJSON_CHECKPERF_DIR}/build
-    COMMAND ${CMAKE_COMMAND} -E copy ${SIMDJSON_USER_CMAKECACHE} ${SIMDJSON_CHECKPERF_DIR}/build/CMakeCache.txt
-    DEPENDS checkperf-repo simdjson-user-cmakecache
-  )
-  # - second, cmake ..
-  add_custom_command(
-    OUTPUT ${SIMDJSON_CHECKPERF_DIR}/build/cmake_install.cmake # We make many things but this seems the most cross-platform one we can depend on
-    COMMAND
-    ${CMAKE_COMMAND} -E env CXX=${CMAKE_CXX_COMPILER} CC=${CMAKE_C_COMPILER}
-    ${CMAKE_COMMAND} -DCMAKE_BUILD_TYPE=${CMAKE_BUILD_TYPE} -DSIMDJSON_GOOGLE_BENCHMARKS=OFF -DSIMDJSON_COMPETITION=OFF -G ${CMAKE_GENERATOR} ..
-    WORKING_DIRECTORY ${SIMDJSON_CHECKPERF_DIR}/build
-    DEPENDS ${SIMDJSON_CHECKPERF_DIR}/build/CMakeCache.txt
-  )
-
-  # - third, build parse.
-  if (CMAKE_CONFIGURATION_TYPES)
-    set(CHECKPERF_PARSE ${SIMDJSON_CHECKPERF_DIR}/build/benchmark/$<CONFIGURATION>/parse)
-  else()
-    set(CHECKPERF_PARSE ${SIMDJSON_CHECKPERF_DIR}/build/benchmark/parse)
-  endif()
-  add_custom_target(
-    checkperf-parse ALL # TODO is ALL necessary?
-    # Build parse
-    COMMAND ${CMAKE_COMMAND} --build . --target parse --config $<CONFIGURATION>
-    WORKING_DIRECTORY ${SIMDJSON_CHECKPERF_DIR}/build
-    DEPENDS ${SIMDJSON_CHECKPERF_DIR}/build/cmake_install.cmake # We make many things but this seems the most cross-platform one we can depend on
-  )
-
-  # Target to build everything needed for the checkperf test
-  add_custom_target(checkperf DEPENDS parse perfdiff checkperf-parse)
-
-  # Add the actual checkperf test
-  add_test(
-    NAME checkperf
-    # COMMAND ECHO $<TARGET_FILE:perfdiff> \"$<TARGET_FILE:parse> -t ${SIMDJSON_CHECKPERF_ARGS}\" \"${CHECKPERF_PARSE} -t ${SIMDJSON_CHECKPERF_ARGS}\" }
-    COMMAND $<TARGET_FILE:perfdiff> $<TARGET_FILE:parse> ${CHECKPERF_PARSE} -H -t ${SIMDJSON_CHECKPERF_ARGS}
-  )
-  set_property(TEST checkperf APPEND PROPERTY LABELS per_implementation)
-  set_property(TEST checkperf APPEND PROPERTY DEPENDS parse perfdiff ${SIMDJSON_USER_CMAKECACHE})
-  set_property(TEST checkperf PROPERTY RUN_SERIAL TRUE)
-else()
-  if (CMAKE_GENERATOR MATCHES Ninja)
-   message(STATUS "We disable the checkperf targets under Ninja.")
-  else() 
-   message(STATUS "Either git is unavailable or else it is too old. We are disabling checkperf targets.")
-  endif()
-endif ()

benchmark/distinctuserid/distinctuserid.h

@@ -1,52 +0,0 @@
-
-#pragma once
-#include <vector>
-#include <cstdint>
-#include "event_counter.h"
-#include "json_benchmark.h"
-
-
-bool equals(const char *s1, const char *s2) { return strcmp(s1, s2) == 0; }
-
-void remove_duplicates(std::vector<int64_t> &v) {
-  std::sort(v.begin(), v.end());
-  auto last = std::unique(v.begin(), v.end());
-  v.erase(last, v.end());
-}
-
-//
-// Interface
-//
-
-namespace distinct_user_id {
-template<typename T> static void DistinctUserID(benchmark::State &state);
-} // namespace 
-
-//
-// Implementation
-//
-
-#include "dom.h"
-
-
-namespace distinct_user_id {
-
-using namespace simdjson;
-
-template<typename T> static void DistinctUserID(benchmark::State &state) {
-  //
-  // Load the JSON file
-  //
-  constexpr const char *TWITTER_JSON = SIMDJSON_BENCHMARK_DATA_DIR "twitter.json";
-  error_code error;
-  padded_string json;
-  if ((error = padded_string::load(TWITTER_JSON).get(json))) {
-    std::cerr << error << std::endl;
-    state.SkipWithError("error loading");
-    return;
-  }
-
-  JsonBenchmark<T, Dom>(state, json);
-}
-
-} // namespace distinct_user_id

benchmark/distinctuserid/dom.h

@@ -1,89 +0,0 @@
-#pragma once
-
-#if SIMDJSON_EXCEPTIONS
-
-#include "distinctuserid.h"
-
-namespace distinct_user_id {
-
-using namespace simdjson;
-
-
-simdjson_really_inline void simdjson_recurse(std::vector<int64_t> & v, simdjson::dom::element element);
-void simdjson_recurse(std::vector<int64_t> & v, simdjson::dom::array array) {
-  for (auto child : array) {
-    simdjson_recurse(v, child);
-  }
-}
-void simdjson_recurse(std::vector<int64_t> & v, simdjson::dom::object object) {
-  for (auto [key, value] : object) {
-    if((key.size() == 4) && (memcmp(key.data(), "user", 4) == 0)) {
-      // we are in an object under the key "user"
-      simdjson::error_code error;
-      simdjson::dom::object child_object;
-      simdjson::dom::object child_array;
-      if (not (error = value.get(child_object))) {
-        for (auto [child_key, child_value] : child_object) {
-          if((child_key.size() == 2) && (memcmp(child_key.data(), "id", 2) == 0)) {
-            int64_t x;
-            if (not (error = child_value.get(x))) {
-              v.push_back(x);
-            }
-          }
-          simdjson_recurse(v, child_value);
-        }
-      } else if (not (error = value.get(child_array))) {
-        simdjson_recurse(v, child_array);
-      }
-      // end of: we are in an object under the key "user"
-    } else {
-      simdjson_recurse(v, value);
-    }
-  }
-}
-simdjson_really_inline void simdjson_recurse(std::vector<int64_t> & v, simdjson::dom::element element) {
-  simdjson_unused simdjson::error_code error;
-  simdjson::dom::array array;
-  simdjson::dom::object object;
-  if (not (error = element.get(array))) {
-    simdjson_recurse(v, array);
-  } else if (not (error = element.get(object))) {
-    simdjson_recurse(v, object);
-  }
-}
-
-
-
-
-
-class Dom {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-  simdjson_really_inline const std::vector<int64_t> &Result() { return ids; }
-  simdjson_really_inline size_t ItemCount() { return ids.size(); }
-
-private:
-  dom::parser parser{};
-  std::vector<int64_t> ids{};
-
-};
-void print_vec(const std::vector<int64_t> &v) {
-  for (auto i : v) {
-    std::cout << i << " ";
-  }
-  std::cout << std::endl;
-}
-
-simdjson_really_inline bool Dom::Run(const padded_string &json) {
-  ids.clear();
-  dom::element doc = parser.parse(json);
-  simdjson_recurse(ids, doc);
-  remove_duplicates(ids);
-  return true;
-}
-
-BENCHMARK_TEMPLATE(DistinctUserID, Dom);
-
-} // namespace distinct_user_id
-
-#endif // SIMDJSON_EXCEPTIONS

benchmark/distinctuserid/ondemand.h

@@ -1,67 +0,0 @@
-#pragma once
-
-#if SIMDJSON_EXCEPTIONS
-
-#include "distinctuserid.h"
-
-namespace distinct_user_id {
-
-using namespace simdjson;
-using namespace simdjson::builtin;
-
-
-class OnDemand {
-public:
-  OnDemand() { 
-    if(!displayed_implementation) {
-      std::cout << "On Demand implementation: " << builtin_implementation()->name() << std::endl; 
-      displayed_implementation = true;
-    }
-  } 
-  simdjson_really_inline bool Run(const padded_string &json);
-  simdjson_really_inline const std::vector<int64_t> &Result() { return ids; }
-  simdjson_really_inline size_t ItemCount() { return ids.size(); }
-
-private:
-  ondemand::parser parser{};
-  std::vector<int64_t> ids{};
-
-  static inline bool displayed_implementation = false;
-};
-
-simdjson_really_inline bool OnDemand::Run(const padded_string &json) {
-  ids.clear();
-  // Walk the document, parsing as we go
-  auto doc = parser.iterate(json);
-  for (ondemand::object tweet : doc["statuses"]) {
-      // We believe that all statuses have a matching
-      // user, and we are willing to throw when they do not:
-      //
-      // You might think that you do not need the braces, but
-      // you do, otherwise you will get the wrong answer. That is
-      // because you can only have one active object or array 
-      // at a time. 
-      {
-        ondemand::object user = tweet["user"];
-        int64_t id = user["id"]; 
-        ids.push_back(id);
-      }
-      // Not all tweets have a "retweeted_status", but when they do 
-      // we want to go and find the user within.
-      auto retweet = tweet["retweeted_status"];
-      if(!retweet.error()) {
-          ondemand::object retweet_content = retweet;
-          ondemand::object reuser = retweet_content["user"];
-          int64_t rid = reuser["id"]; 
-          ids.push_back(rid);
-      }
-  }
-  remove_duplicates(ids);
-  return true;
-}
-
-BENCHMARK_TEMPLATE(DistinctUserID, OnDemand);
-
-} // namespace distinct_user_id
-
-#endif // SIMDJSON_EXCEPTIONS

benchmark/distinctuseridcompetition.cpp

@@ -1,406 +0,0 @@
-#include "simdjson.h"
-#include <algorithm>
-#include <cstring>
-#include <unistd.h>
-#include <vector>
-
-#include "benchmark.h"
-
-SIMDJSON_PUSH_DISABLE_ALL_WARNINGS
-
-// #define RAPIDJSON_SSE2 // bad for performance
-// #define RAPIDJSON_SSE42 // bad for performance
-#include "rapidjson/document.h"
-#include "rapidjson/reader.h"
-#include "rapidjson/stringbuffer.h"
-#include "rapidjson/writer.h"
-
-#include "sajson.h"
-
-SIMDJSON_POP_DISABLE_WARNINGS
-
-using namespace rapidjson;
-
-bool equals(const char *s1, const char *s2) { return strcmp(s1, s2) == 0; }
-
-void remove_duplicates(std::vector<int64_t> &v) {
-  std::sort(v.begin(), v.end());
-  auto last = std::unique(v.begin(), v.end());
-  v.erase(last, v.end());
-}
-
-void print_vec(const std::vector<int64_t> &v) {
-  for (auto i : v) {
-    std::cout << i << " ";
-  }
-  std::cout << std::endl;
-}
-
-// clang-format off
-
-// simdjson_recurse below can be implemented like so but it is slow:
-/*void simdjson_recurse(std::vector<int64_t> & v, simdjson::dom::element element) {
-  error_code error;
-  if (element.is_array()) {
-    dom::array array;
-    error = element.get(array);
-    for (auto child : array) {
-      if (child.is<simdjson::dom::array>() || child.is<simdjson::dom::object>()) {
-        simdjson_recurse(v, child);
-      }
-    }
-  } else if (element.is_object()) {
-    int64_t id;
-    error = element["user"]["id"].get(id);
-    if(!error) {
-      v.push_back(id);
-    }
-    for (auto [key, value] : object) {
-      if (value.is<simdjson::dom::array>() || value.is<simdjson::dom::object>()) {
-        simdjson_recurse(v, value);
-      }
-    }
-  }
-}*/
-// clang-format on
-
-
-simdjson_really_inline void simdjson_recurse(std::vector<int64_t> & v, simdjson::dom::element element);
-void simdjson_recurse(std::vector<int64_t> & v, simdjson::dom::array array) {
-  for (auto child : array) {
-    simdjson_recurse(v, child);
-  }
-}
-void simdjson_recurse(std::vector<int64_t> & v, simdjson::dom::object object) {
-  for (auto [key, value] : object) {
-    if((key.size() == 4) && (memcmp(key.data(), "user", 4) == 0)) {
-      // we are in an object under the key "user"
-      simdjson::error_code error;
-      simdjson::dom::object child_object;
-      simdjson::dom::object child_array;
-      if (not (error = value.get(child_object))) {
-        for (auto [child_key, child_value] : child_object) {
-          if((child_key.size() == 2) && (memcmp(child_key.data(), "id", 2) == 0)) {
-            int64_t x;
-            if (not (error = child_value.get(x))) {
-              v.push_back(x);
-            }
-          }
-          simdjson_recurse(v, child_value);
-        }
-      } else if (not (error = value.get(child_array))) {
-        simdjson_recurse(v, child_array);
-      }
-      // end of: we are in an object under the key "user"
-    } else {
-      simdjson_recurse(v, value);
-    }
-  }
-}
-simdjson_really_inline void simdjson_recurse(std::vector<int64_t> & v, simdjson::dom::element element) {
-  simdjson_unused simdjson::error_code error;
-  simdjson::dom::array array;
-  simdjson::dom::object object;
-  if (not (error = element.get(array))) {
-    simdjson_recurse(v, array);
-  } else if (not (error = element.get(object))) {
-    simdjson_recurse(v, object);
-  }
-}
-
-simdjson_really_inline std::vector<int64_t>
-simdjson_just_dom(simdjson::dom::element doc) {
-  std::vector<int64_t> answer;
-  simdjson_recurse(answer, doc);
-  remove_duplicates(answer);
-  return answer;
-}
-
-simdjson_really_inline std::vector<int64_t>
-simdjson_compute_stats(const simdjson::padded_string &p) {
-  std::vector<int64_t> answer;
-  simdjson::dom::parser parser;
-  simdjson::dom::element doc;
-  auto error = parser.parse(p).get(doc);
-  if (!error) {
-    simdjson_recurse(answer, doc);
-    remove_duplicates(answer);
-  }
-  return answer;
-}
-
-simdjson_really_inline simdjson::error_code
-simdjson_just_parse(const simdjson::padded_string &p) {
-  simdjson::dom::parser parser;
-  return parser.parse(p).error();
-}
-
-void sajson_traverse(std::vector<int64_t> &answer, const sajson::value &node) {
-  using namespace sajson;
-  switch (node.get_type()) {
-  case TYPE_ARRAY: {
-    auto length = node.get_length();
-    for (size_t i = 0; i < length; ++i) {
-      sajson_traverse(answer, node.get_array_element(i));
-    }
-    break;
-  }
-  case TYPE_OBJECT: {
-    auto length = node.get_length();
-    // sajson has O(log n) find_object_key, but we still visit each node anyhow
-    // because we need to visit all values.
-    for (auto i = 0u; i < length; ++i) {
-      auto key = node.get_object_key(i); // expected: sajson::string
-      bool found_user =
-          (key.length() == 4) && (memcmp(key.data(), "user", 4) == 0);
-      if (found_user) {                             // found a user!!!
-        auto user_value = node.get_object_value(i); // get the value
-        if (user_value.get_type() ==
-            TYPE_OBJECT) { // the value should be an object
-          // now we know that we only need one value
-          auto user_value_length = user_value.get_length();
-          auto right_index =
-              user_value.find_object_key(sajson::string("id", 2));
-          if (right_index < user_value_length) {
-            auto v = user_value.get_object_value(right_index);
-            if (v.get_type() == TYPE_INTEGER) { // check that it is an integer
-              answer.push_back(v.get_integer_value()); // record it!
-            } else if (v.get_type() == TYPE_DOUBLE) {
-              answer.push_back((int64_t)v.get_double_value()); // record it!
-            }
-          }
-        }
-      }
-      sajson_traverse(answer, node.get_object_value(i));
-    }
-    break;
-  }
-  case TYPE_NULL:
-  case TYPE_FALSE:
-  case TYPE_TRUE:
-  case TYPE_STRING:
-  case TYPE_DOUBLE:
-  case TYPE_INTEGER:
-    break;
-  default:
-    assert(false && "unknown node type");
-  }
-}
-
-simdjson_really_inline std::vector<int64_t>
-sasjon_just_dom(sajson::document &d) {
-  std::vector<int64_t> answer;
-  sajson_traverse(answer, d.get_root());
-  remove_duplicates(answer);
-  return answer;
-}
-
-simdjson_really_inline std::vector<int64_t>
-sasjon_compute_stats(const simdjson::padded_string &p) {
-  std::vector<int64_t> answer;
-  char *buffer = (char *)malloc(p.size());
-  memcpy(buffer, p.data(), p.size());
-  auto d = sajson::parse(sajson::dynamic_allocation(),
-                         sajson::mutable_string_view(p.size(), buffer));
-  if (!d.is_valid()) {
-    free(buffer);
-    return answer;
-  }
-  sajson_traverse(answer, d.get_root());
-  free(buffer);
-  remove_duplicates(answer);
-  return answer;
-}
-
-simdjson_really_inline bool
-sasjon_just_parse(const simdjson::padded_string &p) {
-  char *buffer = (char *)malloc(p.size());
-  memcpy(buffer, p.data(), p.size());
-  auto d = sajson::parse(sajson::dynamic_allocation(),
-                         sajson::mutable_string_view(p.size(), buffer));
-  bool answer = !d.is_valid();
-  free(buffer);
-  return answer;
-}
-
-void rapid_traverse(std::vector<int64_t> &answer, const rapidjson::Value &v) {
-  switch (v.GetType()) {
-  case kObjectType:
-    for (Value::ConstMemberIterator m = v.MemberBegin(); m != v.MemberEnd();
-         ++m) {
-      bool found_user = (m->name.GetStringLength() == 4) &&
-                        (memcmp(m->name.GetString(), "user", 4) == 0);
-      if (found_user) {
-        const rapidjson::Value &child = m->value;
-        if (child.GetType() == kObjectType) {
-          for (Value::ConstMemberIterator k = child.MemberBegin();
-               k != child.MemberEnd(); ++k) {
-            if (equals(k->name.GetString(), "id")) {
-              const rapidjson::Value &val = k->value;
-              if (val.GetType() == kNumberType) {
-                answer.push_back(val.GetInt64());
-              }
-            }
-          }
-        }
-      }
-      rapid_traverse(answer, m->value);
-    }
-    break;
-  case kArrayType:
-    for (Value::ConstValueIterator i = v.Begin(); i != v.End();
-         ++i) { // v.Size();
-      rapid_traverse(answer, *i);
-    }
-    break;
-  case kNullType:
-  case kFalseType:
-  case kTrueType:
-  case kStringType:
-  case kNumberType:
-  default:
-    break;
-  }
-}
-
-simdjson_really_inline std::vector<int64_t>
-rapid_just_dom(rapidjson::Document &d) {
-  std::vector<int64_t> answer;
-  rapid_traverse(answer, d);
-  remove_duplicates(answer);
-  return answer;
-}
-
-simdjson_really_inline std::vector<int64_t>
-rapid_compute_stats(const simdjson::padded_string &p) {
-  std::vector<int64_t> answer;
-  char *buffer = (char *)malloc(p.size() + 1);
-  memcpy(buffer, p.data(), p.size());
-  buffer[p.size()] = '\0';
-  rapidjson::Document d;
-  d.ParseInsitu<kParseValidateEncodingFlag>(buffer);
-  if (d.HasParseError()) {
-    free(buffer);
-    return answer;
-  }
-  rapid_traverse(answer, d);
-  free(buffer);
-  remove_duplicates(answer);
-  return answer;
-}
-
-simdjson_really_inline bool
-rapid_just_parse(const simdjson::padded_string &p) {
-  char *buffer = (char *)malloc(p.size() + 1);
-  memcpy(buffer, p.data(), p.size());
-  buffer[p.size()] = '\0';
-  rapidjson::Document d;
-  d.ParseInsitu<kParseValidateEncodingFlag>(buffer);
-  bool answer = d.HasParseError();
-  free(buffer);
-  return answer;
-}
-
-int main(int argc, char *argv[]) {
-  bool verbose = false;
-  bool just_data = false;
-
-  int c;
-  while ((c = getopt(argc, argv, "vt")) != -1)
-    switch (c) {
-    case 't':
-      just_data = true;
-      break;
-    case 'v':
-      verbose = true;
-      break;
-    default:
-      abort();
-    }
-  if (optind >= argc) {
-    std::cerr
-        << "Using different parsers, we compute the content statistics of "
-           "JSON documents."
-        << std::endl;
-    std::cerr << "Usage: " << argv[0] << " <jsonfile>" << std::endl;
-    std::cerr << "Or " << argv[0] << " -v <jsonfile>" << std::endl;
-    exit(1);
-  }
-  const char *filename = argv[optind];
-  if (optind + 1 < argc) {
-    std::cerr << "warning: ignoring everything after " << argv[optind + 1]
-              << std::endl;
-  }
-  simdjson::padded_string p;
-  auto error = simdjson::padded_string::load(filename).get(p);
-  if (error) {
-    std::cerr << "Could not load the file " << filename << std::endl;
-    return EXIT_FAILURE;
-  }
-  // Gigabyte: https://en.wikipedia.org/wiki/Gigabyte
-  if (verbose) {
-    std::cout << "Input has ";
-    if (p.size() > 1000 * 1000)
-      std::cout << p.size() / (1000 * 1000) << " MB ";
-    else if (p.size() > 1000)
-      std::cout << p.size() / 1000 << " KB ";
-    else
-      std::cout << p.size() << " B ";
-    std::cout << std::endl;
-  }
-  std::vector<int64_t> s1 = simdjson_compute_stats(p);
-  if (verbose) {
-    printf("simdjson: ");
-    print_vec(s1);
-  }
-  std::vector<int64_t> s2 = rapid_compute_stats(p);
-  if (verbose) {
-    printf("rapid:    ");
-    print_vec(s2);
-  }
-  std::vector<int64_t> s3 = sasjon_compute_stats(p);
-  if (verbose) {
-    printf("sasjon:   ");
-    print_vec(s3);
-  }
-  assert(s1 == s2);
-  assert(s1 == s3);
-  size_t size = s1.size();
-
-  int repeat = 500;
-  size_t volume = p.size();
-  if (just_data) {
-    printf(
-        "name cycles_per_byte cycles_per_byte_err  gb_per_s gb_per_s_err \n");
-  }
-  BEST_TIME("simdjson ", simdjson_compute_stats(p).size(), size, , repeat,
-            volume, !just_data);
-  BEST_TIME("rapid  ", rapid_compute_stats(p).size(), size, , repeat, volume,
-            !just_data);
-  BEST_TIME("sasjon  ", sasjon_compute_stats(p).size(), size, , repeat, volume,
-            !just_data);
-  BEST_TIME("simdjson (just parse)  ", simdjson_just_parse(p), simdjson::error_code::SUCCESS, , repeat,
-            volume, !just_data);
-  BEST_TIME("rapid  (just parse) ", rapid_just_parse(p), false, , repeat,
-            volume, !just_data);
-  BEST_TIME("sasjon (just parse) ", sasjon_just_parse(p), false, , repeat,
-            volume, !just_data);
-  simdjson::dom::parser parser;
-  simdjson::dom::element doc;
-  error = parser.parse(p).get(doc);
-  BEST_TIME("simdjson (just dom)  ", simdjson_just_dom(doc).size(), size,
-            , repeat, volume, !just_data);
-  char *buffer = (char *)malloc(p.size() + 1);
-  buffer[p.size()] = '\0';
-  memcpy(buffer, p.data(), p.size());
-  rapidjson::Document drapid;
-  drapid.ParseInsitu<kParseValidateEncodingFlag>(buffer);
-  BEST_TIME("rapid  (just dom) ", rapid_just_dom(drapid).size(), size, , repeat,
-            volume, !just_data);
-  memcpy(buffer, p.data(), p.size());
-  auto dsasjon = sajson::parse(sajson::dynamic_allocation(),
-                               sajson::mutable_string_view(p.size(), buffer));
-  BEST_TIME("sasjon (just dom) ", sasjon_just_dom(dsasjon).size(), size, ,
-            repeat, volume, !just_data);
-  free(buffer);
-}

benchmark/event_counter.h

@@ -1,152 +0,0 @@
-#ifndef __EVENT_COUNTER_H
-#define __EVENT_COUNTER_H
-
-#include <cassert>
-#include <cctype>
-#ifndef _MSC_VER
-#include <dirent.h>
-#endif
-#include <unistd.h>
-#include <cinttypes>
-
-#include <cstdio>
-#include <cstdlib>
-#include <cstring>
-
-#include <algorithm>
-#include <chrono>
-#include <cstring>
-#include <fstream>
-#include <iomanip>
-#include <iostream>
-#include <map>
-#include <set>
-#include <sstream>
-#include <string>
-#include <vector>
-
-#include "linux-perf-events.h"
-#ifdef __linux__
-#include <libgen.h>
-#endif
-
-#include "simdjson.h"
-
-using std::string;
-using std::vector;
-using std::chrono::steady_clock;
-using std::chrono::time_point;
-using std::chrono::duration;
-
-struct event_count {
-  duration<double> elapsed;
-  vector<unsigned long long> event_counts;
-  event_count() : elapsed(0), event_counts{0,0,0,0,0} {}
-  event_count(const duration<double> _elapsed, const vector<unsigned long long> _event_counts) : elapsed(_elapsed), event_counts(_event_counts) {}
-  event_count(const event_count& other): elapsed(other.elapsed), event_counts(other.event_counts) { }
-
-  // The types of counters (so we can read the getter more easily)
-  enum event_counter_types {
-    CPU_CYCLES,
-    INSTRUCTIONS,
-    BRANCH_MISSES,
-    CACHE_REFERENCES,
-    CACHE_MISSES
-  };
-
-  double elapsed_sec() const { return duration<double>(elapsed).count(); }
-  double elapsed_ns() const { return duration<double, std::nano>(elapsed).count(); }
-  double cycles() const { return static_cast<double>(event_counts[CPU_CYCLES]); }
-  double instructions() const { return static_cast<double>(event_counts[INSTRUCTIONS]); }
-  double branch_misses() const { return static_cast<double>(event_counts[BRANCH_MISSES]); }
-  double cache_references() const { return static_cast<double>(event_counts[CACHE_REFERENCES]); }
-  double cache_misses() const { return static_cast<double>(event_counts[CACHE_MISSES]); }
-
-  event_count& operator=(const event_count& other) {
-    this->elapsed = other.elapsed;
-    this->event_counts = other.event_counts;
-    return *this;
-  }
-  event_count operator+(const event_count& other) const {
-    return event_count(elapsed+other.elapsed, {
-      event_counts[0]+other.event_counts[0],
-      event_counts[1]+other.event_counts[1],
-      event_counts[2]+other.event_counts[2],
-      event_counts[3]+other.event_counts[3],
-      event_counts[4]+other.event_counts[4],
-    });
-  }
-
-  void operator+=(const event_count& other) {
-    *this = *this + other;
-  }
-};
-
-struct event_aggregate {
-  int iterations = 0;
-  event_count total{};
-  event_count best{};
-  event_count worst{};
-
-  event_aggregate() {}
-
-  void operator<<(const event_count& other) {
-    if (iterations == 0 || other.elapsed < best.elapsed) {
-      best = other;
-    }
-    if (iterations == 0 || other.elapsed > worst.elapsed) {
-      worst = other;
-    }
-    iterations++;
-    total += other;
-  }
-
-  double elapsed_sec() const { return total.elapsed_sec() / iterations; }
-  double elapsed_ns() const { return total.elapsed_ns() / iterations; }
-  double cycles() const { return total.cycles() / iterations; }
-  double instructions() const { return total.instructions() / iterations; }
-  double branch_misses() const { return total.branch_misses() / iterations; }
-  double cache_references() const { return total.cache_references() / iterations; }
-  double cache_misses() const { return total.cache_misses() / iterations; }
-};
-
-struct event_collector {
-  event_count count{};
-  time_point<steady_clock> start_clock{};
-
-#if defined(__linux__)
-  LinuxEvents<PERF_TYPE_HARDWARE> linux_events;
-  event_collector(bool quiet = false) : linux_events(vector<int>{
-    PERF_COUNT_HW_CPU_CYCLES,
-    PERF_COUNT_HW_INSTRUCTIONS,
-    PERF_COUNT_HW_BRANCH_MISSES,
-    PERF_COUNT_HW_CACHE_REFERENCES,
-    PERF_COUNT_HW_CACHE_MISSES
-  }, quiet) {}
-  bool has_events() {
-    return linux_events.is_working();
-  }
-#else
-  event_collector(simdjson_unused bool _quiet = false) {}
-  bool has_events() {
-    return false;
-  }
-#endif
-
-  simdjson_really_inline void start() {
-#if defined(__linux)
-    linux_events.start();
-#endif
-    start_clock = steady_clock::now();
-  }
-  simdjson_really_inline event_count& end() {
-    time_point<steady_clock> end_clock = steady_clock::now();
-#if defined(__linux)
-    linux_events.end(count.event_counts);
-#endif
-    count.elapsed = end_clock - start_clock;
-    return count;
-  }
-};
-
-#endif

benchmark/get_corpus_benchmark.cpp

@@ -1,57 +0,0 @@
-
-#include "simdjson.h"
-#include <chrono>
-#include <cstring>
-#include <iostream>
-
-// Gigabyte: https://en.wikipedia.org/wiki/Gigabyte
-simdjson_never_inline
-double bench(std::string filename, simdjson::padded_string& p) {
-  std::chrono::time_point<std::chrono::steady_clock> start_clock =
-      std::chrono::steady_clock::now();
-  simdjson::padded_string::load(filename).first.swap(p);
-  std::chrono::time_point<std::chrono::steady_clock> end_clock =
-      std::chrono::steady_clock::now();
-  std::chrono::duration<double> elapsed = end_clock - start_clock;
-  return (static_cast<double>(p.size()) / (1000000000.)) / elapsed.count();
-}
-
-int main(int argc, char *argv[]) {
-  int optind = 1;
-  if (optind >= argc) {
-    std::cerr << "Reads document as far as possible. " << std::endl;
-    std::cerr << "Usage: " << argv[0] << " <jsonfile>" << std::endl;
-    exit(1);
-  }
-  const char *filename = argv[optind];
-  if (optind + 1 < argc) {
-    std::cerr << "warning: ignoring everything after " << argv[optind + 1]
-              << std::endl;
-  }
-  simdjson::padded_string p;
-  bench(filename, p); 
-  double meanval = 0;
-  double maxval = 0;
-  double minval = 10000;
-std::cout << "file size: "<<  (static_cast<double>(p.size()) / (1000000000.)) << " GB" <<std::endl;
-  size_t times = p.size() > 1000000000 ? 5 : 50;
-#if __cpp_exceptions
-  try {
-#endif
-    for(size_t i = 0; i < times; i++) {
-      double tval = bench(filename, p);
-      if(maxval < tval) maxval = tval;
-      if(minval > tval) minval = tval;
-      meanval += tval;
-    }
-#if __cpp_exceptions
-   } catch (const std::exception &) { // caught by reference to base
-    std::cerr << "Could not load the file " << filename << std::endl;
-    return EXIT_FAILURE;
-   }
-#endif
-   std::cout << "average speed: " << meanval / static_cast<double>(times) << " GB/s"<< std::endl;
-   std::cout << "min speed    : " << minval << " GB/s" << std::endl;
-   std::cout << "max speed    : " << maxval << " GB/s" << std::endl;
-   return EXIT_SUCCESS;
-}

benchmark/json_benchmark.h

@@ -1,80 +0,0 @@
-#pragma once
-
-template<typename B, typename R> static void JsonBenchmark(benchmark::State &state, const simdjson::padded_string &json) {
-  event_collector collector(true);
-  event_aggregate events;
-
-  // Warmup and equality check (make sure the data is right!)
-  B bench;
-  if (!bench.Run(json)) { state.SkipWithError("warmup tweet reading failed"); return; }
-  {
-    R reference;
-    if (!reference.Run(json)) { state.SkipWithError("reference tweet reading failed"); return; }
-    if (bench.Result() != reference.Result()) { state.SkipWithError("results are not the same"); return; }
-  }
-
-  // Run the benchmark
-  for (simdjson_unused auto _ : state) {
-    collector.start();
-
-    if (!bench.Run(json)) { state.SkipWithError("tweet reading failed"); return; }
-
-    events << collector.end();
-  }
-
-  state.SetBytesProcessed(json.size() * state.iterations());
-  state.SetItemsProcessed(bench.ItemCount() * state.iterations());
-  state.counters["best_bytes_per_sec"] = benchmark::Counter(double(json.size()) / events.best.elapsed_sec());
-  state.counters["best_items_per_sec"] = benchmark::Counter(double(bench.ItemCount()) / events.best.elapsed_sec());
-
-  state.counters["docs_per_sec"] = benchmark::Counter(1.0, benchmark::Counter::kIsIterationInvariantRate);
-  state.counters["best_docs_per_sec"] = benchmark::Counter(1.0 / events.best.elapsed_sec());
-
-  if (collector.has_events()) {
-    state.counters["instructions"] = events.instructions();
-    state.counters["cycles"]       = events.cycles();
-    state.counters["branch_miss"]  = events.branch_misses();
-    state.counters["cache_miss"]   = events.cache_misses();
-    state.counters["cache_ref"]    = events.cache_references();
-
-    state.counters["instructions_per_byte"]  = events.instructions() / double(json.size());
-    state.counters["instructions_per_cycle"] = events.instructions() / events.cycles();
-    state.counters["cycles_per_byte"]        = events.cycles()       / double(json.size());
-    state.counters["frequency"]              = benchmark::Counter(events.cycles(), benchmark::Counter::kIsIterationInvariantRate);
-
-    state.counters["best_instructions"] = events.best.instructions();
-    state.counters["best_cycles"]       = events.best.cycles();
-    state.counters["best_branch_miss"]  = events.best.branch_misses();
-    state.counters["best_cache_miss"]   = events.best.cache_misses();
-    state.counters["best_cache_ref"]    = events.best.cache_references();
-
-    state.counters["best_instructions_per_byte"]  = events.best.instructions() / double(json.size());
-    state.counters["best_instructions_per_cycle"] = events.best.instructions() / events.best.cycles();
-    state.counters["best_cycles_per_byte"]        = events.best.cycles()       / double(json.size());
-    state.counters["best_frequency"]              = events.best.cycles()       / events.best.elapsed_sec();
-  }
-  state.counters["bytes"] = benchmark::Counter(double(json.size()));
-  state.counters["items"] = benchmark::Counter(double(bench.ItemCount()));
-
-  // Build the label
-  using namespace std;
-  stringstream label;
-  label << fixed << setprecision(2);
-  label << "[best:";
-  label << " throughput="     << setw(6)  << (double(json.size()) / 1000000000.0     / events.best.elapsed_sec()) << " GB/s";
-  label << " doc_throughput=" << setw(6)  << uint64_t(1.0                            / events.best.elapsed_sec()) << " docs/s";
-
-  if (collector.has_events()) {
-    label << " instructions=" << setw(12) << uint64_t(events.best.instructions())     << setw(0);
-    label << " cycles="       << setw(12) << uint64_t(events.best.cycles())           << setw(0);
-    label << " branch_miss="  << setw(8)  << uint64_t(events.best.branch_misses())    << setw(0);
-    label << " cache_miss="   << setw(8)  << uint64_t(events.best.cache_misses())     << setw(0);
-    label << " cache_ref="    << setw(10) << uint64_t(events.best.cache_references()) << setw(0);
-  }
-
-  label << " items=" << setw(10) << bench.ItemCount() << setw(0);
-  label << " avg_time=" << setw(10) << uint64_t(events.elapsed_ns()) << setw(0) << " ns";
-  label << "]";
-
-  state.SetLabel(label.str());
-}

benchmark/kostya/dom.h

@@ -1,69 +0,0 @@
-#pragma once
-
-#if SIMDJSON_EXCEPTIONS
-
-#include "kostya.h"
-
-namespace kostya {
-
-using namespace simdjson;
-
-class Dom {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-
-  simdjson_really_inline const std::vector<my_point> &Result() { return container; }
-  simdjson_really_inline size_t ItemCount() { return container.size(); }
-
-private:
-  dom::parser parser{};
-  std::vector<my_point> container{};
-};
-
-simdjson_really_inline bool Dom::Run(const padded_string &json) {
-  container.clear();
-
-  for (auto point : parser.parse(json)["coordinates"]) {
-    container.emplace_back(my_point{point["x"], point["y"], point["z"]});
-  }
-
-  return true;
-}
-
-BENCHMARK_TEMPLATE(Kostya, Dom);
-
-namespace sum {
-
-class Dom {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-
-  simdjson_really_inline my_point &Result() { return sum; }
-  simdjson_really_inline size_t ItemCount() { return count; }
-
-private:
-  dom::parser parser{};
-  my_point sum{};
-  size_t count{};
-};
-
-simdjson_really_inline bool Dom::Run(const padded_string &json) {
-  sum = { 0, 0, 0 };
-  count = 0;
-
-  for (auto coord : parser.parse(json)["coordinates"]) {
-    sum.x += double(coord["x"]);
-    sum.y += double(coord["y"]);
-    sum.z += double(coord["z"]);
-    count++;
-  }
-
-  return true;
-}
-
-BENCHMARK_TEMPLATE(KostyaSum, Dom);
-
-} // namespace sum
-} // namespace kostya
-
-#endif // SIMDJSON_EXCEPTIONS

benchmark/kostya/iter.h

@@ -1,96 +0,0 @@
-#pragma once
-
-#if SIMDJSON_EXCEPTIONS
-
-#include "kostya.h"
-
-namespace kostya {
-
-using namespace simdjson;
-using namespace simdjson::builtin;
-
-class Iter {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-
-  simdjson_really_inline const std::vector<my_point> &Result() { return container; }
-  simdjson_really_inline size_t ItemCount() { return container.size(); }
-
-private:
-  ondemand::parser parser{};
-  std::vector<my_point> container{};
-
-  simdjson_really_inline simdjson_result<double> first_double(ondemand::json_iterator &iter, const char *key) {
-    if (!iter.start_object() || ondemand::raw_json_string(iter.field_key()) != key || iter.field_value()) { throw "Invalid field"; }
-    return iter.consume_double();
-  }
-
-  simdjson_really_inline simdjson_result<double> next_double(ondemand::json_iterator &iter, const char *key) {
-    if (!iter.has_next_field() || ondemand::raw_json_string(iter.field_key()) != key || iter.field_value()) { throw "Invalid field"; }
-    return iter.consume_double();
-  }
-
-};
-
-simdjson_really_inline bool Iter::Run(const padded_string &json) {
-  container.clear();
-
-  using std::cerr;
-  using std::endl;
-  auto iter = parser.iterate_raw(json).value();
-  if (!iter.start_object() || !iter.find_field_raw("coordinates")) { cerr << "find coordinates field failed" << endl; return false; }
-  if (iter.start_array()) {
-    do {
-      container.emplace_back(my_point{first_double(iter, "x"), next_double(iter, "y"), next_double(iter, "z")});
-      if (iter.skip_container()) { return false; } // Skip the rest of the coordinates object
-    } while (iter.has_next_element());
-  }
-
-  return true;
-}
-
-BENCHMARK_TEMPLATE(Kostya, Iter);
-
-
-namespace sum {
-
-class Iter {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-
-  simdjson_really_inline my_point &Result() { return sum; }
-  simdjson_really_inline size_t ItemCount() { return count; }
-
-private:
-  ondemand::parser parser{};
-  my_point sum{};
-  size_t count{};
-};
-
-simdjson_really_inline bool Iter::Run(const padded_string &json) {
-  sum = {0,0,0};
-  count = 0;
-
-  auto iter = parser.iterate_raw(json).value();
-  if (!iter.start_object() || !iter.find_field_raw("coordinates")) { return false; }
-  if (!iter.start_array()) { return false; }
-  do {
-    if (!iter.start_object()   || !iter.find_field_raw("x")) { return false; }
-    sum.x += iter.consume_double();
-    if (!iter.has_next_field() || !iter.find_field_raw("y")) { return false; }
-    sum.y +=  iter.consume_double();
-    if (!iter.has_next_field() || !iter.find_field_raw("z")) { return false; }
-    sum.z +=  iter.consume_double();
-    if (iter.skip_container()) { return false; } // Skip the rest of the coordinates object
-    count++;
-  } while (iter.has_next_element());
-
-  return true;
-}
-
-BENCHMARK_TEMPLATE(KostyaSum, Iter);
-
-} // namespace sum
-} // namespace kostya
-
-#endif // SIMDJSON_EXCEPTIONS

benchmark/kostya/kostya.h

@@ -1,95 +0,0 @@
-#pragma once
-
-#if SIMDJSON_EXCEPTIONS
-
-//
-// Interface
-//
-
-namespace kostya {
-template<typename T> static void Kostya(benchmark::State &state);
-namespace sum {
-template<typename T> static void KostyaSum(benchmark::State &state);
-}
-
-using namespace simdjson;
-
-static void append_coordinate(std::default_random_engine &e, std::uniform_real_distribution<> &dis, std::stringstream &myss) {
-  using std::endl;
-  myss << R"(        {)" << endl;
-  myss << R"(            "x": )" << dis(e) << "," << endl;
-  myss << R"(            "y": )" << dis(e) << "," << endl;
-  myss << R"(            "z": )" << dis(e) << "," << endl;
-  myss << R"(            "name": ")" << char('a'+dis(e)*25) << char('a'+dis(e)*25) << char('a'+dis(e)*25) << char('a'+dis(e)*25) << char('a'+dis(e)*25) << char('a'+dis(e)*25) << " " << int(dis(e)*10000) << "\"," << endl;
-  myss << R"(            "opts": {)" << endl;
-  myss << R"(                "1": [)" << endl;
-  myss << R"(                    1,)" << endl;
-  myss << R"(                    true)" << endl;
-  myss << R"(                ])" << endl;
-  myss << R"(            })" << endl;
-  myss << R"(        })";
-}
-
-static std::string build_json_array(size_t N) {
-  using namespace std;
-  default_random_engine e;
-  uniform_real_distribution<> dis(0, 1);
-  stringstream myss;
-  myss << R"({)" << endl;
-  myss << R"(    "coordinates": [)" << endl;
-  for (size_t i=1; i<N; i++) {
-    append_coordinate(e, dis, myss); myss << "," << endl;
-  }
-  append_coordinate(e, dis, myss); myss << endl;
-  myss << R"(    ],)" << endl;
-  myss << R"(    "info": "some info")" << endl;
-  myss << R"(})" << endl;
-  string answer = myss.str();
-  cout << "Creating a source file spanning " << (answer.size() + 512) / 1024 << " KB " << endl;  
-  return answer;
-}
-
-static const padded_string &get_built_json_array() {
-  static padded_string json = build_json_array(524288);
-  return json;
-}
-
-struct my_point {
-  double x;
-  double y;
-  double z;
-  simdjson_really_inline bool operator==(const my_point &other) const {
-    return x == other.x && y == other.y && z == other.z;
-  }
-  simdjson_really_inline bool operator!=(const my_point &other) const { return !(*this == other); }
-};
-
-simdjson_unused static std::ostream &operator<<(std::ostream &o, const my_point &p) {
-  return o << p.x << "," << p.y << "," << p.z << std::endl;
-}
-
-} // namespace kostya
-
-//
-// Implementation
-//
-#include <vector>
-#include "event_counter.h"
-#include "dom.h"
-#include "json_benchmark.h"
-
-namespace kostya {
-
-template<typename T> static void Kostya(benchmark::State &state) {
-  JsonBenchmark<T, Dom>(state, get_built_json_array());
-}
-
-namespace sum {
-template<typename T> static void KostyaSum(benchmark::State &state) {
-  JsonBenchmark<T, Dom>(state, get_built_json_array());
-}
-}
-
-} // namespace kostya
-
-#endif // SIMDJSON_EXCEPTIONS

benchmark/kostya/ondemand.h

@@ -1,74 +0,0 @@
-#pragma once
-
-#if SIMDJSON_EXCEPTIONS
-
-#include "kostya.h"
-
-namespace kostya {
-
-using namespace simdjson;
-using namespace simdjson::builtin;
-
-class OnDemand {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-  simdjson_really_inline const std::vector<my_point> &Result() { return container; }
-  simdjson_really_inline size_t ItemCount() { return container.size(); }
-
-private:
-  ondemand::parser parser{};
-  std::vector<my_point> container{};
-};
-
-simdjson_really_inline bool OnDemand::Run(const padded_string &json) {
-  container.clear();
-
-  using std::cout;
-  using std::endl;
-
-  auto doc = parser.iterate(json);
-  for (ondemand::object coord : doc["coordinates"]) {
-    container.emplace_back(my_point{coord["x"], coord["y"], coord["z"]});
-  }
-
-  return true;
-}
-
-BENCHMARK_TEMPLATE(Kostya, OnDemand);
-
-
-namespace sum {
-
-class OnDemand {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-  simdjson_really_inline my_point &Result() { return sum; }
-  simdjson_really_inline size_t ItemCount() { return count; }
-
-private:
-  ondemand::parser parser{};
-  my_point sum{};
-  size_t count{};
-};
-
-simdjson_really_inline bool OnDemand::Run(const padded_string &json) {
-  sum = {0,0,0};
-  count = 0;
-
-  auto doc = parser.iterate(json);
-  for (ondemand::object coord : doc["coordinates"]) {
-    sum.x += double(coord["x"]);
-    sum.y += double(coord["y"]);
-    sum.z += double(coord["z"]);
-    count++;
-  }
-
-  return true;
-}
-
-BENCHMARK_TEMPLATE(KostyaSum, OnDemand);
-
-} // namespace sum
-} // namespace kostya
-
-#endif // SIMDJSON_EXCEPTIONS

benchmark/largerandom/dom.h

@@ -1,69 +0,0 @@
-#pragma once
-
-#if SIMDJSON_EXCEPTIONS
-
-#include "largerandom.h"
-
-namespace largerandom {
-
-using namespace simdjson;
-
-class Dom {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-
-  simdjson_really_inline const std::vector<my_point> &Result() { return container; }
-  simdjson_really_inline size_t ItemCount() { return container.size(); }
-
-private:
-  dom::parser parser{};
-  std::vector<my_point> container{};
-};
-
-simdjson_really_inline bool Dom::Run(const padded_string &json) {
-  container.clear();
-
-  for (auto point : parser.parse(json)) {
-    container.emplace_back(my_point{point["x"], point["y"], point["z"]});
-  }
-
-  return true;
-}
-
-BENCHMARK_TEMPLATE(LargeRandom, Dom);
-
-namespace sum {
-
-class Dom {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-
-  simdjson_really_inline my_point &Result() { return sum; }
-  simdjson_really_inline size_t ItemCount() { return count; }
-
-private:
-  dom::parser parser{};
-  my_point sum{};
-  size_t count{};
-};
-
-simdjson_really_inline bool Dom::Run(const padded_string &json) {
-  sum = { 0, 0, 0 };
-  count = 0;
-
-  for (auto coord : parser.parse(json)) {
-    sum.x += double(coord["x"]);
-    sum.y += double(coord["y"]);
-    sum.z += double(coord["z"]);
-    count++;
-  }
-
-  return true;
-}
-
-BENCHMARK_TEMPLATE(LargeRandomSum, Dom);
-
-} // namespace sum
-} // namespace largerandom
-
-#endif // SIMDJSON_EXCEPTIONS

benchmark/largerandom/iter.h

@@ -1,92 +0,0 @@
-#pragma once
-
-#if SIMDJSON_EXCEPTIONS
-
-#include "largerandom.h"
-
-namespace largerandom {
-
-using namespace simdjson;
-using namespace simdjson::builtin;
-
-class Iter {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-
-  simdjson_really_inline const std::vector<my_point> &Result() { return container; }
-  simdjson_really_inline size_t ItemCount() { return container.size(); }
-
-private:
-  ondemand::parser parser{};
-  std::vector<my_point> container{};
-
-  simdjson_really_inline double first_double(ondemand::json_iterator &iter) {
-    if (iter.start_object().error() || iter.field_key().error() || iter.field_value()) { throw "Invalid field"; }
-    return iter.consume_double();
-  }
-
-  simdjson_really_inline double next_double(ondemand::json_iterator &iter) {
-    if (!iter.has_next_field() || iter.field_key().error() || iter.field_value()) { throw "Invalid field"; }
-    return iter.consume_double();
-  }
-
-};
-
-simdjson_really_inline bool Iter::Run(const padded_string &json) {
-  container.clear();
-
-  auto iter = parser.iterate_raw(json).value();
-  if (iter.start_array()) {
-    do {
-      container.emplace_back(my_point{first_double(iter), next_double(iter), next_double(iter)});
-      if (iter.has_next_field()) { throw "Too many fields"; }
-    } while (iter.has_next_element());
-  }
-
-  return true;
-}
-
-BENCHMARK_TEMPLATE(LargeRandom, Iter);
-
-
-namespace sum {
-
-class Iter {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-
-  simdjson_really_inline my_point &Result() { return sum; }
-  simdjson_really_inline size_t ItemCount() { return count; }
-
-private:
-  ondemand::parser parser{};
-  my_point sum{};
-  size_t count{};
-};
-
-simdjson_really_inline bool Iter::Run(const padded_string &json) {
-  sum = {0,0,0};
-  count = 0;
-
-  auto iter = parser.iterate_raw(json).value();
-  if (!iter.start_array()) { return false; }
-  do {
-    if (!iter.start_object()   || iter.field_key().value() != "x" || iter.field_value()) { return false; }
-    sum.x += iter.consume_double();
-    if (!iter.has_next_field() || iter.field_key().value() != "y" || iter.field_value()) { return false; }
-    sum.y +=  iter.consume_double();
-    if (!iter.has_next_field() || iter.field_key().value() != "z" || iter.field_value()) { return false; }
-    sum.z +=  iter.consume_double();
-    if (*iter.advance() != '}') { return false; }
-    count++;
-  } while (iter.has_next_element());
-
-  return true;
-}
-
-BENCHMARK_TEMPLATE(LargeRandomSum, Iter);
-
-} // namespace sum
-} // namespace largerandom
-
-#endif // SIMDJSON_EXCEPTIONS

benchmark/largerandom/largerandom.h

@@ -1,80 +0,0 @@
-#pragma once
-
-#if SIMDJSON_EXCEPTIONS
-
-//
-// Interface
-//
-
-namespace largerandom {
-template<typename T> static void LargeRandom(benchmark::State &state);
-namespace sum {
-template<typename T> static void LargeRandomSum(benchmark::State &state);
-}
-
-using namespace simdjson;
-
-static std::string build_json_array(size_t N) {
-  std::default_random_engine e;
-  std::uniform_real_distribution<> dis(0, 1);
-  std::stringstream myss;
-  myss << "[" << std::endl;
-  if(N > 0) {
-    myss << "{ \"x\":" << dis(e) << ",  \"y\":" << dis(e) << ", \"z\":" << dis(e) << "}" << std::endl;
-  }
-  for(size_t i = 1; i < N; i++) {
-    myss << "," << std::endl;
-    myss << "{ \"x\":" << dis(e) << ",  \"y\":" << dis(e) << ", \"z\":" << dis(e) << "}";
-  }
-  myss << std::endl;
-  myss << "]" << std::endl;
-  std::string answer = myss.str();
-  std::cout << "Creating a source file spanning " << (answer.size() + 512) / 1024 << " KB " << std::endl;  
-  return answer;
-}
-
-static const padded_string &get_built_json_array() {
-  static padded_string json = build_json_array(1000000);
-  return json;
-}
-
-struct my_point {
-  double x;
-  double y;
-  double z;
-  simdjson_really_inline bool operator==(const my_point &other) const {
-    return x == other.x && y == other.y && z == other.z;
-  }
-  simdjson_really_inline bool operator!=(const my_point &other) const { return !(*this == other); }
-};
-
-simdjson_unused static std::ostream &operator<<(std::ostream &o, const my_point &p) {
-  return o << p.x << "," << p.y << "," << p.z << std::endl;
-}
-
-} // namespace largerandom
-
-//
-// Implementation
-//
-#include <vector>
-#include "event_counter.h"
-#include "dom.h"
-#include "json_benchmark.h"
-
-namespace largerandom {
-
-template<typename T> static void LargeRandom(benchmark::State &state) {
-  JsonBenchmark<T, Dom>(state, get_built_json_array());
-}
-
-namespace sum {
-
-template<typename T> static void LargeRandomSum(benchmark::State &state) {
-  JsonBenchmark<T, Dom>(state, get_built_json_array());
-}
-
-}
-} // namespace largerandom
-
-#endif // SIMDJSON_EXCEPTIONS

benchmark/largerandom/ondemand.h

@@ -1,71 +0,0 @@
-#pragma once
-
-#if SIMDJSON_EXCEPTIONS
-
-#include "largerandom.h"
-
-namespace largerandom {
-
-using namespace simdjson;
-using namespace simdjson::builtin;
-
-class OnDemand {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-  simdjson_really_inline const std::vector<my_point> &Result() { return container; }
-  simdjson_really_inline size_t ItemCount() { return container.size(); }
-
-private:
-  ondemand::parser parser{};
-  std::vector<my_point> container{};
-};
-
-simdjson_really_inline bool OnDemand::Run(const padded_string &json) {
-  container.clear();
-
-  auto doc = parser.iterate(json);
-  for (ondemand::object coord : doc) {
-    container.emplace_back(my_point{coord["x"], coord["y"], coord["z"]});
-  }
-
-  return true;
-}
-
-BENCHMARK_TEMPLATE(LargeRandom, OnDemand);
-
-
-namespace sum {
-
-class OnDemand {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-  simdjson_really_inline my_point &Result() { return sum; }
-  simdjson_really_inline size_t ItemCount() { return count; }
-
-private:
-  ondemand::parser parser{};
-  my_point sum{};
-  size_t count{};
-};
-
-simdjson_really_inline bool OnDemand::Run(const padded_string &json) {
-  sum = {0,0,0};
-  count = 0;
-
-  auto doc = parser.iterate(json);
-  for (ondemand::object coord : doc.get_array()) {
-    sum.x += double(coord["x"]);
-    sum.y += double(coord["y"]);
-    sum.z += double(coord["z"]);
-    count++;
-  }
-
-  return true;
-}
-
-BENCHMARK_TEMPLATE(LargeRandomSum, OnDemand);
-
-} // namespace sum
-} // namespace largerandom
-
-#endif // SIMDJSON_EXCEPTIONS

benchmark/largerandom/sax.h

@@ -1,121 +0,0 @@
-#pragma once
-
-#if SIMDJSON_EXCEPTIONS
-
-#include "largerandom.h"
-
-namespace largerandom {
-
-using namespace simdjson;
-using namespace simdjson::builtin;
-using namespace simdjson::builtin::stage2;
-
-class Sax {
-public:
-  simdjson_really_inline bool Run(const padded_string &json) noexcept;
-
-  simdjson_really_inline const std::vector<my_point> &Result() { return container; }
-  simdjson_really_inline size_t ItemCount() { return container.size(); }
-
-private:
-  simdjson_really_inline error_code RunNoExcept(const padded_string &json) noexcept;
-  error_code Allocate(size_t new_capacity);
-  std::unique_ptr<uint8_t[]> string_buf{};
-  size_t capacity{};
-  dom_parser_implementation dom_parser{};
-  std::vector<my_point> container{};
-};
-
-struct sax_point_reader_visitor {
-public:
-  std::vector<my_point> &points;
-  enum {GOT_X=0, GOT_Y=1, GOT_Z=2, GOT_SOMETHING_ELSE=4};
-  size_t idx{GOT_SOMETHING_ELSE};
-  double buffer[3]={};
-
-  explicit sax_point_reader_visitor(std::vector<my_point> &_points) : points(_points) {}
-
-  simdjson_really_inline error_code visit_object_start(json_iterator &) {
-    idx = 0;
-    return SUCCESS;
-  }
-  simdjson_really_inline error_code visit_primitive(json_iterator &, const uint8_t *value) {
-    if(idx == GOT_SOMETHING_ELSE) { return simdjson::SUCCESS; }
-    return numberparsing::parse_double(value).get(buffer[idx]);
-  }
-  simdjson_really_inline error_code visit_object_end(json_iterator &)  {
-    points.emplace_back(my_point{buffer[0], buffer[1], buffer[2]});
-    return SUCCESS;
-  }
-
-  simdjson_really_inline error_code visit_document_start(json_iterator &) { return SUCCESS; }
-  simdjson_really_inline error_code visit_key(json_iterator &, const uint8_t * key) {
-    switch(key[1]) {
-      // Technically, we should check the other characters
-      // in the key, but we are cheating to go as fast 
-      // as possible.
-      case 'x':
-        idx = GOT_X;
-        break;
-      case 'y':
-        idx = GOT_Y;
-        break;
-      case 'z':
-        idx = GOT_Z;
-        break; 
-      default:
-        idx = GOT_SOMETHING_ELSE; 
-    }
-    return SUCCESS; 
-  }
-  simdjson_really_inline error_code visit_array_start(json_iterator &)  { return SUCCESS; }
-  simdjson_really_inline error_code visit_array_end(json_iterator &) { return SUCCESS; }
-  simdjson_really_inline error_code visit_document_end(json_iterator &)  { return SUCCESS; }
-  simdjson_really_inline error_code visit_empty_array(json_iterator &)  { return SUCCESS; }
-  simdjson_really_inline error_code visit_empty_object(json_iterator &)  { return SUCCESS; }
-  simdjson_really_inline error_code visit_root_primitive(json_iterator &, const uint8_t *)  { return SUCCESS; }
-  simdjson_really_inline error_code increment_count(json_iterator &) { return SUCCESS; }
-};
-
-// NOTE: this assumes the dom_parser is already allocated
-bool Sax::Run(const padded_string &json) noexcept {
-  auto error = RunNoExcept(json);
-  if (error) { std::cerr << error << std::endl; return false; }
-  return true;
-}
-
-error_code Sax::RunNoExcept(const padded_string &json) noexcept {
-  container.clear();
-
-  // Allocate capacity if needed
-  if (capacity < json.size()) {
-    SIMDJSON_TRY( Allocate(json.size()) );
-  }
-
-  // Run stage 1 first.
-  SIMDJSON_TRY( dom_parser.stage1(json.u8data(), json.size(), false) );
-
-  // Then walk the document, parsing the tweets as we go
-  json_iterator iter(dom_parser, 0);
-  sax_point_reader_visitor visitor(container);
-  SIMDJSON_TRY( iter.walk_document<false>(visitor) );
-  return SUCCESS;
-}
-
-error_code Sax::Allocate(size_t new_capacity) {
-  // string_capacity copied from document::allocate
-  size_t string_capacity = SIMDJSON_ROUNDUP_N(5 * new_capacity / 3 + SIMDJSON_PADDING, 64);
-  string_buf.reset(new (std::nothrow) uint8_t[string_capacity]);
-  if (auto error = dom_parser.set_capacity(new_capacity)) { return error; }
-  if (capacity == 0) { // set max depth the first time only
-    if (auto error = dom_parser.set_max_depth(DEFAULT_MAX_DEPTH)) { return error; }
-  }
-  capacity = new_capacity;
-  return SUCCESS;
-}
-
-BENCHMARK_TEMPLATE(LargeRandom, Sax);
-
-} // namespace largerandom
-
-#endif // SIMDJSON_EXCEPTIONS

benchmark/linux/linux-perf-events.h

@@ -1,113 +0,0 @@
-// https://github.com/WojciechMula/toys/blob/master/000helpers/linux-perf-events.h
-#pragma once
-#ifdef __linux__
-#ifdef __has_include
-#if __has_include(<asm/unistd.h>)
-#include <asm/unistd.h>       // for __NR_perf_event_open
-#else
-#warning "Header asm/unistd.h cannot be found though it is a linux system. Are linux headers missing?"
-#endif
-#else // no __has_include
-// Please insure that linux headers have been installed.
-#include <asm/unistd.h>       // for __NR_perf_event_open
-#endif 
-#include <linux/perf_event.h> // for perf event constants
-#include <sys/ioctl.h>        // for ioctl
-#include <unistd.h>           // for syscall
-
-#include <cerrno>  // for errno
-#include <cstring> // for std::memset
-#include <stdexcept>
-
-#include <iostream>
-#include <vector>
-
-template <int TYPE = PERF_TYPE_HARDWARE> class LinuxEvents {
-  int fd;
-  bool working;
-  perf_event_attr attribs{};
-  size_t num_events{};
-  std::vector<uint64_t> temp_result_vec{};
-  std::vector<uint64_t> ids{};
-  bool quiet;
-
-public:
-  explicit LinuxEvents(std::vector<int> config_vec, bool _quiet=false) : fd(0), working(true), quiet{_quiet} {
-    std::memset(&attribs, 0, sizeof(attribs));
-    attribs.type = TYPE;
-    attribs.size = sizeof(attribs);
-    attribs.disabled = 1;
-    attribs.exclude_kernel = 1;
-    attribs.exclude_hv = 1;
-
-    attribs.sample_period = 0;
-    attribs.read_format = PERF_FORMAT_GROUP | PERF_FORMAT_ID;
-    const int pid = 0;  // the current process
-    const int cpu = -1; // all CPUs
-    const unsigned long flags = 0;
-
-    int group = -1; // no group
-    num_events = config_vec.size();
-    ids.resize(config_vec.size());
-    uint32_t i = 0;
-    for (auto config : config_vec) {
-      attribs.config = config;
-      fd = static_cast<int>(syscall(__NR_perf_event_open, &attribs, pid, cpu, group, flags));
-      if (fd == -1) {
-        report_error("perf_event_open");
-      }
-      ioctl(fd, PERF_EVENT_IOC_ID, &ids[i++]);
-      if (group == -1) {
-        group = fd;
-      }
-    }
-
-    temp_result_vec.resize(num_events * 2 + 1);
-  }
-
-  ~LinuxEvents() { if (fd != -1) { close(fd); } }
-
-  inline void start() {
-    if (fd != -1) {
-      if (ioctl(fd, PERF_EVENT_IOC_RESET, PERF_IOC_FLAG_GROUP) == -1) {
-        report_error("ioctl(PERF_EVENT_IOC_RESET)");
-      }
-
-      if (ioctl(fd, PERF_EVENT_IOC_ENABLE, PERF_IOC_FLAG_GROUP) == -1) {
-        report_error("ioctl(PERF_EVENT_IOC_ENABLE)");
-      }
-    }
-  }
-
-  inline void end(std::vector<unsigned long long> &results) {
-    if (fd != -1) {
-      if (ioctl(fd, PERF_EVENT_IOC_DISABLE, PERF_IOC_FLAG_GROUP) == -1) {
-        report_error("ioctl(PERF_EVENT_IOC_DISABLE)");
-      }
-
-      if (read(fd, temp_result_vec.data(), temp_result_vec.size() * 8) == -1) {
-        report_error("read");
-      }
-    }
-    // our actual results are in slots 1,3,5, ... of this structure
-    // we really should be checking our ids obtained earlier to be safe
-    for (uint32_t i = 1; i < temp_result_vec.size(); i += 2) {
-      results[i / 2] = temp_result_vec[i];
-    }
-  }
-
-  bool is_working() {
-    return working;
-  }
-
-private:
-  void report_error(const std::string &context) {
-    if (!quiet) {
-      if (working) {
-        std::cerr << (context + ": " + std::string(strerror(errno))) << std::endl;
-      }
-    }
-    working = false;
-  }
-};
-#endif

benchmark/minifiercompetition.cpp

@@ -1,196 +0,0 @@
-#include <iostream>
-#include <unistd.h>
-
-#include "benchmark.h"
-#include "simdjson.h"
-
-SIMDJSON_PUSH_DISABLE_ALL_WARNINGS
-
-// #define RAPIDJSON_SSE2 // bad
-// #define RAPIDJSON_SSE42 // bad
-#include "rapidjson/document.h"
-#include "rapidjson/reader.h" // you have to check in the submodule
-#include "rapidjson/stringbuffer.h"
-#include "rapidjson/writer.h"
-#include "sajson.h"
-
-SIMDJSON_POP_DISABLE_WARNINGS
-
-using namespace rapidjson;
-using namespace simdjson;
-
-std::string rapid_stringme_insitu(char *json) {
-  Document d;
-  d.ParseInsitu(json);
-  if (d.HasParseError()) {
-    std::cerr << "problem!" << std::endl;
-    return ""; // should do something
-  }
-  StringBuffer buffer;
-  Writer<StringBuffer> writer(buffer);
-  d.Accept(writer);
-  return buffer.GetString();
-}
-
-std::string rapid_stringme(char *json) {
-  Document d;
-  d.Parse(json);
-  if (d.HasParseError()) {
-    std::cerr << "problem!" << std::endl;
-    return ""; // should do something
-  }
-  StringBuffer buffer;
-  Writer<StringBuffer> writer(buffer);
-  d.Accept(writer);
-  return buffer.GetString();
-}
-
-std::string simdjson_stringme(simdjson::padded_string & json) {
-  std::stringstream ss;
-  dom::parser parser;
-  dom::element doc;
-  auto error = parser.parse(json).get(doc);
-  if (error) { std::cerr << error << std::endl; abort(); }
-  ss << simdjson::minify(doc);
-  return ss.str();
-}
-
-
-int main(int argc, char *argv[]) {
-  int c;
-  bool verbose = false;
-  bool just_data = false;
-
-  while ((c = getopt(argc, argv, "vt")) != -1)
-    switch (c) {
-    case 't':
-      just_data = true;
-      break;
-    case 'v':
-      verbose = true;
-      break;
-    default:
-      abort();
-    }
-  if (optind >= argc) {
-    std::cerr << "Usage: " << argv[0] << " <jsonfile>" << std::endl;
-    exit(1);
-  }
-  const char *filename = argv[optind];
-  simdjson::padded_string p;
-  auto error = simdjson::padded_string::load(filename).get(p);
-  if (error) {
-    std::cerr << "Could not load the file " << filename << std::endl;
-    return EXIT_FAILURE;
-  }
-  // Gigabyte: https://en.wikipedia.org/wiki/Gigabyte
-  if (verbose) {
-    std::cout << "Input has ";
-    if (p.size() > 1000 * 1000)
-      std::cout << p.size() / (1000 * 1000) << " MB ";
-    else if (p.size() > 1000)
-      std::cout << p.size() / 1000 << " KB ";
-    else
-      std::cout << p.size() << " B ";
-    std::cout << std::endl;
-  }
-  char *buffer = simdjson::internal::allocate_padded_buffer(p.size() + 1);
-  if(buffer == nullptr) {
-    std::cerr << "Out of memory!" << std::endl;
-    abort();
-  }
-  memcpy(buffer, p.data(), p.size());
-  buffer[p.size()] = '\0';
-
-  int repeat = 50;
-  size_t volume = p.size();
-  if (just_data) {
-    printf(
-        "name cycles_per_byte cycles_per_byte_err  gb_per_s gb_per_s_err \n");
-  }
-  size_t strlength = rapid_stringme((char *)p.data()).size();
-  if (verbose)
-    std::cout << "input length is " << p.size() << " stringified length is "
-              << strlength << std::endl;
-  BEST_TIME_NOCHECK("despacing with RapidJSON",
-                    rapid_stringme((char *)p.data()), , repeat, volume,
-                    !just_data);
-  BEST_TIME_NOCHECK(
-      "despacing with RapidJSON Insitu", rapid_stringme_insitu((char *)buffer),
-      memcpy(buffer, p.data(), p.size()), repeat, volume, !just_data);
-
-  BEST_TIME_NOCHECK(
-      "despacing with std::minify", simdjson_stringme(p),, repeat, volume, !just_data);
-
-      
-  memcpy(buffer, p.data(), p.size());
-  size_t outlength;
-  uint8_t *cbuffer = (uint8_t *)buffer;
-  for (auto imple : simdjson::available_implementations) {
-    if(imple->supported_by_runtime_system()) {
-      BEST_TIME((std::string("simdjson->minify+")+imple->name()).c_str(), (imple->minify(cbuffer, p.size(), cbuffer, outlength) == simdjson::SUCCESS ? outlength : -1),
-            outlength, memcpy(buffer, p.data(), p.size()), repeat, volume,
-            !just_data);
-    }
-  }
-
-  printf("minisize = %zu, original size = %zu  (minified down to %.2f percent "
-         "of original) \n",
-         outlength, p.size(), static_cast<double>(outlength) * 100.0 / static_cast<double>(p.size()));
-
-  /***
-   * Is it worth it to minify before parsing?
-   ***/
-  rapidjson::Document d;
-  BEST_TIME("RapidJSON Insitu orig", d.ParseInsitu(buffer).HasParseError(),
-            false, memcpy(buffer, p.data(), p.size()), repeat, volume,
-            !just_data);
-
-  char *mini_buffer = simdjson::internal::allocate_padded_buffer(p.size() + 1);
-  if(mini_buffer == nullptr) {
-    std::cerr << "Out of memory" << std::endl;
-    abort();
-  }
-  size_t minisize;
-  auto minierror = minify(p.data(), p.size(),mini_buffer, minisize);
-  if (!minierror) { std::cerr << minierror << std::endl; exit(1); }
-  mini_buffer[minisize] = '\0';
-
-  BEST_TIME("RapidJSON Insitu despaced", d.ParseInsitu(buffer).HasParseError(),
-            false, memcpy(buffer, mini_buffer, p.size()), repeat, volume,
-            !just_data);
-
-  size_t ast_buffer_size = p.size() * 2;
-  size_t *ast_buffer = (size_t *)malloc(ast_buffer_size * sizeof(size_t));
-
-  BEST_TIME(
-      "sajson orig",
-      sajson::parse(sajson::bounded_allocation(ast_buffer, ast_buffer_size),
-                    sajson::mutable_string_view(p.size(), buffer))
-          .is_valid(),
-      true, memcpy(buffer, p.data(), p.size()), repeat, volume, !just_data);
-
-  BEST_TIME(
-      "sajson despaced",
-      sajson::parse(sajson::bounded_allocation(ast_buffer, ast_buffer_size),
-                    sajson::mutable_string_view(minisize, buffer))
-          .is_valid(),
-      true, memcpy(buffer, mini_buffer, p.size()), repeat, volume, !just_data);
-
-  simdjson::dom::parser parser;
-  bool automated_reallocation = false;
-  BEST_TIME("simdjson orig",
-            parser.parse((const uint8_t *)buffer, p.size(),
-                                 automated_reallocation).error(),
-            simdjson::SUCCESS, memcpy(buffer, p.data(), p.size()), repeat, volume,
-            !just_data);
-  BEST_TIME("simdjson despaced",
-            parser.parse((const uint8_t *)buffer, minisize,
-                                 automated_reallocation).error(),
-            simdjson::SUCCESS, memcpy(buffer, mini_buffer, p.size()), repeat, volume,
-            !just_data);
-
-  free(buffer);
-  free(ast_buffer);
-  free(mini_buffer);
-}

benchmark/parse.cpp

@@ -1,226 +0,0 @@
-#include "event_counter.h"
-
-#include <cassert>
-#include <cctype>
-#ifndef _MSC_VER
-#include <dirent.h>
-#endif
-#include <unistd.h>
-#include <cinttypes>
-
-#include <cstdio>
-#include <cstdlib>
-#include <cstring>
-
-#include <algorithm>
-#include <chrono>
-#include <cstring>
-#include <fstream>
-#include <iomanip>
-#include <iostream>
-#include <map>
-#include <set>
-#include <sstream>
-#include <string>
-#include <vector>
-
-#include "linux-perf-events.h"
-#ifdef __linux__
-#include <libgen.h>
-#endif
-
-#include "simdjson.h"
-
-#include <functional>
-
-#include "benchmarker.h"
-
-using namespace simdjson;
-using std::cerr;
-using std::cout;
-using std::endl;
-using std::string;
-using std::to_string;
-using std::vector;
-using std::ostream;
-using std::ofstream;
-using std::exception;
-
-// Stash the exe_name in main() for functions to use
-char* exe_name;
-
-void print_usage(ostream& out) {
-  out << "Usage: " << exe_name << " [-vt] [-n #] [-s STAGE] [-a ARCH] <jsonfile> ..." << endl;
-  out << endl;
-  out << "Runs the parser against the given json files in a loop, measuring speed and other statistics." << endl;
-  out << endl;
-  out << "Options:" << endl;
-  out << endl;
-  out << "-n #         - Number of iterations per file. Default: 200" << endl;
-  out << "-i #         - Number of times to iterate a single file before moving to the next. Default: 20" << endl;
-  out << "-t           - Tabbed data output" << endl;
-  out << "-v           - Verbose output." << endl;
-  out << "-s stage1    - Stop after find_structural_bits." << endl;
-  out << "-s all       - Run all stages." << endl;
-  out << "-C           - Leave the buffers cold (includes page allocation and related OS tasks during parsing, speed tied to OS performance)" << endl;
-  out << "-H           - Make the buffers hot (reduce page allocation and related OS tasks during parsing) [default]" << endl;
-  out << "-a IMPL      - Use the given parser implementation. By default, detects the most advanced" << endl;
-  out << "               implementation supported on the host machine." << endl;
-  for (auto impl : simdjson::available_implementations) {
-    if(impl->supported_by_runtime_system()) {
-      out << "-a " << std::left << std::setw(9) << impl->name() << " - Use the " << impl->description() << " parser implementation." << endl;
-    }
-  }
-}
-
-void exit_usage(string message) {
-  cerr << message << endl;
-  cerr << endl;
-  print_usage(cerr);
-  exit(EXIT_FAILURE);
-}
-
-struct option_struct {
-  vector<char*> files{};
-  bool stage1_only = false;
-
-  int32_t iterations = 200;
-  int32_t iteration_step = -1;
-
-  bool verbose = false;
-  bool tabbed_output = false;
-  /**
-   * Benchmarking on a cold parser instance means that the parsing may include
-   * memory allocation at the OS level. This may lead to apparently odd results
-   * such that higher speed under the Windows Subsystem for Linux than under the
-   * regular Windows, for the same machine. It is arguably misleading to benchmark
-   * how the OS allocates memory, when we really want to just benchmark simdjson.
-   */
-  bool hotbuffers = true;
-
-  option_struct(int argc, char **argv) {
-    int c;
-
-    while ((c = getopt(argc, argv, "vtn:i:a:s:HC")) != -1) {
-      switch (c) {
-      case 'n':
-        iterations = atoi(optarg);
-        break;
-      case 'i':
-        iteration_step = atoi(optarg);
-        break;
-      case 't':
-        tabbed_output = true;
-        break;
-      case 'v':
-        verbose = true;
-        break;
-      case 'a': {
-        const implementation *impl = simdjson::available_implementations[optarg];
-        if ((!impl) || (!impl->supported_by_runtime_system())) {
-          std::string exit_message = string("Unsupported option value -a ") + optarg + ": expected -a  with one of ";
-          for (auto imple : simdjson::available_implementations) {
-            if(imple->supported_by_runtime_system()) {
-              exit_message += imple->name();
-              exit_message += " ";
-            }
-          }
-          exit_usage(exit_message);
-        }
-        simdjson::active_implementation = impl;
-        break;
-      }
-      case 'C':
-        hotbuffers = false;
-        break;
-      case 'H':
-        hotbuffers = true;
-        break;
-      case 's':
-        if (!strcmp(optarg, "stage1")) {
-          stage1_only = true;
-        } else if (!strcmp(optarg, "all")) {
-          stage1_only = false;
-        } else {
-          exit_usage(string("Unsupported option value -s ") + optarg + ": expected -s stage1 or all");
-        }
-        break;
-      default:
-        // reaching here means an argument was given to getopt() which did not have a case label
-        exit_usage("Unexpected argument - missing case for option "+
-                    std::string(1,static_cast<char>(c))+
-                    " (programming error)");
-      }
-    }
-
-    if (iteration_step == -1) {
-      iteration_step = iterations / 50;
-      if (iteration_step < 200) { iteration_step = 200; }
-      if (iteration_step > iterations) { iteration_step = iterations; }
-    }
-
-    // All remaining arguments are considered to be files
-    for (int i=optind; i<argc; i++) {
-      files.push_back(argv[i]);
-    }
-    if (files.empty()) {
-      exit_usage("No files specified");
-    }
-  }
-};
-
-int main(int argc, char *argv[]) {
-  // Read options
-  exe_name = argv[0];
-  option_struct options(argc, argv);
-  if (options.verbose) {
-    verbose_stream = &cout;
-    verbose() << "Implementation: " << simdjson::active_implementation->name() << endl;
-  }
-
-  // Start collecting events. We put this early so if it prints an error message, it's the
-  // first thing printed.
-  event_collector collector;
-
-  // Print preamble
-  if (!options.tabbed_output) {
-    printf("number of iterations %u \n", options.iterations);
-  }
-
-  // Set up benchmarkers by reading all files
-  vector<benchmarker*> benchmarkers;
-  for (size_t i=0; i<options.files.size(); i++) {
-    benchmarkers.push_back(new benchmarker(options.files[i], collector));
-  }
-
-  // Run the benchmarks
-  progress_bar progress(options.iterations, 50);
-  // Put the if (options.stage1_only) *outside* the loop so that run_iterations will be optimized
-  if (options.stage1_only) {
-    for (int iteration = 0; iteration < options.iterations; iteration += options.iteration_step) {
-      if (!options.verbose) { progress.print(iteration); }
-      // Benchmark each file once per iteration
-      for (size_t f=0; f<options.files.size(); f++) {
-        verbose() << "[verbose] " << benchmarkers[f]->filename << " iterations #" << iteration << "-" << (iteration+options.iteration_step-1) << endl;
-        benchmarkers[f]->run_iterations(options.iteration_step, true, options.hotbuffers);
-      }
-    }
-  } else {
-    for (int iteration = 0; iteration < options.iterations; iteration += options.iteration_step) {
-      if (!options.verbose) { progress.print(iteration); }
-      // Benchmark each file once per iteration
-      for (size_t f=0; f<options.files.size(); f++) {
-        verbose() << "[verbose] " << benchmarkers[f]->filename << " iterations #" << iteration << "-" << (iteration+options.iteration_step-1) << endl;
-        benchmarkers[f]->run_iterations(options.iteration_step, false, options.hotbuffers);
-      }
-    }
-  }
-  if (!options.verbose) { progress.erase(); }
-
-  for (size_t i=0; i<options.files.size(); i++) {
-    benchmarkers[i]->print(options.tabbed_output);
-    delete benchmarkers[i];
-  }
-
-  return EXIT_SUCCESS;
-}

benchmark/parse_stream.cpp

@@ -1,191 +0,0 @@
-#include <algorithm>
-#include <chrono>
-#include <iostream>
-#include <map>
-#include <vector>
-
-#include "simdjson.h"
-
-#define NB_ITERATION 20
-#define MIN_BATCH_SIZE 10000
-#define MAX_BATCH_SIZE 10000000
-
-bool test_baseline = false;
-bool test_per_batch = true;
-bool test_best_batch = false;
-
-bool compare(std::pair<size_t, double> i, std::pair<size_t, double> j) {
-  return i.second > j.second;
-}
-
-int main(int argc, char *argv[]) {
-
-  if (argc <= 1) {
-    std::cerr << "Usage: " << argv[0] << " <jsonfile>" << std::endl;
-    exit(1);
-  }
-  const char *filename = argv[1];
-  auto[p, err] = simdjson::padded_string::load(filename);
-  if (err) {
-    std::cerr << "Could not load the file " << filename << std::endl;
-    return EXIT_FAILURE;
-  }
-  if (test_baseline) {
-    std::wclog << "Baseline: Getline + normal parse... " << std::endl;
-    std::cout << "Gigabytes/second\t"
-              << "Nb of documents parsed" << std::endl;
-    for (auto i = 0; i < 3; i++) {
-      // Actual test
-      simdjson::dom::parser parser;
-      simdjson::error_code alloc_error = parser.allocate(p.size());
-      if (alloc_error) {
-        std::cerr << alloc_error << std::endl;
-        return EXIT_FAILURE;
-      }
-      std::istringstream ss(std::string(p.data(), p.size()));
-
-      auto start = std::chrono::steady_clock::now();
-      int count = 0;
-      std::string line;
-      int parse_res = simdjson::SUCCESS;
-      while (getline(ss, line)) {
-        // TODO we're likely triggering simdjson's padding reallocation here. Is
-        // that intentional?
-        parser.parse(line);
-        count++;
-      }
-
-      auto end = std::chrono::steady_clock::now();
-
-      std::chrono::duration<double> secs = end - start;
-      double speedinGBs = static_cast<double>(p.size()) /
-                          (static_cast<double>(secs.count()) * 1000000000.0);
-      std::cout << speedinGBs << "\t\t\t\t" << count << std::endl;
-
-      if (parse_res != simdjson::SUCCESS) {
-        std::cerr << "Parsing failed" << std::endl;
-        exit(1);
-      }
-    }
-  }
-
-  std::map<size_t, double> batch_size_res;
-  if (test_per_batch) {
-    std::wclog << "parse_many: Speed per batch_size... from " << MIN_BATCH_SIZE
-               << " bytes to " << MAX_BATCH_SIZE << " bytes..." << std::endl;
-    std::cout << "Batch Size\t"
-              << "Gigabytes/second\t"
-              << "Nb of documents parsed" << std::endl;
-    for (size_t i = MIN_BATCH_SIZE; i <= MAX_BATCH_SIZE;
-         i += (MAX_BATCH_SIZE - MIN_BATCH_SIZE) / 100) {
-      batch_size_res.insert(std::pair<size_t, double>(i, 0));
-      int count;
-      for (size_t j = 0; j < 5; j++) {
-        // Actual test
-        simdjson::dom::parser parser;
-        simdjson::error_code error;
-
-        auto start = std::chrono::steady_clock::now();
-        count = 0;
-        simdjson::dom::document_stream docs;
-        if ((error = parser.parse_many(p, i).get(docs))) {
-          std::wcerr << "Parsing failed with: " << error << std::endl;
-          exit(1);
-        }
-        for (auto result : docs) {
-          error = result.error();
-          if (error) {
-            std::wcerr << "Parsing failed with: " << error << std::endl;
-            exit(1);
-          }
-          count++;
-        }
-        auto end = std::chrono::steady_clock::now();
-
-        std::chrono::duration<double> secs = end - start;
-        double speedinGBs = static_cast<double>(p.size()) /
-                            (static_cast<double>(secs.count()) * 1000000000.0);
-        if (speedinGBs > batch_size_res.at(i))
-          batch_size_res[i] = speedinGBs;
-      }
-      std::cout << i << "\t\t" << std::fixed << std::setprecision(3)
-                << batch_size_res.at(i) << "\t\t\t\t" << count << std::endl;
-    }
-  }
-  size_t optimal_batch_size{};
-  double best_speed{};
-  if (test_per_batch) {
-    std::pair<size_t, double> best_results;
-    best_results =
-        (*min_element(batch_size_res.begin(), batch_size_res.end(), compare));
-    optimal_batch_size = best_results.first;
-    best_speed = best_results.second;
-  } else {
-    optimal_batch_size = MIN_BATCH_SIZE;
-  }
-  std::wclog << "Seemingly optimal batch_size: " << optimal_batch_size << "..."
-             << std::endl;
-  std::wclog << "Best speed: " << best_speed << "..." << std::endl;
-
-  if (test_best_batch) {
-    std::wclog << "Starting speed test... Best of " << NB_ITERATION
-               << " iterations..." << std::endl;
-    std::vector<double> res;
-    for (int i = 0; i < NB_ITERATION; i++) {
-
-      // Actual test
-      simdjson::dom::parser parser;
-      simdjson::error_code error;
-
-      auto start = std::chrono::steady_clock::now();
-      // This includes allocation of the parser
-      simdjson::dom::document_stream docs;
-      if ((error = parser.parse_many(p, optimal_batch_size).get(docs))) {
-        std::wcerr << "Parsing failed with: " << error << std::endl;
-        exit(1);
-      }
-      for (auto result : docs) {
-        error = result.error();
-        if (error) {
-          std::wcerr << "Parsing failed with: " << error << std::endl;
-          exit(1);
-        }
-      }
-      auto end = std::chrono::steady_clock::now();
-
-      std::chrono::duration<double> secs = end - start;
-      res.push_back(secs.count());
-    }
-
-    double min_result = *min_element(res.begin(), res.end());
-    double speedinGBs =
-        static_cast<double>(p.size()) / (min_result * 1000000000.0);
-
-    std::cout << "Min:  " << min_result << " bytes read: " << p.size()
-              << " Gigabytes/second: " << speedinGBs << std::endl;
-  }
-#ifdef SIMDJSON_THREADS_ENABLED
-  // Multithreading probably does not help matters for small files (less than 10
-  // MB).
-  if (p.size() < 10000000) {
-    std::cout << std::endl;
-
-    std::cout << "Warning: your file is small and the performance results are "
-                 "probably meaningless"
-              << std::endl;
-    std::cout << "as far as multithreaded performance goes." << std::endl;
-
-    std::cout << std::endl;
-
-    std::cout
-        << "Try to concatenate the file with itself to generate a large one."
-        << std::endl;
-    std::cout << "In bash: " << std::endl;
-    std::cout << "for i in {1..1000}; do cat '" << filename
-              << "' >> bar.ndjson; done" << std::endl;
-    std::cout << argv[0] << " bar.ndjson" << std::endl;
-  }
-#endif
-
-  return 0;
-}

benchmark/parseandstatcompetition.cpp

@@ -1,502 +0,0 @@
-#include "simdjson.h"
-#include <unistd.h>
-
-#include "benchmark.h"
-
-SIMDJSON_PUSH_DISABLE_ALL_WARNINGS
-
-// #define RAPIDJSON_SSE2 // bad for performance
-// #define RAPIDJSON_SSE42 // bad for performance
-#include "rapidjson/document.h"
-#include "rapidjson/reader.h"
-#include "rapidjson/stringbuffer.h"
-#include "rapidjson/writer.h"
-
-#include "sajson.h"
-
-SIMDJSON_POP_DISABLE_WARNINGS
-
-using namespace rapidjson;
-using namespace simdjson;
-struct stat_s {
-  size_t number_count;
-  size_t object_count;
-  size_t array_count;
-  size_t null_count;
-  size_t true_count;
-  size_t false_count;
-  bool valid;
-};
-
-typedef struct stat_s stat_t;
-
-bool stat_equal(const stat_t &s1, const stat_t &s2) {
-  return (s1.valid == s2.valid) && (s1.number_count == s2.number_count) &&
-         (s1.object_count == s2.object_count) &&
-         (s1.array_count == s2.array_count) &&
-         (s1.null_count == s2.null_count) && (s1.true_count == s2.true_count) &&
-         (s1.false_count == s2.false_count);
-}
-
-void print_stat(const stat_t &s) {
-  if (!s.valid) {
-    printf("invalid\n");
-    return;
-  }
-  printf("number: %zu object: %zu array: %zu null: %zu true: %zu false: %zu\n",
-         s.number_count, s.object_count, s.array_count, s.null_count,
-         s.true_count, s.false_count);
-}
-
-simdjson_really_inline void simdjson_process_atom(stat_t &s,
-                                         simdjson::dom::element element) {
-  if (element.is<double>()) {
-    s.number_count++;
-  } else if (element.is<bool>()) {
-    simdjson::error_code error;
-    bool v;
-    if (not (error = element.get(v)) && v) {
-      s.true_count++;
-    } else {
-      s.false_count++;
-    }
-  } else if (element.is_null()) {
-    s.null_count++;
-  }
-}
-
-void simdjson_recurse(stat_t &s, simdjson::dom::element element) {
-  error_code error;
-  if (element.is<simdjson::dom::array>()) {
-    s.array_count++;
-    dom::array array;
-    if ((error = element.get(array))) {
-      std::cerr << error << std::endl;
-      abort();
-    }
-    for (auto child : array) {
-      if (child.is<simdjson::dom::array>() ||
-          child.is<simdjson::dom::object>()) {
-        simdjson_recurse(s, child);
-      } else {
-        simdjson_process_atom(s, child);
-      }
-    }
-  } else if (element.is<simdjson::dom::object>()) {
-    s.object_count++;
-    dom::object object;
-    if ((error = element.get(object))) {
-      std::cerr << error << std::endl;
-      abort();
-    }
-    for (auto field : object) {
-      if (field.value.is<simdjson::dom::array>() ||
-          field.value.is<simdjson::dom::object>()) {
-        simdjson_recurse(s, field.value);
-      } else {
-        simdjson_process_atom(s, field.value);
-      }
-    }
-  } else {
-    simdjson_process_atom(s, element);
-  }
-}
-
-simdjson_never_inline stat_t simdjson_compute_stats(const simdjson::padded_string &p) {
-  stat_t s{};
-  simdjson::dom::parser parser;
-  simdjson::dom::element doc;
-  auto error = parser.parse(p).get(doc);
-  if (error) {
-    s.valid = false;
-    return s;
-  }
-  s.valid = true;
-  simdjson_recurse(s, doc);
-  return s;
-}
-
-///
-struct Stat {
-  size_t objectCount;
-  size_t arrayCount;
-  size_t numberCount;
-  size_t stringCount;
-  size_t trueCount;
-  size_t falseCount;
-  size_t nullCount;
-
-  size_t memberCount;  // Number of members in all objects
-  size_t elementCount; // Number of elements in all arrays
-  size_t stringLength; // Number of code units in all strings
-};
-
-static error_code GenStatPlus(Stat &stat, const dom::element &v);
-static error_code GenStatPlus(Stat &stat, const simdjson_result<dom::element> &r) {
-  dom::element v;
-  SIMDJSON_TRY( r.get(v) );
-  return GenStatPlus(stat, v);
-}
-static error_code GenStatPlus(Stat &stat, const dom::element &v) {
-  switch (v.type()) {
-  case dom::element_type::ARRAY: {
-    dom::array a;
-    SIMDJSON_TRY( v.get(a) )
-    for (auto child : a) {
-      GenStatPlus(stat, child);
-      stat.elementCount++;
-    }
-    stat.arrayCount++;
-  } break;
-  case dom::element_type::OBJECT: {
-    dom::object o;
-    SIMDJSON_TRY( v.get(o) );
-    for (dom::key_value_pair kv : o) {
-      GenStatPlus(stat, kv.value);
-      stat.stringLength += kv.key.size();
-      stat.memberCount++;
-      stat.stringCount++;
-    }
-    stat.objectCount++;
-  } break;
-  case dom::element_type::INT64:
-  case dom::element_type::UINT64:
-  case dom::element_type::DOUBLE:
-    stat.numberCount++;
-    break;
-  case dom::element_type::STRING: {
-    stat.stringCount++;
-    std::string_view sv;
-    SIMDJSON_TRY( v.get(sv) );
-    stat.stringLength += sv.size();
-  } break;
-  case dom::element_type::BOOL: {
-    bool b;
-    SIMDJSON_TRY( v.get(b) );
-    if (b) {
-      stat.trueCount++;
-    } else {
-      stat.falseCount++;
-    }
-  } break;
-  case dom::element_type::NULL_VALUE:
-    ++stat.nullCount;
-    break;
-  }
-  return SUCCESS;
-}
-
-static void RapidGenStat(Stat &stat, const rapidjson::Value &v) {
-  switch (v.GetType()) {
-  case kNullType:
-    stat.nullCount++;
-    break;
-  case kFalseType:
-    stat.falseCount++;
-    break;
-  case kTrueType:
-    stat.trueCount++;
-    break;
-
-  case kObjectType:
-    for (Value::ConstMemberIterator m = v.MemberBegin(); m != v.MemberEnd();
-         ++m) {
-      stat.stringLength += m->name.GetStringLength();
-      RapidGenStat(stat, m->value);
-    }
-    stat.objectCount++;
-    stat.memberCount += (v.MemberEnd() - v.MemberBegin());
-    stat.stringCount += (v.MemberEnd() - v.MemberBegin()); // Key
-    break;
-
-  case kArrayType:
-    for (Value::ConstValueIterator i = v.Begin(); i != v.End(); ++i)
-      RapidGenStat(stat, *i);
-    stat.arrayCount++;
-    stat.elementCount += v.Size();
-    break;
-
-  case kStringType:
-    stat.stringCount++;
-    stat.stringLength += v.GetStringLength();
-    break;
-
-  case kNumberType:
-    stat.numberCount++;
-    break;
-  }
-}
-simdjson_never_inline Stat rapidjson_compute_stats_ref(const rapidjson::Value &doc) {
-  Stat s{};
-  RapidGenStat(s, doc);
-  return s;
-}
-
-simdjson_never_inline Stat
-simdjson_compute_stats_refplus(const simdjson::dom::element &doc) {
-  Stat s{};
-  auto error = GenStatPlus(s, doc);
-  if (error) { std::cerr << error << std::endl; abort(); }
-  return s;
-}
-
-// see
-// https://github.com/miloyip/nativejson-benchmark/blob/master/src/tests/sajsontest.cpp
-void sajson_traverse(stat_t &stats, const sajson::value &node) {
-  using namespace sajson;
-  switch (node.get_type()) {
-  case TYPE_NULL:
-    stats.null_count++;
-    break;
-  case TYPE_FALSE:
-    stats.false_count++;
-    break;
-  case TYPE_TRUE:
-    stats.true_count++;
-    break;
-  case TYPE_ARRAY: {
-    stats.array_count++;
-    auto length = node.get_length();
-    for (size_t i = 0; i < length; ++i) {
-      sajson_traverse(stats, node.get_array_element(i));
-    }
-    break;
-  }
-  case TYPE_OBJECT: {
-    stats.object_count++;
-    auto length = node.get_length();
-    for (auto i = 0u; i < length; ++i) {
-      sajson_traverse(stats, node.get_object_value(i));
-    }
-    break;
-  }
-  case TYPE_STRING:
-    // skip
-    break;
-
-  case TYPE_DOUBLE:
-  case TYPE_INTEGER:
-    stats.number_count++; // node.get_number_value();
-    break;
-  default:
-    assert(false && "unknown node type");
-  }
-}
-
-simdjson_never_inline stat_t sasjon_compute_stats(const simdjson::padded_string &p) {
-  stat_t answer{};
-  char *buffer = (char *)malloc(p.size());
-  if (buffer == nullptr) {
-    return answer;
-  }
-  memcpy(buffer, p.data(), p.size());
-  auto d = sajson::parse(sajson::dynamic_allocation(),
-                         sajson::mutable_string_view(p.size(), buffer));
-  answer.valid = d.is_valid();
-  if (!answer.valid) {
-    free(buffer);
-    return answer;
-  }
-  answer.number_count = 0;
-  answer.object_count = 0;
-  answer.array_count = 0;
-  answer.null_count = 0;
-  answer.true_count = 0;
-  answer.false_count = 0;
-  sajson_traverse(answer, d.get_root());
-  free(buffer);
-  return answer;
-}
-
-void rapid_traverse(stat_t &stats, const rapidjson::Value &v) {
-  switch (v.GetType()) {
-  case kNullType:
-    stats.null_count++;
-    break;
-  case kFalseType:
-    stats.false_count++;
-    break;
-  case kTrueType:
-    stats.true_count++;
-    break;
-
-  case kObjectType:
-    for (Value::ConstMemberIterator m = v.MemberBegin(); m != v.MemberEnd();
-         ++m) {
-      rapid_traverse(stats, m->value);
-    }
-    stats.object_count++;
-    break;
-  case kArrayType:
-    for (Value::ConstValueIterator i = v.Begin(); i != v.End();
-         ++i) { // v.Size();
-      rapid_traverse(stats, *i);
-    }
-    stats.array_count++;
-    break;
-
-  case kStringType:
-    break;
-
-  case kNumberType:
-    stats.number_count++;
-    break;
-  }
-}
-
-simdjson_never_inline stat_t rapid_compute_stats(const simdjson::padded_string &p) {
-  stat_t answer{};
-  char *buffer = (char *)malloc(p.size() + 1);
-  if (buffer == nullptr) {
-    return answer;
-  }
-  memcpy(buffer, p.data(), p.size());
-  buffer[p.size()] = '\0';
-  rapidjson::Document d;
-  d.ParseInsitu<kParseValidateEncodingFlag>(buffer);
-  answer.valid = !d.HasParseError();
-  if (!answer.valid) {
-    free(buffer);
-    return answer;
-  }
-  answer.number_count = 0;
-  answer.object_count = 0;
-  answer.array_count = 0;
-  answer.null_count = 0;
-  answer.true_count = 0;
-  answer.false_count = 0;
-  rapid_traverse(answer, d);
-  free(buffer);
-  return answer;
-}
-
-simdjson_never_inline stat_t
-rapid_accurate_compute_stats(const simdjson::padded_string &p) {
-  stat_t answer{};
-  char *buffer = (char *)malloc(p.size() + 1);
-  if (buffer == nullptr) {
-    return answer;
-  }
-  memcpy(buffer, p.data(), p.size());
-  buffer[p.size()] = '\0';
-  rapidjson::Document d;
-  d.ParseInsitu<kParseValidateEncodingFlag | kParseFullPrecisionFlag>(buffer);
-  answer.valid = !d.HasParseError();
-  if (!answer.valid) {
-    free(buffer);
-    return answer;
-  }
-  answer.number_count = 0;
-  answer.object_count = 0;
-  answer.array_count = 0;
-  answer.null_count = 0;
-  answer.true_count = 0;
-  answer.false_count = 0;
-  rapid_traverse(answer, d);
-  free(buffer);
-  return answer;
-}
-int main(int argc, char *argv[]) {
-  bool verbose = false;
-  bool just_data = false;
-
-  int c;
-  while ((c = getopt(argc, argv, "vt")) != -1)
-    switch (c) {
-    case 't':
-      just_data = true;
-      break;
-    case 'v':
-      verbose = true;
-      break;
-    default:
-      abort();
-    }
-  if (optind >= argc) {
-    std::cerr
-        << "Using different parsers, we compute the content statistics of "
-           "JSON documents."
-        << std::endl;
-    std::cerr << "Usage: " << argv[0] << " <jsonfile>" << std::endl;
-    std::cerr << "Or " << argv[0] << " -v <jsonfile>" << std::endl;
-    exit(1);
-  }
-  const char *filename = argv[optind];
-  if (optind + 1 < argc) {
-    std::cerr << "warning: ignoring everything after " << argv[optind + 1]
-              << std::endl;
-  }
-  simdjson::padded_string p;
-  auto error = simdjson::padded_string::load(filename).get(p);
-  if (error) {
-    std::cerr << "Could not load the file " << filename << std::endl;
-    return EXIT_FAILURE;
-  }
-  // Gigabyte: https://en.wikipedia.org/wiki/Gigabyte
-  if (verbose) {
-    std::cout << "Input has ";
-    if (p.size() > 1000 * 1000)
-      std::cout << p.size() / (1000 * 1000) << " MB ";
-    else if (p.size() > 1000)
-      std::cout << p.size() / 1000 << " KB ";
-    else
-      std::cout << p.size() << " B ";
-    std::cout << std::endl;
-  }
-  stat_t s1 = simdjson_compute_stats(p);
-  if (verbose) {
-    printf("simdjson: ");
-    print_stat(s1);
-  }
-  stat_t s2 = rapid_compute_stats(p);
-  if (verbose) {
-    printf("rapid:    ");
-    print_stat(s2);
-  }
-  stat_t s2a = rapid_accurate_compute_stats(p);
-  if (verbose) {
-    printf("rapid full:    ");
-    print_stat(s2a);
-  }
-  stat_t s3 = sasjon_compute_stats(p);
-  if (verbose) {
-    printf("sasjon:   ");
-    print_stat(s3);
-  }
-  assert(stat_equal(s1, s2));
-  assert(stat_equal(s1, s3));
-  int repeat = 50;
-  size_t volume = p.size();
-  if (just_data) {
-    printf("name cycles_per_byte cycles_per_byte_err gb_per_s gb_per_s_err \n");
-  }
-  BEST_TIME("simdjson            ", simdjson_compute_stats(p).valid, true, ,
-            repeat, volume, !just_data);
-  BEST_TIME("RapidJSON           ", rapid_compute_stats(p).valid, true, ,
-            repeat, volume, !just_data);
-  BEST_TIME("RapidJSON (precise) ", rapid_accurate_compute_stats(p).valid, true,
-            , repeat, volume, !just_data);
-  BEST_TIME("sasjon              ", sasjon_compute_stats(p).valid, true, ,
-            repeat, volume, !just_data);
-  if (!just_data) {
-    printf("API traversal tests\n");
-    printf("Based on https://github.com/miloyip/nativejson-benchmark\n");
-    simdjson::dom::parser parser;
-    simdjson::dom::element doc;
-    auto error = parser.parse(p).get(doc);
-    if (error) { std::cerr << error << std::endl; abort(); }
-    size_t refval = simdjson_compute_stats_refplus(doc).objectCount;
-
-    BEST_TIME("simdjson            ",
-              simdjson_compute_stats_refplus(doc).objectCount, refval, , repeat,
-              volume, !just_data);
-    char *buffer = (char *)malloc(p.size() + 1);
-    memcpy(buffer, p.data(), p.size());
-    buffer[p.size()] = '\0';
-    rapidjson::Document d;
-    d.ParseInsitu<kParseValidateEncodingFlag>(buffer);
-    BEST_TIME("rapid              ", rapidjson_compute_stats_ref(d).objectCount,
-              refval, , repeat, volume, !just_data);
-    free(buffer);
-  }
-}

benchmark/parsingcompetition.cpp

@@ -1,424 +0,0 @@
-#include "simdjson.h"
-
-#include <unistd.h>
-#ifndef _MSC_VER
-#include "linux-perf-events.h"
-#ifdef __linux__
-#include <libgen.h>
-#endif //__linux__
-#endif // _MSC_VER
-
-#include <memory>
-
-#include "benchmark.h"
-
-SIMDJSON_PUSH_DISABLE_ALL_WARNINGS
-#include "yyjson.h"
-
-// #define RAPIDJSON_SSE2 // bad for performance
-// #define RAPIDJSON_SSE42 // bad for performance
-#include "rapidjson/document.h"
-#include "rapidjson/reader.h"
-#include "rapidjson/stringbuffer.h"
-#include "rapidjson/writer.h"
-
-#include "sajson.h"
-
-#include <nlohmann/json.hpp>
-using json = nlohmann::json;
-
-#include <boost/json/parser.hpp>
-#include <boost/json/monotonic_resource.hpp>
-
-#ifdef ALLPARSER
-
-#include "fastjson.cpp"
-#include "fastjson_dom.cpp"
-#include "gason.cpp"
-
-#include "json11.cpp"
-extern "C" {
-#include "cJSON.c"
-#include "cJSON.h"
-#include "jsmn.c"
-#include "jsmn.h"
-#include "ujdecode.h"
-#include "ultrajsondec.c"
-}
-
-#include "jsoncpp.cpp"
-#include "json/json.h"
-
-#endif
-
-SIMDJSON_POP_DISABLE_WARNINGS
-
-using namespace rapidjson;
-
-#ifdef ALLPARSER
-// fastjson has a tricky interface
-void on_json_error(void *, simdjson_unused const fastjson::ErrorContext &ec) {
-  // std::cerr<<"ERROR: "<<ec.mesg<<std::endl;
-}
-bool fastjson_parse(const char *input) {
-  fastjson::Token token;
-  fastjson::dom::Chunk chunk;
-  return fastjson::dom::parse_string(input, &token, &chunk, 0, &on_json_error,
-                                     NULL);
-}
-// end of fastjson stuff
-#endif
-
-simdjson_never_inline size_t sum_line_lengths(std::stringstream &is) {
-  std::string line;
-  size_t sumofalllinelengths{0};
-  while (std::getline(is, line)) {
-    sumofalllinelengths += line.size();
-  }
-  return sumofalllinelengths;
-}
-
-inline void reset_stream(std::stringstream &is) {
-  is.clear();
-  is.seekg(0, std::ios::beg);
-}
-
-bool bench(const char *filename, bool verbose, bool just_data,
-           double repeat_multiplier) {
-  simdjson::padded_string p;
-  auto error = simdjson::padded_string::load(filename).get(p);
-  if (error) {
-    std::cerr << "Could not load the file " << filename << ": " << error
-              << std::endl;
-    return false;
-  }
-
-  int repeat = static_cast<int>((50000000 * repeat_multiplier) /
-                                static_cast<double>(p.size()));
-  if (repeat < 10) {
-    repeat = 10;
-  }
-  // Gigabyte: https://en.wikipedia.org/wiki/Gigabyte
-  if (verbose) {
-    std::cout << "Input " << filename << " has ";
-    if (p.size() > 1000 * 1000)
-      std::cout << p.size() / (1000 * 1000) << " MB";
-    else if (p.size() > 1000)
-      std::cout << p.size() / 1000 << " KB";
-    else
-      std::cout << p.size() << " B";
-    std::cout << ": will run " << repeat << " iterations." << std::endl;
-  }
-  size_t volume = p.size();
-  if (just_data) {
-    std::printf("%-42s %20s %20s %20s %20s \n", "name", "cycles_per_byte",
-                "cycles_per_byte_err", "gb_per_s", "gb_per_s_err");
-  }
-  if (!just_data) {
-    const std::string inputcopy(p.data(), p.data() + p.size());
-    std::stringstream is;
-    is.str(inputcopy);
-    const size_t lc = sum_line_lengths(is);
-    BEST_TIME("getline ", sum_line_lengths(is), lc, reset_stream(is), repeat,
-              volume, !just_data);
-  }
-
-  if (!just_data) {
-    auto parse_dynamic = [](auto &str) {
-      simdjson::dom::parser parser;
-      return parser.parse(str).error();
-    };
-    BEST_TIME("simdjson (dynamic mem) ", parse_dynamic(p), simdjson::SUCCESS, ,
-              repeat, volume, !just_data);
-  }
-  // (static alloc)
-  simdjson::dom::parser parser;
-  BEST_TIME("simdjson ", parser.parse(p).error(), simdjson::SUCCESS, , repeat,
-            volume, !just_data);
-
-  rapidjson::Document d;
-
-  char *buffer = (char *)std::malloc(p.size() + 1);
-  std::memcpy(buffer, p.data(), p.size());
-  buffer[p.size()] = '\0';
-#ifndef ALLPARSER
-  if (!just_data)
-#endif
-  {
-    std::memcpy(buffer, p.data(), p.size());
-    BEST_TIME("RapidJSON  ",
-              d.Parse<kParseValidateEncodingFlag>((const char *)buffer)
-                  .HasParseError(),
-              false, , repeat, volume, !just_data);
-  }
-#ifndef ALLPARSER
-  if (!just_data)
-#endif
-  {
-    std::memcpy(buffer, p.data(), p.size());
-    BEST_TIME("RapidJSON (accurate number parsing)  ",
-              d.Parse<kParseValidateEncodingFlag | kParseFullPrecisionFlag>(
-                   (const char *)buffer)
-                  .HasParseError(),
-              false, , repeat, volume, !just_data);
-  }
-  BEST_TIME(
-      "RapidJSON (insitu)",
-      d.ParseInsitu<kParseValidateEncodingFlag>(buffer).HasParseError(), false,
-      std::memcpy(buffer, p.data(), p.size()) && (buffer[p.size()] = '\0'),
-      repeat, volume, !just_data);
-  BEST_TIME("RapidJSON (insitu, accurate number parsing)",
-            d.ParseInsitu<kParseValidateEncodingFlag | kParseFullPrecisionFlag>(
-                 buffer)
-                .HasParseError(),
-            false,
-            std::memcpy(buffer, p.data(), p.size()) &&
-                (buffer[p.size()] = '\0'),
-            repeat, volume, !just_data);
-
-  {
-    const boost::json::string_view sv(p.data(), p.size());
-    boost::json::parser p;
-    auto execute = [&p](auto sv) -> bool {
-      boost::json::error_code ec;
-      boost::json::monotonic_resource mr;
-        p.reset( &mr );
-        p.write(sv,ec);
-       if(!ec)
-         auto jv=p.release();
-       return !!ec;
-    };
-
-    BEST_TIME("Boost.json", execute(sv), false, , repeat, volume, !just_data);
-  }
-  {
-    
-    auto execute = [&p]() -> bool {
-      yyjson_doc *doc = yyjson_read(p.data(), p.size(), 0);
-      bool is_ok = doc != nullptr;
-      yyjson_doc_free(doc);
-      return is_ok;
-    };
-    
-    BEST_TIME("yyjson", execute(), true, , repeat, volume, !just_data);
-  }
-#ifndef ALLPARSER
-  if (!just_data)
-#endif
-    BEST_TIME("sajson (dynamic mem)",
-              sajson::parse(sajson::dynamic_allocation(),
-                            sajson::mutable_string_view(p.size(), buffer))
-                  .is_valid(),
-              true, std::memcpy(buffer, p.data(), p.size()), repeat, volume,
-              !just_data);
-
-  size_t ast_buffer_size = p.size();
-  size_t *ast_buffer = (size_t *)std::malloc(ast_buffer_size * sizeof(size_t));
-  //  (static alloc, insitu)
-  BEST_TIME(
-      "sajson",
-      sajson::parse(sajson::bounded_allocation(ast_buffer, ast_buffer_size),
-                    sajson::mutable_string_view(p.size(), buffer))
-          .is_valid(),
-      true, std::memcpy(buffer, p.data(), p.size()), repeat, volume,
-      !just_data);
-
-  std::memcpy(buffer, p.data(), p.size());
-  size_t expected = json::parse(p.data(), p.data() + p.size()).size();
-  BEST_TIME("nlohmann-json", json::parse(buffer, buffer + p.size()).size(),
-            expected, , repeat, volume, !just_data);
-
-#ifdef ALLPARSER
-  std::string json11err;
-  BEST_TIME("dropbox (json11)     ",
-            ((json11::Json::parse(buffer, json11err).is_null()) ||
-             (!json11err.empty())),
-            false, std::memcpy(buffer, p.data(), p.size()), repeat, volume,
-            !just_data);
-
-  BEST_TIME("fastjson             ", fastjson_parse(buffer), true,
-            std::memcpy(buffer, p.data(), p.size()), repeat, volume,
-            !just_data);
-  JsonValue value;
-  JsonAllocator allocator;
-  char *endptr;
-  BEST_TIME("gason             ", jsonParse(buffer, &endptr, &value, allocator),
-            JSON_OK, std::memcpy(buffer, p.data(), p.size()), repeat, volume,
-            !just_data);
-  void *state;
-  BEST_TIME("ultrajson         ",
-            (UJDecode(buffer, p.size(), NULL, &state) == NULL), false,
-            std::memcpy(buffer, p.data(), p.size()), repeat, volume,
-            !just_data);
-
-  {
-    std::unique_ptr<jsmntok_t[]> tokens =
-        std::make_unique<jsmntok_t[]>(p.size());
-    jsmn_parser jparser;
-    jsmn_init(&jparser);
-    std::memcpy(buffer, p.data(), p.size());
-    buffer[p.size()] = '\0';
-    BEST_TIME("jsmn           ",
-              (jsmn_parse(&jparser, buffer, p.size(), tokens.get(),
-                          static_cast<unsigned int>(p.size())) > 0),
-              true, jsmn_init(&jparser), repeat, volume, !just_data);
-  }
-  std::memcpy(buffer, p.data(), p.size());
-  buffer[p.size()] = '\0';
-  cJSON *tree = cJSON_Parse(buffer);
-  BEST_TIME("cJSON           ", ((tree = cJSON_Parse(buffer)) != NULL), true,
-            cJSON_Delete(tree), repeat, volume, !just_data);
-  cJSON_Delete(tree);
-
-  Json::CharReaderBuilder b;
-  Json::CharReader *json_cpp_reader = b.newCharReader();
-  Json::Value root;
-  Json::String errs;
-  BEST_TIME("jsoncpp           ",
-            json_cpp_reader->parse(buffer, buffer + volume, &root, &errs), true,
-            , repeat, volume, !just_data);
-  delete json_cpp_reader;
-#endif
-  if (!just_data)
-    BEST_TIME("memcpy            ",
-              (std::memcpy(buffer, p.data(), p.size()) == buffer), true, ,
-              repeat, volume, !just_data);
-#ifdef __linux__
-  if (!just_data) {
-    std::printf(
-        "\n \n <doing additional analysis with performance counters (Linux "
-        "only)>\n");
-    std::vector<int> evts;
-    evts.push_back(PERF_COUNT_HW_CPU_CYCLES);
-    evts.push_back(PERF_COUNT_HW_INSTRUCTIONS);
-    evts.push_back(PERF_COUNT_HW_BRANCH_MISSES);
-    evts.push_back(PERF_COUNT_HW_CACHE_REFERENCES);
-    evts.push_back(PERF_COUNT_HW_CACHE_MISSES);
-    LinuxEvents<PERF_TYPE_HARDWARE> unified(evts);
-    std::vector<unsigned long long> results;
-    std::vector<unsigned long long> stats;
-    results.resize(evts.size());
-    stats.resize(evts.size());
-    std::fill(stats.begin(), stats.end(), 0); // unnecessary
-    for (decltype(repeat) i = 0; i < repeat; i++) {
-      unified.start();
-      auto parse_error = parser.parse(p).error();
-      if (parse_error)
-        std::printf("bug\n");
-      unified.end(results);
-      std::transform(stats.begin(), stats.end(), results.begin(), stats.begin(),
-                     std::plus<unsigned long long>());
-    }
-    std::printf(
-        "simdjson : cycles %10.0f instructions %10.0f branchmisses %10.0f "
-        "cacheref %10.0f cachemisses %10.0f  bytespercachemiss %10.0f "
-        "inspercycle %10.1f insperbyte %10.1f\n",
-        static_cast<double>(stats[0]) / static_cast<double>(repeat),
-        static_cast<double>(stats[1]) / static_cast<double>(repeat),
-        static_cast<double>(stats[2]) / static_cast<double>(repeat),
-        static_cast<double>(stats[3]) / static_cast<double>(repeat),
-        static_cast<double>(stats[4]) / static_cast<double>(repeat),
-        static_cast<double>(volume) * static_cast<double>(repeat) /
-            static_cast<double>(stats[2]),
-        static_cast<double>(stats[1]) / static_cast<double>(stats[0]),
-        static_cast<double>(stats[1]) /
-            (static_cast<double>(volume) * static_cast<double>(repeat)));
-
-    std::fill(stats.begin(), stats.end(), 0);
-    for (decltype(repeat) i = 0; i < repeat; i++) {
-      std::memcpy(buffer, p.data(), p.size());
-      buffer[p.size()] = '\0';
-      unified.start();
-      if (d.ParseInsitu<kParseValidateEncodingFlag>(buffer).HasParseError() !=
-          false)
-        std::printf("bug\n");
-      unified.end(results);
-      std::transform(stats.begin(), stats.end(), results.begin(), stats.begin(),
-                     std::plus<unsigned long long>());
-    }
-    std::printf(
-        "RapidJSON: cycles %10.0f instructions %10.0f branchmisses %10.0f "
-        "cacheref %10.0f cachemisses %10.0f  bytespercachemiss %10.0f "
-        "inspercycle %10.1f insperbyte %10.1f\n",
-        static_cast<double>(stats[0]) / static_cast<double>(repeat),
-        static_cast<double>(stats[1]) / static_cast<double>(repeat),
-        static_cast<double>(stats[2]) / static_cast<double>(repeat),
-        static_cast<double>(stats[3]) / static_cast<double>(repeat),
-        static_cast<double>(stats[4]) / static_cast<double>(repeat),
-        static_cast<double>(volume) * static_cast<double>(repeat) /
-            static_cast<double>(stats[2]),
-        static_cast<double>(stats[1]) / static_cast<double>(stats[0]),
-        static_cast<double>(stats[1]) /
-            (static_cast<double>(volume) * static_cast<double>(repeat)));
-
-    std::fill(stats.begin(), stats.end(), 0); // unnecessary
-    for (decltype(repeat) i = 0; i < repeat; i++) {
-      std::memcpy(buffer, p.data(), p.size());
-      unified.start();
-      if (sajson::parse(sajson::bounded_allocation(ast_buffer, ast_buffer_size),
-                        sajson::mutable_string_view(p.size(), buffer))
-              .is_valid() != true)
-        std::printf("bug\n");
-      unified.end(results);
-      std::transform(stats.begin(), stats.end(), results.begin(), stats.begin(),
-                     std::plus<unsigned long long>());
-    }
-    std::printf(
-        "sajson   : cycles %10.0f instructions %10.0f branchmisses %10.0f "
-        "cacheref %10.0f cachemisses %10.0f  bytespercachemiss %10.0f "
-        "inspercycle %10.1f insperbyte %10.1f\n",
-        static_cast<double>(stats[0]) / static_cast<double>(repeat),
-        static_cast<double>(stats[1]) / static_cast<double>(repeat),
-        static_cast<double>(stats[2]) / static_cast<double>(repeat),
-        static_cast<double>(stats[3]) / static_cast<double>(repeat),
-        static_cast<double>(stats[4]) / static_cast<double>(repeat),
-        static_cast<double>(volume) * static_cast<double>(repeat) /
-            static_cast<double>(stats[2]),
-        static_cast<double>(stats[1]) / static_cast<double>(stats[0]),
-        static_cast<double>(stats[1]) /
-            (static_cast<double>(volume) * static_cast<double>(repeat)));
-  }
-#endif //  __linux__
-
-  std::free(ast_buffer);
-  std::free(buffer);
-  return true;
-}
-
-int main(int argc, char *argv[]) {
-  bool verbose = false;
-  bool just_data = false;
-  double repeat_multiplier = 1;
-  int c;
-  while ((c = getopt(argc, argv, "r:vt")) != -1)
-    switch (c) {
-    case 'r':
-      repeat_multiplier = atof(optarg);
-      break;
-    case 't':
-      just_data = true;
-      break;
-    case 'v':
-      verbose = true;
-      break;
-    default:
-      abort();
-    }
-  if (optind >= argc) {
-    std::cerr << "Usage: " << argv[0] << " <jsonfile>" << std::endl;
-    std::cerr << "Or " << argv[0] << " -v <jsonfile>" << std::endl;
-    std::cerr << "The '-t' flag outputs a table." << std::endl;
-    std::cerr << "The '-r <N>' flag sets the repeat multiplier: set it above 1 "
-                 "to do more iterations, and below 1 to do fewer."
-              << std::endl;
-    exit(1);
-  }
-  int result = EXIT_SUCCESS;
-  for (int fileind = optind; fileind < argc; fileind++) {
-    if (!bench(argv[fileind], verbose, just_data, repeat_multiplier)) {
-      result = EXIT_FAILURE;
-    }
-    std::printf("\n\n");
-  }
-  return result;
-}

benchmark/partial_tweets/dom.h

@@ -1,51 +0,0 @@
-#pragma once
-
-#if SIMDJSON_EXCEPTIONS
-
-#include "partial_tweets.h"
-
-namespace partial_tweets {
-
-using namespace simdjson;
-
-class Dom {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-
-  simdjson_really_inline const std::vector<tweet> &Result() { return tweets; }
-  simdjson_really_inline size_t ItemCount() { return tweets.size(); }
-
-private:
-  dom::parser parser{};
-  std::vector<tweet> tweets{};
-
-  simdjson_really_inline uint64_t nullable_int(dom::element element) {
-    if (element.is_null()) { return 0; }
-    return element;
-  }
-};
-
-simdjson_really_inline bool Dom::Run(const padded_string &json) {
-  tweets.clear();
-
-  for (dom::element tweet : parser.parse(json)["statuses"]) {
-    auto user = tweet["user"];
-    tweets.emplace_back(partial_tweets::tweet{
-      tweet["created_at"],
-      tweet["id"],
-      tweet["text"],
-      nullable_int(tweet["in_reply_to_status_id"]),
-      { user["id"], user["screen_name"] },
-      tweet["retweet_count"],
-      tweet["favorite_count"]
-    });
-  }
-
-  return true;
-}
-
-BENCHMARK_TEMPLATE(PartialTweets, Dom);
-
-} // namespace partial_tweets
-
-#endif // SIMDJSON_EXCEPTIONS

benchmark/partial_tweets/domnoexcept.h

@@ -1,64 +0,0 @@
-#pragma once
-
-#include "partial_tweets.h"
-
-namespace partial_tweets {
-
-using namespace simdjson;
-
-class DomNoExcept {
-public:
-  simdjson_really_inline bool Run(const simdjson::padded_string &json) noexcept;
-
-  simdjson_really_inline const std::vector<tweet> &Result() { return tweets; }
-  simdjson_really_inline size_t ItemCount() { return tweets.size(); }
-
-private:
-  dom::parser parser{};
-  std::vector<tweet> tweets{};
-
-  simdjson_really_inline simdjson_result<uint64_t> nullable_int(simdjson_result<dom::element> result) noexcept {
-    dom::element element;
-    SIMDJSON_TRY( result.get(element) );
-    if (element.is_null()) { return 0; }
-    return element.get_uint64();
-  }
-
-  simdjson_really_inline error_code RunNoExcept(const simdjson::padded_string &json) noexcept;
-};
-
-simdjson_really_inline bool DomNoExcept::Run(const simdjson::padded_string &json) noexcept {
-  auto error = RunNoExcept(json);
-  if (error) { std::cerr << error << std::endl; return false; }
-  return true;
-}
-
-simdjson_really_inline error_code DomNoExcept::RunNoExcept(const simdjson::padded_string &json) noexcept {
-  tweets.clear();
-
-  dom::array tweet_array;
-  SIMDJSON_TRY( parser.parse(json)["statuses"].get_array().get(tweet_array) );
-
-  for (auto tweet_element : tweet_array) {
-    dom::object tweet;
-    SIMDJSON_TRY( tweet_element.get_object().get(tweet) );
-
-    dom::object user;
-    SIMDJSON_TRY( tweet["user"].get_object().get(user) );
-
-    partial_tweets::tweet t;
-    SIMDJSON_TRY( tweet["created_at"]    .get_string().get(t.created_at) );
-    SIMDJSON_TRY( tweet["id"]            .get_uint64().get(t.id) );
-    SIMDJSON_TRY( tweet["text"]          .get_string().get(t.text) );
-    SIMDJSON_TRY( nullable_int(tweet["in_reply_to_status_id"]).get(t.in_reply_to_status_id) );
-    SIMDJSON_TRY( user["id"]             .get_uint64().get(t.user.id) );
-    SIMDJSON_TRY( user["screen_name"]    .get_string().get(t.user.screen_name) );
-    SIMDJSON_TRY( tweet["retweet_count"] .get_uint64().get(t.retweet_count) );
-    SIMDJSON_TRY( tweet["favorite_count"].get_uint64().get(t.favorite_count) );
-
-    tweets.push_back(t);
-  }
-  return SUCCESS;
-}
-
-} // namespace partial_tweets

benchmark/partial_tweets/iter.h

@@ -1,93 +0,0 @@
-#pragma once
-
-#if SIMDJSON_EXCEPTIONS
-
-#include "partial_tweets.h"
-
-namespace partial_tweets {
-
-using namespace simdjson;
-using namespace simdjson::builtin;
-
-class Iter {
-public:
-  simdjson_really_inline bool Run(const padded_string &json);
-
-  simdjson_really_inline const std::vector<tweet> &Result() { return tweets; }
-  simdjson_really_inline size_t ItemCount() { return tweets.size(); }
-
-private:
-  ondemand::parser parser{};
-  std::vector<tweet> tweets{};
-
-  simdjson_really_inline uint64_t nullable_int(ondemand::value && value) {
-    if (value.is_null()) { return 0; }
-    return std::move(value);
-  }
-
-  simdjson_really_inline twitter_user read_user(ondemand::object && user) {
-    // Move user into a local object so it gets destroyed (and moves the iterator)
-    ondemand::object u = std::move(user);
-    return { u["id"], u["screen_name"] };
-  }
-};
-
-simdjson_really_inline bool Iter::Run(const padded_string &json) {
-  tweets.clear();
-
-  // Walk the document, parsing the tweets as we go
-
-  // { "statuses": 
-  auto iter = parser.iterate_raw(json).value();
-  if (!iter.start_object()   || !iter.find_field_raw("statuses")) { return false; }
-  // { "statuses": [
-  if (!iter.start_array()) { return false; }
-
-  do {
-    tweet tweet;
-
-    if (!iter.start_object()   || !iter.find_field_raw("created_at")) { return false; }
-    tweet.created_at = iter.consume_string();
-
-    if (!iter.has_next_field() || !iter.find_field_raw("id")) { return false; }
-    tweet.id = iter.consume_uint64();
-
-    if (!iter.has_next_field() || !iter.find_field_raw("text")) { return false; }
-    tweet.text = iter.consume_string();
-
-    if (!iter.has_next_field() || !iter.find_field_raw("in_reply_to_status_id")) { return false; }
-    if (!iter.is_null()) {
-      tweet.in_reply_to_status_id = iter.consume_uint64();
-    }
-
-    if (!iter.has_next_field() || !iter.find_field_raw("user")) { return false; }
-    {
-      if (!iter.start_object()   || !iter.find_field_raw("id")) { return false; }
-      tweet.user.id = iter.consume_uint64();
-
-      if (!iter.has_next_field() || !iter.find_field_raw("screen_name")) { return false; }
-      tweet.user.screen_name = iter.consume_string();
-
-      if (iter.skip_container()) { return false; } // Skip the rest of the user object
-    }
-
-    if (!iter.has_next_field() || !iter.find_field_raw("retweet_count")) { return false; }
-    tweet.retweet_count = iter.consume_uint64();
-
-    if (!iter.has_next_field() || !iter.find_field_raw("favorite_count")) { return false; }
-    tweet.favorite_count = iter.consume_uint64();
-
-    tweets.push_back(tweet);
-
-    if (iter.skip_container()) { return false; } // Skip the rest of the tweet object
-
-  } while (iter.has_next_element());
-
-  return true;
-}
-
-BENCHMARK_TEMPLATE(PartialTweets, Iter);
-
-} // namespace partial_tweets
-
-#endif // SIMDJSON_EXCEPTIONS

benchmark/partial_tweets/ondemand.h

@@ -1,65 +0,0 @@
-#pragma once
-
-#if SIMDJSON_EXCEPTIONS
-
-#include "partial_tweets.h"
-
-namespace partial_tweets {
-
-using namespace simdjson;
-using namespace simdjson::builtin;
-
-
-class OnDemand {
-public:
-  OnDemand() { 
-    if(!displayed_implementation) {
-      std::cout << "On Demand implementation: " << builtin_implementation()->name() << std::endl; 
-      displayed_implementation = true;
-    }
-  } 
-  simdjson_really_inline bool Run(const padded_string &json);
-  simdjson_really_inline const std::vector<tweet> &Result() { return tweets; }
-  simdjson_really_inline size_t ItemCount() { return tweets.size(); }
-
-private:
-  ondemand::parser parser{};
-  std::vector<tweet> tweets{};
-
-  simdjson_really_inline uint64_t nullable_int(ondemand::value && value) {
-    if (value.is_null()) { return 0; }
-    return std::move(value);
-  }
-
-  simdjson_really_inline twitter_user read_user(ondemand::object && user) {
-    // Move user into a local object so it gets destroyed (and moves the iterator)
-    ondemand::object u = std::move(user);
-    return { u["id"], u["screen_name"] };
-  }
-  static inline bool displayed_implementation = false;
-};
-
-simdjson_really_inline bool OnDemand::Run(const padded_string &json) {
-  tweets.clear();
-
-  // Walk the document, parsing the tweets as we go
-  auto doc = parser.iterate(json);
-  for (ondemand::object tweet : doc["statuses"]) {
-    tweets.emplace_back(partial_tweets::tweet{
-      tweet["created_at"],
-      tweet["id"],
-      tweet["text"],
-      nullable_int(tweet["in_reply_to_status_id"]),
-      read_user(tweet["user"]),
-      tweet["retweet_count"],
-      tweet["favorite_count"]
-    });
-  }
-  return true;
-}
-
-BENCHMARK_TEMPLATE(PartialTweets, OnDemand);
-
-} // namespace partial_tweets
-
-#endif // SIMDJSON_EXCEPTIONS

benchmark/partial_tweets/partial_tweets.h

@@ -1,41 +0,0 @@
-#pragma once
-
-//
-// Interface
-//
-
-namespace partial_tweets {
-template<typename T> static void PartialTweets(benchmark::State &state);
-} // namespace partial_tweets
-
-//
-// Implementation
-//
-
-#include "tweet.h"
-#include <vector>
-#include "event_counter.h"
-#include "domnoexcept.h"
-#include "json_benchmark.h"
-
-namespace partial_tweets {
-
-using namespace simdjson;
-
-template<typename T> static void PartialTweets(benchmark::State &state) {
-  //
-  // Load the JSON file
-  //
-  constexpr const char *TWITTER_JSON = SIMDJSON_BENCHMARK_DATA_DIR "twitter.json";
-  error_code error;
-  padded_string json;
-  if ((error = padded_string::load(TWITTER_JSON).get(json))) {
-    std::cerr << error << std::endl;
-    state.SkipWithError("error loading");
-    return;
-  }
-
-  JsonBenchmark<T, DomNoExcept>(state, json);
-}
-
-} // namespace partial_tweets

benchmark/partial_tweets/sax.h

@@ -1,69 +0,0 @@
-#pragma once
-
-
-#include "partial_tweets.h"
-#include "sax_tweet_reader_visitor.h"
-
-namespace partial_tweets {
-
-using namespace simdjson;
-using namespace simdjson::builtin;
-using namespace simdjson::builtin::stage2;
-
-class Sax {
-public:
-  simdjson_really_inline bool Run(const padded_string &json) noexcept;
-
-  simdjson_really_inline const std::vector<tweet> &Result() { return tweets; }
-  simdjson_really_inline size_t ItemCount() { return tweets.size(); }
-
-private:
-  simdjson_really_inline error_code RunNoExcept(const padded_string &json) noexcept;
-  error_code Allocate(size_t new_capacity);
-  std::unique_ptr<uint8_t[]> string_buf{};
-  size_t capacity{};
-  dom_parser_implementation dom_parser{};
-  std::vector<tweet> tweets{};
-};
-
-// NOTE: this assumes the dom_parser is already allocated
-bool Sax::Run(const padded_string &json) noexcept {
-  auto error = RunNoExcept(json);
-  if (error) { std::cerr << error << std::endl; return false; }
-  return true;
-}
-
-error_code Sax::RunNoExcept(const padded_string &json) noexcept {
-  tweets.clear();
-
-  // Allocate capacity if needed
-  if (capacity < json.size()) {
-    SIMDJSON_TRY( Allocate(json.size()) );
-  }
-
-  // Run stage 1 first.
-  SIMDJSON_TRY( dom_parser.stage1((uint8_t *)json.data(), json.size(), false) );
-
-  // Then walk the document, parsing the tweets as we go
-  json_iterator iter(dom_parser, 0);
-  sax_tweet_reader_visitor visitor(tweets, string_buf.get());
-  SIMDJSON_TRY( iter.walk_document<false>(visitor) );
-  return SUCCESS;
-}
-
-error_code Sax::Allocate(size_t new_capacity) {
-  // string_capacity copied from document::allocate
-  size_t string_capacity = SIMDJSON_ROUNDUP_N(5 * new_capacity / 3 + SIMDJSON_PADDING, 64);
-  string_buf.reset(new (std::nothrow) uint8_t[string_capacity]);
-  if (auto error = dom_parser.set_capacity(new_capacity)) { return error; }
-  if (capacity == 0) { // set max depth the first time only
-    if (auto error = dom_parser.set_max_depth(DEFAULT_MAX_DEPTH)) { return error; }
-  }
-  capacity = new_capacity;
-  return SUCCESS;
-}
-
-BENCHMARK_TEMPLATE(PartialTweets, Sax);
-
-} // namespace partial_tweets
-

benchmark/partial_tweets/sax_tweet_reader_visitor.h

@@ -1,514 +0,0 @@
-#pragma once
-
-#include "simdjson.h"
-#include "tweet.h"
-#include <vector>
-
-namespace partial_tweets {
-
-using namespace simdjson;
-using namespace simdjson::builtin;
-using namespace simdjson::builtin::stage2;
-
-struct sax_tweet_reader_visitor {
-public:
-  simdjson_really_inline sax_tweet_reader_visitor(std::vector<tweet> &tweets, uint8_t *string_buf);
-
-  simdjson_really_inline error_code visit_document_start(json_iterator &iter);
-  simdjson_really_inline error_code visit_object_start(json_iterator &iter);
-  simdjson_really_inline error_code visit_key(json_iterator &iter, const uint8_t *key);
-  simdjson_really_inline error_code visit_primitive(json_iterator &iter, const uint8_t *value);
-  simdjson_really_inline error_code visit_array_start(json_iterator &iter);
-  simdjson_really_inline error_code visit_array_end(json_iterator &iter);
-  simdjson_really_inline error_code visit_object_end(json_iterator &iter);
-  simdjson_really_inline error_code visit_document_end(json_iterator &iter);
-  simdjson_really_inline error_code visit_empty_array(json_iterator &iter);
-  simdjson_really_inline error_code visit_empty_object(json_iterator &iter);
-  simdjson_really_inline error_code visit_root_primitive(json_iterator &iter, const uint8_t *value);
-  simdjson_really_inline error_code increment_count(json_iterator &iter);
-
-private:
-  // Since we only care about one thing at each level, we just use depth as the marker for what
-  // object/array we're nested inside.
-  enum class containers {
-    document = 0,   //
-    top_object = 1, // {
-    statuses = 2,   // { "statuses": [
-    tweet = 3,      // { "statuses": [ {
-    user = 4        // { "statuses": [ { "user": {
-  };
-  /**
-   * The largest depth we care about.
-   * There can be things at lower depths.
-   */
-  static constexpr uint32_t MAX_SUPPORTED_DEPTH = uint32_t(containers::user);
-  static constexpr const char *STATE_NAMES[] = {
-    "document",
-    "top object",
-    "statuses",
-    "tweet",
-    "user"
-  };
-  enum class field_type {
-    any,
-    unsigned_integer,
-    string,
-    nullable_unsigned_integer,
-    object,
-    array
-  };
-  struct field {
-    const char * key{};
-    size_t len{0};
-    size_t offset;
-    containers container{containers::document};
-    field_type type{field_type::any};
-  };
-
-  std::vector<tweet> &tweets;
-  containers container{containers::document};
-  uint8_t *current_string_buf_loc;
-  const uint8_t *current_key{};
-
-  simdjson_really_inline bool in_container(json_iterator &iter);
-  simdjson_really_inline bool in_container_child(json_iterator &iter);
-  simdjson_really_inline void start_container(json_iterator &iter);
-  simdjson_really_inline void end_container(json_iterator &iter);
-  simdjson_really_inline error_code parse_nullable_unsigned(json_iterator &iter, const uint8_t *value, const field &f);
-  simdjson_really_inline error_code parse_unsigned(json_iterator &iter, const uint8_t *value, const field &f);
-  simdjson_really_inline error_code parse_string(json_iterator &iter, const uint8_t *value, const field &f);
-
-  struct field_lookup {
-    field entries[256]{};
-
-    field_lookup();
-    simdjson_really_inline field get(const uint8_t * key, containers container);
-  private:
-    simdjson_really_inline uint8_t hash(const char * key, uint32_t depth);
-    simdjson_really_inline void add(const char * key, size_t len, containers container, field_type type, size_t offset);
-    simdjson_really_inline void neg(const char * const key, uint32_t depth);
-  };
-  static field_lookup fields;
-}; // sax_tweet_reader_visitor
-
-simdjson_really_inline sax_tweet_reader_visitor::sax_tweet_reader_visitor(std::vector<tweet> &_tweets, uint8_t *_string_buf)
-  : tweets{_tweets},
-    current_string_buf_loc{_string_buf} {
-}
-
-simdjson_really_inline error_code sax_tweet_reader_visitor::visit_document_start(json_iterator &iter) {
-  start_container(iter);
-  return SUCCESS;
-}
-simdjson_really_inline error_code sax_tweet_reader_visitor::visit_array_start(json_iterator &iter) {
-  // If we're not in a container we care about, don't bother with the rest
-  if (!in_container_child(iter)) { return SUCCESS; }
-
-  // Handle fields first
-  if (current_key) {
-    switch (fields.get(current_key, container).type) {
-      case field_type::array: // { "statuses": [
-        start_container(iter);
-        current_key = nullptr;
-        return SUCCESS;
-      case field_type::any:
-        return SUCCESS;
-      case field_type::object:
-      case field_type::unsigned_integer:
-      case field_type::nullable_unsigned_integer:
-      case field_type::string:
-        iter.log_error("unexpected array field");
-        return INCORRECT_TYPE;
-    }
-  }
-
-  // We're not in a field, so it must be a child of an array. We support any of those.
-  iter.log_error("unexpected array");
-  return INCORRECT_TYPE;
-}
-simdjson_really_inline error_code sax_tweet_reader_visitor::visit_object_start(json_iterator &iter) {
-  // If we're not in a container we care about, don't bother with the rest
-  if (!in_container_child(iter)) { return SUCCESS; }
-
-  // Handle known fields
-  if (current_key) {
-    auto f = fields.get(current_key, container);
-    switch (f.type) {
-      case field_type::object: // { "statuses": [ { "user": {
-        start_container(iter);
-        return SUCCESS;
-      case field_type::any:
-        return SUCCESS;
-      case field_type::array:
-      case field_type::unsigned_integer:
-      case field_type::nullable_unsigned_integer:
-      case field_type::string:
-        iter.log_error("unexpected object field");
-        return INCORRECT_TYPE;
-    }
-  }
-
-  // It's not a field, so it's a child of an array or document
-  switch (container) {
-    case containers::document: // top_object: {
-    case containers::statuses: // tweet:      { "statuses": [ {
-      start_container(iter);
-      return SUCCESS;
-    case containers::top_object:
-    case containers::tweet:
-    case containers::user:
-      iter.log_error("unexpected object");
-      return INCORRECT_TYPE;
-  }
-  SIMDJSON_UNREACHABLE();
-  return UNINITIALIZED;
-}
-simdjson_really_inline error_code sax_tweet_reader_visitor::visit_key(json_iterator &, const uint8_t *key) {
-  current_key = key;
-  return SUCCESS;
-}
-simdjson_really_inline error_code sax_tweet_reader_visitor::visit_primitive(json_iterator &iter, const uint8_t *value) {
-  // Don't bother unless we're in a container we care about
-  if (!in_container(iter)) { return SUCCESS; }
-
-  // Handle fields first
-  if (current_key) {
-    auto f = fields.get(current_key, container);
-    switch (f.type) {
-      case field_type::unsigned_integer:
-        return parse_unsigned(iter, value, f);
-      case field_type::nullable_unsigned_integer:
-        return parse_nullable_unsigned(iter, value, f);
-      case field_type::string:
-        return parse_string(iter, value, f);
-      case field_type::any:
-        return SUCCESS;
-      case field_type::array:
-      case field_type::object:
-        iter.log_error("unexpected primitive");
-        return INCORRECT_TYPE;
-    }
-    current_key = nullptr;
-  }
-
-  // If it's not a field, it's a child of an array.
-  // The only array we support is statuses, which must contain objects.
-  iter.log_error("unexpected primitive");
-  return INCORRECT_TYPE;
-}
-simdjson_really_inline error_code sax_tweet_reader_visitor::visit_array_end(json_iterator &iter) {
-  if (in_container(iter)) { end_container(iter); }
-  return SUCCESS;
-}
-simdjson_really_inline error_code sax_tweet_reader_visitor::visit_object_end(json_iterator &iter) {
-  current_key = nullptr;
-  if (in_container(iter)) { end_container(iter); }
-  return SUCCESS;
-}
-
-simdjson_really_inline error_code sax_tweet_reader_visitor::visit_document_end(json_iterator &) {
-  return SUCCESS;
-}
-
-simdjson_really_inline error_code sax_tweet_reader_visitor::visit_empty_array(json_iterator &) {
-  current_key = nullptr;
-  return SUCCESS;
-}
-simdjson_really_inline error_code sax_tweet_reader_visitor::visit_empty_object(json_iterator &) {
-  return SUCCESS;
-}
-simdjson_really_inline error_code sax_tweet_reader_visitor::visit_root_primitive(json_iterator &iter, const uint8_t *) {
-  iter.log_error("unexpected root primitive");
-  return INCORRECT_TYPE;
-}
-
-simdjson_really_inline error_code sax_tweet_reader_visitor::increment_count(json_iterator &) { return SUCCESS; }
-
-simdjson_really_inline bool sax_tweet_reader_visitor::in_container(json_iterator &iter) {
-  return iter.depth == uint32_t(container);
-}
-simdjson_really_inline bool sax_tweet_reader_visitor::in_container_child(json_iterator &iter) {
-  return iter.depth == uint32_t(container) + 1;
-}
-simdjson_really_inline void sax_tweet_reader_visitor::start_container(json_iterator &iter) {
-  SIMDJSON_ASSUME(iter.depth <= MAX_SUPPORTED_DEPTH); // Asserts in debug mode
-  container = containers(iter.depth);
-  if (logger::LOG_ENABLED) { iter.log_value(STATE_NAMES[iter.depth]); }
-  if (container == containers::tweet) { tweets.push_back({}); }
-}
-simdjson_really_inline void sax_tweet_reader_visitor::end_container(json_iterator &) {
-  container = containers(int(container) - 1);
-}
-simdjson_really_inline error_code sax_tweet_reader_visitor::parse_nullable_unsigned(json_iterator &iter, const uint8_t *value, const field &f) {
-  iter.log_value(f.key);
-  auto i = reinterpret_cast<uint64_t *>(reinterpret_cast<char *>(&tweets.back()) + f.offset);
-  if (auto error = numberparsing::parse_unsigned(value).get(*i)) {
-    // If number parsing failed, check if it's null before returning the error
-    if (!atomparsing::is_valid_null_atom(value)) { iter.log_error("expected number or null"); return error; }
-    i = 0;
-  }
-  return SUCCESS;
-}
-simdjson_really_inline error_code sax_tweet_reader_visitor::parse_unsigned(json_iterator &iter, const uint8_t *value, const field &f) {
-  iter.log_value(f.key);
-  auto i = reinterpret_cast<uint64_t *>(reinterpret_cast<char *>(&tweets.back()) + f.offset);
-  return numberparsing::parse_unsigned(value).get(*i);
-}
-simdjson_really_inline error_code sax_tweet_reader_visitor::parse_string(json_iterator &iter, const uint8_t *value, const field &f) {
-  iter.log_value(f.key);
-  auto s = reinterpret_cast<std::string_view *>(reinterpret_cast<char *>(&tweets.back()) + f.offset);
-  return stringparsing::parse_string_to_buffer(value, current_string_buf_loc, *s);
-}
-
-sax_tweet_reader_visitor::field_lookup sax_tweet_reader_visitor::fields{};
-
-simdjson_really_inline uint8_t sax_tweet_reader_visitor::field_lookup::hash(const char * key, uint32_t depth) {
-  // These shift numbers were chosen specifically because this yields only 2 collisions between
-  // keys in twitter.json, leaves 0 as a distinct value, and has 0 collisions between keys we
-  // actually care about.
-  return uint8_t((key[0] << 0) ^ (key[1] << 3) ^ (key[2] << 3) ^ (key[3] << 1) ^ depth);
-}
-simdjson_really_inline sax_tweet_reader_visitor::field sax_tweet_reader_visitor::field_lookup::get(const uint8_t * key, containers c) {
-  auto index = hash((const char *)key, uint32_t(c));
-  auto entry = entries[index];
-  // TODO if any key is > SIMDJSON_PADDING, this will access inaccessible memory!
-  if (c != entry.container || memcmp(key, entry.key, entry.len)) { return entries[0]; }
-  return entry;
-}
-simdjson_really_inline void sax_tweet_reader_visitor::field_lookup::add(const char * key, size_t len, containers c, field_type type, size_t offset) {
-  auto index = hash(key, uint32_t(c));
-  if (index == 0) {
-    fprintf(stderr, "%s (depth %d) hashes to zero, which is used as 'missing value'\n", key, int(c));
-    assert(false);
-  }
-  if (entries[index].key) {
-    fprintf(stderr, "%s (depth %d) collides with %s (depth %d) !\n", key, int(c), entries[index].key, int(entries[index].container));
-    assert(false);
-  }
-  entries[index] = { key, len, offset, c, type };
-}
-simdjson_really_inline void sax_tweet_reader_visitor::field_lookup::neg(const char * const key, uint32_t depth) {
-  auto index = hash(key, depth);
-  if (entries[index].key) {
-    fprintf(stderr, "%s (depth %d) conflicts with %s (depth %d) !\n", key, depth, entries[index].key, int(entries[index].container));
-  }
-}
-
-sax_tweet_reader_visitor::field_lookup::field_lookup() {
-  add("\"statuses\"", std::strlen("\"statuses\""), containers::top_object, field_type::array, 0); // { "statuses": [...]
-  #define TWEET_FIELD(KEY, TYPE) add("\"" #KEY "\"", std::strlen("\"" #KEY "\""), containers::tweet, TYPE, offsetof(tweet, KEY));
-  TWEET_FIELD(id, field_type::unsigned_integer);
-  TWEET_FIELD(in_reply_to_status_id, field_type::nullable_unsigned_integer);
-  TWEET_FIELD(retweet_count, field_type::unsigned_integer);
-  TWEET_FIELD(favorite_count, field_type::unsigned_integer);
-  TWEET_FIELD(text, field_type::string);
-  TWEET_FIELD(created_at, field_type::string);
-  TWEET_FIELD(user, field_type::object)
-  #undef TWEET_FIELD
-  #define USER_FIELD(KEY, TYPE) add("\"" #KEY "\"", std::strlen("\"" #KEY "\""), containers::user, TYPE, offsetof(tweet, user)+offsetof(twitter_user, KEY));
-  USER_FIELD(id, field_type::unsigned_integer);
-  USER_FIELD(screen_name, field_type::string);
-  #undef USER_FIELD
-
-  // Check for collisions with other (unused) hash keys in typical twitter JSON
-  #define NEG(key, depth) neg("\"" #key "\"", depth);
-  NEG(display_url, 9);
-  NEG(expanded_url, 9);
-  neg("\"h\":", 9);
-  NEG(indices, 9);
-  NEG(resize, 9);
-  NEG(url, 9);
-  neg("\"w\":", 9);
-  NEG(display_url, 8);
-  NEG(expanded_url, 8);
-  neg("\"h\":", 8);
-  NEG(indices, 8);
-  NEG(large, 8);
-  NEG(medium, 8);
-  NEG(resize, 8);
-  NEG(small, 8);
-  NEG(thumb, 8);
-  NEG(url, 8);
-  neg("\"w\":", 8);
-  NEG(display_url, 7);
-  NEG(expanded_url, 7);
-  NEG(id_str, 7);
-  NEG(id, 7);
-  NEG(indices, 7);
-  NEG(large, 7);
-  NEG(media_url_https, 7);
-  NEG(media_url, 7);
-  NEG(medium, 7);
-  NEG(name, 7);
-  NEG(sizes, 7);
-  NEG(small, 7);
-  NEG(source_status_id_str, 7);
-  NEG(source_status_id, 7);
-  NEG(thumb, 7);
-  NEG(type, 7);
-  NEG(url, 7);
-  NEG(urls, 7);
-  NEG(description, 6);
-  NEG(display_url, 6);
-  NEG(expanded_url, 6);
-  NEG(id_str, 6);
-  NEG(id, 6);
-  NEG(indices, 6);
-  NEG(media_url_https, 6);
-  NEG(media_url, 6);
-  NEG(name, 6);
-  NEG(sizes, 6);
-  NEG(source_status_id_str, 6);
-  NEG(source_status_id, 6);
-  NEG(type, 6);
-  NEG(url, 6);
-  NEG(urls, 6);
-  NEG(contributors_enabled, 5);
-  NEG(default_profile_image, 5);
-  NEG(default_profile, 5);
-  NEG(description, 5);
-  NEG(entities, 5);
-  NEG(favourites_count, 5);
-  NEG(follow_request_sent, 5);
-  NEG(followers_count, 5);
-  NEG(following, 5);
-  NEG(friends_count, 5);
-  NEG(geo_enabled, 5);
-  NEG(hashtags, 5);
-  NEG(id_str, 5);
-  NEG(id, 5);
-  NEG(is_translation_enabled, 5);
-  NEG(is_translator, 5);
-  NEG(iso_language_code, 5);
-  NEG(lang, 5);
-  NEG(listed_count, 5);
-  NEG(location, 5);
-  NEG(media, 5);
-  NEG(name, 5);
-  NEG(notifications, 5);
-  NEG(profile_background_color, 5);
-  NEG(profile_background_image_url_https, 5);
-  NEG(profile_background_image_url, 5);
-  NEG(profile_background_tile, 5);
-  NEG(profile_banner_url, 5);
-  NEG(profile_image_url_https, 5);
-  NEG(profile_image_url, 5);
-  NEG(profile_link_color, 5);
-  NEG(profile_sidebar_border_color, 5);
-  NEG(profile_sidebar_fill_color, 5);
-  NEG(profile_text_color, 5);
-  NEG(profile_use_background_image, 5);
-  NEG(protected, 5);
-  NEG(result_type, 5);
-  NEG(statuses_count, 5);
-  NEG(symbols, 5);
-  NEG(time_zone, 5);
-  NEG(url, 5);
-  NEG(urls, 5);
-  NEG(user_mentions, 5);
-  NEG(utc_offset, 5);
-  NEG(verified, 5);
-  NEG(contributors_enabled, 4);
-  NEG(contributors, 4);
-  NEG(coordinates, 4);
-  NEG(default_profile_image, 4);
-  NEG(default_profile, 4);
-  NEG(description, 4);
-  NEG(entities, 4);
-  NEG(favorited, 4);
-  NEG(favourites_count, 4);
-  NEG(follow_request_sent, 4);
-  NEG(followers_count, 4);
-  NEG(following, 4);
-  NEG(friends_count, 4);
-  NEG(geo_enabled, 4);
-  NEG(geo, 4);
-  NEG(hashtags, 4);
-  NEG(id_str, 4);
-  NEG(in_reply_to_screen_name, 4);
-  NEG(in_reply_to_status_id_str, 4);
-  NEG(in_reply_to_user_id_str, 4);
-  NEG(in_reply_to_user_id, 4);
-  NEG(is_translation_enabled, 4);
-  NEG(is_translator, 4);
-  NEG(iso_language_code, 4);
-  NEG(lang, 4);
-  NEG(listed_count, 4);
-  NEG(location, 4);
-  NEG(media, 4);
-  NEG(metadata, 4);
-  NEG(name, 4);
-  NEG(notifications, 4);
-  NEG(place, 4);
-  NEG(possibly_sensitive, 4);
-  NEG(profile_background_color, 4);
-  NEG(profile_background_image_url_https, 4);
-  NEG(profile_background_image_url, 4);
-  NEG(profile_background_tile, 4);
-  NEG(profile_banner_url, 4);
-  NEG(profile_image_url_https, 4);
-  NEG(profile_image_url, 4);
-  NEG(profile_link_color, 4);
-  NEG(profile_sidebar_border_color, 4);
-  NEG(profile_sidebar_fill_color, 4);
-  NEG(profile_text_color, 4);
-  NEG(profile_use_background_image, 4);
-  NEG(protected, 4);
-  NEG(result_type, 4);
-  NEG(retweeted, 4);
-  NEG(source, 4);
-  NEG(statuses_count, 4);
-  NEG(symbols, 4);
-  NEG(time_zone, 4);
-  NEG(truncated, 4);
-  NEG(url, 4);
-  NEG(urls, 4);
-  NEG(user_mentions, 4);
-  NEG(utc_offset, 4);
-  NEG(verified, 4);
-  NEG(contributors, 3);
-  NEG(coordinates, 3);
-  NEG(entities, 3);
-  NEG(favorited, 3);
-  NEG(geo, 3);
-  NEG(id_str, 3);
-  NEG(in_reply_to_screen_name, 3);
-  NEG(in_reply_to_status_id_str, 3);
-  NEG(in_reply_to_user_id_str, 3);
-  NEG(in_reply_to_user_id, 3);
-  NEG(lang, 3);
-  NEG(metadata, 3);
-  NEG(place, 3);
-  NEG(possibly_sensitive, 3);
-  NEG(retweeted_status, 3);
-  NEG(retweeted, 3);
-  NEG(source, 3);
-  NEG(truncated, 3);
-  NEG(completed_in, 2);
-  NEG(count, 2);
-  NEG(max_id_str, 2);
-  NEG(max_id, 2);
-  NEG(next_results, 2);
-  NEG(query, 2);
-  NEG(refresh_url, 2);
-  NEG(since_id_str, 2);
-  NEG(since_id, 2);
-  NEG(search_metadata, 1);
-  #undef NEG
-}
-
-// sax_tweet_reader_visitor::field_lookup::find_min() {
-//   int min_count = 100000;
-//   for (int a=0;a<4;a++) {
-//     for (int b=0;b<4;b++) {
-//       for (int c=0;c<4;c++) {
-//         sax_tweet_reader_visitor::field_lookup fields(a,b,c);
-//         if (fields.collision_count) { continue; }
-//         if (fields.zero_emission) { continue; }
-//         if (fields.conflict_count < min_count) { printf("min=%d,%d,%d (%d)", a, b, c, fields.conflict_count); }
-//       }
-//     }
-//   }
-// }
-
-} // namespace partial_tweets

benchmark/partial_tweets/tweet.h

@@ -1,57 +0,0 @@
-#pragma once
-
-#include "simdjson.h"
-#include "twitter_user.h"
-
-namespace partial_tweets {
-
-// {
-//   "statuses": [
-//     {
-//       "created_at": "Sun Aug 31 00:29:15 +0000 2014",
-//       "id": 505874924095815700,
-//       "text": "@aym0566x \n\n名前:前田あゆみ\n第一印象:なんか怖っ！\n今の印象:とりあえずキモい。噛み合わない\n好きなところ:ぶすでキモいとこ😋✨✨\n思い出:んーーー、ありすぎ😊❤️\nLINE交換できる？:あぁ……ごめん✋\nトプ画をみて:照れますがな😘✨\n一言:お前は一生もんのダチ💖",
-//       "in_reply_to_status_id": null,
-//       "user": {
-//         "id": 1186275104,
-//         "screen_name": "ayuu0123"
-//       },
-//       "retweet_count": 0,
-//       "favorite_count": 0
-//     }
-//   ]
-// }
-
-struct tweet {
-  std::string_view created_at{};
-  uint64_t id{};
-  std::string_view text{};
-  uint64_t in_reply_to_status_id{};
-  twitter_user user{};
-  uint64_t retweet_count{};
-  uint64_t favorite_count{};
-  simdjson_really_inline bool operator==(const tweet &other) const {
-    return created_at == other.created_at &&
-           id == other.id &&
-           text == other.text &&
-           in_reply_to_status_id == other.in_reply_to_status_id &&
-           user == other.user &&
-           retweet_count == other.retweet_count &&
-           favorite_count == other.favorite_count;
-  }
-  simdjson_really_inline bool operator!=(const tweet &other) const { return !(*this == other); }
-};
-
-simdjson_unused static std::ostream &operator<<(std::ostream &o, const tweet &t) {
-  o << "created_at: " << t.created_at << std::endl;
-  o << "id: " << t.id << std::endl;
-  o << "text: " << t.text << std::endl;
-  o << "in_reply_to_status_id: " << t.in_reply_to_status_id << std::endl;
-  o << "user.id: " << t.user.id << std::endl;
-  o << "user.screen_name: " << t.user.screen_name << std::endl;
-  o << "retweet_count: " << t.retweet_count << std::endl;
-  o << "favorite_count: " << t.favorite_count << std::endl;
-  return o;
-}
-
-} // namespace partial_tweets

benchmark/partial_tweets/twitter_user.h

@@ -1,16 +0,0 @@
-#pragma once
-#include "simdjson.h"
-
-namespace partial_tweets {
-
-struct twitter_user {
-  uint64_t id{};
-  std::string_view screen_name{};
-
-  bool operator==(const twitter_user &other) const {
-    return id == other.id &&
-           screen_name == other.screen_name;
-  }
-};
-
-} // namespace partial_tweets