📊 Performance Benchmark Report

Generated: 3/27/2026, 8:14:09 AM
← Back to Repository | View Markdown Version
Data Structures
17
JS Tests
149
C++ Tests
63

📋 Table of Contents

Queue

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)Native (ms)C++ (ms)js-sdsl (ms)
1M push26.9323.831.7027.59
100K push & shift3.451152.770.202.71
Deque

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)Native (ms)C++ (ms)js-sdsl (ms)
1M push9.7726.811.767.79
1M push & pop14.7527.962.2012.34
1M push & shift14.61-1.94-
100K push & shift1.291243.770.191.17
100K unshift & shift1.261867.280.191.17
DoublyLinkedList

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)Native (ms)C++ (ms)js-sdsl (ms)
100k push5.702.405.701.90
100k unshift5.57884.065.851.52
100k unshift & shift4.042050.715.741.89
100k addAt(mid)1865.99-754.81-
100k addBefore (cursor)6.81-6.18-
SinglyLinkedList

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)Native (ms)C++ (ms)js-sdsl (ms)
100K unshift & shift3.771958.394.80-
10K unshift & shift0.376.260.47-
10K addAt(mid)18.61-5.77-
10K addBefore (cursor)17.56-0.53-
PriorityQueue

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)Native (ms)C++ (ms)js-sdsl (ms)
100K add4.00-1.054.96
100K add & poll22.51-4.5322.97
TreeSet

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)DST classic (ms)Native (ms)C++ (ms)js-sdsl (ms)
1M add995.72807.88-462.00677.58
1M has67.80747.62-444.00655.62
100K rangeSearch17.3416.70---
100K navigable118.65123.91---
TreeMap

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)DST classic (ms)Native (ms)C++ (ms)js-sdsl (ms)
1M set978.72831.32-512.00623.23
1M get127.82719.05-322.00626.87
100K rangeSearch38.1734.42---
100K navigable160.66213.76---
TreeMultiSet

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)Native (ms)C++ (ms)js-sdsl (ms)
1M add (TreeMultiSet expanded iteration)217.73-752.00-
1M has-only (TreeMultiSet)67.67-756.00-
1M count-only (TreeMultiSet)55.74-1332.00-
1M build+has (TreeMultiSet)260.84-1406.00-
1M build+count (TreeMultiSet)267.81-1909.00-
100K delete-one (TreeMultiSet)217.76---
100K setCount (TreeMultiSet)214.66---
1M expanded iteration (TreeMultiSet)54.41---
1M entries view (TreeMultiSet)15.67---
1M size property (TreeMultiSet)0.00---
1M distinctSize property (TreeMultiSet)0.00---
TreeMultiMap

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)Native (ms)C++ (ms)js-sdsl (ms)
1M add (TreeMultiMap bucketed)366.19-731.00-
1M has-only (TreeMultiMap)35.37-833.00-
1M get-only (TreeMultiMap)58.37-1553.00-
1M count-only (TreeMultiMap)105.34-1548.00-
1M build+has (TreeMultiMap)396.87-1519.00-
1M build+get (TreeMultiMap)416.59-2263.00-
100K hasEntry (TreeMultiMap Object.is)375.85---
100K deleteValue (TreeMultiMap Object.is)411.69---
100K firstEntry/lastEntry (TreeMultiMap)0.00---
100K ceilingEntry/floorEntry (TreeMultiMap)0.00---
1M bucket iteration (TreeMultiMap)22.55-109.00-
1M flatEntries iteration (TreeMultiMap)106.47-109.00-
1M size property (TreeMultiMap)0.00---
1M totalSize property (TreeMultiMap)21.74---
RedBlackTree

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)DST classic (ms)Native (ms)C++ (ms)js-sdsl (ms)
1M get99.24304.72-52.97-
200K rangeSearch SEQ1365.15----
200K rangeSearch RAND1565.26----
1M upd SEQ84.75302.03-68.43-
1M upd RAND113.72422.53-158.14-
1M ins SEQ535.64211.38-162.72-
1M ins RAND989.88882.76-483.56-
1M keys-only4.22--0.09-
BST

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)Native (ms)C++ (ms)js-sdsl (ms)
10K add randomly5.50---
10K add & delete randomly10.01---
10K addMany11.62---
10K get10.65---
BinaryTree

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)Native (ms)C++ (ms)js-sdsl (ms)
1K add randomly9.77---
1K add & delete randomly10.05---
1K addMany10.79---
1K get9.64---
1K has9.50---
1K dfs92.87---
1K bfs37.34---
1K morris37.49---
HashMap

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)Native (ms)C++ (ms)js-sdsl (ms)
1M set146.17144.8376.2694.16
1M set & get141.88200.4775.2567.16
1M ObjKey set & get223.16206.6284.40382.79
Trie

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)Native (ms)C++ (ms)js-sdsl (ms)
100K add141.10---
100K getWords57.16---
DirectedGraph

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)Native (ms)C++ (ms)js-sdsl (ms)
1K addVertex0.05---
1K addEdge0.00---
1K getVertex37.54---
1K getEdge74.48---
tarjan0.38---
topologicalSort0.24---
Stack

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)Native (ms)C++ (ms)js-sdsl (ms)
1M push46.3830.281.6532.38
1M push & pop34.5934.532.6234.45
red-black-tree-cjs

Comparison table: DST is data-structure-typed. Values in ms (lower is better). "-" = no equivalent test.

Test CaseDST (ms)Native (ms)C++ (ms)js-sdsl (ms)
1M get97.57---
1M upd SEQ85.76---
1M upd RAND113.48---
1M ins SEQ493.45---
1M ins RAND1023.19---
1M keys-only4.22---