2025-04-05 14:21:11 +00:00
< html >
< head >
< meta charset = "UTF-8" / >
< link href = "results.css" rel = "stylesheet" / >
< title > SimStr benchmarks results< / title >
< link rel = "stylesheet" href = "https://cdnjs.cloudflare.com/ajax/libs/highlight.js/11.9.0/styles/default.min.css" >
< script src = "https://cdnjs.cloudflare.com/ajax/libs/highlight.js/11.9.0/highlight.min.js" > < / script >
< script src = "https://cdn.jsdelivr.net/npm/chart.js" > < / script >
< script >
let bench_sets = {};
let activeBuilder = buildTestsByPlatformsBar;
let buildAsLine = {
"Copy not literal Str with N symbols": "Length of the copied string",
"Replace All Str To Longer Size": "Length of the string to be replaced",
"Replace All Str To Same Size": "Length of the string to be replaced"
};
function hl() {
document.querySelectorAll('.tooltiptext.code').forEach((el) => {
hljs.highlightElement(el);
});
}
function addBarChart(id, data) {
let canvas = document.getElementById('chart' + id);
new Chart(canvas, {
type: 'bar',
data: data,
options: {
scales: {
y: {
beginAtZero: true
},
x: {
title: {
text: "Time (ns)",
display: true
}
}
},
indexAxis: 'y',
plugins: {
legend: {
position: 'right',
labels: {
font: {
family: "'Cascadia Code', Consolas, 'Courier New', Courier, monospace"
}
}
}
}
}
});
}
function platformChecked(idx) {
return document.getElementById('pl' + idx).checked;
}
function buildPlatformsByTestsBar(bsName) {
if (buildAsLine[bsName]) {
buildPlatformsByTestsLine(bsName, buildAsLine[bsName]);
return;
}
let data = { labels: [], datasets: [] };
for (const i in platform_names) {
if (platformChecked(i))
data.datasets.push({ label: platform_names[i], data: [], borderWidth: 1 });
}
let bs = bench_sets[bsName];
for (const test of bs.tests) {
data.labels.push(test.name);
let ds = 0;
for (const i in test.data) {
if (platformChecked(i)) {
data.datasets[ds++].data.push(test.data[i]);
}
}
}
addBarChart(bs.id, data);
}
function buildTestsByPlatformsBar(bsName) {
if (buildAsLine[bsName], buildAsLine[bsName]) {
buildTestsByPlatformsLine(bsName, buildAsLine[bsName]);
return;
}
let data = { labels: [], datasets: [] };
let bs = bench_sets[bsName];
for (const test of bs.tests) {
data.datasets.push({ label: test.name, data: [], borderWidth: 1 });
}
for (const i in platform_names) {
if (platformChecked(i)) {
data.labels.push(platform_names[i]);
for (const j in bs.tests) {
data.datasets[j].data.push(bs.tests[j].data[i]);
}
}
}
addBarChart(bs.id, data);
}
function buildCanvas(plCount) {
document.querySelectorAll("canvas.bench_chart").forEach(e => e.remove());
for (var bs_name in bench_sets) {
let bs = bench_sets[bs_name];
if (plCount) {
let canvas = document.createElement('canvas');
canvas.id = "chart" + bs.id;
canvas.classList.add('bench_chart');
let h = 20 * plCount * bs.tests.length;
canvas.style.width = "100%";
canvas.style.height = h + "px";
canvas.height = h * devicePixelRatio;
document.getElementById(bs.id).after(canvas);
}
}
}
function addLineChart(canvas, data, title, scaleTitle) {
new Chart(canvas, {
type: 'line',
data: data,
options: {
scales: {
y: {
beginAtZero: true,
title: {
text: scaleTitle,
display: true
}
},
x: {
title: {
text: "Time (ns)",
display: true
}
}
},
indexAxis: 'y',
plugins: {
title: {
display: true,
text: title,
},
legend: {
position: 'right',
labels: {
font: {
family: "'Cascadia Code', Consolas, 'Courier New', Courier, monospace"
}
}
}
}
}
});
}
function buildTestsByPlatformsLineOne(bs, canvas, plIdx, scaleTitle) {
let data = { datasets: [] };
let prevTest = '';
let curData = undefined;
for (const test of bs.tests) {
let m = test.name.match(/(.+)[\/\|](\d+)$/);
if (m[1] != prevTest) {
prevTest = m[1];
curData = { label: prevTest, data: [], borderWidth: 1 };
data.datasets.push(curData);
}
curData.data.push([test.data[plIdx], m[2]]);
}
addLineChart(canvas, data, platform_names[plIdx], scaleTitle);
}
function buildTestsByPlatformsLine(bsName, scaleTitle) {
let bs = bench_sets[bsName];
let canvas = document.getElementById('chart' + bs.id);
let after = null;
for (const i in platform_names) {
if (platformChecked(i)) {
if (!canvas) {
canvas = document.createElement('canvas');
canvas.classList.add('bench_chart');
canvas.style.width = "100%";
after.after(canvas);
}
canvas.style.height = "300px";
canvas.height = 300 * devicePixelRatio;
buildTestsByPlatformsLineOne(bs, canvas, i, scaleTitle);
after = canvas;
canvas = null;
}
}
}
function buildPlatformsByTestsLineOne(bs, canvas, after, testData, title, scaleTitle) {
let data = { datasets: [] };
for (const i in platform_names) {
if (platformChecked(i)) {
ds = {label: platform_names[i], data: []};
for (const test of testData) {
ds.data.push([test.data[i], test.count]);
}
data.datasets.push(ds);
}
}
if (!canvas) {
canvas = document.createElement('canvas');
canvas.classList.add('bench_chart');
canvas.style.width = "100%";
after.after(canvas);
}
canvas.style.height = "300px";
canvas.height = 300 * devicePixelRatio;
addLineChart(canvas, data, title, scaleTitle);
return canvas;
}
function buildPlatformsByTestsLine(bsName, scaleTitle) {
let bs = bench_sets[bsName];
let canvas = document.getElementById('chart' + bs.id);
let after = null;
let data = [];
let prevTest = '';
for (const test of bs.tests) {
let m = test.name.match(/(.+)[\/\|](\d+)$/);
if (m[1] != prevTest) {
if (data.length) {
after = buildPlatformsByTestsLineOne(bs, canvas, after, data, prevTest, scaleTitle);
canvas = null;
}
prevTest = m[1];
data = [];
}
data.push({count: m[2], data: test.data});
}
if (data.length) {
buildPlatformsByTestsLineOne(bs, canvas, after, data, prevTest, scaleTitle);
}
}
function buildCharts() {
let plCount = 0;
for (const i in platform_names) {
if (platformChecked(i))
plCount++;
}
buildCanvas(plCount);
for (var bs_name in bench_sets) {
activeBuilder(bs_name);
}
}
function switchGrouping() {
activeBuilder = document.getElementById('gbp').checked ? buildTestsByPlatformsBar : buildPlatformsByTestsBar;
buildCharts();
}
document.addEventListener('DOMContentLoaded', (event) => {
if (!hljs) {
let scriptTag = document.createElement('script');
scriptTag.src = "https://cdnjs.cloudflare.com/ajax/libs/highlight.js/11.9.0/highlight.min.js";
scriptTag.onload = hl;
scriptTag.onreadystatechange = hl;
document.body.appendChild(scriptTag);
} else {
hl();
}
if (!Chart) {
let scriptTag = document.createElement('script');
scriptTag.src = "https://cdn.jsdelivr.net/npm/chart.js";
scriptTag.onload = buildCharts;
scriptTag.onreadystatechange = buildCharts;
document.body.appendChild(scriptTag);
} else {
buildCharts();
}
});
< / script >
< / head > < body > < div class = "header" > < h2 > SimStr benchmarks results< / h2 >
< span > All times in ns.< / span >
< span > < a href = "https://github.com/orefkov/simstr/blob/main/bench/bench_str.cpp" > Source for benchmarks< / a > < / span >
< div > Group tests by platforms in charts: < input type = "checkbox" id = "gbp" checked onchange = "switchGrouping()" / > < / div > < div class = "test_platforms" > < h3 > Test configurations:< / h3 > < ul >
< li > < span class = "platform" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / span > < span class = "tooltip" > 32 X 2494.22 MHz CPU s< span class = "tooltiptext" > CPU Caches:
L1 Data 32 KiB (x16)
L1 Instruction 32 KiB (x16)
L2 Unified 256 KiB (x16)
L3 Unified 40960 KiB (x1)
2026-01-29 20:48:41 +00:00
Load Average: 0.00, 0.00, 0.00
2026-01-21 11:59:17 +00:00
***WARNING*** ASLR is enabled, the results may have unreproducible noise in them.< / span > < / span > Include in charts: < input type = "checkbox" id = "pl0" checked onchange = "buildCharts()" / > < / li >
2025-04-05 14:21:11 +00:00
< li > < span class = "platform" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / span > < span class = "tooltip" > 32 X 2494.22 MHz CPU s< span class = "tooltiptext" > CPU Caches:
L1 Data 32 KiB (x16)
L1 Instruction 32 KiB (x16)
L2 Unified 256 KiB (x16)
L3 Unified 40960 KiB (x1)
2026-01-21 11:59:17 +00:00
Load Average: 0.00, 0.00, 0.00
***WARNING*** ASLR is enabled, the results may have unreproducible noise in them.< / span > < / span > Include in charts: < input type = "checkbox" id = "pl1" checked onchange = "buildCharts()" / > < / li >
2025-11-26 19:15:50 +00:00
< li > < span class = "platform" > Xeon E5-2682 v4, Windows 10, Clang-19< / span > < span class = "tooltip" > 32 X 2494 MHz CPU s< span class = "tooltiptext" > CPU Caches:
2025-04-05 14:21:11 +00:00
L1 Data 32 KiB (x16)
L1 Instruction 32 KiB (x16)
L2 Unified 256 KiB (x16)
L3 Unified 40960 KiB (x1)< / span > < / span > Include in charts: < input type = "checkbox" id = "pl2" checked onchange = "buildCharts()" / > < / li >
2025-11-26 19:15:50 +00:00
< li > < span class = "platform" > Xeon E5-2682 v4, Windows 10, MSVC-19< / span > < span class = "tooltip" > 32 X 2494 MHz CPU s< span class = "tooltiptext" > CPU Caches:
2025-04-05 14:21:11 +00:00
L1 Data 32 KiB (x16)
L1 Instruction 32 KiB (x16)
L2 Unified 256 KiB (x16)
L3 Unified 40960 KiB (x1)< / span > < / span > Include in charts: < input type = "checkbox" id = "pl3" checked onchange = "buildCharts()" / > < / li >
2026-01-21 11:59:17 +00:00
< li > < span class = "platform" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / span > < span class = "tooltip" > 32 X 2513.96 MHz CPU s< span class = "tooltiptext" > Firefox: 146.0.1.60 webasm< / span > < / span > Include in charts: < input type = "checkbox" id = "pl4" checked onchange = "buildCharts()" / > < / li >
2025-04-05 14:21:11 +00:00
< / ul > < / div > < / div >
2026-01-21 11:59:17 +00:00
< script > const platform _names = [ 'Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21' , 'Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13' , 'Xeon E5-2682 v4, Windows 10, Clang-19' , 'Xeon E5-2682 v4, Windows 10, MSVC-19' , 'Xeon E5-2682 v4, WASM Firefox, Clang-21' ] ; < / script >
2025-04-05 14:21:11 +00:00
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs1" > < h4 > < a id = "bs70109915512075798510" href = "#bs70109915512075798510" > #< / a > Concatenate string + Number + " Literal" < / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Concat std::string and number by std to std::string< span class = "tooltiptext code" > void ConcatStdToStd(benchmark::State& state) {
std::string s1 = " start " ;
for (auto _: state) {
for (int i = 1; i < = 100' 000; i *= 10) {
benchmark::DoNotOptimize(s1);
std::string str = s1 + std::to_string(i) + " end" ;
benchmark::DoNotOptimize(str);
}
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 219< / td > < td class = "benchmarkresult" > 209< / td > < td class = "benchmarkresult" > 265< / td > < td class = "benchmarkresult" > 386< / td > < td class = "benchmarkresult" > 862< / td > < / tr >
2026-01-21 11:59:17 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Concat std::string and number by StrExpr to std::string< span class = "tooltiptext code" > void ConcatSimToStd(benchmark::State& state) {
std::string s1 = " start " ;
for (auto _: state) {
for (int i = 1; i < = 100' 000; i *= 10) {
benchmark::DoNotOptimize(s1);
std::string str = +s1 + i + " end" ;
benchmark::DoNotOptimize(str);
}
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 105< / td > < td class = "benchmarkresult" > 104< / td > < td class = "benchmarkresult" > 178< / td > < td class = "benchmarkresult" > 266< / td > < td class = "benchmarkresult" > 384< / td > < / tr >
2026-01-21 11:59:17 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Concat stringa and number by StrExpr to simstr::stringa< span class = "tooltiptext code" > void ConcatSimToSim(benchmark::State& state) {
stra s1 = " start " ;
for (auto _: state) {
for (int i = 1; i < = 100' 000; i *= 10) {
benchmark::DoNotOptimize(s1);
stringa str = s1 + i + " end" ;
benchmark::DoNotOptimize(str);
}
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > stringa в отличии от std::string,
вмещает в SSO 23 символа вместо 15, поэтому
в конце теста std::string приходится аллоцировать память,
а
Unlike std::string, stringa
holds 23 characters in SSO instead of 15, so
at the end of the std::string test, memory has to be allocated,
2026-01-29 20:48:41 +00:00
while in stringa , the entire test is included in SSO.< / span > < / span > < / td > < td class = "benchmarkresult" > 66.3< / td > < td class = "benchmarkresult" > 81.5< / td > < td class = "benchmarkresult" > 66.5< / td > < td class = "benchmarkresult" > 128< / td > < td class = "benchmarkresult" > 196< / td > < / tr >
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Concat stringa and number by e_concat to simstr::stringa< span class = "tooltiptext code" > void ConcatSimToSimConcat(benchmark::State& state) {
stra s1 = " start " ;
for (auto _: state) {
for (int i = 1; i < = 100' 000; i *= 10) {
benchmark::DoNotOptimize(s1);
stringa str = e_concat(" " , s1, i, " end" );
benchmark::DoNotOptimize(str);
}
}
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 68.8< / td > < td class = "benchmarkresult" > 80.2< / td > < td class = "benchmarkresult" > 74.9< / td > < td class = "benchmarkresult" > 145< / td > < td class = "benchmarkresult" > 193< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' C o n c a t e n a t e s t r i n g + N u m b e r + " L i t e r a l " ' ] = { i d : ' b s 1 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'Concat std::string and number by std to std::string',data:[219,209,265,386,862]},
{name:'Concat std::string and number by StrExpr to std::string',data:[105,104,178,266,384]},
{name:'Concat stringa and number by StrExpr to simstr::stringa',data:[66.3,81.5,66.5,128,196]},
{name:'Concat stringa and number by e_concat to simstr::stringa',data:[68.8,80.2,74.9,145,193]}
2026-01-21 11:59:17 +00:00
]}< / script >
< div class = "benchset" id = "bs2" > < h4 > < a id = "bs146911715078927772520" href = "#bs146911715078927772520" > #< / a > Concatenate string + Hex Number + " Literal" < / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Concat std::string and hex number by std to std::string< span class = "tooltiptext code" > void ConcatStdToStdHex(benchmark::State& state) {
// We use a short string so that the longest result is 15 characters and fits in the std::string SSO buffer.
std::string s1 = " art " ;
for (auto _: state) {
for (unsigned i = 1; i < = 100' 000; i *= 10) {
benchmark::DoNotOptimize(s1);
// What is standard method to get hex number?
2026-01-29 20:48:41 +00:00
std::string str = std::format(" {}0x{:x} end" , s1, i);
2026-01-21 11:59:17 +00:00
benchmark::DoNotOptimize(str);
}
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 861< / td > < td class = "benchmarkresult" > 935< / td > < td class = "benchmarkresult" > 1518< / td > < td class = "benchmarkresult" > 2092< / td > < td class = "benchmarkresult" > 1594< / td > < / tr >
2026-01-21 11:59:17 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Concat std::string and hex number by StrExpr to std::string< span class = "tooltiptext code" > void ConcatSimToStdHex(benchmark::State& state) {
// We use a short string so that the longest result is 15 characters and fits in the std::string SSO buffer.
std::string s1 = " art " ;
for (auto _: state) {
for (unsigned i = 1; i < = 100' 000; i *= 10) {
benchmark::DoNotOptimize(s1);
std::string str = +s1 + e_hex< HexFlags::Short>(i) + " end" ;
benchmark::DoNotOptimize(str);
}
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 86.4< / td > < td class = "benchmarkresult" > 69.6< / td > < td class = "benchmarkresult" > 81.0< / td > < td class = "benchmarkresult" > 182< / td > < td class = "benchmarkresult" > 371< / td > < / tr >
2026-01-21 11:59:17 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Concat stringa and hex number by StrExpr to simstr::stringa< span class = "tooltiptext code" > void ConcatSimToSimHex(benchmark::State& state) {
// stringa SSO buffer is 23, but we use a short string to compare under the same conditions
stra s1 = " art " ;
for (auto _: state) {
for (unsigned i = 1; i < = 100' 000; i *= 10) {
benchmark::DoNotOptimize(s1);
stringa str = s1 + e_hex< HexFlags::Short>(i) + " end" ;
benchmark::DoNotOptimize(str);
}
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 75.8< / td > < td class = "benchmarkresult" > 70.4< / td > < td class = "benchmarkresult" > 76.6< / td > < td class = "benchmarkresult" > 124< / td > < td class = "benchmarkresult" > 185< / td > < / tr >
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Concat stringa and hex number by e_concat to simstr::stringa< span class = "tooltiptext code" > void ConcatSimToSimHexC(benchmark::State& state) {
// stringa SSO buffer is 23, but we use a short string to compare under the same conditions
stra s1 = " art " ;
for (auto _: state) {
for (unsigned i = 1; i < = 100' 000; i *= 10) {
benchmark::DoNotOptimize(s1);
stringa str = e_concat(" " , s1, e_hex< HexFlags::Short>(i), " end" );
benchmark::DoNotOptimize(str);
}
}
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 75.0< / td > < td class = "benchmarkresult" > 78.9< / td > < td class = "benchmarkresult" > 78.3< / td > < td class = "benchmarkresult" > 180< / td > < td class = "benchmarkresult" > 197< / td > < / tr >
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Concat stringa and hex number by e_subst to simstr::stringa< span class = "tooltiptext code" > void ConcatSimToSimHexS(benchmark::State& state) {
// stringa SSO buffer is 23, but we use a short string to compare under the same conditions
stra s1 = " art " ;
for (auto _: state) {
for (unsigned i = 1; i < = 100' 000; i *= 10) {
benchmark::DoNotOptimize(s1);
stringa str = e_subst(S_FRM(" {}{} end" ), s1, e_hex< HexFlags::Short>(i));
benchmark::DoNotOptimize(str);
}
}
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 150< / td > < td class = "benchmarkresult" > 157< / td > < td class = "benchmarkresult" > 150< / td > < td class = "benchmarkresult" > 266< / td > < td class = "benchmarkresult" > 402< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' C o n c a t e n a t e s t r i n g + H e x N u m b e r + " L i t e r a l " ' ] = { i d : ' b s 2 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'Concat std::string and hex number by std to std::string',data:[861,935,1518,2092,1594]},
{name:'Concat std::string and hex number by StrExpr to std::string',data:[86.4,69.6,81.0,182,371]},
{name:'Concat stringa and hex number by StrExpr to simstr::stringa',data:[75.8,70.4,76.6,124,185]},
{name:'Concat stringa and hex number by e_concat to simstr::stringa',data:[75.0,78.9,78.3,180,197]},
{name:'Concat stringa and hex number by e_subst to simstr::stringa',data:[150,157,150,266,402]}
2026-01-21 11:59:17 +00:00
]}< / script >
< div class = "benchset" id = "bs3" > < h4 > < a id = "bs59672599204338055190" href = "#bs59672599204338055190" > #< / a > Concatenate string + " Literal" < / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Concat std::string by std to std::string< span class = "tooltiptext code" > void ConcatStdToStdS(benchmark::State& state) {
std::string s1 = " start " ;
for (auto _: state) {
for (int i = 1; i < = 100' 000; i *= 10) {
benchmark::DoNotOptimize(s1);
std::string str = s1 + " end" ;
benchmark::DoNotOptimize(str);
}
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 45.2< / td > < td class = "benchmarkresult" > 45.5< / td > < td class = "benchmarkresult" > 40.1< / td > < td class = "benchmarkresult" > 72.5< / td > < td class = "benchmarkresult" > 87.7< / td > < / tr >
2026-01-21 11:59:17 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Concat std::string by StrExpr to std::string< span class = "tooltiptext code" > void ConcatSimToStdS(benchmark::State& state) {
std::string s1 = " start " ;
for (auto _: state) {
for (int i = 1; i < = 100' 000; i *= 10) {
benchmark::DoNotOptimize(s1);
std::string str = +s1 + " end" ;
benchmark::DoNotOptimize(str);
}
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 33.9< / td > < td class = "benchmarkresult" > 36.8< / td > < td class = "benchmarkresult" > 39.4< / td > < td class = "benchmarkresult" > 91.4< / td > < td class = "benchmarkresult" > 97.9< / td > < / tr >
2026-01-21 11:59:17 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Concat stringa by StrExpr to stringa< span class = "tooltiptext code" > void ConcatSimToSimS(benchmark::State& state) {
stra s1 = " start " ;
for (auto _: state) {
for (int i = 1; i < = 100' 000; i *= 10) {
benchmark::DoNotOptimize(s1);
stringa str = s1 + " end" ;
benchmark::DoNotOptimize(str);
}
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 29.1< / td > < td class = "benchmarkresult" > 27.2< / td > < td class = "benchmarkresult" > 28.7< / td > < td class = "benchmarkresult" > 60.1< / td > < td class = "benchmarkresult" > 91.9< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' C o n c a t e n a t e s t r i n g + " L i t e r a l " ' ] = { i d : ' b s 3 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'Concat std::string by std to std::string',data:[45.2,45.5,40.1,72.5,87.7]},
{name:'Concat std::string by StrExpr to std::string',data:[33.9,36.8,39.4,91.4,97.9]},
{name:'Concat stringa by StrExpr to stringa',data:[29.1,27.2,28.7,60.1,91.9]}
2026-01-21 11:59:17 +00:00
]}< / script >
< div class = "benchset" id = "bs4" > < h4 > < a id = "bs68116594352702954700" href = "#bs68116594352702954700" > #< / a > Find three concatenated string in string_view< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Find concat three std::string< span class = "tooltiptext code" > size_t find_pos_str(std::string_view src, std::string_view name) {
// before C++26 we can not concatenate string and string_view...
return src.find(" \n- " s + std::string{name} + " -\n" );
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 112< / td > < td class = "benchmarkresult" > 135< / td > < td class = "benchmarkresult" > 205< / td > < td class = "benchmarkresult" > 265< / td > < td class = "benchmarkresult" > 173< / td > < / tr >
2026-01-21 11:59:17 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Find concat three strexpr< span class = "tooltiptext code" > size_t find_pos_exp(ssa src, ssa name) {
return src.find(std::string{" \n- " + name + " -\n" });
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 50.6< / td > < td class = "benchmarkresult" > 44.3< / td > < td class = "benchmarkresult" > 114< / td > < td class = "benchmarkresult" > 150< / td > < td class = "benchmarkresult" > 110< / td > < / tr >
2026-01-21 11:59:17 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Find concat three simstr< span class = "tooltiptext code" > size_t find_pos_sim(ssa src, ssa name) {
return src.find(lstringa< 200>{" \n- " + name + " -\n" });
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Если результат конкатенации меньше 207 символов,
он собирается в буфере на стеке, без аллокации и деалокации.
If the concatenation result is less than 207 characters,
2026-01-29 20:48:41 +00:00
it is collected in a stack-based buffer, without allocation or deallocation.< / span > < / span > < / td > < td class = "benchmarkresult" > 22.8< / td > < td class = "benchmarkresult" > 53.4< / td > < td class = "benchmarkresult" > 21.5< / td > < td class = "benchmarkresult" > 32.4< / td > < td class = "benchmarkresult" > 76.2< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' F i n d t h r e e c o n c a t e n a t e d s t r i n g i n s t r i n g _ v i e w ' ] = { i d : ' b s 4 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'Find concat three std::string',data:[112,135,205,265,173]},
{name:'Find concat three strexpr',data:[50.6,44.3,114,150,110]},
{name:'Find concat three simstr',data:[22.8,53.4,21.5,32.4,76.2]}
2026-01-21 11:59:17 +00:00
]}< / script >
< div class = "benchset" id = "bs5" > < h4 > < a id = "bs145290966789248325200" href = "#bs145290966789248325200" > #< / a > Build Type Name< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
< tr > < td class = "benchmarkname" > < span class = "tooltip" > BuildTypeNameStr 0/0< span class = "tooltiptext code" > std::string buildTypeNameStr(std::string_view type_name, size_t prec, size_t scale) {
std::string res{type_name};
if (prec) {
res += " (" + std::to_string(prec);
if (scale) {
res += " ," + std::to_string(scale);
}
res += " )" ;
}
return res;
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 7.17< / td > < td class = "benchmarkresult" > 10.1< / td > < td class = "benchmarkresult" > 8.22< / td > < td class = "benchmarkresult" > 20.9< / td > < td class = "benchmarkresult" > 15.2< / td > < / tr >
2026-01-21 11:59:17 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > BuildTypeNameExp 0/0< span class = "tooltiptext code" > std::string buildTypeNameExp(ssa type_name, size_t prec, size_t scale) {
if (prec) {
return type_name + " (" + prec + e_if(scale, " ," _ss + scale) + " )" ;
}
return type_name;
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 6.73< / td > < td class = "benchmarkresult" > 7.22< / td > < td class = "benchmarkresult" > 7.62< / td > < td class = "benchmarkresult" > 14.8< / td > < td class = "benchmarkresult" > 15.8< / td > < / tr >
2026-01-21 11:59:17 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > BuildTypeNameSim 0/0< span class = "tooltiptext code" > stringa buildTypeNameSim(ssa type_name, size_t prec, size_t scale) {
if (prec) {
return type_name + " (" + prec + e_if(scale, " ," _ss + scale) + " )" ;
}
return type_name;
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 5.57< / td > < td class = "benchmarkresult" > 5.45< / td > < td class = "benchmarkresult" > 8.19< / td > < td class = "benchmarkresult" > 18.3< / td > < td class = "benchmarkresult" > 15.6< / td > < / tr >
2026-01-21 11:59:17 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > BuildTypeNameStr 10/10< span class = "tooltiptext code" > std::string buildTypeNameStr(std::string_view type_name, size_t prec, size_t scale) {
std::string res{type_name};
if (prec) {
res += " (" + std::to_string(prec);
if (scale) {
res += " ," + std::to_string(scale);
}
res += " )" ;
}
return res;
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 57.2< / td > < td class = "benchmarkresult" > 86.4< / td > < td class = "benchmarkresult" > 64.1< / td > < td class = "benchmarkresult" > 100< / td > < td class = "benchmarkresult" > 253< / td > < / tr >
2026-01-21 11:59:17 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > BuildTypeNameExp 10/10< span class = "tooltiptext code" > std::string buildTypeNameExp(ssa type_name, size_t prec, size_t scale) {
if (prec) {
return type_name + " (" + prec + e_if(scale, " ," _ss + scale) + " )" ;
}
return type_name;
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 31.1< / td > < td class = "benchmarkresult" > 24.9< / td > < td class = "benchmarkresult" > 33.9< / td > < td class = "benchmarkresult" > 48.0< / td > < td class = "benchmarkresult" > 92.7< / td > < / tr >
2026-01-21 11:59:17 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > BuildTypeNameSim 10/10< span class = "tooltiptext code" > stringa buildTypeNameSim(ssa type_name, size_t prec, size_t scale) {
if (prec) {
return type_name + " (" + prec + e_if(scale, " ," _ss + scale) + " )" ;
}
return type_name;
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 24.7< / td > < td class = "benchmarkresult" > 22.2< / td > < td class = "benchmarkresult" > 25.3< / td > < td class = "benchmarkresult" > 44.6< / td > < td class = "benchmarkresult" > 65.5< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' B u i l d T y p e N a m e ' ] = { i d : ' b s 5 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'BuildTypeNameStr 0/0',data:[7.17,10.1,8.22,20.9,15.2]},
{name:'BuildTypeNameExp 0/0',data:[6.73,7.22,7.62,14.8,15.8]},
{name:'BuildTypeNameSim 0/0',data:[5.57,5.45,8.19,18.3,15.6]},
{name:'BuildTypeNameStr 10/10',data:[57.2,86.4,64.1,100,253]},
{name:'BuildTypeNameExp 10/10',data:[31.1,24.9,33.9,48.0,92.7]},
{name:'BuildTypeNameSim 10/10',data:[24.7,22.2,25.3,44.6,65.5]}
2026-01-21 11:59:17 +00:00
]}< / script >
< div class = "benchset" id = "bs6" > < h4 > < a id = "bs54035654251116789780" href = "#bs54035654251116789780" > #< / a > Replace string by copy< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Concat with replace str< span class = "tooltiptext code" > std::string make_str_str(std::string_view from, std::string_view pattern, std::string_view repl) {
auto str_replace = [](std::string_view from, std::string_view pattern, std::string_view repl) {
std::string result;
for (size_t offset = 0; ;) {
size_t pos = from.find(pattern, offset);
if (pos == std::string::npos) {
result += from.substr(offset);
break;
}
result += from.substr(offset, pos - offset);
result += repl;
offset = pos + pattern.length();
}
return result;
};
return " < " + str_replace(from, pattern, repl) + " >" ;
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 202< / td > < td class = "benchmarkresult" > 231< / td > < td class = "benchmarkresult" > 312< / td > < td class = "benchmarkresult" > 430< / td > < td class = "benchmarkresult" > 411< / td > < / tr >
2026-01-21 11:59:17 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Concat with replace exp< span class = "tooltiptext code" > std::string make_str_exp(std::string_view from, std::string_view pattern, std::string_view repl) {
return " < " + e_repl(from, pattern, repl) + " >" ;
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > В
есть "из коробки".
2026-01-29 20:48:41 +00:00
simstr has a string expression for replacing substrings out of the box.< / span > < / span > < / td > < td class = "benchmarkresult" > 151< / td > < td class = "benchmarkresult" > 139< / td > < td class = "benchmarkresult" > 228< / td > < td class = "benchmarkresult" > 278< / td > < td class = "benchmarkresult" > 243< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' R e p l a c e s t r i n g b y c o p y ' ] = { i d : ' b s 6 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'Concat with replace str',data:[202,231,312,430,411]},
{name:'Concat with replace exp',data:[151,139,228,278,243]}
2026-01-21 11:59:17 +00:00
]}< / script >
< div class = "benchset" id = "bs7" > < h4 > < a id = "bs77666948964429305550" href = "#bs77666948964429305550" > #< / a > Create Empty Str< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string e;< span class = "tooltiptext code" > template< typename T>
void CreateEmpty(benchmark::State& state) {
for (auto _: state) {
T empty_string;
benchmark::DoNotOptimize(empty_string);
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Пустые строки, ничего необычного.
2026-01-29 20:48:41 +00:00
Empty lines, nothing unusual.< / span > < / span > < / td > < td class = "benchmarkresult" > 1.16< / td > < td class = "benchmarkresult" > 1.15< / td > < td class = "benchmarkresult" > 1.17< / td > < td class = "benchmarkresult" > 2.85< / td > < td class = "benchmarkresult" > 2.14< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string_view e;< span class = "tooltiptext code" > template< typename T>
void CreateEmpty(benchmark::State& state) {
for (auto _: state) {
T empty_string;
benchmark::DoNotOptimize(empty_string);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 0.384< / td > < td class = "benchmarkresult" > 0.772< / td > < td class = "benchmarkresult" > 0.363< / td > < td class = "benchmarkresult" > 2.02< / td > < td class = "benchmarkresult" > 0.972< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > ssa e;< span class = "tooltiptext code" > template< typename T>
void CreateEmpty(benchmark::State& state) {
for (auto _: state) {
T empty_string;
benchmark::DoNotOptimize(empty_string);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 0.378< / td > < td class = "benchmarkresult" > 0.190< / td > < td class = "benchmarkresult" > 0.360< / td > < td class = "benchmarkresult" > 2.05< / td > < td class = "benchmarkresult" > 0.939< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa e;< span class = "tooltiptext code" > template< typename T>
void CreateEmpty(benchmark::State& state) {
for (auto _: state) {
T empty_string;
benchmark::DoNotOptimize(empty_string);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 0.762< / td > < td class = "benchmarkresult" > 0.750< / td > < td class = "benchmarkresult" > 0.740< / td > < td class = "benchmarkresult" > 2.42< / td > < td class = "benchmarkresult" > 2.15< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 20> e;< span class = "tooltiptext code" > template< typename T>
void CreateEmpty(benchmark::State& state) {
for (auto _: state) {
T empty_string;
benchmark::DoNotOptimize(empty_string);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1.14< / td > < td class = "benchmarkresult" > 1.11< / td > < td class = "benchmarkresult" > 1.11< / td > < td class = "benchmarkresult" > 2.91< / td > < td class = "benchmarkresult" > 2.19< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 40> e;< span class = "tooltiptext code" > template< typename T>
void CreateEmpty(benchmark::State& state) {
for (auto _: state) {
T empty_string;
benchmark::DoNotOptimize(empty_string);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1.12< / td > < td class = "benchmarkresult" > 1.12< / td > < td class = "benchmarkresult" > 1.10< / td > < td class = "benchmarkresult" > 3.01< / td > < td class = "benchmarkresult" > 2.58< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' C r e a t e E m p t y S t r ' ] = { i d : ' b s 7 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::string e;',data:[1.16,1.15,1.17,2.85,2.14]},
{name:'std::string_view e;',data:[0.384,0.772,0.363,2.02,0.972]},
{name:'ssa e;',data:[0.378,0.190,0.360,2.05,0.939]},
{name:'stringa e;',data:[0.762,0.750,0.740,2.42,2.15]},
{name:'lstringa< 20 > e;',data:[1.14,1.11,1.11,2.91,2.19]},
{name:'lstringa< 40 > e;',data:[1.12,1.12,1.10,3.01,2.58]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs8" > < h4 > < a id = "bs181001525395597238060" href = "#bs181001525395597238060" > #< / a > Create Str from short literal (9 symbols)< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string e = " Test text" ;< span class = "tooltiptext code" > template< typename T>
void CreateShortLiteral(benchmark::State& state) {
for (auto _: state) {
T empty_string = TEST_TEXT;
benchmark::DoNotOptimize(empty_string);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Короткий литерал помещается во внутренний буфер std::string,
2026-01-21 11:59:17 +00:00
время тратится только на копирование 10 байтов.
The short literal is placed in the internal std::string buffer;
2026-01-29 20:48:41 +00:00
time is spent only copying 10 bytes.< / span > < / span > < / td > < td class = "benchmarkresult" > 1.84< / td > < td class = "benchmarkresult" > 1.87< / td > < td class = "benchmarkresult" > 1.82< / td > < td class = "benchmarkresult" > 2.90< / td > < td class = "benchmarkresult" > 2.33< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string_view e = " Test text" ;< span class = "tooltiptext code" > template< typename T>
void CreateShortLiteral(benchmark::State& state) {
for (auto _: state) {
T empty_string = TEST_TEXT;
benchmark::DoNotOptimize(empty_string);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > И string_view, и ssa - по сути одно и то же:
2026-01-21 11:59:17 +00:00
указатель на текст и е г о
Both string_view and ssa are essentially the same thing:
2026-01-29 20:48:41 +00:00
a pointer to text and its length.< / span > < / span > < / td > < td class = "benchmarkresult" > 0.739< / td > < td class = "benchmarkresult" > 0.806< / td > < td class = "benchmarkresult" > 0.769< / td > < td class = "benchmarkresult" > 2.05< / td > < td class = "benchmarkresult" > 1.24< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > ssa e = " Test text" ;< span class = "tooltiptext code" > template< typename T>
void CreateShortLiteral(benchmark::State& state) {
for (auto _: state) {
T empty_string = TEST_TEXT;
benchmark::DoNotOptimize(empty_string);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 0.369< / td > < td class = "benchmarkresult" > 0.750< / td > < td class = "benchmarkresult" > 0.365< / td > < td class = "benchmarkresult" > 2.03< / td > < td class = "benchmarkresult" > 0.968< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa e = " Test text" ;< span class = "tooltiptext code" > template< typename T>
void CreateShortLiteral(benchmark::State& state) {
for (auto _: state) {
T empty_string = TEST_TEXT;
benchmark::DoNotOptimize(empty_string);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > stringa при инициализации константным литералом так же
2026-01-21 11:59:17 +00:00
сохраняет только указатель на текст и е г о
When initialized with a constant literal, stringa also stores
2026-01-29 20:48:41 +00:00
only a pointer to the text and its length.< / span > < / span > < / td > < td class = "benchmarkresult" > 1.15< / td > < td class = "benchmarkresult" > 1.12< / td > < td class = "benchmarkresult" > 1.08< / td > < td class = "benchmarkresult" > 2.87< / td > < td class = "benchmarkresult" > 2.16< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 20> e = " Test text" ;< span class = "tooltiptext code" > template< typename T>
void CreateShortLiteral(benchmark::State& state) {
for (auto _: state) {
T empty_string = TEST_TEXT;
benchmark::DoNotOptimize(empty_string);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Внутреннего буфера хватает для размещения символов,
2026-01-21 11:59:17 +00:00
время уходит только на копирование байтов.
The internal buffer is sufficient to accommodate characters;
2026-01-29 20:48:41 +00:00
time is spent only on copying bytes.< / span > < / span > < / td > < td class = "benchmarkresult" > 1.94< / td > < td class = "benchmarkresult" > 1.92< / td > < td class = "benchmarkresult" > 1.85< / td > < td class = "benchmarkresult" > 2.96< / td > < td class = "benchmarkresult" > 2.65< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 40> e = " Test text" ;< span class = "tooltiptext code" > template< typename T>
void CreateShortLiteral(benchmark::State& state) {
for (auto _: state) {
T empty_string = TEST_TEXT;
benchmark::DoNotOptimize(empty_string);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1.88< / td > < td class = "benchmarkresult" > 1.88< / td > < td class = "benchmarkresult" > 1.87< / td > < td class = "benchmarkresult" > 2.95< / td > < td class = "benchmarkresult" > 2.61< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' C r e a t e S t r f r o m s h o r t l i t e r a l ( 9 s y m b o l s ) ' ] = { i d : ' b s 8 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::string e = "Test text";',data:[1.84,1.87,1.82,2.90,2.33]},
{name:'std::string_view e = "Test text";',data:[0.739,0.806,0.769,2.05,1.24]},
{name:'ssa e = "Test text";',data:[0.369,0.750,0.365,2.03,0.968]},
{name:'stringa e = "Test text";',data:[1.15,1.12,1.08,2.87,2.16]},
{name:'lstringa< 20 > e = "Test text";',data:[1.94,1.92,1.85,2.96,2.65]},
{name:'lstringa< 40 > e = "Test text";',data:[1.88,1.88,1.87,2.95,2.61]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs9" > < h4 > < a id = "bs132333183298742730280" href = "#bs132333183298742730280" > #< / a > Create Str from long literal (30 symbols)< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string e = " 123456789012345678901234567890" ;< span class = "tooltiptext code" > template< typename T>
void CreateLongLiteral(benchmark::State& state) {
for (auto _: state) {
T empty_string{LONG_TEXT};
benchmark::DoNotOptimize(empty_string);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Вот тут уже литерал не помещается во внутренний буфер,
возникает аллокация и копирование 30-и байтов.
2026-01-21 11:59:17 +00:00
Н о а
Here, the literal doesn't fit into the internal buffer,
and 30 bytes are allocated and copied.
2026-01-29 20:48:41 +00:00
But how much slower is allocation under Windows than under Linux, 20 ns vs. 70 ns...< / span > < / span > < / td > < td class = "benchmarkresult" > 19.6< / td > < td class = "benchmarkresult" > 19.5< / td > < td class = "benchmarkresult" > 72.1< / td > < td class = "benchmarkresult" > 96.3< / td > < td class = "benchmarkresult" > 16.0< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string_view e = " 123456789012345678901234567890" ;< span class = "tooltiptext code" > template< typename T>
void CreateLongLiteral(benchmark::State& state) {
for (auto _: state) {
T empty_string{LONG_TEXT};
benchmark::DoNotOptimize(empty_string);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > string_view и ssa по прежнему ничего не делают, кроме
2026-01-21 11:59:17 +00:00
запоминания указателя на текст и е г о
string_view and ssa still do nothing except
2026-01-29 20:48:41 +00:00
remember the pointer to the text and its size.< / span > < / span > < / td > < td class = "benchmarkresult" > 0.771< / td > < td class = "benchmarkresult" > 0.744< / td > < td class = "benchmarkresult" > 0.734< / td > < td class = "benchmarkresult" > 2.06< / td > < td class = "benchmarkresult" > 1.28< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > ssa e = " 123456789012345678901234567890" ;< span class = "tooltiptext code" > template< typename T>
void CreateLongLiteral(benchmark::State& state) {
for (auto _: state) {
T empty_string{LONG_TEXT};
benchmark::DoNotOptimize(empty_string);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 0.382< / td > < td class = "benchmarkresult" > 0.738< / td > < td class = "benchmarkresult" > 0.360< / td > < td class = "benchmarkresult" > 2.06< / td > < td class = "benchmarkresult" > 0.971< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa e = " 123456789012345678901234567890" ;< span class = "tooltiptext code" > template< typename T>
void CreateLongLiteral(benchmark::State& state) {
for (auto _: state) {
T empty_string{LONG_TEXT};
benchmark::DoNotOptimize(empty_string);
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > stringa на константных литералах не отстает!
2026-01-29 20:48:41 +00:00
stringa doesn't lag behind on constant literals!< / span > < / span > < / td > < td class = "benchmarkresult" > 1.13< / td > < td class = "benchmarkresult" > 1.11< / td > < td class = "benchmarkresult" > 1.08< / td > < td class = "benchmarkresult" > 3.00< / td > < td class = "benchmarkresult" > 2.18< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 20> e = " 123456789012345678901234567890" ;< span class = "tooltiptext code" > template< typename T>
void CreateLongLiteral(benchmark::State& state) {
for (auto _: state) {
T empty_string{LONG_TEXT};
benchmark::DoNotOptimize(empty_string);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > lstringa< 20 > может вместить в себя до 23 символов,
2026-01-21 11:59:17 +00:00
Очевидно, что для 30-и символов уже нужна аллокация.
2026-01-29 20:48:41 +00:00
Obviously, 30 characters already require allocation.< / span > < / span > < / td > < td class = "benchmarkresult" > 24.3< / td > < td class = "benchmarkresult" > 23.0< / td > < td class = "benchmarkresult" > 74.5< / td > < td class = "benchmarkresult" > 97.1< / td > < td class = "benchmarkresult" > 16.5< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 40> e = " 123456789012345678901234567890" ;< span class = "tooltiptext code" > template< typename T>
void CreateLongLiteral(benchmark::State& state) {
for (auto _: state) {
T empty_string{LONG_TEXT};
benchmark::DoNotOptimize(empty_string);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > А < 40 > влезает до 47 символов, так что просто
2026-01-21 11:59:17 +00:00
копируется 30 байтов.
And lstringa< 40 > can hold up to 47 characters, so 30
2026-01-29 20:48:41 +00:00
bytes are simply copied.< / span > < / span > < / td > < td class = "benchmarkresult" > 2.60< / td > < td class = "benchmarkresult" > 1.96< / td > < td class = "benchmarkresult" > 2.52< / td > < td class = "benchmarkresult" > 3.65< / td > < td class = "benchmarkresult" > 3.00< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' C r e a t e S t r f r o m l o n g l i t e r a l ( 3 0 s y m b o l s ) ' ] = { i d : ' b s 9 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::string e = "123456789012345678901234567890";',data:[19.6,19.5,72.1,96.3,16.0]},
{name:'std::string_view e = "123456789012345678901234567890";',data:[0.771,0.744,0.734,2.06,1.28]},
{name:'ssa e = "123456789012345678901234567890";',data:[0.382,0.738,0.360,2.06,0.971]},
{name:'stringa e = "123456789012345678901234567890";',data:[1.13,1.11,1.08,3.00,2.18]},
{name:'lstringa< 20 > e = "123456789012345678901234567890";',data:[24.3,23.0,74.5,97.1,16.5]},
{name:'lstringa< 40 > e = "123456789012345678901234567890";',data:[2.60,1.96,2.52,3.65,3.00]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs10" > < h4 > < a id = "bs6234433963744178700" href = "#bs6234433963744178700" > #< / a > Create copy of Str with 9 symbols< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string e = " Test text" ; auto c{e};< span class = "tooltiptext code" > template< typename T>
void CopyShortString(benchmark::State& state) {
T x{TEST_TEXT};
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Строка в пределах SSO, так что просто копирует байты.
2026-01-29 20:48:41 +00:00
The string is within the SSO, so it just copies the bytes.< / span > < / span > < / td > < td class = "benchmarkresult" > 5.67< / td > < td class = "benchmarkresult" > 4.97< / td > < td class = "benchmarkresult" > 1.84< / td > < td class = "benchmarkresult" > 5.61< / td > < td class = "benchmarkresult" > 2.21< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string_view e = " Test text" ; auto c{e};< span class = "tooltiptext code" > template< typename T>
void CopyShortString(benchmark::State& state) {
T x{TEST_TEXT};
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 0.377< / td > < td class = "benchmarkresult" > 0.399< / td > < td class = "benchmarkresult" > 0.373< / td > < td class = "benchmarkresult" > 3.95< / td > < td class = "benchmarkresult" > 1.26< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > ssa e = " Test text" ; auto c{e};< span class = "tooltiptext code" > template< typename T>
void CopyShortString(benchmark::State& state) {
T x{TEST_TEXT};
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > ssa и string_view не владеют строкой, копируется
2026-01-21 11:59:17 +00:00
только информация о
ssa and string_view don't own the string; only the
2026-01-29 20:48:41 +00:00
string information is copied.< / span > < / span > < / td > < td class = "benchmarkresult" > 0.387< / td > < td class = "benchmarkresult" > 0.381< / td > < td class = "benchmarkresult" > 0.363< / td > < td class = "benchmarkresult" > 3.92< / td > < td class = "benchmarkresult" > 1.24< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa e = " Test text" ; auto c{e};< span class = "tooltiptext code" > template< typename T>
void CopyShortString(benchmark::State& state) {
T x{TEST_TEXT};
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Копирование stringa происходит быстро,
2026-01-21 11:59:17 +00:00
особенно если она инициализирована литералом.
Copying a stringa is fast,
2026-01-29 20:48:41 +00:00
especially if it is initialized with a literal.< / span > < / span > < / td > < td class = "benchmarkresult" > 1.14< / td > < td class = "benchmarkresult" > 1.15< / td > < td class = "benchmarkresult" > 1.28< / td > < td class = "benchmarkresult" > 4.44< / td > < td class = "benchmarkresult" > 2.55< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 20> e = " Test text" ; auto c{e};< span class = "tooltiptext code" > template< typename T>
void CopyShortString(benchmark::State& state) {
T x{TEST_TEXT};
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > В
2026-01-29 20:48:41 +00:00
In both cases, the internal buffer is sufficient.< / span > < / span > < / td > < td class = "benchmarkresult" > 4.29< / td > < td class = "benchmarkresult" > 4.56< / td > < td class = "benchmarkresult" > 4.74< / td > < td class = "benchmarkresult" > 9.72< / td > < td class = "benchmarkresult" > 15.2< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 40> e = " Test text" ; auto c{e};< span class = "tooltiptext code" > template< typename T>
void CopyShortString(benchmark::State& state) {
T x{TEST_TEXT};
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Только копируются байты.
2026-01-29 20:48:41 +00:00
Only bytes are copied.< / span > < / span > < / td > < td class = "benchmarkresult" > 4.20< / td > < td class = "benchmarkresult" > 4.61< / td > < td class = "benchmarkresult" > 4.70< / td > < td class = "benchmarkresult" > 9.61< / td > < td class = "benchmarkresult" > 14.5< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' C r e a t e c o p y o f S t r w i t h 9 s y m b o l s ' ] = { i d : ' b s 1 0 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::string e = "Test text"; auto c{e};',data:[5.67,4.97,1.84,5.61,2.21]},
{name:'std::string_view e = "Test text"; auto c{e};',data:[0.377,0.399,0.373,3.95,1.26]},
{name:'ssa e = "Test text"; auto c{e};',data:[0.387,0.381,0.363,3.92,1.24]},
{name:'stringa e = "Test text"; auto c{e};',data:[1.14,1.15,1.28,4.44,2.55]},
{name:'lstringa< 20 > e = "Test text"; auto c{e};',data:[4.29,4.56,4.74,9.72,15.2]},
{name:'lstringa< 40 > e = "Test text"; auto c{e};',data:[4.20,4.61,4.70,9.61,14.5]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs11" > < h4 > < a id = "bs76384575499199461500" href = "#bs76384575499199461500" > #< / a > Create copy of Str with 30 symbols< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string e = " 123456789012345678901234567890" ; auto c{e};< span class = "tooltiptext code" > template< typename T>
void CopyLongString(benchmark::State& state) {
T x = LONG_TEXT;
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Копирования длинной строки вызывает аллокацию,
2026-01-21 11:59:17 +00:00
SSO уже не хватает. И снова как же отстаёт аллокация под Windows...
Copying a long string causes allocations,
2026-01-29 20:48:41 +00:00
SSO is no longer sufficient. And again, how allocation lags under Windows...< / span > < / span > < / td > < td class = "benchmarkresult" > 21.2< / td > < td class = "benchmarkresult" > 25.3< / td > < td class = "benchmarkresult" > 76.6< / td > < td class = "benchmarkresult" > 94.6< / td > < td class = "benchmarkresult" > 33.3< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string_view e = " 123456789012345678901234567890" ; auto c{e};< span class = "tooltiptext code" > template< typename T>
void CopyLongString(benchmark::State& state) {
T x = LONG_TEXT;
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 0.737< / td > < td class = "benchmarkresult" > 0.731< / td > < td class = "benchmarkresult" > 0.714< / td > < td class = "benchmarkresult" > 1.94< / td > < td class = "benchmarkresult" > 1.27< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > ssa e = " 123456789012345678901234567890" ; auto c{e};< span class = "tooltiptext code" > template< typename T>
void CopyLongString(benchmark::State& state) {
T x = LONG_TEXT;
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 0.379< / td > < td class = "benchmarkresult" > 0.731< / td > < td class = "benchmarkresult" > 0.362< / td > < td class = "benchmarkresult" > 1.97< / td > < td class = "benchmarkresult" > 0.981< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa e = " 123456789012345678901234567890" ; auto c{e};< span class = "tooltiptext code" > template< typename T>
void CopyLongString(benchmark::State& state) {
T x = LONG_TEXT;
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > А у е г о
2026-01-21 11:59:17 +00:00
сравни с
But with stringa, literal copying doesn't depend on its length,
2026-01-29 20:48:41 +00:00
compare with the previous benchmark.< / span > < / span > < / td > < td class = "benchmarkresult" > 1.13< / td > < td class = "benchmarkresult" > 1.13< / td > < td class = "benchmarkresult" > 1.84< / td > < td class = "benchmarkresult" > 3.36< / td > < td class = "benchmarkresult" > 2.19< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 20> e = " 123456789012345678901234567890" ; auto c{e};< span class = "tooltiptext code" > template< typename T>
void CopyLongString(benchmark::State& state) {
T x = LONG_TEXT;
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Н е
2026-01-29 20:48:41 +00:00
Doesn't fit, allocation.< / span > < / span > < / td > < td class = "benchmarkresult" > 20.7< / td > < td class = "benchmarkresult" > 22.5< / td > < td class = "benchmarkresult" > 79.1< / td > < td class = "benchmarkresult" > 97.1< / td > < td class = "benchmarkresult" > 15.7< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 40> e = " 123456789012345678901234567890" ; auto c{e};< span class = "tooltiptext code" > template< typename T>
void CopyLongString(benchmark::State& state) {
T x = LONG_TEXT;
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Уложили во внутренний буфер.
2026-01-29 20:48:41 +00:00
Placed in the internal buffer.< / span > < / span > < / td > < td class = "benchmarkresult" > 4.48< / td > < td class = "benchmarkresult" > 4.61< / td > < td class = "benchmarkresult" > 4.46< / td > < td class = "benchmarkresult" > 8.16< / td > < td class = "benchmarkresult" > 14.2< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' C r e a t e c o p y o f S t r w i t h 3 0 s y m b o l s ' ] = { i d : ' b s 1 1 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::string e = "123456789012345678901234567890"; auto c{e};',data:[21.2,25.3,76.6,94.6,33.3]},
{name:'std::string_view e = "123456789012345678901234567890"; auto c{e};',data:[0.737,0.731,0.714,1.94,1.27]},
{name:'ssa e = "123456789012345678901234567890"; auto c{e};',data:[0.379,0.731,0.362,1.97,0.981]},
{name:'stringa e = "123456789012345678901234567890"; auto c{e};',data:[1.13,1.13,1.84,3.36,2.19]},
{name:'lstringa< 20 > e = "123456789012345678901234567890"; auto c{e};',data:[20.7,22.5,79.1,97.1,15.7]},
{name:'lstringa< 40 > e = "123456789012345678901234567890"; auto c{e};',data:[4.48,4.61,4.46,8.16,14.2]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs12" > < h4 > < a id = "bs21623892135774528620" href = "#bs21623892135774528620" > #< / a > Find 9 symbols text in end of 99 symbols text< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string::find;< span class = "tooltiptext code" > template< typename T>
void Find(benchmark::State& state) {
T x{LONG_TEXT LONG_TEXT LONG_TEXT TEST_TEXT};
for (auto _: state) {
int i = (int)x.find(TEST_TEXT);
#ifdef CHECK_RESULT
if (i != 90) {
state.SkipWithError(" not find?" );
break;
}
#endif
benchmark::DoNotOptimize(i);
benchmark::DoNotOptimize(x);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Здесь "победила дружба", у
2026-01-21 11:59:17 +00:00
Однако, Windows и Linux явно в разных весовых категориях.
Here, "friendship wins," with all types scoring roughly equally.
2026-01-29 20:48:41 +00:00
However, Windows and Linux are clearly in different weight classes.< / span > < / span > < / td > < td class = "benchmarkresult" > 8.53< / td > < td class = "benchmarkresult" > 7.74< / td > < td class = "benchmarkresult" > 38.2< / td > < td class = "benchmarkresult" > 46.3< / td > < td class = "benchmarkresult" > 54.4< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string_view::find;< span class = "tooltiptext code" > template< typename T>
void Find(benchmark::State& state) {
T x{LONG_TEXT LONG_TEXT LONG_TEXT TEST_TEXT};
for (auto _: state) {
int i = (int)x.find(TEST_TEXT);
#ifdef CHECK_RESULT
if (i != 90) {
state.SkipWithError(" not find?" );
break;
}
#endif
benchmark::DoNotOptimize(i);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 7.92< / td > < td class = "benchmarkresult" > 6.68< / td > < td class = "benchmarkresult" > 38.2< / td > < td class = "benchmarkresult" > 45.0< / td > < td class = "benchmarkresult" > 56.9< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > ssa::find;< span class = "tooltiptext code" > template< typename T>
void Find(benchmark::State& state) {
T x{LONG_TEXT LONG_TEXT LONG_TEXT TEST_TEXT};
for (auto _: state) {
int i = (int)x.find(TEST_TEXT);
#ifdef CHECK_RESULT
if (i != 90) {
state.SkipWithError(" not find?" );
break;
}
#endif
benchmark::DoNotOptimize(i);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 7.08< / td > < td class = "benchmarkresult" > 6.45< / td > < td class = "benchmarkresult" > 17.8< / td > < td class = "benchmarkresult" > 25.5< / td > < td class = "benchmarkresult" > 56.5< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa::find;< span class = "tooltiptext code" > template< typename T>
void Find(benchmark::State& state) {
T x{LONG_TEXT LONG_TEXT LONG_TEXT TEST_TEXT};
for (auto _: state) {
int i = (int)x.find(TEST_TEXT);
#ifdef CHECK_RESULT
if (i != 90) {
state.SkipWithError(" not find?" );
break;
}
#endif
benchmark::DoNotOptimize(i);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 7.65< / td > < td class = "benchmarkresult" > 6.78< / td > < td class = "benchmarkresult" > 18.7< / td > < td class = "benchmarkresult" > 34.4< / td > < td class = "benchmarkresult" > 60.3< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 20>::find;< span class = "tooltiptext code" > template< typename T>
void Find(benchmark::State& state) {
T x{LONG_TEXT LONG_TEXT LONG_TEXT TEST_TEXT};
for (auto _: state) {
int i = (int)x.find(TEST_TEXT);
#ifdef CHECK_RESULT
if (i != 90) {
state.SkipWithError(" not find?" );
break;
}
#endif
benchmark::DoNotOptimize(i);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 7.06< / td > < td class = "benchmarkresult" > 6.95< / td > < td class = "benchmarkresult" > 19.6< / td > < td class = "benchmarkresult" > 34.1< / td > < td class = "benchmarkresult" > 52.4< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 40>::find;< span class = "tooltiptext code" > template< typename T>
void Find(benchmark::State& state) {
T x{LONG_TEXT LONG_TEXT LONG_TEXT TEST_TEXT};
for (auto _: state) {
int i = (int)x.find(TEST_TEXT);
#ifdef CHECK_RESULT
if (i != 90) {
state.SkipWithError(" not find?" );
break;
}
#endif
benchmark::DoNotOptimize(i);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 6.79< / td > < td class = "benchmarkresult" > 6.87< / td > < td class = "benchmarkresult" > 17.5< / td > < td class = "benchmarkresult" > 24.0< / td > < td class = "benchmarkresult" > 51.0< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' F i n d 9 s y m b o l s t e x t i n e n d o f 9 9 s y m b o l s t e x t ' ] = { i d : ' b s 1 2 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::string::find;',data:[8.53,7.74,38.2,46.3,54.4]},
{name:'std::string_view::find;',data:[7.92,6.68,38.2,45.0,56.9]},
{name:'ssa::find;',data:[7.08,6.45,17.8,25.5,56.5]},
{name:'stringa::find;',data:[7.65,6.78,18.7,34.4,60.3]},
{name:'lstringa< 20 > ::find;',data:[7.06,6.95,19.6,34.1,52.4]},
{name:'lstringa< 40 > ::find;',data:[6.79,6.87,17.5,24.0,51.0]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs13" > < h4 > < a id = "bs170792414351801782640" href = "#bs170792414351801782640" > #< / a > Copy not literal Str with N symbols< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string copy{str_with_len_N};/15< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 4.98< / td > < td class = "benchmarkresult" > 5.03< / td > < td class = "benchmarkresult" > 1.80< / td > < td class = "benchmarkresult" > 4.91< / td > < td class = "benchmarkresult" > 34.4< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string copy{str_with_len_N};/16< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Явно виден скачок, где заканчивается SSO и начинается аллокация.
Обратите внимание, что WASM - 32-битный, и там размер
2026-01-21 11:59:17 +00:00
SSO у
The jump where SSO ends and allocation begins is clearly visible.
Note that WASM is 32-bit, and the size of the SSO for std::string is
2026-01-29 20:48:41 +00:00
smaller, as far as I remember: 11 characters + 0.< / span > < / span > < / td > < td class = "benchmarkresult" > 23.5< / td > < td class = "benchmarkresult" > 23.7< / td > < td class = "benchmarkresult" > 80.7< / td > < td class = "benchmarkresult" > 107< / td > < td class = "benchmarkresult" > 34.6< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string copy{str_with_len_N};/23< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Дальше просто добавляется время на копирование байтов.
2026-01-29 20:48:41 +00:00
Then the time for copying bytes is simply added.< / span > < / span > < / td > < td class = "benchmarkresult" > 23.1< / td > < td class = "benchmarkresult" > 23.2< / td > < td class = "benchmarkresult" > 81.5< / td > < td class = "benchmarkresult" > 100< / td > < td class = "benchmarkresult" > 35.2< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string copy{str_with_len_N};/24< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 23.1< / td > < td class = "benchmarkresult" > 23.2< / td > < td class = "benchmarkresult" > 79.1< / td > < td class = "benchmarkresult" > 104< / td > < td class = "benchmarkresult" > 34.8< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string copy{str_with_len_N};/32< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 25.3< / td > < td class = "benchmarkresult" > 25.6< / td > < td class = "benchmarkresult" > 81.0< / td > < td class = "benchmarkresult" > 108< / td > < td class = "benchmarkresult" > 41.2< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string copy{str_with_len_N};/64< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 22.7< / td > < td class = "benchmarkresult" > 24.7< / td > < td class = "benchmarkresult" > 82.1< / td > < td class = "benchmarkresult" > 113< / td > < td class = "benchmarkresult" > 37.9< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string copy{str_with_len_N};/128< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 25.8< / td > < td class = "benchmarkresult" > 25.9< / td > < td class = "benchmarkresult" > 84.9< / td > < td class = "benchmarkresult" > 104< / td > < td class = "benchmarkresult" > 39.8< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string copy{str_with_len_N};/256< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 24.6< / td > < td class = "benchmarkresult" > 25.5< / td > < td class = "benchmarkresult" > 84.9< / td > < td class = "benchmarkresult" > 110< / td > < td class = "benchmarkresult" > 59.6< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string copy{str_with_len_N};/512< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 28.6< / td > < td class = "benchmarkresult" > 29.8< / td > < td class = "benchmarkresult" > 95.7< / td > < td class = "benchmarkresult" > 110< / td > < td class = "benchmarkresult" > 57.3< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string copy{str_with_len_N};/1024< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 47.0< / td > < td class = "benchmarkresult" > 46.4< / td > < td class = "benchmarkresult" > 95.9< / td > < td class = "benchmarkresult" > 125< / td > < td class = "benchmarkresult" > 59.5< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string copy{str_with_len_N};/2048< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 124< / td > < td class = "benchmarkresult" > 124< / td > < td class = "benchmarkresult" > 131< / td > < td class = "benchmarkresult" > 150< / td > < td class = "benchmarkresult" > 82.2< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string copy{str_with_len_N};/4096< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Чем длиннее строка, тем дольше создаётся копия.
2026-01-29 20:48:41 +00:00
The longer the string, the longer it takes to create a copy.< / span > < / span > < / td > < td class = "benchmarkresult" > 168< / td > < td class = "benchmarkresult" > 158< / td > < td class = "benchmarkresult" > 175< / td > < td class = "benchmarkresult" > 206< / td > < td class = "benchmarkresult" > 111< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa copy{str_with_len_N};/15< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Здесь stringa инициализируется не литералом,
2026-01-21 11:59:17 +00:00
а
Here, stringa is not initialized with a literal,
2026-01-29 20:48:41 +00:00
meaning it must store characters itself.< / span > < / span > < / td > < td class = "benchmarkresult" > 1.10< / td > < td class = "benchmarkresult" > 1.12< / td > < td class = "benchmarkresult" > 1.31< / td > < td class = "benchmarkresult" > 4.44< / td > < td class = "benchmarkresult" > 2.54< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa copy{str_with_len_N};/16< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Под WASM SSO у
2026-01-21 11:59:17 +00:00
собиралось без поддержки потоков, поэтому атомарный
инкремент заменён на обычный, судя по времени.
Under WASM, stringa has a 15-character SSO. Furthermore,
it was built without thread support, so the atomic
2026-01-29 20:48:41 +00:00
increment was replaced with a regular one, judging by the time.< / span > < / span > < / td > < td class = "benchmarkresult" > 1.11< / td > < td class = "benchmarkresult" > 1.13< / td > < td class = "benchmarkresult" > 1.29< / td > < td class = "benchmarkresult" > 4.43< / td > < td class = "benchmarkresult" > 4.81< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa copy{str_with_len_N};/23< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > SSO в stringa до 23 символов, и даже 23
2026-01-21 11:59:17 +00:00
копируются быстрее, чем 15 в std::string.
SSO in stringa is up to 23 characters, and even 23
2026-01-29 20:48:41 +00:00
copies faster than 15 in std::string.< / span > < / span > < / td > < td class = "benchmarkresult" > 1.12< / td > < td class = "benchmarkresult" > 1.13< / td > < td class = "benchmarkresult" > 1.29< / td > < td class = "benchmarkresult" > 4.45< / td > < td class = "benchmarkresult" > 4.84< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa copy{str_with_len_N};/24< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Всё, не влезаем в SSO, а
2026-01-21 11:59:17 +00:00
Добавляется время на атомарный инкремент счётчика.
That's it, we're not using SSO, so we're using a shared buffer.
2026-01-29 20:48:41 +00:00
Time is added for the atomic counter increment.< / span > < / span > < / td > < td class = "benchmarkresult" > 16.1< / td > < td class = "benchmarkresult" > 16.1< / td > < td class = "benchmarkresult" > 15.8< / td > < td class = "benchmarkresult" > 19.1< / td > < td class = "benchmarkresult" > 4.89< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa copy{str_with_len_N};/32< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 16.0< / td > < td class = "benchmarkresult" > 16.2< / td > < td class = "benchmarkresult" > 16.0< / td > < td class = "benchmarkresult" > 19.0< / td > < td class = "benchmarkresult" > 4.85< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa copy{str_with_len_N};/64< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 16.1< / td > < td class = "benchmarkresult" > 16.6< / td > < td class = "benchmarkresult" > 15.7< / td > < td class = "benchmarkresult" > 19.0< / td > < td class = "benchmarkresult" > 4.83< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa copy{str_with_len_N};/128< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 16.3< / td > < td class = "benchmarkresult" > 16.1< / td > < td class = "benchmarkresult" > 15.9< / td > < td class = "benchmarkresult" > 18.9< / td > < td class = "benchmarkresult" > 4.93< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa copy{str_with_len_N};/256< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 16.1< / td > < td class = "benchmarkresult" > 16.1< / td > < td class = "benchmarkresult" > 16.0< / td > < td class = "benchmarkresult" > 19.2< / td > < td class = "benchmarkresult" > 4.97< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa copy{str_with_len_N};/512< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 16.1< / td > < td class = "benchmarkresult" > 16.1< / td > < td class = "benchmarkresult" > 15.9< / td > < td class = "benchmarkresult" > 18.9< / td > < td class = "benchmarkresult" > 5.06< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa copy{str_with_len_N};/1024< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 16.2< / td > < td class = "benchmarkresult" > 16.6< / td > < td class = "benchmarkresult" > 16.1< / td > < td class = "benchmarkresult" > 19.1< / td > < td class = "benchmarkresult" > 4.81< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa copy{str_with_len_N};/2048< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 16.2< / td > < td class = "benchmarkresult" > 16.9< / td > < td class = "benchmarkresult" > 16.1< / td > < td class = "benchmarkresult" > 18.9< / td > < td class = "benchmarkresult" > 4.86< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa copy{str_with_len_N};/4096< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > И как видно, кроме инкремента нет накладных расходов,
2026-01-21 11:59:17 +00:00
время копирования не зависит от длины строки.
And as you can see, there are no overhead costs other than the
2026-01-29 20:48:41 +00:00
increment; copying time does not depend on the string length.< / span > < / span > < / td > < td class = "benchmarkresult" > 16.5< / td > < td class = "benchmarkresult" > 16.5< / td > < td class = "benchmarkresult" > 16.0< / td > < td class = "benchmarkresult" > 19.1< / td > < td class = "benchmarkresult" > 4.76< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 16> copy{str_with_len_N};/15< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > lstringa< 16 > использует SSO до 23 символов.
2026-01-21 11:59:17 +00:00
А
lstringa< 16 > uses SSO up to 23 characters.
2026-01-29 20:48:41 +00:00
WASM has a 32-bit architecture, so SSO is up to 19 characters.< / span > < / span > < / td > < td class = "benchmarkresult" > 4.72< / td > < td class = "benchmarkresult" > 4.44< / td > < td class = "benchmarkresult" > 5.02< / td > < td class = "benchmarkresult" > 8.49< / td > < td class = "benchmarkresult" > 14.1< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 16> copy{str_with_len_N};/16< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 4.56< / td > < td class = "benchmarkresult" > 4.46< / td > < td class = "benchmarkresult" > 4.96< / td > < td class = "benchmarkresult" > 8.68< / td > < td class = "benchmarkresult" > 13.9< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 16> copy{str_with_len_N};/23< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 4.73< / td > < td class = "benchmarkresult" > 4.53< / td > < td class = "benchmarkresult" > 5.42< / td > < td class = "benchmarkresult" > 9.22< / td > < td class = "benchmarkresult" > 28.7< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 16> copy{str_with_len_N};/24< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > И после начинает вести себя при копировании, как std::string.
2026-01-29 20:48:41 +00:00
And then it starts to behave like std::string when copied.< / span > < / span > < / td > < td class = "benchmarkresult" > 25.6< / td > < td class = "benchmarkresult" > 26.9< / td > < td class = "benchmarkresult" > 78.1< / td > < td class = "benchmarkresult" > 95.6< / td > < td class = "benchmarkresult" > 29.4< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 16> copy{str_with_len_N};/32< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 24.1< / td > < td class = "benchmarkresult" > 23.8< / td > < td class = "benchmarkresult" > 84.7< / td > < td class = "benchmarkresult" > 103< / td > < td class = "benchmarkresult" > 31.9< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 16> copy{str_with_len_N};/64< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 25.5< / td > < td class = "benchmarkresult" > 25.6< / td > < td class = "benchmarkresult" > 82.4< / td > < td class = "benchmarkresult" > 104< / td > < td class = "benchmarkresult" > 32.0< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 16> copy{str_with_len_N};/128< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 29.0< / td > < td class = "benchmarkresult" > 27.1< / td > < td class = "benchmarkresult" > 87.2< / td > < td class = "benchmarkresult" > 109< / td > < td class = "benchmarkresult" > 32.6< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 16> copy{str_with_len_N};/256< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 27.2< / td > < td class = "benchmarkresult" > 30.6< / td > < td class = "benchmarkresult" > 93.7< / td > < td class = "benchmarkresult" > 706< / td > < td class = "benchmarkresult" > 55.0< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 16> copy{str_with_len_N};/512< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 30.4< / td > < td class = "benchmarkresult" > 30.0< / td > < td class = "benchmarkresult" > 93.0< / td > < td class = "benchmarkresult" > 108< / td > < td class = "benchmarkresult" > 51.9< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 16> copy{str_with_len_N};/1024< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 105< / td > < td class = "benchmarkresult" > 98.8< / td > < td class = "benchmarkresult" > 99.6< / td > < td class = "benchmarkresult" > 122< / td > < td class = "benchmarkresult" > 54.2< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 16> copy{str_with_len_N};/2048< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 120< / td > < td class = "benchmarkresult" > 118< / td > < td class = "benchmarkresult" > 127< / td > < td class = "benchmarkresult" > 149< / td > < td class = "benchmarkresult" > 79.1< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 16> copy{str_with_len_N};/4096< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 134< / td > < td class = "benchmarkresult" > 135< / td > < td class = "benchmarkresult" > 198< / td > < td class = "benchmarkresult" > 211< / td > < td class = "benchmarkresult" > 106< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> copy{str_with_len_N};/15< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 4.93< / td > < td class = "benchmarkresult" > 5.21< / td > < td class = "benchmarkresult" > 4.94< / td > < td class = "benchmarkresult" > 9.83< / td > < td class = "benchmarkresult" > 15.4< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> copy{str_with_len_N};/16< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 5.05< / td > < td class = "benchmarkresult" > 5.22< / td > < td class = "benchmarkresult" > 4.93< / td > < td class = "benchmarkresult" > 10.2< / td > < td class = "benchmarkresult" > 15.5< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> copy{str_with_len_N};/23< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 5.29< / td > < td class = "benchmarkresult" > 5.39< / td > < td class = "benchmarkresult" > 4.71< / td > < td class = "benchmarkresult" > 9.69< / td > < td class = "benchmarkresult" > 15.2< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> copy{str_with_len_N};/24< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 5.07< / td > < td class = "benchmarkresult" > 5.85< / td > < td class = "benchmarkresult" > 4.87< / td > < td class = "benchmarkresult" > 10.2< / td > < td class = "benchmarkresult" > 15.0< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> copy{str_with_len_N};/32< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 4.54< / td > < td class = "benchmarkresult" > 4.85< / td > < td class = "benchmarkresult" > 7.69< / td > < td class = "benchmarkresult" > 14.1< / td > < td class = "benchmarkresult" > 18.3< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> copy{str_with_len_N};/64< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 6.08< / td > < td class = "benchmarkresult" > 7.00< / td > < td class = "benchmarkresult" > 7.79< / td > < td class = "benchmarkresult" > 13.7< / td > < td class = "benchmarkresult" > 17.7< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> copy{str_with_len_N};/128< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 6.39< / td > < td class = "benchmarkresult" > 7.11< / td > < td class = "benchmarkresult" > 8.68< / td > < td class = "benchmarkresult" > 14.1< / td > < td class = "benchmarkresult" > 18.1< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> copy{str_with_len_N};/256< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 8.42< / td > < td class = "benchmarkresult" > 16.4< / td > < td class = "benchmarkresult" > 9.48< / td > < td class = "benchmarkresult" > 15.2< / td > < td class = "benchmarkresult" > 20.7< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> copy{str_with_len_N};/512< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Даже 512 символов копируются быстрее, чем
2026-01-21 11:59:17 +00:00
одна аллокация или атомарный инкремент.
Even 512 characters are copied faster than a single
2026-01-29 20:48:41 +00:00
allocation or atomic increment.< / span > < / span > < / td > < td class = "benchmarkresult" > 11.5< / td > < td class = "benchmarkresult" > 10.6< / td > < td class = "benchmarkresult" > 10.9< / td > < td class = "benchmarkresult" > 16.7< / td > < td class = "benchmarkresult" > 21.8< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> copy{str_with_len_N};/1024< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > А у
2026-01-29 20:48:41 +00:00
And then it's like everyone else.< / span > < / span > < / td > < td class = "benchmarkresult" > 94.1< / td > < td class = "benchmarkresult" > 98.4< / td > < td class = "benchmarkresult" > 98.5< / td > < td class = "benchmarkresult" > 112< / td > < td class = "benchmarkresult" > 52.9< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> copy{str_with_len_N};/2048< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 112< / td > < td class = "benchmarkresult" > 117< / td > < td class = "benchmarkresult" > 132< / td > < td class = "benchmarkresult" > 153< / td > < td class = "benchmarkresult" > 76.5< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> copy{str_with_len_N};/4096< span class = "tooltiptext code" > template< typename T>
void CopyDynString(benchmark::State& state) {
T x(state.range(0), ' a' );
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 129< / td > < td class = "benchmarkresult" > 137< / td > < td class = "benchmarkresult" > 199< / td > < td class = "benchmarkresult" > 208< / td > < td class = "benchmarkresult" > 105< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' C o p y n o t l i t e r a l S t r w i t h N s y m b o l s ' ] = { i d : ' b s 1 3 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::string copy{str_with_len_N};/15',data:[4.98,5.03,1.80,4.91,34.4]},
{name:'std::string copy{str_with_len_N};/16',data:[23.5,23.7,80.7,107,34.6]},
{name:'std::string copy{str_with_len_N};/23',data:[23.1,23.2,81.5,100,35.2]},
{name:'std::string copy{str_with_len_N};/24',data:[23.1,23.2,79.1,104,34.8]},
{name:'std::string copy{str_with_len_N};/32',data:[25.3,25.6,81.0,108,41.2]},
{name:'std::string copy{str_with_len_N};/64',data:[22.7,24.7,82.1,113,37.9]},
{name:'std::string copy{str_with_len_N};/128',data:[25.8,25.9,84.9,104,39.8]},
{name:'std::string copy{str_with_len_N};/256',data:[24.6,25.5,84.9,110,59.6]},
{name:'std::string copy{str_with_len_N};/512',data:[28.6,29.8,95.7,110,57.3]},
{name:'std::string copy{str_with_len_N};/1024',data:[47.0,46.4,95.9,125,59.5]},
{name:'std::string copy{str_with_len_N};/2048',data:[124,124,131,150,82.2]},
{name:'std::string copy{str_with_len_N};/4096',data:[168,158,175,206,111]},
{name:'stringa copy{str_with_len_N};/15',data:[1.10,1.12,1.31,4.44,2.54]},
{name:'stringa copy{str_with_len_N};/16',data:[1.11,1.13,1.29,4.43,4.81]},
{name:'stringa copy{str_with_len_N};/23',data:[1.12,1.13,1.29,4.45,4.84]},
{name:'stringa copy{str_with_len_N};/24',data:[16.1,16.1,15.8,19.1,4.89]},
{name:'stringa copy{str_with_len_N};/32',data:[16.0,16.2,16.0,19.0,4.85]},
{name:'stringa copy{str_with_len_N};/64',data:[16.1,16.6,15.7,19.0,4.83]},
{name:'stringa copy{str_with_len_N};/128',data:[16.3,16.1,15.9,18.9,4.93]},
{name:'stringa copy{str_with_len_N};/256',data:[16.1,16.1,16.0,19.2,4.97]},
{name:'stringa copy{str_with_len_N};/512',data:[16.1,16.1,15.9,18.9,5.06]},
{name:'stringa copy{str_with_len_N};/1024',data:[16.2,16.6,16.1,19.1,4.81]},
{name:'stringa copy{str_with_len_N};/2048',data:[16.2,16.9,16.1,18.9,4.86]},
{name:'stringa copy{str_with_len_N};/4096',data:[16.5,16.5,16.0,19.1,4.76]},
{name:'lstringa< 16 > copy{str_with_len_N};/15',data:[4.72,4.44,5.02,8.49,14.1]},
{name:'lstringa< 16 > copy{str_with_len_N};/16',data:[4.56,4.46,4.96,8.68,13.9]},
{name:'lstringa< 16 > copy{str_with_len_N};/23',data:[4.73,4.53,5.42,9.22,28.7]},
{name:'lstringa< 16 > copy{str_with_len_N};/24',data:[25.6,26.9,78.1,95.6,29.4]},
{name:'lstringa< 16 > copy{str_with_len_N};/32',data:[24.1,23.8,84.7,103,31.9]},
{name:'lstringa< 16 > copy{str_with_len_N};/64',data:[25.5,25.6,82.4,104,32.0]},
{name:'lstringa< 16 > copy{str_with_len_N};/128',data:[29.0,27.1,87.2,109,32.6]},
{name:'lstringa< 16 > copy{str_with_len_N};/256',data:[27.2,30.6,93.7,706,55.0]},
{name:'lstringa< 16 > copy{str_with_len_N};/512',data:[30.4,30.0,93.0,108,51.9]},
{name:'lstringa< 16 > copy{str_with_len_N};/1024',data:[105,98.8,99.6,122,54.2]},
{name:'lstringa< 16 > copy{str_with_len_N};/2048',data:[120,118,127,149,79.1]},
{name:'lstringa< 16 > copy{str_with_len_N};/4096',data:[134,135,198,211,106]},
{name:'lstringa< 512 > copy{str_with_len_N};/15',data:[4.93,5.21,4.94,9.83,15.4]},
{name:'lstringa< 512 > copy{str_with_len_N};/16',data:[5.05,5.22,4.93,10.2,15.5]},
{name:'lstringa< 512 > copy{str_with_len_N};/23',data:[5.29,5.39,4.71,9.69,15.2]},
{name:'lstringa< 512 > copy{str_with_len_N};/24',data:[5.07,5.85,4.87,10.2,15.0]},
{name:'lstringa< 512 > copy{str_with_len_N};/32',data:[4.54,4.85,7.69,14.1,18.3]},
{name:'lstringa< 512 > copy{str_with_len_N};/64',data:[6.08,7.00,7.79,13.7,17.7]},
{name:'lstringa< 512 > copy{str_with_len_N};/128',data:[6.39,7.11,8.68,14.1,18.1]},
{name:'lstringa< 512 > copy{str_with_len_N};/256',data:[8.42,16.4,9.48,15.2,20.7]},
{name:'lstringa< 512 > copy{str_with_len_N};/512',data:[11.5,10.6,10.9,16.7,21.8]},
{name:'lstringa< 512 > copy{str_with_len_N};/1024',data:[94.1,98.4,98.5,112,52.9]},
{name:'lstringa< 512 > copy{str_with_len_N};/2048',data:[112,117,132,153,76.5]},
{name:'lstringa< 512 > copy{str_with_len_N};/4096',data:[129,137,199,208,105]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs14" > < h4 > < a id = "bs94756718925776995960" href = "#bs94756718925776995960" > #< / a > Convert to int ' 1234567' < / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string s = " 123456789" ; int res = std::strtol(s.c_str(), 0, 10);< span class = "tooltiptext code" > void ToIntStr10(benchmark::State& state, const std::string& s, int c) {
for (auto _: state) {
int res = std::strtol(s.c_str(), nullptr, 10);
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > В
нет нужды в null терминированности. Ближайший аналог такого
поведения "std::from_chars", но он к сожалению очень ограничен
по возможностям. Здесь я попытался произвести тесты, близкие по
2026-01-21 11:59:17 +00:00
логике к работе std::from_chars
In simstr, a string fragment is sufficient for conversion to a number;
there's no need for null termination. The closest analog to this behavior
is "std::from_chars," but unfortunately, it is very limited in its capabilities.
2026-01-29 20:48:41 +00:00
Here, I attempted to run tests that are similar in logic to std::from_chars.< / span > < / span > < / td > < td class = "benchmarkresult" > 26.8< / td > < td class = "benchmarkresult" > 28.4< / td > < td class = "benchmarkresult" > 31.8< / td > < td class = "benchmarkresult" > 38.8< / td > < td class = "benchmarkresult" > 73.0< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string_view s = " 123456789" ; std::from_chars(s.data(), s.data() + s.size(), res, 10);< span class = "tooltiptext code" > void ToIntFromChars10(benchmark::State& state, const std::string_view& s, int c) {
for (auto _: state) {
int res = 0;
std::from_chars(s.data(), s.data() + s.size(), res, 10);
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > from_chars требует точного указания основания счисления,
2026-01-21 11:59:17 +00:00
не допускает знаков плюс, пробелов, префиксов 0x и т.п.
from_chars requires an exact radix specification and does not allow plus
2026-01-29 20:48:41 +00:00
signs, spaces, 0x prefixes, etc.< / span > < / span > < / td > < td class = "benchmarkresult" > 15.0< / td > < td class = "benchmarkresult" > 12.5< / td > < td class = "benchmarkresult" > 14.1< / td > < td class = "benchmarkresult" > 16.2< / td > < td class = "benchmarkresult" > 27.8< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa s = " 123456789" ; int res = s.to_int< int, true, 10, false>< span class = "tooltiptext code" > template< typename T>
void ToIntSimStr10(benchmark::State& state, T t, int c) {
for (auto _: state) {
2025-11-26 19:15:50 +00:00
int res = t. template to_int< int, true, 10, false, false>().value;
2025-04-05 14:21:11 +00:00
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Здесь для to_int заданы такие же ограничения - проверять переполнение,
2026-01-21 11:59:17 +00:00
десятичная система, без лидирующих пробелов и знака плюс
Here, to_int has the same restrictions: check for overflow,
2026-01-29 20:48:41 +00:00
decimal system, no leading spaces, and no plus sign.< / span > < / span > < / td > < td class = "benchmarkresult" > 12.6< / td > < td class = "benchmarkresult" > 9.33< / td > < td class = "benchmarkresult" > 14.4< / td > < td class = "benchmarkresult" > 17.3< / td > < td class = "benchmarkresult" > 19.0< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > ssa s = " 123456789" ; int res = s.to_int< int, true, 10, false>< span class = "tooltiptext code" > template< typename T>
void ToIntSimStr10(benchmark::State& state, T t, int c) {
for (auto _: state) {
2025-11-26 19:15:50 +00:00
int res = t. template to_int< int, true, 10, false, false>().value;
2025-04-05 14:21:11 +00:00
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 12.6< / td > < td class = "benchmarkresult" > 8.06< / td > < td class = "benchmarkresult" > 13.8< / td > < td class = "benchmarkresult" > 17.5< / td > < td class = "benchmarkresult" > 17.0< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 20> s = " 123456789" ; int res = s.to_int< int, true, 10, false>< span class = "tooltiptext code" > template< typename T>
void ToIntSimStr10(benchmark::State& state, T t, int c) {
for (auto _: state) {
2025-11-26 19:15:50 +00:00
int res = t. template to_int< int, true, 10, false, false>().value;
2025-04-05 14:21:11 +00:00
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 12.3< / td > < td class = "benchmarkresult" > 8.31< / td > < td class = "benchmarkresult" > 13.8< / td > < td class = "benchmarkresult" > 17.4< / td > < td class = "benchmarkresult" > 17.0< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' C o n v e r t t o i n t \ ' 1 2 3 4 5 6 7 \ ' ' ] = { i d : ' b s 1 4 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::string s = "123456789"; int res = std::strtol(s.c_str(), 0, 10);',data:[26.8,28.4,31.8,38.8,73.0]},
{name:'std::string_view s = "123456789"; std::from_chars(s.data(), s.data() + s.size(), res, 10);',data:[15.0,12.5,14.1,16.2,27.8]},
{name:'stringa s = "123456789"; int res = s.to_int< int , true , 10 , false > ',data:[12.6,9.33,14.4,17.3,19.0]},
{name:'ssa s = "123456789"; int res = s.to_int< int , true , 10 , false > ',data:[12.6,8.06,13.8,17.5,17.0]},
{name:'lstringa< 20 > s = "123456789"; int res = s.to_int< int , true , 10 , false > ',data:[12.3,8.31,13.8,17.4,17.0]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs15" > < h4 > < a id = "bs182426078870126042750" href = "#bs182426078870126042750" > #< / a > Convert to unsigned ' abcDef' < / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string s = " abcDef" ; int res = std::strtol(s.c_str(), 0, 16);< span class = "tooltiptext code" > void ToIntStr16(benchmark::State& state, const std::string& s, int c) {
for (auto _: state) {
int res = std::strtol(s.c_str(), nullptr, 16);
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Всё то же, только для 16р о
2026-01-29 20:48:41 +00:00
Everything is the same, only for the hexadecimal system< / span > < / span > < / td > < td class = "benchmarkresult" > 23.4< / td > < td class = "benchmarkresult" > 23.7< / td > < td class = "benchmarkresult" > 33.8< / td > < td class = "benchmarkresult" > 40.8< / td > < td class = "benchmarkresult" > 56.5< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string_view s = " abcDef" ; std::from_chars(s.data(), s.data() + s.size(), res, 16);< span class = "tooltiptext code" > void ToIntFromChars16(benchmark::State& state, const std::string_view& s, int c) {
for (auto _: state) {
int res = 0;
std::from_chars(s.data(), s.data() + s.size(), res, 16);
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 9.80< / td > < td class = "benchmarkresult" > 9.69< / td > < td class = "benchmarkresult" > 8.36< / td > < td class = "benchmarkresult" > 11.0< / td > < td class = "benchmarkresult" > 28.3< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa s = " abcDef" ; int res = s.to_int< int, true, 16, false>< span class = "tooltiptext code" > template< typename T>
void ToIntSimStr16(benchmark::State& state, T t, int c) {
for (auto _: state) {
2025-11-26 19:15:50 +00:00
int res = t. template to_int< int, true, 16, false, false>().value;
2025-04-05 14:21:11 +00:00
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 12.5< / td > < td class = "benchmarkresult" > 8.60< / td > < td class = "benchmarkresult" > 13.0< / td > < td class = "benchmarkresult" > 15.6< / td > < td class = "benchmarkresult" > 17.3< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > ssa s = " abcDef" ; int res = s.to_int< int, true, 16, false>< span class = "tooltiptext code" > template< typename T>
void ToIntSimStr16(benchmark::State& state, T t, int c) {
for (auto _: state) {
2025-11-26 19:15:50 +00:00
int res = t. template to_int< int, true, 16, false, false>().value;
2025-04-05 14:21:11 +00:00
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 12.6< / td > < td class = "benchmarkresult" > 8.20< / td > < td class = "benchmarkresult" > 12.4< / td > < td class = "benchmarkresult" > 16.3< / td > < td class = "benchmarkresult" > 16.2< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 20> s = " abcDef" ; int res = s.to_int< int, true, 16, false>< span class = "tooltiptext code" > template< typename T>
void ToIntSimStr16(benchmark::State& state, T t, int c) {
for (auto _: state) {
2025-11-26 19:15:50 +00:00
int res = t. template to_int< int, true, 16, false, false>().value;
2025-04-05 14:21:11 +00:00
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 13.0< / td > < td class = "benchmarkresult" > 8.19< / td > < td class = "benchmarkresult" > 12.3< / td > < td class = "benchmarkresult" > 16.1< / td > < td class = "benchmarkresult" > 16.7< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' C o n v e r t t o u n s i g n e d \ ' a b c D e f \ ' ' ] = { i d : ' b s 1 5 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::string s = "abcDef"; int res = std::strtol(s.c_str(), 0, 16);',data:[23.4,23.7,33.8,40.8,56.5]},
{name:'std::string_view s = "abcDef"; std::from_chars(s.data(), s.data() + s.size(), res, 16);',data:[9.80,9.69,8.36,11.0,28.3]},
{name:'stringa s = "abcDef"; int res = s.to_int< int , true , 16 , false > ',data:[12.5,8.60,13.0,15.6,17.3]},
{name:'ssa s = "abcDef"; int res = s.to_int< int , true , 16 , false > ',data:[12.6,8.20,12.4,16.3,16.2]},
{name:'lstringa< 20 > s = "abcDef"; int res = s.to_int< int , true , 16 , false > ',data:[13.0,8.19,12.3,16.1,16.7]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs16" > < h4 > < a id = "bs52606100125109966680" href = "#bs52606100125109966680" > #< / a > Convert to int ' 1234567' < / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string s = " 123456789" ; int res = std::strtol(s.c_str(), 0, 0);< span class = "tooltiptext code" > void ToIntStr0(benchmark::State& state, const std::string& s, int c) {
for (auto _: state) {
int res = std::strtol(s.c_str(), nullptr, 0);
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > А
2026-01-29 20:48:41 +00:00
And here we have parsing of an arbitrary number.< / span > < / span > < / td > < td class = "benchmarkresult" > 29.7< / td > < td class = "benchmarkresult" > 28.5< / td > < td class = "benchmarkresult" > 45.7< / td > < td class = "benchmarkresult" > 54.1< / td > < td class = "benchmarkresult" > 77.7< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa s = " 123456789" ; int res = s.to_int< int>; // Check overflow< span class = "tooltiptext code" > template< typename T>
void ToIntSimStr0(benchmark::State& state, T t, int c) {
for (auto _: state) {
2025-11-26 19:15:50 +00:00
int res = t. template to_int< int>().value;
2025-04-05 14:21:11 +00:00
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 18.3< / td > < td class = "benchmarkresult" > 15.0< / td > < td class = "benchmarkresult" > 19.5< / td > < td class = "benchmarkresult" > 22.6< / td > < td class = "benchmarkresult" > 24.6< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > ssa s = " 123456789" ; int res = s.to_int< int, false>; // No check overflow< span class = "tooltiptext code" > void ToIntNoOverflow(benchmark::State& state, ssa t, int c) {
for (auto _: state) {
2025-11-26 19:15:50 +00:00
int res = t.to_int< int, false>().value;
2025-04-05 14:21:11 +00:00
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 15.0< / td > < td class = "benchmarkresult" > 10.8< / td > < td class = "benchmarkresult" > 15.9< / td > < td class = "benchmarkresult" > 18.5< / td > < td class = "benchmarkresult" > 23.6< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' C o n v e r t t o i n t \ ' 1 2 3 4 5 6 7 \ ' ' ] = { i d : ' b s 1 6 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::string s = " 123456789"; int res = std::strtol(s.c_str(), 0, 0);',data:[29.7,28.5,45.7,54.1,77.7]},
{name:'stringa s = " 123456789"; int res = s.to_int< int > ; // Check overflow',data:[18.3,15.0,19.5,22.6,24.6]},
{name:'ssa s = " 123456789"; int res = s.to_int< int , false > ; // No check overflow',data:[15.0,10.8,15.9,18.5,23.6]}
2025-11-26 19:15:50 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs17" > < h4 > < a id = "bs182348477702821075660" href = "#bs182348477702821075660" > #< / a > Convert to double ' 1234.567e10' < / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-11-26 19:15:50 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string s = " 1234.567e10" ; double res = std::strtod(s.c_str(), nullptr);< span class = "tooltiptext code" > void ToDoubleStr(benchmark::State& state, const std::string& s, double c) {
for (auto _: state) {
char* ptr = nullptr;
double res = std::strtod(s.c_str(), & ptr);
if (ptr == s.c_str()) {
state.SkipWithError(" not equal" );
}
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 64.7< / td > < td class = "benchmarkresult" > 65.2< / td > < td class = "benchmarkresult" > 104< / td > < td class = "benchmarkresult" > 118< / td > < td class = "benchmarkresult" > 196< / td > < / tr >
2025-11-26 19:15:50 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string_view s = " 1234.567e10" ; std::from_chars(s.data(), s.data() + s.size(), res);< span class = "tooltiptext code" > void ToDoubleFromChars(benchmark::State& state, const std::string_view& s, double c) {
for (auto _: state) {
double res = 0;
if (std::from_chars(s.data(), s.data() + s.size(), res).ec != std::errc{}) {
state.SkipWithError(" not equal" );
}
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 27.5< / td > < td class = "benchmarkresult" > 25.6< / td > < td class = "benchmarkresult" > 62.1< / td > < td class = "benchmarkresult" > 95.8< / td > < td class = "benchmarkresult" > 106< / td > < / tr >
2025-11-26 19:15:50 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > ssa s = " 1234.567e10" ; double res = *s.to_double()< span class = "tooltiptext code" > template< typename T>
void ToDoubleSimStr(benchmark::State& state, T t, double c) {
for (auto _: state) {
auto r = t.template to_double< false>();
if (!r) {
state.SkipWithError(" not equal" );
}
double res = *r;
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 26.1< / td > < td class = "benchmarkresult" > 24.8< / td > < td class = "benchmarkresult" > 35.8< / td > < td class = "benchmarkresult" > 41.0< / td > < td class = "benchmarkresult" > 43.1< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' C o n v e r t t o d o u b l e \ ' 1 2 3 4 . 5 6 7 e 1 0 \ ' ' ] = { i d : ' b s 1 7 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::string s = "1234.567e10"; double res = std::strtod(s.c_str(), nullptr);',data:[64.7,65.2,104,118,196]},
{name:'std::string_view s = "1234.567e10"; std::from_chars(s.data(), s.data() + s.size(), res);',data:[27.5,25.6,62.1,95.8,106]},
{name:'ssa s = "1234.567e10"; double res = *s.to_double()',data:[26.1,24.8,35.8,41.0,43.1]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs18" > < h4 > < a id = "bs96505608161678391610" href = "#bs96505608161678391610" > #< / a > Append const literal of 16 bytes 64 times, 1024 total length< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::stringstream str; ... str < < " abbaabbaabbaabba" ;< span class = "tooltiptext code" > void AppendStreamConstLiteral(benchmark::State& state) {
for (auto _: state) {
std::string result;
std::stringstream str;
for (size_t c = 0; c < 64; c++) {
str < < TEXT_16;
}
result = str.str();
#ifdef CHECK_RESULT
if (result.size() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(str);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1587< / td > < td class = "benchmarkresult" > 1362< / td > < td class = "benchmarkresult" > 5448< / td > < td class = "benchmarkresult" > 7262< / td > < td class = "benchmarkresult" > 4557< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string str; ... str += " abbaabbaabbaabba" ;< span class = "tooltiptext code" > void AppendStdStringConstLiteral(benchmark::State& state) {
for (auto _: state) {
std::string result;
for (size_t c = 0; c < 64; c++) {
result += TEXT_16;
}
#ifdef CHECK_RESULT
if (result.size() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 378< / td > < td class = "benchmarkresult" > 368< / td > < td class = "benchmarkresult" > 1058< / td > < td class = "benchmarkresult" > 1589< / td > < td class = "benchmarkresult" > 598< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 8> str; ... str += " abbaabbaabbaabba" ;< span class = "tooltiptext code" > template< unsigned N>
void AppendLstringConstLiteral(benchmark::State& state) {
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 64; c++) {
result += TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 402< / td > < td class = "benchmarkresult" > 399< / td > < td class = "benchmarkresult" > 784< / td > < td class = "benchmarkresult" > 1249< / td > < td class = "benchmarkresult" > 705< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 128> str; ... str += " abbaabbaabbaabba" ;< span class = "tooltiptext code" > template< unsigned N>
void AppendLstringConstLiteral(benchmark::State& state) {
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 64; c++) {
result += TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Чем больше внутренний буфер, тем меньше раз требуется
2026-01-21 11:59:17 +00:00
аллокация, тем быстрее результат.
The larger the internal buffer, the fewer allocations are
2026-01-29 20:48:41 +00:00
required, and the faster the result.< / span > < / span > < / td > < td class = "benchmarkresult" > 264< / td > < td class = "benchmarkresult" > 274< / td > < td class = "benchmarkresult" > 397< / td > < td class = "benchmarkresult" > 639< / td > < td class = "benchmarkresult" > 564< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> str; ... str += " abbaabbaabbaabba" ;< span class = "tooltiptext code" > template< unsigned N>
void AppendLstringConstLiteral(benchmark::State& state) {
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 64; c++) {
result += TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 257< / td > < td class = "benchmarkresult" > 254< / td > < td class = "benchmarkresult" > 241< / td > < td class = "benchmarkresult" > 511< / td > < td class = "benchmarkresult" > 472< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 1024> str; ... str += " abbaabbaabbaabba" ;< span class = "tooltiptext code" > template< unsigned N>
void AppendLstringConstLiteral(benchmark::State& state) {
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 64; c++) {
result += TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 157< / td > < td class = "benchmarkresult" > 139< / td > < td class = "benchmarkresult" > 152< / td > < td class = "benchmarkresult" > 255< / td > < td class = "benchmarkresult" > 396< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' A p p e n d c o n s t l i t e r a l o f 1 6 b y t e s 6 4 t i m e s , 1 0 2 4 t o t a l l e n g t h ' ] = { i d : ' b s 1 8 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::stringstream str; ... str < < "abbaabbaabbaabba";',data:[1587,1362,5448,7262,4557]},
{name:'std::string str; ... str += "abbaabbaabbaabba";',data:[378,368,1058,1589,598]},
{name:'lstringa< 8 > str; ... str += "abbaabbaabbaabba";',data:[402,399,784,1249,705]},
{name:'lstringa< 128 > str; ... str += "abbaabbaabbaabba";',data:[264,274,397,639,564]},
{name:'lstringa< 512 > str; ... str += "abbaabbaabbaabba";',data:[257,254,241,511,472]},
{name:'lstringa< 1024 > str; ... str += "abbaabbaabbaabba";',data:[157,139,152,255,396]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs19" > < h4 > < a id = "bs36931044816721597850" href = "#bs36931044816721597850" > #< / a > Append string of 16 bytes and const literal of 16 bytes 32 times, 1024 total length< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::stringstream str; ... str < < str_var < < " abbaabbaabbaabba" ;< span class = "tooltiptext code" > void AppendStreamStrConstLiteral(benchmark::State& state) {
std::string s1 = TEXT_16;
for (auto _: state) {
std::string result;
std::stringstream s;
for (size_t c = 0; c < 32; c++) {
s < < s1 < < TEXT_16;
}
result = s.str();
#ifdef CHECK_RESULT
if (result.size() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1441< / td > < td class = "benchmarkresult" > 1381< / td > < td class = "benchmarkresult" > 4534< / td > < td class = "benchmarkresult" > 6865< / td > < td class = "benchmarkresult" > 4433< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string str; ... str += str_var + " abbaabbaabbaabba" ;< span class = "tooltiptext code" > void AppendStdStrStrConstLiteral(benchmark::State& state) {
std::string p1 = TEXT_16;
for (auto _: state) {
std::string result;
for (size_t c = 0; c < 32; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.size() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1266< / td > < td class = "benchmarkresult" > 1279< / td > < td class = "benchmarkresult" > 3803< / td > < td class = "benchmarkresult" > 4507< / td > < td class = "benchmarkresult" > 1926< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 8> str; ... str += str_var + " abbaabbaabbaabba" ;< span class = "tooltiptext code" > template< unsigned N>
void AppendLstringStrConstLiteral(benchmark::State& state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 32; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 482< / td > < td class = "benchmarkresult" > 475< / td > < td class = "benchmarkresult" > 698< / td > < td class = "benchmarkresult" > 1082< / td > < td class = "benchmarkresult" > 804< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 128> str; ... str += str_var + " abbaabbaabbaabba" ;< span class = "tooltiptext code" > template< unsigned N>
void AppendLstringStrConstLiteral(benchmark::State& state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 32; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 366< / td > < td class = "benchmarkresult" > 413< / td > < td class = "benchmarkresult" > 446< / td > < td class = "benchmarkresult" > 664< / td > < td class = "benchmarkresult" > 726< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> str; ... str += str_var + " abbaabbaabbaabba" ;< span class = "tooltiptext code" > template< unsigned N>
void AppendLstringStrConstLiteral(benchmark::State& state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 32; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 325< / td > < td class = "benchmarkresult" > 323< / td > < td class = "benchmarkresult" > 293< / td > < td class = "benchmarkresult" > 538< / td > < td class = "benchmarkresult" > 597< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 1024> str; ... str += str_var + " abbaabbaabbaabba" ;< span class = "tooltiptext code" > template< unsigned N>
void AppendLstringStrConstLiteral(benchmark::State& state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 32; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 235< / td > < td class = "benchmarkresult" > 243< / td > < td class = "benchmarkresult" > 205< / td > < td class = "benchmarkresult" > 319< / td > < td class = "benchmarkresult" > 523< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' A p p e n d s t r i n g o f 1 6 b y t e s a n d c o n s t l i t e r a l o f 1 6 b y t e s 3 2 t i m e s , 1 0 2 4 t o t a l l e n g t h ' ] = { i d : ' b s 1 9 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::stringstream str; ... str < < str_var < < " abbaabbaabbaabba " ; ' , data: [ 1441 , 1381 , 4534 , 6865 , 4433 ] } ,
{name:'std::string str; ... str += str_var + "abbaabbaabbaabba";',data:[1266,1279,3803,4507,1926]},
{name:'lstringa< 8 > str; ... str += str_var + "abbaabbaabbaabba";',data:[482,475,698,1082,804]},
{name:'lstringa< 128 > str; ... str += str_var + "abbaabbaabbaabba";',data:[366,413,446,664,726]},
{name:'lstringa< 512 > str; ... str += str_var + "abbaabbaabbaabba";',data:[325,323,293,538,597]},
{name:'lstringa< 1024 > str; ... str += str_var + "abbaabbaabbaabba";',data:[235,243,205,319,523]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs20" > < h4 > < a id = "bs8293767858383349360" href = "#bs8293767858383349360" > #< / a > Append string of 16 bytes and const literal of 16 bytes 2048 times, 65536 total length< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::stringstream str; ... str < < str_var < < " abbaabbaabbaabba" ; 2048 times< span class = "tooltiptext code" > void AppendStreamStrConstLiteralBig(benchmark::State& state) {
std::string s1 = TEXT_16;
for (auto _: state) {
std::string result;
std::stringstream s;
for (size_t c = 0; c < 2048; c++) {
s < < s1 < < TEXT_16;
}
result = s.str();
#ifdef CHECK_RESULT
if (result.size() != 1024 * 64) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 75359< / td > < td class = "benchmarkresult" > 75087< / td > < td class = "benchmarkresult" > 226006< / td > < td class = "benchmarkresult" > 323116< / td > < td class = "benchmarkresult" > 218832< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string str; ... str += str_var + " abbaabbaabbaabba" ; 2048 times< span class = "tooltiptext code" > void AppendStdStrStrConstLiteralBig(benchmark::State& state) {
std::string p1 = TEXT_16;
for (auto _: state) {
std::string result;
for (size_t c = 0; c < 2048; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.size() != 1024 * 64) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 75620< / td > < td class = "benchmarkresult" > 74728< / td > < td class = "benchmarkresult" > 202060< / td > < td class = "benchmarkresult" > 236019< / td > < td class = "benchmarkresult" > 104650< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 8> str; ... str += str_var + " abbaabbaabbaabba" ; 2048 times< span class = "tooltiptext code" > template< unsigned N>
void AppendLstringStrConstLiteralBig(benchmark::State& state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 2048; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024 * 64) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 18777< / td > < td class = "benchmarkresult" > 20069< / td > < td class = "benchmarkresult" > 18025< / td > < td class = "benchmarkresult" > 26277< / td > < td class = "benchmarkresult" > 39563< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 128> str; ... str += str_var + " abbaabbaabbaabba" ; 2048 times< span class = "tooltiptext code" > template< unsigned N>
void AppendLstringStrConstLiteralBig(benchmark::State& state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 2048; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024 * 64) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 20186< / td > < td class = "benchmarkresult" > 19059< / td > < td class = "benchmarkresult" > 16217< / td > < td class = "benchmarkresult" > 24737< / td > < td class = "benchmarkresult" > 38589< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> str; ... str += str_var + " abbaabbaabbaabba" ; 2048 times< span class = "tooltiptext code" > template< unsigned N>
void AppendLstringStrConstLiteralBig(benchmark::State& state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 2048; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024 * 64) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 16028< / td > < td class = "benchmarkresult" > 17233< / td > < td class = "benchmarkresult" > 15826< / td > < td class = "benchmarkresult" > 23810< / td > < td class = "benchmarkresult" > 37622< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 1024> str; ... str += str_var + " abbaabbaabbaabba" ; 2048 times< span class = "tooltiptext code" > template< unsigned N>
void AppendLstringStrConstLiteralBig(benchmark::State& state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 2048; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024 * 64) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 15798< / td > < td class = "benchmarkresult" > 17586< / td > < td class = "benchmarkresult" > 16177< / td > < td class = "benchmarkresult" > 24103< / td > < td class = "benchmarkresult" > 38473< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' A p p e n d s t r i n g o f 1 6 b y t e s a n d c o n s t l i t e r a l o f 1 6 b y t e s 2 0 4 8 t i m e s , 6 5 5 3 6 t o t a l l e n g t h ' ] = { i d : ' b s 2 0 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::stringstream str; ... str < < str_var < < " abbaabbaabbaabba " ; 2048 times ' , data: [ 75359 , 75087 , 226006 , 323116 , 218832 ] } ,
{name:'std::string str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[75620,74728,202060,236019,104650]},
{name:'lstringa< 8 > str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[18777,20069,18025,26277,39563]},
{name:'lstringa< 128 > str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[20186,19059,16217,24737,38589]},
{name:'lstringa< 512 > str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[16028,17233,15826,23810,37622]},
{name:'lstringa< 1024 > str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[15798,17586,16177,24103,38473]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs21" > < h4 > < a id = "bs66949588770596833730" href = "#bs66949588770596833730" > #< / a > Append 2 string of 16 bytes 32 times, 1024 total length< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::stringstream str; ... str < < str_var1 < < str_var2;< span class = "tooltiptext code" > void AppendStream2String(benchmark::State& state) {
std::string s1 = TEXT_16;
std::string s2 = TEXT_16;
for (auto _: state) {
std::string result;
std::stringstream s;
for (size_t c = 0; c < 32; c++) {
s < < s1 < < s2;
}
result = s.str();
#ifdef CHECK_RESULT
if (result.size() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
benchmark::DoNotOptimize(s2);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1439< / td > < td class = "benchmarkresult" > 1393< / td > < td class = "benchmarkresult" > 4604< / td > < td class = "benchmarkresult" > 6233< / td > < td class = "benchmarkresult" > 4648< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string str; ... str += str_var1 + str_var2;< span class = "tooltiptext code" > void AppendStdStr2String(benchmark::State& state) {
std::string s1 = TEXT_16;
std::string s2 = TEXT_16;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
for (auto _: state) {
std::string result;
for (size_t c = 0; c < 32; c++) {
result += s1 + s2;
}
#ifdef CHECK_RESULT
if (result.size() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
benchmark::DoNotOptimize(s2);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1398< / td > < td class = "benchmarkresult" > 1436< / td > < td class = "benchmarkresult" > 3797< / td > < td class = "benchmarkresult" > 4436< / td > < td class = "benchmarkresult" > 2346< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 16> str; ... str += str_var1 + str_var2;< span class = "tooltiptext code" > template< unsigned N>
void AppendLstring2String(benchmark::State& state) {
stra s1 = TEXT_16;
stra s2 = TEXT_16;
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 32; c++) {
result += s1 + s2;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
benchmark::DoNotOptimize(s2);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 540< / td > < td class = "benchmarkresult" > 560< / td > < td class = "benchmarkresult" > 813< / td > < td class = "benchmarkresult" > 1198< / td > < td class = "benchmarkresult" > 1150< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 128> str; ... str += str_var1 + str_var2;< span class = "tooltiptext code" > template< unsigned N>
void AppendLstring2String(benchmark::State& state) {
stra s1 = TEXT_16;
stra s2 = TEXT_16;
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 32; c++) {
result += s1 + s2;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
benchmark::DoNotOptimize(s2);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 465< / td > < td class = "benchmarkresult" > 446< / td > < td class = "benchmarkresult" > 527< / td > < td class = "benchmarkresult" > 673< / td > < td class = "benchmarkresult" > 1100< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 512> str; ... str += str_var1 + str_var2;< span class = "tooltiptext code" > template< unsigned N>
void AppendLstring2String(benchmark::State& state) {
stra s1 = TEXT_16;
stra s2 = TEXT_16;
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 32; c++) {
result += s1 + s2;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
benchmark::DoNotOptimize(s2);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 398< / td > < td class = "benchmarkresult" > 400< / td > < td class = "benchmarkresult" > 381< / td > < td class = "benchmarkresult" > 595< / td > < td class = "benchmarkresult" > 934< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 1024> str; ... str += str_var1 + str_var2;< span class = "tooltiptext code" > template< unsigned N>
void AppendLstring2String(benchmark::State& state) {
stra s1 = TEXT_16;
stra s2 = TEXT_16;
for (auto _: state) {
lstringa< N> result;
for (size_t c = 0; c < 32; c++) {
result += s1 + s2;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
benchmark::DoNotOptimize(s2);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 323< / td > < td class = "benchmarkresult" > 307< / td > < td class = "benchmarkresult" > 278< / td > < td class = "benchmarkresult" > 399< / td > < td class = "benchmarkresult" > 867< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' A p p e n d 2 s t r i n g o f 1 6 b y t e s 3 2 t i m e s , 1 0 2 4 t o t a l l e n g t h ' ] = { i d : ' b s 2 1 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::stringstream str; ... str < < str_var1 < < str_var2 ; ' , data: [ 1439 , 1393 , 4604 , 6233 , 4648 ] } ,
{name:'std::string str; ... str += str_var1 + str_var2;',data:[1398,1436,3797,4436,2346]},
{name:'lstringa< 16 > str; ... str += str_var1 + str_var2;',data:[540,560,813,1198,1150]},
{name:'lstringa< 128 > str; ... str += str_var1 + str_var2;',data:[465,446,527,673,1100]},
{name:'lstringa< 512 > str; ... str += str_var1 + str_var2;',data:[398,400,381,595,934]},
{name:'lstringa< 1024 > str; ... str += str_var1 + str_var2;',data:[323,307,278,399,867]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs22" > < h4 > < a id = "bs130432147582115154460" href = "#bs130432147582115154460" > #< / a > Append text, number, text< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::stringstream str; str < < " test = " < < k < < " times" ;< span class = "tooltiptext code" > void AppendStreamStrNumStr(benchmark::State& state) {
for (auto _: state) {
for (unsigned k = 1; k < = 1' 000' 000' 000; k *= 10) {
std::stringstream t;
t < < " test = " < < k < < " times" ;
std::string result = t.str();
#ifdef CHECK_RESULT
if (!result.starts_with(" test = " ) || !result.ends_with(" times" )) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 3053< / td > < td class = "benchmarkresult" > 3076< / td > < td class = "benchmarkresult" > 10665< / td > < td class = "benchmarkresult" > 13240< / td > < td class = "benchmarkresult" > 6486< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string str = " test = " + std::to_string(k) + " times" ;< span class = "tooltiptext code" > void AppendStdStringStrNumStr(benchmark::State& state) {
for (auto _: state) {
for (unsigned k = 1; k < = 1' 000' 000' 000; k *= 10) {
std::string result = " test = " + std::to_string(k) + " times" ;
#ifdef CHECK_RESULT
if (!result.starts_with(" test = " ) || !result.ends_with(" times" )) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 479< / td > < td class = "benchmarkresult" > 470< / td > < td class = "benchmarkresult" > 1052< / td > < td class = "benchmarkresult" > 1404< / td > < td class = "benchmarkresult" > 1576< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > char buf[100]; sprintf(buf, " test = %u times" , k); std::string str = buf;< span class = "tooltiptext code" > void AppendSprintfStrNumStr(benchmark::State& state) {
for (auto _: state) {
for (unsigned k = 1; k < = 1' 000' 000' 000; k *= 10) {
char buf[100];
std::sprintf(buf, " test = %u times" , k);
std::string result = buf;
#ifdef CHECK_RESULT
if (!result.starts_with(" test = " ) || !result.ends_with(" times" )) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1412< / td > < td class = "benchmarkresult" > 1714< / td > < td class = "benchmarkresult" > 2789< / td > < td class = "benchmarkresult" > 3209< / td > < td class = "benchmarkresult" > 2894< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string str = std::format(" test = {} times" , k);< span class = "tooltiptext code" > void AppendFormatStrNumStr(benchmark::State& state) {
for (auto _: state) {
for (unsigned k = 1; k < = 1' 000' 000' 000; k *= 10) {
std::string result = std::format(" test = {} times" , k);
#ifdef CHECK_RESULT
if (!result.starts_with(" test = " ) || !result.ends_with(" times" )) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1208< / td > < td class = "benchmarkresult" > 1289< / td > < td class = "benchmarkresult" > 1904< / td > < td class = "benchmarkresult" > 2539< / td > < td class = "benchmarkresult" > 2063< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 8> str; str.format(" test = {} times" , k);< span class = "tooltiptext code" > template< typename T>
void AppendSimStrStrNumStrF(benchmark::State& state) {
for (auto _: state) {
for (unsigned k = 1; k < = 1' 000' 000' 000; k *= 10) {
T result;
result.format(" test = {} times" , k);
#ifdef CHECK_RESULT
if (!result.starts_with(" test = " ) || !result.ends_with(" times" )) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > В с
In simstr format, the first time it doesn't fit into such a
2026-01-29 20:48:41 +00:00
string without allocation.< / span > < / span > < / td > < td class = "benchmarkresult" > 1379< / td > < td class = "benchmarkresult" > 1588< / td > < td class = "benchmarkresult" > 2168< / td > < td class = "benchmarkresult" > 3193< / td > < td class = "benchmarkresult" > 3409< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 32> str; str.format(" test = {} times" , k);< span class = "tooltiptext code" > template< typename T>
void AppendSimStrStrNumStrF(benchmark::State& state) {
for (auto _: state) {
for (unsigned k = 1; k < = 1' 000' 000' 000; k *= 10) {
T result;
result.format(" test = {} times" , k);
#ifdef CHECK_RESULT
if (!result.starts_with(" test = " ) || !result.ends_with(" times" )) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > А
2026-01-29 20:48:41 +00:00
And it fits in this one. Use buffers of the appropriate size right away.< / span > < / span > < / td > < td class = "benchmarkresult" > 1079< / td > < td class = "benchmarkresult" > 1059< / td > < td class = "benchmarkresult" > 1029< / td > < td class = "benchmarkresult" > 1659< / td > < td class = "benchmarkresult" > 2460< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 8> str = " test = " + k + " times" ;< span class = "tooltiptext code" > template< typename T>
void AppendSimStrStrNumStr(benchmark::State& state) {
for (auto _: state) {
for (unsigned k = 1; k < = 1' 000' 000' 000; k *= 10) {
T result = " test = " _ss + k + " times" ;
#ifdef CHECK_RESULT
if (!result.starts_with(" test = " ) || !result.ends_with(" times" )) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Результат не помещается в SSO, возникает аллокация.
2026-01-29 20:48:41 +00:00
The result does not fit into SSO, an allocation occurs.< / span > < / span > < / td > < td class = "benchmarkresult" > 313< / td > < td class = "benchmarkresult" > 332< / td > < td class = "benchmarkresult" > 807< / td > < td class = "benchmarkresult" > 975< / td > < td class = "benchmarkresult" > 611< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > lstringa< 32> str = " test = " + k + " times" ;< span class = "tooltiptext code" > template< typename T>
void AppendSimStrStrNumStr(benchmark::State& state) {
for (auto _: state) {
for (unsigned k = 1; k < = 1' 000' 000' 000; k *= 10) {
T result = " test = " _ss + k + " times" ;
#ifdef CHECK_RESULT
if (!result.starts_with(" test = " ) || !result.ends_with(" times" )) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > А
2026-01-21 11:59:17 +00:00
Ещё раз - используйте сразу буфера подходящего размера.
And here and below, the result fits within SSO.
2026-01-29 20:48:41 +00:00
Once again, use appropriately sized buffers from the start.< / span > < / span > < / td > < td class = "benchmarkresult" > 154< / td > < td class = "benchmarkresult" > 160< / td > < td class = "benchmarkresult" > 155< / td > < td class = "benchmarkresult" > 217< / td > < td class = "benchmarkresult" > 345< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > stringa str = " test = " + k + " times" ;< span class = "tooltiptext code" > template< typename T>
void AppendSimStrStrNumStr(benchmark::State& state) {
for (auto _: state) {
for (unsigned k = 1; k < = 1' 000' 000' 000; k *= 10) {
T result = " test = " _ss + k + " times" ;
#ifdef CHECK_RESULT
if (!result.starts_with(" test = " ) || !result.ends_with(" times" )) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Под WASM размер SSO 15 символов, что явно не хватает для размещения
2026-01-21 11:59:17 +00:00
результата, отсюда и такое время.
Under WASM, the SSO size is 15 characters, which is clearly not
2026-01-29 20:48:41 +00:00
enough to accommodate the result, hence the long time.< / span > < / span > < / td > < td class = "benchmarkresult" > 145< / td > < td class = "benchmarkresult" > 167< / td > < td class = "benchmarkresult" > 151< / td > < td class = "benchmarkresult" > 276< / td > < td class = "benchmarkresult" > 541< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' A p p e n d t e x t , n u m b e r , t e x t ' ] = { i d : ' b s 2 2 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::stringstream str; str < < "test = " < < k < < " times " ; ' , data: [ 3053 , 3076 , 10665 , 13240 , 6486 ] } ,
{name:'std::string str = "test = " + std::to_string(k) + " times";',data:[479,470,1052,1404,1576]},
{name:'char buf[100]; sprintf(buf, "test = %u times", k); std::string str = buf;',data:[1412,1714,2789,3209,2894]},
{name:'std::string str = std::format("test = {} times", k);',data:[1208,1289,1904,2539,2063]},
{name:'lstringa< 8 > str; str.format("test = {} times", k);',data:[1379,1588,2168,3193,3409]},
{name:'lstringa< 32 > str; str.format("test = {} times", k);',data:[1079,1059,1029,1659,2460]},
{name:'lstringa< 8 > str = "test = " + k + " times";',data:[313,332,807,975,611]},
{name:'lstringa< 32 > str = "test = " + k + " times";',data:[154,160,155,217,345]},
{name:'stringa str = "test = " + k + " times";',data:[145,167,151,276,541]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs23" > < h4 > < a id = "bs7106975351756760120" href = "#bs7106975351756760120" > #< / a > Split text and convert to int< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::string::find + substr + std::strtol< span class = "tooltiptext code" > void SplitConvertIntStdString(benchmark::State& state) {
std::string numbers = NUMBER_LIST;
for (auto _: state) {
int total = 0;
for (size_t start = 0; start < numbers.length(); ) {
int delim = numbers.find(" -!-" , start);
if (delim == std::string::npos) {
delim = numbers.size();
}
std::string part = numbers.substr(start, delim - start);
total += std::strtol(part.c_str(), nullptr, 0);
start = delim + 3;
}
#ifdef CHECK_RESULT
if (total != 218) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(total);
benchmark::DoNotOptimize(numbers);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 283< / td > < td class = "benchmarkresult" > 271< / td > < td class = "benchmarkresult" > 539< / td > < td class = "benchmarkresult" > 633< / td > < td class = "benchmarkresult" > 609< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > ssa::splitter + ssa::as_int< span class = "tooltiptext code" > void SplitConvertIntSimStr(benchmark::State& state) {
stra numbers = NUMBER_LIST;
for (auto _: state) {
int total = 0;
for (auto splitter = numbers.splitter(" -!-" ); !splitter.is_done();) {
total += splitter.next().as_int< int>();
}
#ifdef CHECK_RESULT
if (total != 218) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(total);
benchmark::DoNotOptimize(numbers);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 159< / td > < td class = "benchmarkresult" > 133< / td > < td class = "benchmarkresult" > 173< / td > < td class = "benchmarkresult" > 329< / td > < td class = "benchmarkresult" > 269< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > ssa::splitf + functor< span class = "tooltiptext code" > void SplitConvertIntSplitf(benchmark::State& state) {
stra numbers = NUMBER_LIST;
for (auto _: state) {
int total = 0;
numbers.splitf< void>(" -!-" , [& ](ssa& part){total += part.as_int< int>();});
#ifdef CHECK_RESULT
if (total != 218) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(total);
benchmark::DoNotOptimize(numbers);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 204< / td > < td class = "benchmarkresult" > 131< / td > < td class = "benchmarkresult" > 191< / td > < td class = "benchmarkresult" > 240< / td > < td class = "benchmarkresult" > 338< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' S p l i t t e x t a n d c o n v e r t t o i n t ' ] = { i d : ' b s 2 3 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'std::string::find + substr + std::strtol',data:[283,271,539,633,609]},
{name:'ssa::splitter + ssa::as_int',data:[159,133,173,329,269]},
{name:'ssa::splitf + functor',data:[204,131,191,240,338]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs24" > < h4 > < a id = "bs151373809886162287550" href = "#bs151373809886162287550" > #< / a > Replace symbols in text ~400 symbols< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Naive (and wrong) replace symbols with std::string find + replace< span class = "tooltiptext code" > void ReplaceSymbolsStdStringNaiveWrong(benchmark::State& state) {
std::string_view source =
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
;
std::vector< std::pair< u8s, std::string_view>> repl = {
{' & ' , " & amp;" },
{' -' , " " },
{' < ' , " & lt;" },
{' >' , " & gt;" },
{' \' ' , " & #39;" },
{' \" ' , " & quot;" }
};
auto repl_all = [](std::string& str, char s, std::string_view repl) {
size_t start_pos = 0;
while((start_pos = str.find(s, start_pos)) != std::string::npos) {
str.replace(start_pos, 1, repl);
start_pos += repl.length();
}
};
for (auto _: state) {
std::string result{source};
for (const auto& r : repl) {
repl_all(result, r.first, r.second);
}
#ifdef CHECK_RESULT
if (result
!=
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Это наивная реализация, которая неверно отработает на
таких заменах, как 'a'->'b' и 'b'->'a'. Н о
2026-01-21 11:59:17 +00:00
то работает быстро.
This is a naive implementation that will fail to handle substitutions
such as 'a'->'b' and 'b'->'a'. But if the substitutions don't conflict,
2026-01-29 20:48:41 +00:00
it works quickly.< / span > < / span > < / td > < td class = "benchmarkresult" > 848< / td > < td class = "benchmarkresult" > 845< / td > < td class = "benchmarkresult" > 1185< / td > < td class = "benchmarkresult" > 1428< / td > < td class = "benchmarkresult" > 3726< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace symbols with std::string find_first_of + replace< span class = "tooltiptext code" > void ReplaceSymbolsStdStringNaiveRight(benchmark::State& state) {
std::string_view source =
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
;
std::vector< std::pair< u8s, std::string_view>> repl = {
{' -' , " " },
{' < ' , " & lt;" },
{' >' , " & gt;" },
{' \' ' , " & #39;" },
{' \" ' , " & quot;" },
{' & ' , " & amp;" },
};
for (auto _: state) {
std::string result{source};
std::string pattern;
for (const auto& r : repl) {
pattern += r.first;
}
size_t start_pos = 0;
while((start_pos = result.find_first_of(pattern, start_pos)) != std::string::npos) {
size_t idx = pattern.find(result[start_pos]);
result.replace(start_pos, 1, repl[idx].second);
start_pos += repl[idx].second.length();
}
#ifdef CHECK_RESULT
if (result
!=
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Дальше уже правильные реализации, не зависящие от конфликтующих замен.
Further, there are correct implementations that do not depend on
2026-01-29 20:48:41 +00:00
conflicting replacements.< / span > < / span > < / td > < td class = "benchmarkresult" > 2432< / td > < td class = "benchmarkresult" > 2401< / td > < td class = "benchmarkresult" > 2165< / td > < td class = "benchmarkresult" > 2443< / td > < td class = "benchmarkresult" > 5016< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace symbols with std::string_view find_first_of + copy< span class = "tooltiptext code" > void ReplaceSymbolsStdString(benchmark::State& state) {
std::string_view source =
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
const std::string_view repl_from = " -< >' \" & " ;
const std::string_view repl_to[] = {" " , " & lt;" , " & gt;" , " & #39;" , " & quot;" , " & amp;" };
for (auto _: state) {
std::string result;
for (size_t start = 0; start < source.size();) {
size_t idx = source.find_first_of(repl_from, start);
if (idx == std::string::npos) {
result += source.substr(start);
break;
}
if (idx > start) {
result += source.substr(start, idx - start);
}
size_t what = repl_from.find(source[idx]);
result += repl_to[what];
start = idx + 1;
}
#ifdef CHECK_RESULT
if (result
!=
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1070< / td > < td class = "benchmarkresult" > 1157< / td > < td class = "benchmarkresult" > 2298< / td > < td class = "benchmarkresult" > 2948< / td > < td class = "benchmarkresult" > 3479< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace runtime symbols with string expressions and without remembering all search results< span class = "tooltiptext code" > template< bool UseVector>
void ReplaceSymbolsDynPatternSimStr(benchmark::State& state) {
stra source =
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
;
std::vector< std::pair< u8s, ssa>> repl = {
{' -' , " " },
{' < ' , " & lt;" },
{' >' , " & gt;" },
{' \' ' , " & #39;" },
{' \" ' , " & quot;" },
{' & ' , " & amp;" },
};
for (auto _: state) {
stringa result = expr_replace_symbols< u8s, UseVector>{source, repl};
#ifdef CHECK_RESULT
if (result
!=
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1309< / td > < td class = "benchmarkresult" > 1495< / td > < td class = "benchmarkresult" > 1439< / td > < td class = "benchmarkresult" > 1804< / td > < td class = "benchmarkresult" > 3472< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace runtime symbols with simstr and memorization of all search results< span class = "tooltiptext code" > template< bool UseVector>
void ReplaceSymbolsDynPatternSimStr(benchmark::State& state) {
stra source =
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
;
std::vector< std::pair< u8s, ssa>> repl = {
{' -' , " " },
{' < ' , " & lt;" },
{' >' , " & gt;" },
{' \' ' , " & #39;" },
{' \" ' , " & quot;" },
{' & ' , " & amp;" },
};
for (auto _: state) {
stringa result = expr_replace_symbols< u8s, UseVector>{source, repl};
#ifdef CHECK_RESULT
if (result
!=
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1066< / td > < td class = "benchmarkresult" > 1055< / td > < td class = "benchmarkresult" > 1270< / td > < td class = "benchmarkresult" > 1612< / td > < td class = "benchmarkresult" > 3043< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace const symbols with string expressions and without remembering all search results< span class = "tooltiptext code" > template< bool UseVector>
void ReplaceSymbolsCons2PatternSimStr(benchmark::State& state) {
stra source =
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
;
for (auto _: state) {
stringa result = e_repl_const_symbols< UseVector>(source,
' -' , " " ,
' < ' , " & lt;" ,
' >' , " & gt;" ,
' \' ' , " & #39;" ,
' \" ' , " & quot;" ,
' & ' , " & amp;"
);
#ifdef CHECK_RESULT
if (result
!=
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1030< / td > < td class = "benchmarkresult" > 1238< / td > < td class = "benchmarkresult" > 1135< / td > < td class = "benchmarkresult" > 1441< / td > < td class = "benchmarkresult" > 2845< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace const symbols with string expressions and memorization of all search results< span class = "tooltiptext code" > template< bool UseVector>
void ReplaceSymbolsCons2PatternSimStr(benchmark::State& state) {
stra source =
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
" ksjd-fksjd \" dkjfs-jkhdf dfj ' kdkd \" dkfdkfkdjf"
;
for (auto _: state) {
stringa result = e_repl_const_symbols< UseVector>(source,
' -' , " " ,
' < ' , " & lt;" ,
' >' , " & gt;" ,
' \' ' , " & #39;" ,
' \" ' , " & quot;" ,
' & ' , " & amp;"
);
#ifdef CHECK_RESULT
if (result
!=
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
" ksjdfksjd & quot;dkjfsjkhdf dfj & #39; kdkd & quot;dkfdkfkdjf"
) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 898< / td > < td class = "benchmarkresult" > 872< / td > < td class = "benchmarkresult" > 1210< / td > < td class = "benchmarkresult" > 1438< / td > < td class = "benchmarkresult" > 2739< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' R e p l a c e s y m b o l s i n t e x t ~ 4 0 0 s y m b o l s ' ] = { i d : ' b s 2 4 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'Naive (and wrong) replace symbols with std::string find + replace',data:[848,845,1185,1428,3726]},
{name:'replace symbols with std::string find_first_of + replace',data:[2432,2401,2165,2443,5016]},
{name:'replace symbols with std::string_view find_first_of + copy',data:[1070,1157,2298,2948,3479]},
{name:'replace runtime symbols with string expressions and without remembering all search results',data:[1309,1495,1439,1804,3472]},
{name:'replace runtime symbols with simstr and memorization of all search results',data:[1066,1055,1270,1612,3043]},
{name:'replace const symbols with string expressions and without remembering all search results',data:[1030,1238,1135,1441,2845]},
{name:'replace const symbols with string expressions and memorization of all search results',data:[898,872,1210,1438,2739]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs25" > < h4 > < a id = "bs96756339547767401190" href = "#bs96756339547767401190" > #< / a > Replace symbols in text ~40 symbols< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Short Naive (and wrong) replace symbols with std::string find + replace< span class = "tooltiptext code" > void ShortReplaceSymbolsStdStringNaiveWrong(benchmark::State& state) {
std::string_view source =
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
;
std::vector< std::pair< u8s, std::string_view>> repl = {
{' & ' , " & amp;" },
{' -' , " " },
{' < ' , " & lt;" },
{' >' , " & gt;" },
{' \' ' , " & #39;" },
{' \" ' , " & quot;" }
};
auto repl_all = [](std::string& str, char s, std::string_view repl) {
size_t start_pos = 0;
while((start_pos = str.find(s, start_pos)) != std::string::npos) {
str.replace(start_pos, 1, repl);
start_pos += repl.length();
}
};
for (auto _: state) {
std::string result{source};
for (const auto& r : repl) {
repl_all(result, r.first, r.second);
}
#ifdef CHECK_RESULT
if (result
!=
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 155< / td > < td class = "benchmarkresult" > 175< / td > < td class = "benchmarkresult" > 321< / td > < td class = "benchmarkresult" > 384< / td > < td class = "benchmarkresult" > 470< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Short replace symbols with std::string find_first_of + replace< span class = "tooltiptext code" > void ShortReplaceSymbolsStdStringNaiveRight(benchmark::State& state) {
std::string_view source =
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
;
std::vector< std::pair< u8s, std::string_view>> repl = {
{' -' , " " },
{' < ' , " & lt;" },
{' >' , " & gt;" },
{' \' ' , " & #39;" },
{' \" ' , " & quot;" },
{' & ' , " & amp;" },
};
for (auto _: state) {
std::string result{source};
std::string pattern;
for (const auto& r : repl) {
pattern += r.first;
}
size_t start_pos = 0;
while((start_pos = result.find_first_of(pattern, start_pos)) != std::string::npos) {
size_t idx = pattern.find(result[start_pos]);
result.replace(start_pos, 1, repl[idx].second);
start_pos += repl[idx].second.length();
}
#ifdef CHECK_RESULT
if (result
!=
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 337< / td > < td class = "benchmarkresult" > 319< / td > < td class = "benchmarkresult" > 385< / td > < td class = "benchmarkresult" > 475< / td > < td class = "benchmarkresult" > 494< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Short replace symbols with std::string_view find_first_of + copy< span class = "tooltiptext code" > void ShortReplaceSymbolsStdString(benchmark::State& state) {
std::string_view source =
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
const std::string_view repl_from = " -< >' \" & " ;
const std::string_view repl_to[] = {" " , " & lt;" , " & gt;" , " & #39;" , " & quot;" , " & amp;" };
for (auto _: state) {
std::string result;
for (size_t start = 0; start < source.size();) {
size_t idx = source.find_first_of(repl_from, start);
if (idx == std::string::npos) {
result += source.substr(start);
break;
}
if (idx > start) {
result += source.substr(start, idx - start);
}
size_t what = repl_from.find_first_of(source[idx]);
result += repl_to[what];
start = idx + 1;
}
#ifdef CHECK_RESULT
if (result
!=
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 164< / td > < td class = "benchmarkresult" > 183< / td > < td class = "benchmarkresult" > 330< / td > < td class = "benchmarkresult" > 388< / td > < td class = "benchmarkresult" > 413< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Short replace runtime symbols with string expressions and without remembering all search results< span class = "tooltiptext code" > template< bool UseVector>
void ShortReplaceSymbolsDynPatternSimStr(benchmark::State& state) {
stra source =
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
;
std::vector< std::pair< u8s, ssa>> repl = {
{' -' , " " },
{' < ' , " & lt;" },
{' >' , " & gt;" },
{' \' ' , " & #39;" },
{' \" ' , " & quot;" },
{' & ' , " & amp;" },
};
for (auto _: state) {
stringa result = expr_replace_symbols< u8s, UseVector>{source, repl};
#ifdef CHECK_RESULT
if (result
!=
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 193< / td > < td class = "benchmarkresult" > 225< / td > < td class = "benchmarkresult" > 269< / td > < td class = "benchmarkresult" > 302< / td > < td class = "benchmarkresult" > 380< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Short replace runtime symbols with simstr and memorization of all search results< span class = "tooltiptext code" > template< bool UseVector>
void ShortReplaceSymbolsDynPatternSimStr(benchmark::State& state) {
stra source =
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
;
std::vector< std::pair< u8s, ssa>> repl = {
{' -' , " " },
{' < ' , " & lt;" },
{' >' , " & gt;" },
{' \' ' , " & #39;" },
{' \" ' , " & quot;" },
{' & ' , " & amp;" },
};
for (auto _: state) {
stringa result = expr_replace_symbols< u8s, UseVector>{source, repl};
#ifdef CHECK_RESULT
if (result
!=
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 205< / td > < td class = "benchmarkresult" > 206< / td > < td class = "benchmarkresult" > 348< / td > < td class = "benchmarkresult" > 434< / td > < td class = "benchmarkresult" > 401< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Short replace const symbols with string expressions and without remembering all search results< span class = "tooltiptext code" > template< bool UseVector>
void ShortReplaceSymbolsCons2PatternSimStr(benchmark::State& state) {
stra source =
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
;
for (auto _: state) {
stringa result = e_repl_const_symbols< UseVector>(source,
' -' , " " ,
' < ' , " & lt;" ,
' >' , " & gt;" ,
' \' ' , " & #39;" ,
' \" ' , " & quot;" ,
' & ' , " & amp;"
);
#ifdef CHECK_RESULT
if (result
!=
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 139< / td > < td class = "benchmarkresult" > 162< / td > < td class = "benchmarkresult" > 232< / td > < td class = "benchmarkresult" > 260< / td > < td class = "benchmarkresult" > 257< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Short replace const symbols with string expressions and memorization of all search results< span class = "tooltiptext code" > template< bool UseVector>
void ShortReplaceSymbolsCons2PatternSimStr(benchmark::State& state) {
stra source =
" abcdefg124 < jhsfjsh sjdfsh jfhjd & & jdjdj >"
;
for (auto _: state) {
stringa result = e_repl_const_symbols< UseVector>(source,
' -' , " " ,
' < ' , " & lt;" ,
' >' , " & gt;" ,
' \' ' , " & #39;" ,
' \" ' , " & quot;" ,
' & ' , " & amp;"
);
#ifdef CHECK_RESULT
if (result
!=
" abcdefg124 & lt; jhsfjsh sjdfsh jfhjd & amp;& amp; jdjdj & gt;"
) {
state.SkipWithError(" not equal" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 144< / td > < td class = "benchmarkresult" > 156< / td > < td class = "benchmarkresult" > 323< / td > < td class = "benchmarkresult" > 345< / td > < td class = "benchmarkresult" > 302< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' R e p l a c e s y m b o l s i n t e x t ~ 4 0 s y m b o l s ' ] = { i d : ' b s 2 5 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'Short Naive (and wrong) replace symbols with std::string find + replace',data:[155,175,321,384,470]},
{name:'Short replace symbols with std::string find_first_of + replace',data:[337,319,385,475,494]},
{name:'Short replace symbols with std::string_view find_first_of + copy',data:[164,183,330,388,413]},
{name:'Short replace runtime symbols with string expressions and without remembering all search results',data:[193,225,269,302,380]},
{name:'Short replace runtime symbols with simstr and memorization of all search results',data:[205,206,348,434,401]},
{name:'Short replace const symbols with string expressions and without remembering all search results',data:[139,162,232,260,257]},
{name:'Short replace const symbols with string expressions and memorization of all search results',data:[144,156,323,345,302]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs26" > < h4 > < a id = "bs77745698784557935900" href = "#bs77745698784557935900" > #< / a > Replace All Str To Longer Size< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- in std::string|64< span class = "tooltiptext code" > template< size_t Long>
void ReplaceAllLongerStdString(benchmark::State& state) {
std::string_view source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
std::string_view sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
std::string_view pattern = " bb" ;
std::string_view repl = " ----" ;
std::string big_source, big_sample;
for (int i = 0; i < Long; i++) {
big_source += source;
big_sample += sample;
}
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
for (auto _: state) {
std::string result{big_source};
size_t start_pos = 0;
while((start_pos = result.find(pattern, start_pos)) != std::string::npos) {
result.replace(start_pos, pattern.length(), repl);
start_pos += repl.length();
}
#ifdef CHECK_RESULT
if (result != big_sample) {
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 160< / td > < td class = "benchmarkresult" > 164< / td > < td class = "benchmarkresult" > 232< / td > < td class = "benchmarkresult" > 249< / td > < td class = "benchmarkresult" > 371< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- in std::string|256< span class = "tooltiptext code" > template< size_t Long>
void ReplaceAllLongerStdString(benchmark::State& state) {
std::string_view source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
std::string_view sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
std::string_view pattern = " bb" ;
std::string_view repl = " ----" ;
std::string big_source, big_sample;
for (int i = 0; i < Long; i++) {
big_source += source;
big_sample += sample;
}
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
for (auto _: state) {
std::string result{big_source};
size_t start_pos = 0;
while((start_pos = result.find(pattern, start_pos)) != std::string::npos) {
result.replace(start_pos, pattern.length(), repl);
start_pos += repl.length();
}
#ifdef CHECK_RESULT
if (result != big_sample) {
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 568< / td > < td class = "benchmarkresult" > 492< / td > < td class = "benchmarkresult" > 757< / td > < td class = "benchmarkresult" > 810< / td > < td class = "benchmarkresult" > 1351< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- in std::string|512< span class = "tooltiptext code" > template< size_t Long>
void ReplaceAllLongerStdString(benchmark::State& state) {
std::string_view source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
std::string_view sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
std::string_view pattern = " bb" ;
std::string_view repl = " ----" ;
std::string big_source, big_sample;
for (int i = 0; i < Long; i++) {
big_source += source;
big_sample += sample;
}
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
for (auto _: state) {
std::string result{big_source};
size_t start_pos = 0;
while((start_pos = result.find(pattern, start_pos)) != std::string::npos) {
result.replace(start_pos, pattern.length(), repl);
start_pos += repl.length();
}
#ifdef CHECK_RESULT
if (result != big_sample) {
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1177< / td > < td class = "benchmarkresult" > 1119< / td > < td class = "benchmarkresult" > 1482< / td > < td class = "benchmarkresult" > 1556< / td > < td class = "benchmarkresult" > 2646< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- in std::string|1024< span class = "tooltiptext code" > template< size_t Long>
void ReplaceAllLongerStdString(benchmark::State& state) {
std::string_view source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
std::string_view sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
std::string_view pattern = " bb" ;
std::string_view repl = " ----" ;
std::string big_source, big_sample;
for (int i = 0; i < Long; i++) {
big_source += source;
big_sample += sample;
}
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
for (auto _: state) {
std::string result{big_source};
size_t start_pos = 0;
while((start_pos = result.find(pattern, start_pos)) != std::string::npos) {
result.replace(start_pos, pattern.length(), repl);
start_pos += repl.length();
}
#ifdef CHECK_RESULT
if (result != big_sample) {
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 2294< / td > < td class = "benchmarkresult" > 2211< / td > < td class = "benchmarkresult" > 3150< / td > < td class = "benchmarkresult" > 3229< / td > < td class = "benchmarkresult" > 5606< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- in std::string|2048< span class = "tooltiptext code" > template< size_t Long>
void ReplaceAllLongerStdString(benchmark::State& state) {
std::string_view source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
std::string_view sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
std::string_view pattern = " bb" ;
std::string_view repl = " ----" ;
std::string big_source, big_sample;
for (int i = 0; i < Long; i++) {
big_source += source;
big_sample += sample;
}
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
for (auto _: state) {
std::string result{big_source};
size_t start_pos = 0;
while((start_pos = result.find(pattern, start_pos)) != std::string::npos) {
result.replace(start_pos, pattern.length(), repl);
start_pos += repl.length();
}
#ifdef CHECK_RESULT
if (result != big_sample) {
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 5903< / td > < td class = "benchmarkresult" > 5959< / td > < td class = "benchmarkresult" > 8049< / td > < td class = "benchmarkresult" > 8174< / td > < td class = "benchmarkresult" > 12254< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- in lstringa< 8>|64< span class = "tooltiptext code" > template< size_t N, size_t Count>
void ReplaceAllLongerSimString(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
lstringa< N> result = big_source;
result.replace(" bb" , " ----" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 245< / td > < td class = "benchmarkresult" > 148< / td > < td class = "benchmarkresult" > 304< / td > < td class = "benchmarkresult" > 312< / td > < td class = "benchmarkresult" > 332< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- in lstringa< 8>|256< span class = "tooltiptext code" > template< size_t N, size_t Count>
void ReplaceAllLongerSimString(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
lstringa< N> result = big_source;
result.replace(" bb" , " ----" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 777< / td > < td class = "benchmarkresult" > 485< / td > < td class = "benchmarkresult" > 606< / td > < td class = "benchmarkresult" > 660< / td > < td class = "benchmarkresult" > 1116< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- in lstringa< 8>|512< span class = "tooltiptext code" > template< size_t N, size_t Count>
void ReplaceAllLongerSimString(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
lstringa< N> result = big_source;
result.replace(" bb" , " ----" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1500< / td > < td class = "benchmarkresult" > 893< / td > < td class = "benchmarkresult" > 1054< / td > < td class = "benchmarkresult" > 1138< / td > < td class = "benchmarkresult" > 2117< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- in lstringa< 8>|1024< span class = "tooltiptext code" > template< size_t N, size_t Count>
void ReplaceAllLongerSimString(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
lstringa< N> result = big_source;
result.replace(" bb" , " ----" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 2907< / td > < td class = "benchmarkresult" > 1845< / td > < td class = "benchmarkresult" > 1839< / td > < td class = "benchmarkresult" > 2056< / td > < td class = "benchmarkresult" > 4092< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- in lstringa< 8>|2048< span class = "tooltiptext code" > template< size_t N, size_t Count>
void ReplaceAllLongerSimString(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
lstringa< N> result = big_source;
result.replace(" bb" , " ----" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 5929< / td > < td class = "benchmarkresult" > 3614< / td > < td class = "benchmarkresult" > 3503< / td > < td class = "benchmarkresult" > 3917< / td > < td class = "benchmarkresult" > 7783< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- by init stringa|64< span class = "tooltiptext code" > template< size_t Count>
void ReplaceAllLongerSimStringExpr(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), " bb" , " ----" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 129< / td > < td class = "benchmarkresult" > 110< / td > < td class = "benchmarkresult" > 183< / td > < td class = "benchmarkresult" > 206< / td > < td class = "benchmarkresult" > 212< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- by init stringa|256< span class = "tooltiptext code" > template< size_t Count>
void ReplaceAllLongerSimStringExpr(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), " bb" , " ----" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 356< / td > < td class = "benchmarkresult" > 305< / td > < td class = "benchmarkresult" > 374< / td > < td class = "benchmarkresult" > 475< / td > < td class = "benchmarkresult" > 725< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- by init stringa|512< span class = "tooltiptext code" > template< size_t Count>
void ReplaceAllLongerSimStringExpr(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), " bb" , " ----" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 774< / td > < td class = "benchmarkresult" > 751< / td > < td class = "benchmarkresult" > 824< / td > < td class = "benchmarkresult" > 1056< / td > < td class = "benchmarkresult" > 1687< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- by init stringa|1024< span class = "tooltiptext code" > template< size_t Count>
void ReplaceAllLongerSimStringExpr(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), " bb" , " ----" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1583< / td > < td class = "benchmarkresult" > 1630< / td > < td class = "benchmarkresult" > 1681< / td > < td class = "benchmarkresult" > 2152< / td > < td class = "benchmarkresult" > 3720< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to ---- by init stringa|2048< span class = "tooltiptext code" > template< size_t Count>
void ReplaceAllLongerSimStringExpr(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), " bb" , " ----" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 3395< / td > < td class = "benchmarkresult" > 3440< / td > < td class = "benchmarkresult" > 3111< / td > < td class = "benchmarkresult" > 4321< / td > < td class = "benchmarkresult" > 7469< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' R e p l a c e A l l S t r T o L o n g e r S i z e ' ] = { i d : ' b s 2 6 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'replace bb to ---- in std::string|64',data:[160,164,232,249,371]},
{name:'replace bb to ---- in std::string|256',data:[568,492,757,810,1351]},
{name:'replace bb to ---- in std::string|512',data:[1177,1119,1482,1556,2646]},
{name:'replace bb to ---- in std::string|1024',data:[2294,2211,3150,3229,5606]},
{name:'replace bb to ---- in std::string|2048',data:[5903,5959,8049,8174,12254]},
{name:'replace bb to ---- in lstringa< 8 > |64',data:[245,148,304,312,332]},
{name:'replace bb to ---- in lstringa< 8 > |256',data:[777,485,606,660,1116]},
{name:'replace bb to ---- in lstringa< 8 > |512',data:[1500,893,1054,1138,2117]},
{name:'replace bb to ---- in lstringa< 8 > |1024',data:[2907,1845,1839,2056,4092]},
{name:'replace bb to ---- in lstringa< 8 > |2048',data:[5929,3614,3503,3917,7783]},
{name:'replace bb to ---- by init stringa|64',data:[129,110,183,206,212]},
{name:'replace bb to ---- by init stringa|256',data:[356,305,374,475,725]},
{name:'replace bb to ---- by init stringa|512',data:[774,751,824,1056,1687]},
{name:'replace bb to ---- by init stringa|1024',data:[1583,1630,1681,2152,3720]},
{name:'replace bb to ---- by init stringa|2048',data:[3395,3440,3111,4321,7469]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs27" > < h4 > < a id = "bs74494088982050398630" href = "#bs74494088982050398630" > #< / a > Replace All Str To Same Size< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- in std::string|64< span class = "tooltiptext code" > template< size_t Long>
void ReplaceAllEqualStdString(benchmark::State& state) {
std::string_view source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
std::string_view sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
std::string_view pattern = " bb" ;
std::string_view repl = " --" ;
std::string big_source, big_sample;
for (int i = 0; i < Long; i++) {
big_source += source;
big_sample += sample;
}
for (auto _: state) {
std::string result{big_source};
size_t start_pos = 0;
while((start_pos = result.find(pattern, start_pos)) != std::string::npos) {
result.replace(start_pos, pattern.length(), repl);
start_pos += repl.length();
}
#ifdef CHECK_RESULT
if (result != big_sample) {
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 119< / td > < td class = "benchmarkresult" > 118< / td > < td class = "benchmarkresult" > 196< / td > < td class = "benchmarkresult" > 215< / td > < td class = "benchmarkresult" > 259< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- in std::string|256< span class = "tooltiptext code" > template< size_t Long>
void ReplaceAllEqualStdString(benchmark::State& state) {
std::string_view source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
std::string_view sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
std::string_view pattern = " bb" ;
std::string_view repl = " --" ;
std::string big_source, big_sample;
for (int i = 0; i < Long; i++) {
big_source += source;
big_sample += sample;
}
for (auto _: state) {
std::string result{big_source};
size_t start_pos = 0;
while((start_pos = result.find(pattern, start_pos)) != std::string::npos) {
result.replace(start_pos, pattern.length(), repl);
start_pos += repl.length();
}
#ifdef CHECK_RESULT
if (result != big_sample) {
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 451< / td > < td class = "benchmarkresult" > 418< / td > < td class = "benchmarkresult" > 487< / td > < td class = "benchmarkresult" > 552< / td > < td class = "benchmarkresult" > 941< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- in std::string|512< span class = "tooltiptext code" > template< size_t Long>
void ReplaceAllEqualStdString(benchmark::State& state) {
std::string_view source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
std::string_view sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
std::string_view pattern = " bb" ;
std::string_view repl = " --" ;
std::string big_source, big_sample;
for (int i = 0; i < Long; i++) {
big_source += source;
big_sample += sample;
}
for (auto _: state) {
std::string result{big_source};
size_t start_pos = 0;
while((start_pos = result.find(pattern, start_pos)) != std::string::npos) {
result.replace(start_pos, pattern.length(), repl);
start_pos += repl.length();
}
#ifdef CHECK_RESULT
if (result != big_sample) {
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 782< / td > < td class = "benchmarkresult" > 773< / td > < td class = "benchmarkresult" > 899< / td > < td class = "benchmarkresult" > 969< / td > < td class = "benchmarkresult" > 1842< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- in std::string|1024< span class = "tooltiptext code" > template< size_t Long>
void ReplaceAllEqualStdString(benchmark::State& state) {
std::string_view source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
std::string_view sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
std::string_view pattern = " bb" ;
std::string_view repl = " --" ;
std::string big_source, big_sample;
for (int i = 0; i < Long; i++) {
big_source += source;
big_sample += sample;
}
for (auto _: state) {
std::string result{big_source};
size_t start_pos = 0;
while((start_pos = result.find(pattern, start_pos)) != std::string::npos) {
result.replace(start_pos, pattern.length(), repl);
start_pos += repl.length();
}
#ifdef CHECK_RESULT
if (result != big_sample) {
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1492< / td > < td class = "benchmarkresult" > 1538< / td > < td class = "benchmarkresult" > 1687< / td > < td class = "benchmarkresult" > 1820< / td > < td class = "benchmarkresult" > 3695< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- in std::string|2048< span class = "tooltiptext code" > template< size_t Long>
void ReplaceAllEqualStdString(benchmark::State& state) {
std::string_view source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
std::string_view sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
std::string_view pattern = " bb" ;
std::string_view repl = " --" ;
std::string big_source, big_sample;
for (int i = 0; i < Long; i++) {
big_source += source;
big_sample += sample;
}
for (auto _: state) {
std::string result{big_source};
size_t start_pos = 0;
while((start_pos = result.find(pattern, start_pos)) != std::string::npos) {
result.replace(start_pos, pattern.length(), repl);
start_pos += repl.length();
}
#ifdef CHECK_RESULT
if (result != big_sample) {
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 3010< / td > < td class = "benchmarkresult" > 2919< / td > < td class = "benchmarkresult" > 3148< / td > < td class = "benchmarkresult" > 3593< / td > < td class = "benchmarkresult" > 6890< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- in lstringa< 8>|64< span class = "tooltiptext code" > template< size_t N, size_t Long>
void ReplaceAllEqualSimString(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
lstringa< 2048> big_source{Long, source}, big_sample{Long, sample};
for (auto _: state) {
lstringa< N> result = big_source;
result.replace(" bb" , " --" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 209< / td > < td class = "benchmarkresult" > 100< / td > < td class = "benchmarkresult" > 179< / td > < td class = "benchmarkresult" > 193< / td > < td class = "benchmarkresult" > 219< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- in lstringa< 8>|256< span class = "tooltiptext code" > template< size_t N, size_t Long>
void ReplaceAllEqualSimString(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
lstringa< 2048> big_source{Long, source}, big_sample{Long, sample};
for (auto _: state) {
lstringa< N> result = big_source;
result.replace(" bb" , " --" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 855< / td > < td class = "benchmarkresult" > 298< / td > < td class = "benchmarkresult" > 440< / td > < td class = "benchmarkresult" > 465< / td > < td class = "benchmarkresult" > 797< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- in lstringa< 8>|512< span class = "tooltiptext code" > template< size_t N, size_t Long>
void ReplaceAllEqualSimString(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
lstringa< 2048> big_source{Long, source}, big_sample{Long, sample};
for (auto _: state) {
lstringa< N> result = big_source;
result.replace(" bb" , " --" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1828< / td > < td class = "benchmarkresult" > 551< / td > < td class = "benchmarkresult" > 797< / td > < td class = "benchmarkresult" > 788< / td > < td class = "benchmarkresult" > 1465< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- in lstringa< 8>|1024< span class = "tooltiptext code" > template< size_t N, size_t Long>
void ReplaceAllEqualSimString(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
lstringa< 2048> big_source{Long, source}, big_sample{Long, sample};
for (auto _: state) {
lstringa< N> result = big_source;
result.replace(" bb" , " --" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 3661< / td > < td class = "benchmarkresult" > 1105< / td > < td class = "benchmarkresult" > 1542< / td > < td class = "benchmarkresult" > 1447< / td > < td class = "benchmarkresult" > 2845< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- in lstringa< 8>|2048< span class = "tooltiptext code" > template< size_t N, size_t Long>
void ReplaceAllEqualSimString(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
lstringa< 2048> big_source{Long, source}, big_sample{Long, sample};
for (auto _: state) {
lstringa< N> result = big_source;
result.replace(" bb" , " --" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 7670< / td > < td class = "benchmarkresult" > 2117< / td > < td class = "benchmarkresult" > 2927< / td > < td class = "benchmarkresult" > 2857< / td > < td class = "benchmarkresult" > 5530< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- by init stringa|64< span class = "tooltiptext code" > template< size_t Count>
void ReplaceAllEqualSimStringExpr(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
ssa pattern = " bb" ;
ssa repl = " --" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), " bb" , " --" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 83.8< / td > < td class = "benchmarkresult" > 95.6< / td > < td class = "benchmarkresult" > 156< / td > < td class = "benchmarkresult" > 185< / td > < td class = "benchmarkresult" > 178< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- by init stringa|256< span class = "tooltiptext code" > template< size_t Count>
void ReplaceAllEqualSimStringExpr(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
ssa pattern = " bb" ;
ssa repl = " --" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), " bb" , " --" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 236< / td > < td class = "benchmarkresult" > 270< / td > < td class = "benchmarkresult" > 349< / td > < td class = "benchmarkresult" > 387< / td > < td class = "benchmarkresult" > 634< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- by init stringa|512< span class = "tooltiptext code" > template< size_t Count>
void ReplaceAllEqualSimStringExpr(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
ssa pattern = " bb" ;
ssa repl = " --" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), " bb" , " --" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 485< / td > < td class = "benchmarkresult" > 553< / td > < td class = "benchmarkresult" > 583< / td > < td class = "benchmarkresult" > 651< / td > < td class = "benchmarkresult" > 1214< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- by init stringa|1024< span class = "tooltiptext code" > template< size_t Count>
void ReplaceAllEqualSimStringExpr(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
ssa pattern = " bb" ;
ssa repl = " --" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), " bb" , " --" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 883< / td > < td class = "benchmarkresult" > 1031< / td > < td class = "benchmarkresult" > 1099< / td > < td class = "benchmarkresult" > 1196< / td > < td class = "benchmarkresult" > 2270< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > replace bb to -- by init stringa|2048< span class = "tooltiptext code" > template< size_t Count>
void ReplaceAllEqualSimStringExpr(benchmark::State& state) {
ssa source = " aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba" ;
ssa sample = " aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a" ;
ssa pattern = " bb" ;
ssa repl = " --" ;
2025-11-26 19:15:50 +00:00
2025-04-05 14:21:11 +00:00
lstringa< 2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), " bb" , " --" );
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout < < result.length() < < " : " < < result < < " \n\n" < < big_sample.length() < < " : " < < big_sample < < " \n\n" ;
state.SkipWithError(" error in replace" );
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
2026-01-29 20:48:41 +00:00
}< / span > < / span > < / td > < td > < / td > < td class = "benchmarkresult" > 1717< / td > < td class = "benchmarkresult" > 1966< / td > < td class = "benchmarkresult" > 2073< / td > < td class = "benchmarkresult" > 2408< / td > < td class = "benchmarkresult" > 4529< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' R e p l a c e A l l S t r T o S a m e S i z e ' ] = { i d : ' b s 2 7 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'replace bb to -- in std::string|64',data:[119,118,196,215,259]},
{name:'replace bb to -- in std::string|256',data:[451,418,487,552,941]},
{name:'replace bb to -- in std::string|512',data:[782,773,899,969,1842]},
{name:'replace bb to -- in std::string|1024',data:[1492,1538,1687,1820,3695]},
{name:'replace bb to -- in std::string|2048',data:[3010,2919,3148,3593,6890]},
{name:'replace bb to -- in lstringa< 8 > |64',data:[209,100,179,193,219]},
{name:'replace bb to -- in lstringa< 8 > |256',data:[855,298,440,465,797]},
{name:'replace bb to -- in lstringa< 8 > |512',data:[1828,551,797,788,1465]},
{name:'replace bb to -- in lstringa< 8 > |1024',data:[3661,1105,1542,1447,2845]},
{name:'replace bb to -- in lstringa< 8 > |2048',data:[7670,2117,2927,2857,5530]},
{name:'replace bb to -- by init stringa|64',data:[83.8,95.6,156,185,178]},
{name:'replace bb to -- by init stringa|256',data:[236,270,349,387,634]},
{name:'replace bb to -- by init stringa|512',data:[485,553,583,651,1214]},
{name:'replace bb to -- by init stringa|1024',data:[883,1031,1099,1196,2270]},
{name:'replace bb to -- by init stringa|2048',data:[1717,1966,2073,2408,4529]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs28" > < h4 > < a id = "bs8410196985047277720" href = "#bs8410196985047277720" > #< / a > Hash Map insert and find< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > hashStrMapA< size_t> emplace & find stringa;< span class = "tooltiptext code" > void HashMapSimStr(benchmark::State& state) {
for (auto _: state) {
hashStrMapA< size_t> store;
for (size_t idx = 0; idx < bs_sim.size(); idx++) {
store.try_emplace(bs_sim[idx], idx);
}
#ifdef CHECK_RESULT
if (store.size() != bs_sim.size()) {
state.SkipWithError(" bad inserts" );
}
#endif
for (size_t idx = 0; idx < bs_sim.size(); idx++) {
auto find = store.find(bs_sim[idx]);
size_t res = find->second;
#ifdef CHECK_RESULT
if (res != idx) {
state.SkipWithError(" bad find" );
}
#endif
benchmark::DoNotOptimize(res);
}
}
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Вставляем в hashStrMapA 10000 stringa длиной от 30 до 50
2026-01-21 11:59:17 +00:00
символов, а
We insert 10,000 strings of length from 30 to 50 characters into
2026-01-29 20:48:41 +00:00
hashStrMapA, and then search for them in it.< / span > < / span > < / td > < td class = "benchmarkresult" > 3595592< / td > < td class = "benchmarkresult" > 3722226< / td > < td class = "benchmarkresult" > 3795773< / td > < td class = "benchmarkresult" > 4239554< / td > < td class = "benchmarkresult" > 3204846< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::unordered_map< std::string, size_t> emplace & find std::string;< span class = "tooltiptext code" > void HashMapStdStr(benchmark::State& state) {
for (auto _: state) {
std::unordered_map< std::string, size_t> store;
for (size_t idx = 0; idx < bs_std.size(); idx++) {
store.try_emplace(bs_std[idx], idx);
}
#ifdef CHECK_RESULT
if (store.size() != bs_std.size()) {
state.SkipWithError(" bad inserts" );
}
#endif
for (size_t idx = 0; idx < bs_std.size(); idx++) {
auto find = store.find(bs_std[idx]);
size_t res = find->second;
#ifdef CHECK_RESULT
if (res != idx) {
state.SkipWithError(" bad find" );
}
#endif
benchmark::DoNotOptimize(res);
}
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Т о
2026-01-29 20:48:41 +00:00
Same thing with std::string and std::unordered_map< / span > < / span > < / td > < td class = "benchmarkresult" > 3599286< / td > < td class = "benchmarkresult" > 3711685< / td > < td class = "benchmarkresult" > 5814563< / td > < td class = "benchmarkresult" > 5843669< / td > < td class = "benchmarkresult" > 3332883< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > hashStrMapA< size_t> emplace & find ssa;< span class = "tooltiptext code" > void HashMapSimSsa(benchmark::State& state) {
for (auto _: state) {
hashStrMapA< size_t> store;
for (size_t idx = 0; idx < bs_sim.size(); idx++) {
store.emplace(bs_sim[idx], idx);
}
#ifdef CHECK_RESULT
if (store.size() != bs_sim.size()) {
state.SkipWithError(" bad inserts" );
}
#endif
for (size_t idx = 0; idx < bs_sim.size(); idx++) {
ssa key = bs_sim[idx];
auto find = store.find(key);
size_t res = find->second;
#ifdef CHECK_RESULT
if (res != idx) {
state.SkipWithError(" bad find" );
}
#endif
benchmark::DoNotOptimize(res);
}
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Теперь вставляем stringa, а
2026-01-29 20:48:41 +00:00
Now we insert stringa and search for ssa< / span > < / span > < / td > < td class = "benchmarkresult" > 3741065< / td > < td class = "benchmarkresult" > 3706802< / td > < td class = "benchmarkresult" > 3507480< / td > < td class = "benchmarkresult" > 3963034< / td > < td class = "benchmarkresult" > 3197797< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > std::unordered_map< std::string, size_t> emplace & find std::string_view;< span class = "tooltiptext code" > void HashMapStdStrView(benchmark::State& state) {
for (auto _: state) {
std::unordered_map< std::string, size_t> store;
for (size_t idx = 0; idx < bs_std.size(); idx++) {
store.emplace(bs_std[idx], idx);
}
#ifdef CHECK_RESULT
if (store.size() != bs_std.size()) {
state.SkipWithError(" bad inserts" );
}
#endif
for (size_t idx = 0; idx < bs_std.size(); idx++) {
std::string_view key = bs_std[idx];
auto find = store.find(std::string{key});
size_t res = find->second;
#ifdef CHECK_RESULT
if (res != idx) {
state.SkipWithError(" bad find" );
}
#endif
benchmark::DoNotOptimize(res);
}
}
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Вставляем std::string, а
2026-01-29 20:48:41 +00:00
We insert std::string and look for std::string_view< / span > < / span > < / td > < td class = "benchmarkresult" > 4188176< / td > < td class = "benchmarkresult" > 4055890< / td > < td class = "benchmarkresult" > 6774393< / td > < td class = "benchmarkresult" > 6280080< / td > < td class = "benchmarkresult" > 3669143< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' H a s h M a p i n s e r t a n d f i n d ' ] = { i d : ' b s 2 8 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'hashStrMapA< size_t > emplace & find stringa;',data:[3595592,3722226,3795773,4239554,3204846]},
{name:'std::unordered_map< std::string , size_t > emplace & find std::string;',data:[3599286,3711685,5814563,5843669,3332883]},
{name:'hashStrMapA< size_t > emplace & find ssa;',data:[3741065,3706802,3507480,3963034,3197797]},
{name:'std::unordered_map< std::string , size_t > emplace & find std::string_view;',data:[4188176,4055890,6774393,6280080,3669143]}
2025-04-05 14:21:11 +00:00
]}< / script >
2026-01-21 11:59:17 +00:00
< div class = "benchset" id = "bs29" > < h4 > < a id = "bs131384792586914680410" href = "#bs131384792586914680410" > #< / a > Build Full Func Name< / h4 >
< table > < thead > < tr > < th > Benchmark name< / th > < th width = "5%" > Comment< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), Clang-21< / th > < th width = "8%" > Xeon E5-2682 v4, Ubuntu 22 (WSL), GCC-13< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, Clang-19< / th > < th width = "8%" > Xeon E5-2682 v4, Windows 10, MSVC-19< / th > < th width = "8%" > Xeon E5-2682 v4, WASM Firefox, Clang-21< / th > < / tr > < / thead > < tbody >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Build func full name std::string;< span class = "tooltiptext code" > std::string build_full_name_std() const {
std::string str{has_ret_type_resolver ? " any" sv : type_names_sv[(unsigned)ret_type]};
str += " " ;
str += std_name;
str += " (" ;
bool add_comma = false;
for (const auto& param : params) {
if (add_comma) {
str += " , " ;
}
if (param.optional) {
str += " [" ;
}
param.allowed_types.to_stdstr(str);
if (param.optional) {
str += " ]" ;
}
add_comma = true;
}
if (unlim_params) {
if (add_comma) {
str += " , " ;
}
str += " ..." ;
}
str += " )" ;
//std::cout < < " Len=" < < str.length() < < " , Cap=" < < str.capacity() < < " \n" ;
return str;
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Обыденная задача, подобные часто могут встретится в работе:
По неким данным сгенерировать текст. В
о с
2026-01-21 11:59:17 +00:00
возвращаемого значения. Алгоритм на std::string.
A common task, similar to this one, can often be encountered in work:
Generate text from given data. In this case, using data
on certain functions, generate their full names with parameter types and
2026-01-29 20:48:41 +00:00
return values. The algorithm uses std::string.< / span > < / span > < / td > < td class = "benchmarkresult" > 709< / td > < td class = "benchmarkresult" > 943< / td > < td class = "benchmarkresult" > 1611< / td > < td class = "benchmarkresult" > 1716< / td > < td class = "benchmarkresult" > 2854< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Build func full name std::string 1;< span class = "tooltiptext code" > std::string build_full_name_std1() const {
std::string str{has_ret_type_resolver ? " any" sv : type_names_sv[(unsigned)ret_type]};
str += " " + std_name + " (" ;
bool add_comma = false;
for (const auto& param : params) {
if (add_comma) {
str += " , " ;
}
if (param.optional) {
str += " [" ;
}
param.allowed_types.to_stdstr(str);
if (param.optional) {
str += " ]" ;
}
add_comma = true;
}
if (unlim_params) {
if (add_comma) {
str += " , " ;
}
str += " ..." ;
}
str += " )" ;
//std::cout < < " Len=" < < str.length() < < " , Cap=" < < str.capacity() < < " \n" ;
return str;
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Почти тот же алгоритм, но несколько последовательных
2026-01-21 11:59:17 +00:00
+= к строке заменены на одно += + + +.
Almost the same algorithm, but several consecutive
2026-01-29 20:48:41 +00:00
+= to a string are replaced with a single += + + +.< / span > < / span > < / td > < td class = "benchmarkresult" > 829< / td > < td class = "benchmarkresult" > 1022< / td > < td class = "benchmarkresult" > 1681< / td > < td class = "benchmarkresult" > 1802< / td > < td class = "benchmarkresult" > 2988< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Build func full name std::stream;< span class = "tooltiptext code" > std::string build_full_name_stream() const {
std::ostringstream str;
if (has_ret_type_resolver) {
str < < " any" ;
} else {
str < < type_names_sv[(unsigned)ret_type];
}
str < < " " < < std_name < < " (" ;
bool add_comma = false;
for (const auto& param : params) {
if (add_comma) {
str < < " , " ;
}
if (param.optional) {
str < < " [" ;
}
param.allowed_types.to_stream(str);
if (param.optional) {
str < < " ]" ;
}
add_comma = true;
}
if (unlim_params) {
if (add_comma) {
str < < " , " ;
}
str < < " ..." ;
}
str < < " )" ;
return str.str();
2026-01-21 11:59:17 +00:00
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Строим имя функции через std::ostringstream и < <
2026-01-29 20:48:41 +00:00
We construct the function name through std::ostringstream and < < < / span > < / span > < / td > < td class = "benchmarkresult" > 2552< / td > < td class = "benchmarkresult" > 2671< / td > < td class = "benchmarkresult" > 8266< / td > < td class = "benchmarkresult" > 10011< / td > < td class = "benchmarkresult" > 6634< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Build func full name stringa;< span class = "tooltiptext code" > stringa build_full_name() const {
lstringa< 512> str = e_choice(has_ret_type_resolver, " any" , type_names[(unsigned)ret_type]) + " " + name + " (" ;
bool add_comma = false;
for (const auto& param : params) {
str += e_if(add_comma, " , " ) + e_if(param.optional, " [" );
param.allowed_types.to_simstr(str);
if (param.optional) {
str += " ]" ;
}
add_comma = true;
}
return str + e_if(unlim_params, e_if(add_comma, " , " ) + " ..." ) + " )" ;
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Реализация на simstr строках и строковых выражениях.
2026-01-21 11:59:17 +00:00
Инфа о
Implementation using simstr strings and string expressions.
2026-01-29 20:48:41 +00:00
Parameter information is appended to the current line.< / span > < / span > < / td > < td class = "benchmarkresult" > 503< / td > < td class = "benchmarkresult" > 612< / td > < td class = "benchmarkresult" > 821< / td > < td class = "benchmarkresult" > 1061< / td > < td class = "benchmarkresult" > 1333< / td > < / tr >
2025-04-05 14:21:11 +00:00
< tr > < td class = "benchmarkname" > < span class = "tooltip" > Build func full name stringa 1;< span class = "tooltiptext code" > stringa build_full_name1() const {
lstringa< 512> str = e_choice(has_ret_type_resolver, " any" , type_names[(unsigned)ret_type]) + " " + name + " (" ;
bool add_comma = false;
for (const auto& param : params) {
str += e_if(add_comma, " , " ) + e_if(param.optional, " [" ) + param.allowed_types.get_simstr() + e_if(param.optional, " ]" );
add_comma = true;
}
return str + e_if(unlim_params, e_if(add_comma, " , " ) + " ..." ) + " )" ;
}< / span > < / span > < / td > < td > < span class = "tooltip info" > >> < span class = "tooltiptext" > Реализация на simstr строках и строковых выражениях.
Инфа о а
разом добавляется в текущую строку. Позволяет операции в цикле
2026-01-21 11:59:17 +00:00
записать в одну строку, но чуть проигрывает по времени выполнения.
Implementation using simstr strings and string expressions.
Parameter information is added to a temporary string, and then
all at once to the current string. This allows loop operations
2026-01-29 20:48:41 +00:00
to be written in a single string, but is slightly slower in execution time.< / span > < / span > < / td > < td class = "benchmarkresult" > 670< / td > < td class = "benchmarkresult" > 657< / td > < td class = "benchmarkresult" > 963< / td > < td class = "benchmarkresult" > 1245< / td > < td class = "benchmarkresult" > 1547< / td > < / tr >
2026-01-21 11:59:17 +00:00
< / tbody > < / table > < / div > < script > b e n c h _ s e t s [ ' B u i l d F u l l F u n c N a m e ' ] = { i d : ' b s 2 9 ' , t e s t s : [
2026-01-29 20:48:41 +00:00
{name:'Build func full name std::string;',data:[709,943,1611,1716,2854]},
{name:'Build func full name std::string 1;',data:[829,1022,1681,1802,2988]},
{name:'Build func full name std::stream;',data:[2552,2671,8266,10011,6634]},
{name:'Build func full name stringa;',data:[503,612,821,1061,1333]},
{name:'Build func full name stringa 1;',data:[670,657,963,1245,1547]}
2025-11-26 19:15:50 +00:00
]}< / script > < / body > < / html >
