mirror of https://github.com/orefkov/simstr.git
4141 lines
253 KiB
HTML
4141 lines
253 KiB
HTML
<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)
|
||
Load Average: 0.00, 0.23, 0.51
|
||
***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>
|
||
<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)
|
||
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>
|
||
<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:
|
||
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>
|
||
<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:
|
||
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>
|
||
<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>
|
||
</ul></div></div>
|
||
<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>
|
||
|
||
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">226</td><td class="benchmarkresult">207</td><td class="benchmarkresult">266</td><td class="benchmarkresult">331</td><td class="benchmarkresult">925</td></tr>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">104</td><td class="benchmarkresult">102</td><td class="benchmarkresult">157</td><td class="benchmarkresult">211</td><td class="benchmarkresult">415</td></tr>
|
||
<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 приходится аллоцировать память,
|
||
а в stringa весь тест входит в SSO.
|
||
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,
|
||
while in stringa , the entire test is included in SSO.</span></span></td><td class="benchmarkresult">63.7</td><td class="benchmarkresult">70.4</td><td class="benchmarkresult">66.4</td><td class="benchmarkresult">108</td><td class="benchmarkresult">211</td></tr>
|
||
</tbody></table></div><script>bench_sets['Concatenate string + Number + "Literal"'] = {id:'bs1', tests:[
|
||
{name:'Concat std::string and number by std to std::string',data:[226,207,266,331,925]},
|
||
{name:'Concat std::string and number by StrExpr to std::string',data:[104,102,157,211,415]},
|
||
{name:'Concat stringa and number by StrExpr to simstr::stringa',data:[63.7,70.4,66.4,108,211]}
|
||
]}</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?
|
||
std::string str = s1 + std::format("0x{:x}", i) + " end";
|
||
benchmark::DoNotOptimize(str);
|
||
}
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">681</td><td class="benchmarkresult">668</td><td class="benchmarkresult">777</td><td class="benchmarkresult">1074</td><td class="benchmarkresult">1446</td></tr>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">71.7</td><td class="benchmarkresult">65.9</td><td class="benchmarkresult">76.6</td><td class="benchmarkresult">136</td><td class="benchmarkresult">365</td></tr>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">67.9</td><td class="benchmarkresult">68.2</td><td class="benchmarkresult">67.9</td><td class="benchmarkresult">101</td><td class="benchmarkresult">196</td></tr>
|
||
</tbody></table></div><script>bench_sets['Concatenate string + Hex Number + "Literal"'] = {id:'bs2', tests:[
|
||
{name:'Concat std::string and hex number by std to std::string',data:[681,668,777,1074,1446]},
|
||
{name:'Concat std::string and hex number by StrExpr to std::string',data:[71.7,65.9,76.6,136,365]},
|
||
{name:'Concat stringa and hex number by StrExpr to simstr::stringa',data:[67.9,68.2,67.9,101,196]}
|
||
]}</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);
|
||
}
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">49.7</td><td class="benchmarkresult">44.7</td><td class="benchmarkresult">39.8</td><td class="benchmarkresult">55.4</td><td class="benchmarkresult">111</td></tr>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">40.5</td><td class="benchmarkresult">35.9</td><td class="benchmarkresult">39.1</td><td class="benchmarkresult">77.9</td><td class="benchmarkresult">113</td></tr>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">27.0</td><td class="benchmarkresult">25.9</td><td class="benchmarkresult">29.2</td><td class="benchmarkresult">52.5</td><td class="benchmarkresult">95.9</td></tr>
|
||
</tbody></table></div><script>bench_sets['Concatenate string + "Literal"'] = {id:'bs3', tests:[
|
||
{name:'Concat std::string by std to std::string',data:[49.7,44.7,39.8,55.4,111]},
|
||
{name:'Concat std::string by StrExpr to std::string',data:[40.5,35.9,39.1,77.9,113]},
|
||
{name:'Concat stringa by StrExpr to stringa',data:[27.0,25.9,29.2,52.5,95.9]}
|
||
]}</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");
|
||
}</span></span></td><td></td><td class="benchmarkresult">116</td><td class="benchmarkresult">130</td><td class="benchmarkresult">208</td><td class="benchmarkresult">225</td><td class="benchmarkresult">178</td></tr>
|
||
<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"});
|
||
}</span></span></td><td></td><td class="benchmarkresult">51.1</td><td class="benchmarkresult">39.8</td><td class="benchmarkresult">116</td><td class="benchmarkresult">122</td><td class="benchmarkresult">106</td></tr>
|
||
<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,
|
||
it is collected in a stack-based buffer, without allocation or deallocation.</span></span></td><td class="benchmarkresult">19.6</td><td class="benchmarkresult">20.2</td><td class="benchmarkresult">22.2</td><td class="benchmarkresult">28.4</td><td class="benchmarkresult">73.7</td></tr>
|
||
</tbody></table></div><script>bench_sets['Find three concatenated string in string_view'] = {id:'bs4', tests:[
|
||
{name:'Find concat three std::string',data:[116,130,208,225,178]},
|
||
{name:'Find concat three strexpr',data:[51.1,39.8,116,122,106]},
|
||
{name:'Find concat three simstr',data:[19.6,20.2,22.2,28.4,73.7]}
|
||
]}</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;
|
||
}</span></span></td><td></td><td class="benchmarkresult">7.64</td><td class="benchmarkresult">10.7</td><td class="benchmarkresult">8.25</td><td class="benchmarkresult">17.9</td><td class="benchmarkresult">18.2</td></tr>
|
||
<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;
|
||
}</span></span></td><td></td><td class="benchmarkresult">6.52</td><td class="benchmarkresult">6.63</td><td class="benchmarkresult">7.50</td><td class="benchmarkresult">14.2</td><td class="benchmarkresult">17.0</td></tr>
|
||
<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;
|
||
}</span></span></td><td></td><td class="benchmarkresult">4.99</td><td class="benchmarkresult">5.23</td><td class="benchmarkresult">8.35</td><td class="benchmarkresult">17.2</td><td class="benchmarkresult">17.0</td></tr>
|
||
<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;
|
||
}</span></span></td><td></td><td class="benchmarkresult">56.8</td><td class="benchmarkresult">91.9</td><td class="benchmarkresult">59.5</td><td class="benchmarkresult">79.4</td><td class="benchmarkresult">275</td></tr>
|
||
<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;
|
||
}</span></span></td><td></td><td class="benchmarkresult">30.5</td><td class="benchmarkresult">25.3</td><td class="benchmarkresult">34.2</td><td class="benchmarkresult">40.0</td><td class="benchmarkresult">99.6</td></tr>
|
||
<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;
|
||
}</span></span></td><td></td><td class="benchmarkresult">22.7</td><td class="benchmarkresult">22.7</td><td class="benchmarkresult">26.4</td><td class="benchmarkresult">37.9</td><td class="benchmarkresult">71.2</td></tr>
|
||
</tbody></table></div><script>bench_sets['Build Type Name'] = {id:'bs5', tests:[
|
||
{name:'BuildTypeNameStr 0/0',data:[7.64,10.7,8.25,17.9,18.2]},
|
||
{name:'BuildTypeNameExp 0/0',data:[6.52,6.63,7.50,14.2,17.0]},
|
||
{name:'BuildTypeNameSim 0/0',data:[4.99,5.23,8.35,17.2,17.0]},
|
||
{name:'BuildTypeNameStr 10/10',data:[56.8,91.9,59.5,79.4,275]},
|
||
{name:'BuildTypeNameExp 10/10',data:[30.5,25.3,34.2,40.0,99.6]},
|
||
{name:'BuildTypeNameSim 10/10',data:[22.7,22.7,26.4,37.9,71.2]}
|
||
]}</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) + ">";
|
||
}</span></span></td><td></td><td class="benchmarkresult">207</td><td class="benchmarkresult">242</td><td class="benchmarkresult">318</td><td class="benchmarkresult">362</td><td class="benchmarkresult">451</td></tr>
|
||
<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">В simstr строковое выражение для замены подстрок
|
||
есть "из коробки".
|
||
simstr has a string expression for replacing substrings out of the box.</span></span></td><td class="benchmarkresult">149</td><td class="benchmarkresult">135</td><td class="benchmarkresult">224</td><td class="benchmarkresult">223</td><td class="benchmarkresult">248</td></tr>
|
||
</tbody></table></div><script>bench_sets['Replace string by copy'] = {id:'bs6', tests:[
|
||
{name:'Concat with replace str',data:[207,242,318,362,451]},
|
||
{name:'Concat with replace exp',data:[149,135,224,223,248]}
|
||
]}</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>
|
||
<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);
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">Пустые строки, ничего необычного.
|
||
Empty lines, nothing unusual.</span></span></td><td class="benchmarkresult">1.12</td><td class="benchmarkresult">1.12</td><td class="benchmarkresult">1.11</td><td class="benchmarkresult">2.63</td><td class="benchmarkresult">2.18</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">0.373</td><td class="benchmarkresult">0.737</td><td class="benchmarkresult">0.372</td><td class="benchmarkresult">1.84</td><td class="benchmarkresult">0.993</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">0.367</td><td class="benchmarkresult">0.182</td><td class="benchmarkresult">0.364</td><td class="benchmarkresult">1.83</td><td class="benchmarkresult">0.952</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">0.753</td><td class="benchmarkresult">0.751</td><td class="benchmarkresult">0.757</td><td class="benchmarkresult">2.22</td><td class="benchmarkresult">2.19</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1.13</td><td class="benchmarkresult">1.12</td><td class="benchmarkresult">1.12</td><td class="benchmarkresult">2.59</td><td class="benchmarkresult">2.26</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1.13</td><td class="benchmarkresult">1.11</td><td class="benchmarkresult">1.15</td><td class="benchmarkresult">2.56</td><td class="benchmarkresult">2.60</td></tr>
|
||
</tbody></table></div><script>bench_sets['Create Empty Str'] = {id:'bs7', tests:[
|
||
{name:'std::string e;',data:[1.12,1.12,1.11,2.63,2.18]},
|
||
{name:'std::string_view e;',data:[0.373,0.737,0.372,1.84,0.993]},
|
||
{name:'ssa e;',data:[0.367,0.182,0.364,1.83,0.952]},
|
||
{name:'stringa e;',data:[0.753,0.751,0.757,2.22,2.19]},
|
||
{name:'lstringa<20> e;',data:[1.13,1.12,1.12,2.59,2.26]},
|
||
{name:'lstringa<40> e;',data:[1.13,1.11,1.15,2.56,2.60]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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,
|
||
время тратится только на копирование 10 байтов.
|
||
The short literal is placed in the internal std::string buffer;
|
||
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.85</td><td class="benchmarkresult">2.64</td><td class="benchmarkresult">2.37</td></tr>
|
||
<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 - по сути одно и то же:
|
||
указатель на текст и его длина.
|
||
Both string_view and ssa are essentially the same thing:
|
||
a pointer to text and its length.</span></span></td><td class="benchmarkresult">0.750</td><td class="benchmarkresult">0.730</td><td class="benchmarkresult">0.728</td><td class="benchmarkresult">1.85</td><td class="benchmarkresult">1.29</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">0.381</td><td class="benchmarkresult">0.736</td><td class="benchmarkresult">0.370</td><td class="benchmarkresult">1.83</td><td class="benchmarkresult">1.01</td></tr>
|
||
<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 при инициализации константным литералом так же
|
||
сохраняет только указатель на текст и его длину.
|
||
When initialized with a constant literal, stringa also stores
|
||
only a pointer to the text and its length.</span></span></td><td class="benchmarkresult">1.85</td><td class="benchmarkresult">1.12</td><td class="benchmarkresult">1.85</td><td class="benchmarkresult">2.20</td><td class="benchmarkresult">2.63</td></tr>
|
||
<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">Внутреннего буфера хватает для размещения символов,
|
||
время уходит только на копирование байтов.
|
||
The internal buffer is sufficient to accommodate characters;
|
||
time is spent only on copying bytes.</span></span></td><td class="benchmarkresult">1.87</td><td class="benchmarkresult">1.87</td><td class="benchmarkresult">1.89</td><td class="benchmarkresult">2.59</td><td class="benchmarkresult">2.77</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1.85</td><td class="benchmarkresult">1.89</td><td class="benchmarkresult">1.91</td><td class="benchmarkresult">2.58</td><td class="benchmarkresult">2.78</td></tr>
|
||
</tbody></table></div><script>bench_sets['Create Str from short literal (9 symbols)'] = {id:'bs8', tests:[
|
||
{name:'std::string e = "Test text";',data:[1.84,1.87,1.85,2.64,2.37]},
|
||
{name:'std::string_view e = "Test text";',data:[0.750,0.730,0.728,1.85,1.29]},
|
||
{name:'ssa e = "Test text";',data:[0.381,0.736,0.370,1.83,1.01]},
|
||
{name:'stringa e = "Test text";',data:[1.85,1.12,1.85,2.20,2.63]},
|
||
{name:'lstringa<20> e = "Test text";',data:[1.87,1.87,1.89,2.59,2.77]},
|
||
{name:'lstringa<40> e = "Test text";',data:[1.85,1.89,1.91,2.58,2.78]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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-и байтов.
|
||
Но как же отстает аллокация под Windows от Linux'а, 20 vs 70 ns...
|
||
Here, the literal doesn't fit into the internal buffer,
|
||
and 30 bytes are allocated and copied.
|
||
But how much slower is allocation under Windows than under Linux, 20 ns vs. 70 ns...</span></span></td><td class="benchmarkresult">18.8</td><td class="benchmarkresult">19.3</td><td class="benchmarkresult">74.9</td><td class="benchmarkresult">77.5</td><td class="benchmarkresult">16.5</td></tr>
|
||
<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 по прежнему ничего не делают, кроме
|
||
запоминания указателя на текст и его размера.
|
||
string_view and ssa still do nothing except
|
||
remember the pointer to the text and its size.</span></span></td><td class="benchmarkresult">0.747</td><td class="benchmarkresult">0.744</td><td class="benchmarkresult">0.736</td><td class="benchmarkresult">1.83</td><td class="benchmarkresult">1.26</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">0.370</td><td class="benchmarkresult">0.735</td><td class="benchmarkresult">0.365</td><td class="benchmarkresult">1.83</td><td class="benchmarkresult">1.01</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">stringa на константных литералах не отстает!
|
||
stringa doesn't lag behind on constant literals!</span></span></td><td class="benchmarkresult">1.88</td><td class="benchmarkresult">1.12</td><td class="benchmarkresult">1.85</td><td class="benchmarkresult">2.24</td><td class="benchmarkresult">2.67</td></tr>
|
||
<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 символов,
|
||
Очевидно, что для 30-и символов уже нужна аллокация.
|
||
Obviously, 30 characters already require allocation.</span></span></td><td class="benchmarkresult">21.0</td><td class="benchmarkresult">20.0</td><td class="benchmarkresult">76.8</td><td class="benchmarkresult">77.7</td><td class="benchmarkresult">16.9</td></tr>
|
||
<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">А в lstringa<40> влезает до 47 символов, так что просто
|
||
копируется 30 байтов.
|
||
And lstringa<40> can hold up to 47 characters, so 30
|
||
bytes are simply copied.</span></span></td><td class="benchmarkresult">2.55</td><td class="benchmarkresult">1.84</td><td class="benchmarkresult">2.53</td><td class="benchmarkresult">3.42</td><td class="benchmarkresult">3.01</td></tr>
|
||
</tbody></table></div><script>bench_sets['Create Str from long literal (30 symbols)'] = {id:'bs9', tests:[
|
||
{name:'std::string e = "123456789012345678901234567890";',data:[18.8,19.3,74.9,77.5,16.5]},
|
||
{name:'std::string_view e = "123456789012345678901234567890";',data:[0.747,0.744,0.736,1.83,1.26]},
|
||
{name:'ssa e = "123456789012345678901234567890";',data:[0.370,0.735,0.365,1.83,1.01]},
|
||
{name:'stringa e = "123456789012345678901234567890";',data:[1.88,1.12,1.85,2.24,2.67]},
|
||
{name:'lstringa<20> e = "123456789012345678901234567890";',data:[21.0,20.0,76.8,77.7,16.9]},
|
||
{name:'lstringa<40> e = "123456789012345678901234567890";',data:[2.55,1.84,2.53,3.42,3.01]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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);
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">Строка в пределах SSO, так что просто копирует байты.
|
||
The string is within the SSO, so it just copies the bytes.</span></span></td><td class="benchmarkresult">4.83</td><td class="benchmarkresult">4.80</td><td class="benchmarkresult">1.87</td><td class="benchmarkresult">5.43</td><td class="benchmarkresult">2.27</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">0.377</td><td class="benchmarkresult">0.373</td><td class="benchmarkresult">0.368</td><td class="benchmarkresult">2.94</td><td class="benchmarkresult">1.26</td></tr>
|
||
<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 не владеют строкой, копируется
|
||
только информация о строке.
|
||
ssa and string_view don't own the string; only the
|
||
string information is copied.</span></span></td><td class="benchmarkresult">0.368</td><td class="benchmarkresult">0.376</td><td class="benchmarkresult">0.375</td><td class="benchmarkresult">2.92</td><td class="benchmarkresult">1.27</td></tr>
|
||
<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 происходит быстро,
|
||
особенно если она инициализирована литералом.
|
||
Copying a stringa is fast,
|
||
especially if it is initialized with a literal.</span></span></td><td class="benchmarkresult">1.11</td><td class="benchmarkresult">1.37</td><td class="benchmarkresult">1.32</td><td class="benchmarkresult">4.13</td><td class="benchmarkresult">2.64</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">В обоих случаях хватает внутреннего буфера.
|
||
In both cases, the internal buffer is sufficient.</span></span></td><td class="benchmarkresult">4.18</td><td class="benchmarkresult">4.43</td><td class="benchmarkresult">5.30</td><td class="benchmarkresult">7.74</td><td class="benchmarkresult">14.1</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">Только копируются байты.
|
||
Only bytes are copied.</span></span></td><td class="benchmarkresult">4.47</td><td class="benchmarkresult">4.49</td><td class="benchmarkresult">5.22</td><td class="benchmarkresult">8.56</td><td class="benchmarkresult">14.2</td></tr>
|
||
</tbody></table></div><script>bench_sets['Create copy of Str with 9 symbols'] = {id:'bs10', tests:[
|
||
{name:'std::string e = "Test text"; auto c{e};',data:[4.83,4.80,1.87,5.43,2.27]},
|
||
{name:'std::string_view e = "Test text"; auto c{e};',data:[0.377,0.373,0.368,2.94,1.26]},
|
||
{name:'ssa e = "Test text"; auto c{e};',data:[0.368,0.376,0.375,2.92,1.27]},
|
||
{name:'stringa e = "Test text"; auto c{e};',data:[1.11,1.37,1.32,4.13,2.64]},
|
||
{name:'lstringa<20> e = "Test text"; auto c{e};',data:[4.18,4.43,5.30,7.74,14.1]},
|
||
{name:'lstringa<40> e = "Test text"; auto c{e};',data:[4.47,4.49,5.22,8.56,14.2]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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">Копирования длинной строки вызывает аллокацию,
|
||
SSO уже не хватает. И снова как же отстаёт аллокация под Windows...
|
||
Copying a long string causes allocations,
|
||
SSO is no longer sufficient. And again, how allocation lags under Windows...</span></span></td><td class="benchmarkresult">19.8</td><td class="benchmarkresult">24.3</td><td class="benchmarkresult">81.3</td><td class="benchmarkresult">77.5</td><td class="benchmarkresult">34.3</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">0.752</td><td class="benchmarkresult">0.724</td><td class="benchmarkresult">0.741</td><td class="benchmarkresult">1.88</td><td class="benchmarkresult">1.25</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">0.375</td><td class="benchmarkresult">0.752</td><td class="benchmarkresult">0.362</td><td class="benchmarkresult">1.83</td><td class="benchmarkresult">1.01</td></tr>
|
||
<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">А вот у stringa копирование литерала не зависит от его длины,
|
||
сравни с предыдущим бенчмарком.
|
||
But with stringa, literal copying doesn't depend on its length,
|
||
compare with the previous benchmark.</span></span></td><td class="benchmarkresult">1.89</td><td class="benchmarkresult">1.11</td><td class="benchmarkresult">1.83</td><td class="benchmarkresult">3.02</td><td class="benchmarkresult">2.66</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">Не влезает, аллокация.
|
||
Doesn't fit, allocation.</span></span></td><td class="benchmarkresult">21.0</td><td class="benchmarkresult">20.1</td><td class="benchmarkresult">76.1</td><td class="benchmarkresult">79.3</td><td class="benchmarkresult">17.2</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">Уложили во внутренний буфер.
|
||
Placed in the internal buffer.</span></span></td><td class="benchmarkresult">4.53</td><td class="benchmarkresult">4.52</td><td class="benchmarkresult">4.38</td><td class="benchmarkresult">6.63</td><td class="benchmarkresult">13.9</td></tr>
|
||
</tbody></table></div><script>bench_sets['Create copy of Str with 30 symbols'] = {id:'bs11', tests:[
|
||
{name:'std::string e = "123456789012345678901234567890"; auto c{e};',data:[19.8,24.3,81.3,77.5,34.3]},
|
||
{name:'std::string_view e = "123456789012345678901234567890"; auto c{e};',data:[0.752,0.724,0.741,1.88,1.25]},
|
||
{name:'ssa e = "123456789012345678901234567890"; auto c{e};',data:[0.375,0.752,0.362,1.83,1.01]},
|
||
{name:'stringa e = "123456789012345678901234567890"; auto c{e};',data:[1.89,1.11,1.83,3.02,2.66]},
|
||
{name:'lstringa<20> e = "123456789012345678901234567890"; auto c{e};',data:[21.0,20.1,76.1,79.3,17.2]},
|
||
{name:'lstringa<40> e = "123456789012345678901234567890"; auto c{e};',data:[4.53,4.52,4.38,6.63,13.9]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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">Здесь "победила дружба", у всех типов по колонке примерно одинаково.
|
||
Однако, Windows и Linux явно в разных весовых категориях.
|
||
Here, "friendship wins," with all types scoring roughly equally.
|
||
However, Windows and Linux are clearly in different weight classes.</span></span></td><td class="benchmarkresult">7.86</td><td class="benchmarkresult">7.33</td><td class="benchmarkresult">38.3</td><td class="benchmarkresult">40.7</td><td class="benchmarkresult">54.3</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">7.36</td><td class="benchmarkresult">6.78</td><td class="benchmarkresult">38.1</td><td class="benchmarkresult">40.8</td><td class="benchmarkresult">53.4</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">7.03</td><td class="benchmarkresult">6.32</td><td class="benchmarkresult">18.3</td><td class="benchmarkresult">22.6</td><td class="benchmarkresult">52.7</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">7.17</td><td class="benchmarkresult">6.77</td><td class="benchmarkresult">19.8</td><td class="benchmarkresult">28.4</td><td class="benchmarkresult">53.8</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">6.43</td><td class="benchmarkresult">6.33</td><td class="benchmarkresult">17.6</td><td class="benchmarkresult">23.2</td><td class="benchmarkresult">52.5</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">6.56</td><td class="benchmarkresult">6.43</td><td class="benchmarkresult">17.8</td><td class="benchmarkresult">21.3</td><td class="benchmarkresult">52.6</td></tr>
|
||
</tbody></table></div><script>bench_sets['Find 9 symbols text in end of 99 symbols text'] = {id:'bs12', tests:[
|
||
{name:'std::string::find;',data:[7.86,7.33,38.3,40.7,54.3]},
|
||
{name:'std::string_view::find;',data:[7.36,6.78,38.1,40.8,53.4]},
|
||
{name:'ssa::find;',data:[7.03,6.32,18.3,22.6,52.7]},
|
||
{name:'stringa::find;',data:[7.17,6.77,19.8,28.4,53.8]},
|
||
{name:'lstringa<20>::find;',data:[6.43,6.33,17.6,23.2,52.5]},
|
||
{name:'lstringa<40>::find;',data:[6.56,6.43,17.8,21.3,52.6]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">5.69</td><td class="benchmarkresult">5.20</td><td class="benchmarkresult">1.86</td><td class="benchmarkresult">5.27</td><td class="benchmarkresult">35.9</td></tr>
|
||
<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-битный, и там размер
|
||
SSO у std::string меньше, насколько я помню, 11 символов + 0.
|
||
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
|
||
smaller, as far as I remember: 11 characters + 0.</span></span></td><td class="benchmarkresult">23.6</td><td class="benchmarkresult">23.6</td><td class="benchmarkresult">80.4</td><td class="benchmarkresult">83.4</td><td class="benchmarkresult">35.4</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">Дальше просто добавляется время на копирование байтов.
|
||
Then the time for copying bytes is simply added.</span></span></td><td class="benchmarkresult">24.0</td><td class="benchmarkresult">23.0</td><td class="benchmarkresult">78.0</td><td class="benchmarkresult">82.9</td><td class="benchmarkresult">36.3</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">23.3</td><td class="benchmarkresult">23.1</td><td class="benchmarkresult">80.2</td><td class="benchmarkresult">83.8</td><td class="benchmarkresult">35.6</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">23.2</td><td class="benchmarkresult">23.4</td><td class="benchmarkresult">82.7</td><td class="benchmarkresult">88.0</td><td class="benchmarkresult">39.4</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">23.3</td><td class="benchmarkresult">24.0</td><td class="benchmarkresult">82.0</td><td class="benchmarkresult">84.3</td><td class="benchmarkresult">39.6</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">25.2</td><td class="benchmarkresult">24.5</td><td class="benchmarkresult">89.8</td><td class="benchmarkresult">87.8</td><td class="benchmarkresult">41.3</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">25.4</td><td class="benchmarkresult">25.1</td><td class="benchmarkresult">91.4</td><td class="benchmarkresult">88.5</td><td class="benchmarkresult">58.6</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">29.9</td><td class="benchmarkresult">29.0</td><td class="benchmarkresult">89.2</td><td class="benchmarkresult">91.6</td><td class="benchmarkresult">53.9</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">44.1</td><td class="benchmarkresult">44.3</td><td class="benchmarkresult">96.8</td><td class="benchmarkresult">99.9</td><td class="benchmarkresult">53.1</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">130</td><td class="benchmarkresult">130</td><td class="benchmarkresult">130</td><td class="benchmarkresult">129</td><td class="benchmarkresult">77.9</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">Чем длиннее строка, тем дольше создаётся копия.
|
||
The longer the string, the longer it takes to create a copy.</span></span></td><td class="benchmarkresult">153</td><td class="benchmarkresult">157</td><td class="benchmarkresult">178</td><td class="benchmarkresult">177</td><td class="benchmarkresult">130</td></tr>
|
||
<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 инициализируется не литералом,
|
||
а значит, должна сама хранить символы.
|
||
Here, stringa is not initialized with a literal,
|
||
meaning it must store characters itself.</span></span></td><td class="benchmarkresult">1.10</td><td class="benchmarkresult">1.14</td><td class="benchmarkresult">1.28</td><td class="benchmarkresult">4.05</td><td class="benchmarkresult">2.64</td></tr>
|
||
<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 у stringa составляет 15 символов. Кроме того,
|
||
собиралось без поддержки потоков, поэтому атомарный
|
||
инкремент заменён на обычный, судя по времени.
|
||
Under WASM, stringa has a 15-character SSO. Furthermore,
|
||
it was built without thread support, so the atomic
|
||
increment was replaced with a regular one, judging by the time.</span></span></td><td class="benchmarkresult">1.10</td><td class="benchmarkresult">1.10</td><td class="benchmarkresult">1.28</td><td class="benchmarkresult">4.03</td><td class="benchmarkresult">4.98</td></tr>
|
||
<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
|
||
копируются быстрее, чем 15 в std::string.
|
||
SSO in stringa is up to 23 characters, and even 23
|
||
copies faster than 15 in std::string.</span></span></td><td class="benchmarkresult">1.10</td><td class="benchmarkresult">1.11</td><td class="benchmarkresult">1.28</td><td class="benchmarkresult">4.10</td><td class="benchmarkresult">5.00</td></tr>
|
||
<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, а значит, используем shared буфер.
|
||
Добавляется время на атомарный инкремент счётчика.
|
||
That's it, we're not using SSO, so we're using a shared buffer.
|
||
Time is added for the atomic counter increment.</span></span></td><td class="benchmarkresult">16.7</td><td class="benchmarkresult">16.2</td><td class="benchmarkresult">15.8</td><td class="benchmarkresult">18.5</td><td class="benchmarkresult">5.02</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">16.0</td><td class="benchmarkresult">16.3</td><td class="benchmarkresult">15.7</td><td class="benchmarkresult">18.5</td><td class="benchmarkresult">4.98</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">16.0</td><td class="benchmarkresult">16.5</td><td class="benchmarkresult">15.8</td><td class="benchmarkresult">18.6</td><td class="benchmarkresult">4.94</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">16.0</td><td class="benchmarkresult">16.4</td><td class="benchmarkresult">15.8</td><td class="benchmarkresult">18.5</td><td class="benchmarkresult">4.99</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">16.0</td><td class="benchmarkresult">16.2</td><td class="benchmarkresult">15.7</td><td class="benchmarkresult">18.5</td><td class="benchmarkresult">4.90</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">16.0</td><td class="benchmarkresult">16.3</td><td class="benchmarkresult">15.7</td><td class="benchmarkresult">18.4</td><td class="benchmarkresult">5.01</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">16.0</td><td class="benchmarkresult">16.3</td><td class="benchmarkresult">15.7</td><td class="benchmarkresult">18.9</td><td class="benchmarkresult">5.07</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">16.1</td><td class="benchmarkresult">16.4</td><td class="benchmarkresult">15.9</td><td class="benchmarkresult">18.4</td><td class="benchmarkresult">5.01</td></tr>
|
||
<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">И как видно, кроме инкремента нет накладных расходов,
|
||
время копирования не зависит от длины строки.
|
||
And as you can see, there are no overhead costs other than the
|
||
increment; copying time does not depend on the string length.</span></span></td><td class="benchmarkresult">16.0</td><td class="benchmarkresult">16.5</td><td class="benchmarkresult">15.9</td><td class="benchmarkresult">18.3</td><td class="benchmarkresult">4.92</td></tr>
|
||
<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 символов.
|
||
А в WASM 32-битная архитектура, SSO до 19 символов.
|
||
lstringa<16> uses SSO up to 23 characters.
|
||
WASM has a 32-bit architecture, so SSO is up to 19 characters.</span></span></td><td class="benchmarkresult">4.12</td><td class="benchmarkresult">4.51</td><td class="benchmarkresult">4.88</td><td class="benchmarkresult">7.84</td><td class="benchmarkresult">14.1</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">4.09</td><td class="benchmarkresult">4.50</td><td class="benchmarkresult">4.78</td><td class="benchmarkresult">7.89</td><td class="benchmarkresult">14.6</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">4.04</td><td class="benchmarkresult">4.56</td><td class="benchmarkresult">4.80</td><td class="benchmarkresult">7.73</td><td class="benchmarkresult">31.6</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">И после начинает вести себя при копировании, как std::string.
|
||
And then it starts to behave like std::string when copied.</span></span></td><td class="benchmarkresult">22.9</td><td class="benchmarkresult">24.2</td><td class="benchmarkresult">76.9</td><td class="benchmarkresult">82.1</td><td class="benchmarkresult">30.9</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">22.9</td><td class="benchmarkresult">23.7</td><td class="benchmarkresult">80.5</td><td class="benchmarkresult">84.1</td><td class="benchmarkresult">35.1</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">24.1</td><td class="benchmarkresult">25.4</td><td class="benchmarkresult">81.7</td><td class="benchmarkresult">84.8</td><td class="benchmarkresult">34.9</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">24.8</td><td class="benchmarkresult">26.8</td><td class="benchmarkresult">81.6</td><td class="benchmarkresult">84.7</td><td class="benchmarkresult">35.5</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">26.0</td><td class="benchmarkresult">27.8</td><td class="benchmarkresult">83.0</td><td class="benchmarkresult">649</td><td class="benchmarkresult">54.3</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">28.5</td><td class="benchmarkresult">31.9</td><td class="benchmarkresult">87.0</td><td class="benchmarkresult">91.6</td><td class="benchmarkresult">48.8</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">93.2</td><td class="benchmarkresult">96.9</td><td class="benchmarkresult">96.8</td><td class="benchmarkresult">96.2</td><td class="benchmarkresult">48.6</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">113</td><td class="benchmarkresult">117</td><td class="benchmarkresult">133</td><td class="benchmarkresult">128</td><td class="benchmarkresult">71.5</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">127</td><td class="benchmarkresult">130</td><td class="benchmarkresult">195</td><td class="benchmarkresult">185</td><td class="benchmarkresult">118</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">4.48</td><td class="benchmarkresult">5.23</td><td class="benchmarkresult">5.12</td><td class="benchmarkresult">8.54</td><td class="benchmarkresult">15.2</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">4.49</td><td class="benchmarkresult">11.5</td><td class="benchmarkresult">5.09</td><td class="benchmarkresult">8.63</td><td class="benchmarkresult">15.3</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">4.43</td><td class="benchmarkresult">11.7</td><td class="benchmarkresult">5.25</td><td class="benchmarkresult">8.58</td><td class="benchmarkresult">14.6</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">4.55</td><td class="benchmarkresult">11.6</td><td class="benchmarkresult">5.15</td><td class="benchmarkresult">8.55</td><td class="benchmarkresult">15.2</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">4.12</td><td class="benchmarkresult">20.0</td><td class="benchmarkresult">7.92</td><td class="benchmarkresult">11.5</td><td class="benchmarkresult">17.8</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">6.30</td><td class="benchmarkresult">20.8</td><td class="benchmarkresult">7.99</td><td class="benchmarkresult">11.9</td><td class="benchmarkresult">18.3</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">6.07</td><td class="benchmarkresult">23.4</td><td class="benchmarkresult">8.43</td><td class="benchmarkresult">12.1</td><td class="benchmarkresult">18.8</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">7.87</td><td class="benchmarkresult">18.1</td><td class="benchmarkresult">9.40</td><td class="benchmarkresult">13.0</td><td class="benchmarkresult">20.1</td></tr>
|
||
<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 символов копируются быстрее, чем
|
||
одна аллокация или атомарный инкремент.
|
||
Even 512 characters are copied faster than a single
|
||
allocation or atomic increment.</span></span></td><td class="benchmarkresult">10.2</td><td class="benchmarkresult">20.6</td><td class="benchmarkresult">12.3</td><td class="benchmarkresult">14.3</td><td class="benchmarkresult">26.9</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">А дальше уже как у всех.
|
||
And then it's like everyone else.</span></span></td><td class="benchmarkresult">95.5</td><td class="benchmarkresult">96.9</td><td class="benchmarkresult">94.1</td><td class="benchmarkresult">97.2</td><td class="benchmarkresult">48.0</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">116</td><td class="benchmarkresult">118</td><td class="benchmarkresult">128</td><td class="benchmarkresult">127</td><td class="benchmarkresult">71.3</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">130</td><td class="benchmarkresult">134</td><td class="benchmarkresult">181</td><td class="benchmarkresult">186</td><td class="benchmarkresult">120</td></tr>
|
||
</tbody></table></div><script>bench_sets['Copy not literal Str with N symbols'] = {id:'bs13', tests:[
|
||
{name:'std::string copy{str_with_len_N};/15',data:[5.69,5.20,1.86,5.27,35.9]},
|
||
{name:'std::string copy{str_with_len_N};/16',data:[23.6,23.6,80.4,83.4,35.4]},
|
||
{name:'std::string copy{str_with_len_N};/23',data:[24.0,23.0,78.0,82.9,36.3]},
|
||
{name:'std::string copy{str_with_len_N};/24',data:[23.3,23.1,80.2,83.8,35.6]},
|
||
{name:'std::string copy{str_with_len_N};/32',data:[23.2,23.4,82.7,88.0,39.4]},
|
||
{name:'std::string copy{str_with_len_N};/64',data:[23.3,24.0,82.0,84.3,39.6]},
|
||
{name:'std::string copy{str_with_len_N};/128',data:[25.2,24.5,89.8,87.8,41.3]},
|
||
{name:'std::string copy{str_with_len_N};/256',data:[25.4,25.1,91.4,88.5,58.6]},
|
||
{name:'std::string copy{str_with_len_N};/512',data:[29.9,29.0,89.2,91.6,53.9]},
|
||
{name:'std::string copy{str_with_len_N};/1024',data:[44.1,44.3,96.8,99.9,53.1]},
|
||
{name:'std::string copy{str_with_len_N};/2048',data:[130,130,130,129,77.9]},
|
||
{name:'std::string copy{str_with_len_N};/4096',data:[153,157,178,177,130]},
|
||
{name:'stringa copy{str_with_len_N};/15',data:[1.10,1.14,1.28,4.05,2.64]},
|
||
{name:'stringa copy{str_with_len_N};/16',data:[1.10,1.10,1.28,4.03,4.98]},
|
||
{name:'stringa copy{str_with_len_N};/23',data:[1.10,1.11,1.28,4.10,5.00]},
|
||
{name:'stringa copy{str_with_len_N};/24',data:[16.7,16.2,15.8,18.5,5.02]},
|
||
{name:'stringa copy{str_with_len_N};/32',data:[16.0,16.3,15.7,18.5,4.98]},
|
||
{name:'stringa copy{str_with_len_N};/64',data:[16.0,16.5,15.8,18.6,4.94]},
|
||
{name:'stringa copy{str_with_len_N};/128',data:[16.0,16.4,15.8,18.5,4.99]},
|
||
{name:'stringa copy{str_with_len_N};/256',data:[16.0,16.2,15.7,18.5,4.90]},
|
||
{name:'stringa copy{str_with_len_N};/512',data:[16.0,16.3,15.7,18.4,5.01]},
|
||
{name:'stringa copy{str_with_len_N};/1024',data:[16.0,16.3,15.7,18.9,5.07]},
|
||
{name:'stringa copy{str_with_len_N};/2048',data:[16.1,16.4,15.9,18.4,5.01]},
|
||
{name:'stringa copy{str_with_len_N};/4096',data:[16.0,16.5,15.9,18.3,4.92]},
|
||
{name:'lstringa<16> copy{str_with_len_N};/15',data:[4.12,4.51,4.88,7.84,14.1]},
|
||
{name:'lstringa<16> copy{str_with_len_N};/16',data:[4.09,4.50,4.78,7.89,14.6]},
|
||
{name:'lstringa<16> copy{str_with_len_N};/23',data:[4.04,4.56,4.80,7.73,31.6]},
|
||
{name:'lstringa<16> copy{str_with_len_N};/24',data:[22.9,24.2,76.9,82.1,30.9]},
|
||
{name:'lstringa<16> copy{str_with_len_N};/32',data:[22.9,23.7,80.5,84.1,35.1]},
|
||
{name:'lstringa<16> copy{str_with_len_N};/64',data:[24.1,25.4,81.7,84.8,34.9]},
|
||
{name:'lstringa<16> copy{str_with_len_N};/128',data:[24.8,26.8,81.6,84.7,35.5]},
|
||
{name:'lstringa<16> copy{str_with_len_N};/256',data:[26.0,27.8,83.0,649,54.3]},
|
||
{name:'lstringa<16> copy{str_with_len_N};/512',data:[28.5,31.9,87.0,91.6,48.8]},
|
||
{name:'lstringa<16> copy{str_with_len_N};/1024',data:[93.2,96.9,96.8,96.2,48.6]},
|
||
{name:'lstringa<16> copy{str_with_len_N};/2048',data:[113,117,133,128,71.5]},
|
||
{name:'lstringa<16> copy{str_with_len_N};/4096',data:[127,130,195,185,118]},
|
||
{name:'lstringa<512> copy{str_with_len_N};/15',data:[4.48,5.23,5.12,8.54,15.2]},
|
||
{name:'lstringa<512> copy{str_with_len_N};/16',data:[4.49,11.5,5.09,8.63,15.3]},
|
||
{name:'lstringa<512> copy{str_with_len_N};/23',data:[4.43,11.7,5.25,8.58,14.6]},
|
||
{name:'lstringa<512> copy{str_with_len_N};/24',data:[4.55,11.6,5.15,8.55,15.2]},
|
||
{name:'lstringa<512> copy{str_with_len_N};/32',data:[4.12,20.0,7.92,11.5,17.8]},
|
||
{name:'lstringa<512> copy{str_with_len_N};/64',data:[6.30,20.8,7.99,11.9,18.3]},
|
||
{name:'lstringa<512> copy{str_with_len_N};/128',data:[6.07,23.4,8.43,12.1,18.8]},
|
||
{name:'lstringa<512> copy{str_with_len_N};/256',data:[7.87,18.1,9.40,13.0,20.1]},
|
||
{name:'lstringa<512> copy{str_with_len_N};/512',data:[10.2,20.6,12.3,14.3,26.9]},
|
||
{name:'lstringa<512> copy{str_with_len_N};/1024',data:[95.5,96.9,94.1,97.2,48.0]},
|
||
{name:'lstringa<512> copy{str_with_len_N};/2048',data:[116,118,128,127,71.3]},
|
||
{name:'lstringa<512> copy{str_with_len_N};/4096',data:[130,134,181,186,120]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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">В simstr для конвертации в число достаточно куска строки,
|
||
нет нужды в null терминированности. Ближайший аналог такого
|
||
поведения "std::from_chars", но он к сожалению очень ограничен
|
||
по возможностям. Здесь я попытался произвести тесты, близкие по
|
||
логике к работе 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.
|
||
Here, I attempted to run tests that are similar in logic to std::from_chars.</span></span></td><td class="benchmarkresult">27.5</td><td class="benchmarkresult">27.4</td><td class="benchmarkresult">30.8</td><td class="benchmarkresult">32.2</td><td class="benchmarkresult">69.5</td></tr>
|
||
<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 требует точного указания основания счисления,
|
||
не допускает знаков плюс, пробелов, префиксов 0x и т.п.
|
||
from_chars requires an exact radix specification and does not allow plus
|
||
signs, spaces, 0x prefixes, etc.</span></span></td><td class="benchmarkresult">15.1</td><td class="benchmarkresult">12.5</td><td class="benchmarkresult">13.5</td><td class="benchmarkresult">13.8</td><td class="benchmarkresult">28.4</td></tr>
|
||
<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) {
|
||
int res = t. template to_int<int, true, 10, false, false>().value;
|
||
#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 заданы такие же ограничения - проверять переполнение,
|
||
десятичная система, без лидирующих пробелов и знака плюс
|
||
Here, to_int has the same restrictions: check for overflow,
|
||
decimal system, no leading spaces, and no plus sign.</span></span></td><td class="benchmarkresult">12.4</td><td class="benchmarkresult">8.24</td><td class="benchmarkresult">14.1</td><td class="benchmarkresult">15.7</td><td class="benchmarkresult">19.0</td></tr>
|
||
<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) {
|
||
int res = t. template to_int<int, true, 10, false, false>().value;
|
||
#ifdef CHECK_RESULT
|
||
if (res != c) {
|
||
state.SkipWithError("not equal");
|
||
break;
|
||
}
|
||
#endif
|
||
benchmark::DoNotOptimize(res);
|
||
benchmark::DoNotOptimize(t);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">12.2</td><td class="benchmarkresult">7.94</td><td class="benchmarkresult">13.5</td><td class="benchmarkresult">15.1</td><td class="benchmarkresult">17.3</td></tr>
|
||
<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) {
|
||
int res = t. template to_int<int, true, 10, false, false>().value;
|
||
#ifdef CHECK_RESULT
|
||
if (res != c) {
|
||
state.SkipWithError("not equal");
|
||
break;
|
||
}
|
||
#endif
|
||
benchmark::DoNotOptimize(res);
|
||
benchmark::DoNotOptimize(t);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">12.4</td><td class="benchmarkresult">8.34</td><td class="benchmarkresult">13.6</td><td class="benchmarkresult">16.1</td><td class="benchmarkresult">17.4</td></tr>
|
||
</tbody></table></div><script>bench_sets['Convert to int \'1234567\''] = {id:'bs14', tests:[
|
||
{name:'std::string s = "123456789"; int res = std::strtol(s.c_str(), 0, 10);',data:[27.5,27.4,30.8,32.2,69.5]},
|
||
{name:'std::string_view s = "123456789"; std::from_chars(s.data(), s.data() + s.size(), res, 10);',data:[15.1,12.5,13.5,13.8,28.4]},
|
||
{name:'stringa s = "123456789"; int res = s.to_int<int, true, 10, false>',data:[12.4,8.24,14.1,15.7,19.0]},
|
||
{name:'ssa s = "123456789"; int res = s.to_int<int, true, 10, false>',data:[12.2,7.94,13.5,15.1,17.3]},
|
||
{name:'lstringa<20> s = "123456789"; int res = s.to_int<int, true, 10, false>',data:[12.4,8.34,13.6,16.1,17.4]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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);
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">Всё то же, только для 16ричной системы
|
||
Everything is the same, only for the hexadecimal system</span></span></td><td class="benchmarkresult">24.1</td><td class="benchmarkresult">23.7</td><td class="benchmarkresult">33.5</td><td class="benchmarkresult">35.1</td><td class="benchmarkresult">54.6</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">9.60</td><td class="benchmarkresult">9.81</td><td class="benchmarkresult">8.14</td><td class="benchmarkresult">9.56</td><td class="benchmarkresult">30.6</td></tr>
|
||
<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) {
|
||
int res = t. template to_int<int, true, 16, false, false>().value;
|
||
#ifdef CHECK_RESULT
|
||
if (res != c) {
|
||
state.SkipWithError("not equal");
|
||
break;
|
||
}
|
||
#endif
|
||
benchmark::DoNotOptimize(res);
|
||
benchmark::DoNotOptimize(t);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">12.7</td><td class="benchmarkresult">8.30</td><td class="benchmarkresult">13.9</td><td class="benchmarkresult">13.5</td><td class="benchmarkresult">17.9</td></tr>
|
||
<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) {
|
||
int res = t. template to_int<int, true, 16, false, false>().value;
|
||
#ifdef CHECK_RESULT
|
||
if (res != c) {
|
||
state.SkipWithError("not equal");
|
||
break;
|
||
}
|
||
#endif
|
||
benchmark::DoNotOptimize(res);
|
||
benchmark::DoNotOptimize(t);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">13.1</td><td class="benchmarkresult">7.86</td><td class="benchmarkresult">12.6</td><td class="benchmarkresult">13.0</td><td class="benchmarkresult">16.8</td></tr>
|
||
<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) {
|
||
int res = t. template to_int<int, true, 16, false, false>().value;
|
||
#ifdef CHECK_RESULT
|
||
if (res != c) {
|
||
state.SkipWithError("not equal");
|
||
break;
|
||
}
|
||
#endif
|
||
benchmark::DoNotOptimize(res);
|
||
benchmark::DoNotOptimize(t);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">12.7</td><td class="benchmarkresult">8.11</td><td class="benchmarkresult">11.8</td><td class="benchmarkresult">13.3</td><td class="benchmarkresult">16.8</td></tr>
|
||
</tbody></table></div><script>bench_sets['Convert to unsigned \'abcDef\''] = {id:'bs15', tests:[
|
||
{name:'std::string s = "abcDef"; int res = std::strtol(s.c_str(), 0, 16);',data:[24.1,23.7,33.5,35.1,54.6]},
|
||
{name:'std::string_view s = "abcDef"; std::from_chars(s.data(), s.data() + s.size(), res, 16);',data:[9.60,9.81,8.14,9.56,30.6]},
|
||
{name:'stringa s = "abcDef"; int res = s.to_int<int, true, 16, false>',data:[12.7,8.30,13.9,13.5,17.9]},
|
||
{name:'ssa s = "abcDef"; int res = s.to_int<int, true, 16, false>',data:[13.1,7.86,12.6,13.0,16.8]},
|
||
{name:'lstringa<20> s = "abcDef"; int res = s.to_int<int, true, 16, false>',data:[12.7,8.11,11.8,13.3,16.8]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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);
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">А здесь уже парсинг произвольного числа.
|
||
And here we have parsing of an arbitrary number.</span></span></td><td class="benchmarkresult">28.9</td><td class="benchmarkresult">29.3</td><td class="benchmarkresult">43.6</td><td class="benchmarkresult">45.3</td><td class="benchmarkresult">74.6</td></tr>
|
||
<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) {
|
||
int res = t. template to_int<int>().value;
|
||
#ifdef CHECK_RESULT
|
||
if (res != c) {
|
||
state.SkipWithError("not equal");
|
||
break;
|
||
}
|
||
#endif
|
||
benchmark::DoNotOptimize(res);
|
||
benchmark::DoNotOptimize(t);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">18.4</td><td class="benchmarkresult">15.1</td><td class="benchmarkresult">18.2</td><td class="benchmarkresult">19.7</td><td class="benchmarkresult">25.4</td></tr>
|
||
<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) {
|
||
int res = t.to_int<int, false>().value;
|
||
#ifdef CHECK_RESULT
|
||
if (res != c) {
|
||
state.SkipWithError("not equal");
|
||
break;
|
||
}
|
||
#endif
|
||
benchmark::DoNotOptimize(res);
|
||
benchmark::DoNotOptimize(t);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">15.3</td><td class="benchmarkresult">10.8</td><td class="benchmarkresult">16.2</td><td class="benchmarkresult">17.7</td><td class="benchmarkresult">23.4</td></tr>
|
||
</tbody></table></div><script>bench_sets['Convert to int \' 1234567\''] = {id:'bs16', tests:[
|
||
{name:'std::string s = " 123456789"; int res = std::strtol(s.c_str(), 0, 0);',data:[28.9,29.3,43.6,45.3,74.6]},
|
||
{name:'stringa s = " 123456789"; int res = s.to_int<int>; // Check overflow',data:[18.4,15.1,18.2,19.7,25.4]},
|
||
{name:'ssa s = " 123456789"; int res = s.to_int<int, false>; // No check overflow',data:[15.3,10.8,16.2,17.7,23.4]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">65.7</td><td class="benchmarkresult">65.1</td><td class="benchmarkresult">98.3</td><td class="benchmarkresult">102</td><td class="benchmarkresult">200</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">24.6</td><td class="benchmarkresult">24.4</td><td class="benchmarkresult">59.2</td><td class="benchmarkresult">76.5</td><td class="benchmarkresult">111</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">26.1</td><td class="benchmarkresult">24.7</td><td class="benchmarkresult">35.1</td><td class="benchmarkresult">36.6</td><td class="benchmarkresult">43.1</td></tr>
|
||
</tbody></table></div><script>bench_sets['Convert to double \'1234.567e10\''] = {id:'bs17', tests:[
|
||
{name:'std::string s = "1234.567e10"; double res = std::strtod(s.c_str(), nullptr);',data:[65.7,65.1,98.3,102,200]},
|
||
{name:'std::string_view s = "1234.567e10"; std::from_chars(s.data(), s.data() + s.size(), res);',data:[24.6,24.4,59.2,76.5,111]},
|
||
{name:'ssa s = "1234.567e10"; double res = *s.to_double()',data:[26.1,24.7,35.1,36.6,43.1]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1354</td><td class="benchmarkresult">1395</td><td class="benchmarkresult">4661</td><td class="benchmarkresult">5705</td><td class="benchmarkresult">4383</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">372</td><td class="benchmarkresult">377</td><td class="benchmarkresult">1070</td><td class="benchmarkresult">1288</td><td class="benchmarkresult">587</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">361</td><td class="benchmarkresult">407</td><td class="benchmarkresult">736</td><td class="benchmarkresult">923</td><td class="benchmarkresult">704</td></tr>
|
||
<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">Чем больше внутренний буфер, тем меньше раз требуется
|
||
аллокация, тем быстрее результат.
|
||
The larger the internal buffer, the fewer allocations are
|
||
required, and the faster the result.</span></span></td><td class="benchmarkresult">272</td><td class="benchmarkresult">267</td><td class="benchmarkresult">396</td><td class="benchmarkresult">531</td><td class="benchmarkresult">569</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">228</td><td class="benchmarkresult">240</td><td class="benchmarkresult">234</td><td class="benchmarkresult">349</td><td class="benchmarkresult">516</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">136</td><td class="benchmarkresult">142</td><td class="benchmarkresult">155</td><td class="benchmarkresult">234</td><td class="benchmarkresult">403</td></tr>
|
||
</tbody></table></div><script>bench_sets['Append const literal of 16 bytes 64 times, 1024 total length'] = {id:'bs18', tests:[
|
||
{name:'std::stringstream str; ... str << "abbaabbaabbaabba";',data:[1354,1395,4661,5705,4383]},
|
||
{name:'std::string str; ... str += "abbaabbaabbaabba";',data:[372,377,1070,1288,587]},
|
||
{name:'lstringa<8> str; ... str += "abbaabbaabbaabba";',data:[361,407,736,923,704]},
|
||
{name:'lstringa<128> str; ... str += "abbaabbaabbaabba";',data:[272,267,396,531,569]},
|
||
{name:'lstringa<512> str; ... str += "abbaabbaabbaabba";',data:[228,240,234,349,516]},
|
||
{name:'lstringa<1024> str; ... str += "abbaabbaabbaabba";',data:[136,142,155,234,403]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1363</td><td class="benchmarkresult">1404</td><td class="benchmarkresult">4793</td><td class="benchmarkresult">5637</td><td class="benchmarkresult">4402</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1282</td><td class="benchmarkresult">1265</td><td class="benchmarkresult">3861</td><td class="benchmarkresult">3881</td><td class="benchmarkresult">1940</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">445</td><td class="benchmarkresult">442</td><td class="benchmarkresult">726</td><td class="benchmarkresult">839</td><td class="benchmarkresult">834</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">386</td><td class="benchmarkresult">376</td><td class="benchmarkresult">440</td><td class="benchmarkresult">533</td><td class="benchmarkresult">698</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">323</td><td class="benchmarkresult">316</td><td class="benchmarkresult">287</td><td class="benchmarkresult">387</td><td class="benchmarkresult">592</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">204</td><td class="benchmarkresult">247</td><td class="benchmarkresult">183</td><td class="benchmarkresult">285</td><td class="benchmarkresult">546</td></tr>
|
||
</tbody></table></div><script>bench_sets['Append string of 16 bytes and const literal of 16 bytes 32 times, 1024 total length'] = {id:'bs19', tests:[
|
||
{name:'std::stringstream str; ... str << str_var << "abbaabbaabbaabba";',data:[1363,1404,4793,5637,4402]},
|
||
{name:'std::string str; ... str += str_var + "abbaabbaabbaabba";',data:[1282,1265,3861,3881,1940]},
|
||
{name:'lstringa<8> str; ... str += str_var + "abbaabbaabbaabba";',data:[445,442,726,839,834]},
|
||
{name:'lstringa<128> str; ... str += str_var + "abbaabbaabbaabba";',data:[386,376,440,533,698]},
|
||
{name:'lstringa<512> str; ... str += str_var + "abbaabbaabbaabba";',data:[323,316,287,387,592]},
|
||
{name:'lstringa<1024> str; ... str += str_var + "abbaabbaabbaabba";',data:[204,247,183,285,546]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">76544</td><td class="benchmarkresult">75371</td><td class="benchmarkresult">221750</td><td class="benchmarkresult">274181</td><td class="benchmarkresult">227747</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">72458</td><td class="benchmarkresult">73091</td><td class="benchmarkresult">194313</td><td class="benchmarkresult">196295</td><td class="benchmarkresult">107590</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">19689</td><td class="benchmarkresult">20644</td><td class="benchmarkresult">17965</td><td class="benchmarkresult">23926</td><td class="benchmarkresult">39528</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">15956</td><td class="benchmarkresult">17277</td><td class="benchmarkresult">17021</td><td class="benchmarkresult">22113</td><td class="benchmarkresult">38289</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">15837</td><td class="benchmarkresult">17504</td><td class="benchmarkresult">16893</td><td class="benchmarkresult">23784</td><td class="benchmarkresult">39586</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">17811</td><td class="benchmarkresult">17482</td><td class="benchmarkresult">16257</td><td class="benchmarkresult">22963</td><td class="benchmarkresult">38827</td></tr>
|
||
</tbody></table></div><script>bench_sets['Append string of 16 bytes and const literal of 16 bytes 2048 times, 65536 total length'] = {id:'bs20', tests:[
|
||
{name:'std::stringstream str; ... str << str_var << "abbaabbaabbaabba"; 2048 times',data:[76544,75371,221750,274181,227747]},
|
||
{name:'std::string str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[72458,73091,194313,196295,107590]},
|
||
{name:'lstringa<8> str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[19689,20644,17965,23926,39528]},
|
||
{name:'lstringa<128> str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[15956,17277,17021,22113,38289]},
|
||
{name:'lstringa<512> str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[15837,17504,16893,23784,39586]},
|
||
{name:'lstringa<1024> str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[17811,17482,16257,22963,38827]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1397</td><td class="benchmarkresult">1414</td><td class="benchmarkresult">4399</td><td class="benchmarkresult">5373</td><td class="benchmarkresult">4714</td></tr>
|
||
<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;
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1354</td><td class="benchmarkresult">1409</td><td class="benchmarkresult">3920</td><td class="benchmarkresult">3964</td><td class="benchmarkresult">2421</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">524</td><td class="benchmarkresult">544</td><td class="benchmarkresult">817</td><td class="benchmarkresult">932</td><td class="benchmarkresult">1187</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">449</td><td class="benchmarkresult">433</td><td class="benchmarkresult">545</td><td class="benchmarkresult">597</td><td class="benchmarkresult">1062</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">385</td><td class="benchmarkresult">417</td><td class="benchmarkresult">381</td><td class="benchmarkresult">449</td><td class="benchmarkresult">907</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">305</td><td class="benchmarkresult">316</td><td class="benchmarkresult">284</td><td class="benchmarkresult">353</td><td class="benchmarkresult">856</td></tr>
|
||
</tbody></table></div><script>bench_sets['Append 2 string of 16 bytes 32 times, 1024 total length'] = {id:'bs21', tests:[
|
||
{name:'std::stringstream str; ... str << str_var1 << str_var2;',data:[1397,1414,4399,5373,4714]},
|
||
{name:'std::string str; ... str += str_var1 + str_var2;',data:[1354,1409,3920,3964,2421]},
|
||
{name:'lstringa<16> str; ... str += str_var1 + str_var2;',data:[524,544,817,932,1187]},
|
||
{name:'lstringa<128> str; ... str += str_var1 + str_var2;',data:[449,433,545,597,1062]},
|
||
{name:'lstringa<512> str; ... str += str_var1 + str_var2;',data:[385,417,381,449,907]},
|
||
{name:'lstringa<1024> str; ... str += str_var1 + str_var2;',data:[305,316,284,353,856]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">3102</td><td class="benchmarkresult">2998</td><td class="benchmarkresult">11067</td><td class="benchmarkresult">11252</td><td class="benchmarkresult">6369</td></tr>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">471</td><td class="benchmarkresult">456</td><td class="benchmarkresult">1078</td><td class="benchmarkresult">1222</td><td class="benchmarkresult">1655</td></tr>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1395</td><td class="benchmarkresult">1527</td><td class="benchmarkresult">2776</td><td class="benchmarkresult">2807</td><td class="benchmarkresult">2916</td></tr>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1205</td><td class="benchmarkresult">1266</td><td class="benchmarkresult">2001</td><td class="benchmarkresult">2421</td><td class="benchmarkresult">2078</td></tr>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">В simstr format с первого раза не помещается в такую строку без аллокации.
|
||
In simstr format, the first time it doesn't fit into such a
|
||
string without allocation.</span></span></td><td class="benchmarkresult">1377</td><td class="benchmarkresult">1633</td><td class="benchmarkresult">2076</td><td class="benchmarkresult">2671</td><td class="benchmarkresult">3396</td></tr>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">А в такую помещается. Используйте сразу буфера подходящего размера.
|
||
And it fits in this one. Use buffers of the appropriate size right away.</span></span></td><td class="benchmarkresult">979</td><td class="benchmarkresult">1117</td><td class="benchmarkresult">1004</td><td class="benchmarkresult">1531</td><td class="benchmarkresult">2581</td></tr>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">Результат не помещается в SSO, возникает аллокация.
|
||
The result does not fit into SSO, an allocation occurs.</span></span></td><td class="benchmarkresult">295</td><td class="benchmarkresult">313</td><td class="benchmarkresult">778</td><td class="benchmarkresult">880</td><td class="benchmarkresult">610</td></tr>
|
||
<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">А здесь и ниже - результат укладывается в SSO.
|
||
Ещё раз - используйте сразу буфера подходящего размера.
|
||
And here and below, the result fits within SSO.
|
||
Once again, use appropriately sized buffers from the start.</span></span></td><td class="benchmarkresult">152</td><td class="benchmarkresult">153</td><td class="benchmarkresult">154</td><td class="benchmarkresult">187</td><td class="benchmarkresult">342</td></tr>
|
||
<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 символов, что явно не хватает для размещения
|
||
результата, отсюда и такое время.
|
||
Under WASM, the SSO size is 15 characters, which is clearly not
|
||
enough to accommodate the result, hence the long time.</span></span></td><td class="benchmarkresult">150</td><td class="benchmarkresult">162</td><td class="benchmarkresult">152</td><td class="benchmarkresult">236</td><td class="benchmarkresult">562</td></tr>
|
||
</tbody></table></div><script>bench_sets['Append text, number, text'] = {id:'bs22', tests:[
|
||
{name:'std::stringstream str; str << "test = " << k << " times";',data:[3102,2998,11067,11252,6369]},
|
||
{name:'std::string str = "test = " + std::to_string(k) + " times";',data:[471,456,1078,1222,1655]},
|
||
{name:'char buf[100]; sprintf(buf, "test = %u times", k); std::string str = buf;',data:[1395,1527,2776,2807,2916]},
|
||
{name:'std::string str = std::format("test = {} times", k);',data:[1205,1266,2001,2421,2078]},
|
||
{name:'lstringa<8> str; str.format("test = {} times", k);',data:[1377,1633,2076,2671,3396]},
|
||
{name:'lstringa<32> str; str.format("test = {} times", k);',data:[979,1117,1004,1531,2581]},
|
||
{name:'lstringa<8> str = "test = " + k + " times";',data:[295,313,778,880,610]},
|
||
{name:'lstringa<32> str = "test = " + k + " times";',data:[152,153,154,187,342]},
|
||
{name:'stringa str = "test = " + k + " times";',data:[150,162,152,236,562]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">270</td><td class="benchmarkresult">273</td><td class="benchmarkresult">546</td><td class="benchmarkresult">550</td><td class="benchmarkresult">651</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">154</td><td class="benchmarkresult">135</td><td class="benchmarkresult">170</td><td class="benchmarkresult">303</td><td class="benchmarkresult">279</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">212</td><td class="benchmarkresult">131</td><td class="benchmarkresult">188</td><td class="benchmarkresult">217</td><td class="benchmarkresult">346</td></tr>
|
||
</tbody></table></div><script>bench_sets['Split text and convert to int'] = {id:'bs23', tests:[
|
||
{name:'std::string::find + substr + std::strtol',data:[270,273,546,550,651]},
|
||
{name:'ssa::splitter + ssa::as_int',data:[154,135,170,303,279]},
|
||
{name:'ssa::splitf + functor',data:[212,131,188,217,346]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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'. Но если замены не конфликтуют,
|
||
то работает быстро.
|
||
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,
|
||
it works quickly.</span></span></td><td class="benchmarkresult">865</td><td class="benchmarkresult">852</td><td class="benchmarkresult">1153</td><td class="benchmarkresult">1298</td><td class="benchmarkresult">3588</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">Дальше уже правильные реализации, не зависящие от конфликтующих замен.
|
||
Further, there are correct implementations that do not depend on
|
||
conflicting replacements.</span></span></td><td class="benchmarkresult">2400</td><td class="benchmarkresult">2378</td><td class="benchmarkresult">2047</td><td class="benchmarkresult">2231</td><td class="benchmarkresult">4762</td></tr>
|
||
<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"
|
||
;
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1100</td><td class="benchmarkresult">1037</td><td class="benchmarkresult">2300</td><td class="benchmarkresult">2520</td><td class="benchmarkresult">3410</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1290</td><td class="benchmarkresult">1465</td><td class="benchmarkresult">1434</td><td class="benchmarkresult">1580</td><td class="benchmarkresult">3466</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1039</td><td class="benchmarkresult">1035</td><td class="benchmarkresult">1349</td><td class="benchmarkresult">1389</td><td class="benchmarkresult">3059</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1034</td><td class="benchmarkresult">1231</td><td class="benchmarkresult">1146</td><td class="benchmarkresult">1283</td><td class="benchmarkresult">2820</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">892</td><td class="benchmarkresult">919</td><td class="benchmarkresult">1213</td><td class="benchmarkresult">1242</td><td class="benchmarkresult">2715</td></tr>
|
||
</tbody></table></div><script>bench_sets['Replace symbols in text ~400 symbols'] = {id:'bs24', tests:[
|
||
{name:'Naive (and wrong) replace symbols with std::string find + replace',data:[865,852,1153,1298,3588]},
|
||
{name:'replace symbols with std::string find_first_of + replace',data:[2400,2378,2047,2231,4762]},
|
||
{name:'replace symbols with std::string_view find_first_of + copy',data:[1100,1037,2300,2520,3410]},
|
||
{name:'replace runtime symbols with string expressions and without remembering all search results',data:[1290,1465,1434,1580,3466]},
|
||
{name:'replace runtime symbols with simstr and memorization of all search results',data:[1039,1035,1349,1389,3059]},
|
||
{name:'replace const symbols with string expressions and without remembering all search results',data:[1034,1231,1146,1283,2820]},
|
||
{name:'replace const symbols with string expressions and memorization of all search results',data:[892,919,1213,1242,2715]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">156</td><td class="benchmarkresult">159</td><td class="benchmarkresult">314</td><td class="benchmarkresult">339</td><td class="benchmarkresult">475</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">343</td><td class="benchmarkresult">319</td><td class="benchmarkresult">369</td><td class="benchmarkresult">431</td><td class="benchmarkresult">518</td></tr>
|
||
<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 >"
|
||
;
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">167</td><td class="benchmarkresult">166</td><td class="benchmarkresult">322</td><td class="benchmarkresult">357</td><td class="benchmarkresult">391</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">191</td><td class="benchmarkresult">196</td><td class="benchmarkresult">258</td><td class="benchmarkresult">315</td><td class="benchmarkresult">397</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">185</td><td class="benchmarkresult">211</td><td class="benchmarkresult">344</td><td class="benchmarkresult">393</td><td class="benchmarkresult">405</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">132</td><td class="benchmarkresult">153</td><td class="benchmarkresult">213</td><td class="benchmarkresult">253</td><td class="benchmarkresult">250</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">149</td><td class="benchmarkresult">146</td><td class="benchmarkresult">303</td><td class="benchmarkresult">359</td><td class="benchmarkresult">297</td></tr>
|
||
</tbody></table></div><script>bench_sets['Replace symbols in text ~40 symbols'] = {id:'bs25', tests:[
|
||
{name:'Short Naive (and wrong) replace symbols with std::string find + replace',data:[156,159,314,339,475]},
|
||
{name:'Short replace symbols with std::string find_first_of + replace',data:[343,319,369,431,518]},
|
||
{name:'Short replace symbols with std::string_view find_first_of + copy',data:[167,166,322,357,391]},
|
||
{name:'Short replace runtime symbols with string expressions and without remembering all search results',data:[191,196,258,315,397]},
|
||
{name:'Short replace runtime symbols with simstr and memorization of all search results',data:[185,211,344,393,405]},
|
||
{name:'Short replace const symbols with string expressions and without remembering all search results',data:[132,153,213,253,250]},
|
||
{name:'Short replace const symbols with string expressions and memorization of all search results',data:[149,146,303,359,297]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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;
|
||
}
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">161</td><td class="benchmarkresult">172</td><td class="benchmarkresult">227</td><td class="benchmarkresult">251</td><td class="benchmarkresult">382</td></tr>
|
||
<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;
|
||
}
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">543</td><td class="benchmarkresult">510</td><td class="benchmarkresult">765</td><td class="benchmarkresult">825</td><td class="benchmarkresult">1410</td></tr>
|
||
<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;
|
||
}
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1041</td><td class="benchmarkresult">989</td><td class="benchmarkresult">1465</td><td class="benchmarkresult">1501</td><td class="benchmarkresult">2725</td></tr>
|
||
<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;
|
||
}
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">2329</td><td class="benchmarkresult">2308</td><td class="benchmarkresult">3193</td><td class="benchmarkresult">3319</td><td class="benchmarkresult">5829</td></tr>
|
||
<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;
|
||
}
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">5815</td><td class="benchmarkresult">5824</td><td class="benchmarkresult">7883</td><td class="benchmarkresult">8393</td><td class="benchmarkresult">12920</td></tr>
|
||
<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";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">143</td><td class="benchmarkresult">161</td><td class="benchmarkresult">320</td><td class="benchmarkresult">330</td><td class="benchmarkresult">339</td></tr>
|
||
<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";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">439</td><td class="benchmarkresult">462</td><td class="benchmarkresult">629</td><td class="benchmarkresult">692</td><td class="benchmarkresult">1065</td></tr>
|
||
<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";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">833</td><td class="benchmarkresult">882</td><td class="benchmarkresult">1065</td><td class="benchmarkresult">1154</td><td class="benchmarkresult">1968</td></tr>
|
||
<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";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1669</td><td class="benchmarkresult">1827</td><td class="benchmarkresult">1907</td><td class="benchmarkresult">2102</td><td class="benchmarkresult">3761</td></tr>
|
||
<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";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">3123</td><td class="benchmarkresult">3363</td><td class="benchmarkresult">3579</td><td class="benchmarkresult">3939</td><td class="benchmarkresult">7335</td></tr>
|
||
<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";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">98.9</td><td class="benchmarkresult">104</td><td class="benchmarkresult">172</td><td class="benchmarkresult">209</td><td class="benchmarkresult">220</td></tr>
|
||
<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";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">300</td><td class="benchmarkresult">299</td><td class="benchmarkresult">377</td><td class="benchmarkresult">485</td><td class="benchmarkresult">738</td></tr>
|
||
<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";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">706</td><td class="benchmarkresult">733</td><td class="benchmarkresult">813</td><td class="benchmarkresult">1086</td><td class="benchmarkresult">1733</td></tr>
|
||
<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";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1511</td><td class="benchmarkresult">1625</td><td class="benchmarkresult">1637</td><td class="benchmarkresult">2232</td><td class="benchmarkresult">3695</td></tr>
|
||
<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";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">3078</td><td class="benchmarkresult">3339</td><td class="benchmarkresult">3090</td><td class="benchmarkresult">4615</td><td class="benchmarkresult">7436</td></tr>
|
||
</tbody></table></div><script>bench_sets['Replace All Str To Longer Size'] = {id:'bs26', tests:[
|
||
{name:'replace bb to ---- in std::string|64',data:[161,172,227,251,382]},
|
||
{name:'replace bb to ---- in std::string|256',data:[543,510,765,825,1410]},
|
||
{name:'replace bb to ---- in std::string|512',data:[1041,989,1465,1501,2725]},
|
||
{name:'replace bb to ---- in std::string|1024',data:[2329,2308,3193,3319,5829]},
|
||
{name:'replace bb to ---- in std::string|2048',data:[5815,5824,7883,8393,12920]},
|
||
{name:'replace bb to ---- in lstringa<8>|64',data:[143,161,320,330,339]},
|
||
{name:'replace bb to ---- in lstringa<8>|256',data:[439,462,629,692,1065]},
|
||
{name:'replace bb to ---- in lstringa<8>|512',data:[833,882,1065,1154,1968]},
|
||
{name:'replace bb to ---- in lstringa<8>|1024',data:[1669,1827,1907,2102,3761]},
|
||
{name:'replace bb to ---- in lstringa<8>|2048',data:[3123,3363,3579,3939,7335]},
|
||
{name:'replace bb to ---- by init stringa|64',data:[98.9,104,172,209,220]},
|
||
{name:'replace bb to ---- by init stringa|256',data:[300,299,377,485,738]},
|
||
{name:'replace bb to ---- by init stringa|512',data:[706,733,813,1086,1733]},
|
||
{name:'replace bb to ---- by init stringa|1024',data:[1511,1625,1637,2232,3695]},
|
||
{name:'replace bb to ---- by init stringa|2048',data:[3078,3339,3090,4615,7436]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">121</td><td class="benchmarkresult">115</td><td class="benchmarkresult">190</td><td class="benchmarkresult">209</td><td class="benchmarkresult">270</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">411</td><td class="benchmarkresult">367</td><td class="benchmarkresult">468</td><td class="benchmarkresult">553</td><td class="benchmarkresult">1011</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">759</td><td class="benchmarkresult">733</td><td class="benchmarkresult">842</td><td class="benchmarkresult">975</td><td class="benchmarkresult">1878</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1460</td><td class="benchmarkresult">1409</td><td class="benchmarkresult">1614</td><td class="benchmarkresult">1826</td><td class="benchmarkresult">3626</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">3052</td><td class="benchmarkresult">2902</td><td class="benchmarkresult">3157</td><td class="benchmarkresult">3547</td><td class="benchmarkresult">7194</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">99.0</td><td class="benchmarkresult">103</td><td class="benchmarkresult">185</td><td class="benchmarkresult">189</td><td class="benchmarkresult">222</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">300</td><td class="benchmarkresult">299</td><td class="benchmarkresult">435</td><td class="benchmarkresult">470</td><td class="benchmarkresult">775</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">552</td><td class="benchmarkresult">548</td><td class="benchmarkresult">763</td><td class="benchmarkresult">807</td><td class="benchmarkresult">1461</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1147</td><td class="benchmarkresult">1133</td><td class="benchmarkresult">1404</td><td class="benchmarkresult">1515</td><td class="benchmarkresult">2776</td></tr>
|
||
<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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">2183</td><td class="benchmarkresult">2150</td><td class="benchmarkresult">2741</td><td class="benchmarkresult">2967</td><td class="benchmarkresult">5522</td></tr>
|
||
<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 = "--";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">82.4</td><td class="benchmarkresult">93.9</td><td class="benchmarkresult">162</td><td class="benchmarkresult">179</td><td class="benchmarkresult">180</td></tr>
|
||
<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 = "--";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">244</td><td class="benchmarkresult">275</td><td class="benchmarkresult">357</td><td class="benchmarkresult">392</td><td class="benchmarkresult">646</td></tr>
|
||
<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 = "--";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">444</td><td class="benchmarkresult">498</td><td class="benchmarkresult">580</td><td class="benchmarkresult">642</td><td class="benchmarkresult">1220</td></tr>
|
||
<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 = "--";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">886</td><td class="benchmarkresult">1033</td><td class="benchmarkresult">1091</td><td class="benchmarkresult">1151</td><td class="benchmarkresult">2371</td></tr>
|
||
<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 = "--";
|
||
|
||
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);
|
||
}
|
||
}</span></span></td><td></td><td class="benchmarkresult">1707</td><td class="benchmarkresult">1981</td><td class="benchmarkresult">1998</td><td class="benchmarkresult">2264</td><td class="benchmarkresult">4604</td></tr>
|
||
</tbody></table></div><script>bench_sets['Replace All Str To Same Size'] = {id:'bs27', tests:[
|
||
{name:'replace bb to -- in std::string|64',data:[121,115,190,209,270]},
|
||
{name:'replace bb to -- in std::string|256',data:[411,367,468,553,1011]},
|
||
{name:'replace bb to -- in std::string|512',data:[759,733,842,975,1878]},
|
||
{name:'replace bb to -- in std::string|1024',data:[1460,1409,1614,1826,3626]},
|
||
{name:'replace bb to -- in std::string|2048',data:[3052,2902,3157,3547,7194]},
|
||
{name:'replace bb to -- in lstringa<8>|64',data:[99.0,103,185,189,222]},
|
||
{name:'replace bb to -- in lstringa<8>|256',data:[300,299,435,470,775]},
|
||
{name:'replace bb to -- in lstringa<8>|512',data:[552,548,763,807,1461]},
|
||
{name:'replace bb to -- in lstringa<8>|1024',data:[1147,1133,1404,1515,2776]},
|
||
{name:'replace bb to -- in lstringa<8>|2048',data:[2183,2150,2741,2967,5522]},
|
||
{name:'replace bb to -- by init stringa|64',data:[82.4,93.9,162,179,180]},
|
||
{name:'replace bb to -- by init stringa|256',data:[244,275,357,392,646]},
|
||
{name:'replace bb to -- by init stringa|512',data:[444,498,580,642,1220]},
|
||
{name:'replace bb to -- by init stringa|1024',data:[886,1033,1091,1151,2371]},
|
||
{name:'replace bb to -- by init stringa|2048',data:[1707,1981,1998,2264,4604]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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
|
||
символов, а потом ищем их в ней
|
||
We insert 10,000 strings of length from 30 to 50 characters into
|
||
hashStrMapA, and then search for them in it.</span></span></td><td class="benchmarkresult">3625242</td><td class="benchmarkresult">3750693</td><td class="benchmarkresult">3693883</td><td class="benchmarkresult">4203983</td><td class="benchmarkresult">3162304</td></tr>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">То же самое c std::string и std::unordered_map
|
||
Same thing with std::string and std::unordered_map</span></span></td><td class="benchmarkresult">3517784</td><td class="benchmarkresult">3625926</td><td class="benchmarkresult">5258881</td><td class="benchmarkresult">5344121</td><td class="benchmarkresult">3370915</td></tr>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">Теперь вставляем stringa, а ищем ssa
|
||
Now we insert stringa and search for ssa</span></span></td><td class="benchmarkresult">3618716</td><td class="benchmarkresult">3687972</td><td class="benchmarkresult">3418166</td><td class="benchmarkresult">4011248</td><td class="benchmarkresult">3151333</td></tr>
|
||
<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);
|
||
}
|
||
}
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">Вставляем std::string, а ищем std::string_view
|
||
We insert std::string and look for std::string_view</span></span></td><td class="benchmarkresult">4166457</td><td class="benchmarkresult">3937773</td><td class="benchmarkresult">6295014</td><td class="benchmarkresult">6304499</td><td class="benchmarkresult">3797453</td></tr>
|
||
</tbody></table></div><script>bench_sets['Hash Map insert and find'] = {id:'bs28', tests:[
|
||
{name:'hashStrMapA<size_t> emplace & find stringa;',data:[3625242,3750693,3693883,4203983,3162304]},
|
||
{name:'std::unordered_map<std::string, size_t> emplace & find std::string;',data:[3517784,3625926,5258881,5344121,3370915]},
|
||
{name:'hashStrMapA<size_t> emplace & find ssa;',data:[3618716,3687972,3418166,4011248,3151333]},
|
||
{name:'std::unordered_map<std::string, size_t> emplace & find std::string_view;',data:[4166457,3937773,6295014,6304499,3797453]}
|
||
]}</script>
|
||
|
||
<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>
|
||
<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">Обыденная задача, подобные часто могут встретится в работе:
|
||
По неким данным сгенерировать текст. В этом случае по данным
|
||
о неких функциях сформировать их полное имя с типами параметров и
|
||
возвращаемого значения. Алгоритм на 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
|
||
return values. The algorithm uses std::string.</span></span></td><td class="benchmarkresult">708</td><td class="benchmarkresult">966</td><td class="benchmarkresult">1533</td><td class="benchmarkresult">1645</td><td class="benchmarkresult">2652</td></tr>
|
||
<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">Почти тот же алгоритм, но несколько последовательных
|
||
+= к строке заменены на одно += + + +.
|
||
Almost the same algorithm, but several consecutive
|
||
+= to a string are replaced with a single += + + +.</span></span></td><td class="benchmarkresult">846</td><td class="benchmarkresult">1010</td><td class="benchmarkresult">1602</td><td class="benchmarkresult">1711</td><td class="benchmarkresult">2955</td></tr>
|
||
<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();
|
||
}</span></span></td><td><span class="tooltip info"> >> <span class="tooltiptext">Строим имя функции через std::ostringstream и <<
|
||
We construct the function name through std::ostringstream and <<</span></span></td><td class="benchmarkresult">2571</td><td class="benchmarkresult">2613</td><td class="benchmarkresult">8228</td><td class="benchmarkresult">10110</td><td class="benchmarkresult">6584</td></tr>
|
||
<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 строках и строковых выражениях.
|
||
Инфа о параметрах добавляется в текущую строку
|
||
Implementation using simstr strings and string expressions.
|
||
Parameter information is appended to the current line.</span></span></td><td class="benchmarkresult">508</td><td class="benchmarkresult">465</td><td class="benchmarkresult">818</td><td class="benchmarkresult">924</td><td class="benchmarkresult">1274</td></tr>
|
||
<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 строках и строковых выражениях.
|
||
Инфа о параметрах добавляется во временную строку, а потом
|
||
разом добавляется в текущую строку. Позволяет операции в цикле
|
||
записать в одну строку, но чуть проигрывает по времени выполнения.
|
||
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
|
||
to be written in a single string, but is slightly slower in execution time.</span></span></td><td class="benchmarkresult">648</td><td class="benchmarkresult">682</td><td class="benchmarkresult">959</td><td class="benchmarkresult">1020</td><td class="benchmarkresult">1576</td></tr>
|
||
</tbody></table></div><script>bench_sets['Build Full Func Name'] = {id:'bs29', tests:[
|
||
{name:'Build func full name std::string;',data:[708,966,1533,1645,2652]},
|
||
{name:'Build func full name std::string 1;',data:[846,1010,1602,1711,2955]},
|
||
{name:'Build func full name std::stream;',data:[2571,2613,8228,10110,6584]},
|
||
{name:'Build func full name stringa;',data:[508,465,818,924,1274]},
|
||
{name:'Build func full name stringa 1;',data:[648,682,959,1020,1576]}
|
||
]}</script></body></html> |