timestamp-store 1.0.0

Fast timestamp-based data structure with O(log N) operations

TimestampStore

Fast data structure for (id, timestamp) pairs with O(log N) operations. Warning! Created by claude-opus-4.5 without human intervention.

Installation

pip install git+https://github.com/shutkanos/timestamp_store.git

Requirements: C++ compiler (g++, clang++, or MSVC)

Installing compiler

• Ubuntu/Debian: sudo apt install g++
• macOS: xcode-select --install
• Windows: Install Visual Studio Build Tools or:

PowerShell:

winget install -e --id MSYS2.MSYS2

MSYS2:

pacman -S mingw-w64-x86_64-gcc

Usage

from timestamp_store import TimestampStore

store = TimestampStore()

# Add pairs
store.add(1, 100)
store.add(2, 50)
store.add(3, 150)

# Remove all with timestamp < 120
removed = store.remove_timestamp(120)
print(removed)  # [2, 1]

# Remove by id
store.remove(3)

# Create from list
store = TimestampStore([(1, 100), (2, 200)])
# Create from dict
store = TimestampStore({1: 100, 2: 200})

Complexity

Operation	Complexity
add(id, timestamp)	O(log N)
remove(id)	O(log N)
remove_timestamp(ts)	O(K) where K = removed count