Full Code of MarcDirven/cpp-lazy for AI

master 7cec5c9c4b3b cached
424 files
1.6 MB
477.7k tokens
2607 symbols
1 requests
Download .txt
Showing preview only (1,805K chars total). Download the full file or copy to clipboard to get everything.
Repository: MarcDirven/cpp-lazy
Branch: master
Commit: 7cec5c9c4b3b
Files: 424
Total size: 1.6 MB

Directory structure:
gitextract_mzintsjp/

├── .clang-format
├── .github/
│   └── workflows/
│       ├── ci.yml
│       ├── clang.yml
│       ├── codeql.yml
│       ├── examples.yml
│       ├── gcc.yml
│       ├── make-release.yml
│       ├── module-tests.yml
│       └── msvc.yml
├── .gitignore
├── CMakeLists.txt
├── Doxyfile
├── LICENSE.md
├── README.md
├── all/
│   └── CMakeLists.txt
├── bench/
│   ├── .gitignore
│   ├── CMakeLists.txt
│   ├── bar_chart_maker.py
│   ├── benchmarks-iterators.cpp
│   ├── lz/
│   │   ├── CMakeLists.txt
│   │   └── compile-times.cpp
│   ├── requirements.txt
│   └── std/
│       ├── CMakeLists.txt
│       └── compile-times.cpp
├── cmake/
│   ├── cpp-lazy.pc.in
│   └── cpp-lazyConfig.cmake.in
├── docs/
│   └── .gitkeep
├── examples/
│   ├── CMakeLists.txt
│   ├── algorithm.cpp
│   ├── any_iterable.cpp
│   ├── as_iterator.cpp
│   ├── basic_iterable.cpp
│   ├── c_string.cpp
│   ├── cached_reverse.cpp
│   ├── cached_size.cpp
│   ├── cartesian_product.cpp
│   ├── chunk_if.cpp
│   ├── chunks.cpp
│   ├── common.cpp
│   ├── concatenate.cpp
│   ├── drop.cpp
│   ├── drop_while.cpp
│   ├── duplicates.cpp
│   ├── enumerate.cpp
│   ├── except.cpp
│   ├── exclude.cpp
│   ├── exclusive_scan.cpp
│   ├── filter.cpp
│   ├── flatten.cpp
│   ├── generate.cpp
│   ├── generate_while.cpp
│   ├── group_by.cpp
│   ├── inclusive_scan.cpp
│   ├── interleave.cpp
│   ├── intersection.cpp
│   ├── iter_tools.cpp
│   ├── join_where.cpp
│   ├── loop.cpp
│   ├── map.cpp
│   ├── maybe_owned.cpp
│   ├── pairwise.cpp
│   ├── pipe.cpp
│   ├── print_and_format.cpp
│   ├── random.cpp
│   ├── range.cpp
│   ├── regex_split.cpp
│   ├── repeat.cpp
│   ├── rotate.cpp
│   ├── slice.cpp
│   ├── split.cpp
│   ├── take.cpp
│   ├── take_every.cpp
│   ├── take_while.cpp
│   ├── to_container.cpp
│   ├── unique.cpp
│   ├── zip.cpp
│   └── zip_longest.cpp
├── include/
│   └── Lz/
│       ├── algorithm/
│       │   ├── accumulate.hpp
│       │   ├── adjacent_find.hpp
│       │   ├── algorithm.hpp
│       │   ├── all_of.hpp
│       │   ├── any_of.hpp
│       │   ├── back.hpp
│       │   ├── back_or.hpp
│       │   ├── binary_search.hpp
│       │   ├── contains.hpp
│       │   ├── copy.hpp
│       │   ├── count.hpp
│       │   ├── count_if.hpp
│       │   ├── empty.hpp
│       │   ├── ends_with.hpp
│       │   ├── equal.hpp
│       │   ├── find.hpp
│       │   ├── find_if.hpp
│       │   ├── find_if_not.hpp
│       │   ├── find_last.hpp
│       │   ├── find_last_if.hpp
│       │   ├── find_last_if_not.hpp
│       │   ├── find_last_or_default.hpp
│       │   ├── find_last_or_default_if.hpp
│       │   ├── find_last_or_default_if_not.hpp
│       │   ├── find_last_or_default_not.hpp
│       │   ├── find_or_default.hpp
│       │   ├── find_or_default_if.hpp
│       │   ├── for_each.hpp
│       │   ├── for_each_while.hpp
│       │   ├── for_each_while_n.hpp
│       │   ├── front.hpp
│       │   ├── front_or.hpp
│       │   ├── has_many.hpp
│       │   ├── has_one.hpp
│       │   ├── index_of.hpp
│       │   ├── index_of_if.hpp
│       │   ├── is_sorted.hpp
│       │   ├── lower_bound.hpp
│       │   ├── max_element.hpp
│       │   ├── mean.hpp
│       │   ├── min_element.hpp
│       │   ├── none_of.hpp
│       │   ├── npos.hpp
│       │   ├── nth.hpp
│       │   ├── partition.hpp
│       │   ├── peek.hpp
│       │   ├── search.hpp
│       │   ├── starts_with.hpp
│       │   ├── transform.hpp
│       │   └── upper_bound.hpp
│       ├── any_iterable.hpp
│       ├── as_iterator.hpp
│       ├── basic_iterable.hpp
│       ├── c_string.hpp
│       ├── cached_size.hpp
│       ├── cartesian_product.hpp
│       ├── chunk_if.hpp
│       ├── chunks.hpp
│       ├── common.hpp
│       ├── concatenate.hpp
│       ├── detail/
│       │   ├── adaptors/
│       │   │   ├── as_iterator.hpp
│       │   │   ├── c_string.hpp
│       │   │   ├── cached_size.hpp
│       │   │   ├── cartesian_product.hpp
│       │   │   ├── chunk_if.hpp
│       │   │   ├── chunks.hpp
│       │   │   ├── common.hpp
│       │   │   ├── concatenate.hpp
│       │   │   ├── drop.hpp
│       │   │   ├── drop_while.hpp
│       │   │   ├── duplicates.hpp
│       │   │   ├── enumerate.hpp
│       │   │   ├── except.hpp
│       │   │   ├── exclude.hpp
│       │   │   ├── exclusive_scan.hpp
│       │   │   ├── filter.hpp
│       │   │   ├── flatten.hpp
│       │   │   ├── fn_args_holder.hpp
│       │   │   ├── generate.hpp
│       │   │   ├── generate_while.hpp
│       │   │   ├── group_by.hpp
│       │   │   ├── inclusive_scan.hpp
│       │   │   ├── interleave.hpp
│       │   │   ├── intersection.hpp
│       │   │   ├── iter_tools.hpp
│       │   │   ├── join_where.hpp
│       │   │   ├── loop.hpp
│       │   │   ├── map.hpp
│       │   │   ├── pairwise.hpp
│       │   │   ├── random.hpp
│       │   │   ├── range.hpp
│       │   │   ├── regex_split.hpp
│       │   │   ├── repeat.hpp
│       │   │   ├── reverse.hpp
│       │   │   ├── rotate.hpp
│       │   │   ├── slice.hpp
│       │   │   ├── split.hpp
│       │   │   ├── take.hpp
│       │   │   ├── take_every.hpp
│       │   │   ├── take_while.hpp
│       │   │   ├── unique.hpp
│       │   │   ├── zip.hpp
│       │   │   └── zip_longest.hpp
│       │   ├── algorithm/
│       │   │   ├── accumulate.hpp
│       │   │   ├── adjacent_find.hpp
│       │   │   ├── back.hpp
│       │   │   ├── copy.hpp
│       │   │   ├── count.hpp
│       │   │   ├── count_if.hpp
│       │   │   ├── ends_with.hpp
│       │   │   ├── equal.hpp
│       │   │   ├── find_if.hpp
│       │   │   ├── find_last_if.hpp
│       │   │   ├── for_each.hpp
│       │   │   ├── for_each_while.hpp
│       │   │   ├── for_each_while_n.hpp
│       │   │   ├── index_of_if.hpp
│       │   │   ├── is_sorted.hpp
│       │   │   ├── lower_bound.hpp
│       │   │   ├── max_element.hpp
│       │   │   ├── mean.hpp
│       │   │   ├── partition.hpp
│       │   │   ├── peek.hpp
│       │   │   ├── search.hpp
│       │   │   ├── starts_with.hpp
│       │   │   └── transform.hpp
│       │   ├── compiler_config.hpp
│       │   ├── fake_ptr_proxy.hpp
│       │   ├── func_container.hpp
│       │   ├── iterables/
│       │   │   ├── as_iterator.hpp
│       │   │   ├── c_string.hpp
│       │   │   ├── cached_size.hpp
│       │   │   ├── cartesian_product.hpp
│       │   │   ├── chunk_if.hpp
│       │   │   ├── chunks.hpp
│       │   │   ├── common.hpp
│       │   │   ├── concatenate.hpp
│       │   │   ├── drop.hpp
│       │   │   ├── drop_while.hpp
│       │   │   ├── duplicates.hpp
│       │   │   ├── enumerate.hpp
│       │   │   ├── except.hpp
│       │   │   ├── exclude.hpp
│       │   │   ├── exclusive_scan.hpp
│       │   │   ├── filter.hpp
│       │   │   ├── flatten.hpp
│       │   │   ├── generate.hpp
│       │   │   ├── generate_while.hpp
│       │   │   ├── group_by.hpp
│       │   │   ├── inclusive_scan.hpp
│       │   │   ├── interleave.hpp
│       │   │   ├── intersection.hpp
│       │   │   ├── join_where.hpp
│       │   │   ├── loop.hpp
│       │   │   ├── map.hpp
│       │   │   ├── pairwise.hpp
│       │   │   ├── random.hpp
│       │   │   ├── range.hpp
│       │   │   ├── regex_split.hpp
│       │   │   ├── repeat.hpp
│       │   │   ├── reverse.hpp
│       │   │   ├── rotate.hpp
│       │   │   ├── split.hpp
│       │   │   ├── take.hpp
│       │   │   ├── take_every.hpp
│       │   │   ├── take_while.hpp
│       │   │   ├── unique.hpp
│       │   │   ├── zip.hpp
│       │   │   └── zip_longest.hpp
│       │   ├── iterator.hpp
│       │   ├── iterators/
│       │   │   ├── any_iterable/
│       │   │   │   ├── any_iterator_impl.hpp
│       │   │   │   └── iterator_base.hpp
│       │   │   ├── as_iterator.hpp
│       │   │   ├── c_string.hpp
│       │   │   ├── cached_reverse.hpp
│       │   │   ├── cartesian_product.hpp
│       │   │   ├── chunk_if.hpp
│       │   │   ├── chunks.hpp
│       │   │   ├── common.hpp
│       │   │   ├── concatenate.hpp
│       │   │   ├── duplicates.hpp
│       │   │   ├── enumerate.hpp
│       │   │   ├── except.hpp
│       │   │   ├── exclude.hpp
│       │   │   ├── exclusive_scan.hpp
│       │   │   ├── filter.hpp
│       │   │   ├── flatten.hpp
│       │   │   ├── generate.hpp
│       │   │   ├── generate_while.hpp
│       │   │   ├── group_by.hpp
│       │   │   ├── inclusive_scan.hpp
│       │   │   ├── interleave.hpp
│       │   │   ├── intersection.hpp
│       │   │   ├── iterator_wrapper.hpp
│       │   │   ├── join_where.hpp
│       │   │   ├── loop.hpp
│       │   │   ├── map.hpp
│       │   │   ├── pairwise.hpp
│       │   │   ├── random.hpp
│       │   │   ├── range.hpp
│       │   │   ├── regex_split.hpp
│       │   │   ├── repeat.hpp
│       │   │   ├── rotate.hpp
│       │   │   ├── split.hpp
│       │   │   ├── take.hpp
│       │   │   ├── take_every.hpp
│       │   │   ├── take_while.hpp
│       │   │   ├── unique.hpp
│       │   │   ├── zip.hpp
│       │   │   └── zip_longest.hpp
│       │   ├── maybe_owned.hpp
│       │   ├── procs/
│       │   │   ├── addressof.hpp
│       │   │   ├── assert.hpp
│       │   │   ├── begin_end.hpp
│       │   │   ├── decompose.hpp
│       │   │   ├── distance.hpp
│       │   │   ├── get_end.hpp
│       │   │   ├── min_max.hpp
│       │   │   ├── next_fast.hpp
│       │   │   ├── operators.hpp
│       │   │   ├── sentinel_operators.hpp
│       │   │   └── tuple_expand.hpp
│       │   ├── traits/
│       │   │   ├── conditional.hpp
│       │   │   ├── conjunction.hpp
│       │   │   ├── enable_if.hpp
│       │   │   ├── first_arg.hpp
│       │   │   ├── func_ret_type.hpp
│       │   │   ├── index_sequence.hpp
│       │   │   ├── is_adaptor.hpp
│       │   │   ├── is_invocable.hpp
│       │   │   ├── is_iterable.hpp
│       │   │   ├── is_reference_wrapper.hpp
│       │   │   ├── is_sentinel.hpp
│       │   │   ├── is_sized.hpp
│       │   │   ├── iterator_categories.hpp
│       │   │   ├── remove_ref.hpp
│       │   │   ├── std_algo_compat.hpp
│       │   │   ├── strict_iterator_traits.hpp
│       │   │   └── void.hpp
│       │   ├── tuple_helpers.hpp
│       │   ├── unique_ptr.hpp
│       │   └── variant.hpp
│       ├── drop.hpp
│       ├── drop_while.hpp
│       ├── duplicates.hpp
│       ├── enumerate.hpp
│       ├── except.hpp
│       ├── exclude.hpp
│       ├── exclusive_scan.hpp
│       ├── filter.hpp
│       ├── flatten.hpp
│       ├── generate.hpp
│       ├── generate_while.hpp
│       ├── group_by.hpp
│       ├── inclusive_scan.hpp
│       ├── interleave.hpp
│       ├── intersection.hpp
│       ├── iter_tools.hpp
│       ├── join_where.hpp
│       ├── loop.hpp
│       ├── map.hpp
│       ├── pairwise.hpp
│       ├── procs/
│       │   ├── chain.hpp
│       │   ├── distance.hpp
│       │   ├── eager_size.hpp
│       │   ├── procs.hpp
│       │   ├── size.hpp
│       │   └── to.hpp
│       ├── random.hpp
│       ├── range.hpp
│       ├── regex_split.hpp
│       ├── repeat.hpp
│       ├── reverse.hpp
│       ├── rotate.hpp
│       ├── slice.hpp
│       ├── split.hpp
│       ├── stream.hpp
│       ├── take.hpp
│       ├── take_every.hpp
│       ├── take_while.hpp
│       ├── traits/
│       │   ├── concepts.hpp
│       │   ├── is_sized.hpp
│       │   ├── iter_type.hpp
│       │   ├── lazy_view.hpp
│       │   └── traits.hpp
│       ├── unique.hpp
│       ├── util/
│       │   ├── default_sentinel.hpp
│       │   ├── optional.hpp
│       │   ├── string_view.hpp
│       │   └── util.hpp
│       ├── zip.hpp
│       └── zip_longest.hpp
├── src/
│   └── lz.cppm
└── tests/
    ├── CMakeLists.txt
    ├── algorithm.cpp
    ├── any_iterable.cpp
    ├── as_iterator.cpp
    ├── c_string.cpp
    ├── cached_size.cpp
    ├── cartesian_product.cpp
    ├── chunk_if.cpp
    ├── chunks.cpp
    ├── common.cpp
    ├── concatenate.cpp
    ├── cpp-lazy-ut-helper/
    │   ├── CMakeLists.txt
    │   └── include/
    │       └── cpp-lazy-ut-helper/
    │           ├── pch.hpp
    │           ├── test_procs.hpp
    │           └── ut_helper.hpp
    ├── duplicates.cpp
    ├── enumerate.cpp
    ├── except.cpp
    ├── exclude.cpp
    ├── exclusive_scan.cpp
    ├── filter.cpp
    ├── flatten.cpp
    ├── generate.cpp
    ├── generate_while.cpp
    ├── group_by.cpp
    ├── inclusive_scan.cpp
    ├── init.cpp
    ├── interleave.cpp
    ├── intersection.cpp
    ├── iter_tools.cpp
    ├── iterator.cpp
    ├── join_where.cpp
    ├── loop.cpp
    ├── map.cpp
    ├── maybe_owned.cpp
    ├── module_tests/
    │   ├── CMakeLists.txt
    │   └── module_test.cpp
    ├── pairwise.cpp
    ├── piping.cpp
    ├── random.cpp
    ├── range.cpp
    ├── regex_split.cpp
    ├── repeat.cpp
    ├── reverse.cpp
    ├── rotate.cpp
    ├── split.cpp
    ├── standalone.cpp
    ├── string_view.cpp
    ├── take.cpp
    ├── take_every.cpp
    ├── take_while.cpp
    ├── unique.cpp
    ├── zip.cpp
    └── zip_longest.cpp

================================================
FILE CONTENTS
================================================

================================================
FILE: .clang-format
================================================
---
AccessModifierOffset: -4
AllowShortFunctionsOnASingleLine: None
AllowShortEnumsOnASingleLine: false
AllowShortCaseLabelsOnASingleLine: false
AllowShortBlocksOnASingleLine: Never
AllowShortIfStatementsOnASingleLine: WithoutElse
AllowShortLambdasOnASingleLine: Inline
AllowShortLoopsOnASingleLine: false
ConstructorInitializerAllOnOneLineOrOnePerLine: true
AllowAllConstructorInitializersOnNextLine : false
BreakConstructorInitializers: AfterColon
AlwaysBreakTemplateDeclarations: Yes
ColumnLimit: 130
ContinuationIndentWidth: 4
Cpp11BracedListStyle: false
BreakBeforeBraces: Custom
BraceWrapping:
  AfterCaseLabel: false
  AfterClass: false
  AfterControlStatement: Never
  AfterEnum: false
  AfterFunction: false
  AfterNamespace: false
  AfterStruct: false
  AfterUnion: false
  AfterExternBlock: false
  BeforeCatch: true
  BeforeElse: true
  BeforeLambdaBody: false
  BeforeWhile: false
  SplitEmptyFunction: false
  SplitEmptyRecord: false
  SplitEmptyNamespace: false
FixNamespaceComments: true
IncludeBlocks: Regroup
IndentPPDirectives: None
IndentWrappedFunctionNames: false
PenaltyReturnTypeOnItsOwnLine: 6
PointerAlignment: Left
SpaceAfterTemplateKeyword: false
IndentWidth: 4
TabWidth: 4
InsertNewlineAtEOF: true
BasedOnStyle: LLVM

---


================================================
FILE: .github/workflows/ci.yml
================================================
name: Continuous Integration

on:
  push:
    branches:
      - master

  pull_request:
    branches:
      - master

  workflow_dispatch: ~

  schedule:
    - cron: '0 8 * * 1'

jobs:
  gcc:
    uses: ./.github/workflows/gcc.yml

  clang:
    uses: ./.github/workflows/clang.yml

  msvc:
    uses: ./.github/workflows/msvc.yml

  examples:
    uses: ./.github/workflows/examples.yml
  
  module_tests:
    uses: ./.github/workflows/module-tests.yml


================================================
FILE: .github/workflows/clang.yml
================================================
env:
  CTEST_OUTPUT_ON_FAILURE: 1
  LIBCXX_STANDARDS_JSON: '["20","23"]'

on:
  workflow_call:

jobs:
  clang:
    name: clang-${{ matrix.version }} (C++${{ matrix.standard }})

    strategy:
      fail-fast: false
      matrix:
        version: [17]
        standard: [11, 14, 17, 20, 23]

    runs-on: ubuntu-latest

    steps:
      - name: Checkout repo
        uses: actions/checkout@v1
    
      - name: Install Ninja
        uses: seanmiddleditch/gha-setup-ninja@master

      - name: Install Clang ${{ matrix.version }}
        run: sudo apt-get install -y clang-${{ matrix.version }}
      
      - name: Install libc++ Clang ${{ matrix.version }}
        if: contains(fromJson(env.LIBCXX_STANDARDS_JSON), matrix.standard)
        run: sudo apt-get install -y libc++-${{ matrix.version }}-dev libc++abi-${{ matrix.version }}-dev

      - name: Configure (install)
        env:
          CC: clang-${{ matrix.version }}
          CXX: clang-${{ matrix.version }}
        run: |
          sudo apt-get update && sudo apt-get install -y jq
          STDS=$(echo '${{ env.LIBCXX_STANDARDS_JSON }}' | jq -r '.[]' | xargs)
          if echo "$STDS" | grep -wq "${{ matrix.standard }}"; then
            CXX_FLAGS='-stdlib=libc++'
          else
            CXX_FLAGS=''
          fi
          cmake -S . -B build/install -G Ninja \
            -D CMAKE_CXX_STANDARD:STRING=${{ matrix.standard }} \
            -D CMAKE_CXX_FLAGS=$CXX_FLAGS \
            -D CPP_LAZY_INSTALL:BOOL=ON \
            -D CMAKE_BUILD_TYPE:STRING=Release \
            -D CMAKE_INSTALL_PREFIX=build/prefix \
            -D CMAKE_CXX_COMPILER=clang++-${{ matrix.version }}

      - name: Build (install)
        run: cmake --build build/install -j $(nproc)

      - name: Install
        run: cmake --install build/install

      - name: Configure tests
        run: |
          sudo apt-get update && sudo apt-get install -y jq
          STDS=$(echo '${{ env.LIBCXX_STANDARDS_JSON }}' | jq -r '.[]' | xargs)
          if echo "$STDS" | grep -wq "${{ matrix.standard }}"; then
            CXX_FLAGS='-stdlib=libc++'
          else
            CXX_FLAGS=''
          fi
          cmake -S tests -B build/tests -G Ninja \
            -D CMAKE_BUILD_TYPE:STRING=Release \
            -D "CMAKE_CXX_FLAGS=$CXX_FLAGS" \
            -D CPP_LAZY_DOCTEST_VERSION:STRING=${{ vars.DOCTEST_VERSION }} \
            -D TEST_INSTALLED_VERSION:BOOL=YES \
            -D CMAKE_CXX_COMPILER=clang++-${{ matrix.version }} \
            -D CMAKE_INSTALL_PREFIX=build/prefix \
            -D CMAKE_CXX_STANDARD:STRING=${{ matrix.standard }}

      - name: Build tests
        run: cmake --build build/tests -j $(nproc)

      - name: Run tests
        working-directory: build/tests
        run: ctest -VV --output-on-failure -j $(nproc)


================================================
FILE: .github/workflows/codeql.yml
================================================
name: "CodeQL"

on:
  push:
    branches: [ "master", dev ]
  pull_request:
    branches: [ "master" ]

env:
  DOCTEST_VERSION: '2.4.12'

jobs:
  analyze:
    name: Analyze
    runs-on: ubuntu-latest
    permissions:
      actions: read
      contents: read
      security-events: write

    strategy:
      fail-fast: false
      matrix:
        language: [ 'cpp' ]
        standard: [ '11', '20' ]
        version: [ '13' ]

    steps:
    - name: Checkout repository
      uses: actions/checkout@v3

    - name: Initialize CodeQL
      uses: github/codeql-action/init@v3
      with:
        languages: ${{ matrix.language }}

    - name: Install GCC ${{ matrix.version }}
      run: sudo apt-get install -y gcc-${{ matrix.version }} g++-${{ matrix.version }}

    - name: Configure (install)
      env:
        CC: gcc-${{ matrix.version }}
        CXX: g++-${{ matrix.version }}
      run: cmake -S . -B build/install -G Ninja
        -D CPP_LAZY_INSTALL:BOOL=ON
        -D CMAKE_CXX_STANDARD:STRING=${{ matrix.standard }}
        -D CMAKE_BUILD_TYPE:STRING=Release
        -D CMAKE_INSTALL_PREFIX=build/prefix

    - name: Build (install)
      run: cmake --build build/install -j $(nproc)

    - name: Install
      run: cmake --install build/install

    - name: Configure tests
      run: cmake -S tests -B build/tests -G Ninja
        -D CMAKE_BUILD_TYPE:STRING=Release
        -D CPP_LAZY_DOCTEST_VERSION:STRING=${{ env.DOCTEST_VERSION }}
        -D TEST_INSTALLED_VERSION:BOOL=YES
        -D CMAKE_INSTALL_PREFIX=build/prefix
        -D CMAKE_CXX_STANDARD:STRING=${{ matrix.standard }}

    - name: Build tests
      run: cmake --build build/tests -j $(nproc)

    - name: Perform CodeQL Analysis
      uses: github/codeql-action/analyze@v3


================================================
FILE: .github/workflows/examples.yml
================================================
on:
  workflow_call:

jobs:
  examples:
    runs-on: ubuntu-latest

    strategy:
      fail-fast: false
      matrix:
        version: [11, 14, 17, 20, 23]

    steps:
      - name: Checkout repo
        uses: actions/checkout@v1

      - name: Install Ninja
        uses: seanmiddleditch/gha-setup-ninja@master

      - name: Configure
        run: cmake -S examples -B build/examples -G Ninja
          -D CMAKE_BUILD_TYPE:STRING=Release
          -D CMAKE_CXX_STANDARD:STRING=${{ matrix.version }}

      - name: Build
        run: cmake --build build/examples -j $(nproc)


================================================
FILE: .github/workflows/gcc.yml
================================================
env:
  CTEST_OUTPUT_ON_FAILURE: 1

on:
  workflow_call:

jobs:
  gcc:
    name: gcc-${{ matrix.version }} (C++${{ matrix.standard }})

    strategy:
      fail-fast: false
      matrix:
        version: [11, 13]
        standard: [11, 14, 17, 20, 23]

    runs-on: ubuntu-latest

    steps:
      - name: Checkout repo
        uses: actions/checkout@v1

      - name: Install Ninja
        uses: seanmiddleditch/gha-setup-ninja@master

      - name: Install GCC ${{ matrix.version }}
        run: |
          sudo add-apt-repository ppa:ubuntu-toolchain-r/test -y
          sudo apt update
          sudo apt-get install -y gcc-${{ matrix.version }} g++-${{ matrix.version }}

      - name: Configure (install)
        env:
          CC: gcc-${{ matrix.version }}
          CXX: g++-${{ matrix.version }}
        run: cmake -S . -B build/install -G Ninja
          -D CMAKE_CXX_STANDARD:STRING=${{ matrix.standard }}
          -D CMAKE_BUILD_TYPE:STRING=Release
          -D CPP_LAZY_INSTALL:BOOL=ON
          -D CMAKE_INSTALL_PREFIX=build/prefix
          -D CMAKE_CXX_COMPILER=g++-${{ matrix.version }}

      - name: Build (install)
        run: cmake --build build/install -j $(nproc)

      - name: Install
        run: cmake --install build/install

      - name: Configure tests
        run: cmake -S tests -B build/tests -G Ninja
          -D CMAKE_BUILD_TYPE:STRING=Release
          -D CPP_LAZY_DOCTEST_VERSION:STRING=${{ vars.DOCTEST_VERSION }}
          -D TEST_INSTALLED_VERSION:BOOL=YES
          -D CMAKE_INSTALL_PREFIX=build/prefix
          -D CMAKE_CXX_STANDARD:STRING=${{ matrix.standard }}
          -D CMAKE_CXX_COMPILER=g++-${{ matrix.version }}

      - name: Build tests
        run: cmake --build build/tests -j $(nproc)

      - name: Run tests
        working-directory: build/tests
        run: ctest --output-on-failure -VV -j $(nproc)


================================================
FILE: .github/workflows/make-release.yml
================================================
name: Make release package
permissions:
  contents: write

on:
  release:
    types: [published]

jobs:
  release:
    runs-on: ubuntu-latest
    steps:
      - uses: actions/checkout@v3
      
      - name: Configure project
        run: cmake -E tar c cpp-lazy-src.zip --format=zip -- src/ include/ CMakeLists.txt LICENSE.md cmake/
      
      - name: Add package to release
        uses: svenstaro/upload-release-action@v2
        with:
          repo_token: ${{ secrets.GITHUB_TOKEN }}
          file: cpp-lazy-src.zip
          tag: ${{ github.ref }}


================================================
FILE: .github/workflows/module-tests.yml
================================================
on:
  workflow_call:

jobs:
  module_tests:
    runs-on: ubuntu-latest
    
    steps:
      - name: Checkout repo
        uses: actions/checkout@v1

      - name: Install Ninja
        uses: seanmiddleditch/gha-setup-ninja@master
      
      - name: Add LLVM apt repo and install Clang 18
        run: |
          sudo apt-get update
          sudo apt-get install -y wget lsb-release gnupg
          wget https://apt.llvm.org/llvm.sh
          chmod +x llvm.sh
          sudo ./llvm.sh 18
          clang++-18 --version

      - name: Configure module tests
        env:
          CC: clang-18
          CXX: clang++-18
        run: cmake -S tests/module_tests -B tests/module_tests/build -G Ninja
          -D CMAKE_CXX_STANDARD:STRING=20
          -D CPP_LAZY_USE_MODULES=ON
          -D CMAKE_CXX_COMPILER=clang++-18

      - name: Build module tests
        run: cmake --build tests/module_tests/build
      
      - name: Run module tests
        working-directory: tests/module_tests/build
        run: ./module_test
  
  module_tests_find_package:
    runs-on: ubuntu-latest
    
    steps:
      - name: Checkout repo
        uses: actions/checkout@v1

      - name: Install Ninja
        uses: seanmiddleditch/gha-setup-ninja@master
      
      - name: Add LLVM apt repo and install Clang 18
        run: |
          sudo apt-get update
          sudo apt-get install -y wget lsb-release gnupg
          wget https://apt.llvm.org/llvm.sh
          chmod +x llvm.sh
          sudo ./llvm.sh 18
          clang++-18 --version
      
      - name: Configure cpp-lazy
        env:
          CC: clang-18
          CXX: clang++-18
        run: cmake -S . -B build -G Ninja
            -D CMAKE_CXX_STANDARD:STRING=20
            -D CMAKE_BUILD_TYPE:STRING=Release
            -D CMAKE_INSTALL_PREFIX=tests/module_tests/build/install
            -D CPP_LAZY_INSTALL:BOOL=ON
            -D CPP_LAZY_USE_MODULES=ON

      - name: Build & install cpp-lazy
        env:
          CC: clang-18
          CXX: clang++-18
        run: cmake --build build --target install

      - name: Configure module tests (find_package)
        env:
          CC: clang-18
          CXX: clang++-18
        run: cmake -S tests/module_tests -B tests/module_tests/build -G Ninja
          -D CMAKE_PREFIX_PATH=${{ github.workspace }}/tests/module_tests/build/install
          -D CMAKE_CXX_STANDARD:STRING=20
          -D CPP_LAZY_USE_MODULES_FIND_PACKAGE=ON

      - name: Build module tests (find_package)
        run: cmake --build tests/module_tests/build
      
      - name: Run module tests (find_package)
        working-directory: tests/module_tests/build
        run: ./module_test


================================================
FILE: .github/workflows/msvc.yml
================================================
env:
  CTEST_OUTPUT_ON_FAILURE: 1

on:
  workflow_call:

jobs:
  msvc:
    name: msvc-${{ matrix.os }} (C++${{ matrix.standard }})

    strategy:
      fail-fast: false
      matrix:
        os: [ windows-2022, windows-2025 ]
        standard: [11, 14, 17, 20, 23]

    runs-on: ${{ matrix.os }}

    steps:
      - name: Checkout repo
        uses: actions/checkout@v1

      - name: Configure (install)
        run: cmake -S . -B build/install
          -D CMAKE_BUILD_TYPE:STRING=Release
          -D CPP_LAZY_INSTALL:BOOL=ON
          -D CMAKE_INSTALL_PREFIX=build/prefix
          -D CMAKE_CXX_STANDARD:STRING=${{ matrix.standard }}
          -D CMAKE_CXX_COMPILER:STRING=cl.exe

      - name: Build (install)
        run: cmake --build build/install --config Release -j $env:NUMBER_OF_PROCESSORS

      - name: Install
        run: cmake --install build/install --config Release

      - name: Configure tests
        run: cmake -S tests -B build/tests
          -D CPP_LAZY_DOCTEST_VERSION:STRING=${{ vars.DOCTEST_VERSION }}
          -D TEST_INSTALLED_VERSION:BOOL=YES
          -D CMAKE_INSTALL_PREFIX=build/prefix
          -D CMAKE_CXX_STANDARD:STRING=${{ matrix.standard }}
          -D CMAKE_CXX_COMPILER:STRING=cl.exe

      - name: Build tests
        run: cmake --build build/tests --config Release -j $env:NUMBER_OF_PROCESSORS

      - name: Run tests
        working-directory: build/tests
        run: ctest -C Release --output-on-failure -VV -j $(nproc)


================================================
FILE: .gitignore
================================================
## Ignore Visual Studio temporary files, build results, and
## files generated by popular Visual Studio add-ons.
##
## Get latest from https://github.com/github/gitignore/blob/master/VisualStudio.gitignore

# User-specific files
*.rsuser
*.suo
*.user
*.userosscache
*.sln.docstates

# User-specific files (MonoDevelop/Xamarin Studio)
*.userprefs

# Mono auto generated files
mono_crash.*

# Build results
*-build/
build-*/
[Dd]ebug/
[Dd]ebugPublic/
[Rr]elease/
[Rr]eleases/
x64/
x86/
[Ww][Ii][Nn]32/
[Aa][Rr][Mm]/
[Aa][Rr][Mm]64/
bld/
[Bb]in/
[Oo]bj/
[Ll]og/
[Ll]ogs/

[bB]uild-[Rr]elease/
[bB]uild-[Dd]ebug/

_CPack_Packages/
*.exe

# Visual Studio 2015/2017 cache/options directory
.vs/

.vscode/
# Uncomment if you have tasks that create the project's static files in wwwroot
#wwwroot/

# Visual Studio 2017 auto generated files
Generated\ Files/

# MSTest test Results
[Tt]est[Rr]esult*/
[Bb]uild[Ll]og.*

# NUnit
*.VisualState.xml
TestResult.xml
nunit-*.xml

# Build Results of an ATL Project
[Dd]ebugPS/
[Rr]eleasePS/
dlldata.c

# Benchmark Results
BenchmarkDotNet.Artifacts/

# .NET Core
project.lock.json
project.fragment.lock.json
artifacts/

# ASP.NET Scaffolding
ScaffoldingReadMe.txt

# StyleCop
StyleCopReport.xml

# Files built by Visual Studio
*_i.c
*_p.c
*_h.h
*.ilk
*.meta
*.obj
*.iobj
*.pch
*.pdb
*.ipdb
*.pgc
*.pgd
*.rsp
*.sbr
*.tlb
*.tli
*.tlh
*.tmp
*.tmp_proj
*_wpftmp.csproj
*.log
*.vspscc
*.vssscc
.builds
*.pidb
*.svclog
*.scc

# Chutzpah Test files
_Chutzpah*

# Visual C++ cache files
ipch/
*.aps
*.ncb
*.opendb
*.opensdf
*.sdf
*.cachefile
*.VC.db
*.VC.VC.opendb

# Visual Studio profiler
*.psess
*.vsp
*.vspx
*.sap

# Visual Studio Trace Files
*.e2e

# TFS 2012 Local Workspace
$tf/

# Guidance Automation Toolkit
*.gpState

# ReSharper is a .NET coding add-in
_ReSharper*/
*.[Rr]e[Ss]harper
*.DotSettings.user

# TeamCity is a build add-in
_TeamCity*

# DotCover is a Code Coverage Tool
*.dotCover

# AxoCover is a Code Coverage Tool
.axoCover/*
!.axoCover/settings.json

# Coverlet is a free, cross platform Code Coverage Tool
coverage*[.json, .xml, .info]

# Visual Studio code coverage results
*.coverage
*.coveragexml

# NCrunch
_NCrunch_*
.*crunch*.local.xml
nCrunchTemp_*

# MightyMoose
*.mm.*
AutoTest.Net/

# Web workbench (sass)
.sass-cache/

# Installshield output folder
[Ee]xpress/

# DocProject is a documentation generator add-in
DocProject/buildhelp/
DocProject/Help/*.HxT
DocProject/Help/*.HxC
DocProject/Help/*.hhc
DocProject/Help/*.hhk
DocProject/Help/*.hhp
DocProject/Help/Html2
DocProject/Help/html

# Click-Once directory
publish/

# Publish Web Output
*.[Pp]ublish.xml
*.azurePubxml
# Note: Comment the next line if you want to checkin your web deploy settings,
# but database connection strings (with potential passwords) will be unencrypted
*.pubxml
*.publishproj

# Microsoft Azure Web App publish settings. Comment the next line if you want to
# checkin your Azure Web App publish settings, but sensitive information contained
# in these scripts will be unencrypted
PublishScripts/

# NuGet Packages
*.nupkg
# NuGet Symbol Packages
*.snupkg
# The packages folder can be ignored because of Package Restore
**/[Pp]ackages/*
# takewhile build/, which is used as an MSBuild target.
!**/[Pp]ackages/build/
# Uncomment if necessary however generally it will be regenerated when needed
#!**/[Pp]ackages/repositories.config
# NuGet v3's project.json files produces more ignorable files
*.nuget.props
*.nuget.targets

# Microsoft Azure Build Output
csx/
*.build.csdef

# Microsoft Azure Emulator
ecf/
rcf/

# Windows Store app package directories and files
AppPackages/
BundleArtifacts/
Package.StoreAssociation.xml
_pkginfo.txt
*.appx
*.appxbundle
*.appxupload

# Visual Studio cache files
# files ending in .cache can be ignored
*.[Cc]ache
# but keep track of directories ending in .cache
!?*.[Cc]ache/

# Others
ClientBin/
~$*
*~
*.dbmdl
*.dbproj.schemaview
*.jfm
*.pfx
*.publishsettings
orleans.codegen.cs

# Including strong name files can present a security risk
# (https://github.com/github/gitignore/pull/2483#issue-259490424)
#*.snk

# Since there are multiple workflows, uncomment next line to ignore bower_components
# (https://github.com/github/gitignore/pull/1529#issuecomment-104372622)
#bower_components/

# RIA/Silverlight projects
Generated_Code/

# Backup & report files from converting an old project file
# to a newer Visual Studio version. Backup files are not needed,
# because we have git ;-)
_UpgradeReport_Files/
Backup*/
UpgradeLog*.XML
UpgradeLog*.htm
ServiceFabricBackup/
*.rptproj.bak

# SQL Server files
*.mdf
*.ldf
*.ndf

# Business Intelligence projects
*.rdl.data
*.bim.layout
*.bim_*.settings
*.rptproj.rsuser
*- [Bb]ackup.rdl
*- [Bb]ackup ([0-9]).rdl
*- [Bb]ackup ([0-9][0-9]).rdl

# Microsoft Fakes
FakesAssemblies/

# GhostDoc plugin setting file
*.GhostDoc.xml

# Node.js Tools for Visual Studio
.ntvs_analysis.dat
node_modules/

# Visual Studio 6 build log
*.plg

# Visual Studio 6 workspace options file
*.opt

# Visual Studio 6 auto-generated workspace file (contains which files were open etc.)
*.vbw

# Visual Studio LightSwitch build output
**/*.HTMLClient/GeneratedArtifacts
**/*.DesktopClient/GeneratedArtifacts
**/*.DesktopClient/ModelManifest.xml
**/*.Server/GeneratedArtifacts
**/*.Server/ModelManifest.xml
_Pvt_Extensions

# Paket dependency manager
.paket/paket.exe
paket-files/

# FAKE - F# Make
.fake/

# CodeRush personal settings
.cr/personal

# Python Tools for Visual Studio (PTVS)
__pycache__/
*.pyc

# Cake - Uncomment if you are using it
# tools/**
# !tools/packages.config

# Tabs Studio
*.tss

# Telerik's JustMock configuration file
*.jmconfig

# BizTalk build output
*.btp.cs
*.btm.cs
*.odx.cs
*.xsd.cs

# OpenCover UI analysis results
OpenCover/

# Azure Stream Analytics local run output
ASALocalRun/

# MSBuild Binary and Structured Log
*.binlog

# NVidia Nsight GPU debugger configuration file
*.nvuser

# MFractors (Xamarin productivity tool) working folder
.mfractor/

# Local History for Visual Studio
.localhistory/

# BeatPulse healthcheck filter database
healthchecksdb

# Backup folder for Package Reference Convert tool in Visual Studio 2017
MigrationBackup/

# Ionide (cross platform F# VS Code tools) working folder
.ionide/

# Fody - auto-generated XML schema
FodyWeavers.xsd

# Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm, CLion, Android Studio, WebStorm and Rider
# Reference: https://intellij-support.jetbrains.com/hc/en-us/articles/206544839

# User-specific stuff
.idea/**/workspace.xml
.idea/**/tasks.xml
.idea/**/usage.statistics.xml
.idea/**/dictionaries
.idea/**/shelf

# Generated files
.idea/**/contentModel.xml

# Sensitive or high-churn files
.idea/**/dataSources/
.idea/**/dataSources.ids
.idea/**/dataSources.local.xml
.idea/**/sqlDataSources.xml
.idea/**/dynamic.xml
.idea/**/uiDesigner.xml
.idea/**/dbnavigator.xml

# Gradle
.idea/**/gradle.xml
.idea/**/libraries

# Gradle and Maven with auto-import
# When using Gradle or Maven with auto-import, you should exclude module files,
# since they will be recreated, and may cause churn.  Uncomment if using
# auto-import.
# .idea/artifacts
# .idea/compiler.xml
# .idea/jarRepositories.xml
# .idea/modules.xml
.idea/*.iml
# .idea/modules
*.iml
# *.ipr

# CMake
**/cmake-build-*/

# Mongo Explorer plugin
.idea/**/mongoSettings.xml

# File-based project format
*.iws

# IntelliJ
out/

# mpeltonen/sbt-idea plugin
.idea_modules/

# JIRA plugin
atlassian-ide-plugin.xml

# Cursive Clojure plugin
.idea/replstate.xml

# Crashlytics plugin (for Android Studio and IntelliJ)
com_crashlytics_export_strings.xml
crashlytics.properties
crashlytics-build.properties
fabric.properties

# Editor-based Rest Client
.idea/httpRequests

# Android studio 3.1+ serialized cache file
.idea/caches/build_file_checksums.ser

# No docs, users must create it themselves
docs/*
!*docs/.gitkeep

# Remove extern bench
extern/benchmark/

# Created by .ignore support plugin (hsz.mobi)
### Python template
# Byte-compiled / optimized / DLL files
__pycache__/
*.py[cod]
*$py.class

# C extensions
*.so

# Distribution / packaging
.Python
env/
build/
develop-eggs/
dist/
downloads/
eggs/
.eggs/
lib/
lib64/
parts/
sdist/
var/
*.egg-info/
.installed.cfg
*.egg

# PyInstaller
#  Usually these files are written by a python script from a template
#  before PyInstaller builds the exe, so as to inject date/other infos into it.
*.manifest
*.spec

# Installer logs
pip-log.txt
pip-delete-this-directory.txt

# Unit test / coverage reports
htmlcov/
.tox/
.coverage
.coverage.*
.cache
nosetests.xml
coverage.xml
*,cover
.hypothesis/

# Translations
*.mo
*.pot

# Django stuff:
*.log
local_settings.py

# Flask stuff:
instance/
.webassets-cache

# Scrapy stuff:
.scrapy

# Sphinx documentation
docs/_build/

# PyBuilder
target/

# IPython Notebook
.ipynb_checkpoints

# pyenv
.python-version

# celery beat schedule file
celerybeat-schedule

# dotenv
.env

# virtualenv
venv/*
ENV/*

# Spyder project settings
.spyderproject

# Rope project settings
.ropeproject
### VirtualEnv template
# Virtualenv
# http://iamzed.com/2009/05/07/a-primer-on-virtualenv/
.venv
pip-selfcheck.json
### JetBrains template
# Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm, CLion, Android Studio and Webstorm
# Reference: https://intellij-support.jetbrains.com/hc/en-us/articles/206544839

# User-specific stuff:
.idea/workspace.xml
.idea/tasks.xml
.idea/dictionaries
.idea/vcs.xml
.idea/jsLibraryMappings.xml

# Sensitive or high-churn files:
.idea
.idea/

## File-based project format:
*.iws

## Plugin-specific files:

# IntelliJ
/out/

# mpeltonen/sbt-idea plugin
.idea_modules/

# JIRA plugin
atlassian-ide-plugin.xml

# Crashlytics plugin (for Android Studio and IntelliJ)
com_crashlytics_export_strings.xml
crashlytics.properties
crashlytics-build.properties
fabric.properties


================================================
FILE: CMakeLists.txt
================================================
cmake_minimum_required(VERSION 3.14)

project(cpp-lazy
        VERSION 9.0.0
        DESCRIPTION
        "A fast C++11/14/17/20 header only library for lazy evaluation and function tools"
        HOMEPAGE_URL "https://github.com/Kaaserne/cpp-lazy"
        LANGUAGES CXX)

# ---- Warning guard ----
# Protect dependents from this project's warnings if the guard isn't disabled
set(cpp-lazy_warning_guard "SYSTEM")
if(cpp-lazy_INCLUDE_WITHOUT_SYSTEM)
    set(cpp-lazy_warning_guard "")
endif()

include(GNUInstallDirs)
set(CPP_LAZY_INCLUDE_DIR "${CMAKE_INSTALL_INCLUDEDIR}" CACHE STRING "Installation directory of the include files")

option(CPP_LAZY_USE_STANDALONE "Standalone library without {fmt}" NO)
option(CPP_LAZY_USE_INSTALLED_FMT "Import {fmt} using find_package" NO)
option(CPP_LAZY_USE_MODULES "Enable C++20's modules" NO)

if (NOT DEFINED CPP_LAZY_DEBUG_ASSERTIONS)
    if (CMAKE_BUILD_TYPE STREQUAL "Debug")
        set(CPP_LAZY_DEBUG_ASSERTIONS ON)
    else()
        set(CPP_LAZY_DEBUG_ASSERTIONS OFF)
    endif()
endif()
option(CPP_LAZY_DEBUG_ASSERTIONS "Debug assertions" ${CPP_LAZY_DEBUG_ASSERTIONS})

if (CPP_LAZY_USE_MODULES)
	message(STATUS "cpp-lazy: using C++20 modules")
	set(CMAKE_DEBUG_POSTFIX "d")
	set(CPP_LAZY_SOURCE_FILES "src/lz.cppm")
	set(CPP_LAZY_LINK_VISIBILITY "PUBLIC")
	set(CPP_LAZY_COMPILE_FEATURES_VISIBLITY "PUBLIC")
	set(CPP_LAZY_COMPILE_DEFINITIONS_VISIBLITY "PRIVATE")
	set(CPP_LAZY_COMPILE_INCLUDE_VISIBLITY "PUBLIC")
	set(CMAKE_CXX_SCAN_FOR_MODULES ON)
else()
	set(CPP_LAZY_LIB_TYPE "INTERFACE")
	set(CPP_LAZY_LINK_VISIBILITY "INTERFACE")
	set(CPP_LAZY_COMPILE_FEATURES_VISIBLITY "INTERFACE")
	set(CPP_LAZY_COMPILE_DEFINITIONS_VISIBLITY "INTERFACE")
	set(CPP_LAZY_COMPILE_INCLUDE_VISIBLITY "INTERFACE")
endif()

# ---- Import {fmt} ----
if (CPP_LAZY_USE_STANDALONE)
	message(STATUS "cpp-lazy: using standalone version")
else()
	if (CPP_LAZY_USE_INSTALLED_FMT)
		message(STATUS "cpp-lazy: using external {fmt} library")
		set(CPP_LAZY_FMT_DEP_VERSION "" CACHE STRING "Version of {fmt} to use")
		find_package(fmt ${CPP_LAZY_FMT_DEP_VERSION} REQUIRED CONFIG)
	else()
		message(STATUS "cpp-lazy: using bundled {fmt} library")
		set(FMT_OS YES CACHE INTERNAL "")
		set(FMT_INSTALL YES CACHE INTERNAL "" FORCE)
		include(FetchContent)
		set(CPP_LAZY_FMT_DEP_VERSION 12.1.0 CACHE STRING "Version of {fmt} to use")
		FetchContent_Declare(fmt 
			URL https://github.com/fmtlib/fmt/archive/refs/tags/${CPP_LAZY_FMT_DEP_VERSION}.tar.gz 
			UPDATE_DISCONNECTED YES 
			DOWNLOAD_EXTRACT_TIMESTAMP TRUE
		)
		FetchContent_MakeAvailable(fmt)
	endif()
endif()

message(STATUS "cpp-lazy: standalone version: ${CPP_LAZY_USE_STANDALONE}.")
message(STATUS "cpp-lazy: debug assertions: ${CPP_LAZY_DEBUG_ASSERTIONS}.")

# ---- Declare library ----
add_library(cpp-lazy ${CPP_LAZY_LIB_TYPE} "${CPP_LAZY_SOURCE_FILES}")
add_library(cpp-lazy::cpp-lazy ALIAS cpp-lazy)

if (CPP_LAZY_USE_MODULES)
	target_sources(cpp-lazy PUBLIC
		FILE_SET cxx_modules
		TYPE
			CXX_MODULES
		FILES "${CPP_LAZY_SOURCE_FILES}")
	target_compile_features(cpp-lazy PRIVATE cxx_std_20)
endif()

# Link lib stacktrace if debug assertions are enabled, on Linux with C++23 or later
set(IS_CXX_23 $<VERSION_GREATER_EQUAL:${CMAKE_CXX_STANDARD},23>)
set(IS_GNU_LIKE_COMPILER $<OR:$<CXX_COMPILER_ID:GNU>,$<CXX_COMPILER_ID:Clang>>)
set(LZ_LINK_LIBBACKTRACE_CONDITION
    $<AND:$<BOOL:${CPP_LAZY_DEBUG_ASSERTIONS}>,${IS_GNU_LIKE_COMPILER},${IS_CXX_23}>
)
target_link_libraries(cpp-lazy ${CPP_LAZY_LINK_VISIBILITY}
	$<$<NOT:$<BOOL:${CPP_LAZY_USE_STANDALONE}>>:fmt::fmt>
	$<${LZ_LINK_LIBBACKTRACE_CONDITION}:stdc++_libbacktrace>
)
target_compile_definitions(cpp-lazy ${CPP_LAZY_COMPILE_DEFINITIONS_VISIBLITY}
	$<$<BOOL:${CPP_LAZY_USE_STANDALONE}>:LZ_STANDALONE>
	$<$<BOOL:${CPP_LAZY_DEBUG_ASSERTIONS}>:LZ_DEBUG_ASSERTIONS>
)

target_include_directories(cpp-lazy	${cpp-lazy_warning_guard}
	${CPP_LAZY_COMPILE_INCLUDE_VISIBLITY}
        "$<BUILD_INTERFACE:${PROJECT_SOURCE_DIR}/include>"
		"$<INSTALL_INTERFACE:${CPP_LAZY_INCLUDE_DIR}>"
)

# ---- Install ----
include(CMakePackageConfigHelpers)

set(cpp-lazy_install_cmakedir "${CMAKE_INSTALL_LIBDIR}/cmake/cpp-lazy")

option(CPP_LAZY_INSTALL "Install cpp-lazy" OFF)

if (CPP_LAZY_USE_MODULES AND CPP_LAZY_INSTALL)
	install(
		TARGETS cpp-lazy
        EXPORT cpp-lazyTargets
        INCLUDES DESTINATION "${CMAKE_INSTALL_LIBDIR}"
        FILE_SET cxx_modules
		DESTINATION "${CMAKE_INSTALL_LIBDIR}"
	)
elseif (CPP_LAZY_INSTALL)
	install(
		TARGETS cpp-lazy
		EXPORT cpp-lazyTargets
		INCLUDES DESTINATION "${CMAKE_INSTALL_INCLUDEDIR}"
	)
endif()

if (CPP_LAZY_INSTALL)
	# ---- pkg-config (.pc) ----
	set(PC_REQUIRES "")
	if (NOT CPP_LAZY_USE_STANDALONE)
		set(PC_REQUIRES "fmt")
	endif()

	set(PC_LIBS "")
	set(PC_LIBS_PRIVATE "")
	if (CPP_LAZY_USE_MODULES)
		set(PC_LIBS "-lcpp-lazy")
	endif()
	if (CPP_LAZY_DEBUG_ASSERTIONS AND IS_GNU_LIKE_COMPILER)
		set(PC_LIBS_PRIVATE "${PC_LIBS_PRIVATE} -lstdc++_libbacktrace")
	endif()

	configure_file(
		"${PROJECT_SOURCE_DIR}/cmake/cpp-lazy.pc.in"
		"${PROJECT_BINARY_DIR}/cpp-lazy.pc"
		@ONLY
	)

	install(
		FILES "${PROJECT_BINARY_DIR}/cpp-lazy.pc"
		DESTINATION "${CMAKE_INSTALL_LIBDIR}/pkgconfig"
	)

	# ---- CMake config files ----
	write_basic_package_version_file(
		cpp-lazyConfigVersion.cmake
		VERSION ${PROJECT_VERSION}
		COMPATIBILITY SameMajorVersion
		ARCH_INDEPENDENT
	)
	configure_package_config_file(
		"${PROJECT_SOURCE_DIR}/cmake/cpp-lazyConfig.cmake.in"
		"${PROJECT_BINARY_DIR}/cpp-lazyConfig.cmake"
		INSTALL_DESTINATION "${cpp-lazy_install_cmakedir}"
	)

	install(EXPORT cpp-lazyTargets
			NAMESPACE cpp-lazy::
			DESTINATION "${cpp-lazy_install_cmakedir}"
	)
	install(FILES
			"${PROJECT_BINARY_DIR}/cpp-lazyConfig.cmake"
			"${PROJECT_BINARY_DIR}/cpp-lazyConfigVersion.cmake"
			DESTINATION "${cpp-lazy_install_cmakedir}"
	)
	
	install(DIRECTORY "${PROJECT_SOURCE_DIR}/include/"
			DESTINATION "${CMAKE_INSTALL_INCLUDEDIR}"
	)
	include(CPack)
	set(CPACK_PACKAGE_INSTALL_DIRECTORY "${CPACK_PACKAGE_NAME}/${CPACK_PACKAGE_VERSION}")
	set(CPACK_RESOURCE_FILE_LICENSE "${PROJECT_SOURCE_DIR}/LICENSE.md")
endif()


================================================
FILE: Doxyfile
================================================
# Doxyfile 1.8.18

# This file describes the settings to be used by the documentation system
# doxygen (www.doxygen.org) for a project.
#
# All text after a double hash (##) is considered a comment and is placed in
# front of the TAG it is preceding.
#
# All text after a single hash (#) is considered a comment and will be ignored.
# The format is:
# TAG = value [value, ...]
# For lists, items can also be appended using:
# TAG += value [value, ...]
# Values that contain spaces should be placed between quotes (\" \").

#---------------------------------------------------------------------------
# Project related configuration options
#---------------------------------------------------------------------------

# This tag specifies the encoding used for all characters in the configuration
# file that follow. The default is UTF-8 which is also the encoding used for all
# text before the first occurrence of this tag. Doxygen uses libiconv (or the
# iconv built into libc) for the transcoding. See
# https://www.gnu.org/software/libiconv/ for the list of possible encodings.
# The default value is: UTF-8.

DOXYFILE_ENCODING      = UTF-8

# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
# double-quotes, unless you are using Doxywizard) that should identify the
# project for which the documentation is generated. This name is used in the
# title of most generated pages and in a few other places.
# The default value is: My Project.

PROJECT_NAME           = cpp-lazy

# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
# could be handy for archiving the generated documentation or if some version
# control system is used.

PROJECT_NUMBER         = 9.0.0

# Using the PROJECT_BRIEF tag one can provide an optional one line description
# for a project that appears at the top of each page and should give viewer a
# quick idea about the purpose of the project. Keep the description short.

PROJECT_BRIEF          = "C++11/14/17/20 lazy evaluation library"

# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
# in the documentation. The maximum height of the logo should not exceed 55
# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
# the logo to the output directory.

PROJECT_LOGO           =

# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
# into which the generated documentation will be written. If a relative path is
# entered, it will be relative to the location where doxygen was started. If
# left blank the current directory will be used.

OUTPUT_DIRECTORY       = docs/cpp-lazy

# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
# directories (in 2 levels) under the output directory of each output format and
# will distribute the generated files over these directories. Enabling this
# option can be useful when feeding doxygen a huge amount of source files, where
# putting all generated files in the same directory would otherwise causes
# performance problems for the file system.
# The default value is: NO.

CREATE_SUBDIRS         = NO

# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
# characters to appear in the names of generated files. If set to NO, non-ASCII
# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
# U+3044.
# The default value is: NO.

ALLOW_UNICODE_NAMES    = NO

# The OUTPUT_LANGUAGE tag is used to specify the language in which all
# documentation generated by doxygen is written. Doxygen will use this
# information to generate all constant output in the proper language.
# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
# Ukrainian and Vietnamese.
# The default value is: English.

OUTPUT_LANGUAGE        = English

# The OUTPUT_TEXT_DIRECTION tag is used to specify the direction in which all
# documentation generated by doxygen is written. Doxygen will use this
# information to generate all generated output in the proper direction.
# Possible values are: None, LTR, RTL and Context.
# The default value is: None.

OUTPUT_TEXT_DIRECTION  = None

# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
# descriptions after the members that are listed in the file and class
# documentation (similar to Javadoc). Set to NO to disable this.
# The default value is: YES.

BRIEF_MEMBER_DESC      = YES

# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
# description of a member or function before the detailed description
#
# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
# brief descriptions will be completely suppressed.
# The default value is: YES.

REPEAT_BRIEF           = YES

# This tag implements a quasi-intelligent brief description abbreviator that is
# used to form the text in various listings. Each string in this list, if found
# as the leading text of the brief description, will be stripped from the text
# and the result, after processing the whole list, is used as the annotated
# text. Otherwise, the brief description is used as-is. If left blank, the
# following values are used ($name is automatically replaced with the name of
# the entity):The $name class, The $name widget, The $name file, is, provides,
# specifies, contains, represents, a, an and the.

ABBREVIATE_BRIEF       = "The $name class" \
                         "The $name widget" \
                         "The $name file" \
                         is \
                         provides \
                         specifies \
                         contains \
                         represents \
                         a \
                         an \
                         the

# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
# doxygen will generate a detailed section even if there is only a brief
# description.
# The default value is: NO.

ALWAYS_DETAILED_SEC    = NO

# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
# inherited members of a class in the documentation of that class as if those
# members were ordinary class members. Constructors, destructors and assignment
# operators of the base classes will not be shown.
# The default value is: NO.

INLINE_INHERITED_MEMB  = NO

# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
# before files name in the file list and in the header files. If set to NO the
# shortest path that makes the file name unique will be used
# The default value is: YES.

FULL_PATH_NAMES        = YES

# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
# Stripping is only done if one of the specified strings matches the left-hand
# part of the path. The tag can be used to show relative paths in the file list.
# If left blank the directory from which doxygen is run is used as the path to
# strip.
#
# Note that you can specify absolute paths here, but also relative paths, which
# will be relative from the directory where doxygen is started.
# This tag requires that the tag FULL_PATH_NAMES is set to YES.

STRIP_FROM_PATH        =

# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
# path mentioned in the documentation of a class, which tells the reader which
# header file to include in order to use a class. If left blank only the name of
# the header file containing the class definition is used. Otherwise one should
# specify the list of include paths that are normally passed to the compiler
# using the -I flag.

STRIP_FROM_INC_PATH    =

# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
# less readable) file names. This can be useful is your file systems doesn't
# support long names like on DOS, Mac, or CD-ROM.
# The default value is: NO.

SHORT_NAMES            = NO

# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
# first line (until the first dot) of a Javadoc-style comment as the brief
# description. If set to NO, the Javadoc-style will behave just like regular Qt-
# style comments (thus requiring an explicit @brief command for a brief
# description.)
# The default value is: NO.

JAVADOC_AUTOBRIEF      = NO

# If the JAVADOC_BANNER tag is set to YES then doxygen will interpret a line
# such as
# /***************
# as being the beginning of a Javadoc-style comment "banner". If set to NO, the
# Javadoc-style will behave just like regular comments and it will not be
# interpreted by doxygen.
# The default value is: NO.

JAVADOC_BANNER         = NO

# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
# line (until the first dot) of a Qt-style comment as the brief description. If
# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
# requiring an explicit \brief command for a brief description.)
# The default value is: NO.

QT_AUTOBRIEF           = NO

# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
# a brief description. This used to be the default behavior. The new default is
# to treat a multi-line C++ comment block as a detailed description. Set this
# tag to YES if you prefer the old behavior instead.
#
# Note that setting this tag to YES also means that rational rose comments are
# not recognized any more.
# The default value is: NO.

MULTILINE_CPP_IS_BRIEF = NO

# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
# documentation from any documented member that it re-implements.
# The default value is: YES.

INHERIT_DOCS           = YES

# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
# page for each member. If set to NO, the documentation of a member will be part
# of the file/class/namespace that contains it.
# The default value is: NO.

SEPARATE_MEMBER_PAGES  = NO

# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
# uses this value to replace tabs by spaces in code fragments.
# Minimum value: 1, maximum value: 16, default value: 4.

TAB_SIZE               = 4

# This tag can be used to specify a number of aliases that act as commands in
# the documentation. An alias has the form:
# name=value
# For example adding
# "sideeffect=@par Side Effects:\n"
# will allow you to put the command \sideeffect (or @sideeffect) in the
# documentation, which will result in a user-defined paragraph with heading
# "Side Effects:". You can put \n's in the value part of an alias to insert
# newlines (in the resulting output). You can put ^^ in the value part of an
# alias to insert a newline as if a physical newline was in the original file.
# When you need a literal { or } or , in the value part of an alias you have to
# escape them by means of a backslash (\), this can lead to conflicts with the
# commands \{ and \} for these it is advised to use the version @{ and @} or use
# a double escape (\\{ and \\})

ALIASES                =

# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
# only. Doxygen will then generate output that is more tailored for C. For
# instance, some of the names that are used will be different. The list of all
# members will be omitted, etc.
# The default value is: NO.

OPTIMIZE_OUTPUT_FOR_C  = NO

# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
# Python sources only. Doxygen will then generate output that is more tailored
# for that language. For instance, namespaces will be presented as packages,
# qualified scopes will look different, etc.
# The default value is: NO.

OPTIMIZE_OUTPUT_JAVA   = NO

# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
# sources. Doxygen will then generate output that is tailored for Fortran.
# The default value is: NO.

OPTIMIZE_FOR_FORTRAN   = NO

# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
# sources. Doxygen will then generate output that is tailored for VHDL.
# The default value is: NO.

OPTIMIZE_OUTPUT_VHDL   = NO

# Set the OPTIMIZE_OUTPUT_SLICE tag to YES if your project consists of Slice
# sources only. Doxygen will then generate output that is more tailored for that
# language. For instance, namespaces will be presented as modules, types will be
# separated into more groups, etc.
# The default value is: NO.

OPTIMIZE_OUTPUT_SLICE  = NO

# Doxygen selects the parser to use depending on the extension of the files it
# parses. With this tag you can assign which parser to use for a given
# extension. Doxygen has a built-in mapping, but you can override or extend it
# using this tag. The format is ext=language, where ext is a file extension, and
# language is one of the parsers supported by doxygen: IDL, Java, JavaScript,
# Csharp (C#), C, C++, D, PHP, md (Markdown), Objective-C, Python, Slice, VHDL,
# Fortran (fixed format Fortran: FortranFixed, free formatted Fortran:
# FortranFree, unknown formatted Fortran: Fortran. In the later case the parser
# tries to guess whether the code is fixed or free formatted code, this is the
# default for Fortran type files). For instance to make doxygen treat .inc files
# as Fortran files (default is PHP), and .f files as C (default is Fortran),
# use: inc=Fortran f=C.
#
# Note: For files without extension you can use no_extension as a placeholder.
#
# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
# the files are not read by doxygen.

EXTENSION_MAPPING      =

# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
# according to the Markdown format, which allows for more readable
# documentation. See https://daringfireball.net/projects/markdown/ for details.
# The output of markdown processing is further processed by doxygen, so you can
# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
# case of backward compatibilities issues.
# The default value is: YES.

MARKDOWN_SUPPORT       = YES

# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up
# to that level are automatically included in the table of contents, even if
# they do not have an id attribute.
# Note: This feature currently applies only to Markdown headings.
# Minimum value: 0, maximum value: 99, default value: 5.
# This tag requires that the tag MARKDOWN_SUPPORT is set to YES.

TOC_INCLUDE_HEADINGS   = 5

# When enabled doxygen tries to link words that correspond to documented
# classes, or namespaces to their corresponding documentation. Such a link can
# be prevented in individual cases by putting a % sign in front of the word or
# globally by setting AUTOLINK_SUPPORT to NO.
# The default value is: YES.

AUTOLINK_SUPPORT       = YES

# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
# to include (a tag file for) the STL sources as input, then you should set this
# tag to YES in order to let doxygen match functions declarations and
# definitions whose arguments contain STL classes (e.g. func(std::string);
# versus func(std::string) {}). This also make the inheritance and collaboration
# diagrams that involve STL classes more complete and accurate.
# The default value is: NO.

BUILTIN_STL_SUPPORT    = NO

# If you use Microsoft's C++/CLI language, you should set this option to YES to
# enable parsing support.
# The default value is: NO.

CPP_CLI_SUPPORT        = NO

# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
# https://www.riverbankcomputing.com/software/sip/intro) sources only. Doxygen
# will parse them like normal C++ but will assume all classes use public instead
# of private inheritance when no explicit protection keyword is present.
# The default value is: NO.

SIP_SUPPORT            = NO

# For Microsoft's IDL there are propget and propput attributes to indicate
# getter and setter methods for a property. Setting this option to YES will make
# doxygen to replace the get and set methods by a property in the documentation.
# This will only work if the methods are indeed getting or setting a simple
# type. If this is not the case, or you want to show the methods anyway, you
# should set this option to NO.
# The default value is: YES.

IDL_PROPERTY_SUPPORT   = YES

# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
# tag is set to YES then doxygen will reuse the documentation of the first
# member in the group (if any) for the other members of the group. By default
# all members of a group must be documented explicitly.
# The default value is: NO.

DISTRIBUTE_GROUP_DOC   = NO

# If one adds a struct or class to a group and this option is enabled, then also
# any nested class or struct is added to the same group. By default this option
# is disabled and one has to add nested compounds explicitly via \ingroup.
# The default value is: NO.

GROUP_NESTED_COMPOUNDS = NO

# Set the SUBGROUPING tag to YES to allow class member groups of the same type
# (for instance a group of public functions) to be put as a subgroup of that
# type (e.g. under the Public Functions section). Set it to NO to prevent
# subgrouping. Alternatively, this can be done per class using the
# \nosubgrouping command.
# The default value is: YES.

SUBGROUPING            = YES

# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
# are shown inside the group in which they are included (e.g. using \ingroup)
# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
# and RTF).
#
# Note that this feature does not work in combination with
# SEPARATE_MEMBER_PAGES.
# The default value is: NO.

INLINE_GROUPED_CLASSES = NO

# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
# with only public data fields or simple typedef fields will be shown inline in
# the documentation of the scope in which they are defined (i.e. file,
# namespace, or group documentation), provided this scope is documented. If set
# to NO, structs, classes, and unions are shown on a separate page (for HTML and
# Man pages) or section (for LaTeX and RTF).
# The default value is: NO.

INLINE_SIMPLE_STRUCTS  = NO

# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
# enum is documented as struct, union, or enum with the name of the typedef. So
# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
# with name TypeT. When disabled the typedef will appear as a member of a file,
# namespace, or class. And the struct will be named TypeS. This can typically be
# useful for C code in case the coding convention dictates that all compound
# types are typedef'ed and only the typedef is referenced, never the tag name.
# The default value is: NO.

TYPEDEF_HIDES_STRUCT   = NO

# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
# cache is used to resolve symbols given their name and scope. Since this can be
# an expensive process and often the same symbol appears multiple times in the
# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
# doxygen will become slower. If the cache is too large, memory is wasted. The
# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
# symbols. At the end of a run doxygen will report the cache usage and suggest
# the optimal cache size from a speed point of view.
# Minimum value: 0, maximum value: 9, default value: 0.

LOOKUP_CACHE_SIZE      = 0

#---------------------------------------------------------------------------
# Build related configuration options
#---------------------------------------------------------------------------

# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
# documentation are documented, even if no documentation was available. Private
# class members and static file members will be hidden unless the
# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
# Note: This will also disable the warnings about undocumented members that are
# normally produced when WARNINGS is set to YES.
# The default value is: NO.

EXTRACT_ALL            = NO

# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
# be included in the documentation.
# The default value is: NO.

EXTRACT_PRIVATE        = NO

# If the EXTRACT_PRIV_VIRTUAL tag is set to YES, documented private virtual
# methods of a class will be included in the documentation.
# The default value is: NO.

EXTRACT_PRIV_VIRTUAL   = NO

# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
# scope will be included in the documentation.
# The default value is: NO.

EXTRACT_PACKAGE        = NO

# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
# included in the documentation.
# The default value is: NO.

EXTRACT_STATIC         = NO

# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
# locally in source files will be included in the documentation. If set to NO,
# only classes defined in header files are included. Does not have any effect
# for Java sources.
# The default value is: YES.

EXTRACT_LOCAL_CLASSES  = YES

# This flag is only useful for Objective-C code. If set to YES, local methods,
# which are defined in the implementation section but not in the interface are
# included in the documentation. If set to NO, only methods in the interface are
# included.
# The default value is: NO.

EXTRACT_LOCAL_METHODS  = NO

# If this flag is set to YES, the members of anonymous namespaces will be
# extracted and appear in the documentation as a namespace called
# 'anonymous_namespace{file}', where file will be replaced with the base name of
# the file that contains the anonymous namespace. By default anonymous namespace
# are hidden.
# The default value is: NO.

EXTRACT_ANON_NSPACES   = NO

# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
# undocumented members inside documented classes or files. If set to NO these
# members will be included in the various overviews, but no documentation
# section is generated. This option has no effect if EXTRACT_ALL is enabled.
# The default value is: NO.

HIDE_UNDOC_MEMBERS     = NO

# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
# undocumented classes that are normally visible in the class hierarchy. If set
# to NO, these classes will be included in the various overviews. This option
# has no effect if EXTRACT_ALL is enabled.
# The default value is: NO.

HIDE_UNDOC_CLASSES     = NO

# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
# declarations. If set to NO, these declarations will be included in the
# documentation.
# The default value is: NO.

HIDE_FRIEND_COMPOUNDS  = NO

# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
# documentation blocks found inside the body of a function. If set to NO, these
# blocks will be appended to the function's detailed documentation block.
# The default value is: NO.

HIDE_IN_BODY_DOCS      = NO

# The INTERNAL_DOCS tag determines if documentation that is typed after a
# \internal command is included. If the tag is set to NO then the documentation
# will be excluded. Set it to YES to include the internal documentation.
# The default value is: NO.

INTERNAL_DOCS          = NO

# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
# names in lower-case letters. If set to YES, upper-case letters are also
# allowed. This is useful if you have classes or files whose names only differ
# in case and if your file system supports case sensitive file names. Windows
# (including Cygwin) ands Mac users are advised to set this option to NO.
# The default value is: system dependent.

CASE_SENSE_NAMES       = NO

# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
# their full class and namespace scopes in the documentation. If set to YES, the
# scope will be hidden.
# The default value is: NO.

HIDE_SCOPE_NAMES       = NO

# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
# append additional text to a page's title, such as Class Reference. If set to
# YES the compound reference will be hidden.
# The default value is: NO.

HIDE_COMPOUND_REFERENCE= NO

# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
# the files that are included by a file in the documentation of that file.
# The default value is: YES.

SHOW_INCLUDE_FILES     = YES

# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
# grouped member an include statement to the documentation, telling the reader
# which file to include in order to use the member.
# The default value is: NO.

SHOW_GROUPED_MEMB_INC  = NO

# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
# files with double quotes in the documentation rather than with sharp brackets.
# The default value is: NO.

FORCE_LOCAL_INCLUDES   = NO

# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
# documentation for inline members.
# The default value is: YES.

INLINE_INFO            = YES

# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
# (detailed) documentation of file and class members alphabetically by member
# name. If set to NO, the members will appear in declaration order.
# The default value is: YES.

SORT_MEMBER_DOCS       = YES

# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
# descriptions of file, namespace and class members alphabetically by member
# name. If set to NO, the members will appear in declaration order. Note that
# this will also influence the order of the classes in the class list.
# The default value is: NO.

SORT_BRIEF_DOCS        = NO

# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
# (brief and detailed) documentation of class members so that constructors and
# destructors are listed first. If set to NO the constructors will appear in the
# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
# member documentation.
# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
# detailed member documentation.
# The default value is: NO.

SORT_MEMBERS_CTORS_1ST = NO

# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
# of group names into alphabetical order. If set to NO the group names will
# appear in their defined order.
# The default value is: NO.

SORT_GROUP_NAMES       = NO

# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
# fully-qualified names, including namespaces. If set to NO, the class list will
# be sorted only by class name, not including the namespace part.
# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
# Note: This option applies only to the class list, not to the alphabetical
# list.
# The default value is: NO.

SORT_BY_SCOPE_NAME     = NO

# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
# type resolution of all parameters of a function it will reject a match between
# the prototype and the implementation of a member function even if there is
# only one candidate or it is obvious which candidate to choose by doing a
# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
# accept a match between prototype and implementation in such cases.
# The default value is: NO.

STRICT_PROTO_MATCHING  = NO

# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
# list. This list is created by putting \todo commands in the documentation.
# The default value is: YES.

GENERATE_TODOLIST      = YES

# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
# list. This list is created by putting \test commands in the documentation.
# The default value is: YES.

GENERATE_TESTLIST      = YES

# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
# list. This list is created by putting \bug commands in the documentation.
# The default value is: YES.

GENERATE_BUGLIST       = YES

# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
# the deprecated list. This list is created by putting \deprecated commands in
# the documentation.
# The default value is: YES.

GENERATE_DEPRECATEDLIST= YES

# The ENABLED_SECTIONS tag can be used to enable conditional documentation
# sections, marked by \if <section_label> ... \endif and \cond <section_label>
# ... \endcond blocks.

ENABLED_SECTIONS       =

# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
# initial value of a variable or macro / define can have for it to appear in the
# documentation. If the initializer consists of more lines than specified here
# it will be hidden. Use a value of 0 to hide initializers completely. The
# appearance of the value of individual variables and macros / defines can be
# controlled using \showinitializer or \hideinitializer command in the
# documentation regardless of this setting.
# Minimum value: 0, maximum value: 10000, default value: 30.

MAX_INITIALIZER_LINES  = 30

# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
# the bottom of the documentation of classes and structs. If set to YES, the
# list will mention the files that were used to generate the documentation.
# The default value is: YES.

SHOW_USED_FILES        = YES

# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
# will remove the Files entry from the Quick Index and from the Folder Tree View
# (if specified).
# The default value is: YES.

SHOW_FILES             = YES

# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
# page. This will remove the Namespaces entry from the Quick Index and from the
# Folder Tree View (if specified).
# The default value is: YES.

SHOW_NAMESPACES        = YES

# The FILE_VERSION_FILTER tag can be used to specify a program or script that
# doxygen should invoke to get the current version for each file (typically from
# the version control system). Doxygen will invoke the program by executing (via
# popen()) the command command input-file, where command is the value of the
# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
# by doxygen. Whatever the program writes to standard output is used as the file
# version. For an example see the documentation.

FILE_VERSION_FILTER    =

# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
# by doxygen. The layout file controls the global structure of the generated
# output files in an output format independent way. To create the layout file
# that represents doxygen's defaults, run doxygen with the -l option. You can
# optionally specify a file name after the option, if omitted DoxygenLayout.xml
# will be used as the name of the layout file.
#
# Note that if you run doxygen from a directory containing a file called
# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
# tag is left empty.

LAYOUT_FILE            =

# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
# the reference definitions. This must be a list of .bib files. The .bib
# extension is automatically appended if omitted. This requires the bibtex tool
# to be installed. See also https://en.wikipedia.org/wiki/BibTeX for more info.
# For LaTeX the style of the bibliography can be controlled using
# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
# search path. See also \cite for info how to create references.

CITE_BIB_FILES         =

#---------------------------------------------------------------------------
# Configuration options related to warning and progress messages
#---------------------------------------------------------------------------

# The QUIET tag can be used to turn on/off the messages that are generated to
# standard output by doxygen. If QUIET is set to YES this implies that the
# messages are off.
# The default value is: NO.

QUIET                  = NO

# The WARNINGS tag can be used to turn on/off the warning messages that are
# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
# this implies that the warnings are on.
#
# Tip: Turn warnings on while writing the documentation.
# The default value is: YES.

WARNINGS               = YES

# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
# will automatically be disabled.
# The default value is: YES.

WARN_IF_UNDOCUMENTED   = YES

# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
# potential errors in the documentation, such as not documenting some parameters
# in a documented function, or documenting parameters that don't exist or using
# markup commands wrongly.
# The default value is: YES.

WARN_IF_DOC_ERROR      = YES

# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
# are documented, but have no documentation for their parameters or return
# value. If set to NO, doxygen will only warn about wrong or incomplete
# parameter documentation, but not about the absence of documentation. If
# EXTRACT_ALL is set to YES then this flag will automatically be disabled.
# The default value is: NO.

WARN_NO_PARAMDOC       = NO

# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
# a warning is encountered.
# The default value is: NO.

WARN_AS_ERROR          = NO

# The WARN_FORMAT tag determines the format of the warning messages that doxygen
# can produce. The string should contain the $file, $line, and $text tags, which
# will be replaced by the file and line number from which the warning originated
# and the warning text. Optionally the format may contain $version, which will
# be replaced by the version of the file (if it could be obtained via
# FILE_VERSION_FILTER)
# The default value is: $file:$line: $text.

WARN_FORMAT            = "$file:$line: $text"

# The WARN_LOGFILE tag can be used to specify a file to which warning and error
# messages should be written. If left blank the output is written to standard
# error (stderr).

WARN_LOGFILE           =

#---------------------------------------------------------------------------
# Configuration options related to the input files
#---------------------------------------------------------------------------

# The INPUT tag is used to specify the files and/or directories that contain
# documented source files. You may enter file names like myfile.cpp or
# directories like /usr/src/myproject. Separate the files or directories with
# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
# Note: If this tag is empty the current directory is searched.

INPUT                  = C:\Users\marcd\CLionProjects\cpp-lazy\include\Lz

# This tag can be used to specify the character encoding of the source files
# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
# documentation (see: https://www.gnu.org/software/libiconv/) for the list of
# possible encodings.
# The default value is: UTF-8.

INPUT_ENCODING         = UTF-8

# If the value of the INPUT tag contains directories, you can use the
# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
# *.h) to filter out the source-files in the directories.
#
# Note that for custom extensions or not directly supported extensions you also
# need to set EXTENSION_MAPPING for the extension otherwise the files are not
# read by doxygen.
#
# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
# *.m, *.markdown, *.md, *.mm, *.dox (to be provided as doxygen C comment),
# *.doc (to be provided as doxygen C comment), *.txt (to be provided as doxygen
# C comment), *.py, *.pyw, *.f90, *.f95, *.f03, *.f08, *.f18, *.f, *.for, *.vhd,
# *.vhdl, *.ucf, *.qsf and *.ice.

FILE_PATTERNS          = *.c \
                         *.cc \
                         *.cxx \
                         *.cpp \
                         *.c++ \
                         *.java \
                         *.ii \
                         *.ixx \
                         *.ipp \
                         *.i++ \
                         *.inl \
                         *.idl \
                         *.ddl \
                         *.odl \
                         *.h \
                         *.hh \
                         *.hxx \
                         *.hpp \
                         *.h++ \
                         *.cs \
                         *.d \
                         *.php \
                         *.php4 \
                         *.php5 \
                         *.phtml \
                         *.inc \
                         *.m \
                         *.markdown \
                         *.md \
                         *.mm \
                         *.dox \
                         *.doc \
                         *.txt \
                         *.py \
                         *.pyw \
                         *.f90 \
                         *.f95 \
                         *.f03 \
                         *.f08 \
                         *.f18 \
                         *.f \
                         *.for \
                         *.vhd \
                         *.vhdl \
                         *.ucf \
                         *.qsf \
                         *.ice

# The RECURSIVE tag can be used to specify whether or not subdirectories should
# be searched for input files as well.
# The default value is: NO.

RECURSIVE              = NO

# The EXCLUDE tag can be used to specify files and/or directories that should be
# excluded from the INPUT source files. This way you can easily exclude a
# subdirectory from a directory tree whose root is specified with the INPUT tag.
#
# Note that relative paths are relative to the directory from which doxygen is
# run.

EXCLUDE                =

# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
# directories that are symbolic links (a Unix file system feature) are excluded
# from the input.
# The default value is: NO.

EXCLUDE_SYMLINKS       = NO

# If the value of the INPUT tag contains directories, you can use the
# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
# certain files from those directories.
#
# Note that the wildcards are matched against the file with absolute path, so to
# exclude all test directories for example use the pattern */test/*

EXCLUDE_PATTERNS       =

# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
# (namespaces, classes, functions, etc.) that should be excluded from the
# output. The symbol name can be a fully qualified name, a word, or if the
# wildcard * is used, a substring. Examples: ANamespace, AClass,
# AClass::ANamespace, ANamespace::*Test
#
# Note that the wildcards are matched against the file with absolute path, so to
# exclude all test directories use the pattern */test/*

EXCLUDE_SYMBOLS        =

# The EXAMPLE_PATH tag can be used to specify one or more files or directories
# that contain example code fragments that are included (see the \include
# command).

EXAMPLE_PATH           =

# If the value of the EXAMPLE_PATH tag contains directories, you can use the
# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
# *.h) to filter out the source-files in the directories. If left blank all
# files are included.

EXAMPLE_PATTERNS       = *

# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
# searched for input files to be used with the \include or \dontinclude commands
# irrespective of the value of the RECURSIVE tag.
# The default value is: NO.

EXAMPLE_RECURSIVE      = NO

# The IMAGE_PATH tag can be used to specify one or more files or directories
# that contain images that are to be included in the documentation (see the
# \image command).

IMAGE_PATH             =

# The INPUT_FILTER tag can be used to specify a program that doxygen should
# invoke to filter for each input file. Doxygen will invoke the filter program
# by executing (via popen()) the command:
#
# <filter> <input-file>
#
# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
# name of an input file. Doxygen will then use the output that the filter
# program writes to standard output. If FILTER_PATTERNS is specified, this tag
# will be ignored.
#
# Note that the filter must not add or remove lines; it is applied before the
# code is scanned, but not when the output code is generated. If lines are added
# or removed, the anchors will not be placed correctly.
#
# Note that for custom extensions or not directly supported extensions you also
# need to set EXTENSION_MAPPING for the extension otherwise the files are not
# properly processed by doxygen.

INPUT_FILTER           =

# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
# basis. Doxygen will compare the file name with each pattern and apply the
# filter if there is a match. The filters are a list of the form: pattern=filter
# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
# patterns match the file name, INPUT_FILTER is applied.
#
# Note that for custom extensions or not directly supported extensions you also
# need to set EXTENSION_MAPPING for the extension otherwise the files are not
# properly processed by doxygen.

FILTER_PATTERNS        =

# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
# INPUT_FILTER) will also be used to filter the input files that are used for
# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
# The default value is: NO.

FILTER_SOURCE_FILES    = NO

# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
# it is also possible to disable source filtering for a specific pattern using
# *.ext= (so without naming a filter).
# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.

FILTER_SOURCE_PATTERNS =

# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
# is part of the input, its contents will be placed on the main page
# (index.html). This can be useful if you have a project on for instance GitHub
# and want to reuse the introduction page also for the doxygen output.

USE_MDFILE_AS_MAINPAGE =

#---------------------------------------------------------------------------
# Configuration options related to source browsing
#---------------------------------------------------------------------------

# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
# generated. Documented entities will be cross-referenced with these sources.
#
# Note: To get rid of all source code in the generated output, make sure that
# also VERBATIM_HEADERS is set to NO.
# The default value is: NO.

SOURCE_BROWSER         = NO

# Setting the INLINE_SOURCES tag to YES will include the body of functions,
# classes and enums directly into the documentation.
# The default value is: NO.

INLINE_SOURCES         = NO

# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
# special comment blocks from generated source code fragments. Normal C, C++ and
# Fortran comments will always remain visible.
# The default value is: YES.

STRIP_CODE_COMMENTS    = YES

# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
# entity all documented functions referencing it will be listed.
# The default value is: NO.

REFERENCED_BY_RELATION = NO

# If the REFERENCES_RELATION tag is set to YES then for each documented function
# all documented entities called/used by that function will be listed.
# The default value is: NO.

REFERENCES_RELATION    = NO

# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
# to YES then the hyperlinks from functions in REFERENCES_RELATION and
# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
# link to the documentation.
# The default value is: YES.

REFERENCES_LINK_SOURCE = YES

# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
# source code will show a tooltip with additional information such as prototype,
# brief description and links to the definition and documentation. Since this
# will make the HTML file larger and loading of large files a bit slower, you
# can opt to disable this feature.
# The default value is: YES.
# This tag requires that the tag SOURCE_BROWSER is set to YES.

SOURCE_TOOLTIPS        = YES

# If the USE_HTAGS tag is set to YES then the references to source code will
# point to the HTML generated by the htags(1) tool instead of doxygen built-in
# source browser. The htags tool is part of GNU's global source tagging system
# (see https://www.gnu.org/software/global/global.html). You will need version
# 4.8.6 or higher.
#
# To use it do the following:
# - Install the latest version of global
# - Enable SOURCE_BROWSER and USE_HTAGS in the configuration file
# - Make sure the INPUT points to the root of the source tree
# - Run doxygen as normal
#
# Doxygen will invoke htags (and that will in turn invoke gtags), so these
# tools must be available from the command line (i.e. in the search path).
#
# The result: instead of the source browser generated by doxygen, the links to
# source code will now point to the output of htags.
# The default value is: NO.
# This tag requires that the tag SOURCE_BROWSER is set to YES.

USE_HTAGS              = NO

# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
# verbatim copy of the header file for each class for which an include is
# specified. Set to NO to disable this.
# See also: Section \class.
# The default value is: YES.

VERBATIM_HEADERS       = YES

# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
# cost of reduced performance. This can be particularly helpful with template
# rich C++ code for which doxygen's built-in parser lacks the necessary type
# information.
# Note: The availability of this option depends on whether or not doxygen was
# generated with the -Duse_libclang=ON option for CMake.
# The default value is: NO.

CLANG_ASSISTED_PARSING = NO

# If clang assisted parsing is enabled you can provide the compiler with command
# line options that you would normally use when invoking the compiler. Note that
# the include paths will already be set by doxygen for the files and directories
# specified with INPUT and INCLUDE_PATH.
# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.

CLANG_OPTIONS          =

# If clang assisted parsing is enabled you can provide the clang parser with the
# path to the compilation database (see:
# http://clang.llvm.org/docs/HowToSetupToolingForLLVM.html) used when the files
# were built. This is equivalent to specifying the "-p" option to a clang tool,
# such as clang-check. These options will then be passed to the parser.
# Note: The availability of this option depends on whether or not doxygen was
# generated with the -Duse_libclang=ON option for CMake.

CLANG_DATABASE_PATH    =

#---------------------------------------------------------------------------
# Configuration options related to the alphabetical class index
#---------------------------------------------------------------------------

# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
# compounds will be generated. Enable this if the project contains a lot of
# classes, structs, unions or interfaces.
# The default value is: YES.

ALPHABETICAL_INDEX     = YES

# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
# which the alphabetical index list will be split.
# Minimum value: 1, maximum value: 20, default value: 5.
# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.

COLS_IN_ALPHA_INDEX    = 5

# In case all classes in a project start with a common prefix, all classes will
# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
# can be used to specify a prefix (or a list of prefixes) that should be ignored
# while generating the index headers.
# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.

IGNORE_PREFIX          =

#---------------------------------------------------------------------------
# Configuration options related to the HTML output
#---------------------------------------------------------------------------

# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
# The default value is: YES.

GENERATE_HTML          = YES

# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
# it.
# The default directory is: html.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_OUTPUT            = html

# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
# generated HTML page (for example: .htm, .php, .asp).
# The default value is: .html.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_FILE_EXTENSION    = .html

# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
# each generated HTML page. If the tag is left blank doxygen will generate a
# standard header.
#
# To get valid HTML the header file that includes any scripts and style sheets
# that doxygen needs, which is dependent on the configuration options used (e.g.
# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
# default header using
# doxygen -w html new_header.html new_footer.html new_stylesheet.css
# YourConfigFile
# and then modify the file new_header.html. See also section "Doxygen usage"
# for information on how to generate the default header that doxygen normally
# uses.
# Note: The header is subject to change so you typically have to regenerate the
# default header when upgrading to a newer version of doxygen. For a description
# of the possible markers and block names see the documentation.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_HEADER            =

# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
# generated HTML page. If the tag is left blank doxygen will generate a standard
# footer. See HTML_HEADER for more information on how to generate a default
# footer and what special commands can be used inside the footer. See also
# section "Doxygen usage" for information on how to generate the default footer
# that doxygen normally uses.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_FOOTER            =

# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
# sheet that is used by each HTML page. It can be used to fine-tune the look of
# the HTML output. If left blank doxygen will generate a default style sheet.
# See also section "Doxygen usage" for information on how to generate the style
# sheet that doxygen normally uses.
# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
# it is more robust and this tag (HTML_STYLESHEET) will in the future become
# obsolete.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_STYLESHEET        =

# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
# cascading style sheets that are included after the standard style sheets
# created by doxygen. Using this option one can overrule certain style aspects.
# This is preferred over using HTML_STYLESHEET since it does not replace the
# standard style sheet and is therefore more robust against future updates.
# Doxygen will copy the style sheet files to the output directory.
# Note: The order of the extra style sheet files is of importance (e.g. the last
# style sheet in the list overrules the setting of the previous ones in the
# list). For an example see the documentation.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_EXTRA_STYLESHEET  =

# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
# other source files which should be copied to the HTML output directory. Note
# that these files will be copied to the base HTML output directory. Use the
# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
# files will be copied as-is; there are no commands or markers available.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_EXTRA_FILES       =

# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
# will adjust the colors in the style sheet and background images according to
# this color. Hue is specified as an angle on a colorwheel, see
# https://en.wikipedia.org/wiki/Hue for more information. For instance the value
# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
# purple, and 360 is red again.
# Minimum value: 0, maximum value: 359, default value: 220.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_COLORSTYLE_HUE    = 220

# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
# in the HTML output. For a value of 0 the output will use grayscales only. A
# value of 255 will produce the most vivid colors.
# Minimum value: 0, maximum value: 255, default value: 100.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_COLORSTYLE_SAT    = 100

# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
# luminance component of the colors in the HTML output. Values below 100
# gradually make the output lighter, whereas values above 100 make the output
# darker. The value divided by 100 is the actual gamma applied, so 80 represents
# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
# change the gamma.
# Minimum value: 40, maximum value: 240, default value: 80.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_COLORSTYLE_GAMMA  = 80

# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
# page will contain the date and time when the page was generated. Setting this
# to YES can help to show when doxygen was last run and thus if the
# documentation is up to date.
# The default value is: NO.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_TIMESTAMP         = NO

# If the HTML_DYNAMIC_MENUS tag is set to YES then the generated HTML
# documentation will contain a main index with vertical navigation menus that
# are dynamically created via JavaScript. If disabled, the navigation index will
# consists of multiple levels of tabs that are statically embedded in every HTML
# page. Disable this option to support browsers that do not have JavaScript,
# like the Qt help browser.
# The default value is: YES.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_DYNAMIC_MENUS     = YES

# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
# documentation will contain sections that can be hidden and shown after the
# page has loaded.
# The default value is: NO.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_DYNAMIC_SECTIONS  = NO

# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
# shown in the various tree structured indices initially; the user can expand
# and collapse entries dynamically later on. Doxygen will expand the tree to
# such a level that at most the specified number of entries are visible (unless
# a fully collapsed tree already exceeds this amount). So setting the number of
# entries 1 will produce a full collapsed tree by default. 0 is a special value
# representing an infinite number of entries and will result in a full expanded
# tree by default.
# Minimum value: 0, maximum value: 9999, default value: 100.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_INDEX_NUM_ENTRIES = 100

# If the GENERATE_DOCSET tag is set to YES, additional index files will be
# generated that can be used as input for Apple's Xcode 3 integrated development
# environment (see: https://developer.apple.com/xcode/), introduced with OSX
# 10.5 (Leopard). To create a documentation set, doxygen will generate a
# Makefile in the HTML output directory. Running make will produce the docset in
# that directory and running make install will install the docset in
# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
# startup. See https://developer.apple.com/library/archive/featuredarticles/Doxy
# genXcode/_index.html for more information.
# The default value is: NO.
# This tag requires that the tag GENERATE_HTML is set to YES.

GENERATE_DOCSET        = NO

# This tag determines the name of the docset feed. A documentation feed provides
# an umbrella under which multiple documentation sets from a single provider
# (such as a company or product suite) can be grouped.
# The default value is: Doxygen generated docs.
# This tag requires that the tag GENERATE_DOCSET is set to YES.

DOCSET_FEEDNAME        = "Doxygen generated docs"

# This tag specifies a string that should uniquely identify the documentation
# set bundle. This should be a reverse domain-name style string, e.g.
# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
# The default value is: org.doxygen.Project.
# This tag requires that the tag GENERATE_DOCSET is set to YES.

DOCSET_BUNDLE_ID       = org.doxygen.Project

# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
# the documentation publisher. This should be a reverse domain-name style
# string, e.g. com.mycompany.MyDocSet.documentation.
# The default value is: org.doxygen.Publisher.
# This tag requires that the tag GENERATE_DOCSET is set to YES.

DOCSET_PUBLISHER_ID    = org.doxygen.Publisher

# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
# The default value is: Publisher.
# This tag requires that the tag GENERATE_DOCSET is set to YES.

DOCSET_PUBLISHER_NAME  = Publisher

# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
# (see: https://www.microsoft.com/en-us/download/details.aspx?id=21138) on
# Windows.
#
# The HTML Help Workshop contains a compiler that can convert all HTML output
# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
# files are now used as the Windows 98 help format, and will replace the old
# Windows help format (.hlp) on all Windows platforms in the future. Compressed
# HTML files also contain an index, a table of contents, and you can search for
# words in the documentation. The HTML workshop also contains a viewer for
# compressed HTML files.
# The default value is: NO.
# This tag requires that the tag GENERATE_HTML is set to YES.

GENERATE_HTMLHELP      = NO

# The CHM_FILE tag can be used to specify the file name of the resulting .chm
# file. You can add a path in front of the file if the result should not be
# written to the html output directory.
# This tag requires that the tag GENERATE_HTMLHELP is set to YES.

CHM_FILE               =

# The HHC_LOCATION tag can be used to specify the location (absolute path
# including file name) of the HTML help compiler (hhc.exe). If non-empty,
# doxygen will try to run the HTML help compiler on the generated index.hhp.
# The file has to be specified with full path.
# This tag requires that the tag GENERATE_HTMLHELP is set to YES.

HHC_LOCATION           =

# The GENERATE_CHI flag controls if a separate .chi index file is generated
# (YES) or that it should be included in the master .chm file (NO).
# The default value is: NO.
# This tag requires that the tag GENERATE_HTMLHELP is set to YES.

GENERATE_CHI           = NO

# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
# and project file content.
# This tag requires that the tag GENERATE_HTMLHELP is set to YES.

CHM_INDEX_ENCODING     =

# The BINARY_TOC flag controls whether a binary table of contents is generated
# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
# enables the Previous and Next buttons.
# The default value is: NO.
# This tag requires that the tag GENERATE_HTMLHELP is set to YES.

BINARY_TOC             = NO

# The TOC_EXPAND flag can be set to YES to add extra items for group members to
# the table of contents of the HTML help documentation and to the tree view.
# The default value is: NO.
# This tag requires that the tag GENERATE_HTMLHELP is set to YES.

TOC_EXPAND             = NO

# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
# (.qch) of the generated HTML documentation.
# The default value is: NO.
# This tag requires that the tag GENERATE_HTML is set to YES.

GENERATE_QHP           = NO

# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
# the file name of the resulting .qch file. The path specified is relative to
# the HTML output folder.
# This tag requires that the tag GENERATE_QHP is set to YES.

QCH_FILE               =

# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
# Project output. For more information please see Qt Help Project / Namespace
# (see: https://doc.qt.io/archives/qt-4.8/qthelpproject.html#namespace).
# The default value is: org.doxygen.Project.
# This tag requires that the tag GENERATE_QHP is set to YES.

QHP_NAMESPACE          = org.doxygen.Project

# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
# Help Project output. For more information please see Qt Help Project / Virtual
# Folders (see: https://doc.qt.io/archives/qt-4.8/qthelpproject.html#virtual-
# folders).
# The default value is: doc.
# This tag requires that the tag GENERATE_QHP is set to YES.

QHP_VIRTUAL_FOLDER     = doc

# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
# filter to add. For more information please see Qt Help Project / Custom
# Filters (see: https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-
# filters).
# This tag requires that the tag GENERATE_QHP is set to YES.

QHP_CUST_FILTER_NAME   =

# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
# custom filter to add. For more information please see Qt Help Project / Custom
# Filters (see: https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-
# filters).
# This tag requires that the tag GENERATE_QHP is set to YES.

QHP_CUST_FILTER_ATTRS  =

# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
# project's filter section matches. Qt Help Project / Filter Attributes (see:
# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#filter-attributes).
# This tag requires that the tag GENERATE_QHP is set to YES.

QHP_SECT_FILTER_ATTRS  =

# The QHG_LOCATION tag can be used to specify the location of Qt's
# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
# generated .qhp file.
# This tag requires that the tag GENERATE_QHP is set to YES.

QHG_LOCATION           =

# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
# generated, together with the HTML files, they form an Eclipse help plugin. To
# install this plugin and make it available under the help contents menu in
# Eclipse, the contents of the directory containing the HTML and XML files needs
# to be copied into the plugins directory of eclipse. The name of the directory
# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
# After copying Eclipse needs to be restarted before the help appears.
# The default value is: NO.
# This tag requires that the tag GENERATE_HTML is set to YES.

GENERATE_ECLIPSEHELP   = NO

# A unique identifier for the Eclipse help plugin. When installing the plugin
# the directory name containing the HTML and XML files should also have this
# name. Each documentation set should have its own identifier.
# The default value is: org.doxygen.Project.
# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.

ECLIPSE_DOC_ID         = org.doxygen.Project

# If you want full control over the layout of the generated HTML pages it might
# be necessary to disable the index and replace it with your own. The
# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
# of each HTML page. A value of NO enables the index and the value YES disables
# it. Since the tabs in the index contain the same information as the navigation
# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
# The default value is: NO.
# This tag requires that the tag GENERATE_HTML is set to YES.

DISABLE_INDEX          = NO

# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
# structure should be generated to display hierarchical information. If the tag
# value is set to YES, a side panel will be generated containing a tree-like
# index structure (just like the one that is generated for HTML Help). For this
# to work a browser that supports JavaScript, DHTML, CSS and frames is required
# (i.e. any modern browser). Windows users are probably better off using the
# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
# further fine-tune the look of the index. As an example, the default style
# sheet generated by doxygen has an example that shows how to put an image at
# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
# the same information as the tab index, you could consider setting
# DISABLE_INDEX to YES when enabling this option.
# The default value is: NO.
# This tag requires that the tag GENERATE_HTML is set to YES.

GENERATE_TREEVIEW      = NO

# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
# doxygen will group on one line in the generated HTML documentation.
#
# Note that a value of 0 will completely suppress the enum values from appearing
# in the overview section.
# Minimum value: 0, maximum value: 20, default value: 4.
# This tag requires that the tag GENERATE_HTML is set to YES.

ENUM_VALUES_PER_LINE   = 4

# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
# to set the initial width (in pixels) of the frame in which the tree is shown.
# Minimum value: 0, maximum value: 1500, default value: 250.
# This tag requires that the tag GENERATE_HTML is set to YES.

TREEVIEW_WIDTH         = 250

# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
# external symbols imported via tag files in a separate window.
# The default value is: NO.
# This tag requires that the tag GENERATE_HTML is set to YES.

EXT_LINKS_IN_WINDOW    = NO

# If the HTML_FORMULA_FORMAT option is set to svg, doxygen will use the pdf2svg
# tool (see https://github.com/dawbarton/pdf2svg) or inkscape (see
# https://inkscape.org) to generate formulas as SVG images instead of PNGs for
# the HTML output. These images will generally look nicer at scaled resolutions.
# Possible values are: png The default and svg Looks nicer but requires the
# pdf2svg tool.
# The default value is: png.
# This tag requires that the tag GENERATE_HTML is set to YES.

HTML_FORMULA_FORMAT    = png

# Use this tag to change the font size of LaTeX formulas included as images in
# the HTML documentation. When you change the font size after a successful
# doxygen run you need to manually remove any form_*.png images from the HTML
# output directory to force them to be regenerated.
# Minimum value: 8, maximum value: 50, default value: 10.
# This tag requires that the tag GENERATE_HTML is set to YES.

FORMULA_FONTSIZE       = 10

# Use the FORMULA_TRANSPARENT tag to determine whether or not the images
# generated for formulas are transparent PNGs. Transparent PNGs are not
# supported properly for IE 6.0, but are supported on all modern browsers.
#
# Note that when changing this option you need to delete any form_*.png files in
# the HTML output directory before the changes have effect.
# The default value is: YES.
# This tag requires that the tag GENERATE_HTML is set to YES.

FORMULA_TRANSPARENT    = YES

# The FORMULA_MACROFILE can contain LaTeX \newcommand and \renewcommand commands
# to create new LaTeX commands to be used in formulas as building blocks. See
# the section "Including formulas" for details.

FORMULA_MACROFILE      =

# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
# https://www.mathjax.org) which uses client side JavaScript for the rendering
# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
# installed or if you want to formulas look prettier in the HTML output. When
# enabled you may also need to install MathJax separately and configure the path
# to it using the MATHJAX_RELPATH option.
# The default value is: NO.
# This tag requires that the tag GENERATE_HTML is set to YES.

USE_MATHJAX            = NO

# When MathJax is enabled you can set the default output format to be used for
# the MathJax output. See the MathJax site (see:
# http://docs.mathjax.org/en/latest/output.html) for more details.
# Possible values are: HTML-CSS (which is slower, but has the best
# compatibility), NativeMML (i.e. MathML) and SVG.
# The default value is: HTML-CSS.
# This tag requires that the tag USE_MATHJAX is set to YES.

MATHJAX_FORMAT         = HTML-CSS

# When MathJax is enabled you need to specify the location relative to the HTML
# output directory using the MATHJAX_RELPATH option. The destination directory
# should contain the MathJax.js script. For instance, if the mathjax directory
# is located at the same level as the HTML output directory, then
# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
# Content Delivery Network so you can quickly see the result without installing
# MathJax. However, it is strongly recommended to install a local copy of
# MathJax from https://www.mathjax.org before deployment.
# The default value is: https://cdn.jsdelivr.net/npm/mathjax@2.
# This tag requires that the tag USE_MATHJAX is set to YES.

MATHJAX_RELPATH        = https://cdn.jsdelivr.net/npm/mathjax@2

# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
# extension names that should be enabled during MathJax rendering. For example
# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
# This tag requires that the tag USE_MATHJAX is set to YES.

MATHJAX_EXTENSIONS     =

# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
# of code that will be used on startup of the MathJax code. See the MathJax site
# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
# example see the documentation.
# This tag requires that the tag USE_MATHJAX is set to YES.

MATHJAX_CODEFILE       =

# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
# the HTML output. The underlying search engine uses javascript and DHTML and
# should work on any modern browser. Note that when using HTML help
# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
# there is already a search function so this one should typically be disabled.
# For large projects the javascript based search engine can be slow, then
# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
# search using the keyboard; to jump to the search box use <access key> + S
# (what the <access key> is depends on the OS and browser, but it is typically
# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
# key> to jump into the search results window, the results can be navigated
# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
# the search. The filter options can be selected when the cursor is inside the
# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
# to select a filter and <Enter> or <escape> to activate or cancel the filter
# option.
# The default value is: YES.
# This tag requires that the tag GENERATE_HTML is set to YES.

SEARCHENGINE           = YES

# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
# implemented using a web server instead of a web client using JavaScript. There
# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
# setting. When disabled, doxygen will generate a PHP script for searching and
# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
# and searching needs to be provided by external tools. See the section
# "External Indexing and Searching" for details.
# The default value is: NO.
# This tag requires that the tag SEARCHENGINE is set to YES.

SERVER_BASED_SEARCH    = NO

# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
# script for searching. Instead the search results are written to an XML file
# which needs to be processed by an external indexer. Doxygen will invoke an
# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
# search results.
#
# Doxygen ships with an example indexer (doxyindexer) and search engine
# (doxysearch.cgi) which are based on the open source search engine library
# Xapian (see: https://xapian.org/).
#
# See the section "External Indexing and Searching" for details.
# The default value is: NO.
# This tag requires that the tag SEARCHENGINE is set to YES.

EXTERNAL_SEARCH        = NO

# The SEARCHENGINE_URL should point to a search engine hosted by a web server
# which will return the search results when EXTERNAL_SEARCH is enabled.
#
# Doxygen ships with an example indexer (doxyindexer) and search engine
# (doxysearch.cgi) which are based on the open source search engine library
# Xapian (see: https://xapian.org/). See the section "External Indexing and
# Searching" for details.
# This tag requires that the tag SEARCHENGINE is set to YES.

SEARCHENGINE_URL       =

# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
# search data is written to a file for indexing by an external tool. With the
# SEARCHDATA_FILE tag the name of this file can be specified.
# The default file is: searchdata.xml.
# This tag requires that the tag SEARCHENGINE is set to YES.

SEARCHDATA_FILE        = searchdata.xml

# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
# projects and redirect the results back to the right project.
# This tag requires that the tag SEARCHENGINE is set to YES.

EXTERNAL_SEARCH_ID     =

# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
# projects other than the one defined by this configuration file, but that are
# all added to the same external search index. Each project needs to have a
# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
# to a relative location where the documentation can be found. The format is:
# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
# This tag requires that the tag SEARCHENGINE is set to YES.

EXTRA_SEARCH_MAPPINGS  =

#---------------------------------------------------------------------------
# Configuration options related to the LaTeX output
#---------------------------------------------------------------------------

# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
# The default value is: YES.

GENERATE_LATEX         = YES

# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
# it.
# The default directory is: latex.
# This tag requires that the tag GENERATE_LATEX is set to YES.

LATEX_OUTPUT           = latex

# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
# invoked.
#
# Note that when not enabling USE_PDFLATEX the default is latex when enabling
# USE_PDFLATEX the default is pdflatex and when in the later case latex is
# chosen this is overwritten by pdflatex. For specific output languages the
# default can have been set differently, this depends on the implementation of
# the output language.
# This tag requires that the tag GENERATE_LATEX is set to YES.

LATEX_CMD_NAME         =

# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
# index for LaTeX.
# Note: This tag is used in the Makefile / make.bat.
# See also: LATEX_MAKEINDEX_CMD for the part in the generated output file
# (.tex).
# The default file is: makeindex.
# This tag requires that the tag GENERATE_LATEX is set to YES.

MAKEINDEX_CMD_NAME     = makeindex

# The LATEX_MAKEINDEX_CMD tag can be used to specify the command name to
# generate index for LaTeX. In case there is no backslash (\) as first character
# it will be automatically added in the LaTeX code.
# Note: This tag is used in the generated output file (.tex).
# See also: MAKEINDEX_CMD_NAME for the part in the Makefile / make.bat.
# The default value is: makeindex.
# This tag requires that the tag GENERATE_LATEX is set to YES.

LATEX_MAKEINDEX_CMD    = makeindex

# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
# documents. This may be useful for small projects and may help to save some
# trees in general.
# The default value is: NO.
# This tag requires that the tag GENERATE_LATEX is set to YES.

COMPACT_LATEX          = NO

# The PAPER_TYPE tag can be used to set the paper type that is used by the
# printer.
# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
# 14 inches) and executive (7.25 x 10.5 inches).
# The default value is: a4.
# This tag requires that the tag GENERATE_LATEX is set to YES.

PAPER_TYPE             = a4

# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
# that should be included in the LaTeX output. The package can be specified just
# by its name or with the correct syntax as to be used with the LaTeX
# \usepackage command. To get the times font for instance you can specify :
# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
# To use the option intlimits with the amsmath package you can specify:
# EXTRA_PACKAGES=[intlimits]{amsmath}
# If left blank no extra packages will be included.
# This tag requires that the tag GENERATE_LATEX is set to YES.

EXTRA_PACKAGES         =

# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
# generated LaTeX document. The header should contain everything until the first
# chapter. If it is left blank doxygen will generate a standard header. See
# section "Doxygen usage" for information on how to let doxygen write the
# default header to a separate file.
#
# Note: Only use a user-defined header if you know what you are doing! The
# following commands have a special meaning inside the header: $title,
# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
# string, for the replacement values of the other commands the user is referred
# to HTML_HEADER.
# This tag requires that the tag GENERATE_LATEX is set to YES.

LATEX_HEADER           =

# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
# generated LaTeX document. The footer should contain everything after the last
# chapter. If it is left blank doxygen will generate a standard footer. See
# LATEX_HEADER for more information on how to generate a default footer and what
# special commands can be used inside the footer.
#
# Note: Only use a user-defined footer if you know what you are doing!
# This tag requires that the tag GENERATE_LATEX is set to YES.

LATEX_FOOTER           =

# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
# LaTeX style sheets that are included after the standard style sheets created
# by doxygen. Using this option one can overrule certain style aspects. Doxygen
# will copy the style sheet files to the output directory.
# Note: The order of the extra style sheet files is of importance (e.g. the last
# style sheet in the list overrules the setting of the previous ones in the
# list).
# This tag requires that the tag GENERATE_LATEX is set to YES.

LATEX_EXTRA_STYLESHEET =

# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
# other source files which should be copied to the LATEX_OUTPUT output
# directory. Note that the files will be copied as-is; there are no commands or
# markers available.
# This tag requires that the tag GENERATE_LATEX is set to YES.

LATEX_EXTRA_FILES      =

# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
# contain links (just like the HTML output) instead of page references. This
# makes the output suitable for online browsing using a PDF viewer.
# The default value is: YES.
# This tag requires that the tag GENERATE_LATEX is set to YES.

PDF_HYPERLINKS         = YES

# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
# the PDF file directly from the LaTeX files. Set this option to YES, to get a
# higher quality PDF documentation.
# The default value is: YES.
# This tag requires that the tag GENERATE_LATEX is set to YES.

USE_PDFLATEX           = YES

# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
# command to the generated LaTeX files. This will instruct LaTeX to keep running
# if errors occur, instead of asking the user for help. This option is also used
# when generating formulas in HTML.
# The default value is: NO.
# This tag requires that the tag GENERATE_LATEX is set to YES.

LATEX_BATCHMODE        = NO

# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
# index chapters (such as File Index, Compound Index, etc.) in the output.
# The default value is: NO.
# This tag requires that the tag GENERATE_LATEX is set to YES.

LATEX_HIDE_INDICES     = NO

# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
# code with syntax highlighting in the LaTeX output.
#
# Note that which sources are shown also depends on other settings such as
# SOURCE_BROWSER.
# The default value is: NO.
# This tag requires that the tag GENERATE_LATEX is set to YES.

LATEX_SOURCE_CODE      = NO

# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
# bibliography, e.g. plainnat, or ieeetr. See
# https://en.wikipedia.org/wiki/BibTeX and \cite for more info.
# The default value is: plain.
# This tag requires that the tag GENERATE_LATEX is set to YES.

LATEX_BIB_STYLE        = plain

# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
# page will contain the date and time when the page was generated. Setting this
# to NO can help when comparing the output of multiple runs.
# The default value is: NO.
# This tag requires that the tag GENERATE_LATEX is set to YES.

LATEX_TIMESTAMP        = NO

# The LATEX_EMOJI_DIRECTORY tag is used to specify the (relative or absolute)
# path from which the emoji images will be read. If a relative path is entered,
# it will be relative to the LATEX_OUTPUT directory. If left blank the
# LATEX_OUTPUT directory will be used.
# This tag requires that the tag GENERATE_LATEX is set to YES.

LATEX_EMOJI_DIRECTORY  =

#---------------------------------------------------------------------------
# Configuration options related to the RTF output
#---------------------------------------------------------------------------

# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
# RTF output is optimized for Word 97 and may not look too pretty with other RTF
# readers/editors.
# The default value is: NO.

GENERATE_RTF           = NO

# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
# it.
# The default directory is: rtf.
# This tag requires that the tag GENERATE_RTF is set to YES.

RTF_OUTPUT             = rtf

# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
# documents. This may be useful for small projects and may help to save some
# trees in general.
# The default value is: NO.
# This tag requires that the tag GENERATE_RTF is set to YES.

COMPACT_RTF            = NO

# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
# contain hyperlink fields. The RTF file will contain links (just like the HTML
# output) instead of page references. This makes the output suitable for online
# browsing using Word or some other Word compatible readers that support those
# fields.
#
# Note: WordPad (write) and others do not support links.
# The default value is: NO.
# This tag requires that the tag GENERATE_RTF is set to YES.

RTF_HYPERLINKS         = NO

# Load stylesheet definitions from file. Syntax is similar to doxygen's
# configuration file, i.e. a series of assignments. You only have to provide
# replacements, missing definitions are set to their default value.
#
# See also section "Doxygen usage" for information on how to generate the
# default style sheet that doxygen normally uses.
# This tag requires that the tag GENERATE_RTF is set to YES.

RTF_STYLESHEET_FILE    =

# Set optional variables used in the generation of an RTF document. Syntax is
# similar to doxygen's configuration file. A template extensions file can be
# generated using doxygen -e rtf extensionFile.
# This tag requires that the tag GENERATE_RTF is set to YES.

RTF_EXTENSIONS_FILE    =

# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
# with syntax highlighting in the RTF output.
#
# Note that which sources are shown also depends on other settings such as
# SOURCE_BROWSER.
# The default value is: NO.
# This tag requires that the tag GENERATE_RTF is set to YES.

RTF_SOURCE_CODE        = NO

#---------------------------------------------------------------------------
# Configuration options related to the man page output
#---------------------------------------------------------------------------

# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
# classes and files.
# The default value is: NO.

GENERATE_MAN           = NO

# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
# it. A directory man3 will be created inside the directory specified by
# MAN_OUTPUT.
# The default directory is: man.
# This tag requires that the tag GENERATE_MAN is set to YES.

MAN_OUTPUT             = man

# The MAN_EXTENSION tag determines the extension that is added to the generated
# man pages. In case the manual section does not start with a number, the number
# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
# optional.
# The default value is: .3.
# This tag requires that the tag GENERATE_MAN is set to YES.

MAN_EXTENSION          = .3

# The MAN_SUBDIR tag determines the name of the directory created within
# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
# MAN_EXTENSION with the initial . removed.
# This tag requires that the tag GENERATE_MAN is set to YES.

MAN_SUBDIR             =

# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
# will generate one additional man file for each entity documented in the real
# man page(s). These additional files only source the real man page, but without
# them the man command would be unable to find the correct page.
# The default value is: NO.
# This tag requires that the tag GENERATE_MAN is set to YES.

MAN_LINKS              = NO

#---------------------------------------------------------------------------
# Configuration options related to the XML output
#---------------------------------------------------------------------------

# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
# captures the structure of the code including all documentation.
# The default value is: NO.

GENERATE_XML           = NO

# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
# it.
# The default directory is: xml.
# This tag requires that the tag GENERATE_XML is set to YES.

XML_OUTPUT             = xml

# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
# listings (including syntax highlighting and cross-referencing information) to
# the XML output. Note that enabling this will significantly increase the size
# of the XML output.
# The default value is: YES.
# This tag requires that the tag GENERATE_XML is set to YES.

XML_PROGRAMLISTING     = YES

# If the XML_NS_MEMB_FILE_SCOPE tag is set to YES, doxygen will include
# namespace members in file scope as well, matching the HTML output.
# The default value is: NO.
# This tag requires that the tag GENERATE_XML is set to YES.

XML_NS_MEMB_FILE_SCOPE = NO

#---------------------------------------------------------------------------
# Configuration options related to the DOCBOOK output
#---------------------------------------------------------------------------

# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
# that can be used to generate PDF.
# The default value is: NO.

GENERATE_DOCBOOK       = NO

# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
# front of it.
# The default directory is: docbook.
# This tag requires that the tag GENERATE_DOCBOOK is set to YES.

DOCBOOK_OUTPUT         = docbook

# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
# program listings (including syntax highlighting and cross-referencing
# information) to the DOCBOOK output. Note that enabling this will significantly
# increase the size of the DOCBOOK output.
# The default value is: NO.
# This tag requires that the tag GENERATE_DOCBOOK is set to YES.

DOCBOOK_PROGRAMLISTING = NO

#---------------------------------------------------------------------------
# Configuration options for the AutoGen Definitions output
#---------------------------------------------------------------------------

# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
# AutoGen Definitions (see http://autogen.sourceforge.net/) file that captures
# the structure of the code including all documentation. Note that this feature
# is still experimental and incomplete at the moment.
# The default value is: NO.

GENERATE_AUTOGEN_DEF   = NO

#---------------------------------------------------------------------------
# Configuration options related to the Perl module output
#---------------------------------------------------------------------------

# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
# file that captures the structure of the code including all documentation.
#
# Note that this feature is still experimental and incomplete at the moment.
# The default value is: NO.

GENERATE_PERLMOD       = NO

# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
# output from the Perl module output.
# The default value is: NO.
# This tag requires that the tag GENERATE_PERLMOD is set to YES.

PERLMOD_LATEX          = NO

# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
# formatted so it can be parsed by a human reader. This is useful if you want to
# understand what is going on. On the other hand, if this tag is set to NO, the
# size of the Perl module output will be much smaller and Perl will parse it
# just the same.
# The default value is: YES.
# This tag requires that the tag GENERATE_PERLMOD is set to YES.

PERLMOD_PRETTY         = YES

# The names of the make variables in the generated doxyrules.make file are
# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
# so different doxyrules.make files included by the same Makefile don't
# overwrite each other's variables.
# This tag requires that the tag GENERATE_PERLMOD is set to YES.

PERLMOD_MAKEVAR_PREFIX =

#---------------------------------------------------------------------------
# Configuration options related to the preprocessor
#---------------------------------------------------------------------------

# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
# C-preprocessor directives found in the sources and include files.
# The default value is: YES.

ENABLE_PREPROCESSING   = YES

# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
# in the source code. If set to NO, only conditional compilation will be
# performed. Macro expansion can be done in a controlled way by setting
# EXPAND_ONLY_PREDEF to YES.
# The default value is: NO.
# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.

MACRO_EXPANSION        = NO

# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
# the macro expansion is limited to the macros specified with the PREDEFINED and
# EXPAND_AS_DEFINED tags.
# The default value is: NO.
# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.

EXPAND_ONLY_PREDEF     = NO

# If the SEARCH_INCLUDES tag is set to YES, the include files in the
# INCLUDE_PATH will be searched if a #include is found.
# The default value is: YES.
# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.

SEARCH_INCLUDES        = YES

# The INCLUDE_PATH tag can be used to specify one or more directories that
# contain include files that are not input files but should be processed by the
# preprocessor.
# This tag requires that the tag SEARCH_INCLUDES is set to YES.

INCLUDE_PATH           =

# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
# patterns (like *.h and *.hpp) to filter out the header-files in the
# directories. If left blank, the patterns specified with FILE_PATTERNS will be
# used.
# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.

INCLUDE_FILE_PATTERNS  =

# The PREDEFINED tag can be used to specify one or more macro names that are
# defined before the preprocessor is started (similar to the -D option of e.g.
# gcc). The argument of the tag is a list of macros of the form: name or
# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
# is assumed. To prevent a macro definition from being undefined via #undef or
# recursively expanded use the := operator instead of the = operator.
# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.

PREDEFINED             =

# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
# tag can be used to specify a list of macro names that should be expanded. The
# macro definition that is found in the sources will be used. Use the PREDEFINED
# tag if you want to use a different macro definition that overrules the
# definition found in the source code.
# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.

EXPAND_AS_DEFINED      =

# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
# remove all references to function-like macros that are alone on a line, have
# an all uppercase name, and do not end with a semicolon. Such function macros
# are typically used for boiler-plate code, and will confuse the parser if not
# removed.
# The default value is: YES.
# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.

SKIP_FUNCTION_MACROS   = YES

#---------------------------------------------------------------------------
# Configuration options related to external references
#---------------------------------------------------------------------------

# The TAGFILES tag can be used to specify one or more tag files. For each tag
# file the location of the external documentation should be added. The format of
# a tag file without this location is as follows:
# TAGFILES = file1 file2 ...
# Adding location for the tag files is done as follows:
# TAGFILES = file1=loc1 "file2 = loc2" ...
# where loc1 and loc2 can be relative or absolute paths or URLs. See the
# section "Linking to external documentation" for more information about the use
# of tag files.
# Note: Each tag file must have a unique name (where the name does NOT include
# the path). If a tag file is not located in the directory in which doxygen is
# run, you must also specify the path to the tagfile here.

TAGFILES               =

# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
# tag file that is based on the input files it reads. See section "Linking to
# external documentation" for more information about the usage of tag files.

GENERATE_TAGFILE       =

# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
# the class index. If set to NO, only the inherited external classes will be
# listed.
# The default value is: NO.

ALLEXTERNALS           = NO

# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
# in the modules index. If set to NO, only the current project's groups will be
# listed.
# The default value is: YES.

EXTERNAL_GROUPS        = YES

# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
# the related pages index. If set to NO, only the current project's pages will
# be listed.
# The default value is: YES.

EXTERNAL_PAGES         = YES

#---------------------------------------------------------------------------
# Configuration options related to the dot tool
#---------------------------------------------------------------------------

# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
# NO turns the diagrams off. Note that this option also works with HAVE_DOT
# disabled, but it is recommended to install and use dot, since it yields more
# powerful graphs.
# The default value is: YES.

CLASS_DIAGRAMS         = YES

# You can include diagrams made with dia in doxygen documentation. Doxygen will
# then run dia to produce the diagram and insert it in the documentation. The
# DIA_PATH tag allows you to specify the directory where the dia binary resides.
# If left empty dia is assumed to be found in the default search path.

DIA_PATH               =

# If set to YES the inheritance and collaboration graphs will hide inheritance
# and usage relations if the target is undocumented or is not a class.
# The default value is: YES.

HIDE_UNDOC_RELATIONS   = YES

# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
# available from the path. This tool is part of Graphviz (see:
# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
# Bell Labs. The other options in this section have no effect if this option is
# set to NO
# The default value is: NO.

HAVE_DOT               = NO

# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
# to run in parallel. When set to 0 doxygen will base this on the number of
# processors available in the system. You can set it explicitly to a value
# larger than 0 to get control over the balance between CPU load and processing
# speed.
# Minimum value: 0, maximum value: 32, default value: 0.
# This tag requires that the tag HAVE_DOT is set to YES.

DOT_NUM_THREADS        = 0

# When you want a differently looking font in the dot files that doxygen
# generates you can specify the font name using DOT_FONTNAME. You need to make
# sure dot is able to find the font, which can be done by putting it in a
# standard location or by setting the DOTFONTPATH environment variable or by
# setting DOT_FONTPATH to the directory containing the font.
# The default value is: Helvetica.
# This tag requires that the tag HAVE_DOT is set to YES.

DOT_FONTNAME           = Helvetica

# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
# dot graphs.
# Minimum value: 4, maximum value: 24, default value: 10.
# This tag requires that the tag HAVE_DOT is set to YES.

DOT_FONTSIZE           = 10

# By default doxygen will tell dot to use the default font as specified with
# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
# the path where dot can find it using this tag.
# This tag requires that the tag HAVE_DOT is set to YES.

DOT_FONTPATH           =

# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
# each documented class showing the direct and indirect inheritance relations.
# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
# The default value is: YES.
# This tag requires that the tag HAVE_DOT is set to YES.

CLASS_GRAPH            = YES

# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
# graph for each documented class showing the direct and indirect implementation
# dependencies (inheritance, containment, and class references variables) of the
# class with other documented classes.
# The default value is: YES.
# This tag requires that the tag HAVE_DOT is set to YES.

COLLABORATION_GRAPH    = YES

# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
# groups, showing the direct groups dependencies.
# The default value is: YES.
# This tag requires that the tag HAVE_DOT is set to YES.

GROUP_GRAPHS           = YES

# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
# collaboration diagrams in a style similar to the OMG's Unified Modeling
# Language.
# The default value is: NO.
# This tag requires that the tag HAVE_DOT is set to YES.

UML_LOOK               = NO

# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
# class node. If there are many fields or methods and many nodes the graph may
# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
# number of items for each type to make the size more manageable. Set this to 0
# for no limit. Note that the threshold may be exceeded by 50% before the limit
# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
# but if the number exceeds 15, the total amount of fields shown is limited to
# 10.
# Minimum value: 0, maximum value: 100, default value: 10.
# This tag requires that the tag HAVE_DOT is set to YES.

UML_LIMIT_NUM_FIELDS   = 10

# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
# collaboration graphs will show the relations between templates and their
# instances.
# The default value is: NO.
# This tag requires that the tag HAVE_DOT is set to YES.

TEMPLATE_RELATIONS     = NO

# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
# YES then doxygen will generate a graph for each documented file showing the
# direct and indirect include dependencies of the file with other documented
# files.
# The default value is: YES.
# This tag requires that the tag HAVE_DOT is set to YES.

INCLUDE_GRAPH          = YES

# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
# set to YES then doxygen will generate a graph for each documented file showing
# the direct and indirect include dependencies of the file with other documented
# files.
# The default value is: YES.
# This tag requires that the tag HAVE_DOT is set to YES.

INCLUDED_BY_GRAPH      = YES

# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
# dependency graph for every global function or class method.
#
# Note that enabling this option will significantly increase the time of a run.
# So in most cases it will be better to enable call graphs for selected
# functions only using the \callgraph command. Disabling a call graph can be
# accomplished by means of the command \hidecallgraph.
# The default value is: NO.
# This tag requires that the tag HAVE_DOT is set to YES.

CALL_GRAPH             = NO

# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
# dependency graph for every global function or class method.
#
# Note that enabling this option will significantly increase the time of a run.
# So in most cases it will be better to enable caller graphs for selected
# functions only using the \callergraph command. Disabling a caller graph can be
# accomplished by means of the command \hidecallergraph.
# The default value is: NO.
# This tag requires that the tag HAVE_DOT is set to YES.

CALLER_GRAPH           = NO

# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
# hierarchy of all classes instead of a textual one.
# The default value is: YES.
# This tag requires that the tag HAVE_DOT is set to YES.

GRAPHICAL_HIERARCHY    = YES

# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
# dependencies a directory has on other directories in a graphical way. The
# dependency relations are determined by the #include relations between the
# files in the directories.
# The default value is: YES.
# This tag requires that the tag HAVE_DOT is set to YES.

DIRECTORY_GRAPH        = YES

# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
# generated by dot. For an explanation of the image formats see the section
# output formats in the documentation of the dot tool (Graphviz (see:
# http://www.graphviz.org/)).
# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
# to make the SVG files visible in IE 9+ (other browsers do not have this
# requirement).
# Possible values are: png, jpg, gif, svg, png:gd, png:gd:gd, png:cairo,
# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
# png:gdiplus:gdiplus.
# The default value is: png.
# This tag requires that the tag HAVE_DOT is set to YES.

DOT_IMAGE_FORMAT       = png

# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
# enable generation of interactive SVG images that allow zooming and panning.
#
# Note that this requires a modern browser other than Internet Explorer. Tested
# and working are Firefox, Chrome, Safari, and Opera.
# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
# the SVG files visible. Older versions of IE do not have SVG support.
# The default value is: NO.
# This tag requires that the tag HAVE_DOT is set to YES.

INTERACTIVE_SVG        = NO

# The DOT_PATH tag can be used to specify the path where the dot tool can be
# found. If left blank, it is assumed the dot tool can be found in the path.
# This tag requires that the tag HAVE_DOT is set to YES.

DOT_PATH               =

# The DOTFILE_DIRS tag can be used to specify one or more directories that
# contain dot files that are included in the documentation (see the \dotfile
# command).
# This tag requires that the tag HAVE_DOT is set to YES.

DOTFILE_DIRS           =

# The MSCFILE_DIRS tag can be used to specify one or more directories that
# contain msc files that are included in the documentation (see the \mscfile
# command).

MSCFILE_DIRS           =

# The DIAFILE_DIRS tag can be used to specify one or more directories that
# contain dia files that are included in the documentation (see the \diafile
# command).

DIAFILE_DIRS           =

# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
# path where java can find the plantuml.jar file. If left blank, it is assumed
# PlantUML is not used or called during a preprocessing step. Doxygen will
# generate a warning when it encounters a \startuml command in this case and
# will not generate output for the diagram.

PLANTUML_JAR_PATH      =

# When using plantuml, the PLANTUML_CFG_FILE tag can be used to specify a
# configuration file for plantuml.

PLANTUML_CFG_FILE      =

# When using plantuml, the specified paths are searched for files specified by
# the !include statement in a plantuml block.

PLANTUML_INCLUDE_PATH  =

# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
# that will be shown in the graph. If the number of nodes in a graph becomes
# larger than this value, doxygen will truncate the graph, which is visualized
# by representing a node as a red box. Note that doxygen if the number of direct
# children of the root node in a graph is already larger than
# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
# Minimum value: 0, maximum value: 10000, default value: 50.
# This tag requires that the tag HAVE_DOT is set to YES.

DOT_GRAPH_MAX_NODES    = 50

# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
# generated by dot. A depth value of 3 means that only nodes reachable from the
# root by following a path via at most 3 edges will be shown. Nodes that lay
# further from the root node will be omitted. Note that setting this option to 1
# or 2 may greatly reduce the computation time needed for large code bases. Also
# note that the size of a graph can be further restricted by
# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
# Minimum value: 0, maximum value: 1000, default value: 0.
# This tag requires that the tag HAVE_DOT is set to YES.

MAX_DOT_GRAPH_DEPTH    = 0

# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
# background. This is disabled by default, because dot on Windows does not seem
# to support this out of the box.
#
# Warning: Depending on the platform used, enabling this option may lead to
# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
# read).
# The default value is: NO.
# This tag requires that the tag HAVE_DOT is set to YES.

DOT_TRANSPARENT        = NO

# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
# files in one run (i.e. multiple -o and -T options on the command line). This
# makes dot run faster, but since only newer versions of dot (>1.8.10) support
# this, this feature is disabled by default.
# The default value is: NO.
# This tag requires that the tag HAVE_DOT is set to YES.

DOT_MULTI_TARGETS      = NO

# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
# explaining the meaning of the various boxes and arrows in the dot generated
# graphs.
# The default value is: YES.
# This tag requires that the tag HAVE_DOT is set to YES.

GENERATE_LEGEND        = YES

# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
# files that are used to generate the various graphs.
# The default value is: YES.
# This tag requires that the tag HAVE_DOT is set to YES.

DOT_CLEANUP            = YES


================================================
FILE: LICENSE.md
================================================
MIT License

Copyright (c) 2025 Marc Dirven

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.


================================================
FILE: README.md
================================================
[![Build status](https://github.com/Kaaserne/cpp-lazy/workflows/Continuous%20Integration/badge.svg)](https://github.com/Kaaserne/cpp-lazy/actions)
[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
[![CodeQL](https://github.com/Kaaserne/cpp-lazy/actions/workflows/codeql.yml/badge.svg)](https://github.com/Kaaserne/cpp-lazy/actions/workflows/codeql.yml)

![](https://i.ibb.co/ccn2V8N/Screenshot-2021-05-05-Make-A-High-Quality-Logo-In-Just-5-Minutes-For-Under-30-v1-cropped.png)

Examples can be found [here](https://github.com/Kaaserne/cpp-lazy/tree/master/examples). Installation can be found [here](https://github.com/Kaaserne/cpp-lazy#installation).

# cpp-lazy
`cpp-lazy` is an easy and fast lazy evaluation library for C++11/14/17/20. The library tries to reduce redundant data usage for begin/end iterator pairs. For instance: `lz::random_iterable::end()` will return a `lz::default_sentinel_t` to prevent duplicate data that is also present in `lz::random_iterable::begin()`. If a 'symmetrical' end-begin iterator pair is needed, one can use `lz::common` or `lz::common_random`. Generally, `lz` *forward* iterators will return a `lz::default_sentinel_t` (or if the input iterable is sentinelled) because forward iterators can only go forward, so there is no need to store the end iterator, is the philosophy. Lz random access iterators can also return a `default_sentinel` if the internal data of `begin` can already decide whether end is reached, such as `lz::repeat`.

The library uses one optional dependency: the library `{fmt}`, more of which can be found out in the [installation section](https://github.com/Kaaserne/cpp-lazy#Installation). This dependency is only used for printing and formatting.

# Features
- C++11/14/17/20 compatible
- C++20's module compatible
- `pkgconfig` compatible
- Easy printing/formatting using `lz::format`, `fmt::print` or `std::cout`
- One optional dependency ([`{fmt}`](https://github.com/fmtlib/fmt)), can be turned off by using option `CPP_LAZY_USE_STANDALONE=TRUE`/`set(CPP_LAZY_USE_STANDALONE TRUE)` in CMake
- STL compatible (if the input iterable is not sentinelled, otherwise use `lz::*` equivalents)
- Little overhead, as little data usage as possible
- Any compiler with at least C++11 support should be suitable
- [Easy installation](https://github.com/Kaaserne/cpp-lazy#installation)
- [Clear Examples](https://github.com/Kaaserne/cpp-lazy/tree/master/examples)
- Piping/chaining using `|` operator
- [Tested with very strict GCC/Clang/MSVC flags](https://github.com/Kaaserne/cpp-lazy/blob/11a1fd957cba49c57b9bbca7e69f53bd7210e323/tests/CMakeLists.txt#L87)
- Bidirectional sentinelled iterables can be reversed using `lz::common`

# What is lazy?
Lazy evaluation is an evaluation strategy which holds the evaluation of an expression until its value is needed. In this library, this is the case for all iterables/iteartors. It holds all the elements that are needed for the operation:
```cpp
std::vector<int> vec = {1, 2, 3, 4, 5};

// No evaluation is done here, function is stored and a reference to vec
auto mapped = lz::map(vec, [](int i) { return i * 2; });
for (auto i : mapped) { // Evaluation is done here
  std::cout << i << " "; // prints "2 4 6 8 10 "
}
```


# Basic usage
```cpp
#include <Lz/map.hpp>
#include <vector>

int main() {
  std::array<int, 4> arr = {1, 2, 3, 4};
  auto result = lz::map(arr, [](int i) { return i + 1; }) 
                       | lz::to<std::vector>(); // == {2, 3, 4, 5}
  // or
  auto result = arr | lz::map([](int i) { return i + 1; })
                    | lz::to<std::vector>(); // == {2, 3, 4, 5}

  // Some iterables will return sentinels, for instance:
  // (specific rules about when sentinels are returned can be found in the documentation):
  std::vector<int> vec = {1, 2, 3, 4};
  auto forward = lz::c_string("Hello World"); // .end() returns default_sentinel_t

  // inf_loop = {1, 2, 3, 4, 1, 2, 3, 4, ...}
  auto inf_loop = lz::loop(vec); // .end() returns default_sentinel_t

  // random = {random number between 0 and 32, total of 4 numbers}
  auto random = lz::random(0, 32, 4); // .end() returns default_sentinel_t
}
```

## Philosophy behind cpp-lazy
Cpp-lazy is implemented in such a way, that it tries to reduce redundant data usage as much as possible. For instance, if an iterable can determine whether the end is reached by only using the begin iterator ánd is less than a bidirectional iterator, it will return a sentinel instead of storing the end iterator as well. Or, if the iterable is already sentinelled, it will return the same sentinel type as the input iterable.

This is the case for `lz::take(std::forward_list<>{})` for instance, but not for `lz::take(std::list<>{})` or `lz::take(std::vector<>{})`. This is done to reduce memory usage. If you need a symmetrical `begin`/`end` iterator pair, you can use `lz::common`. Use `lz::common` as late as possible in your chain, because every `lz` iterable has the potential to return sentinels instead of storing the `end` iterator. 

```cpp
a | lz::map(...) | lz::filter(...) | lz::common; // OK
a | lz::common | lz::map(...) | lz::filter(...); // Not recommended, map or filter could have returned sentinels
```

`lz::common` tries to make the `begin`/`end` iterator pair symmetrical. Only as last resort it will use `common_iterator<I, S>` which is basically a fancy `[std::]variant` internally. It depends on the following conditions whether `lz::common` will use `common_iterator`:
- If `begin` and `end` are already the same type, the same instance will be returned;
- If the iterable passed is random access, `begin + (size_t)distance(begin, end)` will be used to create the `end` iterator;
- If `begin` is assignable from `end`, assign `end` to `begin` to create the `end` iterator. It will keep its `.size()` if applicable;
- Otherwise, `common_iterator<I, S>` will be used. As will be the case for all `std::` sentinelled iterables, but not for `lz` sentinelled iterables.

## Ownership
`lz` iterables will hold a reference to the input iterable if the input iterable is *not* inherited from `lz::lazy_view`. This means that the `lz` iterables will hold a reference to (but not excluded to) containers such as `std::vector`, `std::array` and `std::string`, as they do not inherit from `lz::lazy_view`. This is done by the class `lz::maybe_owned`. This can be altered using `lz::copied` or `lz::as_copied`. This will copy the input iterable instead of holding a reference to it. This is useful for cheap to copy iterables that are not inherited from `lz::lazy_view` (for example `boost::iterator_range`).

```cpp
struct non_lz_iterable {
  int* _begin{};
  int* _end{};

  non_lz_iterable(int* begin, int* end) : _begin{ begin }, _end{ end } {
  }

  int* begin() {
    return _begin;
  }
  int* end() {
    return _end;
  }
};

int main() {
  std::vector<int> vec = {1, 2, 3, 4};
  // mapped will hold a reference to vec
  auto mapped = lz::map(vec, [](int i) { return i + 1; });
  // filtered does NOT hold a reference to mapped, but mapped still holds a reference to vec
  auto filtered = lz::filter(mapped, [](int i) { return i % 2 == 0; });

  auto random = lz::random(0, 32, 4);
  // str will *not* hold a reference to random, because random is a lazy iterable and is trivial to copy
  auto str = lz::map(random, [](int i) { return std::to_string(i); });

  lz::maybe_owned<std::vector<int>> ref{ vec }; // Holds a reference to vec
  lz::maybe_owned<std::vector<int>>::holds_reference; // true

  using random_iterable = decltype(random);
  lz::maybe_owned<random_iterable> ref2{ random }; // Does NOT hold a reference to random
  lz::maybe_owned<random_iterable>::holds_reference; // false

  non_lz_iterable non_lz(vec.data(), vec.data() + vec.size());
  lz::maybe_owned<non_lz_iterable> ref{ non_lz }; // Holds a reference of non_lz! Watch out for this!
  lz::maybe_owned<non_lz_iterable>::holds_reference; // true

  // Instead, if you don't want this behaviour, you can use `lz::copied`:
  lz::copied<non_lz_iterable> copied{ non_lz }; // Holds a copy of non_lz = cheap to copy
  lz::copied<non_lz_iterable>::holds_reference; // false
  // Or use the helper function:
  copied = lz::as_copied(non_lz); // Holds a copy of non_lz = cheap to copy
}
```

## Iterating
Iterating over iterables with sentinels using range-based for loops is possible. However, a workaround for C++ versions < 17 is needed.

```cpp
#include <Lz/c_string.hpp>
#include <Lz/algorithm/algorithm.hpp>

int main() {
  auto iterable_with_sentinel = lz::c_string("Hello World");
  // Possible in C++17 and higher
  for (auto i : iterable_with_sentinel) {
    std::cout << i; // prints "Hello World"
  }

  // Possible in C++11 - 14
  lz::for_each(iterable_with_sentinel, [](char i) { std::cout << i; }); // prints "Hello World"
}
```

## Formatting
Formatting is done using `{fmt}` or `<format>`. If neither is available, it will use `std::cout`/`std::ostringstream`:

```cpp
#include <Lz/stream.hpp>
#include <Lz/filter.hpp>
#include <vector>

int main() {
  std::vector<int> vec = {1, 2, 3, 4};
  auto filtered = vec | lz::filter([](int i) { return i % 2 == 0; }); // == {2, 4}

  // To a stream
  std::cout << filtered; // prints "2 4" (only works for lz iterables)
  lz::format(filtered, std::cout, ", ", "{:02d}"); // prints "02, 04" (only with {fmt} installed or C++20's <format>)
  lz::format(filtered, std::cout, ", "); // prints "2, 4"
  fmt::print("{}", fmt::join(filtered, ", ")); // prints "2, 4" (only with {fmt} installed)

  filtered | lz::format(std::cout, ", "); // prints "2, 4"
  filtered | lz::format; // prints "2, 4"
  filtered | lz::format(std::cout, ", ", "{:02d}"); // prints "02, 04" (only with {fmt} installed or C++20's <format>)
}
```

# Installation
## Options
The following CMake options are available, all of which are optional:
- `CPP_LAZY_USE_STANDALONE`: Use the standalone version of cpp-lazy. This will not use the library `{fmt}`. Default is `FALSE`
- `CPP_LAZY_LZ_USE_MODULES`: Use C++20 modules. Default is `FALSE`
- `CPP_LAZY_DEBUG_ASSERTIONS`: Enable debug assertions. Default is `TRUE` for debug mode, `FALSE` for release.
- `CPP_LAZY_USE_INSTALLED_FMT`: Use the system installed version of `{fmt}`. This will not use the bundled version. Default is `FALSE` and uses `find_package`. Use `CPP_LAZY_FMT_DEP_VERSION` to specify the version of `{fmt}` to use if needed.
- `CPP_LAZY_INSTALL`: Install cpp-lazy targets and config files. Default is `FALSE`.
- `CPP_LAZY_FMT_DEP_VERSION`: version of `{fmt}` to use. Used if `CPP_LAZY_USE_INSTALLED_FMT` is `TRUE` or `CPP_LAZY_USE_STANDALONE` is `FALSE`. May be empty.

### Using `FetchContent`
The following way is recommended (cpp-lazy version >= 5.0.1). Note that you choose the cpp-lazy-src.zip, and not the source-code.zip/source-code.tar.gz. This prevents you from downloading stuff that you don't need, and thus preventing pollution of the cmake build directory:
```cmake

# Uncomment this line to use the cpp-lazy standalone version or use -D CPP_LAZY_USE_STANDALONE=TRUE
# set(CPP_LAZY_USE_STANDALONE TRUE)

include(FetchContent)
FetchContent_Declare(cpp-lazy
        URL https://github.com/Kaaserne/cpp-lazy/releases/download/<TAG_HERE E.G. v9.0.0>/cpp-lazy-src.zip
        # Below is optional
        # URL_MD5 <MD5 HASH OF cpp-lazy-src.zip>
        # If using CMake >= 3.24, preferably set <bool> to TRUE
        # DOWNLOAD_EXTRACT_TIMESTAMP <bool>
)
# Optional settings:
# set(CPP_LAZY_USE_STANDALONE NO CACHE BOOL "") # Use {fmt}
# set(CPP_LAZY_USE_INSTALLED_FMT NO CACHE BOOL "") # Use bundled {fmt}, NO means use bundled, YES means use system installed {fmt}
# set(CPP_LAZY_USE_MODULES NO CACHE BOOL "") # Do not use C++20 modules
# set(CPP_LAZY_DEBUG_ASSERTIONS NO CACHE BOOL "") # Disable debug assertions in release mode
# set(CPP_LAZY_FMT_DEP_VERSION "" CACHE STRING "") # Specify version of {fmt} to use if needed
FetchContent_MakeAvailable(cpp-lazy)

add_executable(${PROJECT_NAME} main.cpp)
target_link_libraries(${PROJECT_NAME} cpp-lazy::cpp-lazy)
```

An alternative ('less' recommended), add to your `CMakeLists.txt` the following:
```cmake
include(FetchContent)
FetchContent_Declare(cpp-lazy
        GIT_REPOSITORY https://github.com/Kaaserne/cpp-lazy
        GIT_TAG ... # Commit hash
        # If using CMake >= 3.24, preferably set <bool> to TRUE
        # DOWNLOAD_EXTRACT_TIMESTAMP <bool>
)
# Optional settings:
# set(CPP_LAZY_USE_STANDALONE NO CACHE BOOL "") # Use {fmt}
# set(CPP_LAZY_USE_INSTALLED_FMT NO CACHE BOOL "") # Use bundled {fmt}, NO means use bundled, YES means use system installed {fmt}
# set(CPP_LAZY_USE_MODULES NO CACHE BOOL "") # Do not use C++20 modules
# set(CPP_LAZY_DEBUG_ASSERTIONS NO CACHE BOOL "") # Disable debug assertions in release mode
# set(CPP_LAZY_FMT_DEP_VERSION "" CACHE STRING "") # Specify version of {fmt} to use. Only relevant if CPP_LAZY_USE_INSTALLED_FMT is YES
FetchContent_MakeAvailable(cpp-lazy)

add_executable(${PROJECT_NAME} main.cpp)
target_link_libraries(${PROJECT_NAME} cpp-lazy::cpp-lazy)
```

## Using find_package
First, install the library. Then:
```cmake
find_package(cpp-lazy 9.0.0 REQUIRED CONFIG)
```

## Without CMake
### Without `{fmt}`
- Download the source code from the releases page
- Specify the include directory to `cpp-lazy/include`.
- Include files as follows:

```cpp
// Important, preprocessor macro 'LZ_STANDALONE' has to be defined already
// or
// #define LZ_STANDALONE
#include <Lz/map.hpp>
#include <vector>

int main() {
  std::array<int, 4> arr = {1, 2, 3, 4};
  auto result = lz::map(arr, [](int i) { return i + 1; }) | lz::to<std::vector>(); // == {2, 3, 4, 5}
  // or
  auto result = lz::to<std::vector>(arr | lz::map([](int i) { return i + 1; })); // == {2, 3, 4, 5}
}
```

### With `{fmt}`
- Clone the repository
- Specify the include directory to `cpp-lazy/include` and `fmt/include`.
- Define `FMT_HEADER_ONLY` before including any `lz` files.
- Include files as follows:

```cpp
#define FMT_HEADER_ONLY

#include <Lz/map.hpp>
#include <vector>

int main() {
  std::array<int, 4> arr = {1, 2, 3, 4};
  auto result = lz::map(arr, [](int i) { return i + 1; }) | lz::to<std::vector>(); // == {2, 3, 4, 5}
  // or
  auto result = lz::to<std::vector>(arr | lz::map([](int i) { return i + 1; })); // == {2, 3, 4, 5}
}
```

### Using `git clone`
Clone the repository using `git clone https://github.com/Kaaserne/cpp-lazy/` and add to `CMakeLists.txt` the following:
```cmake
add_subdirectory(cpp-lazy)
add_executable(${PROJECT_NAME} main.cpp)

target_link_libraries(${PROJECT_NAME} cpp-lazy::cpp-lazy)
```

# Benchmarks
The time is equal to one iteration. One iteration excludes the creation of the iterable and includes one iteration of that iterable. Compiled with: gcc version 13.3.0.

<div style="text-align:center"><img src="https://github.com/Kaaserne/cpp-lazy/blob/master/bench/benchmarks-iterators-23.png?raw=true" />
</div>






================================================
FILE: all/CMakeLists.txt
================================================
cmake_minimum_required(VERSION 3.12)

project(build_all LANGUAGES CXX)

add_subdirectory("${CMAKE_CURRENT_LIST_DIR}/../bench" "${CMAKE_BINARY_DIR}/bench")
add_subdirectory("${CMAKE_CURRENT_LIST_DIR}/../tests" "${CMAKE_BINARY_DIR}/tests")
add_subdirectory("${CMAKE_CURRENT_LIST_DIR}/../examples" "${CMAKE_BINARY_DIR}/examples")


================================================
FILE: bench/.gitignore
================================================
venv/
build*/

================================================
FILE: bench/CMakeLists.txt
================================================
cmake_minimum_required(VERSION 3.10...3.12.4)

project(Benchmark)

add_executable(Benchmark
        ${CMAKE_CURRENT_SOURCE_DIR}/benchmarks-iterators.cpp)

# Add cpp-lazy
include(FetchContent)
FetchContent_Declare(cpp-lazy SOURCE_DIR "${CMAKE_CURRENT_LIST_DIR}/..")
FetchContent_MakeAvailable(cpp-lazy)

# Enable Google Benchmark to add dependencies for their tests
set(BENCHMARK_DOWNLOAD_DEPENDENCIES TRUE)
FetchContent_Declare(benchmark
    URL https://github.com/google/benchmark/archive/refs/tags/v1.9.1.tar.gz
    UPDATE_DISCONNECTED YES
    DOWNLOAD_EXTRACT_TIMESTAMP TRUE
)
FetchContent_MakeAvailable(benchmark)

target_link_libraries(Benchmark
    PRIVATE
        cpp-lazy::cpp-lazy
        benchmark::benchmark
)

math(EXPR CXX_STANDARD_INT "${CMAKE_CXX_STANDARD}")
target_compile_definitions(Benchmark PRIVATE CMAKE_CXX_STANDARD=${CXX_STANDARD_INT})

# Run as: ./Benchmark --benchmark_out=benchmark-iterators.json --benchmark_out_format=json


================================================
FILE: bench/bar_chart_maker.py
================================================
import matplotlib.pyplot as plt
from matplotlib.backends.backend_agg import FigureCanvasAgg as FigureCanvas
from matplotlib.figure import Figure
import numpy as np
import shutil
import time
import os
import sys
import json
from collections import namedtuple
import asyncio
from typing import Iterable


os.system("")
plt.rcdefaults()
filename = 'benchmarks-iterators-{}.png'

class BenchmarkResult:
    def __init__(self, real_time: str, time_unit: str):
        self.library_name = ''
        self.real_time = real_time
        self.time_unit = time_unit
    
    def __repr__(self):
        return f'BenchmarkResult(name={self.library_name}, real_time={self.real_time}, time_unit={self.time_unit})'


class Table:
    def __init__(self):
        self._rows: dict[str, list[BenchmarkResult]] = {}
        self._implementation_names: list[str] = []

    def update_row(self, name: str, result: BenchmarkResult):
        last_underscore = name.rfind('_')
        prefix, postfix = name[:last_underscore], name[last_underscore + 1:]
        result.library_name = postfix
        if not prefix in self._rows:
            self._rows[prefix] = []
        self._rows[prefix].append(result)
    
    @property
    def implementation_names(self):
        return self._implementation_names
    
    @property
    def rows(self) -> Iterable[tuple[str, list[BenchmarkResult]]]:
        return self._rows.items()
    
    def create(self):
        largest_key = max(enumerate(self._rows.values()), key=lambda x: len(x[1]))
        self._implementation_names = list(map(lambda x: x.library_name, largest_key[1]))

        for benchmark_results in self._rows.values():
            for implementation in self._implementation_names:
                if implementation in map(lambda br: br.library_name, benchmark_results):
                    continue
                benchmark_result = BenchmarkResult('-', '-')
                benchmark_result.library_name = implementation
                benchmark_results.append(benchmark_result)

    def __repr__(self):
        return f'rows={self.rows}'


def get_benchmarks(bench_dict: dict) -> Table:
    table = Table()

    for benchmark in bench_dict['benchmarks']:
        name = benchmark['name']
        table.update_row(name, BenchmarkResult(benchmark['real_time'], benchmark['time_unit']))

    table.create()
    return table


def make_table(benchmark_records: Table, cxx_version: str, n_iterations: int):
    fig_border = 'steelblue'
    
    data = []
    row_headers = []
    for it_name, impls in benchmark_records.rows:
        data.append(list(map(lambda r: f'{round(r.real_time / n_iterations, 4)} {r.time_unit} / {round(r.real_time, 4)} {r.time_unit}'
                             if isinstance(r.real_time, float) else r.real_time, impls)))
        row_headers.append(it_name)

    fig = Figure(linewidth=2, edgecolor=fig_border)
    canvas = FigureCanvas(fig)
    ax = fig.add_subplot(111)
    ax.axis('off')

    fig = Figure(linewidth=2, edgecolor=fig_border)
    canvas = FigureCanvas(fig)
    ax = fig.add_subplot(111)
    ax.axis('off')

    row_colors = plt.get_cmap('BuPu')(np.full(len(row_headers), 0.1))
    col_colors = plt.get_cmap('BuPu')(np.full(len(data), 0.1))

    the_table = ax.table(cellText=data,
                        rowLabels=row_headers,
                        rowColours=row_colors,
                        colColours=col_colors,
                        cellLoc='center',
                        colLabels=list(map(lambda n: f'{n} (1 iteration / {n_iterations} iterations)', benchmark_records.implementation_names)),
                        loc='center')
    the_table.scale(1.5, 1.5)

    fig.text(.90, 0.05, '', horizontalalignment='center', size=8, weight='light')

    canvas.print_figure(f'benchmarks-iterators-{cxx_version}.png', bbox_inches='tight', dpi=150)

def make_chart(cxx_version: str, path: str):
    print(f'Creating chart for "CXX{cxx_version}" from "{path}/benchmark-iterators.json"')

    assert os.path.exists(path), f'Path "{path}" does not exist'

    with open(os.path.join(path, 'benchmark-iterators.json'), 'r') as benchmarks_file:
        bench_json = json.load(benchmarks_file)
        bench_records = get_benchmarks(bench_json)

        iterations = 32
        make_table(bench_records, cxx_version, iterations)

    green = '\033[32m'
    print(f'{green}Successfully created {filename.format(cxx_version)}')


async def main():
    cxx_version = None
    try:
        cxx_version = sys.argv[1]
    except IndexError:
        print('No CXX version provided, using CMakeCache.txt.')
        with open(os.path.join(os.path.dirname(os.path.abspath(__file__)), 'build', 'CMakeCache.txt'), 'r') as cmake_cache:
            for line in cmake_cache:
                if not line.startswith('CMAKE_CXX_STANDARD:'):
                    continue
                cxx_version = line.split('=')[1].strip()
                break
        if cxx_version is None:
            print('No CXX version provided and CMakeCache.txt does not contain CMAKE_CXX_STANDARD.')
            sys.exit(1)
        print('Found CXX version in CMakeCache.txt:', cxx_version)

    make_chart(cxx_version, os.path.join(os.path.dirname(os.path.abspath(__file__)), 'build'))
    


if __name__ == '__main__':
    asyncio.run(main())


================================================
FILE: bench/benchmarks-iterators.cpp
================================================
#include <Lz/any_iterable.hpp>
#include <Lz/as_iterator.hpp>
#include <Lz/c_string.hpp>
#include <Lz/cached_size.hpp>
#include <Lz/cartesian_product.hpp>
#include <Lz/chunk_if.hpp>
#include <Lz/chunks.hpp>
#include <Lz/common.hpp>
#include <Lz/concatenate.hpp>
#include <Lz/detail/iterator.hpp>
#include <Lz/drop.hpp>
#include <Lz/drop_while.hpp>
#include <Lz/duplicates.hpp>
#include <Lz/enumerate.hpp>
#include <Lz/except.hpp>
#include <Lz/exclude.hpp>
#include <Lz/exclusive_scan.hpp>
#include <Lz/filter.hpp>
#include <Lz/flatten.hpp>
#include <Lz/generate.hpp>
#include <Lz/generate_while.hpp>
#include <Lz/group_by.hpp>
#include <Lz/inclusive_scan.hpp>
#include <Lz/interleave.hpp>
#include <Lz/intersection.hpp>
#include <Lz/iter_tools.hpp>
#include <Lz/join_where.hpp>
#include <Lz/loop.hpp>
#include <Lz/map.hpp>
#include <Lz/pairwise.hpp>
#include <Lz/random.hpp>
#include <Lz/range.hpp>
#include <Lz/regex_split.hpp>
#include <Lz/repeat.hpp>
#include <Lz/reverse.hpp>
#include <Lz/rotate.hpp>
#include <Lz/slice.hpp>
#include <Lz/split.hpp>
#include <Lz/stream.hpp>
#include <Lz/take.hpp>
#include <Lz/take_every.hpp>
#include <Lz/take_while.hpp>
#include <Lz/unique.hpp>
#include <Lz/util/optional.hpp>
#include <Lz/util/string_view.hpp>
#include <Lz/zip.hpp>
#include <Lz/zip_longest.hpp>
#include <array>
#include <benchmark/benchmark.h>

#if LZ_HAS_INCLUDE(<ranges>)

#include <ranges>

#endif

namespace {
constexpr std::size_t size_policy = 32;

void any_iterable_lz(benchmark::State& state) {
    auto arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (int i : lz::make_any_iterable(arr)) {
            benchmark::DoNotOptimize(i);
        }
    }
}

void c_string_lz(benchmark::State& state) {
    constexpr const char* str = "this is a 32 char long stringggg";

    for (auto _ : state) {
#ifdef LZ_HAS_CXX_17
        for (char c : lz::c_string(str)) {
            benchmark::DoNotOptimize(c);
        }
#else
        auto c_str = lz::c_string(str);
        lz::for_each(c_str, [](char c) { benchmark::DoNotOptimize(c); });
#endif
    }
}

void cached_reverse_lz(benchmark::State& state) {
    auto arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (int c : lz::cached_reverse(arr)) {
            benchmark::DoNotOptimize(c);
        }
    }
}

void cartesian_product_lz(benchmark::State& state) {
    std::array<int, size_policy / 8> a;
    std::array<char, size_policy / 4> b;

    for (auto _ : state) {
        for (auto&& tup : lz::cartesian_product(a, b)) {
            benchmark::DoNotOptimize(tup);
        }
    }
}

void chunk_if_lz(benchmark::State& state) {
    auto a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    constexpr static auto half = static_cast<int>(size_policy / 2);

    for (auto _ : state) {
#ifdef LZ_HAS_CXX_17
        for (auto&& x : lz::chunk_if(a, [](int i) noexcept { return i == half; })) {
            for (int y : x) {
                benchmark::DoNotOptimize(y);
            }
        }
#else
        auto chunk_if = lz::chunk_if(a, [](int i) noexcept { return i == half; });
        using ref = lz::detail::ref_iterable_t<decltype(chunk_if)>;
        lz::for_each(chunk_if, [](ref chunk) {
            for (int x : chunk) {
                benchmark::DoNotOptimize(x);
            }
        });
#endif
    }
}

#if defined(__cpp_lib_ranges_chunk_by) && LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 23

void chunk_if_std(benchmark::State& state) {
    auto a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    constexpr static auto half = static_cast<int>(size_policy / 2);

    auto eq = [](int, int cur) {
        return half != cur;
    };

    for (auto _ : state) {
        for (auto&& x : std::ranges::views::chunk_by(a, eq)) {
            for (int y : x) {
                benchmark::DoNotOptimize(y);
            }
        }
    }
}

#endif

void chunks_lz(benchmark::State& state) {
    auto a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    for (auto _ : state) {
        for (auto&& chunk : lz::chunks(a, 8)) {
            for (int x : chunk) {
                benchmark::DoNotOptimize(x);
            }
        }
    }
}

#if defined(__cpp_lib_ranges_chunk) && LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 23

void chunks_std(benchmark::State& state) {
    auto a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    for (auto _ : state) {
        for (auto&& chunk : std::ranges::views::chunk(a, 8)) {
            for (int x : chunk) {
                benchmark::DoNotOptimize(x);
            }
        }
    }
}

#endif

void common_lz(benchmark::State& state) {
    auto a = lz::generate([]() noexcept { return 0; }, size_policy);

    for (auto _ : state) {
        for (int i : lz::common(a)) {
            benchmark::DoNotOptimize(i);
        }
    }
}

void concatenate_lz(benchmark::State& state) {
    std::string a(size_policy / 2, '0');
    std::string b(size_policy / 2, '1');

    for (auto _ : state) {
        for (char c : lz::concat(a, b)) {
            benchmark::DoNotOptimize(c);
        }
    }
}

void duplicates_lz(benchmark::State& state) {
    auto arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (std::pair<char, std::size_t> c : lz::duplicates(arr)) {
            benchmark::DoNotOptimize(c);
        }
    }
}

void enumerate_lz(benchmark::State& state) {
    auto arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (auto pair : lz::enumerate(arr)) {
            benchmark::DoNotOptimize(pair);
        }
    }
}

void except_lz(benchmark::State& state) {
    auto large_arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto large_arr_except = lz::range(static_cast<int>(size_policy) / 2) | lz::to<std::array<int, size_policy / 2>>();

    for (auto _ : state) {
#ifdef LZ_HAS_CXX_17
        for (auto excepted : lz::except(large_arr, large_arr_except)) {
            benchmark::DoNotOptimize(excepted);
        }
#else
        auto except = lz::except(large_arr, large_arr_except);
        lz::for_each(except, [](int i) { benchmark::DoNotOptimize(i); });
#endif
    }
}

void exclude_lz(benchmark::State& state) {
    auto a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
#ifdef LZ_HAS_CXX_17
        for (int i : lz::exclude(a, 5, 10)) {
            benchmark::DoNotOptimize(i);
        }
#else
        auto exclude = lz::exclude(a, 5, 10);
        lz::for_each(exclude, [](int i) { benchmark::DoNotOptimize(i); });
#endif
    }
}

void exclusive_scan_lz(benchmark::State& state) {
    auto array = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
#ifdef LZ_HAS_CXX_17
        for (int i : lz::exclusive_scan(array, 0)) {
            benchmark::DoNotOptimize(i);
        }
#else
        auto scan = lz::exclusive_scan(array, 0);
        lz::for_each(scan, [](int i) { benchmark::DoNotOptimize(i); });
#endif
    }
}

void filter_lz(benchmark::State& state) {
    auto arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (int filtered : lz::filter(arr, [](const int i) noexcept { return i == 0; })) {
            benchmark::DoNotOptimize(filtered);
        }
    }
}

void flatten_lz(benchmark::State& state) {
    std::array<std::array<int, size_policy / 4>, size_policy / 8> arr =
        lz::generate([]() { return lz::range(static_cast<int>(size_policy / 4)) | lz::to<std::array<int, size_policy / 4>>(); },
                     size_policy / 8) |
        lz::to<std::array<std::array<int, size_policy / 4>, size_policy / 8>>();

    for (auto _ : state) {
        for (int val : lz::flatten(arr)) {
            benchmark::DoNotOptimize(val);
        }
    }
}

void generate_while_lz(benchmark::State& state) {
    for (auto _ : state) {
        std::size_t cnt = 0;
#ifdef LZ_HAS_CXX_17
        for (auto i : lz::generate_while([&cnt]() -> std::pair<bool, std::size_t> {
                 const auto old_value = cnt++;
                 return { cnt, old_value < size_policy };
             })) {
            benchmark::DoNotOptimize(i);
        }
#else
        auto gen = lz::generate_while([&cnt]() -> std::pair<bool, std::size_t> {
            const auto old_value = cnt++;
            return { cnt, old_value < size_policy };
        });
        lz::for_each(gen, [](std::size_t i) { benchmark::DoNotOptimize(i); });
#endif
    }
}

void generate_lz(benchmark::State& state) {
    size_t cnt = 0;

    for (auto _ : state) {
#ifdef LZ_HAS_CXX_17
        for (auto i : lz::generate([&cnt]() noexcept { return cnt++; }, size_policy)) {
            benchmark::DoNotOptimize(i);
        }
#else
        auto gen = lz::generate([&cnt]() noexcept { return cnt++; }, size_policy);
        lz::for_each(gen, [](int i) { benchmark::DoNotOptimize(i); });
#endif
    }
}

void groupy_by_lz(benchmark::State& state) {
    auto arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
#ifdef LZ_HAS_CXX_17
        for (auto&& group : lz::group_by(arr, [](int a, int b) noexcept { return a == b; })) {
            benchmark::DoNotOptimize(group.first);
            for (auto&& pair : group.second) {
                benchmark::DoNotOptimize(pair);
            }
        }
#else
        auto group_by = lz::group_by(arr, [](int a, int b) noexcept { return a == b; });
        using ref = lz::detail::ref_iterable_t<decltype(group_by)>;
        lz::for_each(group_by, [](ref group) {
            benchmark::DoNotOptimize(group.first);
            lz::for_each(group.second, [](int i) { benchmark::DoNotOptimize(i); });
        });
#endif
    }
}

void inclusive_scan_lz(benchmark::State& state) {
    auto array = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
#ifdef LZ_HAS_CXX_17
        for (auto i : lz::exclusive_scan(array)) {
            benchmark::DoNotOptimize(i);
        }
#else
        auto scan = lz::inclusive_scan(array);
        lz::for_each(scan, [](int i) { benchmark::DoNotOptimize(i); });
#endif
    }
}

void interleave_lz(benchmark::State& state) {
    std::array<int, size_policy / 2> arr_a =
        lz::range(static_cast<int>(size_policy) / 2) | lz::to<std::array<int, size_policy / 2>>();
    std::array<int, size_policy / 2> arr_b =
        lz::range(static_cast<int>(size_policy) / 2) | lz::to<std::array<int, size_policy / 2>>();

    for (auto _ : state) {
        for (auto i : lz::interleave(arr_a, arr_b)) {
            benchmark::DoNotOptimize(i);
        }
    }
}

void intersection_lz(benchmark::State& state) {
    auto arr_a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_b = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
#ifdef LZ_HAS_CXX_17

        for (auto val : lz::intersection(arr_a, arr_b)) {
            benchmark::DoNotOptimize(val);
        }

#else
        auto intersection = lz::intersection(arr_a, arr_b);
        using ref = lz::detail::ref_iterable_t<decltype(intersection)>;
        lz::for_each(intersection, [](ref val) { benchmark::DoNotOptimize(val); });

#endif
    }
}

void join_where_lz(benchmark::State& state) {
    std::vector<int> arr = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
    std::vector<int> to_join = { 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32 };

    auto random_index = lz::random(static_cast<std::size_t>(0), to_join.size() - 1, size_policy / 2);
    to_join[*random_index.begin()] = arr[*random_index.begin()]; // Create a value where both values are equal
    std::sort(to_join.begin(), to_join.end());

    for (auto _ : state) {
#ifdef LZ_HAS_CXX_17

        for (std::tuple<int, int> val : lz::join_where(
                 arr, to_join, [](int i) noexcept { return i; }, [](int i) noexcept { return i; },
                 [](int a, int b) noexcept { return std::make_tuple(a, b); })) {
            benchmark::DoNotOptimize(val);
        }

#else
        auto join_where = lz::join_where(
            arr, to_join, [](int i) noexcept { return i; }, [](int i) noexcept { return i; },
            [](int a, int b) noexcept { return std::make_tuple(a, b); });
        lz::for_each(join_where, [](std::tuple<int, int> val) { benchmark::DoNotOptimize(val); });

#endif
    }
}

void loop_lz(benchmark::State& state) {
    std::array<int, size_policy / 2> arr =
        lz::range(static_cast<int>(size_policy) / 2) | lz::to<std::array<int, size_policy / 2>>();

    for (auto _ : state) {
        for (int i : lz::loop(arr, 2)) {
            benchmark::DoNotOptimize(i);
        }
    }
}

void map_lz(benchmark::State& state) {
    auto arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (int mapped : lz::map(arr, [](const int i) noexcept { return i == 0 ? 10 : 5; })) {
            benchmark::DoNotOptimize(mapped);
        }
    }
}

void pairwise_lz(benchmark::State& state) {
    auto arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (auto pair : lz::pairwise(arr, 3)) {
            benchmark::DoNotOptimize(pair);
        }
    }
}

void random_lz(benchmark::State& state) {
    for (auto _ : state) {
#ifdef LZ_HAS_CXX_17
        for (int i : lz::random(0u, 32u, size_policy)) {
            benchmark::DoNotOptimize(i);
        }
#else
        auto random = lz::random(0u, 32u, size_policy);
        lz::for_each(random, [](int i) { benchmark::DoNotOptimize(i); });
#endif
    }
}

void common_random_lz(benchmark::State& state) {
    for (auto _ : state) {
#ifdef LZ_HAS_CXX_17
        for (int i : lz::common_random(0u, 32u, size_policy)) {
            benchmark::DoNotOptimize(i);
        }
#else
        auto random = lz::common_random(0u, 32u, size_policy);
        lz::for_each(random, [](int i) { benchmark::DoNotOptimize(i); });
#endif
    }
}

void range_lz(benchmark::State& state) {
    for (auto _ : state) {
        for (int i : lz::range(static_cast<int>(size_policy))) {
            benchmark::DoNotOptimize(i);
        }
    }
}

void std_regex_split_lz(benchmark::State& state) {
    std::string to_split = "hello hello hello hello hello he";
    std::regex r(" ");

    for (auto _ : state) {
#ifdef LZ_HAS_CXX_17
        for (lz::string_view substring : lz::regex_split(to_split, r)) {
            benchmark::DoNotOptimize(substring);
        }
#else
        auto split = lz::regex_split(to_split, r);
        lz::for_each(split, [](lz::string_view substring) { benchmark::DoNotOptimize(substring); });
#endif
    }
}

void repeat_lz(benchmark::State& state) {
    for (auto _ : state) {
#ifdef LZ_HAS_CXX_17
        for (int r : lz::repeat(0, size_policy)) {
            benchmark::DoNotOptimize(r);
        }
#else
        auto repeat = lz::repeat(0, size_policy);
        lz::for_each(repeat, [](int i) { benchmark::DoNotOptimize(i); });
#endif
    }
}

void rotate_lz(benchmark::State& state) {
    auto arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (int i : lz::rotate(arr, 5)) {
            benchmark::DoNotOptimize(i);
        }
    }
}

void slice_lz(benchmark::State& state) {
    auto arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (int i : lz::slice(arr, 0, size_policy)) {
            benchmark::DoNotOptimize(i);
        }
    }
}

void split_multiple_lz(benchmark::State& state) {
    std::string to_split = "hello hello hello hello hello he";

    for (auto _ : state) {
        using ref = lz::detail::ref_iterable_t<decltype(lz::split(to_split, "o "))>;
#ifdef LZ_HAS_CXX_17
        for (ref substring : lz::split(to_split, "o ")) {
            benchmark::DoNotOptimize(substring);
        }
#else
        auto split = lz::split(to_split, "o ");
        lz::for_each(split, [](ref substring) { benchmark::DoNotOptimize(substring); });
#endif
    }
}

void split_single_lz(benchmark::State& state) {
    std::string to_split = "hello hello hello hello hello he";

    for (auto _ : state) {
        using ref = lz::detail::ref_iterable_t<decltype(lz::split(to_split, ' '))>;
#ifdef LZ_HAS_CXX_17
        for (ref substring : lz::split(to_split, ' ')) {
            benchmark::DoNotOptimize(substring);
        }
#else
        auto split = lz::split(to_split, ' ');
        lz::for_each(split, [](ref substring) { benchmark::DoNotOptimize(substring); });
#endif
    }
}

void take_every_lz(benchmark::State& state) {
    constexpr size_t offset = 2;
    std::array<int, size_policy * offset> array;

    for (auto _ : state) {
        for (int taken : lz::take_every(array, offset)) {
            benchmark::DoNotOptimize(taken);
        }
    }
}

#if defined(__cpp_lib_ranges_stride) && LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 23

void take_every_std(benchmark::State& state) {
    constexpr size_t offset = 2;
    std::array<int, size_policy * offset> array;

    for (auto _ : state) {
        for (int taken : std::views::stride(array, offset)) {
            benchmark::DoNotOptimize(taken);
        }
    }
}

#endif

void take_while_lz(benchmark::State& state) {
    auto array = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (int taken : lz::take_while(array, [](const int i) noexcept { return i != size_policy - 1; })) {
            benchmark::DoNotOptimize(taken);
        }
    }
}

void take_iterable_lz(benchmark::State& state) {
    auto array = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (int taken : lz::take(array, size_policy)) {
            benchmark::DoNotOptimize(taken);
        }
    }
}

void take_iterator_lz(benchmark::State& state) {
    auto array = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (int taken : lz::take(array.begin(), size_policy)) {
            benchmark::DoNotOptimize(taken);
        }
    }
}

void unique_lz(benchmark::State& state) {
    auto arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (char c : lz::unique(arr)) {
            benchmark::DoNotOptimize(c);
        }
    }
}

void zip4_lz(benchmark::State& state) {
    auto arr_a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_b = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_c = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_d = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (auto tuple : lz::zip(arr_a, arr_b, arr_c, arr_d)) {
            benchmark::DoNotOptimize(tuple);
        }
    }
}

void zip3_lz(benchmark::State& state) {
    auto arr_a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_b = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_c = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (auto tuple : lz::zip(arr_a, arr_b, arr_c)) {
            benchmark::DoNotOptimize(tuple);
        }
    }
}

void zip2_lz(benchmark::State& state) {
    auto arr_a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_b = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (auto tuple : lz::zip(arr_a, arr_b)) {
            benchmark::DoNotOptimize(tuple);
        }
    }
}

void zip_longest4_lz(benchmark::State& state) {
    auto arr_a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_b = lz::range(static_cast<int>(size_policy) - 1) | lz::to<std::array<int, size_policy - 1>>();
    auto arr_c = lz::range(static_cast<int>(size_policy) - 2) | lz::to<std::array<int, size_policy - 2>>();
    auto arr_d = lz::range(static_cast<int>(size_policy) - 3) | lz::to<std::array<int, size_policy - 3>>();

    for (auto _ : state) {
        for (auto tuple : lz::zip_longest(arr_a, arr_b, arr_c, arr_d)) {
            benchmark::DoNotOptimize(tuple);
        }
    }
}

void zip_longest3_lz(benchmark::State& state) {
    auto arr_a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_b = lz::range(static_cast<int>(size_policy) - 1) | lz::to<std::array<int, size_policy - 1>>();
    auto arr_c = lz::range(static_cast<int>(size_policy) - 2) | lz::to<std::array<int, size_policy - 2>>();

    for (auto _ : state) {
        for (auto tuple : lz::zip_longest(arr_a, arr_b, arr_c)) {
            benchmark::DoNotOptimize(tuple);
        }
    }
}

void zip_longest2_lz(benchmark::State& state) {
    auto arr_a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_b = lz::range(static_cast<int>(size_policy) - 1) | lz::to<std::array<int, size_policy - 1>>();

    for (auto _ : state) {
        for (auto tuple : lz::zip_longest(arr_a, arr_b)) {
            benchmark::DoNotOptimize(tuple);
        }
    }
}

#if LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 20

void common_std(benchmark::State& state) {
    auto a = lz::generate([]() noexcept { return 0; }, size_policy);

    for (auto _ : state) {
        for (int i : std::views::common(a)) {
            benchmark::DoNotOptimize(i);
        }
    }
}

void filter_std(benchmark::State& state) {
    auto arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (int filtered : std::views::filter(arr, [](const int i) noexcept { return i == 0; })) {
            benchmark::DoNotOptimize(filtered);
        }
    }
}

void flatten_std(benchmark::State& state) {
    std::array<std::array<int, size_policy / 4>, size_policy / 8> arr =
        lz::generate([]() { return lz::range(static_cast<int>(size_policy / 4)) | lz::to<std::array<int, size_policy / 4>>(); },
                     size_policy / 8) |
        lz::to<std::array<std::array<int, size_policy / 4>, size_policy / 8>>();

    for (auto _ : state) {
        for (int val : std::views::join(arr)) {
            benchmark::DoNotOptimize(val);
        }
    }
}

void map_std(benchmark::State& state) {
    auto arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (int mapped : std::views::transform(arr, [](const int i) noexcept { return i == 0 ? 10 : 5; })) {
            benchmark::DoNotOptimize(mapped);
        }
    }
}

void split_single_std(benchmark::State& state) {
    std::string to_split = "hello hello hello hello hello he";

    for (auto _ : state) {
        for (auto substring : std::views::lazy_split(to_split, ' ')) {
            benchmark::DoNotOptimize(substring);
        }
    }
}

void split_multiple_std(benchmark::State& state) {
    std::string to_split = "hello hello hello hello hello he";

    for (auto _ : state) {
        for (auto substring : std::views::lazy_split(to_split, "o ")) {
            benchmark::DoNotOptimize(substring);
        }
    }
}

#if defined(__cpp_lib_ranges_cartesian_product) && LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 20

void cartesian_product_std(benchmark::State& state) {
    std::array<int, size_policy / 8> a;
    std::array<char, size_policy / 4> b;

    for (auto _ : state) {
        for (auto&& tup : std::views::cartesian_product(a, b)) {
            benchmark::DoNotOptimize(tup);
        }
    }
}

#endif

#if defined(__cpp_lib_ranges_slide) && LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 20

void pairwise_std(benchmark::State& state) {
    auto arr = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (auto pair : std::views::slide(arr, 3)) {
            benchmark::DoNotOptimize(pair);
        }
    }
}

#endif

#if defined(__cpp_lib_ranges_repeat) && LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 20

void repeat_std(benchmark::State& state) {
    for (auto _ : state) {
        for (int r : std::views::repeat(0, size_policy)) {
            benchmark::DoNotOptimize(r);
        }
    }
}

#endif

void take_iterable_std(benchmark::State& state) {
    auto array = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (int taken : std::views::take(array, size_policy)) {
            benchmark::DoNotOptimize(taken);
        }
    }
}

void take_iterator_std(benchmark::State& state) {
    auto array = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (int taken : std::views::counted(array.begin(), size_policy)) {
            benchmark::DoNotOptimize(taken);
        }
    }
}

#if defined(__cpp_lib_ranges_zip) && CMAKE_CXX_STANDARD >= 20

void zip4_std(benchmark::State& state) {
    auto arr_a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_b = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_c = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_d = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (auto tuple : std::views::zip(arr_a, arr_b, arr_c, arr_d)) {
            benchmark::DoNotOptimize(tuple);
        }
    }
}

void zip3_std(benchmark::State& state) {
    auto arr_a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_b = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_c = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (auto tuple : std::views::zip(arr_a, arr_b, arr_c)) {
            benchmark::DoNotOptimize(tuple);
        }
    }
}

void zip2_std(benchmark::State& state) {
    auto arr_a = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();
    auto arr_b = lz::range(static_cast<int>(size_policy)) | lz::to<std::array<int, size_policy>>();

    for (auto _ : state) {
        for (auto tuple : std::views::zip(arr_a, arr_b)) {
            benchmark::DoNotOptimize(tuple);
        }
    }
}

#endif

#endif

} // namespace

BENCHMARK(any_iterable_lz);
BENCHMARK(c_string_lz);
BENCHMARK(cached_reverse_lz);
BENCHMARK(cartesian_product_lz);
BENCHMARK(chunk_if_lz);
BENCHMARK(chunks_lz);
BENCHMARK(common_lz);
BENCHMARK(concatenate_lz);
BENCHMARK(duplicates_lz);
BENCHMARK(enumerate_lz);
BENCHMARK(except_lz);
BENCHMARK(exclude_lz);
BENCHMARK(exclusive_scan_lz);
BENCHMARK(filter_lz);
BENCHMARK(flatten_lz);
BENCHMARK(generate_while_lz);
BENCHMARK(generate_lz);
BENCHMARK(groupy_by_lz);
BENCHMARK(inclusive_scan_lz);
BENCHMARK(interleave_lz);
BENCHMARK(intersection_lz);
BENCHMARK(join_where_lz);
BENCHMARK(loop_lz);
BENCHMARK(map_lz);
BENCHMARK(pairwise_lz);
BENCHMARK(random_lz);
BENCHMARK(common_random_lz);
BENCHMARK(range_lz);
BENCHMARK(std_regex_split_lz);
BENCHMARK(repeat_lz);
BENCHMARK(rotate_lz);
BENCHMARK(slice_lz);
BENCHMARK(split_multiple_lz);
BENCHMARK(split_single_lz);
BENCHMARK(take_every_lz);
BENCHMARK(take_while_lz);
BENCHMARK(take_iterable_lz);
BENCHMARK(take_iterator_lz);
BENCHMARK(unique_lz);
BENCHMARK(zip_longest4_lz);
BENCHMARK(zip_longest3_lz);
BENCHMARK(zip_longest2_lz);
BENCHMARK(zip4_lz);
BENCHMARK(zip3_lz);
BENCHMARK(zip2_lz);

#if defined(__cpp_lib_ranges_cartesian_product) && LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 23

BENCHMARK(cartesian_product_std);

#endif

#if defined(__cpp_lib_ranges_chunk) && LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 23

BENCHMARK(chunks_std);

#endif

#if defined(__cpp_lib_ranges_chunk_by) && LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 23

BENCHMARK(chunk_if_std);

#endif

#if LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 20

BENCHMARK(common_std);
BENCHMARK(filter_std);
BENCHMARK(flatten_std);
BENCHMARK(take_iterable_std);
BENCHMARK(take_iterator_std);
BENCHMARK(map_std);
BENCHMARK(split_single_std);
BENCHMARK(split_multiple_std);

#endif

#if defined(__cpp_lib_ranges_stride) && LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 23

BENCHMARK(take_every_std);

#endif

#if defined(__cpp_lib_ranges_slide) && LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 23

BENCHMARK(pairwise_std);

#endif

#if defined(__cpp_lib_ranges_repeat) && LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 23

BENCHMARK(repeat_std);

#endif

#if defined(__cpp_lib_ranges_zip) && LZ_HAS_INCLUDE(<ranges>) && CMAKE_CXX_STANDARD >= 23

BENCHMARK(zip4_std);
BENCHMARK(zip3_std);
BENCHMARK(zip2_std);

#endif

BENCHMARK_MAIN();


================================================
FILE: bench/lz/CMakeLists.txt
================================================
cmake_minimum_required(VERSION 3.10...3.12.4)

project(CompeTimeBenchmark)

include(FetchContent)

FetchContent_Declare(cpp-lazy
    SOURCE_DIR "${CMAKE_CURRENT_LIST_DIR}/../../"
)
set(CPP_LAZY_USE_STANDALONE ON CACHE BOOL "" FORCE)
FetchContent_MakeAvailable(cpp-lazy)

add_executable(CompileTimeBenchmarks compile-times.cpp)
target_compile_options(CompileTimeBenchmarks
    PRIVATE
        $<$<CXX_COMPILER_ID:GNU>:-ftime-report>
        $<$<CXX_COMPILER_ID:Clang>:-ftime-report -ftime-trace>
)
target_link_libraries(CompileTimeBenchmarks PRIVATE cpp-lazy::cpp-lazy)
target_compile_features(CompileTimeBenchmarks PRIVATE cxx_std_23)


================================================
FILE: be
Download .txt
gitextract_mzintsjp/

├── .clang-format
├── .github/
│   └── workflows/
│       ├── ci.yml
│       ├── clang.yml
│       ├── codeql.yml
│       ├── examples.yml
│       ├── gcc.yml
│       ├── make-release.yml
│       ├── module-tests.yml
│       └── msvc.yml
├── .gitignore
├── CMakeLists.txt
├── Doxyfile
├── LICENSE.md
├── README.md
├── all/
│   └── CMakeLists.txt
├── bench/
│   ├── .gitignore
│   ├── CMakeLists.txt
│   ├── bar_chart_maker.py
│   ├── benchmarks-iterators.cpp
│   ├── lz/
│   │   ├── CMakeLists.txt
│   │   └── compile-times.cpp
│   ├── requirements.txt
│   └── std/
│       ├── CMakeLists.txt
│       └── compile-times.cpp
├── cmake/
│   ├── cpp-lazy.pc.in
│   └── cpp-lazyConfig.cmake.in
├── docs/
│   └── .gitkeep
├── examples/
│   ├── CMakeLists.txt
│   ├── algorithm.cpp
│   ├── any_iterable.cpp
│   ├── as_iterator.cpp
│   ├── basic_iterable.cpp
│   ├── c_string.cpp
│   ├── cached_reverse.cpp
│   ├── cached_size.cpp
│   ├── cartesian_product.cpp
│   ├── chunk_if.cpp
│   ├── chunks.cpp
│   ├── common.cpp
│   ├── concatenate.cpp
│   ├── drop.cpp
│   ├── drop_while.cpp
│   ├── duplicates.cpp
│   ├── enumerate.cpp
│   ├── except.cpp
│   ├── exclude.cpp
│   ├── exclusive_scan.cpp
│   ├── filter.cpp
│   ├── flatten.cpp
│   ├── generate.cpp
│   ├── generate_while.cpp
│   ├── group_by.cpp
│   ├── inclusive_scan.cpp
│   ├── interleave.cpp
│   ├── intersection.cpp
│   ├── iter_tools.cpp
│   ├── join_where.cpp
│   ├── loop.cpp
│   ├── map.cpp
│   ├── maybe_owned.cpp
│   ├── pairwise.cpp
│   ├── pipe.cpp
│   ├── print_and_format.cpp
│   ├── random.cpp
│   ├── range.cpp
│   ├── regex_split.cpp
│   ├── repeat.cpp
│   ├── rotate.cpp
│   ├── slice.cpp
│   ├── split.cpp
│   ├── take.cpp
│   ├── take_every.cpp
│   ├── take_while.cpp
│   ├── to_container.cpp
│   ├── unique.cpp
│   ├── zip.cpp
│   └── zip_longest.cpp
├── include/
│   └── Lz/
│       ├── algorithm/
│       │   ├── accumulate.hpp
│       │   ├── adjacent_find.hpp
│       │   ├── algorithm.hpp
│       │   ├── all_of.hpp
│       │   ├── any_of.hpp
│       │   ├── back.hpp
│       │   ├── back_or.hpp
│       │   ├── binary_search.hpp
│       │   ├── contains.hpp
│       │   ├── copy.hpp
│       │   ├── count.hpp
│       │   ├── count_if.hpp
│       │   ├── empty.hpp
│       │   ├── ends_with.hpp
│       │   ├── equal.hpp
│       │   ├── find.hpp
│       │   ├── find_if.hpp
│       │   ├── find_if_not.hpp
│       │   ├── find_last.hpp
│       │   ├── find_last_if.hpp
│       │   ├── find_last_if_not.hpp
│       │   ├── find_last_or_default.hpp
│       │   ├── find_last_or_default_if.hpp
│       │   ├── find_last_or_default_if_not.hpp
│       │   ├── find_last_or_default_not.hpp
│       │   ├── find_or_default.hpp
│       │   ├── find_or_default_if.hpp
│       │   ├── for_each.hpp
│       │   ├── for_each_while.hpp
│       │   ├── for_each_while_n.hpp
│       │   ├── front.hpp
│       │   ├── front_or.hpp
│       │   ├── has_many.hpp
│       │   ├── has_one.hpp
│       │   ├── index_of.hpp
│       │   ├── index_of_if.hpp
│       │   ├── is_sorted.hpp
│       │   ├── lower_bound.hpp
│       │   ├── max_element.hpp
│       │   ├── mean.hpp
│       │   ├── min_element.hpp
│       │   ├── none_of.hpp
│       │   ├── npos.hpp
│       │   ├── nth.hpp
│       │   ├── partition.hpp
│       │   ├── peek.hpp
│       │   ├── search.hpp
│       │   ├── starts_with.hpp
│       │   ├── transform.hpp
│       │   └── upper_bound.hpp
│       ├── any_iterable.hpp
│       ├── as_iterator.hpp
│       ├── basic_iterable.hpp
│       ├── c_string.hpp
│       ├── cached_size.hpp
│       ├── cartesian_product.hpp
│       ├── chunk_if.hpp
│       ├── chunks.hpp
│       ├── common.hpp
│       ├── concatenate.hpp
│       ├── detail/
│       │   ├── adaptors/
│       │   │   ├── as_iterator.hpp
│       │   │   ├── c_string.hpp
│       │   │   ├── cached_size.hpp
│       │   │   ├── cartesian_product.hpp
│       │   │   ├── chunk_if.hpp
│       │   │   ├── chunks.hpp
│       │   │   ├── common.hpp
│       │   │   ├── concatenate.hpp
│       │   │   ├── drop.hpp
│       │   │   ├── drop_while.hpp
│       │   │   ├── duplicates.hpp
│       │   │   ├── enumerate.hpp
│       │   │   ├── except.hpp
│       │   │   ├── exclude.hpp
│       │   │   ├── exclusive_scan.hpp
│       │   │   ├── filter.hpp
│       │   │   ├── flatten.hpp
│       │   │   ├── fn_args_holder.hpp
│       │   │   ├── generate.hpp
│       │   │   ├── generate_while.hpp
│       │   │   ├── group_by.hpp
│       │   │   ├── inclusive_scan.hpp
│       │   │   ├── interleave.hpp
│       │   │   ├── intersection.hpp
│       │   │   ├── iter_tools.hpp
│       │   │   ├── join_where.hpp
│       │   │   ├── loop.hpp
│       │   │   ├── map.hpp
│       │   │   ├── pairwise.hpp
│       │   │   ├── random.hpp
│       │   │   ├── range.hpp
│       │   │   ├── regex_split.hpp
│       │   │   ├── repeat.hpp
│       │   │   ├── reverse.hpp
│       │   │   ├── rotate.hpp
│       │   │   ├── slice.hpp
│       │   │   ├── split.hpp
│       │   │   ├── take.hpp
│       │   │   ├── take_every.hpp
│       │   │   ├── take_while.hpp
│       │   │   ├── unique.hpp
│       │   │   ├── zip.hpp
│       │   │   └── zip_longest.hpp
│       │   ├── algorithm/
│       │   │   ├── accumulate.hpp
│       │   │   ├── adjacent_find.hpp
│       │   │   ├── back.hpp
│       │   │   ├── copy.hpp
│       │   │   ├── count.hpp
│       │   │   ├── count_if.hpp
│       │   │   ├── ends_with.hpp
│       │   │   ├── equal.hpp
│       │   │   ├── find_if.hpp
│       │   │   ├── find_last_if.hpp
│       │   │   ├── for_each.hpp
│       │   │   ├── for_each_while.hpp
│       │   │   ├── for_each_while_n.hpp
│       │   │   ├── index_of_if.hpp
│       │   │   ├── is_sorted.hpp
│       │   │   ├── lower_bound.hpp
│       │   │   ├── max_element.hpp
│       │   │   ├── mean.hpp
│       │   │   ├── partition.hpp
│       │   │   ├── peek.hpp
│       │   │   ├── search.hpp
│       │   │   ├── starts_with.hpp
│       │   │   └── transform.hpp
│       │   ├── compiler_config.hpp
│       │   ├── fake_ptr_proxy.hpp
│       │   ├── func_container.hpp
│       │   ├── iterables/
│       │   │   ├── as_iterator.hpp
│       │   │   ├── c_string.hpp
│       │   │   ├── cached_size.hpp
│       │   │   ├── cartesian_product.hpp
│       │   │   ├── chunk_if.hpp
│       │   │   ├── chunks.hpp
│       │   │   ├── common.hpp
│       │   │   ├── concatenate.hpp
│       │   │   ├── drop.hpp
│       │   │   ├── drop_while.hpp
│       │   │   ├── duplicates.hpp
│       │   │   ├── enumerate.hpp
│       │   │   ├── except.hpp
│       │   │   ├── exclude.hpp
│       │   │   ├── exclusive_scan.hpp
│       │   │   ├── filter.hpp
│       │   │   ├── flatten.hpp
│       │   │   ├── generate.hpp
│       │   │   ├── generate_while.hpp
│       │   │   ├── group_by.hpp
│       │   │   ├── inclusive_scan.hpp
│       │   │   ├── interleave.hpp
│       │   │   ├── intersection.hpp
│       │   │   ├── join_where.hpp
│       │   │   ├── loop.hpp
│       │   │   ├── map.hpp
│       │   │   ├── pairwise.hpp
│       │   │   ├── random.hpp
│       │   │   ├── range.hpp
│       │   │   ├── regex_split.hpp
│       │   │   ├── repeat.hpp
│       │   │   ├── reverse.hpp
│       │   │   ├── rotate.hpp
│       │   │   ├── split.hpp
│       │   │   ├── take.hpp
│       │   │   ├── take_every.hpp
│       │   │   ├── take_while.hpp
│       │   │   ├── unique.hpp
│       │   │   ├── zip.hpp
│       │   │   └── zip_longest.hpp
│       │   ├── iterator.hpp
│       │   ├── iterators/
│       │   │   ├── any_iterable/
│       │   │   │   ├── any_iterator_impl.hpp
│       │   │   │   └── iterator_base.hpp
│       │   │   ├── as_iterator.hpp
│       │   │   ├── c_string.hpp
│       │   │   ├── cached_reverse.hpp
│       │   │   ├── cartesian_product.hpp
│       │   │   ├── chunk_if.hpp
│       │   │   ├── chunks.hpp
│       │   │   ├── common.hpp
│       │   │   ├── concatenate.hpp
│       │   │   ├── duplicates.hpp
│       │   │   ├── enumerate.hpp
│       │   │   ├── except.hpp
│       │   │   ├── exclude.hpp
│       │   │   ├── exclusive_scan.hpp
│       │   │   ├── filter.hpp
│       │   │   ├── flatten.hpp
│       │   │   ├── generate.hpp
│       │   │   ├── generate_while.hpp
│       │   │   ├── group_by.hpp
│       │   │   ├── inclusive_scan.hpp
│       │   │   ├── interleave.hpp
│       │   │   ├── intersection.hpp
│       │   │   ├── iterator_wrapper.hpp
│       │   │   ├── join_where.hpp
│       │   │   ├── loop.hpp
│       │   │   ├── map.hpp
│       │   │   ├── pairwise.hpp
│       │   │   ├── random.hpp
│       │   │   ├── range.hpp
│       │   │   ├── regex_split.hpp
│       │   │   ├── repeat.hpp
│       │   │   ├── rotate.hpp
│       │   │   ├── split.hpp
│       │   │   ├── take.hpp
│       │   │   ├── take_every.hpp
│       │   │   ├── take_while.hpp
│       │   │   ├── unique.hpp
│       │   │   ├── zip.hpp
│       │   │   └── zip_longest.hpp
│       │   ├── maybe_owned.hpp
│       │   ├── procs/
│       │   │   ├── addressof.hpp
│       │   │   ├── assert.hpp
│       │   │   ├── begin_end.hpp
│       │   │   ├── decompose.hpp
│       │   │   ├── distance.hpp
│       │   │   ├── get_end.hpp
│       │   │   ├── min_max.hpp
│       │   │   ├── next_fast.hpp
│       │   │   ├── operators.hpp
│       │   │   ├── sentinel_operators.hpp
│       │   │   └── tuple_expand.hpp
│       │   ├── traits/
│       │   │   ├── conditional.hpp
│       │   │   ├── conjunction.hpp
│       │   │   ├── enable_if.hpp
│       │   │   ├── first_arg.hpp
│       │   │   ├── func_ret_type.hpp
│       │   │   ├── index_sequence.hpp
│       │   │   ├── is_adaptor.hpp
│       │   │   ├── is_invocable.hpp
│       │   │   ├── is_iterable.hpp
│       │   │   ├── is_reference_wrapper.hpp
│       │   │   ├── is_sentinel.hpp
│       │   │   ├── is_sized.hpp
│       │   │   ├── iterator_categories.hpp
│       │   │   ├── remove_ref.hpp
│       │   │   ├── std_algo_compat.hpp
│       │   │   ├── strict_iterator_traits.hpp
│       │   │   └── void.hpp
│       │   ├── tuple_helpers.hpp
│       │   ├── unique_ptr.hpp
│       │   └── variant.hpp
│       ├── drop.hpp
│       ├── drop_while.hpp
│       ├── duplicates.hpp
│       ├── enumerate.hpp
│       ├── except.hpp
│       ├── exclude.hpp
│       ├── exclusive_scan.hpp
│       ├── filter.hpp
│       ├── flatten.hpp
│       ├── generate.hpp
│       ├── generate_while.hpp
│       ├── group_by.hpp
│       ├── inclusive_scan.hpp
│       ├── interleave.hpp
│       ├── intersection.hpp
│       ├── iter_tools.hpp
│       ├── join_where.hpp
│       ├── loop.hpp
│       ├── map.hpp
│       ├── pairwise.hpp
│       ├── procs/
│       │   ├── chain.hpp
│       │   ├── distance.hpp
│       │   ├── eager_size.hpp
│       │   ├── procs.hpp
│       │   ├── size.hpp
│       │   └── to.hpp
│       ├── random.hpp
│       ├── range.hpp
│       ├── regex_split.hpp
│       ├── repeat.hpp
│       ├── reverse.hpp
│       ├── rotate.hpp
│       ├── slice.hpp
│       ├── split.hpp
│       ├── stream.hpp
│       ├── take.hpp
│       ├── take_every.hpp
│       ├── take_while.hpp
│       ├── traits/
│       │   ├── concepts.hpp
│       │   ├── is_sized.hpp
│       │   ├── iter_type.hpp
│       │   ├── lazy_view.hpp
│       │   └── traits.hpp
│       ├── unique.hpp
│       ├── util/
│       │   ├── default_sentinel.hpp
│       │   ├── optional.hpp
│       │   ├── string_view.hpp
│       │   └── util.hpp
│       ├── zip.hpp
│       └── zip_longest.hpp
├── src/
│   └── lz.cppm
└── tests/
    ├── CMakeLists.txt
    ├── algorithm.cpp
    ├── any_iterable.cpp
    ├── as_iterator.cpp
    ├── c_string.cpp
    ├── cached_size.cpp
    ├── cartesian_product.cpp
    ├── chunk_if.cpp
    ├── chunks.cpp
    ├── common.cpp
    ├── concatenate.cpp
    ├── cpp-lazy-ut-helper/
    │   ├── CMakeLists.txt
    │   └── include/
    │       └── cpp-lazy-ut-helper/
    │           ├── pch.hpp
    │           ├── test_procs.hpp
    │           └── ut_helper.hpp
    ├── duplicates.cpp
    ├── enumerate.cpp
    ├── except.cpp
    ├── exclude.cpp
    ├── exclusive_scan.cpp
    ├── filter.cpp
    ├── flatten.cpp
    ├── generate.cpp
    ├── generate_while.cpp
    ├── group_by.cpp
    ├── inclusive_scan.cpp
    ├── init.cpp
    ├── interleave.cpp
    ├── intersection.cpp
    ├── iter_tools.cpp
    ├── iterator.cpp
    ├── join_where.cpp
    ├── loop.cpp
    ├── map.cpp
    ├── maybe_owned.cpp
    ├── module_tests/
    │   ├── CMakeLists.txt
    │   └── module_test.cpp
    ├── pairwise.cpp
    ├── piping.cpp
    ├── random.cpp
    ├── range.cpp
    ├── regex_split.cpp
    ├── repeat.cpp
    ├── reverse.cpp
    ├── rotate.cpp
    ├── split.cpp
    ├── standalone.cpp
    ├── string_view.cpp
    ├── take.cpp
    ├── take_every.cpp
    ├── take_while.cpp
    ├── unique.cpp
    ├── zip.cpp
    └── zip_longest.cpp
Download .txt
Showing preview only (251K chars total). Download the full file or copy to clipboard to get everything.
SYMBOL INDEX (2607 symbols across 354 files)

FILE: bench/bar_chart_maker.py
  class BenchmarkResult (line 19) | class BenchmarkResult:
    method __init__ (line 20) | def __init__(self, real_time: str, time_unit: str):
    method __repr__ (line 25) | def __repr__(self):
  class Table (line 29) | class Table:
    method __init__ (line 30) | def __init__(self):
    method update_row (line 34) | def update_row(self, name: str, result: BenchmarkResult):
    method implementation_names (line 43) | def implementation_names(self):
    method rows (line 47) | def rows(self) -> Iterable[tuple[str, list[BenchmarkResult]]]:
    method create (line 50) | def create(self):
    method __repr__ (line 62) | def __repr__(self):
  function get_benchmarks (line 66) | def get_benchmarks(bench_dict: dict) -> Table:
  function make_table (line 77) | def make_table(benchmark_records: Table, cxx_version: str, n_iterations:...
  function make_chart (line 113) | def make_chart(cxx_version: str, path: str):
  function main (line 129) | async def main():

FILE: bench/benchmarks-iterators.cpp
  function any_iterable_lz (line 60) | void any_iterable_lz(benchmark::State& state) {
  function c_string_lz (line 70) | void c_string_lz(benchmark::State& state) {
  function cached_reverse_lz (line 85) | void cached_reverse_lz(benchmark::State& state) {
  function cartesian_product_lz (line 95) | void cartesian_product_lz(benchmark::State& state) {
  function chunk_if_lz (line 106) | void chunk_if_lz(benchmark::State& state) {
  function chunk_if_std (line 131) | void chunk_if_std(benchmark::State& state) {
  function chunks_lz (line 150) | void chunks_lz(benchmark::State& state) {
  function chunks_std (line 163) | void chunks_std(benchmark::State& state) {
  function common_lz (line 176) | void common_lz(benchmark::State& state) {
  function concatenate_lz (line 186) | void concatenate_lz(benchmark::State& state) {
  function duplicates_lz (line 197) | void duplicates_lz(benchmark::State& state) {
  function enumerate_lz (line 207) | void enumerate_lz(benchmark::State& state) {
  function except_lz (line 217) | void except_lz(benchmark::State& state) {
  function exclude_lz (line 233) | void exclude_lz(benchmark::State& state) {
  function exclusive_scan_lz (line 248) | void exclusive_scan_lz(benchmark::State& state) {
  function filter_lz (line 263) | void filter_lz(benchmark::State& state) {
  function flatten_lz (line 273) | void flatten_lz(benchmark::State& state) {
  function generate_while_lz (line 286) | void generate_while_lz(benchmark::State& state) {
  function generate_lz (line 306) | void generate_lz(benchmark::State& state) {
  function groupy_by_lz (line 321) | void groupy_by_lz(benchmark::State& state) {
  function inclusive_scan_lz (line 343) | void inclusive_scan_lz(benchmark::State& state) {
  function interleave_lz (line 358) | void interleave_lz(benchmark::State& state) {
  function intersection_lz (line 371) | void intersection_lz(benchmark::State& state) {
  function join_where_lz (line 391) | void join_where_lz(benchmark::State& state) {
  function loop_lz (line 418) | void loop_lz(benchmark::State& state) {
  function map_lz (line 429) | void map_lz(benchmark::State& state) {
  function pairwise_lz (line 439) | void pairwise_lz(benchmark::State& state) {
  function random_lz (line 449) | void random_lz(benchmark::State& state) {
  function common_random_lz (line 462) | void common_random_lz(benchmark::State& state) {
  function range_lz (line 475) | void range_lz(benchmark::State& state) {
  function std_regex_split_lz (line 483) | void std_regex_split_lz(benchmark::State& state) {
  function repeat_lz (line 499) | void repeat_lz(benchmark::State& state) {
  function rotate_lz (line 512) | void rotate_lz(benchmark::State& state) {
  function slice_lz (line 522) | void slice_lz(benchmark::State& state) {
  function split_multiple_lz (line 532) | void split_multiple_lz(benchmark::State& state) {
  function split_single_lz (line 548) | void split_single_lz(benchmark::State& state) {
  function take_every_lz (line 564) | void take_every_lz(benchmark::State& state) {
  function take_every_std (line 577) | void take_every_std(benchmark::State& state) {
  function take_while_lz (line 590) | void take_while_lz(benchmark::State& state) {
  function take_iterable_lz (line 600) | void take_iterable_lz(benchmark::State& state) {
  function take_iterator_lz (line 610) | void take_iterator_lz(benchmark::State& state) {
  function unique_lz (line 620) | void unique_lz(benchmark::State& state) {
  function zip4_lz (line 630) | void zip4_lz(benchmark::State& state) {
  function zip3_lz (line 643) | void zip3_lz(benchmark::State& state) {
  function zip2_lz (line 655) | void zip2_lz(benchmark::State& state) {
  function zip_longest4_lz (line 666) | void zip_longest4_lz(benchmark::State& state) {
  function zip_longest3_lz (line 679) | void zip_longest3_lz(benchmark::State& state) {
  function zip_longest2_lz (line 691) | void zip_longest2_lz(benchmark::State& state) {
  function common_std (line 704) | void common_std(benchmark::State& state) {
  function filter_std (line 714) | void filter_std(benchmark::State& state) {
  function flatten_std (line 724) | void flatten_std(benchmark::State& state) {
  function map_std (line 737) | void map_std(benchmark::State& state) {
  function split_single_std (line 747) | void split_single_std(benchmark::State& state) {
  function split_multiple_std (line 757) | void split_multiple_std(benchmark::State& state) {
  function cartesian_product_std (line 769) | void cartesian_product_std(benchmark::State& state) {
  function pairwise_std (line 784) | void pairwise_std(benchmark::State& state) {
  function repeat_std (line 798) | void repeat_std(benchmark::State& state) {
  function take_iterable_std (line 808) | void take_iterable_std(benchmark::State& state) {
  function take_iterator_std (line 818) | void take_iterator_std(benchmark::State& state) {
  function zip4_std (line 830) | void zip4_std(benchmark::State& state) {
  function zip3_std (line 843) | void zip3_std(benchmark::State& state) {
  function zip2_std (line 855) | void zip2_std(benchmark::State& state) {

FILE: bench/lz/compile-times.cpp
  function main (line 5) | int main() {

FILE: bench/std/compile-times.cpp
  function main (line 4) | int main() {

FILE: examples/algorithm.cpp
  function main (line 6) | int main() {

FILE: examples/any_iterable.cpp
  function filter_map_copy_value (line 11) | lz::any_iterable<int, int> filter_map_copy_value(const std::vector<int>&...
  function filter_map_reference (line 18) | lz::any_iterable<int> filter_map_reference(std::vector<int>& vec) {
  function main (line 24) | int main() {

FILE: examples/as_iterator.cpp
  function main (line 5) | int main() {

FILE: examples/basic_iterable.cpp
  function main (line 6) | int main() {

FILE: examples/c_string.cpp
  function main (line 6) | int main() {

FILE: examples/cached_reverse.cpp
  function main (line 7) | int main() {

FILE: examples/cached_size.cpp
  function main (line 8) | int main() {

FILE: examples/cartesian_product.cpp
  function main (line 6) | int main() {

FILE: examples/chunk_if.cpp
  function main (line 7) | int main() {

FILE: examples/chunks.cpp
  function main (line 5) | int main() {

FILE: examples/common.cpp
  function main (line 6) | int main() {

FILE: examples/concatenate.cpp
  function main (line 7) | int main() {

FILE: examples/drop.cpp
  function main (line 5) | int main() {

FILE: examples/drop_while.cpp
  function main (line 6) | int main() {

FILE: examples/duplicates.cpp
  function main (line 4) | int main() {

FILE: examples/enumerate.cpp
  function main (line 6) | int main() {

FILE: examples/except.cpp
  function main (line 6) | int main() {

FILE: examples/exclude.cpp
  function main (line 6) | int main() {

FILE: examples/exclusive_scan.cpp
  function main (line 5) | int main() {

FILE: examples/filter.cpp
  function main (line 6) | int main() {

FILE: examples/flatten.cpp
  function main (line 5) | int main() {

FILE: examples/generate.cpp
  function main (line 5) | int main() {

FILE: examples/generate_while.cpp
  function main (line 5) | int main() {

FILE: examples/group_by.cpp
  function main (line 6) | int main() {

FILE: examples/inclusive_scan.cpp
  function main (line 5) | int main() {

FILE: examples/interleave.cpp
  function main (line 5) | int main() {

FILE: examples/intersection.cpp
  function main (line 5) | int main() {

FILE: examples/iter_tools.cpp
  function main (line 7) | int main() {

FILE: examples/join_where.cpp
  type customer (line 7) | struct customer {
  type payment_bill (line 11) | struct payment_bill {
  function main (line 16) | int main() {

FILE: examples/loop.cpp
  function main (line 6) | int main() {

FILE: examples/map.cpp
  type some_struct (line 6) | struct some_struct {
  function main (line 11) | int main() {

FILE: examples/maybe_owned.cpp
  type non_lz_iterable (line 5) | struct non_lz_iterable {
    method non_lz_iterable (line 9) | non_lz_iterable(const int* begin, const int* end) : _begin{ begin }, _...
  function main (line 20) | int main() {

FILE: examples/pairwise.cpp
  function main (line 5) | int main() {

FILE: examples/pipe.cpp
  function main (line 8) | int main() {

FILE: examples/print_and_format.cpp
  function main (line 6) | int main() {

FILE: examples/random.cpp
  function main (line 5) | int main() {

FILE: examples/range.cpp
  function main (line 5) | int main() {

FILE: examples/regex_split.cpp
  function main (line 6) | int main() {

FILE: examples/repeat.cpp
  function main (line 5) | int main() {

FILE: examples/rotate.cpp
  function main (line 5) | int main() {

FILE: examples/slice.cpp
  function main (line 5) | int main() {

FILE: examples/split.cpp
  function main (line 8) | int main() {

FILE: examples/take.cpp
  function main (line 6) | int main() {

FILE: examples/take_every.cpp
  function main (line 5) | int main() {

FILE: examples/take_while.cpp
  function main (line 5) | int main() {

FILE: examples/to_container.cpp
  class custom_container (line 20) | class custom_container {
    method reserve (line 24) | void reserve(std::size_t size) {
  type lz::custom_copier_for<custom_container<T>> (line 35) | struct lz::custom_copier_for<custom_container<T>> {
    method copy (line 37) | void copy(Iterable&& iterable, custom_container<T>& container) const {
  function main (line 44) | int main() {

FILE: examples/unique.cpp
  function main (line 6) | int main() {

FILE: examples/zip.cpp
  function main (line 6) | int main() {

FILE: examples/zip_longest.cpp
  function main (line 6) | int main() {

FILE: include/Lz/algorithm/accumulate.hpp
  function LZ_MODULE_EXPORT (line 18) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/adjacent_find.hpp
  function LZ_MODULE_EXPORT (line 16) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/all_of.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/any_of.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/back.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/back_or.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/binary_search.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/contains.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/copy.hpp
  function LZ_MODULE_EXPORT (line 13) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/count.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/count_if.hpp
  function LZ_MODULE_EXPORT (line 13) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/empty.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/ends_with.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/equal.hpp
  function LZ_MODULE_EXPORT (line 14) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/find.hpp
  function LZ_MODULE_EXPORT (line 10) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/find_if.hpp
  function LZ_MODULE_EXPORT (line 17) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/find_if_not.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/find_last.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/find_last_if.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/find_last_if_not.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/find_last_or_default.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/find_last_or_default_if.hpp
  type lz (line 8) | namespace lz {
    function LZ_CONSTEXPR_CXX_14 (line 20) | LZ_CONSTEXPR_CXX_14 detail::val_iterable_t<Iterable>

FILE: include/Lz/algorithm/find_last_or_default_if_not.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/find_last_or_default_not.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/find_or_default.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/find_or_default_if.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/for_each.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/for_each_while.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/for_each_while_n.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/front.hpp
  function LZ_MODULE_EXPORT (line 12) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/front_or.hpp
  function LZ_MODULE_EXPORT (line 10) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/has_many.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/has_one.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/index_of.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/index_of_if.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/is_sorted.hpp
  function LZ_MODULE_EXPORT (line 10) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/lower_bound.hpp
  function LZ_MODULE_EXPORT (line 12) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/max_element.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/mean.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/min_element.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/none_of.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/npos.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/nth.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/partition.hpp
  function LZ_MODULE_EXPORT (line 12) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/peek.hpp
  function LZ_MODULE_EXPORT (line 7) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/search.hpp
  function LZ_MODULE_EXPORT (line 11) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/starts_with.hpp
  function LZ_MODULE_EXPORT (line 11) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/transform.hpp
  function LZ_MODULE_EXPORT (line 13) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/algorithm/upper_bound.hpp
  function LZ_MODULE_EXPORT (line 8) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/any_iterable.hpp
  function LZ_MODULE_EXPORT (line 13) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/as_iterator.hpp
  type lz (line 9) | namespace lz {

FILE: include/Lz/basic_iterable.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      class basic_iterable_impl (line 17) | class basic_iterable_impl : public lazy_view {
        method basic_iterable_impl (line 33) | constexpr basic_iterable_impl(const basic_iterable_impl&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 34) | LZ_CONSTEXPR_CXX_14 basic_iterable_impl& operator=(const basic_ite...
        method basic_iterable_impl (line 38) | constexpr basic_iterable_impl()
        method basic_iterable_impl (line 46) | constexpr basic_iterable_impl() noexcept(std::is_nothrow_default_c...
        method basic_iterable_impl (line 53) | explicit constexpr basic_iterable_impl(Iterable&& iterable) :
        method basic_iterable_impl (line 57) | constexpr basic_iterable_impl(iterator_type begin, sentinel_type e...
        method size (line 62) | [[nodiscard]] constexpr size_t size() const
        method LZ_NODISCARD (line 72) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_ra_tag<Tag>::value...
        method LZ_NODISCARD (line 79) | LZ_NODISCARD constexpr iterator begin() const {
        method LZ_NODISCARD (line 83) | LZ_NODISCARD constexpr sentinel end() const {
      class sized_iterable_impl (line 89) | class sized_iterable_impl : public lazy_view {
        method sized_iterable_impl (line 100) | constexpr sized_iterable_impl(iterator_type begin, sentinel_type e...
        method sized_iterable_impl (line 115) | constexpr sized_iterable_impl()
        method sized_iterable_impl (line 123) | constexpr sized_iterable_impl() noexcept(std::is_nothrow_default_c...
        method sized_iterable_impl (line 129) | constexpr sized_iterable_impl(iterator_type begin, sentinel_type e...
        method sized_iterable_impl (line 136) | explicit constexpr sized_iterable_impl(Iterable&& iterable) :
        method LZ_NODISCARD (line 142) | LZ_NODISCARD constexpr size_t size() const noexcept {
        method LZ_NODISCARD (line 146) | LZ_NODISCARD constexpr iterator begin() const {
        method LZ_NODISCARD (line 150) | LZ_NODISCARD constexpr sentinel end() const {
  function LZ_MODULE_EXPORT (line 157) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/c_string.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/cached_size.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/cartesian_product.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/chunk_if.hpp
  function LZ_MODULE_EXPORT (line 10) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/chunks.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/common.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/concatenate.hpp
  function LZ_MODULE_EXPORT (line 9) | LZ_MODULE_EXPORT namespace lz {

FILE: include/Lz/detail/adaptors/as_iterator.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      type as_iterator_adaptor (line 19) | struct as_iterator_adaptor {
        method LZ_NODISCARD (line 40) | LZ_NODISCARD constexpr as_iterator_iterable<remove_ref_t<Iterable>...
        method LZ_NODISCARD (line 69) | LZ_NODISCARD constexpr as_iterator_iterable<remove_ref_t<Iterable>...
        method LZ_NODISCARD (line 123) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14

FILE: include/Lz/detail/adaptors/c_string.hpp
  type lz (line 8) | namespace lz {
    type detail (line 9) | namespace detail {
      type c_string_adaptor (line 10) | struct c_string_adaptor {
        method LZ_NODISCARD (line 27) | LZ_NODISCARD constexpr c_string_iterable<C> operator()(C* str) con...
        method LZ_NODISCARD (line 45) | LZ_NODISCARD constexpr c_string_iterable<const C> operator()(const...

FILE: include/Lz/detail/adaptors/cached_size.hpp
  type lz (line 8) | namespace lz {
    type detail (line 9) | namespace detail {
      type cached_size_adaptor (line 10) | struct cached_size_adaptor {
        method LZ_NODISCARD (line 49) | LZ_NODISCARD constexpr cached_size_iterable<remove_ref_t<Iterable>...

FILE: include/Lz/detail/adaptors/cartesian_product.hpp
  type lz (line 8) | namespace lz {
    type detail (line 9) | namespace detail {
      type cartesian_product_adaptor (line 10) | struct cartesian_product_adaptor {
        method LZ_NODISCARD (line 28) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 cartesian_product_iterable<remove...

FILE: include/Lz/detail/adaptors/chunk_if.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      type chunk_if_adaptor (line 13) | struct chunk_if_adaptor {
        method LZ_CONSTEXPR_CXX_14 (line 64) | LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, UnaryPredicate> operat...
      type chunk_if_adaptor<void> (line 70) | struct chunk_if_adaptor<void> {

FILE: include/Lz/detail/adaptors/chunks.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      type chunks_adaptor (line 12) | struct chunks_adaptor {

FILE: include/Lz/detail/adaptors/common.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      type common_adaptor (line 12) | struct common_adaptor {
        method LZ_NODISCARD (line 98) | LZ_NODISCARD constexpr enable_if_t<!has_sentinel<Iterable>::value,...
        method LZ_NODISCARD (line 129) | LZ_NODISCARD constexpr enable_if_t<has_sentinel<Iterable>::value &&
        method LZ_NODISCARD (line 164) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14
        method LZ_NODISCARD (line 201) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14
        method LZ_NODISCARD (line 238) | LZ_NODISCARD constexpr enable_if_t<is_ra<iter_t<Iterable>>::value ...

FILE: include/Lz/detail/adaptors/concatenate.hpp
  type lz (line 8) | namespace lz {
    type detail (line 9) | namespace detail {
      type concatenate_adaptor (line 10) | struct concatenate_adaptor {
        method LZ_NODISCARD (line 34) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 concatenate_iterable<remove_ref_t...

FILE: include/Lz/detail/adaptors/drop.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      type drop_adaptor (line 11) | struct drop_adaptor {
        method LZ_NODISCARD (line 29) | LZ_NODISCARD constexpr drop_iterable<remove_ref_t<Iterable>>

FILE: include/Lz/detail/adaptors/drop_while.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      type drop_while_adaptor (line 11) | struct drop_while_adaptor {
        method LZ_NODISCARD (line 27) | LZ_NODISCARD constexpr drop_while_iterable<remove_ref_t<Iterable>>
        method LZ_NODISCARD (line 44) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, UnaryPred...

FILE: include/Lz/detail/adaptors/duplicates.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      type duplicates_adaptor (line 13) | struct duplicates_adaptor {
        class BinaryPredicate (line 30) | class BinaryPredicate
        method LZ_NODISCARD (line 31) | LZ_NODISCARD constexpr duplicates_iterable<remove_ref_t<Iterable>,...
        method LZ_NODISCARD (line 74) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!is_iterable<BinaryPr...
      function LZ_MODULE_EXPORT (line 109) | LZ_MODULE_EXPORT template<class Iterable, class Adaptor>

FILE: include/Lz/detail/adaptors/enumerate.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      type enumerate_adaptor (line 12) | struct enumerate_adaptor {
        method LZ_NODISCARD (line 66) | LZ_NODISCARD constexpr enumerate_iterable<remove_ref_t<Iterable>, ...
        method LZ_NODISCARD (line 180) | LZ_NODISCARD constexpr enable_if_t<is_iterable<Iterable>::value, e...
        method LZ_NODISCARD (line 234) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!is_iterable<IntType>...

FILE: include/Lz/detail/adaptors/except.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      type except_adaptor (line 12) | struct except_adaptor {
        class BinaryPredicate (line 33) | class BinaryPredicate
        method LZ_NODISCARD (line 34) | LZ_NODISCARD constexpr except_iterable<remove_ref_t<Iterable1>, re...
        class BinaryPredicate (line 62) | class BinaryPredicate
        class BinaryPredicate (line 93) | class BinaryPredicate
        method LZ_NODISCARD (line 94) | LZ_NODISCARD

FILE: include/Lz/detail/adaptors/exclude.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      type exclude_adaptor (line 11) | struct exclude_adaptor {
        method LZ_NODISCARD (line 48) | LZ_NODISCARD constexpr exclude_iterable<remove_ref_t<Iterable>>
        method LZ_NODISCARD (line 86) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, DiffType,...

FILE: include/Lz/detail/adaptors/exclusive_scan.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      type exclusive_scan_adaptor (line 15) | struct exclusive_scan_adaptor {
        class BinaryOp (line 46) | class BinaryOp
        method requires (line 48) | const
        class BinaryOp (line 78) | class BinaryOp
        class BinaryOp (line 114) | class BinaryOp
  function LZ_MODULE_EXPORT (line 170) | LZ_MODULE_EXPORT template<class Iterable, class Adaptor>

FILE: include/Lz/detail/adaptors/filter.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      type filter_adaptor (line 11) | struct filter_adaptor {
        method LZ_NODISCARD (line 28) | LZ_NODISCARD constexpr filter_iterable<remove_ref_t<Iterable>, Una...
        method LZ_NODISCARD (line 46) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, UnaryPred...

FILE: include/Lz/detail/adaptors/flatten.hpp
  type lz (line 8) | namespace lz {
    type dimensions (line 11) | struct dimensions
    type dimensions<Iterable, detail::enable_if_t<!std::is_array<Iterable>::value>> (line 23) | struct dimensions<Iterable, detail::enable_if_t<!std::is_array<Iterabl...
    type dimensions<Iterable, detail::enable_if_t<std::is_array<Iterable>::value>> (line 35) | struct dimensions<Iterable, detail::enable_if_t<std::is_array<Iterable...
    type detail (line 56) | namespace detail {
      type flatten_adaptor (line 57) | struct flatten_adaptor {
        method LZ_NODISCARD (line 76) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14

FILE: include/Lz/detail/adaptors/fn_args_holder.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class fn_args_holder (line 14) | class fn_args_holder {

FILE: include/Lz/detail/adaptors/generate.hpp
  type lz (line 8) | namespace lz {
    type detail (line 9) | namespace detail {
      type generate_adaptor (line 10) | struct generate_adaptor {
        method LZ_NODISCARD (line 24) | LZ_NODISCARD constexpr generate_iterable<GeneratorFunc, false>
        method LZ_NODISCARD (line 39) | LZ_NODISCARD constexpr generate_iterable<GeneratorFunc, true> oper...

FILE: include/Lz/detail/adaptors/generate_while.hpp
  type lz (line 8) | namespace lz {
    type detail (line 9) | namespace detail {
      type generate_while_adaptor (line 10) | struct generate_while_adaptor {
        method LZ_NODISCARD (line 36) | LZ_NODISCARD constexpr generate_while_iterable<GeneratorFunc> oper...

FILE: include/Lz/detail/adaptors/group_by.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      type group_by_adaptor (line 11) | struct group_by_adaptor {
        method LZ_NODISCARD (line 32) | LZ_NODISCARD constexpr group_by_iterable<remove_ref_t<Iterable>, B...
        method LZ_NODISCARD (line 51) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, BinaryPre...

FILE: include/Lz/detail/adaptors/inclusive_scan.hpp
  type lz (line 12) | namespace lz {
    type detail (line 13) | namespace detail {
      type inclusive_scan_adaptor (line 14) | struct inclusive_scan_adaptor {
        class BinaryOp (line 49) | class BinaryOp
        class BinaryOp (line 84) | class BinaryOp
        class BinaryOp (line 125) | class BinaryOp
        method LZ_NODISCARD (line 126) | LZ_NODISCARD constexpr
        class BinaryOp (line 158) | class BinaryOp
        method LZ_NODISCARD (line 159) | LZ_NODISCARD constexpr
  function LZ_MODULE_EXPORT (line 183) | LZ_MODULE_EXPORT template<class Iterable>

FILE: include/Lz/detail/adaptors/interleave.hpp
  type lz (line 8) | namespace lz {
    type detail (line 9) | namespace detail {
      type interleave_adaptor (line 11) | struct interleave_adaptor {
        method LZ_NODISCARD (line 56) | LZ_NODISCARD constexpr interleave_iterable<remove_ref_t<Iterable>,...

FILE: include/Lz/detail/adaptors/intersection.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      type intersection_adaptor (line 13) | struct intersection_adaptor {
        class BinaryPredicate (line 38) | class BinaryPredicate
        class BinaryPredicate (line 64) | class BinaryPredicate
        class BinaryPredicate (line 96) | class BinaryPredicate
        method LZ_NODISCARD (line 97) | LZ_NODISCARD constexpr
        class BinaryPredicate (line 123) | class BinaryPredicate
        method LZ_NODISCARD (line 124) | LZ_NODISCARD constexpr enable_if_t<!is_iterable<BinaryPredicate>::...

FILE: include/Lz/detail/adaptors/iter_tools.hpp
  type lz (line 22) | namespace lz {
    type detail (line 23) | namespace detail {
      type convert_fn (line 25) | struct convert_fn {
        method LZ_NODISCARD (line 27) | LZ_NODISCARD constexpr To operator()(From&& f) const noexcept(noex...
      type get_fn (line 33) | struct get_fn {
        method LZ_NODISCARD (line 35) | LZ_NODISCARD constexpr auto operator()(T&& gettable) const -> decl...
      type trim_fn (line 40) | struct trim_fn {
        method LZ_NODISCARD (line 42) | LZ_NODISCARD constexpr bool operator()(const CharT c) const noexce...
      type deref_fn (line 47) | struct deref_fn {
        method LZ_NODISCARD (line 49) | LZ_NODISCARD constexpr auto operator()(T&& t) const -> decltype(*s...
      type unzip_with_adaptor (line 57) | struct unzip_with_adaptor {
        method LZ_NODISCARD (line 73) | LZ_NODISCARD constexpr unzip_with_iterable<remove_ref_t<Iterable>,...
        method LZ_NODISCARD (line 94) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, Predicate...
      type lines_adaptor (line 102) | struct lines_adaptor {
        method LZ_NODISCARD (line 123) | LZ_NODISCARD constexpr lines_iterable<val_iterable_t<String>, remo...
        method LZ_NODISCARD (line 140) | LZ_NODISCARD constexpr lines_iterable<CharT, copied_basic_sv<CharT...
      type as_adaptor (line 152) | struct as_adaptor {
        method LZ_NODISCARD (line 171) | LZ_NODISCARD constexpr as_iterable<remove_ref_t<Iterable>, T> oper...
      type get_n_adaptor (line 180) | struct get_n_adaptor {
        method LZ_NODISCARD (line 196) | LZ_NODISCARD constexpr get_nth_iterable<remove_ref_t<Iterable>, N>...
      type get_nths_adaptor (line 205) | struct get_nths_adaptor {
        method LZ_NODISCARD (line 221) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 get_nths_iterable<remove_ref_t<It...
      type filter_map_adaptor (line 229) | struct filter_map_adaptor {
        method LZ_NODISCARD (line 245) | LZ_NODISCARD constexpr filter_map_iterable<remove_ref_t<Iterable>,...
        method LZ_NODISCARD (line 264) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, UnaryFilt...
      type select_adaptor (line 273) | struct select_adaptor {
        method LZ_NODISCARD (line 289) | LZ_NODISCARD constexpr select_iterable<remove_ref_t<Iterable>, rem...
        method LZ_NODISCARD (line 307) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, SelectorI...
      type drop_back_while_adaptor (line 315) | struct drop_back_while_adaptor {
        method LZ_NODISCARD (line 331) | LZ_NODISCARD constexpr drop_back_iterable<remove_ref_t<Iterable>>
        method LZ_NODISCARD (line 348) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, UnaryPred...
      type trim_adaptor (line 356) | struct trim_adaptor {
        method LZ_NODISCARD (line 372) | LZ_NODISCARD constexpr trim_iterable<remove_ref_t<Iterable>>
        method LZ_NODISCARD (line 389) | LZ_NODISCARD constexpr trim_iterable<const std::basic_string<CharT>>
        method LZ_NODISCARD (line 406) | LZ_NODISCARD constexpr trim_iterable<copied_basic_sv<CharT>> opera...
        method LZ_NODISCARD (line 422) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, UnaryPred...
      type iter_decay (line 428) | struct iter_decay {
        method LZ_NODISCARD (line 471) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 map_iterable<as_iterator_iterable...
        method LZ_NODISCARD (line 516) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, IteratorT...
      type pad_adaptor (line 525) | struct pad_adaptor {

FILE: include/Lz/detail/adaptors/join_where.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      type join_where_adaptor (line 11) | struct join_where_adaptor {
        method LZ_NODISCARD (line 38) | LZ_NODISCARD constexpr join_where_iterable<remove_ref_t<IterableA>...
        method LZ_NODISCARD (line 68) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, IterableB...

FILE: include/Lz/detail/adaptors/loop.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      type loop_adaptor (line 12) | struct loop_adaptor {
        method LZ_NODISCARD (line 51) | LZ_NODISCARD constexpr enable_if_t<!std::is_integral<remove_cvref_...
        method LZ_NODISCARD (line 74) | LZ_NODISCARD constexpr loop_iterable<remove_ref_t<Iterable>, false>

FILE: include/Lz/detail/adaptors/map.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      type map_adaptor (line 11) | struct map_adaptor {
        method LZ_CONSTEXPR_CXX_14 (line 44) | LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, Function> operator()(F...

FILE: include/Lz/detail/adaptors/pairwise.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      type pairwise_adaptor (line 12) | struct pairwise_adaptor {
        method LZ_NODISCARD (line 25) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 pairwise_iterable<remove_ref_t<It...

FILE: include/Lz/detail/adaptors/random.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class seed_sequence (line 14) | class seed_sequence {
        method LZ_CONSTEXPR_CXX_20 (line 23) | LZ_CONSTEXPR_CXX_20 void create(Iter begin, Iter end) {
        method result_type (line 28) | result_type T(const result_type x) const {
        method seed_sequence (line 33) | constexpr seed_sequence() = default;
        method seed_sequence (line 35) | explicit seed_sequence(std::random_device& rd) {
        method LZ_CONSTEXPR_CXX_20 (line 40) | LZ_CONSTEXPR_CXX_20 seed_sequence(std::initializer_list<T> values) {
        method LZ_CONSTEXPR_CXX_20 (line 45) | LZ_CONSTEXPR_CXX_20 seed_sequence(Iter first, Iter last) {
        method seed_sequence (line 49) | seed_sequence(const seed_sequence&) = delete;
        method seed_sequence (line 50) | seed_sequence& operator=(const seed_sequence&) = delete;
        method LZ_CONSTEXPR_CXX_20 (line 53) | LZ_CONSTEXPR_CXX_20 void generate(Iter begin, Iter end) const {
        method LZ_CONSTEXPR_CXX_20 (line 106) | LZ_CONSTEXPR_CXX_20 void param(Iter output_iter) const {
        method size (line 110) | static constexpr size_t size() noexcept {
      function prng_engine (line 117) | inline prng_engine create_engine() {
      type random_adaptor (line 124) | struct random_adaptor {
        method LZ_NODISCARD (line 141) | LZ_NODISCARD constexpr random_iterable<typename Distribution::resu...
        method LZ_NODISCARD (line 199) | LZ_NODISCARD enable_if_t<std::is_integral<Integral>::value,
        method LZ_NODISCARD (line 223) | LZ_NODISCARD enable_if_t<std::is_floating_point<Floating>::value,

FILE: include/Lz/detail/adaptors/range.hpp
  type lz (line 8) | namespace lz {
    type detail (line 9) | namespace detail {
      type range_adaptor (line 10) | struct range_adaptor {
        method LZ_NODISCARD (line 28) | LZ_NODISCARD constexpr range_iterable<Arithmetic, true>
        method LZ_NODISCARD (line 44) | LZ_NODISCARD constexpr range_iterable<Arithmetic, false>
        method LZ_NODISCARD (line 60) | LZ_NODISCARD constexpr range_iterable<Arithmetic, false> operator(...

FILE: include/Lz/detail/adaptors/regex_split.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      type regex_split_adaptor (line 12) | struct regex_split_adaptor {
        method LZ_NODISCARD (line 35) | LZ_NODISCARD regex_split_iterable<regex_it<String>, regex_it<String>>
        method LZ_NODISCARD (line 55) | LZ_NODISCARD fn_args_holder<adaptor, const std::basic_regex<CharT>...
        method LZ_NODISCARD (line 76) | LZ_NODISCARD regex_split_iterable<RegexTokenIter, RegexTokenSentinel>

FILE: include/Lz/detail/adaptors/repeat.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      type repeat_adaptor (line 11) | struct repeat_adaptor {
        method LZ_NODISCARD (line 33) | LZ_NODISCARD constexpr repeat_iterable<remove_rvalue_reference_t<T...
        method LZ_NODISCARD (line 52) | LZ_NODISCARD constexpr repeat_iterable<T, true> operator()(T&& val...

FILE: include/Lz/detail/adaptors/reverse.hpp
  type lz (line 8) | namespace lz {
    type detail (line 9) | namespace detail {
      type reverse_adaptor (line 12) | struct reverse_adaptor {
        method LZ_NODISCARD (line 30) | LZ_NODISCARD constexpr reverse_iterable<remove_ref_t<Iterable>, Ca...

FILE: include/Lz/detail/adaptors/rotate.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      type rotate_adaptor (line 11) | struct rotate_adaptor {
        method LZ_NODISCARD (line 34) | LZ_NODISCARD constexpr rotate_iterable<remove_ref_t<Iterable>>
        method LZ_NODISCARD (line 58) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, DiffT> op...

FILE: include/Lz/detail/adaptors/slice.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      type slice_adaptor (line 15) | struct slice_adaptor {
        method LZ_NODISCARD (line 32) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 slice_iterable<remove_ref_t<Itera...

FILE: include/Lz/detail/adaptors/split.hpp
  type lz (line 10) | namespace lz {
    type detail (line 25) | namespace detail {
      type split_adaptor (line 28) | struct split_adaptor {
        method LZ_NODISCARD (line 106) | LZ_NODISCARD constexpr
        method LZ_CONSTEXPR_CXX_14 (line 207) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_iterable<T>::value, fn_args_hol...
        method LZ_CONSTEXPR_CXX_14 (line 225) | LZ_CONSTEXPR_CXX_14 enable_if_t<!is_iterable<T>::value, fn_args_ho...
        method LZ_CONSTEXPR_CXX_14 (line 242) | LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, copied_basic_sv<CharT>...
        method LZ_CONSTEXPR_CXX_14 (line 257) | LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, copied_basic_sv<CharT>>
      type split_adaptor<void> (line 264) | struct split_adaptor<void> {
        method LZ_NODISCARD (line 294) | LZ_NODISCARD constexpr auto operator()(Iterable&& iterable, T&& de...
        method LZ_NODISCARD (line 321) | LZ_NODISCARD constexpr enable_if_t<!is_iterable<T>::value, splitte...
        method LZ_NODISCARD (line 341) | LZ_NODISCARD constexpr enable_if_t<is_iterable<Iterable2>::value, ...
        method LZ_NODISCARD (line 362) | LZ_NODISCARD constexpr splitter_iterable<Iterable, copied_basic_sv...
        method LZ_NODISCARD (line 381) | LZ_NODISCARD constexpr splitter_iterable<Iterable, copied_basic_sv...
        method LZ_NODISCARD (line 403) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 auto operator()(T&& delimiter) co...
        method LZ_NODISCARD (line 429) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_iterable<Iterable>...
        method LZ_NODISCARD (line 448) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!is_iterable<T>::valu...
        method LZ_NODISCARD (line 467) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, copied_ba...
        method LZ_NODISCARD (line 484) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, copied_ba...

FILE: include/Lz/detail/adaptors/take.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      type take_adaptor (line 11) | struct take_adaptor {
        method LZ_NODISCARD (line 64) | LZ_NODISCARD constexpr take_iterable<remove_ref_t<Iterable>> opera...

FILE: include/Lz/detail/adaptors/take_every.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      type take_every_adaptor (line 12) | struct take_every_adaptor {
        method LZ_NODISCARD (line 90) | LZ_NODISCARD constexpr enable_if_t<is_iterable<Iterable>::value, t...

FILE: include/Lz/detail/adaptors/take_while.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      type take_while_adaptor (line 11) | struct take_while_adaptor {
        method LZ_NODISCARD (line 27) | LZ_NODISCARD constexpr take_while_iterable<remove_ref_t<Iterable>,...
        method LZ_NODISCARD (line 44) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 fn_args_holder<adaptor, UnaryPred...

FILE: include/Lz/detail/adaptors/unique.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      type unique_adaptor (line 13) | struct unique_adaptor {
        class BinaryPredicate (line 34) | class BinaryPredicate
        class BinaryPredicate (line 58) | class BinaryPredicate
        class BinaryPredicate (line 83) | class BinaryPredicate
        method LZ_NODISCARD (line 84) | LZ_NODISCARD constexpr enable_if_t<is_iterable<Iterable>::value, u...
        method LZ_NODISCARD (line 106) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!is_iterable<BinaryPr...
  function LZ_MODULE_EXPORT (line 127) | LZ_MODULE_EXPORT template<class Iterable, class Adaptor>

FILE: include/Lz/detail/adaptors/zip.hpp
  type lz (line 8) | namespace lz {
    type detail (line 9) | namespace detail {
      type zip_adaptor (line 10) | struct zip_adaptor {
        method LZ_NODISCARD (line 54) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 zip_iterable<remove_ref_t<Iterabl...

FILE: include/Lz/detail/adaptors/zip_longest.hpp
  type lz (line 8) | namespace lz {
    type detail (line 9) | namespace detail {
      type zip_longest_adaptor (line 10) | struct zip_longest_adaptor {
        method LZ_NODISCARD (line 52) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 zip_longest_iterable<remove_ref_t...

FILE: include/Lz/detail/algorithm/accumulate.hpp
  type lz (line 15) | namespace lz {
    type detail (line 16) | namespace detail {
      function LZ_CONSTEXPR_CXX_14 (line 21) | LZ_CONSTEXPR_CXX_14 T accumulate(Iterator begin, S end, T init, Unar...
      function LZ_CONSTEXPR_CXX_14 (line 36) | LZ_CONSTEXPR_CXX_14 T accumulate(Iterator begin, S end, T init, Unar...

FILE: include/Lz/detail/algorithm/adjacent_find.hpp
  type lz (line 17) | namespace lz {
    type detail (line 18) | namespace detail {
      function Iterator (line 23) | constexpr Iterator adjacent_find(Iterator begin, S end, BinaryPredic...
      function LZ_CONSTEXPR_CXX_14 (line 44) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std_algo_compat<Iterator, S>::value...
      function LZ_CONSTEXPR_CXX_14 (line 60) | LZ_CONSTEXPR_CXX_14 enable_if_t<std_algo_compat<Iterator, S>::value,...

FILE: include/Lz/detail/algorithm/back.hpp
  type lz (line 16) | namespace lz {
    type detail (line 17) | namespace detail {
      function back (line 22) | constexpr ref_t<Iterator> back(Iterator begin, S end) {
      function LZ_CONSTEXPR_CXX_14 (line 44) | LZ_CONSTEXPR_CXX_14 enable_if_t<std_algo_compat<Iterator, S>::value,...
      function LZ_CONSTEXPR_CXX_14 (line 51) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std_algo_compat<Iterator, S>::value...

FILE: include/Lz/detail/algorithm/copy.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      function copy (line 20) | constexpr void copy(Iterator begin, S end, OutputIterator out) {
      function LZ_CONSTEXPR_CXX_14 (line 34) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std_algo_compat<Iterator, S>::value...
      function LZ_CONSTEXPR_CXX_14 (line 41) | LZ_CONSTEXPR_CXX_14 enable_if_t<std_algo_compat<Iterator, S>::value>...

FILE: include/Lz/detail/algorithm/count.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      function LZ_CONSTEXPR_CXX_14 (line 14) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std_algo_compat<I, S>::value, diff_...
      function LZ_CONSTEXPR_CXX_14 (line 25) | LZ_CONSTEXPR_CXX_14 enable_if_t<std_algo_compat<I, S>::value, diff_t...

FILE: include/Lz/detail/algorithm/count_if.hpp
  type lz (line 16) | namespace lz {
    type detail (line 17) | namespace detail {
      function count_if (line 22) | constexpr diff_type<Iterator> count_if(Iterator begin, S end, UnaryP...
      function LZ_CONSTEXPR_CXX_14 (line 40) | LZ_CONSTEXPR_CXX_14 enable_if_t<std_algo_compat<Iterator, S>::value,...
      function LZ_CONSTEXPR_CXX_14 (line 46) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std_algo_compat<Iterator, S>::value...

FILE: include/Lz/detail/algorithm/ends_with.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      function LZ_CONSTEXPR_CXX_17 (line 14) | LZ_CONSTEXPR_CXX_17 bool ends_with(Iterator1 begin, S1 end, Iterator...
      function LZ_CONSTEXPR_CXX_14 (line 22) | LZ_CONSTEXPR_CXX_14 bool ends_with(Iterator1 begin, S1 end, Iterator...

FILE: include/Lz/detail/algorithm/equal.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      function equal (line 17) | constexpr bool equal(Iterator1 begin, S1 end, Iterator2 begin2, S2 e...
      function LZ_NODISCARD (line 36) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<std_algo_compat2<Iterat...
      function LZ_NODISCARD (line 44) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!std_algo_compat2<Itera...
      function LZ_NODISCARD (line 58) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!is_ra<Iterator1>::valu...
      function LZ_NODISCARD (line 69) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_ra<Iterator1>::value...

FILE: include/Lz/detail/algorithm/find_if.hpp
  type lz (line 17) | namespace lz {
    type detail (line 18) | namespace detail {
      function LZ_CONSTEXPR_CXX_14 (line 23) | LZ_CONSTEXPR_CXX_14 Iterator find_if(Iterator begin, S end, UnaryPre...
      function LZ_CONSTEXPR_CXX_14 (line 40) | LZ_CONSTEXPR_CXX_14 enable_if_t<std_algo_compat<Iterator, S>::value,...
      function LZ_CONSTEXPR_CXX_14 (line 46) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std_algo_compat<Iterator, S>::value...

FILE: include/Lz/detail/algorithm/find_last_if.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      function LZ_CONSTEXPR_CXX_14 (line 15) | LZ_CONSTEXPR_CXX_14 Iterator unwrap_reverse_iterator(std::reverse_it...
      function find_last_if (line 26) | constexpr iter_t<Iterable> find_last_if(Iterable&& iterable, UnaryPr...
      function LZ_CONSTEXPR_CXX_14 (line 51) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_bidi<iter_t<Iterable>>::value, it...
      function LZ_CONSTEXPR_CXX_14 (line 58) | LZ_CONSTEXPR_CXX_14 enable_if_t<!is_bidi<iter_t<Iterable>>::value, i...

FILE: include/Lz/detail/algorithm/for_each.hpp
  type lz (line 15) | namespace lz {
    type detail (line 16) | namespace detail {
      function for_each (line 21) | constexpr void for_each(Iterator begin, S end, Func func) {
      function for_each (line 35) | enable_if_t<std_algo_compat<Iterator, S>::value> for_each(Iterator b...
      function LZ_CONSTEXPR_CXX_14 (line 40) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std_algo_compat<Iterator, S>::value...

FILE: include/Lz/detail/algorithm/for_each_while.hpp
  type lz (line 8) | namespace lz {
    type detail (line 9) | namespace detail {
      function LZ_CONSTEXPR_CXX_14 (line 12) | LZ_CONSTEXPR_CXX_14 void for_each_while(Iterator begin, S end, Unary...

FILE: include/Lz/detail/algorithm/for_each_while_n.hpp
  type lz (line 12) | namespace lz {
    type detail (line 13) | namespace detail {
      function for_each_while_n (line 18) | constexpr void for_each_while_n(Iterable&& iterable, size_t n, Unary...
      function LZ_CONSTEXPR_CXX_14 (line 55) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_ra<iter_t<Iterable>>::value>
      function LZ_CONSTEXPR_CXX_14 (line 70) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_sized<Iterable>::value && !is_ra<...
      function LZ_CONSTEXPR_CXX_14 (line 81) | LZ_CONSTEXPR_CXX_14 enable_if_t<!is_sized<Iterable>::value && !is_ra...

FILE: include/Lz/detail/algorithm/index_of_if.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      function LZ_CONSTEXPR_CXX_14 (line 14) | LZ_CONSTEXPR_CXX_14 size_t index_of_if(Iterator begin, S end, UnaryP...

FILE: include/Lz/detail/algorithm/is_sorted.hpp
  type lz (line 12) | namespace lz {
    type detail (line 13) | namespace detail {
      function is_sorted (line 18) | constexpr bool is_sorted(Iterator begin, S end, BinaryPredicate bina...
      function LZ_CONSTEXPR_CXX_14 (line 39) | LZ_CONSTEXPR_CXX_14 enable_if_t<std_algo_compat<Iterator, S>::value,...
      function LZ_CONSTEXPR_CXX_14 (line 45) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std_algo_compat<Iterator, S>::value...

FILE: include/Lz/detail/algorithm/lower_bound.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      function LZ_CONSTEXPR_CXX_14 (line 14) | LZ_CONSTEXPR_CXX_14 Iterator sized_lower_bound(Iterator begin, const...
      function LZ_CONSTEXPR_CXX_14 (line 31) | LZ_CONSTEXPR_CXX_14 iter_t<Iterable> lower_bound(Iterable&& iterable...

FILE: include/Lz/detail/algorithm/max_element.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      function LZ_CONSTEXPR_CXX_14 (line 20) | LZ_CONSTEXPR_CXX_14 Iterator max_element(Iterator begin, S end, Bina...
      function LZ_CONSTEXPR_CXX_14 (line 41) | LZ_CONSTEXPR_CXX_14 enable_if_t<std_algo_compat<Iterator, S>::value,...
      function LZ_CONSTEXPR_CXX_14 (line 47) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std_algo_compat<Iterator, S>::value...

FILE: include/Lz/detail/algorithm/mean.hpp
  type lz (line 12) | namespace lz {
    type detail (line 13) | namespace detail {
      function mean (line 18) | constexpr double mean(Iterator begin, S end, BinaryOp binary_op) {
      function LZ_CONSTEXPR_CXX_14 (line 43) | LZ_CONSTEXPR_CXX_14 enable_if_t<!is_ra<Iterator>::value, double> mea...
      function LZ_CONSTEXPR_CXX_14 (line 60) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_ra<Iterator>::value, double> mean...

FILE: include/Lz/detail/algorithm/partition.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      function Iterator (line 19) | constexpr Iterator partition(Iterator begin, S end, UnaryPredicate u...
      function LZ_CONSTEXPR_CXX_14 (line 45) | LZ_CONSTEXPR_CXX_14 enable_if_t<std_algo_compat<Iterator, S>::value,...
      function LZ_CONSTEXPR_CXX_14 (line 51) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std_algo_compat<Iterator, S>::value...

FILE: include/Lz/detail/algorithm/peek.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      function get_value_or_reference (line 17) | constexpr auto get_value_or_reference(Iterator begin) {
      function LZ_CONSTEXPR_CXX_14 (line 29) | LZ_CONSTEXPR_CXX_14
      function LZ_CONSTEXPR_CXX_14 (line 36) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std::is_lvalue_reference<ref_t<Iter...
      function peek (line 44) | LZ_CONSTEXPR_CXX_14 auto peek(Iterator begin, S end) -> decltype(get...

FILE: include/Lz/detail/algorithm/search.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      function std_search (line 17) | std::pair<Iterator, Iterator>
      function search (line 26) | constexpr std::pair<Iterator, Iterator>
      function LZ_CONSTEXPR_CXX_14 (line 53) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std_algo_compat2<Iterator, S, Itera...
      function LZ_CONSTEXPR_CXX_14 (line 71) | LZ_CONSTEXPR_CXX_14 enable_if_t<std_algo_compat2<Iterator, S, Iterat...

FILE: include/Lz/detail/algorithm/starts_with.hpp
  type lz (line 15) | namespace lz {
    type detail (line 16) | namespace detail {
      function starts_with (line 21) | constexpr bool starts_with(Iterator1 begin, S1 end, Iterator2 begin2...
      function LZ_CONSTEXPR_CXX_14 (line 42) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_ra<Iterator1>::value && is_ra<Ite...
      function LZ_CONSTEXPR_CXX_14 (line 52) | LZ_CONSTEXPR_CXX_14 enable_if_t<!is_ra<Iterator1>::value || !is_ra<I...
      function LZ_CONSTEXPR_CXX_14 (line 65) | LZ_CONSTEXPR_CXX_14 enable_if_t<!is_ra<Iterator1>::value || !is_ra<I...
      function LZ_CONSTEXPR_CXX_14 (line 76) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_ra<Iterator1>::value && is_ra<Ite...

FILE: include/Lz/detail/algorithm/transform.hpp
  type lz (line 15) | namespace lz {
    type detail (line 16) | namespace detail {
      function LZ_CONSTEXPR_CXX_14 (line 21) | LZ_CONSTEXPR_CXX_14 void transform(Iterator begin, S end, OutputIter...
      function LZ_CONSTEXPR_CXX_14 (line 35) | LZ_CONSTEXPR_CXX_14 detail::enable_if_t<std_algo_compat<Iterator, S>...
      function LZ_CONSTEXPR_CXX_14 (line 41) | LZ_CONSTEXPR_CXX_14 detail::enable_if_t<!std_algo_compat<Iterator, S...

FILE: include/Lz/detail/compiler_config.hpp
  type lz (line 101) | namespace lz {
    type detail (line 102) | namespace detail {

FILE: include/Lz/detail/fake_ptr_proxy.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      class fake_ptr_proxy (line 13) | class fake_ptr_proxy {
        method fake_ptr_proxy (line 19) | constexpr explicit fake_ptr_proxy(const T& t) noexcept(std::is_not...
        method LZ_NODISCARD (line 22) | LZ_NODISCARD constexpr ptr operator->() const noexcept {
        method ptr (line 26) | ptr operator->() noexcept {

FILE: include/Lz/detail/func_container.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class func_container (line 15) | class func_container {
        method func_container (line 21) | constexpr func_container()
        method func_container (line 28) | constexpr func_container() noexcept(std::is_nothrow_default_constr...
        method func_container (line 33) | explicit func_container(const Func& func) : _func{ func } {
        method func_container (line 36) | explicit func_container(Func&& func) noexcept(std::is_nothrow_move...
        method func_container (line 39) | func_container(const func_container& other) : _func{ other._func } {
        method func_container (line 42) | func_container(func_container&& other) noexcept(std::is_nothrow_co...
        method func_container (line 46) | func_container& operator=(const func_container& other) {
        method func_container (line 51) | func_container& operator=(func_container&& other) noexcept(std::is...
        method LZ_NODISCARD (line 58) | LZ_NODISCARD constexpr auto operator()(Args&&... args) const& -> d...
        method LZ_NODISCARD (line 63) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 auto operator()(Args&&... args) &...
        method LZ_NODISCARD (line 68) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 auto

FILE: include/Lz/detail/iterables/as_iterator.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class as_iterator_iterable (line 14) | class as_iterator_iterable : public lazy_view {
        method as_iterator_iterable (line 28) | constexpr as_iterator_iterable()
        method as_iterator_iterable (line 35) | constexpr as_iterator_iterable() noexcept(std::is_nothrow_default_...
        method as_iterator_iterable (line 41) | explicit constexpr as_iterator_iterable(I&& iterable) : _iterable{...
        method size (line 46) | [[nodiscard]] constexpr size_t size() const
        method LZ_NODISCARD (line 55) | LZ_NODISCARD constexpr enable_if_t<T::value, size_t> size() const {
        method LZ_NODISCARD (line 61) | LZ_NODISCARD constexpr iterator begin() const {
        method LZ_NODISCARD (line 67) | LZ_NODISCARD constexpr auto end() const {
        method LZ_NODISCARD (line 79) | LZ_NODISCARD constexpr enable_if_t<!is_sentinel<I, sentinel_t<Iter...
        method LZ_NODISCARD (line 84) | LZ_NODISCARD constexpr enable_if_t<is_sentinel<I, sentinel_t<Itera...

FILE: include/Lz/detail/iterables/c_string.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      class c_string_iterable (line 12) | class c_string_iterable : public lazy_view {
        method c_string_iterable (line 21) | constexpr c_string_iterable() noexcept = default;
        method c_string_iterable (line 23) | explicit constexpr c_string_iterable(C* begin) noexcept : _begin{ ...
        method LZ_NODISCARD (line 26) | LZ_NODISCARD constexpr iterator begin() const noexcept {
        method end (line 30) | end() const noexcept {

FILE: include/Lz/detail/iterables/cached_size.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      class cached_size_iterable (line 12) | class cached_size_iterable : public lazy_view {
        method cached_size_iterable (line 23) | constexpr cached_size_iterable()
        method cached_size_iterable (line 30) | constexpr cached_size_iterable() noexcept(std::is_nothrow_default_...
        method cached_size_iterable (line 36) | explicit constexpr cached_size_iterable(I&& iterable) :
        method LZ_NODISCARD (line 41) | LZ_NODISCARD constexpr size_t size() const noexcept {
        method LZ_NODISCARD (line 45) | LZ_NODISCARD constexpr iterator begin() const {
        method LZ_NODISCARD (line 49) | LZ_NODISCARD constexpr sentinel end() const {

FILE: include/Lz/detail/iterables/cartesian_product.hpp
  type lz (line 12) | namespace lz {
    type detail (line 13) | namespace detail {
      class cartesian_product_iterable (line 15) | class cartesian_product_iterable : public lazy_view {
        method LZ_NODISCARD (line 19) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 size_t size(index_sequence<Is...>...
        method init_iterators (line 27) | constexpr void init_iterators(Iterators& it, bool& first_at_end) c...
        method LZ_CONSTEXPR_CXX_14 (line 42) | LZ_CONSTEXPR_CXX_14 enable_if_t<(I >= 0)> init_iterators(Iterators...
        method LZ_CONSTEXPR_CXX_14 (line 53) | LZ_CONSTEXPR_CXX_14 enable_if_t<(I < 0)> init_iterators(Iterators&...
        method concat_iterables (line 59) | static cartesian_product_iterable<remove_ref_t<Iterable2>, Iterabl...
        method concat_iterables (line 65) | static cartesian_product_iterable<remove_ref_t<Iterable2>, Iterabl...
        method cartesian_product_iterable (line 86) | constexpr cartesian_product_iterable()
        method cartesian_product_iterable (line 93) | constexpr cartesian_product_iterable() noexcept(std::is_nothrow_de...
        method size (line 104) | constexpr size_t size() const
        method LZ_NODISCARD (line 113) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<S, size_t> size() con...
        method iterator (line 119) | iterator begin() const {
        method end (line 129) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 144) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 152) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<R, sentinel> end() co...
        method LZ_NODISCARD (line 159) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 friend cartesian_product_iterable...
        method LZ_NODISCARD (line 165) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 friend cartesian_product_iterable...

FILE: include/Lz/detail/iterables/chunk_if.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class chunk_if_iterable (line 14) | class chunk_if_iterable : public lazy_view {
        method chunk_if_iterable (line 25) | constexpr chunk_if_iterable()
        method chunk_if_iterable (line 33) | constexpr chunk_if_iterable() noexcept(std::is_nothrow_default_con...
        method chunk_if_iterable (line 40) | constexpr chunk_if_iterable(I&& iterable, UnaryPredicate predicate) :
        method iterator (line 45) | iterator begin() const {
        method end (line 49) | end() const noexcept {

FILE: include/Lz/detail/iterables/chunks.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class chunks_iterable (line 14) | class chunks_iterable : public lazy_view {
        method chunks_iterable (line 31) | constexpr chunks_iterable()
        method chunks_iterable (line 38) | constexpr chunks_iterable() noexcept(std::is_nothrow_default_const...
      function size (line 52) | [[nodiscard]] constexpr size_t size() const
      function LZ_NODISCARD (line 62) | LZ_NODISCARD constexpr enable_if_t<is_sized<I>::value, size_t> size(...
      function begin (line 71) | [[nodiscard]] constexpr auto begin() const {
      function LZ_NODISCARD (line 84) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!is_bidi_tag<I>::value,...
      function LZ_NODISCARD (line 89) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_bidi_tag<I>::value, ...
      function end (line 97) | [[nodiscard]] constexpr auto end() const {
      function LZ_NODISCARD (line 110) | LZ_NODISCARD
      function LZ_NODISCARD (line 117) | LZ_NODISCARD constexpr enable_if_t<!is_bidi_tag<I>::value || is_sent...

FILE: include/Lz/detail/iterables/common.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      class common_iterable (line 13) | class common_iterable : public lazy_view {
        method common_iterable (line 23) | constexpr common_iterable()
        method common_iterable (line 30) | constexpr common_iterable() noexcept(std::is_nothrow_default_const...
        method common_iterable (line 36) | explicit constexpr common_iterable(I&& iterable) : _iterable{ std:...
        method LZ_NODISCARD (line 41) | LZ_NODISCARD constexpr size_t size() const
        method LZ_NODISCARD (line 50) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<Sized, size_t> size()...
        method iterator (line 56) | iterator begin() const {
        method iterator (line 60) | iterator end() const {

FILE: include/Lz/detail/iterables/concatenate.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class concatenate_iterable (line 15) | class concatenate_iterable : public lazy_view {
        method LZ_NODISCARD (line 20) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 size_t size(index_sequence<I...>)...
        method concat_iterables (line 26) | static concatenate_iterable<remove_ref_t<Iterable2>, Iterables...>
        method concatenate_iterable (line 45) | constexpr concatenate_iterable()
        method concatenate_iterable (line 52) | constexpr concatenate_iterable() noexcept(std::is_nothrow_default_...
        method size (line 63) | constexpr size_t size() const
        method LZ_NODISCARD (line 72) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<T::value, size_t> siz...
        method iterator (line 78) | iterator begin() const {
        method end (line 84) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 96) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 101) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<R, default_sentinel_t...

FILE: include/Lz/detail/iterables/drop.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class drop_iterable (line 13) | class drop_iterable : public lazy_view {
        method drop_iterable (line 29) | constexpr drop_iterable()
        method drop_iterable (line 36) | constexpr drop_iterable() noexcept(std::is_nothrow_default_constru...
        method drop_iterable (line 42) | constexpr drop_iterable(I&& iterable, const diff n) : _iterable{ s...
        method size (line 47) | [[nodiscard]] constexpr size_t size() const
        method LZ_NODISCARD (line 57) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<Sized, size_t> size()...
        method iterator (line 64) | iterator begin() const {
        method LZ_NODISCARD (line 68) | LZ_NODISCARD constexpr sentinel end() const {

FILE: include/Lz/detail/iterables/drop_while.hpp
  type lz (line 12) | namespace lz {
    type detail (line 13) | namespace detail {
      class drop_while_iterable (line 15) | class drop_while_iterable : public lazy_view {
        method drop_while_iterable (line 31) | constexpr drop_while_iterable()
        method drop_while_iterable (line 39) | constexpr drop_while_iterable() noexcept(std::is_nothrow_default_c...
        method drop_while_iterable (line 46) | constexpr drop_while_iterable(I&& iterable, UnaryPredicate unary_p...
        method iterator (line 51) | iterator begin() const {
        method size (line 57) | [[nodiscard]] constexpr size_t size() const
        method LZ_NODISCARD (line 66) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_ra_tag<I>::value, ...
        method end (line 74) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 86) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, sentinel> end() c...
        method LZ_NODISCARD (line 91) | LZ_NODISCARD constexpr enable_if_t<R, default_sentinel_t> end() co...

FILE: include/Lz/detail/iterables/duplicates.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class duplicates_iterable (line 14) | class duplicates_iterable : public lazy_view {
        method duplicates_iterable (line 32) | constexpr duplicates_iterable()
        method duplicates_iterable (line 40) | constexpr duplicates_iterable() noexcept(std::is_nothrow_default_c...
        method duplicates_iterable (line 47) | constexpr duplicates_iterable(I&& iterable, BinaryPredicate compar...
        method iterator (line 52) | iterator begin() const {
        method end (line 58) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 70) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 75) | LZ_NODISCARD constexpr enable_if_t<R, default_sentinel_t> end() co...

FILE: include/Lz/detail/iterables/enumerate.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class enumerate_iterable (line 13) | class enumerate_iterable : public lazy_view {
        method enumerate_iterable (line 32) | constexpr enumerate_iterable()
        method enumerate_iterable (line 39) | constexpr enumerate_iterable() noexcept(std::is_nothrow_default_co...
        method enumerate_iterable (line 45) | constexpr enumerate_iterable(I&& iterable, const IntType start) : ...
        method size (line 50) | [[nodiscard]] constexpr size_t size() const
        method LZ_NODISCARD (line 59) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_sized<I>::value, s...
        method iterator (line 67) | [[nodiscard]] constexpr iterator begin() const {
        method end (line 76) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 90) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<T::value, iterator> b...
        method LZ_NODISCARD (line 95) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!T::value, iterator> ...
        method LZ_NODISCARD (line 100) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 105) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<R && is_bidi_tag<type...
        method LZ_NODISCARD (line 111) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<R && !is_bidi_tag<typ...

FILE: include/Lz/detail/iterables/except.hpp
  type lz (line 12) | namespace lz {
    type detail (line 13) | namespace detail {
      class except_iterable (line 16) | class except_iterable : public lazy_view {
        method except_iterable (line 35) | constexpr except_iterable()
        method except_iterable (line 45) | constexpr except_iterable() noexcept(std::is_nothrow_default_const...
        method except_iterable (line 53) | constexpr except_iterable(I1&& iterable1, I2&& iterable2, BinaryPr...
        method iterator (line 59) | iterator begin() const {
        method end (line 65) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 77) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 82) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<R, default_sentinel_t...

FILE: include/Lz/detail/iterables/exclude.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class exclude_iterable (line 14) | class exclude_iterable : public lazy_view {
        method exclude_iterable (line 35) | constexpr exclude_iterable()
        method exclude_iterable (line 42) | constexpr exclude_iterable() noexcept(std::is_nothrow_default_cons...
        method exclude_iterable (line 48) | constexpr exclude_iterable(I&& iterable, const diff_iterable_t<Ite...
        method size (line 56) | [[nodiscard]] constexpr size_t size() const
        method LZ_NODISCARD (line 65) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_sized<I>::value, s...
        method iterator (line 70) | iterator begin() const {
        method end (line 76) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 89) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 94) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<R, sentinel> end() co...

FILE: include/Lz/detail/iterables/exclusive_scan.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class exclusive_scan_iterable (line 14) | class exclusive_scan_iterable : public lazy_view {
        method exclusive_scan_iterable (line 25) | constexpr exclusive_scan_iterable()
        method exclusive_scan_iterable (line 35) | constexpr exclusive_scan_iterable() noexcept(std::is_nothrow_defau...
        method exclusive_scan_iterable (line 43) | constexpr exclusive_scan_iterable(I&& iterable, T init, BinaryOp b...
        method size (line 51) | [[nodiscard]] constexpr size_t size() const
        method LZ_NODISCARD (line 61) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_sized<I>::value, s...
        method iterator (line 68) | iterator begin() const&{
        method end (line 72) | end() const noexcept {

FILE: include/Lz/detail/iterables/filter.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class filter_iterable (line 14) | class filter_iterable : public lazy_view {
        method filter_iterable (line 34) | constexpr filter_iterable()
        method filter_iterable (line 42) | constexpr filter_iterable() noexcept(std::is_nothrow_default_const...
        method filter_iterable (line 49) | constexpr filter_iterable(I&& iterable, UnaryPredicate predicate) :
        method iterator (line 54) | iterator begin() const {
        method end (line 60) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 72) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 77) | LZ_NODISCARD constexpr enable_if_t<R, default_sentinel_t> end() co...

FILE: include/Lz/detail/iterables/flatten.hpp
  type lz (line 12) | namespace lz {
    type detail (line 13) | namespace detail {
      function all_sized_fn (line 18) | [[nodiscard]] constexpr bool all_sized_fn() {
      type all_sized_impl (line 33) | struct all_sized_impl {
      type all_sized_impl<true> (line 39) | struct all_sized_impl<true> {
      function size_all (line 64) | [[nodiscard]] constexpr size_t size_all(Iterable&& iterable) {
      function LZ_NODISCARD (line 77) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<I == 1, size_t> size_al...
      function LZ_NODISCARD (line 82) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<(I > 1), size_t> size_a...
      class flatten_iterable (line 90) | class flatten_iterable : public lazy_view {
        method flatten_iterable (line 108) | constexpr flatten_iterable()
        method flatten_iterable (line 115) | constexpr flatten_iterable() noexcept(std::is_nothrow_default_cons...
        method size (line 126) | [[nodiscard]] constexpr size_t size() const
        method LZ_NODISCARD (line 135) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<T::value, size_t> siz...
        method LZ_CONSTEXPR_CXX_14 (line 141) | LZ_CONSTEXPR_CXX_14 iterator begin() const {
        method end (line 147) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 159) | LZ_NODISCARD constexpr enable_if_t<!R, iterator> end() const {
        method LZ_NODISCARD (line 164) | LZ_NODISCARD constexpr enable_if_t<R, default_sentinel_t> end() co...

FILE: include/Lz/detail/iterables/generate.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class generate_iterable (line 13) | class generate_iterable
      class generate_iterable<GeneratorFunc, false> (line 16) | class generate_iterable<GeneratorFunc, false> : public lazy_view {
        method generate_iterable (line 27) | constexpr generate_iterable()
        method generate_iterable (line 34) | constexpr generate_iterable() noexcept(std::is_nothrow_default_con...
        method generate_iterable (line 39) | constexpr generate_iterable(GeneratorFunc func, const ptrdiff_t am...
        method LZ_NODISCARD (line 42) | LZ_NODISCARD constexpr size_t size() const noexcept {
        method LZ_NODISCARD (line 46) | LZ_NODISCARD constexpr iterator begin() const {
        method end (line 50) | end() const noexcept {
      class generate_iterable<GeneratorFunc, true> (line 56) | class generate_iterable<GeneratorFunc, true> : public lazy_view {
        method generate_iterable (line 66) | constexpr generate_iterable()
        method generate_iterable (line 73) | constexpr generate_iterable() noexcept(std::is_nothrow_default_con...
        method generate_iterable (line 78) | explicit constexpr generate_iterable(GeneratorFunc func) : _func{ ...
        method LZ_NODISCARD (line 81) | LZ_NODISCARD constexpr iterator begin() const {
        method end (line 85) | end() const noexcept {

FILE: include/Lz/detail/iterables/generate_while.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class generate_while_iterable (line 13) | class generate_while_iterable : public lazy_view {
        method generate_while_iterable (line 27) | constexpr generate_while_iterable()
        method generate_while_iterable (line 35) | constexpr generate_while_iterable() noexcept(std::is_nothrow_defau...
        method LZ_CONSTEXPR_CXX_14 (line 41) | LZ_CONSTEXPR_CXX_14 generate_while_iterable(GeneratorFunc func) : ...
        method iterator (line 44) | iterator begin() const {
        method default_sentinel_t (line 48) | default_sentinel_t end() const noexcept {

FILE: include/Lz/detail/iterables/group_by.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class group_by_iterable (line 14) | class group_by_iterable : public lazy_view {
        method group_by_iterable (line 30) | constexpr group_by_iterable()
        method group_by_iterable (line 38) | constexpr group_by_iterable() noexcept(std::is_nothrow_default_con...
        method LZ_CONSTEXPR_CXX_14 (line 45) | LZ_CONSTEXPR_CXX_14 group_by_iterable(I&& iterable, BinaryPredicat...
        method end (line 56) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 68) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 73) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<R, default_sentinel_t...

FILE: include/Lz/detail/iterables/inclusive_scan.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class inclusive_scan_iterable (line 14) | class inclusive_scan_iterable : public lazy_view {
        method inclusive_scan_iterable (line 26) | constexpr inclusive_scan_iterable()
        method inclusive_scan_iterable (line 36) | constexpr inclusive_scan_iterable() noexcept(std::is_nothrow_defau...
        method inclusive_scan_iterable (line 44) | constexpr inclusive_scan_iterable(I&& iterable, T init, BinaryOp b...
        method LZ_NODISCARD (line 52) | LZ_NODISCARD constexpr size_t size() const
        method LZ_NODISCARD (line 61) | LZ_NODISCARD constexpr enable_if_t<is_sized<I>::value, size_t> siz...
        method iterator (line 67) | iterator begin() const {
        method end (line 78) | end() const noexcept {

FILE: include/Lz/detail/iterables/interleave.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class interleave_iterable (line 14) | class interleave_iterable : public lazy_view {
        method LZ_CONSTEXPR_CXX_14 (line 21) | LZ_CONSTEXPR_CXX_14 size_t size(index_sequence<I...>) const {
        method concat_iterables (line 28) | static interleave_iterable<remove_ref_t<Iterable2>, Iterables...>
        method interleave_iterable (line 46) | constexpr interleave_iterable()
        method interleave_iterable (line 53) | constexpr interleave_iterable() noexcept(std::is_nothrow_default_c...
        method interleave_iterable (line 59) | constexpr interleave_iterable(Is&&... iterables) : _iterables{ std...
        method size (line 64) | [[nodiscard]] constexpr size_t size() const
        method LZ_NODISCARD (line 73) | LZ_NODISCARD constexpr enable_if_t<T::value, size_t> size() const {
        method iterator (line 79) | iterator begin() const {
        method end (line 85) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 97) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 102) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<R, this_sentinel> end...
        method LZ_NODISCARD (line 109) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 friend interleave_iterable<remove...

FILE: include/Lz/detail/iterables/intersection.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class intersection_iterable (line 13) | class intersection_iterable : public lazy_view {
        method intersection_iterable (line 30) | constexpr intersection_iterable()
        method intersection_iterable (line 40) | constexpr intersection_iterable() noexcept(std::is_nothrow_default...
        method intersection_iterable (line 48) | constexpr intersection_iterable(I&& iterable, I2&& iterable2, Bina...
        method iterator (line 54) | iterator begin() const {
        method end (line 60) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 72) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 77) | LZ_NODISCARD constexpr enable_if_t<R, default_sentinel_t> end() co...

FILE: include/Lz/detail/iterables/join_where.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class join_where_iterable (line 14) | class join_where_iterable : public lazy_view {
        method join_where_iterable (line 34) | constexpr join_where_iterable()
        method join_where_iterable (line 47) | constexpr join_where_iterable() noexcept(std::is_nothrow_default_c...
        method join_where_iterable (line 57) | constexpr join_where_iterable(I&& iterable, I2&& iterable2, Select...
        method iterator (line 65) | constexpr iterator begin() const {
        method end (line 69) | end() const noexcept {

FILE: include/Lz/detail/iterables/loop.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class loop_iterable (line 13) | class loop_iterable
      class loop_iterable<Iterable, false /* is inf loop */> (line 16) | class loop_iterable<Iterable, false /* is inf loop */> : public lazy...
        method loop_iterable (line 32) | constexpr loop_iterable()
        method loop_iterable (line 39) | constexpr loop_iterable() noexcept(std::is_nothrow_default_constru...
        method loop_iterable (line 45) | constexpr loop_iterable(I&& iterable, const typename iterator::dif...
        method size (line 52) | [[nodiscard]] constexpr size_t size() const
        method LZ_NODISCARD (line 61) | LZ_NODISCARD constexpr enable_if_t<is_sized<I>::value, size_t> siz...
        method iterator (line 67) | iterator begin() const {
        method end (line 78) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 90) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 95) | LZ_NODISCARD constexpr enable_if_t<R, default_sentinel_t> end() co...
      class loop_iterable<Iterable, true /* is inf loop */> (line 103) | class loop_iterable<Iterable, true /* is inf loop */> : public lazy_...
        method loop_iterable (line 113) | constexpr loop_iterable()
        method loop_iterable (line 120) | constexpr loop_iterable() noexcept(std::is_nothrow_default_constru...
        method loop_iterable (line 126) | explicit constexpr loop_iterable(I&& iterable) : _iterable{ std::f...
        method iterator (line 129) | iterator begin() const {
        method end (line 133) | end() const {

FILE: include/Lz/detail/iterables/map.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class map_iterable (line 14) | class map_iterable : public lazy_view {
        method map_iterable (line 34) | constexpr map_iterable()
        method map_iterable (line 42) | constexpr map_iterable() noexcept(std::is_nothrow_default_construc...
        method map_iterable (line 49) | constexpr map_iterable(I&& iterable, UnaryOp unary_op) :
        method size (line 56) | [[nodiscard]] constexpr size_t size() const
        method LZ_NODISCARD (line 65) | LZ_NODISCARD constexpr enable_if_t<is_sized<I>::value, size_t> siz...
        method iterator (line 71) | iterator begin() const {
        method end (line 78) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 90) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 95) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<R, sentinel> end() co...

FILE: include/Lz/detail/iterables/pairwise.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      class pairwise_iterable (line 17) | class pairwise_iterable : public lazy_view {
        method pairwise_iterable (line 37) | constexpr pairwise_iterable()
        method pairwise_iterable (line 44) | constexpr pairwise_iterable() noexcept(std::is_nothrow_default_con...
      function size (line 58) | [[nodiscard]] constexpr size_t size() const
      function LZ_NODISCARD (line 68) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<S, size_t> size() const {
      function iterator (line 77) | [[nodiscard]] constexpr iterator begin() const {
      function end (line 109) | [[nodiscard]] constexpr auto end() const {
      function LZ_NODISCARD (line 125) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_ra_tag<Cat>::value, ...
      function LZ_NODISCARD (line 132) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14
      function LZ_NODISCARD (line 142) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14
      function LZ_NODISCARD (line 159) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<
      function LZ_NODISCARD (line 173) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<R, default_sentinel_t> ...
      function LZ_NODISCARD (line 178) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_ra_tag<Cat>::value &...
      function LZ_NODISCARD (line 184) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!is_ra_tag<Cat>::value ...

FILE: include/Lz/detail/iterables/random.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      class random_iterable (line 12) | class random_iterable : public lazy_view {
        method random_iterable (line 18) | constexpr random_iterable(const random_iterable&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 19) | LZ_CONSTEXPR_CXX_14 random_iterable& operator=(const random_iterab...
        method random_iterable (line 27) | constexpr random_iterable()
        method random_iterable (line 34) | constexpr random_iterable() noexcept(std::is_nothrow_default_const...
        method random_iterable (line 39) | constexpr random_iterable(const Distribution& distribution, Genera...
        method LZ_NODISCARD (line 45) | LZ_NODISCARD constexpr size_t size() const noexcept{
        method LZ_NODISCARD (line 49) | LZ_NODISCARD constexpr iterator begin() const {
        method end (line 55) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 67) | LZ_NODISCARD constexpr enable_if_t<!B, iterator> end() const {
        method LZ_NODISCARD (line 72) | LZ_NODISCARD constexpr enable_if_t<B, default_sentinel_t> end() co...

FILE: include/Lz/detail/iterables/range.hpp
  type lz (line 9) | namespace lz {
    type detail (line 10) | namespace detail {
      class range_iterable (line 12) | class range_iterable
      class range_iterable<Arithmetic, true /* step wise */> (line 15) | class range_iterable<Arithmetic, true /* step wise */> : public lazy...
        method range_iterable (line 26) | constexpr range_iterable() noexcept = default;
        method LZ_CONSTEXPR_CXX_14 (line 30) | LZ_CONSTEXPR_CXX_14 range_iterable(const Arithmetic start, const A...
        method LZ_CONSTEXPR_CXX_14 (line 62) | LZ_CONSTEXPR_CXX_14 range_iterable(const Arithmetic start, const A...
        method size (line 72) | [[nodiscard]] constexpr size_t size() const noexcept {
        method LZ_NODISCARD (line 87) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<std::is_floating_poin...
        method LZ_NODISCARD (line 94) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!std::is_floating_poi...
        method LZ_NODISCARD (line 101) | LZ_NODISCARD constexpr iterator begin() const noexcept {
        method LZ_NODISCARD (line 105) | LZ_NODISCARD constexpr iterator end() const noexcept {
      class range_iterable<Arithmetic, false /* step wise */> (line 111) | class range_iterable<Arithmetic, false /* step wise */> : public laz...
        method range_iterable (line 121) | constexpr range_iterable() noexcept = default;
        method LZ_CONSTEXPR_CXX_14 (line 123) | LZ_CONSTEXPR_CXX_14 range_iterable(const Arithmetic start, const A...
        method size (line 129) | size_t size() const noexcept {
        method LZ_NODISCARD (line 143) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<std::is_floating_poin...
        method LZ_NODISCARD (line 150) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!std::is_floating_poi...
        method LZ_NODISCARD (line 156) | LZ_NODISCARD constexpr iterator begin() const noexcept {
        method LZ_NODISCARD (line 160) | LZ_NODISCARD constexpr iterator end() const noexcept {

FILE: include/Lz/detail/iterables/regex_split.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class regex_split_iterable (line 14) | class regex_split_iterable : public lazy_view {
        method regex_split_iterable (line 26) | constexpr regex_split_iterable()
        method regex_split_iterable (line 34) | constexpr regex_split_iterable() noexcept(std::is_nothrow_default_...
        method regex_split_iterable (line 40) | constexpr regex_split_iterable(RegexTokenIter begin, RegexTokenSen...
        method LZ_NODISCARD (line 45) | LZ_NODISCARD constexpr iterator begin() const {
        method LZ_NODISCARD (line 49) | LZ_NODISCARD constexpr sentinel end() const {

FILE: include/Lz/detail/iterables/repeat.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class repeat_iterable (line 14) | class repeat_iterable
      class repeat_iterable<T, false> (line 17) | class repeat_iterable<T, false> : public lazy_view {
        method repeat_iterable (line 28) | constexpr repeat_iterable()
        method repeat_iterable (line 35) | constexpr repeat_iterable() noexcept(std::is_nothrow_default_const...
        method repeat_iterable (line 40) | constexpr repeat_iterable(T value, const ptrdiff_t amount) : _valu...
        method LZ_NODISCARD (line 43) | LZ_NODISCARD constexpr size_t size() const noexcept {
        method LZ_NODISCARD (line 47) | LZ_NODISCARD constexpr iterator begin() const {
        method end (line 51) | end() const noexcept {
      class repeat_iterable<T, true> (line 57) | class repeat_iterable<T, true> : public lazy_view {
        method repeat_iterable (line 67) | constexpr repeat_iterable()
        method repeat_iterable (line 74) | constexpr repeat_iterable() noexcept(std::is_nothrow_default_const...
        method repeat_iterable (line 79) | explicit constexpr repeat_iterable(T value) : _value{ std::forward...
        method LZ_NODISCARD (line 82) | LZ_NODISCARD constexpr iterator begin() const {
        method end (line 86) | end() const noexcept {

FILE: include/Lz/detail/iterables/reverse.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      class reverse_iterable (line 17) | class reverse_iterable : public lazy_view {
        method reverse_iterable (line 30) | constexpr reverse_iterable()
        method reverse_iterable (line 37) | constexpr reverse_iterable() noexcept(std::is_nothrow_default_cons...
        method reverse_iterable (line 45) | explicit constexpr reverse_iterable(I&& iterable) : _iterable{ std...
        method size (line 50) | [[nodiscard]] constexpr size_t size() const
        method LZ_NODISCARD (line 59) | LZ_NODISCARD constexpr enable_if_t<is_sized<I>::value, size_t> siz...
        method iterator (line 67) | [[nodiscard]] constexpr iterator begin() const {
        method iterator (line 85) | [[nodiscard]] constexpr iterator end() const {
        method LZ_NODISCARD (line 103) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<C && has_sentinel<Ite...
        method LZ_NODISCARD (line 109) | LZ_NODISCARD constexpr enable_if_t<C && !has_sentinel<Iterable>::v...
        method LZ_NODISCARD (line 114) | LZ_NODISCARD constexpr enable_if_t<!C && has_sentinel<Iterable>::v...
        method LZ_NODISCARD (line 119) | LZ_NODISCARD constexpr enable_if_t<!C && !has_sentinel<Iterable>::...
        method LZ_NODISCARD (line 125) | LZ_NODISCARD LZ_CONSTEXPR_CXX_17 enable_if_t<!C, iterator> end() c...
        method LZ_NODISCARD (line 130) | LZ_NODISCARD constexpr enable_if_t<C, iterator> end() const {

FILE: include/Lz/detail/iterables/rotate.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class rotate_iterable (line 15) | class rotate_iterable : public lazy_view {
        method rotate_iterable (line 36) | constexpr rotate_iterable()
        method rotate_iterable (line 44) | constexpr rotate_iterable() noexcept(std::is_nothrow_default_const...
        method size (line 59) | constexpr size_t size() const
        method LZ_NODISCARD (line 72) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_sized<I>::value, s...
        method iterator (line 82) | iterator begin() const {
        method end (line 88) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 100) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 105) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<R, sentinel> end() co...

FILE: include/Lz/detail/iterables/split.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class split_iterable (line 14) | class split_iterable
      class split_iterable<ValueType, Iterable, Iterable2, enable_if_t<is_iterable<Iterable2>::value>> (line 17) | class split_iterable<ValueType, Iterable, Iterable2, enable_if_t<is_...
        method split_iterable (line 29) | constexpr split_iterable()
        method split_iterable (line 37) | constexpr split_iterable() noexcept(std::is_nothrow_default_constr...
        method split_iterable (line 44) | constexpr split_iterable(I&& iterable, I2&& delimiter) :
        method iterator (line 49) | iterator begin() const {
        method end (line 53) | end() const noexcept {
      class split_iterable<ValueType, Iterable, T, enable_if_t<!is_iterable<T>::value>> (line 59) | class split_iterable<ValueType, Iterable, T, enable_if_t<!is_iterabl...
        method split_iterable (line 70) | constexpr split_iterable()
        method split_iterable (line 78) | constexpr split_iterable() noexcept(std::is_nothrow_default_constr...
        method split_iterable (line 85) | constexpr split_iterable(I&& iterable, T delimiter) :
        method iterator (line 90) | iterator begin() const {
        method end (line 94) | end() const noexcept {

FILE: include/Lz/detail/iterables/take.hpp
  type lz (line 15) | namespace lz {
    type detail (line 16) | namespace detail {
      class take_iterable (line 18) | class take_iterable
      class take_iterable<Iterator, enable_if_t<!is_iterable<Iterator>::value>> (line 21) | class take_iterable<Iterator, enable_if_t<!is_iterable<Iterator>::va...
        method take_iterable (line 34) | constexpr take_iterable()
        method take_iterable (line 41) | constexpr take_iterable() {
        method take_iterable (line 46) | constexpr take_iterable(Iterator it, const typename iterator::diff...
        method LZ_NODISCARD (line 49) | LZ_NODISCARD constexpr size_t size() const noexcept {
        method LZ_NODISCARD (line 53) | LZ_NODISCARD constexpr iterator begin() const {
        method end (line 60) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 72) | LZ_NODISCARD constexpr enable_if_t<is_bidi_tag<I>::value, iterator...
        method LZ_NODISCARD (line 77) | LZ_NODISCARD constexpr enable_if_t<!is_bidi_tag<I>::value, default...
      class take_iterable<Iterable, enable_if_t<is_iterable<Iterable>::value>> (line 85) | class take_iterable<Iterable, enable_if_t<is_iterable<Iterable>::val...
        method take_iterable (line 98) | constexpr take_iterable()
        method take_iterable (line 105) | constexpr take_iterable() {
        method take_iterable (line 111) | constexpr take_iterable(I&& iterable, const diff_type<iterator> n)...
        method size (line 116) | [[nodiscard]] constexpr size_t size() const
        method LZ_NODISCARD (line 125) | LZ_NODISCARD constexpr enable_if_t<is_sized<I>::value, size_t> siz...
        method LZ_NODISCARD (line 131) | LZ_NODISCARD constexpr iterator begin() const {
        method LZ_NODISCARD (line 135) | LZ_NODISCARD constexpr iterator end() const {

FILE: include/Lz/detail/iterables/take_every.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      class take_every_iterable (line 27) | class take_every_iterable : public lazy_view {
        method take_every_iterable (line 49) | constexpr take_every_iterable()
        method take_every_iterable (line 56) | constexpr take_every_iterable() noexcept(std::is_nothrow_default_c...
      function size (line 71) | [[nodiscard]] constexpr size_t size() const
      function LZ_NODISCARD (line 89) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_sized<I>::value, siz...
      function iterator (line 106) | [[nodiscard]] constexpr iterator begin() const {
      function LZ_NODISCARD (line 122) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!is_bidi_tag<I>::value,...
      function LZ_NODISCARD (line 128) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<std::is_same<I, std::bi...
      function LZ_NODISCARD (line 135) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_ra_tag<I>::value, it...
      function end (line 145) | [[nodiscard]] constexpr auto end() const {
      function LZ_NODISCARD (line 160) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_ra_tag<I>::value && ...
      function LZ_NODISCARD (line 165) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14
      function LZ_NODISCARD (line 173) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<R, default_sentinel_t> ...

FILE: include/Lz/detail/iterables/take_while.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class take_while_iterable (line 14) | class take_while_iterable : public lazy_view {
        method take_while_iterable (line 34) | constexpr take_while_iterable()
        method take_while_iterable (line 42) | constexpr take_while_iterable() noexcept(std::is_nothrow_default_c...
        method take_while_iterable (line 49) | constexpr take_while_iterable(I&& iterable, UnaryPredicate unary_p...
        method LZ_CONSTEXPR_CXX_14 (line 54) | LZ_CONSTEXPR_CXX_14 iterator begin() const {
        method end (line 60) | [[nodiscard]] constexpr auto end() const {
        method LZ_CONSTEXPR_CXX_14 (line 72) | LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() const {
        method end (line 77) | constexpr enable_if_t<R, default_sentinel_t> end() const noexcept {

FILE: include/Lz/detail/iterables/unique.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class unique_iterable (line 14) | class unique_iterable : public lazy_view {
        method unique_iterable (line 33) | constexpr unique_iterable()
        method unique_iterable (line 41) | constexpr unique_iterable() noexcept(std::is_nothrow_default_const...
        method unique_iterable (line 48) | constexpr unique_iterable(I&& iterable, BinaryPredicate compare) :
        method iterator (line 53) | iterator begin() const {
        method end (line 59) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 71) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 76) | LZ_NODISCARD constexpr enable_if_t<R, default_sentinel_t> end() co...

FILE: include/Lz/detail/iterables/zip.hpp
  type lz (line 16) | namespace lz {
    type detail (line 17) | namespace detail {
      class zip_iterable (line 19) | class zip_iterable : public lazy_view {
        method LZ_NODISCARD (line 26) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 size_t size(index_sequence<I...>)...
        method concat_iterables (line 31) | static zip_iterable<remove_ref_t<Iterable2>, Iterables...>
        method zip_iterable (line 51) | constexpr zip_iterable()
        method zip_iterable (line 58) | constexpr zip_iterable() noexcept(std::is_nothrow_default_construc...
        method size (line 69) | constexpr size_t size() const
        method LZ_NODISCARD (line 78) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<S, size_t> size() con...
        method iterator (line 86) | [[nodiscard]] constexpr iterator begin() const {
        method end (line 90) | [[nodiscard]] constexpr auto end() const {
        method iterator (line 101) | iterator begin() const {
        method LZ_NODISCARD (line 106) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!R, iterator> end() c...
        method LZ_NODISCARD (line 111) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<R, sentinel> end() co...
        method LZ_NODISCARD (line 118) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 friend zip_iterable<remove_ref_t<...

FILE: include/Lz/detail/iterables/zip_longest.hpp
  type lz (line 12) | namespace lz {
    type detail (line 13) | namespace detail {
      class zip_longest_iterable (line 15) | class zip_longest_iterable : public lazy_view {
        method zip_longest_iterable (line 36) | constexpr zip_longest_iterable()
        method zip_longest_iterable (line 43) | constexpr zip_longest_iterable() noexcept(std::is_nothrow_default_...
        method LZ_NODISCARD (line 49) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 size_t size(index_sequence<I...>)...
        method concat_iterables (line 54) | static zip_longest_iterable<remove_ref_t<Iterable2>, Iterables...>
        method size (line 66) | size_t size() const
        method LZ_NODISCARD (line 75) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<S, size_t> size() con...
        method iterator (line 83) | [[nodiscard]] constexpr iterator begin() const {
        method end (line 93) | [[nodiscard]] constexpr auto end() const {
        method LZ_NODISCARD (line 106) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!is_bidi_tag<C>::valu...
        method LZ_NODISCARD (line 111) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<is_bidi_tag<C>::value...
        method LZ_NODISCARD (line 117) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<!return_sentinel && i...
        method LZ_NODISCARD (line 123) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 enable_if_t<R, default_sentinel_t...
        method LZ_NODISCARD (line 130) | LZ_NODISCARD LZ_CONSTEXPR_CXX_14 friend zip_longest_iterable<remov...

FILE: include/Lz/detail/iterator.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      type iterator (line 14) | struct iterator
      type iterator<Derived, Reference, Pointer, DifferenceType, std::input_iterator_tag, S> (line 17) | struct iterator<Derived, Reference, Pointer, DifferenceType, std::in...
        method LZ_CONSTEXPR_CXX_14 (line 26) | LZ_CONSTEXPR_CXX_14 Derived& operator++() {
        method LZ_CONSTEXPR_CXX_14 (line 31) | LZ_CONSTEXPR_CXX_14 Derived operator++(int) {
        method LZ_NODISCARD (line 41) | LZ_NODISCARD constexpr Reference operator*() const {
        method Reference (line 45) | Reference operator*() {
        method LZ_NODISCARD (line 49) | LZ_NODISCARD constexpr Pointer operator->() const {
        method LZ_NODISCARD (line 53) | LZ_NODISCARD constexpr bool operator==(const sentinel& s) const {
        method LZ_NODISCARD (line 57) | LZ_NODISCARD constexpr bool operator!=(const sentinel& s) const {
      type iterator<Derived, Reference, Pointer, DifferenceType, std::forward_iterator_tag, S> (line 71) | struct iterator<Derived, Reference, Pointer, DifferenceType, std::fo...
      type iterator<Derived, Reference, Pointer, DifferenceType, std::bidirectional_iterator_tag, S> (line 77) | struct iterator<Derived, Reference, Pointer, DifferenceType, std::bi...
        method LZ_CONSTEXPR_CXX_14 (line 86) | LZ_CONSTEXPR_CXX_14 Derived& operator--() {
        method LZ_CONSTEXPR_CXX_14 (line 91) | LZ_CONSTEXPR_CXX_14 Derived operator--(int) {
      type iterator<Derived, Reference, Pointer, DifferenceType, std::random_access_iterator_tag, S> (line 103) | struct iterator<Derived, Reference, Pointer, DifferenceType, std::ra...
        method LZ_CONSTEXPR_CXX_14 (line 107) | LZ_CONSTEXPR_CXX_14 Derived& operator+=(const DifferenceType n) {
        method LZ_CONSTEXPR_CXX_14 (line 112) | LZ_CONSTEXPR_CXX_14 Derived operator+(const DifferenceType n) const {
        method DifferenceType (line 118) | DifferenceType operator-(const Derived& a, const Derived& d) {
        method Derived (line 126) | Derived operator-(const DifferenceType n) const {
        method LZ_CONSTEXPR_CXX_14 (line 132) | LZ_CONSTEXPR_CXX_14 Derived& operator-=(const DifferenceType n) {
        method LZ_NODISCARD (line 137) | LZ_NODISCARD constexpr Reference operator[](DifferenceType n) const {
        method LZ_NODISCARD (line 157) | LZ_NODISCARD constexpr bool operator<(const S& s) const {
        method LZ_NODISCARD (line 161) | LZ_NODISCARD constexpr bool operator>(const S& s) const {
        method LZ_NODISCARD (line 165) | LZ_NODISCARD constexpr bool operator<=(const S& s) const {
        method LZ_NODISCARD (line 169) | LZ_NODISCARD constexpr bool operator>=(const S& s) const {
      type iterator<Derived, Reference, Pointer, DifferenceType, std::contiguous_iterator_tag, S> (line 177) | struct iterator<Derived, Reference, Pointer, DifferenceType, std::co...

FILE: include/Lz/detail/iterators/any_iterable/any_iterator_impl.hpp
  type lz (line 12) | namespace lz {
    type detail (line 13) | namespace detail {
      class any_iterator_impl (line 15) | class any_iterator_impl
      class any_iterator_impl<Iter, S, T, Reference, std::forward_iterator_tag, DiffType> (line 18) | class any_iterator_impl<Iter, S, T, Reference, std::forward_iterator...
        method any_iterator_impl (line 34) | constexpr any_iterator_impl(const any_iterator_impl&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 35) | LZ_CONSTEXPR_CXX_14 any_iterator_impl& operator=(const any_iterato...
        method any_iterator_impl (line 39) | constexpr any_iterator_impl()
        method any_iterator_impl (line 46) | constexpr any_iterator_impl() noexcept(std::is_nothrow_default_con...
        method any_iterator_impl (line 51) | constexpr any_iterator_impl(Iter iter) : _iter{ std::move(iter) } {
        method any_iterator_impl (line 56) | constexpr any_iterator_impl(S s)
        method any_iterator_impl (line 61) | constexpr any_iterator_impl(common_iterator<Iter, S> iter)
        method any_iterator_impl (line 69) | constexpr any_iterator_impl(S s) : _iter{ std::move(s) } {
        method any_iterator_impl (line 73) | constexpr any_iterator_impl(common_iterator<Iter, S> iter) : _iter...
        method reference (line 80) | reference dereference() override {
        method reference (line 84) | reference dereference() const override {
        method pointer (line 88) | pointer arrow() override {
        method pointer (line 92) | pointer arrow() const override {
        method increment (line 96) | void increment() override {
        method eq (line 100) | bool eq(const any_iter_base& other) const override {
        method clone (line 104) | detail::unique_ptr<any_iter_base> clone() const override {
      class any_iterator_impl<Iter, S, T, Reference, std::bidirectional_iterator_tag, DiffType> (line 110) | class any_iterator_impl<Iter, S, T, Reference, std::bidirectional_it...
        method any_iterator_impl (line 126) | constexpr any_iterator_impl(const any_iterator_impl&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 127) | LZ_CONSTEXPR_CXX_14 any_iterator_impl& operator=(const any_iterato...
        method any_iterator_impl (line 131) | constexpr any_iterator_impl()
        method any_iterator_impl (line 138) | constexpr any_iterator_impl() noexcept(std::is_nothrow_default_con...
        method any_iterator_impl (line 143) | constexpr any_iterator_impl(Iter iter) : _iter{ std::move(iter) } {
        method any_iterator_impl (line 148) | constexpr any_iterator_impl(S s)
        method any_iterator_impl (line 153) | constexpr any_iterator_impl(common_iterator<Iter, S> iter)
        method any_iterator_impl (line 161) | constexpr any_iterator_impl(S iter) : _iter{ std::move(iter) } {
        method any_iterator_impl (line 165) | constexpr any_iterator_impl(common_iterator<Iter, S> iter) : _iter...
        method reference (line 172) | reference dereference() override {
        method reference (line 176) | reference dereference() const override {
        method pointer (line 180) | pointer arrow() override {
        method pointer (line 184) | pointer arrow() const override {
        method increment (line 188) | void increment() override {
        method decrement (line 192) | void decrement() override {
        method eq (line 196) | bool eq(const any_iter_base& other) const override {
        method clone (line 200) | detail::unique_ptr<any_iter_base> clone() const override {
      class any_iterator_impl<Iter, S, T, Reference, std::random_access_iterator_tag, DiffType> (line 206) | class any_iterator_impl<Iter, S, T, Reference, std::random_access_it...
        method any_iterator_impl (line 222) | constexpr any_iterator_impl(const any_iterator_impl&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 223) | LZ_CONSTEXPR_CXX_14 any_iterator_impl& operator=(const any_iterato...
        method any_iterator_impl (line 227) | constexpr any_iterator_impl()
        method any_iterator_impl (line 234) | constexpr any_iterator_impl() noexcept(std::is_nothrow_default_con...
        method any_iterator_impl (line 239) | constexpr any_iterator_impl(Iter iter) : _iter{ std::move(iter) } {
        method any_iterator_impl (line 244) | constexpr any_iterator_impl(S s)
        method any_iterator_impl (line 249) | constexpr any_iterator_impl(common_iterator<Iter, S> iter)
        method any_iterator_impl (line 257) | constexpr any_iterator_impl(S iter) : _iter{ std::move(iter) } {
        method any_iterator_impl (line 261) | constexpr any_iterator_impl(common_iterator<Iter, S> iter) : _iter...
        method reference (line 268) | reference dereference() override {
        method reference (line 272) | reference dereference() const override {
        method pointer (line 276) | pointer arrow() override {
        method pointer (line 280) | pointer arrow() const override {
        method increment (line 284) | void increment() override {
        method decrement (line 288) | void decrement() override {
        method eq (line 292) | bool eq(const any_iter_base& other) const override {
        method plus_is (line 296) | void plus_is(DiffType n) override {
        method DiffType (line 300) | DiffType difference(const any_iter_base& other) const override {
        method clone (line 304) | detail::unique_ptr<any_iter_base> clone() const override {

FILE: include/Lz/detail/iterators/any_iterable/iterator_base.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      type iterator_base (line 13) | struct iterator_base
      type iterator_base<Reference, std::forward_iterator_tag, DiffType> (line 16) | struct iterator_base<Reference, std::forward_iterator_tag, DiffType> {
      type iterator_base<Reference, std::bidirectional_iterator_tag, DiffType> (line 35) | struct iterator_base<Reference, std::bidirectional_iterator_tag, Dif...
      type iterator_base<Reference, std::random_access_iterator_tag, DiffType> (line 56) | struct iterator_base<Reference, std::random_access_iterator_tag, Dif...

FILE: include/Lz/detail/iterators/as_iterator.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class as_iterator_sentinel (line 14) | class as_iterator_sentinel {
        method as_iterator_sentinel (line 23) | explicit constexpr as_iterator_sentinel(T v) noexcept(std::is_noth...
        method as_iterator_sentinel (line 28) | constexpr as_iterator_sentinel()
        method as_iterator_sentinel (line 33) | constexpr as_iterator_sentinel() noexcept(std::is_nothrow_default_...
      class as_iterator_iterator (line 39) | class as_iterator_iterator : public iterator<as_iterator_iterator<It...
        method as_iterator_iterator (line 49) | constexpr as_iterator_iterator(const as_iterator_iterator&) = defa...
        method LZ_CONSTEXPR_CXX_14 (line 50) | LZ_CONSTEXPR_CXX_14 as_iterator_iterator& operator=(const as_itera...
        method as_iterator_iterator (line 54) | constexpr as_iterator_iterator()
        method as_iterator_iterator (line 61) | constexpr as_iterator_iterator() noexcept(std::is_nothrow_default_...
        method as_iterator_iterator (line 66) | explicit constexpr as_iterator_iterator(Iterator it) : _iterator{ ...
        method LZ_CONSTEXPR_CXX_14 (line 69) | LZ_CONSTEXPR_CXX_14 as_iterator_iterator& operator=(const as_itera...
        method reference (line 74) | constexpr reference dereference() const {
        method pointer (line 78) | constexpr pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 82) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 86) | LZ_CONSTEXPR_CXX_14 void decrement() {
        method difference (line 90) | difference(const as_iterator_iterator& other) const {
        method LZ_CONSTEXPR_CXX_14 (line 94) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type& n) {
        method LZ_CONSTEXPR_CXX_14 (line 98) | LZ_CONSTEXPR_CXX_14 bool eq(const as_iterator_iterator& other) con...
        method LZ_CONSTEXPR_CXX_14 (line 102) | LZ_CONSTEXPR_CXX_14 bool eq(const as_iterator_sentinel<S>& other) ...

FILE: include/Lz/detail/iterators/c_string.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class c_string_iterator (line 13) | class c_string_iterator
        method c_string_iterator (line 24) | constexpr c_string_iterator() noexcept = default;
        method c_string_iterator (line 25) | constexpr c_string_iterator(const c_string_iterator&) noexcept = d...
        method LZ_CONSTEXPR_CXX_14 (line 26) | LZ_CONSTEXPR_CXX_14 c_string_iterator& operator=(const c_string_it...
        method c_string_iterator (line 28) | explicit constexpr c_string_iterator(C* it) noexcept : _it{ it } {
        method LZ_CONSTEXPR_CXX_14 (line 31) | LZ_CONSTEXPR_CXX_14 c_string_iterator& operator=(default_sentinel_...
        method LZ_CONSTEXPR_CXX_14 (line 36) | LZ_CONSTEXPR_CXX_14 reference dereference() const noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 41) | LZ_CONSTEXPR_CXX_14 pointer arrow() const noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 46) | LZ_CONSTEXPR_CXX_14 void increment() noexcept {
        method eq (line 52) | constexpr bool eq(const c_string_iterator& other) const noexcept {
        method eq (line 56) | constexpr bool eq(default_sentinel_t) const noexcept {

FILE: include/Lz/detail/iterators/cached_reverse.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      class cached_reverse_iterator (line 17) | class cached_reverse_iterator
        method cached_reverse_iterator (line 32) | constexpr cached_reverse_iterator(const cached_reverse_iterator&) ...
        method LZ_CONSTEXPR_CXX_14 (line 33) | LZ_CONSTEXPR_CXX_14 cached_reverse_iterator& operator=(const cache...
        method cached_reverse_iterator (line 37) | constexpr cached_reverse_iterator()
        method cached_reverse_iterator (line 44) | constexpr cached_reverse_iterator() noexcept(std::is_nothrow_defau...
    function LZ_CONSTEXPR_CXX_14 (line 59) | LZ_CONSTEXPR_CXX_14 cached_reverse_iterator& operator=(default_sentine...
    function LZ_CONSTEXPR_CXX_14 (line 64) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
    function LZ_CONSTEXPR_CXX_14 (line 69) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
    function LZ_CONSTEXPR_CXX_14 (line 73) | LZ_CONSTEXPR_CXX_14 void increment() {
    function LZ_CONSTEXPR_CXX_14 (line 81) | LZ_CONSTEXPR_CXX_14 void decrement() {
    function LZ_CONSTEXPR_CXX_14 (line 86) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type n) {
    function LZ_CONSTEXPR_CXX_14 (line 93) | LZ_CONSTEXPR_CXX_14 difference_type difference(const cached_reverse_it...
    function difference_type (line 98) | constexpr difference_type difference(default_sentinel_t) const {
    function eq (line 102) | constexpr bool eq(const cached_reverse_iterator& other) const {
    function eq (line 106) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/cartesian_product.hpp
  type lz (line 16) | namespace lz {
    type detail (line 17) | namespace detail {
      type tuple_iter_types (line 20) | struct tuple_iter_types
      function next (line 54) | constexpr void next() {
      function previous (line 66) | constexpr void previous() {
      function operator_plus_impl (line 79) | constexpr void operator_plus_impl(const difference_type offset) {
      function LZ_CONSTEXPR_CXX_14 (line 110) | LZ_CONSTEXPR_CXX_14 enable_if_t<I == 0> next() {
      function LZ_CONSTEXPR_CXX_14 (line 116) | LZ_CONSTEXPR_CXX_14 enable_if_t<(I > 0)> next() {
      function LZ_CONSTEXPR_CXX_14 (line 126) | LZ_CONSTEXPR_CXX_14 enable_if_t<I == 0> previous() {
      function LZ_CONSTEXPR_CXX_14 (line 133) | LZ_CONSTEXPR_CXX_14 enable_if_t<(I > 0)> previous() {
      function LZ_CONSTEXPR_CXX_14 (line 144) | LZ_CONSTEXPR_CXX_14 enable_if_t<I == 0> operator_plus_impl(const dif...
      function LZ_CONSTEXPR_CXX_14 (line 152) | LZ_CONSTEXPR_CXX_14 enable_if_t<(I > 0)> operator_plus_impl(const di...
      function LZ_CONSTEXPR_CXX_14 (line 176) | LZ_CONSTEXPR_CXX_14 reference dereference(index_sequence<Is...>) con...
      function iter_compat (line 184) | constexpr void iter_compat(const cartesian_product_iterator& other) ...
      function difference_type (line 194) | constexpr difference_type difference(const cartesian_product_iterato...
      function difference_type (line 207) | constexpr difference_type difference() const {
      function LZ_CONSTEXPR_CXX_14 (line 222) | LZ_CONSTEXPR_CXX_14 enable_if_t<(I >= 0)> iter_compat(const cartesia...
      function LZ_CONSTEXPR_CXX_14 (line 230) | LZ_CONSTEXPR_CXX_14 enable_if_t<(I < 0)> iter_compat(const cartesian...
      function LZ_CONSTEXPR_CXX_14 (line 234) | LZ_CONSTEXPR_CXX_14 enable_if_t<(I > 0), difference_type> difference...
      function LZ_CONSTEXPR_CXX_14 (line 243) | LZ_CONSTEXPR_CXX_14 enable_if_t<I == 0, difference_type> difference(...
      function LZ_CONSTEXPR_CXX_14 (line 249) | LZ_CONSTEXPR_CXX_14 enable_if_t<(I > 0), difference_type> difference...
      function difference (line 257) | constexpr enable_if_t<I == 0, difference_type> difference() const {
      function LZ_CONSTEXPR_CXX_14 (line 267) | LZ_CONSTEXPR_CXX_14 void assign_sentinels(index_sequence<I...>) {
      function cartesian_product_iterator (line 281) | constexpr cartesian_product_iterator()
      function cartesian_product_iterator (line 289) | constexpr cartesian_product_iterator() noexcept(std::is_nothrow_defa...
    function LZ_CONSTEXPR_CXX_14 (line 301) | LZ_CONSTEXPR_CXX_14 cartesian_product_iterator& operator=(default_sent...
    function LZ_CONSTEXPR_CXX_14 (line 306) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
    function LZ_CONSTEXPR_CXX_14 (line 311) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
    function LZ_CONSTEXPR_CXX_14 (line 315) | LZ_CONSTEXPR_CXX_14 void increment() {
    function LZ_CONSTEXPR_CXX_14 (line 320) | LZ_CONSTEXPR_CXX_14 void decrement() {
    function LZ_CONSTEXPR_CXX_14 (line 324) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type n) {
    function LZ_CONSTEXPR_CXX_14 (line 328) | LZ_CONSTEXPR_CXX_14 bool eq(const cartesian_product_iterator& other) c...
    function eq (line 333) | constexpr bool eq(default_sentinel_t) const {
    function LZ_CONSTEXPR_CXX_14 (line 338) | LZ_CONSTEXPR_CXX_14 difference_type difference(const cartesian_product...
    function LZ_CONSTEXPR_CXX_14 (line 343) | LZ_CONSTEXPR_CXX_14 difference_type difference(default_sentinel_t) con...
  type tuple_iter_types<std::tuple<Iterables...>> (line 23) | struct tuple_iter_types<std::tuple<Iterables...>> {

FILE: include/Lz/detail/iterators/chunk_if.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      class chunk_if_iterator (line 16) | class chunk_if_iterator
        method chunk_if_iterator (line 27) | chunk_if_iterator(const chunk_if_iterator&) = default;
        method chunk_if_iterator (line 28) | chunk_if_iterator& operator=(const chunk_if_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 37) | LZ_CONSTEXPR_CXX_14 void find_next() {
        method chunk_if_iterator (line 44) | constexpr chunk_if_iterator()
        method chunk_if_iterator (line 54) | constexpr chunk_if_iterator() noexcept(std::is_nothrow_default_con...
        method LZ_CONSTEXPR_CXX_14 (line 61) | LZ_CONSTEXPR_CXX_14 chunk_if_iterator(Iterator begin, S end, Unary...
        method LZ_CONSTEXPR_CXX_14 (line 74) | LZ_CONSTEXPR_CXX_14 chunk_if_iterator& operator=(default_sentinel_...
        method reference (line 83) | constexpr reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 96) | LZ_CONSTEXPR_CXX_14 enable_if_t<std::is_constructible<V, Iterator,...
        method LZ_CONSTEXPR_CXX_14 (line 103) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std::is_constructible<V, Iterator...
        method LZ_CONSTEXPR_CXX_14 (line 111) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 115) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 138) | LZ_CONSTEXPR_CXX_14 bool eq(const chunk_if_iterator& rhs) const {
        method eq (line 144) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/chunks.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      class chunks_iterator (line 17) | class chunks_iterator
      class chunks_iterator<Iterable, enable_if_t<!is_bidi<iter_t<Iterable>>::value>> (line 20) | class chunks_iterator<Iterable, enable_if_t<!is_bidi<iter_t<Iterable...
        method chunks_iterator (line 35) | constexpr chunks_iterator(const chunks_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 36) | LZ_CONSTEXPR_CXX_14 chunks_iterator& operator=(const chunks_iterat...
        method LZ_CONSTEXPR_CXX_14 (line 44) | LZ_CONSTEXPR_CXX_14 void next_chunk() {
        method chunks_iterator (line 52) | constexpr chunks_iterator()
        method chunks_iterator (line 60) | constexpr chunks_iterator() noexcept(std::is_nothrow_default_const...
      function LZ_CONSTEXPR_CXX_14 (line 79) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
      function LZ_CONSTEXPR_CXX_14 (line 84) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
      function LZ_CONSTEXPR_CXX_14 (line 88) | LZ_CONSTEXPR_CXX_14 void increment() {
      function LZ_CONSTEXPR_CXX_14 (line 94) | LZ_CONSTEXPR_CXX_14 bool eq(const chunks_iterator& rhs) const {
      function eq (line 99) | constexpr bool eq(default_sentinel_t) const {
    class chunks_iterator<Iterable, enable_if_t<is_bidi<iter_t<Iterable>>::value && !is_ra<iter_t<Iterable>>::value>> (line 105) | class chunks_iterator<Iterable, enable_if_t<is_bidi<iter_t<Iterable>>:...
      method LZ_CONSTEXPR_CXX_14 (line 127) | LZ_CONSTEXPR_CXX_14 void next_chunk() {
      method chunks_iterator (line 137) | constexpr chunks_iterator()
      method chunks_iterator (line 145) | constexpr chunks_iterator() noexcept(std::is_nothrow_default_constru...
    function chunks_iterator (line 163) | constexpr chunks_iterator& operator=(default_sentinel_t)
    function LZ_CONSTEXPR_CXX_14 (line 172) | LZ_CONSTEXPR_CXX_14 chunks_iterator& operator=(default_sentinel_t) {
    function reference (line 180) | constexpr reference dereference() const {
    function pointer (line 184) | constexpr pointer arrow() const {
    function LZ_CONSTEXPR_CXX_14 (line 188) | LZ_CONSTEXPR_CXX_14 void increment() {
    function LZ_CONSTEXPR_CXX_14 (line 194) | LZ_CONSTEXPR_CXX_14 void decrement() {
    function LZ_CONSTEXPR_CXX_14 (line 205) | LZ_CONSTEXPR_CXX_14 bool eq(const chunks_iterator& rhs) const {
    function eq (line 211) | constexpr bool eq(default_sentinel_t) const {
  class chunks_iterator<Iterable, enable_if_t<is_ra<iter_t<Iterable>>::value>> (line 217) | class chunks_iterator<Iterable, enable_if_t<is_ra<iter_t<Iterable>>::val...
    method chunks_iterator (line 238) | constexpr chunks_iterator()
    method chunks_iterator (line 246) | constexpr chunks_iterator() noexcept(std::is_nothrow_default_construct...
    method LZ_CONSTEXPR_CXX_14 (line 253) | LZ_CONSTEXPR_CXX_14 chunks_iterator(I&& iterable, iter it, const diffe...
    method LZ_CONSTEXPR_CXX_14 (line 264) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
    method LZ_CONSTEXPR_CXX_14 (line 270) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
    method LZ_CONSTEXPR_CXX_14 (line 274) | LZ_CONSTEXPR_CXX_14 void increment() {
    method LZ_CONSTEXPR_CXX_14 (line 279) | LZ_CONSTEXPR_CXX_14 void decrement() {
    method LZ_CONSTEXPR_CXX_14 (line 292) | LZ_CONSTEXPR_CXX_14 bool eq(const chunks_iterator& rhs) const {
    method eq (line 297) | constexpr bool eq(default_sentinel_t) const {
    method LZ_CONSTEXPR_CXX_14 (line 301) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type offset) {
    method difference (line 326) | difference(const chunks_iterator& other) const {
    method difference (line 335) | difference(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/common.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      class common_iterator (line 18) | class common_iterator : public iterator<common_iterator<Iterator, S>...
        method common_iterator (line 34) | constexpr common_iterator() noexcept = default;
        method common_iterator (line 36) | explicit constexpr common_iterator(const Iterator& iter) : _data{ ...
        method common_iterator (line 39) | explicit constexpr common_iterator(Iterator&& iter) noexcept : _da...
        method common_iterator (line 42) | explicit constexpr common_iterator(const S& sent) : _data{ sent } {
        method common_iterator (line 45) | explicit constexpr common_iterator(S&& sent) noexcept : _data{ std...
        method LZ_CONSTEXPR_CXX_14 (line 48) | LZ_CONSTEXPR_CXX_14 common_iterator& operator=(const Iterator& ite...
        method LZ_CONSTEXPR_CXX_14 (line 53) | LZ_CONSTEXPR_CXX_14 common_iterator& operator=(const S& sent) {
        method LZ_CONSTEXPR_CXX_14 (line 58) | LZ_CONSTEXPR_CXX_14 common_iterator& operator=(Iterator&& iter) no...
        method LZ_CONSTEXPR_CXX_14 (line 63) | LZ_CONSTEXPR_CXX_14 common_iterator& operator=(S&& sent) noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 68) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
        method arrow (line 76) | arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 80) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 88) | LZ_CONSTEXPR_CXX_14 void decrement() {
        method LZ_CONSTEXPR_CXX_14 (line 96) | LZ_CONSTEXPR_CXX_14 bool eq(const common_iterator& rhs) const {

FILE: include/Lz/detail/iterators/concatenate.hpp
  type lz (line 17) | namespace lz {
    type detail (line 18) | namespace detail {
      function LZ_CONSTEXPR_CXX_20 (line 41) | LZ_CONSTEXPR_CXX_20 difference_type minus(index_sequence<I...>, cons...
      function LZ_CONSTEXPR_CXX_20 (line 49) | LZ_CONSTEXPR_CXX_20 difference_type minus(index_sequence<I...>) const {
      function min_is_n (line 59) | constexpr void min_is_n(const difference_type offset) {
      function plus_is_n (line 87) | constexpr void plus_is_n(const difference_type offset) {
      function minus_minus (line 109) | constexpr void minus_minus() {
      function reference (line 127) | constexpr reference deref() const {
      function plus_plus (line 144) | constexpr void plus_plus() {
      function iter_equal_to (line 160) | constexpr bool iter_equal_to(const EndIter& end) const {
      function LZ_CONSTEXPR_CXX_14 (line 174) | LZ_CONSTEXPR_CXX_14 enable_if_t<I != 0> min_is_n(const difference_ty...
      function LZ_CONSTEXPR_CXX_14 (line 195) | LZ_CONSTEXPR_CXX_14 enable_if_t<I == 0> min_is_n(const difference_ty...
      function LZ_CONSTEXPR_CXX_14 (line 203) | LZ_CONSTEXPR_CXX_14 enable_if_t<I != tup_size> plus_is_n(const diffe...
      function LZ_CONSTEXPR_CXX_14 (line 220) | LZ_CONSTEXPR_CXX_14 enable_if_t<I == tup_size> plus_is_n(const diffe...
      function LZ_CONSTEXPR_CXX_14 (line 225) | LZ_CONSTEXPR_CXX_14 enable_if_t<I != 0> minus_minus() {
      function LZ_CONSTEXPR_CXX_14 (line 237) | LZ_CONSTEXPR_CXX_14 enable_if_t<I == 0> minus_minus() {
      function LZ_CONSTEXPR_CXX_14 (line 244) | LZ_CONSTEXPR_CXX_14 enable_if_t<I == tup_size - 1, reference> deref(...
      function LZ_CONSTEXPR_CXX_14 (line 250) | LZ_CONSTEXPR_CXX_14 enable_if_t<I != tup_size - 1, reference> deref(...
      function LZ_CONSTEXPR_CXX_14 (line 261) | LZ_CONSTEXPR_CXX_14 enable_if_t<I != tuple_size<Iterators>::value> p...
      function LZ_CONSTEXPR_CXX_14 (line 272) | LZ_CONSTEXPR_CXX_14 enable_if_t<I == tuple_size<Iterators>::value> p...
      function LZ_CONSTEXPR_CXX_14 (line 276) | LZ_CONSTEXPR_CXX_14 enable_if_t<I != tuple_size<Iterators>::value - ...
      function LZ_CONSTEXPR_CXX_14 (line 283) | LZ_CONSTEXPR_CXX_14 enable_if_t<I == tuple_size<Iterators>::value - ...
      function LZ_CONSTEXPR_CXX_14 (line 291) | LZ_CONSTEXPR_CXX_14 void assign_sentinels(index_sequence<I...>) {
      function concatenate_iterator (line 303) | constexpr concatenate_iterator()
      function concatenate_iterator (line 311) | constexpr concatenate_iterator() noexcept(std::is_nothrow_default_co...
    function LZ_CONSTEXPR_CXX_14 (line 324) | LZ_CONSTEXPR_CXX_14 concatenate_iterator& operator=(default_sentinel_t) {
    function LZ_CONSTEXPR_CXX_14 (line 329) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
    function LZ_CONSTEXPR_CXX_14 (line 334) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
    function LZ_CONSTEXPR_CXX_14 (line 338) | LZ_CONSTEXPR_CXX_14 void increment() {
    function LZ_CONSTEXPR_CXX_14 (line 343) | LZ_CONSTEXPR_CXX_14 void decrement() {
    function LZ_CONSTEXPR_CXX_14 (line 347) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type offset) {
    function LZ_CONSTEXPR_CXX_20 (line 356) | LZ_CONSTEXPR_CXX_20 difference_type difference(const concatenate_itera...
    function LZ_CONSTEXPR_CXX_20 (line 362) | LZ_CONSTEXPR_CXX_20 difference_type difference(default_sentinel_t) con...
    function LZ_CONSTEXPR_CXX_14 (line 366) | LZ_CONSTEXPR_CXX_14 bool eq(const concatenate_iterator& other) const {
    function LZ_CONSTEXPR_CXX_14 (line 372) | LZ_CONSTEXPR_CXX_14 bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/duplicates.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      class duplicates_iterator (line 17) | class duplicates_iterator
      class duplicates_iterator<Iterable, BinaryPredicate, enable_if_t<is_ra<iter_t<Iterable>>::value>> (line 20) | class duplicates_iterator<Iterable, BinaryPredicate, enable_if_t<is_...
        method LZ_CONSTEXPR_CXX_14 (line 40) | LZ_CONSTEXPR_CXX_14 void next() {
        method duplicates_iterator (line 46) | constexpr duplicates_iterator(const duplicates_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 47) | LZ_CONSTEXPR_CXX_14 duplicates_iterator& operator=(const duplicate...
        method duplicates_iterator (line 51) | constexpr duplicates_iterator()
        method duplicates_iterator (line 61) | constexpr duplicates_iterator() noexcept(std::is_nothrow_default_c...
      function LZ_CONSTEXPR_CXX_14 (line 81) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
      function LZ_CONSTEXPR_CXX_14 (line 86) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
      function LZ_CONSTEXPR_CXX_14 (line 90) | LZ_CONSTEXPR_CXX_14 void increment() {
      function LZ_CONSTEXPR_CXX_14 (line 96) | LZ_CONSTEXPR_CXX_14 void decrement() {
      function LZ_CONSTEXPR_CXX_14 (line 108) | LZ_CONSTEXPR_CXX_14 bool eq(const duplicates_iterator& other) const {
      function LZ_CONSTEXPR_CXX_14 (line 113) | LZ_CONSTEXPR_CXX_14 bool eq(default_sentinel_t) const {
    class duplicates_iterator<Iterable, BinaryPredicate, enable_if_t<!is_ra<iter_t<Iterable>>::value>> (line 119) | class duplicates_iterator<Iterable, BinaryPredicate, enable_if_t<!is_r...
      method LZ_CONSTEXPR_CXX_14 (line 140) | LZ_CONSTEXPR_CXX_14 void next() {
      method duplicates_iterator (line 152) | constexpr duplicates_iterator(const duplicates_iterator&) = default;
      method LZ_CONSTEXPR_CXX_14 (line 153) | LZ_CONSTEXPR_CXX_14 duplicates_iterator& operator=(const duplicates_...
      method duplicates_iterator (line 157) | constexpr duplicates_iterator()
      method duplicates_iterator (line 167) | constexpr duplicates_iterator() noexcept(std::is_nothrow_default_con...
    function LZ_CONSTEXPR_CXX_14 (line 188) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
    function LZ_CONSTEXPR_CXX_14 (line 193) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
    function LZ_CONSTEXPR_CXX_14 (line 197) | LZ_CONSTEXPR_CXX_14 void increment() {
    function LZ_CONSTEXPR_CXX_14 (line 203) | LZ_CONSTEXPR_CXX_14 void decrement() {
    function LZ_CONSTEXPR_CXX_14 (line 216) | LZ_CONSTEXPR_CXX_14 bool eq(const duplicates_iterator& other) const {
    function LZ_CONSTEXPR_CXX_14 (line 221) | LZ_CONSTEXPR_CXX_14 bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/enumerate.hpp
  type lz (line 10) | namespace lz {
    type detail (line 11) | namespace detail {
      class enumerate_sentinel (line 14) | class enumerate_sentinel {
        method enumerate_sentinel (line 23) | explicit constexpr enumerate_sentinel(T v) noexcept(std::is_nothro...
        method enumerate_sentinel (line 28) | constexpr enumerate_sentinel()
        method enumerate_sentinel (line 33) | constexpr enumerate_sentinel() noexcept(std::is_nothrow_default_co...
      class enumerate_iterator (line 39) | class enumerate_iterator
      class enumerate_iterator<Iterable, IntType, enable_if_t<is_bidi<iter_t<Iterable>>::value>> (line 42) | class enumerate_iterator<Iterable, IntType, enable_if_t<is_bidi<iter...
        method enumerate_iterator (line 60) | constexpr enumerate_iterator(const enumerate_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 61) | LZ_CONSTEXPR_CXX_14 enumerate_iterator& operator=(const enumerate_...
        method enumerate_iterator (line 65) | constexpr enumerate_iterator()
        method enumerate_iterator (line 73) | constexpr enumerate_iterator() noexcept(std::is_nothrow_default_co...
        method enumerate_iterator (line 80) | constexpr enumerate_iterator(I&& iterable, iter it, const IntType ...
        method LZ_CONSTEXPR_CXX_14 (line 86) | LZ_CONSTEXPR_CXX_14 enumerate_iterator& operator=(enumerate_sentin...
        method LZ_CONSTEXPR_CXX_14 (line 92) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 97) | LZ_CONSTEXPR_CXX_14 void decrement() {
        method reference (line 102) | constexpr reference dereference() const {
        method pointer (line 106) | constexpr pointer arrow() const {
        method eq (line 110) | constexpr bool eq(const enumerate_iterator& other) const {
        method eq (line 114) | constexpr bool eq(enumerate_sentinel<IntType>) const {
        method LZ_CONSTEXPR_CXX_14 (line 118) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type n) {
        method difference_type (line 123) | constexpr difference_type difference(const enumerate_iterator& oth...
        method difference_type (line 127) | constexpr difference_type difference(enumerate_sentinel<IntType>) ...
      class enumerate_iterator<Iterable, IntType, enable_if_t<!is_bidi<iter_t<Iterable>>::value>> (line 133) | class enumerate_iterator<Iterable, IntType, enable_if_t<!is_bidi<ite...
        method enumerate_iterator (line 150) | constexpr enumerate_iterator(const enumerate_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 151) | LZ_CONSTEXPR_CXX_14 enumerate_iterator& operator=(const enumerate_...
        method enumerate_iterator (line 155) | constexpr enumerate_iterator()
        method enumerate_iterator (line 162) | constexpr enumerate_iterator() noexcept(std::is_nothrow_default_co...
        method enumerate_iterator (line 167) | constexpr enumerate_iterator(iter it, const IntType start) : _iter...
        method LZ_CONSTEXPR_CXX_14 (line 170) | LZ_CONSTEXPR_CXX_14 enumerate_iterator& operator=(enumerate_sentin...
        method LZ_CONSTEXPR_CXX_14 (line 175) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 180) | LZ_CONSTEXPR_CXX_14 void decrement() {
        method reference (line 185) | constexpr reference dereference() const {
        method pointer (line 189) | constexpr pointer arrow() const {
        method eq (line 193) | constexpr bool eq(const enumerate_iterator& other) const {
        method eq (line 197) | constexpr bool eq(const enumerate_sentinel<sentinel_t<Iterable>>& ...

FILE: include/Lz/detail/iterators/except.hpp
  type lz (line 16) | namespace lz {
    type detail (line 17) | namespace detail {
      class except_iterator (line 20) | class except_iterator : public iterator<except_iterator<Iterable, It...
        method except_iterator (line 33) | constexpr except_iterator(const except_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 34) | LZ_CONSTEXPR_CXX_14 except_iterator& operator=(const except_iterat...
        method LZ_CONSTEXPR_CXX_14 (line 42) | LZ_CONSTEXPR_CXX_14 void find_next() {
        method except_iterator (line 53) | constexpr except_iterator()
        method except_iterator (line 64) | constexpr except_iterator() noexcept(std::is_nothrow_default_const...
    function LZ_CONSTEXPR_CXX_14 (line 84) | LZ_CONSTEXPR_CXX_14 except_iterator& operator=(default_sentinel_t) {
    function LZ_CONSTEXPR_CXX_14 (line 89) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
    function LZ_CONSTEXPR_CXX_14 (line 94) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
    function LZ_CONSTEXPR_CXX_14 (line 98) | LZ_CONSTEXPR_CXX_14 void increment() {
    function LZ_CONSTEXPR_CXX_14 (line 104) | LZ_CONSTEXPR_CXX_14 void decrement() {
    function LZ_CONSTEXPR_CXX_14 (line 116) | LZ_CONSTEXPR_CXX_14 bool eq(const except_iterator& other) const {
    function eq (line 122) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/exclude.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      function exclude_iterator (line 39) | constexpr exclude_iterator(const exclude_iterator&) = default;
      function LZ_CONSTEXPR_CXX_14 (line 40) | LZ_CONSTEXPR_CXX_14 exclude_iterator& operator=(const exclude_iterat...
      function exclude_iterator (line 44) | constexpr exclude_iterator()
      function exclude_iterator (line 51) | constexpr exclude_iterator() noexcept(std::is_nothrow_default_constr...
    function LZ_CONSTEXPR_CXX_14 (line 73) | LZ_CONSTEXPR_CXX_14 exclude_iterator& operator=(default_sentinel_t) {
    function LZ_CONSTEXPR_CXX_14 (line 84) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_bidi<I>::value, exclude_iterator&> ...
    function LZ_CONSTEXPR_CXX_14 (line 91) | LZ_CONSTEXPR_CXX_14 enable_if_t<!is_bidi<I>::value, exclude_iterator&>...
    function LZ_CONSTEXPR_CXX_14 (line 98) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
    function LZ_CONSTEXPR_CXX_14 (line 103) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
    function LZ_CONSTEXPR_CXX_14 (line 107) | LZ_CONSTEXPR_CXX_14 void increment() {
    function LZ_CONSTEXPR_CXX_14 (line 117) | LZ_CONSTEXPR_CXX_14 void decrement() {
    function LZ_CONSTEXPR_CXX_14 (line 127) | LZ_CONSTEXPR_CXX_14 difference_type difference(const exclude_iterator&...
    function LZ_CONSTEXPR_CXX_14 (line 138) | LZ_CONSTEXPR_CXX_14 difference_type difference(default_sentinel_t) con...
    function LZ_CONSTEXPR_CXX_14 (line 142) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type offset) {
    function LZ_CONSTEXPR_CXX_14 (line 162) | LZ_CONSTEXPR_CXX_14 bool eq(const exclude_iterator& other) const {
    function eq (line 168) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/exclusive_scan.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      class exclusive_scan_iterator (line 17) | class exclusive_scan_iterator : public iterator<exclusive_scan_itera...
        method exclusive_scan_iterator (line 33) | constexpr exclusive_scan_iterator(const exclusive_scan_iterator&) ...
        method LZ_CONSTEXPR_CXX_14 (line 34) | LZ_CONSTEXPR_CXX_14 exclusive_scan_iterator& operator=(const exclu...
        method exclusive_scan_iterator (line 38) | constexpr exclusive_scan_iterator()
        method exclusive_scan_iterator (line 48) | constexpr exclusive_scan_iterator() noexcept(std::is_nothrow_defau...
        method exclusive_scan_iterator (line 56) | constexpr exclusive_scan_iterator(Iterator it, S end, T init, Bina...
        method LZ_CONSTEXPR_CXX_14 (line 64) | LZ_CONSTEXPR_CXX_14 exclusive_scan_iterator& operator=(default_sen...
        method LZ_CONSTEXPR_CXX_14 (line 70) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 75) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 79) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 89) | LZ_CONSTEXPR_CXX_14 bool eq(const exclusive_scan_iterator& other) ...
        method eq (line 94) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/filter.hpp
  type lz (line 15) | namespace lz {
    type detail (line 16) | namespace detail {
      class filter_iterator (line 19) | class filter_iterator
        method filter_iterator (line 32) | constexpr filter_iterator(const filter_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 33) | LZ_CONSTEXPR_CXX_14 filter_iterator& operator=(const filter_iterat...
        method LZ_CONSTEXPR_CXX_14 (line 35) | LZ_CONSTEXPR_CXX_14 void find() {
        method filter_iterator (line 47) | constexpr filter_iterator()
        method filter_iterator (line 57) | constexpr filter_iterator() noexcept(std::is_nothrow_default_const...
      function LZ_CONSTEXPR_CXX_14 (line 77) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
      function LZ_CONSTEXPR_CXX_14 (line 82) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
      function LZ_CONSTEXPR_CXX_14 (line 86) | LZ_CONSTEXPR_CXX_14 void increment() {
      function LZ_CONSTEXPR_CXX_14 (line 92) | LZ_CONSTEXPR_CXX_14 void decrement() {
      function LZ_CONSTEXPR_CXX_14 (line 99) | LZ_CONSTEXPR_CXX_14 bool eq(const filter_iterator& other) const {
      function eq (line 104) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/flatten.hpp
  type lz (line 15) | namespace lz {
    type detail (line 16) | namespace detail {
      function count_dims_fn (line 21) | [[nodiscard]] constexpr size_t count_dims_fn() {
      type count_dims_impl (line 33) | struct count_dims_impl
      type count_dims_impl<false> (line 36) | struct count_dims_impl<false> {
      type count_dims_impl<true> (line 51) | struct count_dims_impl<true> {
      class flatten_wrapper (line 91) | class flatten_wrapper
        method flatten_wrapper (line 108) | constexpr flatten_wrapper(const flatten_wrapper&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 109) | LZ_CONSTEXPR_CXX_14 flatten_wrapper& operator=(const flatten_wrapp...
        method flatten_wrapper (line 112) | constexpr flatten_wrapper(I&& iterable, iter it) : _iterator{ std:...
        method flatten_wrapper (line 117) | constexpr flatten_wrapper()
        method flatten_wrapper (line 125) | constexpr flatten_wrapper() noexcept(std::is_nothrow_default_const...
        method LZ_CONSTEXPR_CXX_14 (line 131) | LZ_CONSTEXPR_CXX_14 flatten_wrapper& operator=(default_sentinel_t) {
        method has_next (line 136) | constexpr bool has_next() const {
        method has_prev (line 140) | constexpr bool has_prev() const {
        method has_prev_inner (line 144) | constexpr bool has_prev_inner() const {
        method has_next_inner (line 148) | constexpr bool has_next_inner() const {
        method iter (line 152) | constexpr iter iterator() const {
        method LZ_CONSTEXPR_CXX_14 (line 156) | LZ_CONSTEXPR_CXX_14 void iterator(iter c) {
        method end (line 160) | constexpr sentinel_t<Iterable> end() const {
        method LZ_CONSTEXPR_CXX_14 (line 164) | LZ_CONSTEXPR_CXX_14 void initialize_last() {
        method difference_type (line 168) | constexpr difference_type current_to_begin() const {
        method difference_type (line 172) | constexpr difference_type end_to_current() const {
        method LZ_CONSTEXPR_CXX_14 (line 176) | LZ_CONSTEXPR_CXX_14 bool eq(const flatten_wrapper& other) const {
        method eq (line 181) | constexpr bool eq(default_sentinel_t) const {
        method LZ_CONSTEXPR_CXX_14 (line 185) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 190) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 194) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 199) | LZ_CONSTEXPR_CXX_14 void decrement() {
        method LZ_CONSTEXPR_CXX_14 (line 204) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type n) {
        method difference (line 209) | difference(const flatten_wrapper& other) const {
        method difference_type (line 214) | constexpr difference_type difference(default_sentinel_t) const {
      class flatten_iterator (line 220) | class flatten_iterator
        method LZ_CONSTEXPR_CXX_14 (line 236) | LZ_CONSTEXPR_CXX_14 void find_next_non_empty_inner() {
        method LZ_CONSTEXPR_CXX_14 (line 251) | LZ_CONSTEXPR_CXX_14 void find_prev_non_empty_inner() {
        method LZ_CONSTEXPR_CXX_14 (line 267) | LZ_CONSTEXPR_CXX_14 void advance() {
        method previous_outer (line 277) | constexpr void previous_outer() {
        method LZ_CONSTEXPR_CXX_14 (line 290) | LZ_CONSTEXPR_CXX_14 enable_if_t<!is_sentinel<I, sentinel_t<Iterabl...
        method LZ_CONSTEXPR_CXX_14 (line 296) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_sentinel<I, sentinel_t<Iterable...
        method flatten_iterator (line 309) | constexpr flatten_iterator()
        method flatten_iterator (line 317) | constexpr flatten_iterator() noexcept(std::is_nothrow_default_cons...
        method LZ_CONSTEXPR_CXX_14 (line 324) | LZ_CONSTEXPR_CXX_14 flatten_iterator(I&& iterable, iter it) : _out...
      class flatten_iterator (line 229) | class flatten_iterator
        method LZ_CONSTEXPR_CXX_14 (line 236) | LZ_CONSTEXPR_CXX_14 void find_next_non_empty_inner() {
        method LZ_CONSTEXPR_CXX_14 (line 251) | LZ_CONSTEXPR_CXX_14 void find_prev_non_empty_inner() {
        method LZ_CONSTEXPR_CXX_14 (line 267) | LZ_CONSTEXPR_CXX_14 void advance() {
        method previous_outer (line 277) | constexpr void previous_outer() {
        method LZ_CONSTEXPR_CXX_14 (line 290) | LZ_CONSTEXPR_CXX_14 enable_if_t<!is_sentinel<I, sentinel_t<Iterabl...
        method LZ_CONSTEXPR_CXX_14 (line 296) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_sentinel<I, sentinel_t<Iterable...
        method flatten_iterator (line 309) | constexpr flatten_iterator()
        method flatten_iterator (line 317) | constexpr flatten_iterator() noexcept(std::is_nothrow_default_cons...
        method LZ_CONSTEXPR_CXX_14 (line 324) | LZ_CONSTEXPR_CXX_14 flatten_iterator(I&& iterable, iter it) : _out...
      function LZ_CONSTEXPR_CXX_14 (line 333) | LZ_CONSTEXPR_CXX_14 flatten_iterator& operator=(default_sentinel_t) {
      function has_next (line 339) | constexpr bool has_next() const {
      function has_prev (line 343) | constexpr bool has_prev() const {
      function has_prev_inner (line 347) | constexpr bool has_prev_inner() const {
      function has_next_inner (line 351) | constexpr bool has_next_inner() const {
      function difference_type (line 355) | constexpr difference_type current_to_begin() const {
      function difference_type (line 359) | constexpr difference_type end_to_current() const {
      function eq (line 363) | constexpr bool eq(const flatten_iterator& other) const {
      function eq (line 367) | constexpr bool eq(default_sentinel_t) const {
      function reference (line 371) | constexpr reference dereference() const {
      function pointer (line 375) | constexpr pointer arrow() const {
      function LZ_CONSTEXPR_CXX_14 (line 379) | LZ_CONSTEXPR_CXX_14 void increment() {
      function LZ_CONSTEXPR_CXX_14 (line 385) | LZ_CONSTEXPR_CXX_14 void decrement() {
      function LZ_CONSTEXPR_CXX_14 (line 405) | LZ_CONSTEXPR_CXX_14 void initialize_last() {
      function LZ_CONSTEXPR_CXX_14 (line 420) | LZ_CONSTEXPR_CXX_14 void plus_is(difference_type n) {
      function LZ_CONSTEXPR_CXX_14 (line 473) | LZ_CONSTEXPR_CXX_14 difference_type difference(const flatten_iterato...
      function LZ_CONSTEXPR_CXX_14 (line 501) | LZ_CONSTEXPR_CXX_14 difference_type difference(default_sentinel_t) c...
    class flatten_iterator<Iterable, 0> (line 518) | class flatten_iterator<Iterable, 0>
      method flatten_iterator (line 536) | constexpr flatten_iterator()
      method flatten_iterator (line 543) | constexpr flatten_iterator() noexcept(std::is_nothrow_default_constr...
      method flatten_iterator (line 549) | constexpr flatten_iterator(I&& iterable, iter it) : _iterator{ std::...
      method LZ_CONSTEXPR_CXX_14 (line 552) | LZ_CONSTEXPR_CXX_14 flatten_iterator& operator=(default_sentinel_t) {
      method has_prev (line 557) | constexpr bool has_prev() const {
      method has_next (line 561) | constexpr bool has_next() const {
      method has_prev_inner (line 565) | constexpr bool has_prev_inner() const {
      method has_next_inner (line 569) | constexpr bool has_next_inner() const {
      method LZ_CONSTEXPR_CXX_14 (line 573) | LZ_CONSTEXPR_CXX_14 void initialize_last() {
      method difference_type (line 577) | constexpr difference_type current_to_begin() const {
      method difference_type (line 581) | constexpr difference_type end_to_current() const {
      method reference (line 585) | constexpr reference dereference() const {
      method pointer (line 589) | constexpr pointer arrow() const {
      method eq (line 593) | constexpr bool eq(const flatten_iterator& other) const {
      method eq (line 597) | constexpr bool eq(default_sentinel_t) const {
      method LZ_CONSTEXPR_CXX_14 (line 601) | LZ_CONSTEXPR_CXX_14 void increment() {
      method LZ_CONSTEXPR_CXX_14 (line 606) | LZ_CONSTEXPR_CXX_14 void decrement() {
      method LZ_CONSTEXPR_CXX_14 (line 610) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type n) {
      method difference (line 614) | difference(const flatten_iterator& other) const {
      method difference (line 618) | difference(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/generate.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      class generate_iterator (line 16) | class generate_iterator
      class generate_iterator<GeneratorFunc, false> (line 19) | class generate_iterator<GeneratorFunc, false>
        method generate_iterator (line 34) | constexpr generate_iterator()
        method generate_iterator (line 41) | constexpr generate_iterator() noexcept(std::is_nothrow_default_con...
        method generate_iterator (line 46) | constexpr generate_iterator(GeneratorFunc generator_func, const pt...
        method LZ_CONSTEXPR_CXX_14 (line 51) | LZ_CONSTEXPR_CXX_14 generate_iterator& operator=(default_sentinel_...
        method LZ_CONSTEXPR_CXX_14 (line 56) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 61) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 65) | LZ_CONSTEXPR_CXX_14 void increment() {
        method eq (line 70) | constexpr bool eq(const generate_iterator& other) const noexcept {
        method eq (line 74) | constexpr bool eq(default_sentinel_t) const noexcept {
      class generate_iterator<GeneratorFunc, true> (line 80) | class generate_iterator<GeneratorFunc, true>
        method generate_iterator (line 95) | constexpr generate_iterator()
        method generate_iterator (line 102) | constexpr generate_iterator() {
        method generate_iterator (line 107) | explicit constexpr generate_iterator(GeneratorFunc generator_func)...
        method LZ_CONSTEXPR_CXX_14 (line 110) | LZ_CONSTEXPR_CXX_14 generate_iterator& operator=(default_sentinel_...
        method reference (line 114) | constexpr reference dereference() const {
        method pointer (line 118) | constexpr pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 122) | LZ_CONSTEXPR_CXX_14 void increment() const noexcept {
        method eq (line 125) | constexpr bool eq(const generate_iterator&) const noexcept {
        method eq (line 129) | constexpr bool eq(default_sentinel_t) const noexcept {

FILE: include/Lz/detail/iterators/generate_while.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      class generate_while_iterator (line 18) | class generate_while_iterator
        method generate_while_iterator (line 33) | constexpr generate_while_iterator()
        method generate_while_iterator (line 41) | constexpr generate_while_iterator() noexcept(std::is_nothrow_defau...
        method LZ_CONSTEXPR_CXX_14 (line 52) | LZ_CONSTEXPR_CXX_14 generate_while_iterator(GeneratorFunc generato...
        method LZ_CONSTEXPR_CXX_14 (line 62) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 67) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 71) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 76) | LZ_CONSTEXPR_CXX_14 bool eq(const generate_while_iterator& it) con...
        method LZ_CONSTEXPR_CXX_14 (line 83) | LZ_CONSTEXPR_CXX_14 bool eq(default_sentinel_t) const noexcept {

FILE: include/Lz/detail/iterators/group_by.hpp
  type lz (line 15) | namespace lz {
    type detail (line 16) | namespace detail {
      class group_by_iterator (line 19) | class group_by_iterator : public iterator<group_by_iterator<Iterable...
        method LZ_CONSTEXPR_CXX_14 (line 32) | LZ_CONSTEXPR_CXX_14 void find_next(ref_type last_seen) {
        method LZ_CONSTEXPR_CXX_14 (line 37) | LZ_CONSTEXPR_CXX_14 void advance() {
        method group_by_iterator (line 52) | constexpr group_by_iterator(const group_by_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 53) | LZ_CONSTEXPR_CXX_14 group_by_iterator& operator=(const group_by_it...
        method group_by_iterator (line 57) | constexpr group_by_iterator()
        method group_by_iterator (line 67) | constexpr group_by_iterator() noexcept(std::is_nothrow_default_con...
      function LZ_CONSTEXPR_CXX_14 (line 89) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
      function LZ_CONSTEXPR_CXX_14 (line 94) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
      function LZ_CONSTEXPR_CXX_14 (line 98) | LZ_CONSTEXPR_CXX_14 void increment() {
      function LZ_CONSTEXPR_CXX_14 (line 104) | LZ_CONSTEXPR_CXX_14 void decrement() {
      function LZ_CONSTEXPR_CXX_14 (line 121) | LZ_CONSTEXPR_CXX_14 bool eq(const group_by_iterator& other) const {
      function eq (line 126) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/inclusive_scan.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      class inclusive_scan_iterator (line 16) | class inclusive_scan_iterator : public iterator<inclusive_scan_itera...
        method inclusive_scan_iterator (line 32) | constexpr inclusive_scan_iterator(const inclusive_scan_iterator&) ...
        method LZ_CONSTEXPR_CXX_14 (line 33) | LZ_CONSTEXPR_CXX_14 inclusive_scan_iterator& operator=(const inclu...
        method inclusive_scan_iterator (line 37) | constexpr inclusive_scan_iterator()
        method inclusive_scan_iterator (line 47) | constexpr inclusive_scan_iterator() noexcept(std::is_nothrow_defau...
        method inclusive_scan_iterator (line 55) | constexpr inclusive_scan_iterator(Iterator it, S end, T init, Bina...
        method LZ_CONSTEXPR_CXX_14 (line 62) | LZ_CONSTEXPR_CXX_14 inclusive_scan_iterator& operator=(default_sen...
        method LZ_CONSTEXPR_CXX_14 (line 67) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 72) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 80) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 84) | LZ_CONSTEXPR_CXX_14 bool eq(const inclusive_scan_iterator& other) ...
        method eq (line 89) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/interleave.hpp
  type lz (line 19) | namespace lz {
    type detail (line 20) | namespace detail {
      class interleave_sentinel (line 23) | class interleave_sentinel {
        method interleave_sentinel (line 32) | explicit constexpr interleave_sentinel(T v) noexcept(std::is_nothr...
        method interleave_sentinel (line 37) | constexpr interleave_sentinel()
        method interleave_sentinel (line 42) | constexpr interleave_sentinel() noexcept(std::is_nothrow_default_c...
      class interleave_iterator (line 48) | class interleave_iterator : public iterator<interleave_iterator<Iter...
        method eq (line 75) | constexpr bool eq(const interleave_sentinel<Sentinels>& other) con...
        method eq (line 85) | constexpr bool eq(const interleave_iterator& other) const {
        method LZ_CONSTEXPR_CXX_14 (line 97) | LZ_CONSTEXPR_CXX_14 enable_if_t<I != tup_size - 1, bool> eq(const ...
        method LZ_CONSTEXPR_CXX_14 (line 102) | LZ_CONSTEXPR_CXX_14 enable_if_t<I == tup_size - 1, bool> eq(const ...
        method LZ_CONSTEXPR_CXX_14 (line 107) | LZ_CONSTEXPR_CXX_14 enable_if_t<I != tup_size - 1, bool> eq(const ...
        method LZ_CONSTEXPR_CXX_14 (line 112) | LZ_CONSTEXPR_CXX_14 enable_if_t<I == tup_size - 1, bool> eq(const ...
        method LZ_CONSTEXPR_CXX_14 (line 119) | LZ_CONSTEXPR_CXX_14 void increment(index_sequence<Is...>) {
        method LZ_CONSTEXPR_CXX_14 (line 133) | LZ_CONSTEXPR_CXX_14 void decrement(index_sequence<Is...>) {
        method reference (line 149) | constexpr reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 161) | LZ_CONSTEXPR_CXX_14 enable_if_t<I != tup_size - 1, reference> dere...
        method LZ_CONSTEXPR_CXX_14 (line 166) | LZ_CONSTEXPR_CXX_14 enable_if_t<I == tup_size - 1, reference> dere...
        method LZ_CONSTEXPR_CXX_20 (line 173) | LZ_CONSTEXPR_CXX_20 difference_type difference(const interleave_it...
        method LZ_CONSTEXPR_CXX_20 (line 183) | LZ_CONSTEXPR_CXX_20 difference_type difference(const interleave_se...
        method LZ_CONSTEXPR_CXX_14 (line 192) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type n, index_se...
        method LZ_CONSTEXPR_CXX_14 (line 204) | LZ_CONSTEXPR_CXX_14 void assign_sentinels(const interleave_sentine...
        method interleave_iterator (line 215) | constexpr interleave_iterator()
        method interleave_iterator (line 222) | constexpr interleave_iterator() noexcept(std::is_nothrow_default_c...
        method LZ_CONSTEXPR_CXX_14 (line 227) | LZ_CONSTEXPR_CXX_14 interleave_iterator(Iterators iterators) : _it...
        method LZ_CONSTEXPR_CXX_14 (line 231) | LZ_CONSTEXPR_CXX_14 interleave_iterator& operator=(const interleav...
        method LZ_CONSTEXPR_CXX_14 (line 237) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 241) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 245) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 249) | LZ_CONSTEXPR_CXX_14 void decrement() {
        method difference (line 253) | difference(const interleave_iterator& other) const {
        method difference (line 257) | difference(const interleave_sentinel<Sentinels>& other) const {
        method LZ_CONSTEXPR_CXX_14 (line 261) | LZ_CONSTEXPR_CXX_14 void plus_is(difference_type n) {
        method LZ_CONSTEXPR_CXX_14 (line 289) | LZ_CONSTEXPR_CXX_14 bool eq(const interleave_iterator& other) const {
        method LZ_CONSTEXPR_CXX_14 (line 293) | LZ_CONSTEXPR_CXX_14 bool eq(const interleave_sentinel<Sentinels>& ...

FILE: include/Lz/detail/iterators/intersection.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      class intersection_iterator (line 18) | class intersection_iterator
        method find_next (line 36) | void find_next() {
        method intersection_iterator (line 59) | constexpr intersection_iterator(const intersection_iterator&) = de...
        method LZ_CONSTEXPR_CXX_14 (line 60) | LZ_CONSTEXPR_CXX_14 intersection_iterator& operator=(const interse...
        method intersection_iterator (line 64) | constexpr intersection_iterator()
        method intersection_iterator (line 76) | constexpr intersection_iterator() noexcept(std::is_nothrow_default...
      function LZ_CONSTEXPR_CXX_14 (line 101) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
      function LZ_CONSTEXPR_CXX_14 (line 106) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
      function LZ_CONSTEXPR_CXX_14 (line 110) | LZ_CONSTEXPR_CXX_14 void increment() {
      function LZ_CONSTEXPR_CXX_14 (line 117) | LZ_CONSTEXPR_CXX_14 void decrement() {
      function LZ_CONSTEXPR_CXX_14 (line 134) | LZ_CONSTEXPR_CXX_14 bool eq(const intersection_iterator& other) const {
      function eq (line 140) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/iterator_wrapper.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      type in_place_type_t (line 23) | struct in_place_type_t {
        method in_place_type_t (line 24) | explicit in_place_type_t() = default;
      class iterator_wrapper (line 30) | class iterator_wrapper : public iterator<iterator_wrapper<T, Referen...
        type storage (line 39) | struct alignas(std::max_align_t) storage {
        method copy_buf_other (line 45) | void copy_buf_other(const iterator_wrapper& other) noexcept {
        method iterator_wrapper (line 59) | constexpr iterator_wrapper() noexcept = default;
        method iterator_wrapper (line 62) | iterator_wrapper(in_place_type_t<Impl>, Args&&... args) {
        method iterator_wrapper (line 69) | iterator_wrapper(const detail::unique_ptr<any_iter_base>& ptr) : _...
        method iterator_wrapper (line 72) | iterator_wrapper(detail::unique_ptr<any_iter_base>&& ptr) noexcept...
        method iterator_wrapper (line 75) | iterator_wrapper(const iterator_wrapper& other) {
        method iterator_wrapper (line 85) | iterator_wrapper(iterator_wrapper&& other) noexcept {
        method iterator_wrapper (line 95) | iterator_wrapper& operator=(const iterator_wrapper& other) {
        method iterator_wrapper (line 108) | iterator_wrapper& operator=(iterator_wrapper&& other) noexcept {
        method reference (line 121) | reference dereference() const {
        method reference (line 130) | reference dereference() {
        method pointer (line 139) | pointer arrow() const {
        method pointer (line 148) | pointer arrow() {
        method increment (line 157) | void increment() {
        method decrement (line 167) | void decrement() {
        method eq (line 177) | bool eq(const iterator_wrapper& other) const {
        method plus_is (line 196) | void plus_is(const DiffType n) {
        method DiffType (line 205) | DiffType difference(const iterator_wrapper& other) const {

FILE: include/Lz/detail/iterators/join_where.hpp
  type lz (line 18) | namespace lz {
    type detail (line 19) | namespace detail {
      class join_where_iterator (line 21) | class join_where_iterator
        method LZ_CONSTEXPR_CXX_17 (line 45) | LZ_CONSTEXPR_CXX_17 void find_next() {
        method join_where_iterator (line 67) | constexpr join_where_iterator(const join_where_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 68) | LZ_CONSTEXPR_CXX_14 join_where_iterator& operator=(const join_wher...
        method join_where_iterator (line 72) | constexpr join_where_iterator()
        method join_where_iterator (line 86) | constexpr join_where_iterator() noexcept(std::is_nothrow_default_c...
      function LZ_CONSTEXPR_CXX_14 (line 115) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
      function LZ_CONSTEXPR_CXX_14 (line 120) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
      function LZ_CONSTEXPR_CXX_14 (line 124) | LZ_CONSTEXPR_CXX_14 void increment() {
      function LZ_CONSTEXPR_CXX_14 (line 130) | LZ_CONSTEXPR_CXX_14 bool eq(const join_where_iterator& other) const {
      function eq (line 135) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/loop.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      class loop_iterator (line 17) | class loop_iterator
      class loop_iterator<Iterable, false> (line 20) | class loop_iterator<Iterable, false>
        method loop_iterator (line 38) | constexpr loop_iterator(const loop_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 39) | LZ_CONSTEXPR_CXX_14 loop_iterator& operator=(const loop_iterator&)...
        method loop_iterator (line 43) | constexpr loop_iterator()
        method loop_iterator (line 51) | constexpr loop_iterator() noexcept(std::is_nothrow_default_constru...
        method loop_iterator (line 58) | constexpr loop_iterator(I&& iterable, it iter, difference_type amo...
        method LZ_CONSTEXPR_CXX_14 (line 64) | LZ_CONSTEXPR_CXX_14 loop_iterator& operator=(default_sentinel_t) {
        method LZ_CONSTEXPR_CXX_14 (line 70) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 75) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 79) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 93) | LZ_CONSTEXPR_CXX_14 void decrement() {
        method LZ_CONSTEXPR_CXX_14 (line 102) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type offset) {
        method difference (line 121) | difference(const loop_iterator& other) const {
        method difference (line 127) | difference(default_sentinel_t) const {
        method LZ_CONSTEXPR_CXX_14 (line 131) | LZ_CONSTEXPR_CXX_14 bool eq(const loop_iterator& other) const {
        method eq (line 136) | constexpr bool eq(default_sentinel_t) const {
      class loop_iterator<Iterable, true> (line 142) | class loop_iterator<Iterable, true>
        method loop_iterator (line 159) | constexpr loop_iterator(const loop_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 160) | LZ_CONSTEXPR_CXX_14 loop_iterator& operator=(const loop_iterator&)...
        method loop_iterator (line 164) | constexpr loop_iterator()
        method loop_iterator (line 172) | constexpr loop_iterator() noexcept(std::is_nothrow_default_constru...
        method loop_iterator (line 179) | constexpr loop_iterator(I&& iterable, it iter) : _iterator{ std::m...
        method LZ_CONSTEXPR_CXX_14 (line 182) | LZ_CONSTEXPR_CXX_14 loop_iterator& operator=(default_sentinel_t) n...
        method reference (line 186) | constexpr reference dereference() const {
        method pointer (line 190) | constexpr pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 194) | LZ_CONSTEXPR_CXX_14 void increment() {
        method eq (line 201) | constexpr bool eq(const loop_iterator&) const {
        method eq (line 205) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/map.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      class map_iterator (line 17) | class map_iterator
        method map_iterator (line 32) | constexpr map_iterator(const map_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 33) | LZ_CONSTEXPR_CXX_14 map_iterator& operator=(const map_iterator&) =...
        method map_iterator (line 37) | constexpr map_iterator()
        method map_iterator (line 45) | constexpr map_iterator() noexcept(std::is_nothrow_default_construc...
        method map_iterator (line 51) | constexpr map_iterator(Iterator it, UnaryOp unary_op) : _iterator{...
        method LZ_CONSTEXPR_CXX_14 (line 54) | LZ_CONSTEXPR_CXX_14 map_iterator& operator=(const S& s) {
        method reference (line 59) | constexpr reference dereference() const {
        method pointer (line 63) | constexpr pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 67) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 71) | LZ_CONSTEXPR_CXX_14 void decrement() {
        method LZ_CONSTEXPR_CXX_14 (line 75) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type offset) {
        method difference_type (line 79) | constexpr difference_type difference(const map_iterator& other) co...
        method difference_type (line 83) | constexpr difference_type difference(const S& other) const {
        method eq (line 87) | constexpr bool eq(const map_iterator& other) const {
        method eq (line 91) | constexpr bool eq(const S& s) const {

FILE: include/Lz/detail/iterators/pairwise.hpp
  type lz (line 16) | namespace lz {
    type detail (line 17) | namespace detail {
      function ra_pairwise_iterator (line 39) | constexpr ra_pairwise_iterator(const ra_pairwise_iterator&) = default;
      function LZ_CONSTEXPR_CXX_14 (line 40) | LZ_CONSTEXPR_CXX_14 ra_pairwise_iterator& operator=(const ra_pairwis...
      function ra_pairwise_iterator (line 44) | constexpr ra_pairwise_iterator()
      function ra_pairwise_iterator (line 52) | constexpr ra_pairwise_iterator() noexcept(std::is_nothrow_default_co...
    function LZ_CONSTEXPR_CXX_14 (line 66) | LZ_CONSTEXPR_CXX_14 ra_pairwise_iterator& operator=(default_sentinel_t) {
    function LZ_CONSTEXPR_CXX_14 (line 72) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
    function LZ_CONSTEXPR_CXX_14 (line 77) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
    function LZ_CONSTEXPR_CXX_14 (line 81) | LZ_CONSTEXPR_CXX_14 void increment() {
    function LZ_CONSTEXPR_CXX_14 (line 86) | LZ_CONSTEXPR_CXX_14 void decrement() {
    function LZ_CONSTEXPR_CXX_14 (line 91) | LZ_CONSTEXPR_CXX_14 bool eq(const ra_pairwise_iterator& other) const {
    function eq (line 97) | constexpr bool eq(default_sentinel_t) const {
    function LZ_CONSTEXPR_CXX_14 (line 102) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type offset) {
    function LZ_CONSTEXPR_CXX_14 (line 108) | LZ_CONSTEXPR_CXX_14 difference_type difference(const ra_pairwise_itera...
    function LZ_CONSTEXPR_CXX_14 (line 113) | LZ_CONSTEXPR_CXX_14 difference_type difference(default_sentinel_t) con...
  function bidi_pairwise_iterator (line 138) | constexpr bidi_pairwise_iterator(const bidi_pairwise_iterator&) = default;
  function LZ_CONSTEXPR_CXX_14 (line 139) | LZ_CONSTEXPR_CXX_14 bidi_pairwise_iterator& operator=(const bidi_pairwis...
  function bidi_pairwise_iterator (line 143) | constexpr bidi_pairwise_iterator()
  function bidi_pairwise_iterator (line 151) | constexpr bidi_pairwise_iterator() noexcept(std::is_nothrow_default_cons...
  function LZ_CONSTEXPR_CXX_14 (line 166) | LZ_CONSTEXPR_CXX_14 bidi_pairwise_iterator& operator=(default_sentinel_t) {
  function LZ_CONSTEXPR_CXX_14 (line 172) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
  function LZ_CONSTEXPR_CXX_14 (line 177) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
  function LZ_CONSTEXPR_CXX_14 (line 181) | LZ_CONSTEXPR_CXX_14 void increment() {
  function LZ_CONSTEXPR_CXX_14 (line 191) | LZ_CONSTEXPR_CXX_14 void decrement() {
  function LZ_CONSTEXPR_CXX_14 (line 201) | LZ_CONSTEXPR_CXX_14 bool eq(const bidi_pairwise_iterator& other) const {
  function eq (line 207) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/random.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      class random_iterator (line 17) | class random_iterator
        method random_iterator (line 35) | constexpr random_iterator(const random_iterator&) =
        method LZ_CONSTEXPR_CXX_14 (line 37) | LZ_CONSTEXPR_CXX_14 random_iterator& operator=(const random_iterat...
        method random_iterator (line 41) | constexpr random_iterator()
        method random_iterator (line 48) | constexpr random_iterator() noexcept(std::is_nothrow_default_const...
        method random_iterator (line 53) | constexpr random_iterator(const Distribution& distribution, Genera...
        method LZ_CONSTEXPR_CXX_14 (line 59) | LZ_CONSTEXPR_CXX_14 random_iterator& operator=(default_sentinel_t)...
        method LZ_CONSTEXPR_CXX_14 (line 64) | LZ_CONSTEXPR_CXX_14 value_type dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 70) | LZ_CONSTEXPR_CXX_14 void increment() noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 75) | LZ_CONSTEXPR_CXX_14 void decrement() noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 79) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 83) | LZ_CONSTEXPR_CXX_14 result_type(min)() const noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 87) | LZ_CONSTEXPR_CXX_14 result_type(max)() const noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 91) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type n) noexcept {
        method difference_type (line 96) | constexpr difference_type difference(const random_iterator& other)...
        method difference_type (line 100) | constexpr difference_type difference(default_sentinel_t) const noe...
        method LZ_CONSTEXPR_CXX_14 (line 104) | LZ_CONSTEXPR_CXX_14 bool eq(const random_iterator& other) const no...
        method eq (line 109) | constexpr bool eq(default_sentinel_t) const noexcept {

FILE: include/Lz/detail/iterators/range.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      function LZ_CONSTEXPR_CXX_14 (line 17) | LZ_CONSTEXPR_CXX_14 bool almost_equal(const Floating a, const Floati...
      class range_iterator (line 23) | class range_iterator
      class range_iterator<Arithmetic, true> (line 26) | class range_iterator<Arithmetic, true> : public iterator<range_itera...
        method range_iterator (line 38) | constexpr range_iterator() noexcept = default;
        method range_iterator (line 40) | constexpr range_iterator(const Arithmetic it, const Arithmetic ste...
        method LZ_CONSTEXPR_CXX_14 (line 44) | LZ_CONSTEXPR_CXX_14 range_iterator& operator=(default_sentinel_t) ...
        method value_type (line 46) | constexpr value_type dereference() const noexcept {
        method pointer (line 50) | constexpr pointer arrow() const noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 54) | LZ_CONSTEXPR_CXX_14 void increment() noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 58) | LZ_CONSTEXPR_CXX_14 void decrement() noexcept {
        method difference_type (line 62) | difference_type difference(default_sentinel_t) const = delete;
        method difference_type (line 66) | constexpr difference_type difference(const range_iterator& other) ...
        method eq (line 80) | constexpr bool eq(const range_iterator& other) const noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 93) | LZ_CONSTEXPR_CXX_14 enable_if_t<std::is_floating_point<A>::value, ...
        method LZ_CONSTEXPR_CXX_14 (line 103) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std::is_floating_point<A>::value,...
        method LZ_CONSTEXPR_CXX_14 (line 110) | LZ_CONSTEXPR_CXX_14 enable_if_t<std::is_floating_point<A>::value, ...
        method eq (line 116) | constexpr enable_if_t<!std::is_floating_point<A>::value, bool> eq(...
        method LZ_CONSTEXPR_CXX_14 (line 122) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type value) noex...
        method eq (line 126) | bool eq(default_sentinel_t) const = delete;
      class range_iterator<Arithmetic, false> (line 130) | class range_iterator<Arithmetic, false>
        method range_iterator (line 142) | constexpr range_iterator() noexcept = default;
        method range_iterator (line 144) | explicit constexpr range_iterator(const Arithmetic it) noexcept : ...
        method LZ_CONSTEXPR_CXX_14 (line 148) | LZ_CONSTEXPR_CXX_14 range_iterator& operator=(default_sentinel_t) ...
        method value_type (line 150) | constexpr value_type dereference() const noexcept {
        method pointer (line 154) | constexpr pointer arrow() const noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 158) | LZ_CONSTEXPR_CXX_14 void increment() noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 162) | LZ_CONSTEXPR_CXX_14 void decrement() noexcept {
        method difference_type (line 166) | difference_type difference(default_sentinel_t) const = delete;
        method difference_type (line 170) | constexpr difference_type difference(const range_iterator& other) ...
        method eq (line 180) | constexpr bool eq(const range_iterator& other) const noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 192) | LZ_CONSTEXPR_CXX_14 enable_if_t<std::is_floating_point<A>::value, ...
        method LZ_CONSTEXPR_CXX_14 (line 199) | LZ_CONSTEXPR_CXX_14 enable_if_t<!std::is_floating_point<A>::value,...
        method LZ_CONSTEXPR_CXX_14 (line 205) | LZ_CONSTEXPR_CXX_14 enable_if_t<std::is_floating_point<A>::value, ...
        method eq (line 210) | constexpr enable_if_t<!std::is_floating_point<A>::value, bool> eq(...
        method LZ_CONSTEXPR_CXX_14 (line 216) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type value) noex...
        method eq (line 220) | bool eq(default_sentinel_t) const = delete;

FILE: include/Lz/detail/iterators/regex_split.hpp
  type lz (line 13) | namespace lz {
    type detail (line 14) | namespace detail {
      class regex_split_sentinel (line 17) | class regex_split_sentinel {
        method regex_split_sentinel (line 26) | explicit constexpr regex_split_sentinel(T v) noexcept(std::is_noth...
        method regex_split_sentinel (line 31) | constexpr regex_split_sentinel()
        method regex_split_sentinel (line 36) | constexpr regex_split_sentinel() noexcept(std::is_nothrow_default_...
      class regex_split_iterator (line 48) | class regex_split_iterator
        method regex_split_iterator (line 65) | constexpr regex_split_iterator()
        method regex_split_iterator (line 72) | constexpr regex_split_iterator() noexcept(std::is_nothrow_default_...
        method regex_split_iterator (line 77) | regex_split_iterator(RegexTokenIter first, RegexTokenSentinel last...
        method LZ_CONSTEXPR_CXX_14 (line 83) | LZ_CONSTEXPR_CXX_14 regex_split_iterator& operator=(regex_split_se...
        method LZ_CONSTEXPR_CXX_14 (line 88) | LZ_CONSTEXPR_CXX_14 void increment() {
        method value_type (line 92) | constexpr value_type dereference() const {
        method pointer (line 96) | constexpr pointer arrow() const {
        method eq (line 100) | constexpr bool eq(const regex_split_iterator& other) const {
        method eq (line 104) | constexpr bool eq(regex_split_sentinel<RegexTokenSentinel> end) co...

FILE: include/Lz/detail/iterators/repeat.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      class repeat_iterator (line 18) | class repeat_iterator
      class repeat_iterator<T, false> (line 21) | class repeat_iterator<T, false> : public iterator<repeat_iterator<T,...
        method repeat_iterator (line 33) | constexpr repeat_iterator(const repeat_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 34) | LZ_CONSTEXPR_CXX_14 repeat_iterator& operator=(const repeat_iterat...
        method repeat_iterator (line 38) | constexpr repeat_iterator()
        method repeat_iterator (line 45) | constexpr repeat_iterator() noexcept(std::is_nothrow_default_const...
        method repeat_iterator (line 50) | constexpr repeat_iterator(T to_repeat, const ptrdiff_t start) : _t...
        method LZ_CONSTEXPR_CXX_14 (line 53) | LZ_CONSTEXPR_CXX_14 repeat_iterator& operator=(default_sentinel_t) {
        method LZ_CONSTEXPR_CXX_14 (line 58) | LZ_CONSTEXPR_CXX_14 reference dereference() const noexcept {
        method LZ_CONSTEXPR_CXX_17 (line 63) | LZ_CONSTEXPR_CXX_17 pointer arrow() const noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 67) | LZ_CONSTEXPR_CXX_14 void increment() noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 72) | LZ_CONSTEXPR_CXX_14 void decrement() noexcept {
        method eq (line 76) | constexpr bool eq(const repeat_iterator& other) const noexcept {
        method eq (line 80) | constexpr bool eq(default_sentinel_t) const noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 84) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type value) noex...
        method difference_type (line 89) | constexpr difference_type difference(const repeat_iterator& other)...
        method difference_type (line 93) | constexpr difference_type difference(default_sentinel_t) const noe...
      class repeat_iterator<T, true> (line 99) | class repeat_iterator<T, true> : public iterator<repeat_iterator<T, ...
        method repeat_iterator (line 110) | constexpr repeat_iterator(const repeat_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 111) | LZ_CONSTEXPR_CXX_14 repeat_iterator& operator=(const repeat_iterat...
        method repeat_iterator (line 115) | constexpr repeat_iterator()
        method repeat_iterator (line 122) | constexpr repeat_iterator() {
        method repeat_iterator (line 127) | explicit constexpr repeat_iterator(T to_repeat) : _to_repeat{ std:...
        method LZ_CONSTEXPR_CXX_14 (line 130) | LZ_CONSTEXPR_CXX_14 repeat_iterator& operator=(default_sentinel_t) {
        method reference (line 134) | constexpr reference dereference() const noexcept {
        method LZ_CONSTEXPR_CXX_17 (line 138) | LZ_CONSTEXPR_CXX_17 pointer arrow() const noexcept {
        method LZ_CONSTEXPR_CXX_14 (line 142) | LZ_CONSTEXPR_CXX_14 void increment() const noexcept {
        method eq (line 145) | constexpr bool eq(const repeat_iterator&) const noexcept {
        method eq (line 149) | constexpr bool eq(default_sentinel_t) const noexcept {

FILE: include/Lz/detail/iterators/rotate.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      class rotate_sentinel (line 18) | class rotate_sentinel {
        method rotate_sentinel (line 27) | explicit constexpr rotate_sentinel(T v) noexcept(std::is_nothrow_m...
        method rotate_sentinel (line 32) | constexpr rotate_sentinel()
        method rotate_sentinel (line 37) | constexpr rotate_sentinel() noexcept(std::is_nothrow_default_const...
      class rotate_iterator (line 43) | class rotate_iterator
        method rotate_iterator (line 62) | constexpr rotate_iterator(const rotate_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 63) | LZ_CONSTEXPR_CXX_14 rotate_iterator& operator=(const rotate_iterat...
        method rotate_iterator (line 67) | constexpr rotate_iterator()
        method rotate_iterator (line 75) | constexpr rotate_iterator() noexcept(std::is_nothrow_default_const...
        method rotate_iterator (line 90) | constexpr rotate_iterator& operator=(const rotate_sentinel<iter_t<...
        method LZ_CONSTEXPR_CXX_14 (line 103) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_bidi<I>::value, rotate_iterator...
        method LZ_CONSTEXPR_CXX_14 (line 110) | LZ_CONSTEXPR_CXX_14 enable_if_t<!is_bidi<I>::value, rotate_iterator&>
        method LZ_CONSTEXPR_CXX_14 (line 119) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
        method pointer (line 124) | constexpr pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 128) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 137) | LZ_CONSTEXPR_CXX_14 void decrement() {
        method LZ_CONSTEXPR_CXX_14 (line 149) | LZ_CONSTEXPR_CXX_14 void plus_is(difference_type n) {
        method difference (line 163) | difference(const rotate_iterator& other) const {
        method difference_type (line 168) | constexpr difference_type difference(const rotate_sentinel<iter_t<...
        method LZ_CONSTEXPR_CXX_14 (line 173) | LZ_CONSTEXPR_CXX_14 enable_if_t<!is_bidi<I>::value, bool> eq(const...
        method LZ_CONSTEXPR_CXX_14 (line 179) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_bidi<I>::value, bool> eq(const ...
        method eq (line 184) | constexpr bool eq(const rotate_sentinel<iter_t<Iterable>>& other) ...

FILE: include/Lz/detail/iterators/split.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      class split_iterator (line 18) | class split_iterator
        method split_iterator (line 35) | constexpr split_iterator(const split_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 36) | LZ_CONSTEXPR_CXX_14 split_iterator& operator=(const split_iterator...
        method split_iterator (line 40) | constexpr split_iterator()
        method split_iterator (line 50) | constexpr split_iterator() noexcept(std::is_nothrow_default_constr...
        method LZ_CONSTEXPR_CXX_14 (line 58) | LZ_CONSTEXPR_CXX_14 split_iterator(Iterator begin, S end, Iterator...
        method LZ_CONSTEXPR_CXX_14 (line 73) | LZ_CONSTEXPR_CXX_14 split_iterator& operator=(default_sentinel_t) {
        method reference (line 82) | constexpr reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 96) | LZ_CONSTEXPR_CXX_14 enable_if_t<std::is_constructible<V, Iterator,...
        method LZ_CONSTEXPR_CXX_17 (line 103) | LZ_CONSTEXPR_CXX_17 enable_if_t<!std::is_constructible<V, Iterator...
        method LZ_CONSTEXPR_CXX_14 (line 111) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 115) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 137) | LZ_CONSTEXPR_CXX_14 bool eq(const split_iterator& rhs) const {
        method eq (line 143) | constexpr bool eq(default_sentinel_t) const {
      class split_single_iterator (line 149) | class split_single_iterator
        method split_single_iterator (line 159) | constexpr split_single_iterator(const split_single_iterator&) = de...
        method LZ_CONSTEXPR_CXX_14 (line 160) | LZ_CONSTEXPR_CXX_14 split_single_iterator& operator=(const split_s...
        method split_single_iterator (line 164) | constexpr split_single_iterator()
        method split_single_iterator (line 173) | constexpr split_single_iterator() noexcept(std::is_nothrow_default...
        method LZ_CONSTEXPR_CXX_14 (line 186) | LZ_CONSTEXPR_CXX_14 split_single_iterator(Iterator begin, S end, T...
        method LZ_CONSTEXPR_CXX_14 (line 200) | LZ_CONSTEXPR_CXX_14 split_single_iterator& operator=(default_senti...
        method reference (line 209) | constexpr reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 222) | LZ_CONSTEXPR_CXX_14 enable_if_t<std::is_constructible<V, Iterator,...
        method LZ_CONSTEXPR_CXX_17 (line 229) | LZ_CONSTEXPR_CXX_17 enable_if_t<!std::is_constructible<V, Iterator...
        method LZ_CONSTEXPR_CXX_14 (line 236) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 240) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 263) | LZ_CONSTEXPR_CXX_14 bool eq(const split_single_iterator& rhs) const {
        method eq (line 269) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/take.hpp
  type lz (line 11) | namespace lz {
    type detail (line 12) | namespace detail {
      class n_take_iterator (line 14) | class n_take_iterator : public iterator<n_take_iterator<Iterator>, r...
        method n_take_iterator (line 30) | constexpr n_take_iterator(const n_take_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 31) | LZ_CONSTEXPR_CXX_14 n_take_iterator& operator=(const n_take_iterat...
        method n_take_iterator (line 35) | constexpr n_take_iterator()
        method n_take_iterator (line 42) | constexpr n_take_iterator() noexcept(std::is_nothrow_default_const...
        method n_take_iterator (line 47) | constexpr n_take_iterator(Iterator it, const difference_type n) : ...
        method n_take_iterator (line 52) | constexpr n_take_iterator& operator=(default_sentinel_t) {
        method LZ_CONSTEXPR_CXX_14 (line 63) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_bidi<I>::value, n_take_iterator...
        method LZ_CONSTEXPR_CXX_14 (line 70) | LZ_CONSTEXPR_CXX_14 enable_if_t<!is_bidi<I>::value, n_take_iterato...
        method LZ_CONSTEXPR_CXX_14 (line 77) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 82) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 86) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 92) | LZ_CONSTEXPR_CXX_14 void decrement() {
        method LZ_CONSTEXPR_CXX_14 (line 97) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type offset) {
        method difference_type (line 102) | constexpr difference_type difference(const n_take_iterator& other)...
        method difference_type (line 106) | constexpr difference_type difference(default_sentinel_t) const {
        method eq (line 110) | constexpr bool eq(const n_take_iterator& other) const {
        method eq (line 114) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/take_every.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      class take_every_iterator (line 17) | class take_every_iterator
      class take_every_iterator<Iterable, enable_if_t<!is_bidi<iter_t<Iterable>>::value>> (line 20) | class take_every_iterator<Iterable, enable_if_t<!is_bidi<iter_t<Iter...
        method take_every_iterator (line 39) | constexpr take_every_iterator(const take_every_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 40) | LZ_CONSTEXPR_CXX_14 take_every_iterator& operator=(const take_ever...
        method take_every_iterator (line 44) | constexpr take_every_iterator()
        method take_every_iterator (line 52) | constexpr take_every_iterator() noexcept(std::is_nothrow_default_c...
        method take_every_iterator (line 58) | constexpr take_every_iterator(it iter, sent end, const difference_...
        method LZ_CONSTEXPR_CXX_14 (line 64) | LZ_CONSTEXPR_CXX_14 take_every_iterator& operator=(default_sentine...
        method LZ_CONSTEXPR_CXX_14 (line 69) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 74) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 78) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 84) | LZ_CONSTEXPR_CXX_14 bool eq(const take_every_iterator& other) const {
        method eq (line 89) | constexpr bool eq(default_sentinel_t) const {
      class take_every_iterator<Iterable, enable_if_t<is_bidi<iter_t<Iterable>>::value && !is_ra<iter_t<Iterable>>::value>> (line 95) | class take_every_iterator<Iterable, enable_if_t<is_bidi<iter_t<Itera...
        method take_every_iterator (line 115) | constexpr take_every_iterator(const take_every_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 116) | LZ_CONSTEXPR_CXX_14 take_every_iterator& operator=(const take_ever...
        method take_every_iterator (line 120) | constexpr take_every_iterator()
        method take_every_iterator (line 128) | constexpr take_every_iterator() noexcept(std::is_nothrow_default_c...
        method take_every_iterator (line 134) | constexpr take_every_iterator(it iter, sent end, const difference_...
        method LZ_CONSTEXPR_CXX_14 (line 141) | LZ_CONSTEXPR_CXX_14 take_every_iterator& operator=(default_sentine...
        method LZ_CONSTEXPR_CXX_14 (line 146) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 151) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 155) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 161) | LZ_CONSTEXPR_CXX_14 void decrement() {
        method LZ_CONSTEXPR_CXX_14 (line 170) | LZ_CONSTEXPR_CXX_14 bool eq(const take_every_iterator& other) const {
        method eq (line 175) | constexpr bool eq(default_sentinel_t) const {
      class take_every_iterator<Iterable, enable_if_t<is_ra<iter_t<Iterable>>::value>> (line 181) | class take_every_iterator<Iterable, enable_if_t<is_ra<iter_t<Iterabl...
        method difference_impl (line 201) | difference_impl(const sent& iter) const {
        method take_every_iterator (line 209) | constexpr take_every_iterator(const take_every_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 210) | LZ_CONSTEXPR_CXX_14 take_every_iterator& operator=(const take_ever...
        method take_every_iterator (line 214) | constexpr take_every_iterator()
        method take_every_iterator (line 222) | constexpr take_every_iterator() noexcept(std::is_nothrow_default_c...
        method take_every_iterator (line 229) | constexpr take_every_iterator(I&& iterable, it iter, const differe...
        method LZ_CONSTEXPR_CXX_14 (line 235) | LZ_CONSTEXPR_CXX_14 take_every_iterator& operator=(default_sentine...
        method LZ_CONSTEXPR_CXX_14 (line 240) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 245) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 249) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 260) | LZ_CONSTEXPR_CXX_14 void decrement() {
        method LZ_CONSTEXPR_CXX_14 (line 267) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type offset) {
        method difference (line 292) | difference(const take_every_iterator& other) const {
        method difference (line 298) | difference(default_sentinel_t) const {
        method LZ_CONSTEXPR_CXX_14 (line 302) | LZ_CONSTEXPR_CXX_14 bool eq(const take_every_iterator& other) const {
        method eq (line 308) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/take_while.hpp
  type lz (line 14) | namespace lz {
    type detail (line 15) | namespace detail {
      class take_while_iterator (line 18) | class take_while_iterator : public iterator<take_while_iterator<Iter...
        method LZ_CONSTEXPR_CXX_14 (line 30) | LZ_CONSTEXPR_CXX_14 void incremented_check() {
        method take_while_iterator (line 42) | constexpr take_while_iterator(const take_while_iterator&)  = default;
        method LZ_CONSTEXPR_CXX_14 (line 43) | LZ_CONSTEXPR_CXX_14 take_while_iterator& operator=(const take_whil...
        method take_while_iterator (line 47) | constexpr take_while_iterator()
        method take_while_iterator (line 56) | constexpr take_while_iterator() noexcept(std::is_nothrow_default_c...
      function LZ_CONSTEXPR_CXX_14 (line 78) | LZ_CONSTEXPR_CXX_14 take_while_iterator& operator=(default_sentinel_...
      function LZ_CONSTEXPR_CXX_14 (line 83) | LZ_CONSTEXPR_CXX_14 void increment() {
      function LZ_CONSTEXPR_CXX_14 (line 89) | LZ_CONSTEXPR_CXX_14 void decrement() {
      function LZ_CONSTEXPR_CXX_14 (line 100) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
      function LZ_CONSTEXPR_CXX_14 (line 105) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
      function LZ_CONSTEXPR_CXX_14 (line 109) | LZ_CONSTEXPR_CXX_14 bool eq(const take_while_iterator& other) const ...
      function eq (line 114) | constexpr bool eq(default_sentinel_t) const noexcept {

FILE: include/Lz/detail/iterators/unique.hpp
  type lz (line 16) | namespace lz {
    type detail (line 17) | namespace detail {
      class unique_iterator (line 20) | class unique_iterator : public iterator<unique_iterator<Iterable, Bi...
        method unique_iterator (line 37) | constexpr unique_iterator(const unique_iterator&) = default;
        method LZ_CONSTEXPR_CXX_14 (line 38) | LZ_CONSTEXPR_CXX_14 unique_iterator& operator=(const unique_iterat...
        method unique_iterator (line 42) | constexpr unique_iterator()
        method unique_iterator (line 52) | constexpr unique_iterator() noexcept(std::is_nothrow_default_const...
        method unique_iterator (line 60) | constexpr unique_iterator(I&& iterable, iter it, BinaryPredicate b...
        method LZ_CONSTEXPR_CXX_14 (line 66) | LZ_CONSTEXPR_CXX_14 unique_iterator& operator=(default_sentinel_t) {
        method LZ_CONSTEXPR_CXX_14 (line 71) | LZ_CONSTEXPR_CXX_14 reference dereference() const {
        method LZ_CONSTEXPR_CXX_14 (line 76) | LZ_CONSTEXPR_CXX_14 pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 80) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 91) | LZ_CONSTEXPR_CXX_14 void decrement() {
        method LZ_CONSTEXPR_CXX_14 (line 107) | LZ_CONSTEXPR_CXX_14 bool eq(const unique_iterator& other) const {
        method eq (line 112) | constexpr bool eq(default_sentinel_t) const {

FILE: include/Lz/detail/iterators/zip.hpp
  type lz (line 15) | namespace lz {
    type detail (line 16) | namespace detail {
      class zip_sentinel (line 19) | class zip_sentinel {
        method zip_sentinel (line 28) | explicit constexpr zip_sentinel(T v) noexcept(std::is_nothrow_move...
        method zip_sentinel (line 33) | constexpr zip_sentinel()
        method zip_sentinel (line 38) | constexpr zip_sentinel() noexcept(std::is_nothrow_default_construc...
      class zip_iterator (line 44) | class zip_iterator : public iterator<zip_iterator<Iterables...>, ite...
        method reference (line 65) | constexpr reference dereference(index_sequence<I...>) const {
        method LZ_CONSTEXPR_CXX_14 (line 70) | LZ_CONSTEXPR_CXX_14 void increment(index_sequence<I...>) {
        method LZ_CONSTEXPR_CXX_14 (line 79) | LZ_CONSTEXPR_CXX_14 void decrement(index_sequence<I...>) {
        method LZ_CONSTEXPR_CXX_14 (line 88) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type offset, ind...
        method LZ_CONSTEXPR_CXX_14 (line 97) | LZ_CONSTEXPR_CXX_14 difference_type minus(const zip_iterator& othe...
        method LZ_CONSTEXPR_CXX_14 (line 106) | LZ_CONSTEXPR_CXX_14 difference_type minus(const sentinel& other, i...
        method LZ_CONSTEXPR_CXX_14 (line 111) | LZ_CONSTEXPR_CXX_14 bool eq(const EndIter& other, index_sequence<I...
        method LZ_CONSTEXPR_CXX_14 (line 120) | LZ_CONSTEXPR_CXX_14 enable_if_t<!is_bidi_tag<cat>::value> assign_s...
        method LZ_CONSTEXPR_CXX_14 (line 129) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_bidi_tag<cat>::value && !is_ra_...
        method LZ_CONSTEXPR_CXX_14 (line 137) | LZ_CONSTEXPR_CXX_14 enable_if_t<is_ra_tag<cat>::value> assign_sent...
        method zip_iterator (line 144) | constexpr zip_iterator()
        method zip_iterator (line 151) | constexpr zip_iterator() noexcept(std::is_nothrow_default_construc...
        method zip_iterator (line 156) | constexpr zip_iterator(iter_tuple iterators) : _iterators{ std::mo...
        method LZ_CONSTEXPR_CXX_14 (line 160) | LZ_CONSTEXPR_CXX_14 zip_iterator& operator=(const sentinel& end) {
        method reference (line 165) | constexpr reference dereference() const {
        method pointer (line 169) | constexpr pointer arrow() const {
        method LZ_CONSTEXPR_CXX_14 (line 173) | LZ_CONSTEXPR_CXX_14 void increment() {
        method LZ_CONSTEXPR_CXX_14 (line 177) | LZ_CONSTEXPR_CXX_14 void decrement() {
        method LZ_CONSTEXPR_CXX_14 (line 181) | LZ_CONSTEXPR_CXX_14 void plus_is(const difference_type offset) {
        method difference (line 185) | difference(const zip_iterator& other) const {
        method difference (line 189) | difference(const sentinel& other) const {
        method LZ_CONSTEXPR_CXX_14 (line 193) | LZ_CONSTEXPR_CXX_14 bool eq(const zip_iterator& other) const {
        method LZ_CONSTEXPR_CXX_14 (line 197) | LZ_CONSTEXPR_CXX_14 bool eq(const sentinel& other) const {

FILE: include/Lz/detail/iterators/zip_longest.hpp
  type lz (line 19) | namespace lz {
    type detail (line 20) | namespace detail {
      type optional_iter_tuple_value_type (line 23) | struct optional_iter_tuple_value_type
      type reference_or_value_type (line 34) | struct reference_or_value_type
      type reference_or_value_type<true /* is lvalue reference */> (line 37) | struct reference_or_value_type<true /* is lvalue reference */> {
      type reference_or_value_type<false /* is lvalue reference */> (line 43) 
Condensed preview — 424 files, each showing path, character count, and a content snippet. Download the .json file or copy for the full structured content (1,813K chars).
[
  {
    "path": ".clang-format",
    "chars": 1251,
    "preview": "---\nAccessModifierOffset: -4\nAllowShortFunctionsOnASingleLine: None\nAllowShortEnumsOnASingleLine: false\nAllowShortCaseLa"
  },
  {
    "path": ".github/workflows/ci.yml",
    "chars": 450,
    "preview": "name: Continuous Integration\n\non:\n  push:\n    branches:\n      - master\n\n  pull_request:\n    branches:\n      - master\n\n  "
  },
  {
    "path": ".github/workflows/clang.yml",
    "chars": 2798,
    "preview": "env:\n  CTEST_OUTPUT_ON_FAILURE: 1\n  LIBCXX_STANDARDS_JSON: '[\"20\",\"23\"]'\n\non:\n  workflow_call:\n\njobs:\n  clang:\n    name:"
  },
  {
    "path": ".github/workflows/codeql.yml",
    "chars": 1752,
    "preview": "name: \"CodeQL\"\n\non:\n  push:\n    branches: [ \"master\", dev ]\n  pull_request:\n    branches: [ \"master\" ]\n\nenv:\n  DOCTEST_V"
  },
  {
    "path": ".github/workflows/examples.yml",
    "chars": 577,
    "preview": "on:\n  workflow_call:\n\njobs:\n  examples:\n    runs-on: ubuntu-latest\n\n    strategy:\n      fail-fast: false\n      matrix:\n "
  },
  {
    "path": ".github/workflows/gcc.yml",
    "chars": 1865,
    "preview": "env:\n  CTEST_OUTPUT_ON_FAILURE: 1\n\non:\n  workflow_call:\n\njobs:\n  gcc:\n    name: gcc-${{ matrix.version }} (C++${{ matrix"
  },
  {
    "path": ".github/workflows/make-release.yml",
    "chars": 557,
    "preview": "name: Make release package\npermissions:\n  contents: write\n\non:\n  release:\n    types: [published]\n\njobs:\n  release:\n    r"
  },
  {
    "path": ".github/workflows/module-tests.yml",
    "chars": 2678,
    "preview": "on:\n  workflow_call:\n\njobs:\n  module_tests:\n    runs-on: ubuntu-latest\n    \n    steps:\n      - name: Checkout repo\n     "
  },
  {
    "path": ".github/workflows/msvc.yml",
    "chars": 1474,
    "preview": "env:\n  CTEST_OUTPUT_ON_FAILURE: 1\n\non:\n  workflow_call:\n\njobs:\n  msvc:\n    name: msvc-${{ matrix.os }} (C++${{ matrix.st"
  },
  {
    "path": ".gitignore",
    "chars": 10443,
    "preview": "## Ignore Visual Studio temporary files, build results, and\r\n## files generated by popular Visual Studio add-ons.\r\n##\r\n#"
  },
  {
    "path": "CMakeLists.txt",
    "chars": 6299,
    "preview": "cmake_minimum_required(VERSION 3.14)\r\n\r\nproject(cpp-lazy\r\n        VERSION 9.0.0\r\n        DESCRIPTION\r\n        \"A fast C+"
  },
  {
    "path": "Doxyfile",
    "chars": 112752,
    "preview": "# Doxyfile 1.8.18\n\n# This file describes the settings to be used by the documentation system\n# doxygen (www.doxygen.org)"
  },
  {
    "path": "LICENSE.md",
    "chars": 1068,
    "preview": "MIT License\n\nCopyright (c) 2025 Marc Dirven\n\nPermission is hereby granted, free of charge, to any person obtaining a cop"
  },
  {
    "path": "README.md",
    "chars": 15254,
    "preview": "[![Build status](https://github.com/Kaaserne/cpp-lazy/workflows/Continuous%20Integration/badge.svg)](https://github.com/"
  },
  {
    "path": "all/CMakeLists.txt",
    "chars": 327,
    "preview": "cmake_minimum_required(VERSION 3.12)\n\nproject(build_all LANGUAGES CXX)\n\nadd_subdirectory(\"${CMAKE_CURRENT_LIST_DIR}/../b"
  },
  {
    "path": "bench/.gitignore",
    "chars": 13,
    "preview": "venv/\nbuild*/"
  },
  {
    "path": "bench/CMakeLists.txt",
    "chars": 982,
    "preview": "cmake_minimum_required(VERSION 3.10...3.12.4)\r\n\r\nproject(Benchmark)\r\n\r\nadd_executable(Benchmark\r\n        ${CMAKE_CURRENT"
  },
  {
    "path": "bench/bar_chart_maker.py",
    "chars": 5445,
    "preview": "import matplotlib.pyplot as plt\r\nfrom matplotlib.backends.backend_agg import FigureCanvasAgg as FigureCanvas\r\nfrom matpl"
  },
  {
    "path": "bench/benchmarks-iterators.cpp",
    "chars": 30740,
    "preview": "#include <Lz/any_iterable.hpp>\r\n#include <Lz/as_iterator.hpp>\r\n#include <Lz/c_string.hpp>\r\n#include <Lz/cached_size.hpp>"
  },
  {
    "path": "bench/lz/CMakeLists.txt",
    "chars": 655,
    "preview": "cmake_minimum_required(VERSION 3.10...3.12.4)\r\n\r\nproject(CompeTimeBenchmark)\r\n\r\ninclude(FetchContent)\r\n\r\nFetchContent_De"
  },
  {
    "path": "bench/lz/compile-times.cpp",
    "chars": 220,
    "preview": "#include <Lz/filter.hpp>\n#include <Lz/zip.hpp>\n#include <vector>\n\nint main() {\n    std::vector<int> vec;\n    static_cast"
  },
  {
    "path": "bench/requirements.txt",
    "chars": 19,
    "preview": "matplotlib>=3.10.3\n"
  },
  {
    "path": "bench/std/CMakeLists.txt",
    "chars": 404,
    "preview": "cmake_minimum_required(VERSION 3.10...3.12.4)\r\n\r\nproject(CompeTimeBenchmark)\r\n\r\ninclude(FetchContent)\r\n\r\nadd_executable("
  },
  {
    "path": "bench/std/compile-times.cpp",
    "chars": 222,
    "preview": "#include <ranges>\n#include <vector>\n\nint main() {\n    std::vector<int> vec;\n    static_cast<void>(std::ranges::views::zi"
  },
  {
    "path": "cmake/cpp-lazy.pc.in",
    "chars": 370,
    "preview": "prefix=@CMAKE_INSTALL_PREFIX@\nexec_prefix=${prefix}\nlibdir=${prefix}/@CMAKE_INSTALL_LIBDIR@\nincludedir=${prefix}/@CPP_LA"
  },
  {
    "path": "cmake/cpp-lazyConfig.cmake.in",
    "chars": 698,
    "preview": "@PACKAGE_INIT@\n\ninclude(CMakeFindDependencyMacro)\n\nif (NOT CPP_LAZY_USE_STANDALONE)\n    if (CPP_LAZY_USE_INSTALLED_FMT)\n"
  },
  {
    "path": "docs/.gitkeep",
    "chars": 0,
    "preview": ""
  },
  {
    "path": "examples/CMakeLists.txt",
    "chars": 1190,
    "preview": "cmake_minimum_required(VERSION 3.14)\r\n\r\nproject(examples LANGUAGES CXX)\r\n\r\ninclude(FetchContent)\r\nFetchContent_Declare(c"
  },
  {
    "path": "examples/algorithm.cpp",
    "chars": 12685,
    "preview": "#include <Lz/algorithm/algorithm.hpp>\n#include <Lz/c_string.hpp>\n#include <iostream>\n#include <vector>\n\nint main() {\n   "
  },
  {
    "path": "examples/any_iterable.cpp",
    "chars": 1402,
    "preview": "#include <Lz/any_iterable.hpp>\n#include <Lz/filter.hpp>\n#include <Lz/map.hpp>\n#include <iostream>\n#include <vector>\n\nnam"
  },
  {
    "path": "examples/as_iterator.cpp",
    "chars": 400,
    "preview": "#include <Lz/as_iterator.hpp>\n#include <iostream>\n#include <vector>\n\nint main() {\n    std::vector<int> vec = { 1, 2, 3, "
  },
  {
    "path": "examples/basic_iterable.cpp",
    "chars": 2250,
    "preview": "#include <Lz/basic_iterable.hpp>\n#include <Lz/c_string.hpp>\n#include <vector>\n#include <iostream>\n\nint main() {\n    // -"
  },
  {
    "path": "examples/c_string.cpp",
    "chars": 989,
    "preview": "#include <Lz/c_string.hpp>\n#include <Lz/algorithm/for_each.hpp>\n#include <iostream>\n\n\nint main() {\n    const char* my_st"
  },
  {
    "path": "examples/cached_reverse.cpp",
    "chars": 1336,
    "preview": "#include <Lz/filter.hpp>\n#include <Lz/reverse.hpp>\n#include <iostream>\n#include <numeric>\n#include <vector>\n\nint main() "
  },
  {
    "path": "examples/cached_size.cpp",
    "chars": 4487,
    "preview": "#include <Lz/cached_size.hpp>\n#include <Lz/filter.hpp>\n#include <Lz/take_every.hpp>\n#include <Lz/zip.hpp>\n#include <iost"
  },
  {
    "path": "examples/cartesian_product.cpp",
    "chars": 997,
    "preview": "#include <Lz/cartesian_product.hpp>\n#include <iostream>\n#include <vector>\n\n\nint main() {\n    std::vector<int> vec = {1, "
  },
  {
    "path": "examples/chunk_if.cpp",
    "chars": 3507,
    "preview": "#include <Lz/chunk_if.hpp>\n#include <Lz/algorithm/for_each.hpp>\n#include <iostream>\n#include <vector>\n\n\nint main() {\n\tst"
  },
  {
    "path": "examples/chunks.cpp",
    "chars": 1144,
    "preview": "#include <Lz/chunks.hpp>\n#include <iostream>\n#include <vector>\n\nint main() {\n\tstd::vector<int> v = {1, 2, 3, 4, 5, 6, 7,"
  },
  {
    "path": "examples/common.cpp",
    "chars": 1514,
    "preview": "#include <Lz/algorithm/algorithm.hpp>\n#include <Lz/c_string.hpp>\n#include <Lz/common.hpp>\n#include <iostream>\n\nint main("
  },
  {
    "path": "examples/concatenate.cpp",
    "chars": 1821,
    "preview": "#include <Lz/concatenate.hpp>\n#include <Lz/range.hpp>\n#include <array>\n#include <iostream>\n#include <vector>\n\nint main()"
  },
  {
    "path": "examples/drop.cpp",
    "chars": 421,
    "preview": "#include <Lz/drop.hpp>\n#include <iostream>\n#include <vector>\n\nint main() {\n    std::vector<int> vec = { 1, 2, 3, 4, 5, 6"
  },
  {
    "path": "examples/drop_while.cpp",
    "chars": 528,
    "preview": "#include <Lz/algorithm/for_each.hpp>\n#include <Lz/drop_while.hpp>\n#include <iostream>\n#include <vector>\n\nint main() {\n  "
  },
  {
    "path": "examples/duplicates.cpp",
    "chars": 531,
    "preview": "#include <Lz/duplicates.hpp>\n#include <iostream>\n\nint main() {\n    std::vector<int> input = { 1, 2, 2, 3, 4, 4, 5, 6, 6,"
  },
  {
    "path": "examples/enumerate.cpp",
    "chars": 1814,
    "preview": "#include <Lz/enumerate.hpp>\n#include <vector>\n#include <iostream>\n\n\nint main() {\n    std::vector<int> to_enumerate = {1,"
  },
  {
    "path": "examples/except.cpp",
    "chars": 584,
    "preview": "#include <Lz/algorithm/for_each.hpp>\n#include <Lz/except.hpp>\n#include <iostream>\n#include <vector>\n\nint main() {\n    st"
  },
  {
    "path": "examples/exclude.cpp",
    "chars": 1076,
    "preview": "#include <Lz/algorithm/for_each.hpp>\n#include <Lz/except.hpp>\n#include <iostream>\n#include <vector>\n\nint main() {\n    st"
  },
  {
    "path": "examples/exclusive_scan.cpp",
    "chars": 2413,
    "preview": "#include <Lz/algorithm/for_each.hpp>\n#include <Lz/exclusive_scan.hpp>\n#include <iostream>\n\nint main() {\n    int array[] "
  },
  {
    "path": "examples/filter.cpp",
    "chars": 509,
    "preview": "#include <Lz/filter.hpp>\n#include <vector>\n#include <iostream>\n\n\nint main() {\n    std::vector<int> to_filter = {1, 2, 3,"
  },
  {
    "path": "examples/flatten.cpp",
    "chars": 570,
    "preview": "#include <Lz/flatten.hpp>\n#include <iostream>\n#include <vector>\n\nint main() {\n    std::vector<std::vector<std::vector<in"
  },
  {
    "path": "examples/generate.cpp",
    "chars": 611,
    "preview": "#include <Lz/algorithm/for_each.hpp>\n#include <Lz/generate.hpp>\n#include <iostream>\n\nint main() {\n\tstd::size_t counter ="
  },
  {
    "path": "examples/generate_while.cpp",
    "chars": 888,
    "preview": "#include <Lz/algorithm/for_each.hpp>\n#include <Lz/generate_while.hpp>\n#include <iostream>\n\nint main() {\n    int i = 0;\n "
  },
  {
    "path": "examples/group_by.cpp",
    "chars": 1572,
    "preview": "#include <Lz/group_by.hpp>\n#include <iostream>\n#include <string>\n#include <vector>\n\nint main() {\n\tstd::vector<std::strin"
  },
  {
    "path": "examples/inclusive_scan.cpp",
    "chars": 2345,
    "preview": "#include <Lz/algorithm/for_each.hpp>\n#include <Lz/inclusive_scan.hpp>\n#include <iostream>\n\nint main() {\n    int array[] "
  },
  {
    "path": "examples/interleave.cpp",
    "chars": 684,
    "preview": "#include <Lz/interleave.hpp>\n#include <iostream>\n#include <vector>\n\nint main() {\n    std::vector<int> vec1 = { 1, 2, 3 }"
  },
  {
    "path": "examples/intersection.cpp",
    "chars": 549,
    "preview": "#include <Lz/intersection.hpp>\n#include <vector>\n#include <iostream>\n\nint main() {\n    std::vector<int> a = { 1, 2, 3, 4"
  },
  {
    "path": "examples/iter_tools.cpp",
    "chars": 8263,
    "preview": "#include <Lz/algorithm/for_each.hpp>\n#include <Lz/iter_tools.hpp>\n#include <iostream>\n#include <map>\n#include <vector>\n\n"
  },
  {
    "path": "examples/join_where.cpp",
    "chars": 7969,
    "preview": "#include <Lz/algorithm/for_each.hpp>\n#include <Lz/join_where.hpp>\n#include <algorithm>\n#include <iostream>\n#include <vec"
  },
  {
    "path": "examples/loop.cpp",
    "chars": 1960,
    "preview": "#include <Lz/algorithm/for_each.hpp>\n#include <Lz/loop.hpp>\n#include <iostream>\n#include <vector>\n\nint main() {\n#ifdef L"
  },
  {
    "path": "examples/map.cpp",
    "chars": 719,
    "preview": "#include <Lz/map.hpp>\n#include <vector>\n#include <iostream>\n\n\nstruct some_struct {\n    std::string s;\n    int a;\n};\n\nint"
  },
  {
    "path": "examples/maybe_owned.cpp",
    "chars": 2108,
    "preview": "#include <Lz/map.hpp>\n#include <iostream>\n#include <vector>\n\nstruct non_lz_iterable {\n    const int* _begin{};\n    const"
  },
  {
    "path": "examples/pairwise.cpp",
    "chars": 347,
    "preview": "#include <Lz/pairwise.hpp>\n#include <iostream>\n#include <vector>\n\nint main() {\n    std::vector<int> vec1{ 1, 2, 3, 4, 5 "
  },
  {
    "path": "examples/pipe.cpp",
    "chars": 1352,
    "preview": "#include <Lz/algorithm/all_of.hpp>\n#include <Lz/drop.hpp>\n#include <Lz/iter_tools.hpp>\n#include <Lz/map.hpp>\n#include <L"
  },
  {
    "path": "examples/print_and_format.cpp",
    "chars": 1376,
    "preview": "#include <Lz/stream.hpp>\n#include <Lz/basic_iterable.hpp>\n#include <iostream>\n#include <vector>\n\nint main() {\n    std::v"
  },
  {
    "path": "examples/random.cpp",
    "chars": 2006,
    "preview": "#include <Lz/algorithm/for_each.hpp>\n#include <Lz/random.hpp>\n#include <iostream>\n\nint main() {\n    const float min = 0;"
  },
  {
    "path": "examples/range.cpp",
    "chars": 533,
    "preview": "#include <Lz/range.hpp>\n#include <iostream>\n\n\nint main() {\n    for (int i : lz::range(3)) {\n        std::cout << i << ' "
  },
  {
    "path": "examples/regex_split.cpp",
    "chars": 1452,
    "preview": "#include <Lz/algorithm/for_each.hpp>\n#include <Lz/regex_split.hpp>\n#include <iostream>\n#include <string>\n\nint main() {\n "
  },
  {
    "path": "examples/repeat.cpp",
    "chars": 966,
    "preview": "#include <Lz/algorithm/for_each.hpp>\n#include <Lz/repeat.hpp>\n#include <iostream>\n\nint main() {\n    // Example usage of "
  },
  {
    "path": "examples/rotate.cpp",
    "chars": 421,
    "preview": "#include <Lz/rotate.hpp>\n#include <vector>\n#include <iostream>\n\nint main() {\n    std::vector<int> v = { 1, 2, 3, 4, 5 };"
  },
  {
    "path": "examples/slice.cpp",
    "chars": 429,
    "preview": "#include <Lz/slice.hpp>\n#include <iostream>\n#include <vector>\n\nint main() {\n    std::vector<int> v = { 1, 2, 3, 4, 5 };\n"
  },
  {
    "path": "examples/split.cpp",
    "chars": 6908,
    "preview": "#include <Lz/algorithm/for_each.hpp>\n#include <Lz/split.hpp>\n#include <Lz/util/string_view.hpp>\n#include <array>\n#includ"
  },
  {
    "path": "examples/take.cpp",
    "chars": 652,
    "preview": "#include <Lz/take.hpp>\n#include <vector>\n#include <iostream>\n\n\nint main() {\n    std::vector<int> seq = { 1, 2, 3, 4, 5, "
  },
  {
    "path": "examples/take_every.cpp",
    "chars": 722,
    "preview": "#include <Lz/take_every.hpp>\r\n#include <iostream>\r\n#include <vector>\r\n\r\nint main() {\r\n    std::vector<int> sequence = {1"
  },
  {
    "path": "examples/take_while.cpp",
    "chars": 519,
    "preview": "#include <Lz/take_while.hpp>\n#include <iostream>\n#include <vector>\n\nint main() {\n    std::vector<int> vec = { 1, 2, 3, 4"
  },
  {
    "path": "examples/to_container.cpp",
    "chars": 3690,
    "preview": "#include <Lz/algorithm/transform.hpp>\r\n#include <Lz/generate.hpp>\r\n#include <Lz/map.hpp>\r\n#include <Lz/procs/to.hpp>\r\n#i"
  },
  {
    "path": "examples/unique.cpp",
    "chars": 743,
    "preview": "#include <Lz/unique.hpp>\n#include <iostream>\n#include <vector>\n#include <algorithm>\n\nint main() {\n    std::vector<int> v"
  },
  {
    "path": "examples/zip.cpp",
    "chars": 545,
    "preview": "#include <Lz/zip.hpp>\n#include <vector>\n#include <iostream>\n\n\nint main() {\n    std::vector<int> a = {1, 2, 3, 4};\n    st"
  },
  {
    "path": "examples/zip_longest.cpp",
    "chars": 1776,
    "preview": "#include <Lz/zip_longest.hpp>\n#include <iostream>\n#include <list>\n#include <vector>\n\nint main() {\n    std::vector<int> v"
  },
  {
    "path": "include/Lz/algorithm/accumulate.hpp",
    "chars": 1152,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_ACCUMULATE_HPP\n#define LZ_ALGORITHM_ACCUMULATE_HPP\n\n#include <Lz/detail/algorithm/acc"
  },
  {
    "path": "include/Lz/algorithm/adjacent_find.hpp",
    "chars": 1253,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_ADJACENT_FIND_HPP\n#define LZ_ALGORITHM_ADJACENT_FIND_HPP\n\n#include <Lz/detail/algorit"
  },
  {
    "path": "include/Lz/algorithm/algorithm.hpp",
    "chars": 1967,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_UNDERSCORE_HPP\n#define LZ_ALGORITHM_UNDERSCORE_HPP\n\n#include <Lz/algorithm/accumulate"
  },
  {
    "path": "include/Lz/algorithm/all_of.hpp",
    "chars": 839,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_ALL_OF_HPP\n#define LZ_ALGORITHM_ALL_OF_HPP\n\n#include <Lz/algorithm/find_if_not.hpp>\n#"
  },
  {
    "path": "include/Lz/algorithm/any_of.hpp",
    "chars": 817,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_ANY_OF_HPP\n#define LZ_ALGORITHM_ANY_OF_HPP\n\n#include <Lz/algorithm/find_if.hpp>\n\nLZ_M"
  },
  {
    "path": "include/Lz/algorithm/back.hpp",
    "chars": 778,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_BACK_HPP\n#define LZ_ALGORITHM_BACK_HPP\n\n#include <Lz/detail/algorithm/back.hpp>\n\nLZ_M"
  },
  {
    "path": "include/Lz/algorithm/back_or.hpp",
    "chars": 785,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_BACK_OR_HPP\n#define LZ_ALGORITHM_BACK_OR_HPP\n\n#include <Lz/algorithm/back.hpp>\n#inclu"
  },
  {
    "path": "include/Lz/algorithm/binary_search.hpp",
    "chars": 1006,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_BINARY_SEARCH_HPP\n#define LZ_ALGORITHM_BINARY_SEARCH_HPP\n\n#include <Lz/algorithm/lowe"
  },
  {
    "path": "include/Lz/algorithm/contains.hpp",
    "chars": 625,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORTHM_CONTAINS_HPP\n#define LZ_ALGORTHM_CONTAINS_HPP\n\n#include <Lz/algorithm/find.hpp>\n\nLZ_MO"
  },
  {
    "path": "include/Lz/algorithm/copy.hpp",
    "chars": 646,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_COPY_HPP\n#define LZ_ALGORITHM_COPY_HPP\n\n#include <Lz/detail/algorithm/copy.hpp>\n#incl"
  },
  {
    "path": "include/Lz/algorithm/count.hpp",
    "chars": 708,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_COUNT_HPP\n#define LZ_ALGORITHM_COUNT_HPP\n\n#include <Lz/detail/algorithm/count.hpp>\n\nL"
  },
  {
    "path": "include/Lz/algorithm/count_if.hpp",
    "chars": 951,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_COUNT_IF_HPP\n#define LZ_ALGORITHM_COUNT_IF_HPP\n\n#include <Lz/detail/algorithm/count_i"
  },
  {
    "path": "include/Lz/algorithm/empty.hpp",
    "chars": 527,
    "preview": "#pragma once\n\n#ifndef LZ_ALOGORITHM_EMPTY_HPP\n#define LZ_ALOGORITHM_EMPTY_HPP\n\n#include <Lz/detail/compiler_config.hpp>\n"
  },
  {
    "path": "include/Lz/algorithm/ends_with.hpp",
    "chars": 3847,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_ENDS_WITH_HPP\n#define LZ_ALGORITHM_ENDS_WITH_HPP\n\n#include <Lz/detail/algorithm/ends_"
  },
  {
    "path": "include/Lz/algorithm/equal.hpp",
    "chars": 3103,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_EQUAL_HPP\n#define LZ_ALGORITHM_EQUAL_HPP\n\n#include <Lz/detail/algorithm/equal.hpp>\n#i"
  },
  {
    "path": "include/Lz/algorithm/find.hpp",
    "chars": 873,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_FIND_HPP\n#define LZ_DETAIL_ALGORITHM_FIND_HPP\n\n#include <Lz/algorithm/find_if."
  },
  {
    "path": "include/Lz/algorithm/find_if.hpp",
    "chars": 1043,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FIND_IF_HPP\n#define LZ_ALGORITHM_FIND_IF_HPP\n\n#include <Lz/detail/algorithm/find_if.h"
  },
  {
    "path": "include/Lz/algorithm/find_if_not.hpp",
    "chars": 1029,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FIND_IF_NOT_HPP\n#define LZ_ALGORITHM_FIND_IF_NOT_HPP\n\n#include <Lz/algorithm/find_if."
  },
  {
    "path": "include/Lz/algorithm/find_last.hpp",
    "chars": 904,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FIND_LAST_HPP\n#define LZ_ALGORITHM_FIND_LAST_HPP\n\n#include <Lz/algorithm/find_last_if"
  },
  {
    "path": "include/Lz/algorithm/find_last_if.hpp",
    "chars": 1003,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FIND_LAST_IF_HPP\n#define LZ_ALGORITHM_FIND_LAST_IF_HPP\n\n#include <Lz/basic_iterable.h"
  },
  {
    "path": "include/Lz/algorithm/find_last_if_not.hpp",
    "chars": 1073,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FIND_LAST_IF_NOT_HPP\n#define LZ_ALGORITHM_FIND_LAST_IF_NOT_HPP\n\n#include <Lz/algorith"
  },
  {
    "path": "include/Lz/algorithm/find_last_or_default.hpp",
    "chars": 1080,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FIND_LAST_OR_DEFAULT_HPP\n#define LZ_ALGORITHM_FIND_LAST_OR_DEFAULT_HPP\n\n#include <Lz/"
  },
  {
    "path": "include/Lz/algorithm/find_last_or_default_if.hpp",
    "chars": 1228,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FIND_LAST_OR_DEFAULT_IF_HPP\n#define LZ_ALGORITHM_FIND_LAST_OR_DEFAULT_IF_HPP\n\n#includ"
  },
  {
    "path": "include/Lz/algorithm/find_last_or_default_if_not.hpp",
    "chars": 1150,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FIND_LAST_OR_DEFAULT_IF_NOT_HPP\n#define LZ_ALGORITHM_FIND_LAST_OR_DEFAULT_IF_NOT_HPP\n"
  },
  {
    "path": "include/Lz/algorithm/find_last_or_default_not.hpp",
    "chars": 991,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FIND_LAST_OR_DEFAULT_NOT_HPP\n#define LZ_ALGORITHM_FIND_LAST_OR_DEFAULT_NOT_HPP\n\n#incl"
  },
  {
    "path": "include/Lz/algorithm/find_or_default.hpp",
    "chars": 1054,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FIND_OR_DEFAULT_HPP\n#define LZ_ALGORITHM_FIND_OR_DEFAULT_HPP\n\n#include <Lz/algorithm/"
  },
  {
    "path": "include/Lz/algorithm/find_or_default_if.hpp",
    "chars": 1291,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FIND_OR_DEFAULT_IF_HPP\n#define LZ_ALGORITHM_FIND_OR_DEFAULT_IF_HPP\n\n#include <Lz/algo"
  },
  {
    "path": "include/Lz/algorithm/for_each.hpp",
    "chars": 455,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FOR_EACH_HPP\n#define LZ_ALGORITHM_FOR_EACH_HPP\n\n#include <Lz/detail/algorithm/for_eac"
  },
  {
    "path": "include/Lz/algorithm/for_each_while.hpp",
    "chars": 903,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FOR_EACH_WHILE_HPP\n#define LZ_ALGORITHM_FOR_EACH_WHILE_HPP\n\n#include <Lz/detail/algor"
  },
  {
    "path": "include/Lz/algorithm/for_each_while_n.hpp",
    "chars": 807,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FOR_EACH_WHILE_N_HPP\n#define LZ_ALGORITHM_FOR_EACH_WHILE_N_HPP\n\n#include <Lz/detail/a"
  },
  {
    "path": "include/Lz/algorithm/front.hpp",
    "chars": 818,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FRONT_HPP\n#define LZ_ALGORITHM_FRONT_HPP\n\n#include <Lz/algorithm/empty.hpp>\n#include "
  },
  {
    "path": "include/Lz/algorithm/front_or.hpp",
    "chars": 922,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_FRONT_OR_HPP\n#define LZ_ALGORITHM_FRONT_OR_HPP\n\n#include <Lz/detail/compiler_config.h"
  },
  {
    "path": "include/Lz/algorithm/has_many.hpp",
    "chars": 575,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_HAS_MANY_HPP\n#define LZ_ALGORITHM_HAS_MANY_HPP\n\n#include <Lz/algorithm/empty.hpp>\n#in"
  },
  {
    "path": "include/Lz/algorithm/has_one.hpp",
    "chars": 674,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_HAS_ONE_HPP\n#define LZ_ALGORITHM_HAS_ONE_HPP\n\n#include <Lz/algorithm/empty.hpp>\n#incl"
  },
  {
    "path": "include/Lz/algorithm/index_of.hpp",
    "chars": 866,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_INDEX_OF_HPP\n#define LZ_ALGORITHM_INDEX_OF_HPP\n\n#include <Lz/algorithm/index_of_if.hp"
  },
  {
    "path": "include/Lz/algorithm/index_of_if.hpp",
    "chars": 921,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_INDEX_OF_IF_HPP\n#define LZ_ALGORITHM_INDEX_OF_IF_HPP\n\n#include <Lz/detail/algorithm/i"
  },
  {
    "path": "include/Lz/algorithm/is_sorted.hpp",
    "chars": 910,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_IS_SORTED_HPP\n#define LZ_ALGORITHM_IS_SORTED_HPP\n\n#include <Lz/detail/algorithm/is_so"
  },
  {
    "path": "include/Lz/algorithm/lower_bound.hpp",
    "chars": 1196,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_LOWER_BOUND_HPP\n#define LZ_ALGORITHM_LOWER_BOUND_HPP\n\n#include <Lz/detail/algorithm/l"
  },
  {
    "path": "include/Lz/algorithm/max_element.hpp",
    "chars": 933,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_MAX_ELEMENT_HPP\n#define LZ_ALGORITHM_MAX_ELEMENT_HPP\n\n#include <Lz/detail/algorithm/m"
  },
  {
    "path": "include/Lz/algorithm/mean.hpp",
    "chars": 729,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_MEAN_HPP\n#define LZ_ALGORITHM_MEAN_HPP\n\n#include <Lz/detail/algorithm/mean.hpp>\n#incl"
  },
  {
    "path": "include/Lz/algorithm/min_element.hpp",
    "chars": 1090,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_MIN_ELEMENT_HPP\n#define LZ_ALGORITHM_MIN_ELEMENT_HPP\n\n#include <Lz/algorithm/max_elem"
  },
  {
    "path": "include/Lz/algorithm/none_of.hpp",
    "chars": 825,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_NONE_OF_HPP\n#define LZ_ALGORITHM_NONE_OF_HPP\n\n#include <Lz/algorithm/any_of.hpp>\n\nLZ_"
  },
  {
    "path": "include/Lz/algorithm/npos.hpp",
    "chars": 312,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_NPOS_HPP\n#define LZ_ALGORITHM_NPOS_HPP\n\n#include <Lz/detail/compiler_config.hpp>\n\nLZ_"
  },
  {
    "path": "include/Lz/algorithm/nth.hpp",
    "chars": 676,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_NTH_HPP\n#define LZ_ALGORITHM_NTH_HPP\n\n#include <Lz/detail/procs/next_fast.hpp>\n#inclu"
  },
  {
    "path": "include/Lz/algorithm/partition.hpp",
    "chars": 1003,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_PARTITION_HPP\n#define LZ_ALGORITHM_PARTITION_HPP\n\n#include <Lz/detail/algorithm/parti"
  },
  {
    "path": "include/Lz/algorithm/peek.hpp",
    "chars": 764,
    "preview": "#ifndef LZ_ALGORITHM_PEEK_HPP\n#define LZ_ALGORITHM_PEEK_HPP\n\n#include <Lz/detail/algorithm/peek.hpp>\n#include <Lz/detail"
  },
  {
    "path": "include/Lz/algorithm/search.hpp",
    "chars": 1297,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_SEARCH_HPP\n#define LZ_ALGORITHM_SEARCH_HPP\n\n#include <Lz/detail/algorithm/search.hpp>"
  },
  {
    "path": "include/Lz/algorithm/starts_with.hpp",
    "chars": 3710,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_STARTS_WITH_HPP\n#define LZ_ALGORITHM_STARTS_WITH_HPP\n\n#include <Lz/algorithm/equal.hp"
  },
  {
    "path": "include/Lz/algorithm/transform.hpp",
    "chars": 970,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_TRANSFORM_HPP\n#define LZ_ALGORITHM_TRANSFORM_HPP\n\n#include <Lz/detail/algorithm/trans"
  },
  {
    "path": "include/Lz/algorithm/upper_bound.hpp",
    "chars": 1121,
    "preview": "#pragma once\n\n#ifndef LZ_ALGORITHM_UPPER_BOUND_HPP\n#define LZ_ALGORITHM_UPPER_BOUND_HPP\n\n#include <Lz/algorithm/lower_bo"
  },
  {
    "path": "include/Lz/any_iterable.hpp",
    "chars": 5880,
    "preview": "#pragma once\n\n#ifndef LZ_ANY_VIEW_HPP\n#define LZ_ANY_VIEW_HPP\n\n#include <Lz/detail/iterators/any_iterable/any_iterator_i"
  },
  {
    "path": "include/Lz/as_iterator.hpp",
    "chars": 1244,
    "preview": "#pragma once\n\n#ifndef LZ_AS_ITERATOR_HPP\n#define LZ_AS_ITERATOR_HPP\n\n#include <Lz/procs/chain.hpp>\n#include <Lz/detail/a"
  },
  {
    "path": "include/Lz/basic_iterable.hpp",
    "chars": 6084,
    "preview": "#pragma once\n\n#ifndef LZ_BASIC_ITERABLE_HPP\n#define LZ_BASIC_ITERABLE_HPP\n\n#include <Lz/detail/compiler_config.hpp>\n#inc"
  },
  {
    "path": "include/Lz/c_string.hpp",
    "chars": 956,
    "preview": "#pragma once\n\n#ifndef LZ_C_STRING_HPP\n#define LZ_C_STRING_HPP\n\n#include <Lz/procs/chain.hpp>\n#include <Lz/detail/adaptor"
  },
  {
    "path": "include/Lz/cached_size.hpp",
    "chars": 2164,
    "preview": "#pragma once\n\n#ifndef LZ_CACHED_SIZE_HPP\n#define LZ_CACHED_SIZE_HPP\n\n#include <Lz/procs/chain.hpp>\n#include <Lz/detail/a"
  },
  {
    "path": "include/Lz/cartesian_product.hpp",
    "chars": 1454,
    "preview": "#pragma once\n\n#ifndef LZ_CARTESIAN_PRODUCT_HPP\n#define LZ_CARTESIAN_PRODUCT_HPP\n\n#include <Lz/procs/chain.hpp>\n#include "
  },
  {
    "path": "include/Lz/chunk_if.hpp",
    "chars": 5897,
    "preview": "#pragma once\n\n#ifndef LZ_CHUNK_IF_HPP\n#define LZ_CHUNK_IF_HPP\n\n#include <Lz/detail/adaptors/chunk_if.hpp>\n#include <Lz/p"
  },
  {
    "path": "include/Lz/chunks.hpp",
    "chars": 2260,
    "preview": "#pragma once\n\n#ifndef LZ_CHUNKS_HPP\n#define LZ_CHUNKS_HPP\n\n#include <Lz/procs/chain.hpp>\n#include <Lz/detail/adaptors/ch"
  },
  {
    "path": "include/Lz/common.hpp",
    "chars": 1957,
    "preview": "#pragma once\n\n#ifndef LZ_COMMON_HPP\n#define LZ_COMMON_HPP\n\n#include <Lz/procs/chain.hpp>\n#include <Lz/detail/adaptors/co"
  },
  {
    "path": "include/Lz/concatenate.hpp",
    "chars": 1662,
    "preview": "#pragma once\r\n\r\n#ifndef LZ_CONCATENATE_HPP\r\n#define LZ_CONCATENATE_HPP\r\n\r\n#include <Lz/procs/chain.hpp>\r\n#include <Lz/de"
  },
  {
    "path": "include/Lz/detail/adaptors/as_iterator.hpp",
    "chars": 5998,
    "preview": "#pragma once\n\n#ifndef LZ_AS_ITERATOR_ADAPTOR_HPP\n#define LZ_AS_ITERATOR_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_arg"
  },
  {
    "path": "include/Lz/detail/adaptors/c_string.hpp",
    "chars": 1887,
    "preview": "#pragma once\n\n#ifndef LZ_C_STRING_ADAPTOR_HPP\n#define LZ_C_STRING_ADAPTOR_HPP\n\n#include <Lz/detail/iterables/c_string.hp"
  },
  {
    "path": "include/Lz/detail/adaptors/cached_size.hpp",
    "chars": 2435,
    "preview": "#pragma once\n\n#ifndef LZ_CACHED_SIZE_ADAPTOR_HPP\n#define LZ_CACHED_SIZE_ADAPTOR_HPP\n\n#include <Lz/detail/iterables/cache"
  },
  {
    "path": "include/Lz/detail/adaptors/cartesian_product.hpp",
    "chars": 1399,
    "preview": "#pragma once\n\n#ifndef LZ_CARTESIAN_PRODUCT_ADAPTOR_HPP\n#define LZ_CARTESIAN_PRODUCT_ADAPTOR_HPP\n\n#include <Lz/detail/ite"
  },
  {
    "path": "include/Lz/detail/adaptors/chunk_if.hpp",
    "chars": 4922,
    "preview": "#pragma once\n\n#ifndef LZ_CHUNK_IF_ADAPTOR_HPP\n#define LZ_CHUNK_IF_ADAPTOR_HPP\n\n#include <Lz/basic_iterable.hpp>\n#include"
  },
  {
    "path": "include/Lz/detail/adaptors/chunks.hpp",
    "chars": 4335,
    "preview": "#pragma once\n\n#ifndef LZ_CHUNKS_ADAPTOR_HPP\n#define LZ_CHUNKS_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_holder.h"
  },
  {
    "path": "include/Lz/detail/adaptors/common.hpp",
    "chars": 12788,
    "preview": "#pragma once\n\n#ifndef LZ_COMMON_ADAPTOR_HPP\n#define LZ_COMMON_ADAPTOR_HPP\n\n#include <Lz/basic_iterable.hpp>\n#include <Lz"
  },
  {
    "path": "include/Lz/detail/adaptors/concatenate.hpp",
    "chars": 1680,
    "preview": "#pragma once\n\n#ifndef LZ_CONCATENATE_ADAPTOR_HPP\n#define LZ_CONCATENATE_ADAPTOR_HPP\n\n#include <Lz/detail/iterables/conca"
  },
  {
    "path": "include/Lz/detail/adaptors/drop.hpp",
    "chars": 2179,
    "preview": "#pragma once\n\n#ifndef LZ_DROP_ADAPTOR_HPP\n#define LZ_DROP_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_holder.hpp>\n"
  },
  {
    "path": "include/Lz/detail/adaptors/drop_while.hpp",
    "chars": 2322,
    "preview": "#pragma once\n\n#ifndef LZ_DROP_WHILE_ADAPTOR_HPP\n#define LZ_DROP_WHILE_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_"
  },
  {
    "path": "include/Lz/detail/adaptors/duplicates.hpp",
    "chars": 6277,
    "preview": "#pragma once\n\n#ifndef LZ_DUPLICATES_ADAPTOR_HPP\n#define LZ_DUPLICATES_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_"
  },
  {
    "path": "include/Lz/detail/adaptors/enumerate.hpp",
    "chars": 11941,
    "preview": "#pragma once\n\n#ifndef LZ_ENUMERATE_ADAPTOR_HPP\n#define LZ_ENUMERATE_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_ho"
  },
  {
    "path": "include/Lz/detail/adaptors/except.hpp",
    "chars": 5317,
    "preview": "#pragma once\n\n#ifndef LZ_EXCEPT_ADAPTOR_HPP\n#define LZ_EXCEPT_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_holder.h"
  },
  {
    "path": "include/Lz/detail/adaptors/exclude.hpp",
    "chars": 4527,
    "preview": "#pragma once\n\n#ifndef LZ_EXCLUDE_ADAPTOR_HPP\n#define LZ_EXCLUDE_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_holder"
  },
  {
    "path": "include/Lz/detail/adaptors/exclusive_scan.hpp",
    "chars": 9818,
    "preview": "#pragma once\n\n#ifndef LZ_EXCLUSIVE_SCAN_ADAPTOR_HPP\n#define LZ_EXCLUSIVE_SCAN_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/"
  },
  {
    "path": "include/Lz/detail/adaptors/filter.hpp",
    "chars": 2334,
    "preview": "#pragma once\n\n#ifndef LZ_FILTER_ADAPTOR_HPP\n#define LZ_FILTER_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_holder.h"
  },
  {
    "path": "include/Lz/detail/adaptors/flatten.hpp",
    "chars": 3794,
    "preview": "#pragma once\n\n#ifndef LZ_FLATTEN_ADAPTOR_HPP\n#define LZ_FLATTEN_ADAPTOR_HPP\n\n#include <Lz/detail/iterables/flatten.hpp>\n"
  },
  {
    "path": "include/Lz/detail/adaptors/fn_args_holder.hpp",
    "chars": 2156,
    "preview": "#pragma once\n\n#ifndef LZ_FN_ARGS_HOLDER_ADAPTOR_HPP\n#define LZ_FN_ARGS_HOLDER_ADAPTOR_HPP\n\n#include <Lz/detail/compiler_"
  },
  {
    "path": "include/Lz/detail/adaptors/generate.hpp",
    "chars": 1702,
    "preview": "#pragma once\n\n#ifndef LZ_GENERATE_ADAPTOR_HPP\n#define LZ_GENERATE_ADAPTOR_HPP\n\n#include <Lz/detail/iterables/generate.hp"
  },
  {
    "path": "include/Lz/detail/adaptors/generate_while.hpp",
    "chars": 2031,
    "preview": "#pragma once\n\n#ifndef LZ_GENERATE_WHILE_ADAPTOR_HPP\n#define LZ_GENERATE_WHILE_ADAPTOR_HPP\n\n#include <Lz/detail/iterables"
  },
  {
    "path": "include/Lz/detail/adaptors/group_by.hpp",
    "chars": 2756,
    "preview": "#pragma once\n\n#ifndef LZ_GROUP_BY_ADAPTORS_HPP\n#define LZ_GROUP_BY_ADAPTORS_HPP\n\n#include <Lz/detail/adaptors/fn_args_ho"
  },
  {
    "path": "include/Lz/detail/adaptors/inclusive_scan.hpp",
    "chars": 10742,
    "preview": "#pragma once\n\n#ifndef LZ_INCLUSIVE_SCAN_ADAPTOR_HPP\n#define LZ_INCLUSIVE_SCAN_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/"
  },
  {
    "path": "include/Lz/detail/adaptors/interleave.hpp",
    "chars": 3482,
    "preview": "#pragma once\n\n#ifndef LZ_INTERLEAVED_ADAPTOR_HPP\n#define LZ_INTERLEAVED_ADAPTOR_HPP\n\n#include <Lz/detail/iterables/inter"
  },
  {
    "path": "include/Lz/detail/adaptors/intersection.hpp",
    "chars": 6096,
    "preview": "#pragma once\n\n#ifndef LZ_INTERSECTION_ADAPTOR_HPP\n#define LZ_INTERSECTION_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_a"
  },
  {
    "path": "include/Lz/detail/adaptors/iter_tools.hpp",
    "chars": 24632,
    "preview": "#pragma once\n\n#ifndef LZ_ITER_TOOLS_ADAPTORS_HPP\n#define LZ_ITER_TOOLS_ADAPTORS_HPP\n\n#include <Lz/as_iterator.hpp>\n#incl"
  },
  {
    "path": "include/Lz/detail/adaptors/join_where.hpp",
    "chars": 4839,
    "preview": "#pragma once\n\n#ifndef LZ_JOIN_WHERE_ADAPTOR_HPP\n#define LZ_JOIN_WHERE_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_"
  },
  {
    "path": "include/Lz/detail/adaptors/loop.hpp",
    "chars": 4150,
    "preview": "#pragma once\n\n#ifndef LZ_LOOP_ADAPTOR_HPP\n#define LZ_LOOP_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_holder.hpp>\n"
  },
  {
    "path": "include/Lz/detail/adaptors/map.hpp",
    "chars": 2201,
    "preview": "#pragma once\n\n#ifndef LZ_MAP_ADAPTOR_HPP\n#define LZ_MAP_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_holder.hpp>\n#i"
  },
  {
    "path": "include/Lz/detail/adaptors/pairwise.hpp",
    "chars": 1679,
    "preview": "#pragma once\n\n#ifndef LZ_PAIRWISE_ADAPTOR_HPP\n#define LZ_PAIRWISE_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_hold"
  },
  {
    "path": "include/Lz/detail/adaptors/random.hpp",
    "chars": 10229,
    "preview": "#pragma once\n\n#ifndef LZ_RANDOM_ADAPTOR_HPP\n#define LZ_RANDOM_ADAPTOR_HPP\n\n#include <Lz/detail/iterables/random.hpp>\n#in"
  },
  {
    "path": "include/Lz/detail/adaptors/range.hpp",
    "chars": 2566,
    "preview": "#pragma once\n\n#ifndef LZ_RANGE_ADAPTOR_HPP\n#define LZ_RANGE_ADAPTOR_HPP\n\n#include <Lz/detail/iterables/range.hpp>\n\nnames"
  },
  {
    "path": "include/Lz/detail/adaptors/regex_split.hpp",
    "chars": 3907,
    "preview": "#pragma once\n\n#ifndef LZ_REGEX_SPLIT_ADAPTOR_HPP\n#define LZ_REGEX_SPLIT_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_arg"
  },
  {
    "path": "include/Lz/detail/adaptors/repeat.hpp",
    "chars": 2599,
    "preview": "#pragma once\n\n#ifndef LZ_REPEAT_ADAPTOR_HPP\n#define LZ_REPEAT_ADAPTOR_HPP\n\n#include <Lz/detail/iterables/repeat.hpp>\n#in"
  },
  {
    "path": "include/Lz/detail/adaptors/reverse.hpp",
    "chars": 1212,
    "preview": "#pragma once\n\n#ifndef LZ_REVERSE_ADAPTOR_HPP\n#define LZ_REVERSE_ADAPTOR_HPP\n\n#include <Lz/detail/iterables/reverse.hpp>\n"
  },
  {
    "path": "include/Lz/detail/adaptors/rotate.hpp",
    "chars": 3118,
    "preview": "#pragma once\n\n#ifndef LZ_ROTATE_ADAPTOR_HPP\n#define LZ_ROTATE_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_holder.h"
  },
  {
    "path": "include/Lz/detail/adaptors/slice.hpp",
    "chars": 2391,
    "preview": "#pragma once\n\n#ifndef LZ_SLICE_ADAPTOR_HPP\n#define LZ_SLICE_ADAPTOR_HPP\n\n#include <Lz/detail/procs/assert.hpp>\n#include "
  },
  {
    "path": "include/Lz/detail/adaptors/split.hpp",
    "chars": 23972,
    "preview": "#pragma once\n\n#ifndef LZ_SPLIT_ADAPTOR_HPP\n#define LZ_SPLIT_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_holder.hpp"
  },
  {
    "path": "include/Lz/detail/adaptors/take.hpp",
    "chars": 5617,
    "preview": "#pragma once\n\n#ifndef LZ_TAKE_ADAPTOR_HPP\n#define LZ_TAKE_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_holder.hpp>\n"
  },
  {
    "path": "include/Lz/detail/adaptors/take_every.hpp",
    "chars": 6701,
    "preview": "#pragma once\n\n#ifndef LZ_TAKE_EVERY_ADAPTOR_HPP\n#define LZ_TAKE_EVERY_ADAPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_"
  },
  {
    "path": "include/Lz/detail/adaptors/take_while.hpp",
    "chars": 2282,
    "preview": "#pragma once\n\n#ifndef LZ_TAKE_WHILE_ADAPTOR\n#define LZ_TAKE_WHILE_ADAPTOR\n\n#include <Lz/detail/iterables/take_while.hpp>"
  },
  {
    "path": "include/Lz/detail/adaptors/unique.hpp",
    "chars": 7217,
    "preview": "#pragma once\n\n#ifndef LZ_UNIQUE_ADPTOR_HPP\n#define LZ_UNIQUE_ADPTOR_HPP\n\n#include <Lz/detail/adaptors/fn_args_holder.hpp"
  },
  {
    "path": "include/Lz/detail/adaptors/zip.hpp",
    "chars": 2556,
    "preview": "#pragma once\n\n#ifndef LZ_ZIP_ADAPTOR_HPP\n#define LZ_ZIP_ADAPTOR_HPP\n\n#include <Lz/detail/iterables/zip.hpp>\n\nnamespace l"
  },
  {
    "path": "include/Lz/detail/adaptors/zip_longest.hpp",
    "chars": 2855,
    "preview": "#pragma once\n\n#ifndef LZ_ZIP_LONGEST_ADAPTOR_HPP\n#define LZ_ZIP_LONGEST_ADAPTOR_HPP\n\n#include <Lz/detail/iterables/zip_l"
  },
  {
    "path": "include/Lz/detail/algorithm/accumulate.hpp",
    "chars": 1256,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_ACCUMULATE_HPP\n#define LZ_DETAIL_ALGORITHM_ACCUMULATE_HPP\n\n#include <Lz/detail"
  },
  {
    "path": "include/Lz/detail/algorithm/adjacent_find.hpp",
    "chars": 1851,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_ADJACENT_FIND_HPP\n#define LZ_DETAIL_ALGORITHM_ADJACENT_FIND_HPP\n\n#include <Lz/"
  },
  {
    "path": "include/Lz/detail/algorithm/back.hpp",
    "chars": 1579,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_BACK_HPP\n#define LZ_DETAIL_ALGORITHM_BACK_HPP\n\n#include <Lz/detail/procs/asser"
  },
  {
    "path": "include/Lz/detail/algorithm/copy.hpp",
    "chars": 1287,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_COPY_HPP\n#define LZ_DETAIL_ALGORITHM_COPY_HPP\n\n#include <Lz/detail/procs/get_e"
  },
  {
    "path": "include/Lz/detail/algorithm/count.hpp",
    "chars": 824,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_COUNT_HPP\n#define LZ_DETAIL_ALGORITHM_COUNT_HPP\n\n#include <Lz/detail/traits/en"
  },
  {
    "path": "include/Lz/detail/algorithm/count_if.hpp",
    "chars": 1743,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_COUNT_IF_HPP\n#define LZ_DETAIL_ALGORITHM_COUNT_IF_HPP\n\n#include <Lz/detail/pro"
  },
  {
    "path": "include/Lz/detail/algorithm/ends_with.hpp",
    "chars": 1500,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_ENDS_WITH_HPP\n#define LZ_DETAIL_ALGORITHM_ENDS_WITH_HPP\n\n#include <Lz/algorith"
  },
  {
    "path": "include/Lz/detail/algorithm/equal.hpp",
    "chars": 3097,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_EQUAL_HPP\n#define LZ_DETAIL_ALGORITHM_EQUAL_HPP\n\n#include <Lz/detail/procs/get"
  },
  {
    "path": "include/Lz/detail/algorithm/find_if.hpp",
    "chars": 1587,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_FIND_IF_HPP\n#define LZ_DETAIL_ALGORITHM_FIND_IF_HPP\n\n#include <Lz/detail/compi"
  },
  {
    "path": "include/Lz/detail/algorithm/find_last_if.hpp",
    "chars": 2596,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_FIND_LAST_IF_HPP\n#define LZ_DETAIL_ALGORITHM_FIND_LAST_IF_HPP\n\n#include <Lz/de"
  },
  {
    "path": "include/Lz/detail/algorithm/for_each.hpp",
    "chars": 1303,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_FOR_EACH_HPP\n#define LZ_DETAIL_ALGORITHM_FOR_EACH_HPP\n\n#include <Lz/detail/pro"
  },
  {
    "path": "include/Lz/detail/algorithm/for_each_while.hpp",
    "chars": 501,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_FOR_EACH_WHILE_HPP\n#define LZ_DETAIL_ALGORITHM_FOR_EACH_WHILE_HPP\n\n#include <L"
  },
  {
    "path": "include/Lz/detail/algorithm/for_each_while_n.hpp",
    "chars": 2910,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_FOR_EACH_WHILE_N_HPP\n#define LZ_DETAIL_ALGORITHM_FOR_EACH_WHILE_N_HPP\n\n#includ"
  },
  {
    "path": "include/Lz/detail/algorithm/index_of_if.hpp",
    "chars": 625,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_INDEX_OF_IF_HPP\n#define LZ_DETAIL_ALGORITHM_INDEX_OF_IF_HPP\n\n#include <Lz/algo"
  },
  {
    "path": "include/Lz/detail/algorithm/is_sorted.hpp",
    "chars": 1658,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_IS_SORTED_HPP\n#define LZ_DETAIL_ALGORITHM_IS_SORTED_HPP\n\n#include <Lz/detail/t"
  },
  {
    "path": "include/Lz/detail/algorithm/lower_bound.hpp",
    "chars": 1288,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_LOWER_BOUND_HPP\n#define LZ_DETAIL_ALGORITHM_LOWER_BOUND_HPP\n\n#include <Lz/deta"
  },
  {
    "path": "include/Lz/detail/algorithm/max_element.hpp",
    "chars": 1736,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_MAX_ELEMENT_HPP\n#define LZ_DETAIL_ALGORITHM_MAX_ELEMENT_HPP\n\n#include <Lz/deta"
  },
  {
    "path": "include/Lz/detail/algorithm/mean.hpp",
    "chars": 1956,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_MEAN_HPP\n#define LZ_DETAIL_ALGORITHM_MEAN_HPP\n\n#include <Lz/detail/algorithm/a"
  },
  {
    "path": "include/Lz/detail/algorithm/partition.hpp",
    "chars": 2037,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_PARTITION_HPP\n#define LZ_DETAIL_ALGORITHM_PARTITION_HPP\n\n#include <Lz/algorith"
  },
  {
    "path": "include/Lz/detail/algorithm/peek.hpp",
    "chars": 1471,
    "preview": "#pragma once\n\n#ifndef LZ_DETAIL_ALGORITHM_PEEK_HPP\n#define LZ_DETAIL_ALGORITHM_PEEK_HPP\n\n#include <Lz/detail/compiler_co"
  }
]

// ... and 224 more files (download for full content)

About this extraction

This page contains the full source code of the MarcDirven/cpp-lazy GitHub repository, extracted and formatted as plain text for AI agents and large language models (LLMs). The extraction includes 424 files (1.6 MB), approximately 477.7k tokens, and a symbol index with 2607 extracted functions, classes, methods, constants, and types. Use this with OpenClaw, Claude, ChatGPT, Cursor, Windsurf, or any other AI tool that accepts text input. You can copy the full output to your clipboard or download it as a .txt file.

Extracted by GitExtract — free GitHub repo to text converter for AI. Built by Nikandr Surkov.

Copied to clipboard!