Stack<T>

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

500,000 operations evaluated on Linux x86_64 across dynamic push, preallocated push, drain pop, and tail latencies.

// SystemH C++: LIFO Stack with optimized store-forwarding & fast Pop
#include "System.h"
using namespace System;
using namespace System::Collections::Generic;

// 1. Dynamic Stack Push (3.20 ms - 4.5x faster than .NET 10)
Stack<int> s = new Stack<int>();
for (int i = 0; i < 500000; i++) {
    s.Push(i * 3 + 1);
}

// 2. Preallocated Push (0.71 ms - 2.5x faster than .NET 10)
Stack<int> sPre = new Stack<int>(500000);
for (int i = 0; i < 500000; i++) {
    sPre.Push(i * 3 + 1);
}

// 3. Ultra-fast Pop drain (0.22 ms - 1.91x faster than STL and .NET 10)
int64_t sum = 0;
for (int i = 0; i < 500000; i++) {
    sum += s.Pop();
}

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

// 1. Dynamic Stack Push (14.29 ms - 4.5x slower)
var s = new Stack<int>();
for (int i = 0; i < 500_000; i++) {
    s.Push(i * 3 + 1);
}

// 2. Preallocated Push (1.77 ms - 2.5x slower)
var sPre = new Stack<int>(500_000);
for (int i = 0; i < 500_000; i++) {
    sPre.Push(i * 3 + 1);
}

// 3. Pop drain (0.44 ms - 2x slower than SystemH)
long sum = 0;
for (int i = 0; i < 500_000; i++) {
    sum += s.Pop();
}

// GCC STL: std::vector<int> LIFO pattern
#include <vector>

std::vector<int> s;

// 1. Dynamic push_back (0.44 ms)
for (int i = 0; i < 500000; i++) {
    s.push_back(i * 3 + 1);
}

// 2. Preallocated push_back (0.32 ms)
std::vector<int> sPre;
sPre.reserve(500000);
for (int i = 0; i < 500000; i++) {
    sPre.push_back(i * 3 + 1);
}

// 3. pop_back drain (0.42 ms)
int64_t sum = 0;
for (int i = 0; i < 500000; i++) {
    sum += s.back();
    s.pop_back();
}

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

boost::container::vector<int> s;

// 1. Dynamic push_back (1.26 ms)
for (int i = 0; i < 500000; i++) {
    s.push_back(i * 3 + 1);
}

// 2. Preallocated push_back (0.21 ms)
boost::container::vector<int> sPre;
sPre.reserve(500000);
for (int i = 0; i < 500000; i++) {
    sPre.push_back(i * 3 + 1);
}

// 3. pop_back drain (0.22 ms)
int64_t sum = 0;
for (int i = 0; i < 500000; i++) {
    sum += s.back();
    s.pop_back();
}