Metadata-Version: 2.2
Name: algoat
Version: 0.2.0
Summary: A high-performance algorithm library for sorting and searching
Author-Email: Sambit Chakraborty <smbtchakraborty@gmail.com>
License:                    GNU LESSER GENERAL PUBLIC LICENSE
                                Version 3, 29 June 2007
         
          Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
          Everyone is permitted to copy and distribute verbatim copies
          of this license document, but changing it is not allowed.
         
         
           This version of the GNU Lesser General Public License incorporates
         the terms and conditions of version 3 of the GNU General Public
         License, supplemented by the additional permissions listed below.
         
           0. Additional Definitions.
         
           As used herein, "this License" refers to version 3 of the GNU Lesser
         General Public License, and the "GNU GPL" refers to version 3 of the GNU
         General Public License.
         
           "The Library" refers to a covered work governed by this License,
         other than an Application or a Combined Work as defined below.
         
           An "Application" is any work that makes use of an interface provided
         by the Library, but which is not otherwise based on the Library.
         Defining a subclass of a class defined by the Library is deemed a mode
         of using an interface provided by the Library.
         
           A "Combined Work" is a work produced by combining or linking an
         Application with the Library.  The particular version of the Library
         with which the Combined Work was made is also called the "Linked
         Version".
         
           The "Minimal Corresponding Source" for a Combined Work means the
         Corresponding Source for the Combined Work, excluding any source code
         for portions of the Combined Work that, considered in isolation, are
         based on the Application, and not on the Linked Version.
         
           The "Corresponding Application Code" for a Combined Work means the
         object code and/or source code for the Application, including any data
         and utility programs needed for reproducing the Combined Work from the
         Application, but excluding the System Libraries of the Combined Work.
         
           1. Exception to Section 3 of the GNU GPL.
         
           You may convey a covered work under sections 3 and 4 of this License
         without being bound by section 3 of the GNU GPL.
         
           2. Conveying Modified Versions.
         
           If you modify a copy of the Library, and, in your modifications, a
         facility refers to a function or data to be supplied by an Application
         that uses the facility (other than as an argument passed when the
         facility is invoked), then you may convey a copy of the modified
         version:
         
            a) under this License, provided that you make a good faith effort to
            ensure that, in the event an Application does not supply the
            function or data, the facility still operates, and performs
            whatever part of its purpose remains meaningful, or
         
            b) under the GNU GPL, with none of the additional permissions of
            this License applicable to that copy.
         
           3. Object Code Incorporating Material from Library Header Files.
         
           The object code form of an Application may incorporate material from
         a header file that is part of the Library.  You may convey such object
         code under terms of your choice, provided that, if the incorporated
         material is not limited to numerical parameters, data structure
         layouts and accessors, or small macros, inline functions and templates
         (ten or fewer lines in length), you do both of the following:
         
            a) Give prominent notice with each copy of the object code that the
            Library is used in it and that the Library and its use are
            covered by this License.
         
            b) Accompany the object code with a copy of the GNU GPL and this license
            document.
         
           4. Combined Works.
         
           You may convey a Combined Work under terms of your choice that,
         taken together, effectively do not restrict modification of the
         portions of the Library contained in the Combined Work and reverse
         engineering for debugging such modifications, if you also do each of
         the following:
         
            a) Give prominent notice with each copy of the Combined Work that
            the Library is used in it and that the Library and its use are
            covered by this License.
         
            b) Accompany the Combined Work with a copy of the GNU GPL and this license
            document.
         
            c) For a Combined Work that displays copyright notices during
            execution, include the copyright notice for the Library among
            these notices, as well as a reference directing the user to the
            copies of the GNU GPL and this license document.
         
            d) Do one of the following:
         
                0) Convey the Minimal Corresponding Source under the terms of this
                License, and the Corresponding Application Code in a form
                suitable for, and under terms that permit, the user to
                recombine or relink the Application with a modified version of
                the Linked Version to produce a modified Combined Work, in the
                manner specified by section 6 of the GNU GPL for conveying
                Corresponding Source.
         
                1) Use a suitable shared library mechanism for linking with the
                Library.  A suitable mechanism is one that (a) uses at run time
                a copy of the Library already present on the user's computer
                system, and (b) will operate properly with a modified version
                of the Library that is interface-compatible with the Linked
                Version.
         
            e) Provide Installation Information, but only if you would otherwise
            be required to provide such information under section 6 of the
            GNU GPL, and only to the extent that such information is
            necessary to install and execute a modified version of the
            Combined Work produced by recombining or relinking the
            Application with a modified version of the Linked Version. (If
            you use option 4d0, the Installation Information must accompany
            the Minimal Corresponding Source and Corresponding Application
            Code. If you use option 4d1, you must provide the Installation
            Information in the manner specified by section 6 of the GNU GPL
            for conveying Corresponding Source.)
         
           5. Combined Libraries.
         
           You may place library facilities that are a work based on the
         Library side by side in a single library together with other library
         facilities that are not Applications and are not covered by this
         License, and convey such a combined library under terms of your
         choice, if you do both of the following:
         
            a) Accompany the combined library with a copy of the same work based
            on the Library, uncombined with any other library facilities,
            conveyed under the terms of this License.
         
            b) Give prominent notice with the combined library that part of it
            is a work based on the Library, and explaining where to find the
            accompanying uncombined form of the same work.
         
           6. Revised Versions of the GNU Lesser General Public License.
         
           The Free Software Foundation may publish revised and/or new versions
         of the GNU Lesser General Public License from time to time. Such new
         versions will be similar in spirit to the present version, but may
         differ in detail to address new problems or concerns.
         
           Each version is given a distinguishing version number. If the
         Library as you received it specifies that a certain numbered version
         of the GNU Lesser General Public License "or any later version"
         applies to it, you have the option of following the terms and
         conditions either of that published version or of any later version
         published by the Free Software Foundation. If the Library as you
         received it does not specify a version number of the GNU Lesser
         General Public License, you may choose any version of the GNU Lesser
         General Public License ever published by the Free Software Foundation.
         
           If the Library as you received it specifies that a proxy can decide
         whether future versions of the GNU Lesser General Public License shall
         apply, that proxy's public statement of acceptance of any version is
         permanent authorization for you to choose that version for the
         Library.
         
Classifier: Development Status :: 4 - Beta
Classifier: Intended Audience :: Developers
Classifier: License :: OSI Approved :: GNU Lesser General Public License v3 (LGPLv3)
Classifier: Operating System :: OS Independent
Classifier: Programming Language :: C++
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.10
Classifier: Programming Language :: Python :: 3.11
Classifier: Programming Language :: Python :: 3.12
Classifier: Programming Language :: Python :: 3.13
Classifier: Programming Language :: Python :: 3.14
Classifier: Programming Language :: Python :: Implementation :: CPython
Classifier: Topic :: Software Development :: Libraries
Project-URL: Homepage, https://github.com/user/algoat
Project-URL: Issues, https://github.com/user/algoat/issues
Requires-Python: >=3.10
Requires-Dist: numpy
Provides-Extra: test
Requires-Dist: pytest; extra == "test"
Description-Content-Type: text/markdown

# Algoat

Algoat is a high-performance C++20 and Python algorithm library featuring smart fallback and dynamic algorithm dispatch based on dataset traits and runtime configuration. It is designed to provide zero-overhead algorithmic primitives for high-performance computing, data processing, and scientific applications.

---

## Features

- **Comprehensive Sorting Suite (20 Algorithms)**:
  - **Hybrid & High-Performance**: Intro Sort, Tim Sort, Block Sort.
  - **Divide & Conquer / Comparison**: Quick Sort, Merge Sort, Heap Sort, Insertion Sort, Shell Sort (Ciura gap sequence), Comb Sort, Cycle Sort, Bitonic Sort, Bubble Sort, Selection Sort, Gnome Sort.
  - **Distribution & Non-Comparative**: Radix Sort (LSD / MSD), Counting Sort, Bucket Sort, Pigeonhole Sort, Boolean Sort.
- **Searching Suite**: Binary Search, Interpolation Search (with arithmetic probe and fallback), Linear Search.
- **Smart Dynamic Dispatch**: Automatically analyzes data profiles in a single $O(N)$ pass to select the optimal algorithm (e.g., `InsertionSort` for $N < 32$, `TimSort` for partially ordered data, `RadixSortLSD` for large integers, `IntroSort` as default).
- **Runtime JSON Configuration**: Dynamically override algorithms or fallback behavior via JSON configuration (`nlohmann/json`).
- **Python nanobind Integration**: Zero-copy Python bindings with support for native Python lists and direct contiguous NumPy `ndarray` views (`float16`, `float32`, `float64`, `int32`, `int64`, `uint32`, `uint64`, `complex64`, `complex128`, `bool_`).

---

## Domain-Specific Numerics & Hardware Acceleration

Algoat implements specialized, non-comparative sorting backends to bypass the standard $O(N \log N)$ comparison constraints for specific numeric domains, significantly outperforming standard libraries:

- **Boolean Arrays (`bool`)**: Utilizes a branchless counting pass and hardware memory sets for $O(N)$ execution (**~23.9x speedup** vs `numpy.sort`).
- **Float16 (`numpy.float16`)**: Employs an order-preserving bit-flipping technique to maintain strict weak ordering without floating-point comparisons, coupled with a cache-aligned 16-bit Counting Sort (**~2.1x speedup** vs `numpy.sort`).
- **Complex Numbers (`complex64`, `complex128`)**: Replaces 1D lexicographical sorting with 2D spatial locality. Offers three configurable space-filling curve backends:
  - **Morton Z-order (Default)**: Computes 64-bit interleaved keys in $O(N)$ using hardware BMI2 `_pdep_u64` instructions, followed by a tuned 4-pass 16-bit Radix Sort (**~2.1x speedup** vs `numpy.sort`). Maximum throughput.
  - **Hilbert Curve**: Continuous space-filling curve providing maximum cache locality for downstream distance/range queries.
  - **Hybrid Curve**: A two-tier hierarchy balancing Morton's fast key generation with Hilbert's continuous locality.

---

## Installation

### Python (via pip)

Cross-platform binary wheels are available for Python 3.10+:
```bash
pip install algoat
```

For editable local development:
```bash
CXX=g++ CC=gcc pip install --no-build-isolation -e .
```

### C++ (via CMake / Source)

Algoat requires a C++20 compliant compiler (`g++-12+`, `clang-14+`, or MSVC 2022+) and CMake 3.21+:

```bash
cmake -B build -DCMAKE_BUILD_TYPE=Release
cmake --build build -j$(nproc)
sudo cmake --install build
```

### C++ (via Package Managers)

> [!NOTE]
> **Coming Soon**: Official packages on Conan Center and vcpkg registries are currently in preparation for the upcoming major release.

**Conan 2.x:**
```bash
conan install --requires algoat/0.1.1
```

**vcpkg:**
```bash
vcpkg install algoat
```

---

## Usage

### C++ Usage

```cpp
#include <algoat/algoat.hpp>
#include <iostream>
#include <vector>
#include <span>

int main() {
    std::vector<int> data = {42, 7, 19, 100, 3, 55, 21};

    // Automatically selects the best sorting algorithm based on data traits
    algoat::sort(std::span{data});

    // Automatically selects the best searching algorithm (BinarySearch for sorted data)
    auto res = algoat::search(std::span{data}, 19);
    if (res) {
        std::cout << "Found 19 at index " << *res << "\n";
    }

    return 0;
}
```

### Python Usage

```python
import algoat
import numpy as np

# Smart dispatch — automatically routes to the O(N) Float16 hybrid sort
arr = np.random.rand(1_000_000).astype(np.float16)
sorted_arr = algoat.sort(arr)

# Sort standard Python lists out-of-place or in-place
data = [42, 7, 19, 100, 3, 55, 21]
algoat.sort_inplace(data) # [3, 7, 19, 21, 42, 55, 100]

# Search in sorted data
index = algoat.search(data, 19)
print(index)  # 2
```

---

## Examples & Benchmarks

For complete, runnable standalone examples and benchmark suites, see:
- **[C++ Examples](examples/cpp/README.md)**: Contains `basic_usage.cpp` and `physics_simulation_2d.cpp`.
- **[Python Examples](examples/python/README.md)**: Contains `basic_usage.py`, `iot_sensor_analysis.py`, and the `benchmark.py` NumPy speedup suite.

---

## Architecture & Contributing

Algoat uses a **Registry and Dispatcher** pattern. Algorithms are registered using a `std::variant` to eliminate virtual table (`vtable`) overhead. The `Dispatcher` dynamically analyzes incoming data using `DataTraits` (size, sortedness ratio, duplicates) and selects an optimal algorithm if one is not explicitly configured via `AlgoConfig`.

- For an in-depth guide on the internal architecture, static dispatch mechanics, and domain numerics, see [ARCHITECTURE.md](ARCHITECTURE.md).
- For local environment setup, build and test workflows, code style guidelines, and contribution recipes, see [CONTRIBUTING.md](CONTRIBUTING.md).

---

## License

Algoat is released under the [GNU Lesser General Public License v3.0 (LGPL-3.0)](LICENSE).
