Queue<T>

Queue Performance: SystemH vs C# .NET 10 vs STL vs Boost

500,000 operations evaluated on Linux x86_64 across chunked FIFO enqueue, drain dequeue, and steady-state tail latencies.

// SystemH C++: Chunked FIFO Queue with block-amortized allocations
#include "System.h"
using namespace System;
using namespace System::Collections::Generic;

// 1. Instantiation
Queue<int> q = new Queue<int>();

// 2. Fast FIFO Enqueue (3.66 ms - 4.6x faster than .NET 10)
for (int i = 0; i < 500000; i++) {
    q.Enqueue(i * 3 + 1);
}

// 3. Sub-millisecond Dequeue drain (0.86 ms)
int64_t sum = 0;
for (int i = 0; i < 500000; i++) {
    sum += q.Dequeue();
}

// C# .NET 10: System.Collections.Generic.Queue<int>
using System.Collections.Generic;

// 1. Instantiation
var q = new Queue<int>();

// 2. Dynamic Enqueue (16.82 ms - 4.6x slower due to ring array resizing & GC pressure)
for (int i = 0; i < 500_000; i++) {
    q.Enqueue(i * 3 + 1);
}

// 3. Dequeue drain (0.50 ms)
long sum = 0;
for (int i = 0; i < 500_000; i++) {
    sum += q.Dequeue();
}

// GCC STL: std::queue<int> backed by std::deque
#include <queue>

std::queue<int> q;

// 1. Enqueue (2.57 ms)
for (int i = 0; i < 500000; i++) {
    q.push(i * 3 + 1);
}

// 2. Dequeue drain (0.62 ms)
int64_t sum = 0;
for (int i = 0; i < 500000; i++) {
    sum += q.front();
    q.pop();
}

// Boost C++: boost::container::deque<int>
#include <boost/container/deque.hpp>

boost::container::deque<int> q;

// 1. Enqueue (0.49 ms)
for (int i = 0; i < 500000; i++) {
    q.push_back(i * 3 + 1);
}

// 2. Dequeue drain (0.28 ms)
int64_t sum = 0;
for (int i = 0; i < 500000; i++) {
    sum += q.front();
    q.pop_front();
}