stl 0.1.5

A performance-oriented implementation of STL patterns (Vector, List, algorithms) for Dart.

example/stl_example.dart

import 'package:stl/stl.dart';

void main() {
  print('========================================');
  print('    📦 STL Vector for Dart - Showcase');
  print('========================================\n');

  // 1. Initialization (const and final)
  print('--- 1. Initialization & toString() ---');
  const v1 = Vector<int>([1, 2, 3]);
  final v2 = Vector<int>([1, 2, 3]);
  final v3 = Vector<int>([1, 2, 100]);

  print('v1 (const): $v1');
  print('v2 (final): $v2');
  print('v3 (final): $v3\n');

  // 2. Deep Equality
  print('--- 2. Deep Equality (operator ==) ---');
  print('Is v1 == v2? ${v1 == v2}  <-- True value-based equality!');
  print('Is v1 == v3? ${v1 == v3}\n');

  // 3. Lexicographical Comparison
  print('--- 3. Lexicographical Comparison ---');
  if (v3 > v1) {
    print('$v3 is strictly greater than $v1');
  }
  print('Is v1 <= v2? ${v1 <= v2}\n');

  // 4. Modifiers (push_back, pop_back, insert, clear)
  print('--- 4. Modifiers ---');
  final dynamicVec = Vector<String>(['Apple', 'Banana']);
  print('Initial Vector: $dynamicVec');

  dynamicVec.push_back('Cherry');
  print('After push_back: $dynamicVec');

  dynamicVec.insert(1, 'Blueberry');
  print('After insert at index 1: $dynamicVec');

  dynamicVec.pop_back();
  print('After pop_back: $dynamicVec\n');

  // 5. Memory Safety & Bounds Checking
  print('--- 5. Memory Safety & Strict Bounds ---');
  try {
    print('Attempting to access dynamicVec[100]...');
    final _ = dynamicVec[100]; // This will throw!
  } catch (e) {
    print('Caught expected memory safety guard: $e\n');
  }

  // 6. Iterable Support
  print('--- 6. Dart Iterable Support ---');
  final numbers = Vector<int>([10, 15, 20, 25, 30]);
  print('Iterating through $numbers in a for-in loop:');
  for (final n in numbers) {
    print(' -> $n');
  }

  // 7. Concatenation
  print('--- 7. Concatenation ---');
  final v4 = Vector<int>([1, 2, 3]);
  final v5 = Vector<int>([4, 5, 6]);
  final v6 = v4 + v5;
  print('v4: $v4');
  print('v5: $v5');
  print('v4 + v5: $v6\n');

  ///8. Multiplication
  print('--- 8. Multiplication ---');
  final v7 = Vector<int>([1, 2, 3]);
  final v8 = v7 * 3;
  print('v7: $v7');
  print('v7 * 3: $v8\n');

  ///9. Subtraction
  print('--- 9. Subtraction ---');
  final v9 = Vector<int>([1, 2, 3]);
  final v10 = Vector<int>([1, 2, 3]);
  final v11 = v9 - v10;
  print('v9: $v9');
  print('v10: $v10');
  print('v9 - v10: $v11\n');

  /// 10. ~ operator
  final v12 = Vector<int>([1, 2, 3]);
  final v13 = ~v12;
  print('v12: $v12');
  print('~v12: $v13\n');

  print(v12.at(1));
  print(v12.front());
  print(v12.back());
  print(v12.empty());
  print(v12.size());
  print(v12.contains(1));
  print(v12.indexOf(1));
  v12.remove(1);
  print(v12);
  v12.removeAt(1);
  print(v12);
  v12.removeLast();
  print(v12); // v12 is now empty []!

  // Let's add elements back before removing a range
  v12.push_back(10);
  v12.push_back(20);
  v12.push_back(30);
  print('Repopulated to test removeRange: $v12');

  v12.removeRange(0, 1);
  print(v12);
  v12.removeWhere((n) => n == 1);
  print(v12);
  v12.retainWhere((n) => n == 1);
  print(v12);
  v12.clear();
  print(v12);

  // Using powerful Iterable methods completely for free!
  final evens = numbers.where((n) => n % 2 == 0).toList();
  print('\nUsing internal `.where()` on the vector:');
  print('Filtered even numbers: $evens');

  print('\n========================================');
  print('  🎉 Showcase Complete!');
  print('========================================\n');
}