Function benchmark_iteration

python/examples/performance_demo.py:123–172

Benchmark full iteration performance.

()

def benchmark_iteration():
    """Benchmark full iteration performance."""
    print("=== Full Iteration Performance ===\n")

    sizes = [1000, 5000, 10000, 20000]

    for size in sizes:
        print(f"Dataset size: {size:,} items")

        data = create_test_data(size)

        # Setup data structures
        bplustree = BPlusTreeMap(capacity=64)
        bplustree.update(data)

        regular_dict = dict(data)

        if HAS_SORTEDDICT:
            sorted_dict = SortedDict(data)

        # B+ Tree iteration
        def bplus_iterate():
            return sum(1 for _ in bplustree.items())

        bplus_time, _ = benchmark_function(bplus_iterate)
        print(f"  B+ Tree:     {bplus_time*1000:.3f} ms")

        # Dict iteration (unsorted)
        def dict_iterate():
            return sum(1 for _ in regular_dict.items())

        dict_time, _ = benchmark_function(dict_iterate)
        print(f"  Dict:        {dict_time*1000:.3f} ms")

        # Sorted dict iteration
        def sorted_dict_iterate():
            return sum(1 for _ in sorted(regular_dict.items()))

        sorted_time, _ = benchmark_function(sorted_dict_iterate)
        print(f"  Dict sorted: {sorted_time*1000:.3f} ms")

        if HAS_SORTEDDICT:

            def sorteddict_iterate():
                return sum(1 for _ in sorted_dict.items())

            sd_time, _ = benchmark_function(sorteddict_iterate)
            print(f"  SortedDict:  {sd_time*1000:.3f} ms")

        print()


def benchmark_insertion():