Function benchmark_insertion

python/examples/performance_demo.py:175–218

Benchmark insertion performance.

()

def benchmark_insertion():
    """Benchmark insertion performance."""
    print("=== Insertion Performance ===\n")

    sizes = [1000, 5000, 10000]

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

        data = create_test_data(size)
        random.shuffle(data)  # Random insertion order

        # B+ Tree insertion
        def bplus_insert():
            tree = BPlusTreeMap(capacity=64)
            for key, value in data:
                tree[key] = value
            return tree

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

        # Dict insertion
        def dict_insert():
            d = {}
            for key, value in data:
                d[key] = value
            return d

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

        if HAS_SORTEDDICT:

            def sorted_dict_insert():
                sd = SortedDict()
                for key, value in data:
                    sd[key] = value
                return sd

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

        print()


def benchmark_memory_usage():