Skip to content

fix(DisjointSetBenchmark): rename ElementCount param to ItemCount so its dashboard card renders #284

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
marius-bughiu merged 1 commit into from
Jul 21, 2026
Merged

fix(DisjointSetBenchmark): rename ElementCount param to ItemCount so its dashboard card renders #284

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 11 additions & 11 deletions src/Celerity.Benchmarks/DisjointSetBenchmark.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -28,28 +28,28 @@ public class DisjointSetBenchmark
private Dictionary<int, HashSet<int>> dictFull = null!;

[Params(1000, 100_000)]
public int ElementCount;
public int ItemCount;

[GlobalSetup]
public void Setup()
{
int edges = ElementCount; // a near-spanning edge stream over the universe
int edges = ItemCount; // a near-spanning edge stream over the universe
edgeA = new int[edges];
edgeB = new int[edges];
var rand = new Random(42);
for (int i = 0; i < edges; i++)
{
edgeA[i] = rand.Next(ElementCount);
edgeB[i] = rand.Next(ElementCount);
edgeA[i] = rand.Next(ItemCount);
edgeB[i] = rand.Next(ItemCount);
}

int queries = Math.Min(ElementCount, 10_000);
int queries = Math.Min(ItemCount, 10_000);
queryA = new int[queries];
queryB = new int[queries];
for (int i = 0; i < queries; i++)
{
queryA[i] = rand.Next(ElementCount);
queryB[i] = rand.Next(ElementCount);
queryA[i] = rand.Next(ItemCount);
queryB[i] = rand.Next(ItemCount);
}

dsFull = BuildCelerity();
Expand Down Expand Up @@ -130,8 +130,8 @@ public int Dictionary_Components()

private DisjointSet<int> BuildCelerity()
{
var ds = new DisjointSet<int>(ElementCount);
for (int i = 0; i < ElementCount; i++)
var ds = new DisjointSet<int>(ItemCount);
for (int i = 0; i < ItemCount; i++)
ds.Add(i);
for (int i = 0; i < edgeA.Length; i++)
ds.Union(edgeA[i], edgeB[i]);
Expand All @@ -140,8 +140,8 @@ private DisjointSet<int> BuildCelerity()

private Dictionary<int, HashSet<int>> BuildDictionary()
{
var map = new Dictionary<int, HashSet<int>>(ElementCount);
for (int i = 0; i < ElementCount; i++)
var map = new Dictionary<int, HashSet<int>>(ItemCount);
for (int i = 0; i < ItemCount; i++)
map[i] = new HashSet<int> { i };

for (int i = 0; i < edgeA.Length; i++)
Expand Down
Loading