Hash Random Int Subscript Find Timing Test (original) (raw)

Hash-Based Random-Integer operator[] FindTiming Test

Description

This test inserts a number of values with uniform i.i.d. integer keys into a container, then performs a series of finds using operator[]. It measures the average time for operator[] as a function of the number of values inserted.

(The test was executed with hash_random_int_subscript_find_timing_test 200 200 2100)

Purpose

The test checks the effect of different underlying hash-tables (see Design::Hash-Based Containers ), range-hashing functions, and trigger policies (see Design::Hash-Based Containers::Hash Policies and Design::Hash-Based Containers::Resize Policies ).

Results

Figures NCCG, NCCM, and NCCL show the results for the native and collision-chaining types in g++, MSVC++, andlocal, respectively; Figures NGPG, NGPM, and NGPL show the results for the native and probing types in g++, MSVC++, andlocal, respectively.

NCCL: Native and collision-chaining hash random int find timing test using

operator

[] - local

NGPL: Native and probing hash random int find timing test using

operator

[] - local

Observations

This test shows similar results to Hash-Based Random-Integer find Find Timing Test .