segee 0.1.0

A high-performance, enterprise-grade Segment Tree implementation for Python

🌳 Segee

Lightning-fast range queries with O(log n) performance and modern Python design.

✨ Features

🚀 High Performance - O(log n) range queries and updates
🔒 Type Safe - Complete generic type hints for Python 3.12+
🏢 Enterprise Ready - Comprehensive error handling and validation
🧪 Battle Tested - 152 unit tests with ground truth validation
🐍 Pythonic - Full sequence protocol support (tree[i], len(tree), etc.)
⚡ Zero Dependencies - Pure Python with no external requirements

🚀 Quick Start

from segee import SumSegmentTree, MinSegmentTree, MaxSegmentTree

# Sum queries - perfect for range sum problems
sum_tree = SumSegmentTree(1000)
sum_tree[100] = 42
sum_tree[200] = 58
print(sum_tree.sum(100, 201))  # 100

# Min/Max queries - ideal for range minimum/maximum problems  
min_tree = MinSegmentTree(1000)
min_tree[50:55] = [10, 5, 20, 15, 8]
print(min_tree.minimum(50, 55))  # 5

# Custom operations - build your own segment tree
import operator, math
gcd_tree = SegmentTree(100, 0, math.gcd)

📦 Installation

pip install segee

🏗️ Architecture

segee/
├── segment_tree/           # Segment tree implementations
│   ├── segment_tree.py    # Generic segment tree core
│   └── specialized.py     # Sum/Min/Max convenience classes
├── exceptions.py          # Custom exception hierarchy  
└── _types.py             # Type definitions and protocols

📚 Documentation

• Usage Guide - Comprehensive examples and patterns
• API Reference - Complete method documentation
• Performance - Benchmarks and complexity analysis
• Contributing - Development setup and guidelines

📄 License

MIT License - see LICENSE for details.

---

Built with ❤️ for the Python community

🐛 Report Bug • ✨ Request Feature • 📖 Documentation