Function demonstrate_early_termination

python/examples/performance_demo.py:246–288

Show early termination advantages.

()

def demonstrate_early_termination():
    """Show early termination advantages."""
    print("=== Early Termination Advantage ===\n")

    size = 50000
    data = create_test_data(size)

    bplustree = BPlusTreeMap(capacity=128)
    bplustree.update(data)

    regular_dict = dict(data)

    # Find first 10 items where key > 40000
    print("Find first 10 items where key > 40,000:")

    # B+ Tree approach
    def bplus_early_termination():
        result = []
        for key, value in bplustree.range(40000, None):
            result.append((key, value))
            if len(result) >= 10:
                break
        return result

    bplus_time, bplus_result = benchmark_function(bplus_early_termination)
    print(f"  B+ Tree:  {bplus_time*1000:.3f} ms (found {len(bplus_result)} items)")

    # Dict approach (must scan and sort)
    def dict_early_termination():
        result = []
        for key, value in sorted(regular_dict.items()):
            if key >= 40000:
                result.append((key, value))
                if len(result) >= 10:
                    break
        return result

    dict_time, dict_result = benchmark_function(dict_early_termination)
    print(f"  Dict:     {dict_time*1000:.3f} ms (found {len(dict_result)} items)")

    if dict_time > 0:
        speedup = dict_time / bplus_time
        print(f"  → B+ Tree is {speedup:.1f}x faster for early termination queries!")


def capacity_tuning_demo():