Function demo_real_world_migration

python/examples/migration_guide.py:223–267

Show a realistic migration example.

()

def demo_real_world_migration():
    """Show a realistic migration example."""
    print("\n=== Real-World Migration Example ===\n")

    print("Scenario: User session management system")
    print("\nBEFORE (dict-based):")
    print("```python")
    print("# Original implementation")
    print("user_sessions = {}")
    print("user_sessions[timestamp] = session_data")
    print("# To get recent sessions, need to sort keys")
    print("recent = sorted(user_sessions.items())[-10:]")
    print("```")

    print("\nAFTER (BPlusTree-based):")
    print("```python")
    print("# Migrated implementation")
    print("user_sessions = BPlusTreeMap(capacity=64)")
    print("user_sessions[timestamp] = session_data")
    print("# Get recent sessions efficiently")
    print("cutoff = time.time() - 3600  # Last hour")
    print("recent = list(user_sessions.range(cutoff, None))")
    print("```")

    # Demonstrate the improvement
    import time

    user_sessions = BPlusTreeMap(capacity=64)
    current_time = time.time()

    # Add session data
    for i in range(100):
        timestamp = current_time - (100 - i) * 60  # Sessions over last 100 minutes
        user_sessions[timestamp] = {
            "user_id": f"user_{i % 20}",
            "action": f"action_{i}",
            "ip": f"192.168.1.{i % 255}",
        }

    # Get sessions from last 30 minutes
    cutoff = current_time - 30 * 60
    recent_sessions = list(user_sessions.range(cutoff, None))

    print(f"\nResult: Found {len(recent_sessions)} recent sessions efficiently!")
    print("This would require sorting the entire dict with the original approach.")


def main():