stl 0.4.3

Supercharge Dart & Flutter with a bleeding-edge C++ STL architecture. Unlock zero-cost primitives, heavy-duty collections, and C++23 ranges.

STL (Standard Template Library... and Beyond!)

🚀 A highly-versatile, performance-driven bank of data collections, structures, and algorithmic ranges for the Dart and Flutter ecosystem.

---

🛠️ Quick Install

dart pub add stl

or for Flutter:

flutter pub add stl

🌈 The Vision

Originally inspired by the strict blueprints of the C++ Standard Template Library (STL), this package has heavily evolved into a comprehensive bank of diverse collections for all your data structure needs. Whether you require familiar sequential containers, complex associative maps, specialized utility adapters, or bleeding-edge C++23 functional ranges, stl drastically supercharges your Dart architecture! ✨

🎯 Why use this package over standard Dart tools?

• 📦 Massive Bank of Collections: Unlock custom abilities via Vector, Deque, Stack, ForwardList, and more!
• 🌀 Next-Gen Iteration: Introducing Ranges! Seamlessly generate subsets, zips, Cartesian products, and infinite loops on the fly without breaking your memory limit.
• ⚡ Deterministic Performance: Predictable time complexity ($O(1)$, $O(\log n)$, etc.) with heavily optimized system-level logic.
• 🛠 Familiar yet Dart-y API: Native Iterable mixins seamlessly integrated with perfectly replicated C++ architectural rules, wrapped cleanly in standard Dart camelCase for maximum ecosystem interoperability.
• 🎨 Ready for Everything: Perfect for logic-heavy Flutter apps, scalable game engines, dynamic state management, or enterprise backend systems.

---

📚 The Collection Bank

Here are the traditional core data structures currently fully supported and battle-tested:

🚅 Linear Containers

Data Structure	Description	Time Complexity (Access)
🚂 Vector<T>	Dynamic array with contiguous memory behavior, strict bounds checking, and powerful modifiers.	$O(1)$
🚅 ForwardList<T>	Singly linked list optimized for extremely fast forward traversal, insertions, and shifting.	$O(N)$
🧊 Array<T>	Conceptually strict fixed-size contiguous array mirroring C++ std::array.	$O(1)$

🥞 Adapter Containers

Data Structure	Description	Behavior
🥞 Stack<T>	Custom LIFO (Last-In, First-Out) adapter. Operates flawlessly over any given sequence.	LIFO
🚏 Queue<T>	Custom FIFO (First-In, First-Out) adapter for messaging and task processing.	FIFO
⏳ PriorityQueue<T>	Max/Min heap priority structure. Constantly dynamically sorts elements upon insertion.	$O(\log N)$

🗃️ Associative Containers

Data Structure	Description
🗃️ Set<T>	Unique element container ensuring no duplicates with generic equality support.
🌲 SortedSet<T>	Tree-based strictly sorted unique container mirroring C++ std::set. Keeps data autonomously ordered.
🌭 Deque<T>	Double-ended queue allowing extremely fast front/back algorithmic insertions & removals without memory reallocation overhead.

🛠️ Utility Structures

Utility	Description
👯 Pair<T1, T2>	Native C++ utility structure to hold heterogeneous objects. Features gorgeous Dart 3 Record translation.
✨ Optional<T>	A beautifully sealed functional wrapper representing possibly-absent values smoothly without relying on raw null checks.
🔀 Variant<T0, T1...>	Type-safe discriminated union handling distinct architectural alternatives elegantly via exhausted switch statements.
📦 Box<T> / Ref<T>	Wrappers unlocking primitive pass-by-reference logic with dynamic mathematical operators.
🔢 BitSet	Hyper-efficient space-optimized boolean bit flags array mimicking std::bitset. $O(1)$ toggles.
👽 Any	Generic type-safe bounding box safely encapsulating abstract data with strictly enforced extraction boundaries.

🧱 Primitives (Fixed-Width Integers)

stl provides two distinctly different architectural branches for bounded hardware-level integers.

1. Zero-Cost Primitives

Extremely lightweight extension type models scaling directly utilizing Dart Native performance bounds without allocating dynamic memory on the heap. Ideal for tight, high-performance logic loops natively!

Type	Description
🔢 I8, I16, I32, I64	Signed integer zero-cost wrappers. Provides automatic arithmetic wrap-around, checked methods (e.g. addChecked), and strict min/max boundaries. (I64 deeply integrates two's complement constraints).
🔢 U8, U16, U32, U64	Unsigned integer variants mathematically bounding state within their respective non-negative bit frames seamlessly.

2. TypedData Primitives (Hardware Backed)

Warning

Architectural Difference: Unlike the zero-cost I8/U8 variants above, these types dynamically allocate a dart:typed_data list sequentially behind the scenes (e.g., Int8List(1)). Memory allocations inside tight math loops inherently add garbage-collection pressure—however, these structures grant absolute native hardware limits precisely mimicking exact C++ data structures flawlessly. Furthermore, they retain perfectly strict exact 64-bit precision bounds across JavaScript/Web layout environments flawlessly!

Type	Description
🔢 Int8, Int16, Int32, Int64	Hardware-backed signed equivalents enforcing strict boundary overflow natively at the OS hardware/V8 buffer layout level.
🔢 Uint8, Uint16, Uint32, Uint64	Hardware-backed unsigned integers utilizing exact standard array memory to process mathematically clean unsigned rollovers securely.

🧮 Math Module

The stl math modules provide robust implementations of C++ mathematical constants, number theory logic, <numeric> algorithms for sequences, and <cmath> algorithmic behaviors missing natively in Dart.

Module	Description
🔢 numeric	Extensions for collections offering accumulate(), innerProduct(), adjacentDifference(), partialSum(), and iota().
🧮 cmath	Missing mathematically safe operations including clamp(), lerp(), and overflow-safe robust hypot().
🧲 complex	Full-scale complex numbers implementation Complex with operator overloading (+, -, *, /) and utility algorithms (abs(), conj(), pow()).
🔬 number_theory	Highly-optimized logic for gcd(), lcm(), isPrime(), primeFactorization(), and midpoint().
🏛️ constant	20+ strictly pure IEEE 754 constants separated logically according to ISO 80000-2 (e.g. pi, tau, phi, catalan).

📐 Geometry Module (2D Space)

Euclidean geometry engine structured strictly via named parameters for explicit dimension management.

Entity	Description
📍 Point	Represents an exact 2D coordinate (x, y) in space utilizing precise hypot distances.
⭕ Circle	Computes absolute Pi area boundaries via deeply guarded {required radius}.
🔲 Rectangle	Basic bounding box dimensions via explicitly tracked {required width, height}.
🔺 Triangle	Pre-calculates Herons theorem and enforces native bounds limits via {required sideA, sideB, sideC}.

---

🧬 Ranges Module (Inspired by C++23)

Welcome to functional magic! Inspired deeply by C++23 std::views, our Ranges module allows you to cleanly manipulate, combine, generate, and stream data iteratively without aggressively eager memory consumption. Operations are performed lazily, bringing algorithmic elegance to your pipeline.

🔥 Spotlight Ranges

📐 NumberLine (Iota)

Mimicking std::views::iota. Generate precise linear layouts of floating-point boundaries, or standard integer jumps, in mathematically optimized $O(1)$ operations instead of building massive explicit arrays.

// Custom Step Increment of 4 (0 to 20):
final evens = NumberLine(0, 20, step: 4);
print(evens.toList()); // [0, 4, 8, 12, 16]

// Highly mathematically optimized checks:
print(evens.contains(12)); // True! (Does NOT iterate over memory)

🔗 ZipRange (Parallel Iteration)

Mimics std::views::zip. Dynamically clamp two different structured iterables together until the shortest one expires. Phenomenal for generating maps!

final keys = ['Player1', 'Player2', 'Player3'];
final scores = [9500, 8400]; // Uneven length!

final zipped = ZipRange(keys, scores);
final scoreMap = Map.fromEntries(zipped.map((p) => p.toMapEntry()));
// Results: {'Player1': 9500, 'Player2': 8400}

🔲 ChunkRange (Data Fragmentation)

Mimics std::views::chunk. Need to batch network packets or paginate rendering blocks? ChunkRange divides collections precisely into requested sizing constraints.

final data = [1, 2, 3, 4, 5, 6, 7];
final pagination = ChunkRange(data, 3);
print(pagination.toList()); 
// Results: [[1, 2, 3], [4, 5, 6], [7]]

🧩 CartesianRange (Combinations)

Mimics std::views::cartesian_product. Produces flat combinatorial intersections elegantly.

final suits = ['Hearts', 'Spades'];
final ranks = ['King', 'Queen'];

final deck = CartesianRange(suits, ranks);
// Yields Pairs: (Hearts, King), (Hearts, Queen), (Spades, King), (Spades, Queen)

♾️ RepeatRange (Infinite Streams)

Mimics std::views::repeat. Repeat specific data continuously or infinitely. Perfect for mock data pipelines!

final zeroes = RepeatRange(0);
print(zeroes.take(5).toList()); // [0, 0, 0, 0, 0]

✂️ TakeRange & DropRange (Slicing)

Mimics std::views::take and std::views::drop. Extract or ignore sections of an iterable pipeline iteratively without explicitly allocating memory-heavy sublists.

final data = NumberLine(1, 10).toList();
final middle = TakeRange(DropRange(data, 3), 4);
print(middle.toList()); // [4, 5, 6, 7]

🧪 FilterRange & TransformRange (Functional Hooks)

Mimics std::views::filter and std::views::transform. Eagerly processes data dynamically through custom conditional predicates and data type mutating hooks.

final data = [1, 2, 3, 4, 5];
// Keep evens, then multiply by 10
final tens = TransformRange<int, int>(FilterRange(data, (int n) => n % 2 == 0), (int n) => n * 10);
print(tens.toList()); // [20, 40]

🌊 JoinRange (Stream Flattening)

Mimics std::views::join. Instantly reassembles an iterable of iterables back into a perfectly contiguous 1-dimensional functional flow without recursive allocations.

final arrays = [[1, 2], [], [3, 4, 5], [6]];
final stream = JoinRange(arrays);
print(stream.toList()); // [1, 2, 3, 4, 5, 6]

---

💻 Spotlight Integrations

By blending C++ architectures with Dart's IterableMixin, stl gives you incredible syntactical power:

🚂 Vector Memory Architecture

final vec = Vector<String>(['Apple', 'Banana']);
vec.pushBack('Cherry');
vec.popBack();
print(vec.front()); // "Apple"

👯 The Powerful Pair & Dart 3 Records

// Effortless Pair initialization
var duo = makePair(99, 'Balloons');

// Native Dart 3 tuple/record unwrapping
var (count, item) = duo.record;

// Native deep equality
var sibling = makePair(99, 'Balloons');
print(duo == sibling); // True!

🥞 Iterable Adapters (Stack)

final stack = Stack<int>.from([1, 2, 3]); // Top element is 3
var removed = stack.pop(); // Removes and returns 3

// Instantly iterable safely from top-to-bottom! 
for (var item in stack) {
  print(item); // 2, then 1
}

🌲 Autonomous Self-Balancing Sets (SortedSet)

final sorted = SortedSet<String>((a, b) => b.length.compareTo(a.length));
sorted.insert("Strawberry");
sorted.insert("Apple"); 
sorted.insert("A");

print(sorted.toList()); 
// ["Strawberry", "Apple", "A"] (Sorting strictly maintained on insert!)

---

💖 Contributing

Want to see an exotic data structure, an algorithmic graph traversal, or a missing std::ranges feature added to the library? We emphatically welcome pull requests, bug reports, and issue tickets. Let's make this the most powerful and scalable system-level algorithms repository in the Flutter and Dart ecosystem! 🌟

Engineered with passion for Dart & Flutter architectures.