We have benchmarks defined to measure the performance of OrderedSet and OrderedDictionary equality to confirm that equality of shared instances perform efficiently (in O(1) time). We would like to add benchmarks for TreeSet and TreeDictionary to confirm the same behavior. We can also go ahead and add those same benchmarks for the system Set and Dictionary implementations.
Changes
We only make changes to benchmarks. This diff contains no implementation changes.
In addition to the new benchmarks, we can also make small changes to previous benchmarks to make them more consistent (we migrate same instance to shared and different instance to unique.
Background
We have
benchmarks
defined to measure the performance ofOrderedSet
andOrderedDictionary
equality to confirm that equality of shared instances perform efficiently (inO(1)
time). We would like to addbenchmarks
forTreeSet
andTreeDictionary
to confirm the same behavior. We can also go ahead and add those samebenchmarks
for the systemSet
andDictionary
implementations.Changes
We only make changes to
benchmarks
. This diff contains no implementation changes.In addition to the new
benchmarks
, we can also make small changes to previousbenchmarks
to make them more consistent (we migratesame instance
toshared
anddifferent instance
tounique
.Benchmarks
Checklist