aorefkov
/
simstr
mirror of https://github.com/orefkov/simstr.git
0
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
simstr/bench/results.html

4302 lines
288 KiB
HTML
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

<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>
<div style="font-size:16pt;margin:20px;text-align:center"><a href="https://github.com/orefkov/simstr">simstr</a> is a powerful and convenient library for productive work with strings in C++.</div>
<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.37, 0.74, 0.51
***WARNING*** ASLR is enabled, the results may have unreproducible noise in them.</span></span>&nbsp;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.05, 0.01, 0.00
***WARNING*** ASLR is enabled, the results may have unreproducible noise in them.</span></span>&nbsp;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>&nbsp;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>&nbsp;Include in charts: <input type="checkbox" id="pl3" checked onchange="buildCharts()"/></li>
<li><span class="platform">Xeon E5-2682 v4, WASM Chrome 143, Clang-21</span><span class="tooltip">32 X 2513.96 MHz CPU s<span class="tooltiptext">Chrome/143.0.0.0 webasm</span></span>&nbsp;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 Chrome 143, Clang-21'];</script>
<div class="benchset" id="bs1"><h4><a id="bs70109915512075798510" href="#bs70109915512075798510">#</a>&nbsp;Concatenate string + Number + &quot;Literal&quot;</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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L54">Concat std::string and number by std to std::string</a><span class="tooltiptext code">void ConcatStdToStd(benchmark::State&amp; state) {
std::string s1 = &quot;start &quot;;
for (auto _: state) {
for (int i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
std::string str = s1 + std::to_string(i) + &quot; end&quot;;
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">216</td><td class="benchmarkresult">197</td><td class="benchmarkresult">259</td><td class="benchmarkresult">326</td><td class="benchmarkresult">950</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L65">Concat std::string and number by StrExpr to std::string</a><span class="tooltiptext code">void ConcatSimToStd(benchmark::State&amp; state) {
std::string s1 = &quot;start &quot;;
for (auto _: state) {
for (int i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
std::string str = +s1 + i + &quot; end&quot;;
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">99.5</td><td class="benchmarkresult">101</td><td class="benchmarkresult">157</td><td class="benchmarkresult">208</td><td class="benchmarkresult">486</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L76">Concat stringa and number by StrExpr to simstr::stringa</a><span class="tooltiptext code">void ConcatSimToSim(benchmark::State&amp; state) {
stra s1 = &quot;start &quot;;
for (auto _: state) {
for (int i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
stringa str = s1 + i + &quot; end&quot;;
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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">62.5</td><td class="benchmarkresult">68.9</td><td class="benchmarkresult">66.5</td><td class="benchmarkresult">106</td><td class="benchmarkresult">216</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L87">Concat stringa and number by e_concat to simstr::stringa</a><span class="tooltiptext code">void ConcatSimToSimConcat(benchmark::State&amp; state) {
stra s1 = &quot;start &quot;;
for (auto _: state) {
for (int i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
stringa str = e_concat(&quot;&quot;, s1, i, &quot; end&quot;);
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">67.1</td><td class="benchmarkresult">74.0</td><td class="benchmarkresult">75.8</td><td class="benchmarkresult">118</td><td class="benchmarkresult">202</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:[216,197,259,326,950]},
{name:'Concat std::string and number by StrExpr to std::string',data:[99.5,101,157,208,486]},
{name:'Concat stringa and number by StrExpr to simstr::stringa',data:[62.5,68.9,66.5,106,216]},
{name:'Concat stringa and number by e_concat to simstr::stringa',data:[67.1,74.0,75.8,118,202]}
]}</script>
<div class="benchset" id="bs2"><h4><a id="bs146911715078927772520" href="#bs146911715078927772520">#</a>&nbsp;Concatenate string + Hex Number + &quot;Literal&quot;</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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L104">Concat std::string and format hex number and literal to std::string</a><span class="tooltiptext code">void ConcatStdToFmtHex(benchmark::State&amp; 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 = &quot;art &quot;;
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
// It is not worked for char8_t, char16_t, char32_t :(
std::string str = s1 + std::format(&quot;{:#x}&quot;, i) + &quot; end&quot;;
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">637</td><td class="benchmarkresult">628</td><td class="benchmarkresult">692</td><td class="benchmarkresult">1008</td><td class="benchmarkresult">2042</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L117">std::format std::string and hex number by literal to std::string</a><span class="tooltiptext code">void ConcatAllFmtToHex(benchmark::State&amp; 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 = &quot;art &quot;;
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
// It is not worked for char8_t, char16_t, char32_t :(
std::string str = std::format(&quot;{}{:#x} end&quot;, s1, i);
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">824</td><td class="benchmarkresult">889</td><td class="benchmarkresult">2290</td><td class="benchmarkresult">1794</td><td class="benchmarkresult">2683</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L129">Concat std::string and std::to_chars and string to std::string</a><span class="tooltiptext code">void ConcatStdToCharsHex(benchmark::State&amp; 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 = &quot;art &quot;;
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
// it worked only for char :(
char buf[40];
size_t len = std::to_chars(buf, buf + std::size(buf), i, 16).ptr - buf;
std::string str = s1 + &quot;0x&quot; + std::string(buf, len) + &quot; end&quot;;
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">196</td><td class="benchmarkresult">180</td><td class="benchmarkresult">188</td><td class="benchmarkresult">244</td><td class="benchmarkresult">623</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L144">Concat std::string and hex number and literal by StrExpr to std::string</a><span class="tooltiptext code">void ConcatSimToStdHex(benchmark::State&amp; 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 = &quot;art &quot;;
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
// Can work for all types of symbols
std::string str = +s1 + i / 1_f16 + &quot; end&quot;;
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">130</td><td class="benchmarkresult">120</td><td class="benchmarkresult">77.9</td><td class="benchmarkresult">113</td><td class="benchmarkresult">461</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L157">Concat stringa and hex number and literal by StrExpr to simstr::stringa</a><span class="tooltiptext code">void ConcatSimToSimHex(benchmark::State&amp; state) {
// stringa SSO buffer is 23, but we use a short string to compare under the same conditions
stra s1 = &quot;art &quot;;
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
// Can work for all types of symbols
stringa str = s1 + i / 1_f16 + &quot; end&quot;;
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">114</td><td class="benchmarkresult">119</td><td class="benchmarkresult">69.8</td><td class="benchmarkresult">98.4</td><td class="benchmarkresult">186</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L170">Concat stringa and hex number and literal by e_concat to simstr::stringa</a><span class="tooltiptext code">void ConcatSimToSimHexC(benchmark::State&amp; state) {
// stringa SSO buffer is 23, but we use a short string to compare under the same conditions
stra s1 = &quot;art &quot;;
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
// Can work for all types of symbols
stringa str = e_concat(&quot;&quot;, s1, i / 1_f16, &quot; end&quot;);
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">121</td><td class="benchmarkresult">124</td><td class="benchmarkresult">92.6</td><td class="benchmarkresult">99.4</td><td class="benchmarkresult">209</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L183">Subst stringa and hex number by e_subst literal to simstr::stringa</a><span class="tooltiptext code">void ConcatSimToSimHexS(benchmark::State&amp; state) {
// stringa SSO buffer is 23, but we use a short string to compare under the same conditions
stra s1 = &quot;art &quot;;
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
stringa str = e_subst(&quot;{}{} end&quot;, s1, i / 1_f16);
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">183</td><td class="benchmarkresult">172</td><td class="benchmarkresult">153</td><td class="benchmarkresult">178</td><td class="benchmarkresult">366</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L195">Subst stringa and hex number by e_vsubst stra to simstr::stringa</a><span class="tooltiptext code">void ConcatSimToSimHexVS(benchmark::State&amp; state) {
// stringa SSO buffer is 23, but we use a short string to compare under the same conditions
stra s1 = &quot;art &quot;;
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
stringa str = e_vsubst(&quot;{}{} end&quot;_ss, s1, i / 1_f16);
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">297</td><td class="benchmarkresult">317</td><td class="benchmarkresult">274</td><td class="benchmarkresult">352</td><td class="benchmarkresult">911</td></tr>
</tbody></table></div><script>bench_sets['Concatenate string + Hex Number + "Literal"'] = {id:'bs2', tests:[
{name:'Concat std::string and format hex number and literal to std::string',data:[637,628,692,1008,2042]},
{name:'std::format std::string and hex number by literal to std::string',data:[824,889,2290,1794,2683]},
{name:'Concat std::string and std::to_chars and string to std::string',data:[196,180,188,244,623]},
{name:'Concat std::string and hex number and literal by StrExpr to std::string',data:[130,120,77.9,113,461]},
{name:'Concat stringa and hex number and literal by StrExpr to simstr::stringa',data:[114,119,69.8,98.4,186]},
{name:'Concat stringa and hex number and literal by e_concat to simstr::stringa',data:[121,124,92.6,99.4,209]},
{name:'Subst stringa and hex number by e_subst literal to simstr::stringa',data:[183,172,153,178,366]},
{name:'Subst stringa and hex number by e_vsubst stra to simstr::stringa',data:[297,317,274,352,911]}
]}</script>
<div class="benchset" id="bs3"><h4><a id="bs32341904136562619220" href="#bs32341904136562619220">#</a>&nbsp;format/vformat and subst/vsubst octal number to 32 symbols result</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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L217">&quot;abcdefghihklmopqr &quot;_ss + i / 0x8a010_fmt + &quot; end&quot;</a><span class="tooltiptext code">void ConcatSimToSimOct(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
stringa str = &quot;abcdefghihklmopqr &quot;_ss + i / 0x8a010_fmt + &quot; end&quot;;
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">264</td><td class="benchmarkresult">249</td><td class="benchmarkresult">639</td><td class="benchmarkresult">667</td><td class="benchmarkresult">438</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L226">e_subst(&quot;abcdefghihklmopqr {} end&quot;, i / 0x8a010_fmt)</a><span class="tooltiptext code">void SubstSimToSimOct(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
stringa str = e_subst(&quot;abcdefghihklmopqr {} end&quot;, i / 0x8a010_fmt);
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">342</td><td class="benchmarkresult">323</td><td class="benchmarkresult">743</td><td class="benchmarkresult">764</td><td class="benchmarkresult">567</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L235">e_vsubst(pattern, i / 0x8a010_fmt)</a><span class="tooltiptext code">void VSubstSimToSimOct(benchmark::State&amp; state) {
ssa pattern = &quot;abcdefghihklmopqr {} end&quot;;
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
stringa str = e_vsubst(pattern, i / 0x8a010_fmt);
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">614</td><td class="benchmarkresult">577</td><td class="benchmarkresult">1071</td><td class="benchmarkresult">1073</td><td class="benchmarkresult">1418</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L275">fmt::format(FMT_COMPILE(&quot;abcdefghihklmopqr {:#010o} end&quot;), i)</a><span class="tooltiptext code">void FmtFormatComp(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
std::string str = fmt::format(FMT_COMPILE(&quot;abcdefghihklmopqr {:#010o} end&quot;), i);
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">680</td><td class="benchmarkresult">703</td><td class="benchmarkresult">1380</td><td class="benchmarkresult">1539</td><td class="benchmarkresult">2080</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L284">fmt::format(&quot;abcdefghihklmopqr {:#010o} end&quot;, i)</a><span class="tooltiptext code">void FmtFormat(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
std::string str = fmt::format(&quot;abcdefghihklmopqr {:#010o} end&quot;, i);
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">793</td><td class="benchmarkresult">788</td><td class="benchmarkresult">1278</td><td class="benchmarkresult">1393</td><td class="benchmarkresult">2889</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L245">std::format(&quot;abcdefghihklmopqr {:#010o} end&quot;, i)</a><span class="tooltiptext code">void FormatStdToStdOct(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
std::string str = std::format(&quot;abcdefghihklmopqr {:#010o} end&quot;, i);
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">974</td><td class="benchmarkresult">1198</td><td class="benchmarkresult">1519</td><td class="benchmarkresult">1908</td><td class="benchmarkresult">2983</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L254">std::vformat(pattern, std::make_format_args(i))</a><span class="tooltiptext code">void VFormatStdToStdOct(benchmark::State&amp; state) {
std::string_view pattern = &quot;abcdefghihklmopqr {:#010o} end&quot;;
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
std::string str = std::vformat(pattern, std::make_format_args(i));
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">933</td><td class="benchmarkresult">1065</td><td class="benchmarkresult">1511</td><td class="benchmarkresult">1886</td><td class="benchmarkresult">3007</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L264">strm &lt;&lt; &quot;abcdefghihklmopqr 0&quot; &lt;&lt; std::oct &lt;&lt; std::setw(9) &lt;&lt; std::setfill(&#39;0&#39;) &lt;&lt; i &lt;&lt; &quot; end&quot;</a><span class="tooltiptext code">void StreamStdToStdOct(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned i = 1; i &lt;= 100&#39;000; i *= 10) {
std::stringstream strm;
strm &lt;&lt; &quot;abcdefghihklmopqr 0&quot; &lt;&lt; std::oct &lt;&lt; std::setw(9) &lt;&lt; std::setfill(&#39;0&#39;) &lt;&lt; i &lt;&lt; &quot; end&quot;;
std::string str = strm.str();
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">2845</td><td class="benchmarkresult">2059</td><td class="benchmarkresult">6385</td><td class="benchmarkresult">7102</td><td class="benchmarkresult">8384</td></tr>
</tbody></table></div><script>bench_sets['format/vformat and subst/vsubst octal number to 32 symbols result'] = {id:'bs3', tests:[
{name:'"abcdefghihklmopqr "_ss + i / 0x8a010_fmt + " end"',data:[264,249,639,667,438]},
{name:'e_subst("abcdefghihklmopqr {} end", i / 0x8a010_fmt)',data:[342,323,743,764,567]},
{name:'e_vsubst(pattern, i / 0x8a010_fmt)',data:[614,577,1071,1073,1418]},
{name:'fmt::format(FMT_COMPILE("abcdefghihklmopqr {:#010o} end"), i)',data:[680,703,1380,1539,2080]},
{name:'fmt::format("abcdefghihklmopqr {:#010o} end", i)',data:[793,788,1278,1393,2889]},
{name:'std::format("abcdefghihklmopqr {:#010o} end", i)',data:[974,1198,1519,1908,2983]},
{name:'std::vformat(pattern, std::make_format_args(i))',data:[933,1065,1511,1886,3007]},
{name:'strm << "abcdefghihklmopqr 0" << std::oct << std::setw(9) << std::setfill(\'0\') << i << " end"',data:[2845,2059,6385,7102,8384]}
]}</script>
<div class="benchset" id="bs4"><h4><a id="bs59672599204338055190" href="#bs59672599204338055190">#</a>&nbsp;Concatenate string + &quot;Literal&quot;</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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L304">Concat std::string by std to std::string</a><span class="tooltiptext code">void ConcatStdToStdS(benchmark::State&amp; state) {
std::string s1 = &quot;start &quot;;
for (auto _: state) {
for (int i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
std::string str = s1 + &quot; end&quot;;
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">43.5</td><td class="benchmarkresult">48.0</td><td class="benchmarkresult">38.4</td><td class="benchmarkresult">57.5</td><td class="benchmarkresult">113</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L315">Concat std::string by StrExpr to std::string</a><span class="tooltiptext code">void ConcatSimToStdS(benchmark::State&amp; state) {
std::string s1 = &quot;start &quot;;
for (auto _: state) {
for (int i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
std::string str = +s1 + &quot; end&quot;;
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">32.3</td><td class="benchmarkresult">29.4</td><td class="benchmarkresult">37.6</td><td class="benchmarkresult">78.6</td><td class="benchmarkresult">131</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L326">Concat stringa by StrExpr to stringa</a><span class="tooltiptext code">void ConcatSimToSimS(benchmark::State&amp; state) {
stra s1 = &quot;start &quot;;
for (auto _: state) {
for (int i = 1; i &lt;= 100&#39;000; i *= 10) {
benchmark::DoNotOptimize(s1);
stringa str = s1 + &quot; end&quot;;
benchmark::DoNotOptimize(str);
}
}
}</span></span></td><td></td><td class="benchmarkresult">28.5</td><td class="benchmarkresult">26.1</td><td class="benchmarkresult">27.7</td><td class="benchmarkresult">52.2</td><td class="benchmarkresult">115</td></tr>
</tbody></table></div><script>bench_sets['Concatenate string + "Literal"'] = {id:'bs4', tests:[
{name:'Concat std::string by std to std::string',data:[43.5,48.0,38.4,57.5,113]},
{name:'Concat std::string by StrExpr to std::string',data:[32.3,29.4,37.6,78.6,131]},
{name:'Concat stringa by StrExpr to stringa',data:[28.5,26.1,27.7,52.2,115]}
]}</script>
<div class="benchset" id="bs5"><h4><a id="bs68116594352702954700" href="#bs68116594352702954700">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L342">Find concat three std::string</a><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(&quot;\n- &quot;s + std::string{name} + &quot; -\n&quot;);
}</span></span></td><td></td><td class="benchmarkresult">109</td><td class="benchmarkresult">122</td><td class="benchmarkresult">197</td><td class="benchmarkresult">221</td><td class="benchmarkresult">229</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L347">Find concat three strexpr</a><span class="tooltiptext code">size_t find_pos_exp(ssa src, ssa name) {
return src.find(std::string{&quot;\n- &quot; + name + &quot; -\n&quot;});
}</span></span></td><td></td><td class="benchmarkresult">47.4</td><td class="benchmarkresult">40.2</td><td class="benchmarkresult">114</td><td class="benchmarkresult">125</td><td class="benchmarkresult">110</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L351">Find concat three simstr</a><span class="tooltiptext code">size_t find_pos_sim(ssa src, ssa name) {
return src.find(lstringa&lt;200>{&quot;\n- &quot; + name + &quot; -\n&quot;});
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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">22.6</td><td class="benchmarkresult">19.2</td><td class="benchmarkresult">27.5</td><td class="benchmarkresult">27.7</td><td class="benchmarkresult">63.3</td></tr>
</tbody></table></div><script>bench_sets['Find three concatenated string in string_view'] = {id:'bs5', tests:[
{name:'Find concat three std::string',data:[109,122,197,221,229]},
{name:'Find concat three strexpr',data:[47.4,40.2,114,125,110]},
{name:'Find concat three simstr',data:[22.6,19.2,27.5,27.7,63.3]}
]}</script>
<div class="benchset" id="bs6"><h4><a id="bs145290966789248325200" href="#bs145290966789248325200">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L411">BuildTypeNameStr 0/0</a><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 += &quot;(&quot; + std::to_string(prec);
if (scale) {
res += &quot;,&quot; + std::to_string(scale);
}
res += &quot;)&quot;;
}
return res;
}</span></span></td><td></td><td class="benchmarkresult">6.89</td><td class="benchmarkresult">9.86</td><td class="benchmarkresult">7.71</td><td class="benchmarkresult">17.5</td><td class="benchmarkresult">22.3</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L423">BuildTypeNameExp 0/0</a><span class="tooltiptext code">std::string buildTypeNameExp(ssa type_name, size_t prec, size_t scale) {
if (prec) {
return type_name + &quot;(&quot; + prec + e_if(scale, &quot;,&quot;_ss + scale) + &quot;)&quot;;
}
return type_name;
}</span></span></td><td></td><td class="benchmarkresult">7.12</td><td class="benchmarkresult">6.52</td><td class="benchmarkresult">7.28</td><td class="benchmarkresult">12.6</td><td class="benchmarkresult">26.3</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L430">BuildTypeNameSim 0/0</a><span class="tooltiptext code">stringa buildTypeNameSim(ssa type_name, size_t prec, size_t scale) {
if (prec) {
return type_name + &quot;(&quot; + prec + e_if(scale, &quot;,&quot;_ss + scale) + &quot;)&quot;;
}
return type_name;
}</span></span></td><td></td><td class="benchmarkresult">4.71</td><td class="benchmarkresult">4.76</td><td class="benchmarkresult">7.40</td><td class="benchmarkresult">15.5</td><td class="benchmarkresult">20.3</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L411">BuildTypeNameStr 10/10</a><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 += &quot;(&quot; + std::to_string(prec);
if (scale) {
res += &quot;,&quot; + std::to_string(scale);
}
res += &quot;)&quot;;
}
return res;
}</span></span></td><td></td><td class="benchmarkresult">51.7</td><td class="benchmarkresult">79.6</td><td class="benchmarkresult">57.1</td><td class="benchmarkresult">81.5</td><td class="benchmarkresult">395</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L423">BuildTypeNameExp 10/10</a><span class="tooltiptext code">std::string buildTypeNameExp(ssa type_name, size_t prec, size_t scale) {
if (prec) {
return type_name + &quot;(&quot; + prec + e_if(scale, &quot;,&quot;_ss + scale) + &quot;)&quot;;
}
return type_name;
}</span></span></td><td></td><td class="benchmarkresult">34.4</td><td class="benchmarkresult">23.7</td><td class="benchmarkresult">31.5</td><td class="benchmarkresult">38.1</td><td class="benchmarkresult">118</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L430">BuildTypeNameSim 10/10</a><span class="tooltiptext code">stringa buildTypeNameSim(ssa type_name, size_t prec, size_t scale) {
if (prec) {
return type_name + &quot;(&quot; + prec + e_if(scale, &quot;,&quot;_ss + scale) + &quot;)&quot;;
}
return type_name;
}</span></span></td><td></td><td class="benchmarkresult">22.2</td><td class="benchmarkresult">21.0</td><td class="benchmarkresult">24.3</td><td class="benchmarkresult">36.3</td><td class="benchmarkresult">72.0</td></tr>
</tbody></table></div><script>bench_sets['Build Type Name'] = {id:'bs6', tests:[
{name:'BuildTypeNameStr 0/0',data:[6.89,9.86,7.71,17.5,22.3]},
{name:'BuildTypeNameExp 0/0',data:[7.12,6.52,7.28,12.6,26.3]},
{name:'BuildTypeNameSim 0/0',data:[4.71,4.76,7.40,15.5,20.3]},
{name:'BuildTypeNameStr 10/10',data:[51.7,79.6,57.1,81.5,395]},
{name:'BuildTypeNameExp 10/10',data:[34.4,23.7,31.5,38.1,118]},
{name:'BuildTypeNameSim 10/10',data:[22.2,21.0,24.3,36.3,72.0]}
]}</script>
<div class="benchset" id="bs7"><h4><a id="bs54035654251116789780" href="#bs54035654251116789780">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L484">Concat with replace str</a><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 &quot;&lt;&quot; + str_replace(from, pattern, repl) + &quot;>&quot;;
}</span></span></td><td></td><td class="benchmarkresult">195</td><td class="benchmarkresult">225</td><td class="benchmarkresult">300</td><td class="benchmarkresult">340</td><td class="benchmarkresult">509</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L502">Concat with replace exp</a><span class="tooltiptext code">std::string make_str_exp(std::string_view from, std::string_view pattern, std::string_view repl) {
return &quot;&lt;&quot; + e_repl(from, pattern, repl) + &quot;>&quot;;
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">В simstr строковое выражение для замены подстрок
есть "из коробки".
simstr has a string expression for replacing substrings out of the box.</span></span></td><td class="benchmarkresult">135</td><td class="benchmarkresult">133</td><td class="benchmarkresult">208</td><td class="benchmarkresult">216</td><td class="benchmarkresult">253</td></tr>
</tbody></table></div><script>bench_sets['Replace string by copy'] = {id:'bs7', tests:[
{name:'Concat with replace str',data:[195,225,300,340,509]},
{name:'Concat with replace exp',data:[135,133,208,216,253]}
]}</script>
<div class="benchset" id="bs8"><h4><a id="bs77666948964429305550" href="#bs77666948964429305550">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L536">std::string e;</a><span class="tooltiptext code">template&lt;typename T>
void CreateEmpty(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string;
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">Пустые строки, ничего необычного.
Empty lines, nothing unusual.</span></span></td><td class="benchmarkresult">1.08</td><td class="benchmarkresult">1.08</td><td class="benchmarkresult">1.08</td><td class="benchmarkresult">2.83</td><td class="benchmarkresult">2.14</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L536">std::string_view e;</a><span class="tooltiptext code">template&lt;typename T>
void CreateEmpty(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string;
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td></td><td class="benchmarkresult">0.361</td><td class="benchmarkresult">0.731</td><td class="benchmarkresult">0.352</td><td class="benchmarkresult">1.77</td><td class="benchmarkresult">0.741</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L536">ssa e;</a><span class="tooltiptext code">template&lt;typename T>
void CreateEmpty(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string;
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td></td><td class="benchmarkresult">0.355</td><td class="benchmarkresult">0.180</td><td class="benchmarkresult">0.346</td><td class="benchmarkresult">1.42</td><td class="benchmarkresult">0.361</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L536">stringa e;</a><span class="tooltiptext code">template&lt;typename T>
void CreateEmpty(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string;
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td></td><td class="benchmarkresult">0.720</td><td class="benchmarkresult">0.732</td><td class="benchmarkresult">0.723</td><td class="benchmarkresult">2.18</td><td class="benchmarkresult">2.15</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L536">lstringa&lt;20> e;</a><span class="tooltiptext code">template&lt;typename T>
void CreateEmpty(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string;
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td></td><td class="benchmarkresult">1.09</td><td class="benchmarkresult">1.09</td><td class="benchmarkresult">1.07</td><td class="benchmarkresult">2.47</td><td class="benchmarkresult">2.21</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L536">lstringa&lt;40> e;</a><span class="tooltiptext code">template&lt;typename T>
void CreateEmpty(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string;
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td></td><td class="benchmarkresult">1.08</td><td class="benchmarkresult">1.12</td><td class="benchmarkresult">1.07</td><td class="benchmarkresult">2.43</td><td class="benchmarkresult">2.24</td></tr>
</tbody></table></div><script>bench_sets['Create Empty Str'] = {id:'bs8', tests:[
{name:'std::string e;',data:[1.08,1.08,1.08,2.83,2.14]},
{name:'std::string_view e;',data:[0.361,0.731,0.352,1.77,0.741]},
{name:'ssa e;',data:[0.355,0.180,0.346,1.42,0.361]},
{name:'stringa e;',data:[0.720,0.732,0.723,2.18,2.15]},
{name:'lstringa<20> e;',data:[1.09,1.09,1.07,2.47,2.21]},
{name:'lstringa<40> e;',data:[1.08,1.12,1.07,2.43,2.24]}
]}</script>
<div class="benchset" id="bs9"><h4><a id="bs181001525395597238060" href="#bs181001525395597238060">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L551">std::string e = &quot;Test text&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void CreateShortLiteral(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string = TEST_TEXT;
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.85</td><td class="benchmarkresult">1.85</td><td class="benchmarkresult">1.77</td><td class="benchmarkresult">2.48</td><td class="benchmarkresult">2.42</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L551">std::string_view e = &quot;Test text&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void CreateShortLiteral(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string = TEST_TEXT;
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.719</td><td class="benchmarkresult">0.732</td><td class="benchmarkresult">0.719</td><td class="benchmarkresult">1.77</td><td class="benchmarkresult">1.09</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L551">ssa e = &quot;Test text&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void CreateShortLiteral(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string = TEST_TEXT;
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td></td><td class="benchmarkresult">0.362</td><td class="benchmarkresult">0.722</td><td class="benchmarkresult">0.357</td><td class="benchmarkresult">1.76</td><td class="benchmarkresult">0.732</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L551">stringa e = &quot;Test text&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void CreateShortLiteral(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string = TEST_TEXT;
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.08</td><td class="benchmarkresult">1.12</td><td class="benchmarkresult">1.07</td><td class="benchmarkresult">2.75</td><td class="benchmarkresult">2.18</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L551">lstringa&lt;20> e = &quot;Test text&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void CreateShortLiteral(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string = TEST_TEXT;
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.81</td><td class="benchmarkresult">1.80</td><td class="benchmarkresult">1.81</td><td class="benchmarkresult">2.51</td><td class="benchmarkresult">2.62</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L551">lstringa&lt;40> e = &quot;Test text&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void CreateShortLiteral(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string = TEST_TEXT;
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td></td><td class="benchmarkresult">1.79</td><td class="benchmarkresult">1.86</td><td class="benchmarkresult">1.81</td><td class="benchmarkresult">2.47</td><td class="benchmarkresult">2.58</td></tr>
</tbody></table></div><script>bench_sets['Create Str from short literal (9 symbols)'] = {id:'bs9', tests:[
{name:'std::string e = "Test text";',data:[1.85,1.85,1.77,2.48,2.42]},
{name:'std::string_view e = "Test text";',data:[0.719,0.732,0.719,1.77,1.09]},
{name:'ssa e = "Test text";',data:[0.362,0.722,0.357,1.76,0.732]},
{name:'stringa e = "Test text";',data:[1.08,1.12,1.07,2.75,2.18]},
{name:'lstringa<20> e = "Test text";',data:[1.81,1.80,1.81,2.51,2.62]},
{name:'lstringa<40> e = "Test text";',data:[1.79,1.86,1.81,2.47,2.58]}
]}</script>
<div class="benchset" id="bs10"><h4><a id="bs132333183298742730280" href="#bs132333183298742730280">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L566">std::string e = &quot;123456789012345678901234567890&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void CreateLongLiteral(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string{LONG_TEXT};
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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">19.0</td><td class="benchmarkresult">19.7</td><td class="benchmarkresult">72.2</td><td class="benchmarkresult">74.8</td><td class="benchmarkresult">23.6</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L566">std::string_view e = &quot;123456789012345678901234567890&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void CreateLongLiteral(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string{LONG_TEXT};
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.731</td><td class="benchmarkresult">0.727</td><td class="benchmarkresult">0.715</td><td class="benchmarkresult">1.77</td><td class="benchmarkresult">1.12</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L566">ssa e = &quot;123456789012345678901234567890&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void CreateLongLiteral(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string{LONG_TEXT};
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td></td><td class="benchmarkresult">0.364</td><td class="benchmarkresult">0.718</td><td class="benchmarkresult">0.357</td><td class="benchmarkresult">1.81</td><td class="benchmarkresult">0.720</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L566">stringa e = &quot;123456789012345678901234567890&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void CreateLongLiteral(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string{LONG_TEXT};
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">stringa на константных литералах не отстает!
stringa doesn't lag behind on constant literals!</span></span></td><td class="benchmarkresult">1.07</td><td class="benchmarkresult">1.11</td><td class="benchmarkresult">1.06</td><td class="benchmarkresult">2.47</td><td class="benchmarkresult">2.15</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L566">lstringa&lt;20> e = &quot;123456789012345678901234567890&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void CreateLongLiteral(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string{LONG_TEXT};
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">lstringa<20> может вместить в себя до 23 символов,
Очевидно, что для 30-и символов уже нужна аллокация.
Obviously, 30 characters already require allocation.</span></span></td><td class="benchmarkresult">23.2</td><td class="benchmarkresult">20.4</td><td class="benchmarkresult">69.8</td><td class="benchmarkresult">74.3</td><td class="benchmarkresult">24.6</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L566">lstringa&lt;40> e = &quot;123456789012345678901234567890&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void CreateLongLiteral(benchmark::State&amp; state) {
for (auto _: state) {
T empty_string{LONG_TEXT};
benchmark::DoNotOptimize(empty_string);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.56</td><td class="benchmarkresult">1.82</td><td class="benchmarkresult">2.50</td><td class="benchmarkresult">3.17</td><td class="benchmarkresult">2.90</td></tr>
</tbody></table></div><script>bench_sets['Create Str from long literal (30 symbols)'] = {id:'bs10', tests:[
{name:'std::string e = "123456789012345678901234567890";',data:[19.0,19.7,72.2,74.8,23.6]},
{name:'std::string_view e = "123456789012345678901234567890";',data:[0.731,0.727,0.715,1.77,1.12]},
{name:'ssa e = "123456789012345678901234567890";',data:[0.364,0.718,0.357,1.81,0.720]},
{name:'stringa e = "123456789012345678901234567890";',data:[1.07,1.11,1.06,2.47,2.15]},
{name:'lstringa<20> e = "123456789012345678901234567890";',data:[23.2,20.4,69.8,74.3,24.6]},
{name:'lstringa<40> e = "123456789012345678901234567890";',data:[2.56,1.82,2.50,3.17,2.90]}
]}</script>
<div class="benchset" id="bs11"><h4><a id="bs6234433963744178700" href="#bs6234433963744178700">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L581">std::string e = &quot;Test text&quot;; auto c{e};</a><span class="tooltiptext code">template&lt;typename T>
void CopyShortString(benchmark::State&amp; 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">&nbsp;>>&nbsp;<span class="tooltiptext">Строка в пределах SSO, так что просто копирует байты.
The string is within the SSO, so it just copies the bytes.</span></span></td><td class="benchmarkresult">4.73</td><td class="benchmarkresult">5.55</td><td class="benchmarkresult">1.76</td><td class="benchmarkresult">5.84</td><td class="benchmarkresult">3.63</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L581">std::string_view e = &quot;Test text&quot;; auto c{e};</a><span class="tooltiptext code">template&lt;typename T>
void CopyShortString(benchmark::State&amp; 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.363</td><td class="benchmarkresult">0.367</td><td class="benchmarkresult">0.357</td><td class="benchmarkresult">3.38</td><td class="benchmarkresult">1.08</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L581">ssa e = &quot;Test text&quot;; auto c{e};</a><span class="tooltiptext code">template&lt;typename T>
void CopyShortString(benchmark::State&amp; 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">&nbsp;>>&nbsp;<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.358</td><td class="benchmarkresult">0.374</td><td class="benchmarkresult">0.354</td><td class="benchmarkresult">3.54</td><td class="benchmarkresult">1.10</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L581">stringa e = &quot;Test text&quot;; auto c{e};</a><span class="tooltiptext code">template&lt;typename T>
void CopyShortString(benchmark::State&amp; 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">&nbsp;>>&nbsp;<span class="tooltiptext">Копирование stringa происходит быстро,
особенно если она инициализирована литералом.
Copying a stringa is fast,
especially if it is initialized with a literal.</span></span></td><td class="benchmarkresult">1.08</td><td class="benchmarkresult">1.27</td><td class="benchmarkresult">1.24</td><td class="benchmarkresult">3.85</td><td class="benchmarkresult">2.49</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L581">lstringa&lt;20> e = &quot;Test text&quot;; auto c{e};</a><span class="tooltiptext code">template&lt;typename T>
void CopyShortString(benchmark::State&amp; 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">&nbsp;>>&nbsp;<span class="tooltiptext">В обоих случаях хватает внутреннего буфера.
In both cases, the internal buffer is sufficient.</span></span></td><td class="benchmarkresult">4.15</td><td class="benchmarkresult">1.46</td><td class="benchmarkresult">1.75</td><td class="benchmarkresult">4.29</td><td class="benchmarkresult">5.22</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L581">lstringa&lt;40> e = &quot;Test text&quot;; auto c{e};</a><span class="tooltiptext code">template&lt;typename T>
void CopyShortString(benchmark::State&amp; 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">&nbsp;>>&nbsp;<span class="tooltiptext">Только копируются байты.
Only bytes are copied.</span></span></td><td class="benchmarkresult">3.98</td><td class="benchmarkresult">1.47</td><td class="benchmarkresult">1.78</td><td class="benchmarkresult">4.27</td><td class="benchmarkresult">5.43</td></tr>
</tbody></table></div><script>bench_sets['Create copy of Str with 9 symbols'] = {id:'bs11', tests:[
{name:'std::string e = "Test text"; auto c{e};',data:[4.73,5.55,1.76,5.84,3.63]},
{name:'std::string_view e = "Test text"; auto c{e};',data:[0.363,0.367,0.357,3.38,1.08]},
{name:'ssa e = "Test text"; auto c{e};',data:[0.358,0.374,0.354,3.54,1.10]},
{name:'stringa e = "Test text"; auto c{e};',data:[1.08,1.27,1.24,3.85,2.49]},
{name:'lstringa<20> e = "Test text"; auto c{e};',data:[4.15,1.46,1.75,4.29,5.22]},
{name:'lstringa<40> e = "Test text"; auto c{e};',data:[3.98,1.47,1.78,4.27,5.43]}
]}</script>
<div class="benchset" id="bs12"><h4><a id="bs76384575499199461500" href="#bs76384575499199461500">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L598">std::string e = &quot;123456789012345678901234567890&quot;; auto c{e};</a><span class="tooltiptext code">template&lt;typename T>
void CopyLongString(benchmark::State&amp; state) {
T x = LONG_TEXT;
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.0</td><td class="benchmarkresult">23.1</td><td class="benchmarkresult">69.0</td><td class="benchmarkresult">74.8</td><td class="benchmarkresult">48.4</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L598">std::string_view e = &quot;123456789012345678901234567890&quot;; auto c{e};</a><span class="tooltiptext code">template&lt;typename T>
void CopyLongString(benchmark::State&amp; state) {
T x = LONG_TEXT;
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
}
}</span></span></td><td></td><td class="benchmarkresult">0.751</td><td class="benchmarkresult">0.730</td><td class="benchmarkresult">0.720</td><td class="benchmarkresult">1.75</td><td class="benchmarkresult">1.11</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L598">ssa e = &quot;123456789012345678901234567890&quot;; auto c{e};</a><span class="tooltiptext code">template&lt;typename T>
void CopyLongString(benchmark::State&amp; state) {
T x = LONG_TEXT;
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
}
}</span></span></td><td></td><td class="benchmarkresult">0.361</td><td class="benchmarkresult">0.730</td><td class="benchmarkresult">0.360</td><td class="benchmarkresult">1.75</td><td class="benchmarkresult">0.745</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L598">stringa e = &quot;123456789012345678901234567890&quot;; auto c{e};</a><span class="tooltiptext code">template&lt;typename T>
void CopyLongString(benchmark::State&amp; state) {
T x = LONG_TEXT;
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.07</td><td class="benchmarkresult">1.08</td><td class="benchmarkresult">1.79</td><td class="benchmarkresult">2.86</td><td class="benchmarkresult">2.17</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L598">lstringa&lt;20> e = &quot;123456789012345678901234567890&quot;; auto c{e};</a><span class="tooltiptext code">template&lt;typename T>
void CopyLongString(benchmark::State&amp; state) {
T x = LONG_TEXT;
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">Не влезает, аллокация.
Doesn't fit, allocation.</span></span></td><td class="benchmarkresult">21.3</td><td class="benchmarkresult">19.5</td><td class="benchmarkresult">71.2</td><td class="benchmarkresult">76.6</td><td class="benchmarkresult">23.4</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L598">lstringa&lt;40> e = &quot;123456789012345678901234567890&quot;; auto c{e};</a><span class="tooltiptext code">template&lt;typename T>
void CopyLongString(benchmark::State&amp; state) {
T x = LONG_TEXT;
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">Уложили во внутренний буфер.
Placed in the internal buffer.</span></span></td><td class="benchmarkresult">4.68</td><td class="benchmarkresult">5.61</td><td class="benchmarkresult">4.72</td><td class="benchmarkresult">7.55</td><td class="benchmarkresult">14.7</td></tr>
</tbody></table></div><script>bench_sets['Create copy of Str with 30 symbols'] = {id:'bs12', tests:[
{name:'std::string e = "123456789012345678901234567890"; auto c{e};',data:[19.0,23.1,69.0,74.8,48.4]},
{name:'std::string_view e = "123456789012345678901234567890"; auto c{e};',data:[0.751,0.730,0.720,1.75,1.11]},
{name:'ssa e = "123456789012345678901234567890"; auto c{e};',data:[0.361,0.730,0.360,1.75,0.745]},
{name:'stringa e = "123456789012345678901234567890"; auto c{e};',data:[1.07,1.08,1.79,2.86,2.17]},
{name:'lstringa<20> e = "123456789012345678901234567890"; auto c{e};',data:[21.3,19.5,71.2,76.6,23.4]},
{name:'lstringa<40> e = "123456789012345678901234567890"; auto c{e};',data:[4.68,5.61,4.72,7.55,14.7]}
]}</script>
<div class="benchset" id="bs13"><h4><a id="bs21623892135774528620" href="#bs21623892135774528620">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L615">std::string::find;</a><span class="tooltiptext code">template&lt;typename T>
void Find(benchmark::State&amp; 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(&quot;not find?&quot;);
break;
}
#endif
benchmark::DoNotOptimize(i);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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">6.59</td><td class="benchmarkresult">6.56</td><td class="benchmarkresult">37.9</td><td class="benchmarkresult">40.5</td><td class="benchmarkresult">44.7</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L615">std::string_view::find;</a><span class="tooltiptext code">template&lt;typename T>
void Find(benchmark::State&amp; 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(&quot;not find?&quot;);
break;
}
#endif
benchmark::DoNotOptimize(i);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">7.31</td><td class="benchmarkresult">6.70</td><td class="benchmarkresult">37.9</td><td class="benchmarkresult">39.6</td><td class="benchmarkresult">46.0</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L615">ssa::find;</a><span class="tooltiptext code">template&lt;typename T>
void Find(benchmark::State&amp; 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(&quot;not find?&quot;);
break;
}
#endif
benchmark::DoNotOptimize(i);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">6.63</td><td class="benchmarkresult">6.24</td><td class="benchmarkresult">17.0</td><td class="benchmarkresult">20.0</td><td class="benchmarkresult">43.7</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L615">stringa::find;</a><span class="tooltiptext code">template&lt;typename T>
void Find(benchmark::State&amp; 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(&quot;not find?&quot;);
break;
}
#endif
benchmark::DoNotOptimize(i);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">6.91</td><td class="benchmarkresult">6.57</td><td class="benchmarkresult">18.4</td><td class="benchmarkresult">30.3</td><td class="benchmarkresult">43.8</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L615">lstringa&lt;20>::find;</a><span class="tooltiptext code">template&lt;typename T>
void Find(benchmark::State&amp; 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(&quot;not find?&quot;);
break;
}
#endif
benchmark::DoNotOptimize(i);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">6.16</td><td class="benchmarkresult">6.29</td><td class="benchmarkresult">17.8</td><td class="benchmarkresult">20.3</td><td class="benchmarkresult">39.3</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L615">lstringa&lt;40>::find;</a><span class="tooltiptext code">template&lt;typename T>
void Find(benchmark::State&amp; 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(&quot;not find?&quot;);
break;
}
#endif
benchmark::DoNotOptimize(i);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">6.37</td><td class="benchmarkresult">6.24</td><td class="benchmarkresult">17.4</td><td class="benchmarkresult">21.5</td><td class="benchmarkresult">40.3</td></tr>
</tbody></table></div><script>bench_sets['Find 9 symbols text in end of 99 symbols text'] = {id:'bs13', tests:[
{name:'std::string::find;',data:[6.59,6.56,37.9,40.5,44.7]},
{name:'std::string_view::find;',data:[7.31,6.70,37.9,39.6,46.0]},
{name:'ssa::find;',data:[6.63,6.24,17.0,20.0,43.7]},
{name:'stringa::find;',data:[6.91,6.57,18.4,30.3,43.8]},
{name:'lstringa<20>::find;',data:[6.16,6.29,17.8,20.3,39.3]},
{name:'lstringa<40>::find;',data:[6.37,6.24,17.4,21.5,40.3]}
]}</script>
<div class="benchset" id="bs14"><h4><a id="bs170792414351801782640" href="#bs170792414351801782640">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">std::string copy{str_with_len_N};/15</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">5.55</td><td class="benchmarkresult">5.56</td><td class="benchmarkresult">1.77</td><td class="benchmarkresult">4.31</td><td class="benchmarkresult">48.6</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">std::string copy{str_with_len_N};/16</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.7</td><td class="benchmarkresult">74.3</td><td class="benchmarkresult">80.8</td><td class="benchmarkresult">49.7</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">std::string copy{str_with_len_N};/23</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">Дальше просто добавляется время на копирование байтов.
Then the time for copying bytes is simply added.</span></span></td><td class="benchmarkresult">23.9</td><td class="benchmarkresult">23.3</td><td class="benchmarkresult">74.7</td><td class="benchmarkresult">81.4</td><td class="benchmarkresult">51.3</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">std::string copy{str_with_len_N};/24</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">23.6</td><td class="benchmarkresult">23.5</td><td class="benchmarkresult">74.3</td><td class="benchmarkresult">79.9</td><td class="benchmarkresult">48.4</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">std::string copy{str_with_len_N};/32</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
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.0</td><td class="benchmarkresult">82.3</td><td class="benchmarkresult">82.3</td><td class="benchmarkresult">53.5</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">std::string copy{str_with_len_N};/64</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
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.6</td><td class="benchmarkresult">79.0</td><td class="benchmarkresult">81.7</td><td class="benchmarkresult">55.0</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">std::string copy{str_with_len_N};/128</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
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">24.7</td><td class="benchmarkresult">82.4</td><td class="benchmarkresult">87.0</td><td class="benchmarkresult">52.0</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">std::string copy{str_with_len_N};/256</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">25.1</td><td class="benchmarkresult">25.0</td><td class="benchmarkresult">82.6</td><td class="benchmarkresult">89.6</td><td class="benchmarkresult">60.1</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">std::string copy{str_with_len_N};/512</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">29.4</td><td class="benchmarkresult">30.2</td><td class="benchmarkresult">83.4</td><td class="benchmarkresult">88.6</td><td class="benchmarkresult">56.8</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">std::string copy{str_with_len_N};/1024</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">51.6</td><td class="benchmarkresult">48.2</td><td class="benchmarkresult">89.9</td><td class="benchmarkresult">95.4</td><td class="benchmarkresult">70.0</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">std::string copy{str_with_len_N};/2048</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">124</td><td class="benchmarkresult">126</td><td class="benchmarkresult">121</td><td class="benchmarkresult">127</td><td class="benchmarkresult">93.3</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">std::string copy{str_with_len_N};/4096</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">Чем длиннее строка, тем дольше создаётся копия.
The longer the string, the longer it takes to create a copy.</span></span></td><td class="benchmarkresult">163</td><td class="benchmarkresult">155</td><td class="benchmarkresult">198</td><td class="benchmarkresult">203</td><td class="benchmarkresult">137</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">stringa copy{str_with_len_N};/15</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.20</td><td class="benchmarkresult">1.47</td><td class="benchmarkresult">1.56</td><td class="benchmarkresult">4.65</td><td class="benchmarkresult">2.39</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">stringa copy{str_with_len_N};/16</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.24</td><td class="benchmarkresult">1.42</td><td class="benchmarkresult">1.54</td><td class="benchmarkresult">4.71</td><td class="benchmarkresult">4.85</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">stringa copy{str_with_len_N};/23</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.11</td><td class="benchmarkresult">1.42</td><td class="benchmarkresult">1.52</td><td class="benchmarkresult">4.88</td><td class="benchmarkresult">4.85</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">stringa copy{str_with_len_N};/24</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.1</td><td class="benchmarkresult">16.5</td><td class="benchmarkresult">16.2</td><td class="benchmarkresult">19.2</td><td class="benchmarkresult">4.87</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">stringa copy{str_with_len_N};/32</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">16.2</td><td class="benchmarkresult">16.6</td><td class="benchmarkresult">16.1</td><td class="benchmarkresult">19.5</td><td class="benchmarkresult">4.97</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">stringa copy{str_with_len_N};/64</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
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.6</td><td class="benchmarkresult">16.2</td><td class="benchmarkresult">19.1</td><td class="benchmarkresult">4.82</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">stringa copy{str_with_len_N};/128</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
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.5</td><td class="benchmarkresult">16.1</td><td class="benchmarkresult">19.2</td><td class="benchmarkresult">4.83</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">stringa copy{str_with_len_N};/256</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">16.4</td><td class="benchmarkresult">16.6</td><td class="benchmarkresult">16.1</td><td class="benchmarkresult">19.2</td><td class="benchmarkresult">4.82</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">stringa copy{str_with_len_N};/512</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">16.2</td><td class="benchmarkresult">16.3</td><td class="benchmarkresult">16.0</td><td class="benchmarkresult">19.0</td><td class="benchmarkresult">4.81</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">stringa copy{str_with_len_N};/1024</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
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.7</td><td class="benchmarkresult">16.0</td><td class="benchmarkresult">19.5</td><td class="benchmarkresult">4.82</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">stringa copy{str_with_len_N};/2048</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">16.3</td><td class="benchmarkresult">16.5</td><td class="benchmarkresult">16.0</td><td class="benchmarkresult">19.0</td><td class="benchmarkresult">4.79</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">stringa copy{str_with_len_N};/4096</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.3</td><td class="benchmarkresult">16.5</td><td class="benchmarkresult">15.9</td><td class="benchmarkresult">19.2</td><td class="benchmarkresult">4.75</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;16> copy{str_with_len_N};/15</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.56</td><td class="benchmarkresult">1.58</td><td class="benchmarkresult">1.93</td><td class="benchmarkresult">5.28</td><td class="benchmarkresult">4.70</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;16> copy{str_with_len_N};/16</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">4.51</td><td class="benchmarkresult">6.31</td><td class="benchmarkresult">6.22</td><td class="benchmarkresult">9.18</td><td class="benchmarkresult">14.9</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;16> copy{str_with_len_N};/23</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">4.68</td><td class="benchmarkresult">6.37</td><td class="benchmarkresult">6.41</td><td class="benchmarkresult">9.32</td><td class="benchmarkresult">38.6</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;16> copy{str_with_len_N};/24</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">И после начинает вести себя при копировании, как std::string.
And then it starts to behave like std::string when copied.</span></span></td><td class="benchmarkresult">27.1</td><td class="benchmarkresult">26.6</td><td class="benchmarkresult">83.6</td><td class="benchmarkresult">91.6</td><td class="benchmarkresult">37.9</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;16> copy{str_with_len_N};/32</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">26.4</td><td class="benchmarkresult">26.9</td><td class="benchmarkresult">93.3</td><td class="benchmarkresult">87.3</td><td class="benchmarkresult">42.5</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;16> copy{str_with_len_N};/64</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">28.6</td><td class="benchmarkresult">27.9</td><td class="benchmarkresult">91.7</td><td class="benchmarkresult">91.8</td><td class="benchmarkresult">39.2</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;16> copy{str_with_len_N};/128</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">28.2</td><td class="benchmarkresult">29.1</td><td class="benchmarkresult">92.1</td><td class="benchmarkresult">91.5</td><td class="benchmarkresult">42.8</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;16> copy{str_with_len_N};/256</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">31.0</td><td class="benchmarkresult">31.4</td><td class="benchmarkresult">90.9</td><td class="benchmarkresult">104</td><td class="benchmarkresult">48.1</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;16> copy{str_with_len_N};/512</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">34.7</td><td class="benchmarkresult">33.8</td><td class="benchmarkresult">96.1</td><td class="benchmarkresult">94.0</td><td class="benchmarkresult">48.5</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;16> copy{str_with_len_N};/1024</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">118</td><td class="benchmarkresult">124</td><td class="benchmarkresult">108</td><td class="benchmarkresult">105</td><td class="benchmarkresult">59.5</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;16> copy{str_with_len_N};/2048</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">134</td><td class="benchmarkresult">135</td><td class="benchmarkresult">158</td><td class="benchmarkresult">142</td><td class="benchmarkresult">82.6</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;16> copy{str_with_len_N};/4096</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">153</td><td class="benchmarkresult">149</td><td class="benchmarkresult">232</td><td class="benchmarkresult">203</td><td class="benchmarkresult">124</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;512> copy{str_with_len_N};/15</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">5.44</td><td class="benchmarkresult">1.57</td><td class="benchmarkresult">2.09</td><td class="benchmarkresult">5.45</td><td class="benchmarkresult">4.94</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;512> copy{str_with_len_N};/16</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">4.88</td><td class="benchmarkresult">6.26</td><td class="benchmarkresult">5.41</td><td class="benchmarkresult">9.18</td><td class="benchmarkresult">16.2</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;512> copy{str_with_len_N};/23</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">4.82</td><td class="benchmarkresult">6.14</td><td class="benchmarkresult">5.77</td><td class="benchmarkresult">9.15</td><td class="benchmarkresult">16.3</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;512> copy{str_with_len_N};/24</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">4.72</td><td class="benchmarkresult">6.76</td><td class="benchmarkresult">5.46</td><td class="benchmarkresult">9.08</td><td class="benchmarkresult">16.3</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;512> copy{str_with_len_N};/32</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">4.33</td><td class="benchmarkresult">6.53</td><td class="benchmarkresult">8.47</td><td class="benchmarkresult">12.1</td><td class="benchmarkresult">19.5</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;512> copy{str_with_len_N};/64</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">5.80</td><td class="benchmarkresult">8.18</td><td class="benchmarkresult">8.47</td><td class="benchmarkresult">12.6</td><td class="benchmarkresult">17.9</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;512> copy{str_with_len_N};/128</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">27.5</td><td class="benchmarkresult">7.95</td><td class="benchmarkresult">8.99</td><td class="benchmarkresult">12.6</td><td class="benchmarkresult">19.0</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;512> copy{str_with_len_N};/256</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">22.3</td><td class="benchmarkresult">9.18</td><td class="benchmarkresult">10.5</td><td class="benchmarkresult">15.1</td><td class="benchmarkresult">19.8</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;512> copy{str_with_len_N};/512</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">Даже 512 символов копируются быстрее, чем
одна аллокация или атомарный инкремент.
Even 512 characters are copied faster than a single
allocation or atomic increment.</span></span></td><td class="benchmarkresult">21.3</td><td class="benchmarkresult">12.8</td><td class="benchmarkresult">12.0</td><td class="benchmarkresult">16.8</td><td class="benchmarkresult">22.9</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;512> copy{str_with_len_N};/1024</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">А дальше уже как у всех.
And then it's like everyone else.</span></span></td><td class="benchmarkresult">110</td><td class="benchmarkresult">125</td><td class="benchmarkresult">108</td><td class="benchmarkresult">116</td><td class="benchmarkresult">57.7</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;512> copy{str_with_len_N};/2048</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
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">135</td><td class="benchmarkresult">153</td><td class="benchmarkresult">166</td><td class="benchmarkresult">79.9</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L638">lstringa&lt;512> copy{str_with_len_N};/4096</a><span class="tooltiptext code">template&lt;typename T>
void CopyDynString(benchmark::State&amp; state) {
T x(state.range(0), &#39;a&#39;);
for (auto _: state) {
T copy{x};
benchmark::DoNotOptimize(copy);
benchmark::DoNotOptimize(x);
}
}</span></span></td><td></td><td class="benchmarkresult">122</td><td class="benchmarkresult">152</td><td class="benchmarkresult">214</td><td class="benchmarkresult">224</td><td class="benchmarkresult">122</td></tr>
</tbody></table></div><script>bench_sets['Copy not literal Str with N symbols'] = {id:'bs14', tests:[
{name:'std::string copy{str_with_len_N};/15',data:[5.55,5.56,1.77,4.31,48.6]},
{name:'std::string copy{str_with_len_N};/16',data:[23.6,23.7,74.3,80.8,49.7]},
{name:'std::string copy{str_with_len_N};/23',data:[23.9,23.3,74.7,81.4,51.3]},
{name:'std::string copy{str_with_len_N};/24',data:[23.6,23.5,74.3,79.9,48.4]},
{name:'std::string copy{str_with_len_N};/32',data:[23.3,23.0,82.3,82.3,53.5]},
{name:'std::string copy{str_with_len_N};/64',data:[23.3,23.6,79.0,81.7,55.0]},
{name:'std::string copy{str_with_len_N};/128',data:[24.8,24.7,82.4,87.0,52.0]},
{name:'std::string copy{str_with_len_N};/256',data:[25.1,25.0,82.6,89.6,60.1]},
{name:'std::string copy{str_with_len_N};/512',data:[29.4,30.2,83.4,88.6,56.8]},
{name:'std::string copy{str_with_len_N};/1024',data:[51.6,48.2,89.9,95.4,70.0]},
{name:'std::string copy{str_with_len_N};/2048',data:[124,126,121,127,93.3]},
{name:'std::string copy{str_with_len_N};/4096',data:[163,155,198,203,137]},
{name:'stringa copy{str_with_len_N};/15',data:[1.20,1.47,1.56,4.65,2.39]},
{name:'stringa copy{str_with_len_N};/16',data:[1.24,1.42,1.54,4.71,4.85]},
{name:'stringa copy{str_with_len_N};/23',data:[1.11,1.42,1.52,4.88,4.85]},
{name:'stringa copy{str_with_len_N};/24',data:[16.1,16.5,16.2,19.2,4.87]},
{name:'stringa copy{str_with_len_N};/32',data:[16.2,16.6,16.1,19.5,4.97]},
{name:'stringa copy{str_with_len_N};/64',data:[16.1,16.6,16.2,19.1,4.82]},
{name:'stringa copy{str_with_len_N};/128',data:[16.1,16.5,16.1,19.2,4.83]},
{name:'stringa copy{str_with_len_N};/256',data:[16.4,16.6,16.1,19.2,4.82]},
{name:'stringa copy{str_with_len_N};/512',data:[16.2,16.3,16.0,19.0,4.81]},
{name:'stringa copy{str_with_len_N};/1024',data:[16.0,16.7,16.0,19.5,4.82]},
{name:'stringa copy{str_with_len_N};/2048',data:[16.3,16.5,16.0,19.0,4.79]},
{name:'stringa copy{str_with_len_N};/4096',data:[16.3,16.5,15.9,19.2,4.75]},
{name:'lstringa<16> copy{str_with_len_N};/15',data:[4.56,1.58,1.93,5.28,4.70]},
{name:'lstringa<16> copy{str_with_len_N};/16',data:[4.51,6.31,6.22,9.18,14.9]},
{name:'lstringa<16> copy{str_with_len_N};/23',data:[4.68,6.37,6.41,9.32,38.6]},
{name:'lstringa<16> copy{str_with_len_N};/24',data:[27.1,26.6,83.6,91.6,37.9]},
{name:'lstringa<16> copy{str_with_len_N};/32',data:[26.4,26.9,93.3,87.3,42.5]},
{name:'lstringa<16> copy{str_with_len_N};/64',data:[28.6,27.9,91.7,91.8,39.2]},
{name:'lstringa<16> copy{str_with_len_N};/128',data:[28.2,29.1,92.1,91.5,42.8]},
{name:'lstringa<16> copy{str_with_len_N};/256',data:[31.0,31.4,90.9,104,48.1]},
{name:'lstringa<16> copy{str_with_len_N};/512',data:[34.7,33.8,96.1,94.0,48.5]},
{name:'lstringa<16> copy{str_with_len_N};/1024',data:[118,124,108,105,59.5]},
{name:'lstringa<16> copy{str_with_len_N};/2048',data:[134,135,158,142,82.6]},
{name:'lstringa<16> copy{str_with_len_N};/4096',data:[153,149,232,203,124]},
{name:'lstringa<512> copy{str_with_len_N};/15',data:[5.44,1.57,2.09,5.45,4.94]},
{name:'lstringa<512> copy{str_with_len_N};/16',data:[4.88,6.26,5.41,9.18,16.2]},
{name:'lstringa<512> copy{str_with_len_N};/23',data:[4.82,6.14,5.77,9.15,16.3]},
{name:'lstringa<512> copy{str_with_len_N};/24',data:[4.72,6.76,5.46,9.08,16.3]},
{name:'lstringa<512> copy{str_with_len_N};/32',data:[4.33,6.53,8.47,12.1,19.5]},
{name:'lstringa<512> copy{str_with_len_N};/64',data:[5.80,8.18,8.47,12.6,17.9]},
{name:'lstringa<512> copy{str_with_len_N};/128',data:[27.5,7.95,8.99,12.6,19.0]},
{name:'lstringa<512> copy{str_with_len_N};/256',data:[22.3,9.18,10.5,15.1,19.8]},
{name:'lstringa<512> copy{str_with_len_N};/512',data:[21.3,12.8,12.0,16.8,22.9]},
{name:'lstringa<512> copy{str_with_len_N};/1024',data:[110,125,108,116,57.7]},
{name:'lstringa<512> copy{str_with_len_N};/2048',data:[113,135,153,166,79.9]},
{name:'lstringa<512> copy{str_with_len_N};/4096',data:[122,152,214,224,122]}
]}</script>
<div class="benchset" id="bs15"><h4><a id="bs94756718925776995960" href="#bs94756718925776995960">#</a>&nbsp;Convert to int &#39;1234567&#39;</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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L653">std::string s = &quot;123456789&quot;; int res = std::strtol(s.c_str(), 0, 10);</a><span class="tooltiptext code">void ToIntStr10(benchmark::State&amp; state, const std::string&amp; s, int c) {
for (auto _: state) {
int res = std::strtol(s.c_str(), nullptr, 10);
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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">25.8</td><td class="benchmarkresult">30.4</td><td class="benchmarkresult">35.0</td><td class="benchmarkresult">35.0</td><td class="benchmarkresult">93.0</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L692">std::string_view s = &quot;123456789&quot;; std::from_chars(s.data(), s.data() + s.size(), res, 10);</a><span class="tooltiptext code">void ToIntFromChars10(benchmark::State&amp; state, const std::string_view&amp; 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(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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">14.6</td><td class="benchmarkresult">12.5</td><td class="benchmarkresult">15.7</td><td class="benchmarkresult">17.9</td><td class="benchmarkresult">27.4</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L720">stringa s = &quot;123456789&quot;; int res = s.to_int&lt;int, true, 10, false></a><span class="tooltiptext code">template&lt;typename T>
void ToIntSimStr10(benchmark::State&amp; state, T t, int c) {
for (auto _: state) {
int res = t. template to_int&lt;int, true, 10, false, false>().value;
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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.2</td><td class="benchmarkresult">8.44</td><td class="benchmarkresult">15.3</td><td class="benchmarkresult">17.8</td><td class="benchmarkresult">18.9</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L720">ssa s = &quot;123456789&quot;; int res = s.to_int&lt;int, true, 10, false></a><span class="tooltiptext code">template&lt;typename T>
void ToIntSimStr10(benchmark::State&amp; state, T t, int c) {
for (auto _: state) {
int res = t. template to_int&lt;int, true, 10, false, false>().value;
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
}</span></span></td><td></td><td class="benchmarkresult">11.9</td><td class="benchmarkresult">8.12</td><td class="benchmarkresult">14.5</td><td class="benchmarkresult">17.8</td><td class="benchmarkresult">18.9</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L720">lstringa&lt;20> s = &quot;123456789&quot;; int res = s.to_int&lt;int, true, 10, false></a><span class="tooltiptext code">template&lt;typename T>
void ToIntSimStr10(benchmark::State&amp; state, T t, int c) {
for (auto _: state) {
int res = t. template to_int&lt;int, true, 10, false, false>().value;
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
}</span></span></td><td></td><td class="benchmarkresult">12.0</td><td class="benchmarkresult">8.81</td><td class="benchmarkresult">15.2</td><td class="benchmarkresult">17.0</td><td class="benchmarkresult">19.0</td></tr>
</tbody></table></div><script>bench_sets['Convert to int \'1234567\''] = {id:'bs15', tests:[
{name:'std::string s = "123456789"; int res = std::strtol(s.c_str(), 0, 10);',data:[25.8,30.4,35.0,35.0,93.0]},
{name:'std::string_view s = "123456789"; std::from_chars(s.data(), s.data() + s.size(), res, 10);',data:[14.6,12.5,15.7,17.9,27.4]},
{name:'stringa s = "123456789"; int res = s.to_int<int, true, 10, false>',data:[12.2,8.44,15.3,17.8,18.9]},
{name:'ssa s = "123456789"; int res = s.to_int<int, true, 10, false>',data:[11.9,8.12,14.5,17.8,18.9]},
{name:'lstringa<20> s = "123456789"; int res = s.to_int<int, true, 10, false>',data:[12.0,8.81,15.2,17.0,19.0]}
]}</script>
<div class="benchset" id="bs16"><h4><a id="bs182426078870126042750" href="#bs182426078870126042750">#</a>&nbsp;Convert to unsigned &#39;abcDef&#39;</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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L666">std::string s = &quot;abcDef&quot;; int res = std::strtol(s.c_str(), 0, 16);</a><span class="tooltiptext code">void ToIntStr16(benchmark::State&amp; state, const std::string&amp; s, int c) {
for (auto _: state) {
int res = std::strtol(s.c_str(), nullptr, 16);
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">Всё то же, только для 16ричной системы
Everything is the same, only for the hexadecimal system</span></span></td><td class="benchmarkresult">23.2</td><td class="benchmarkresult">25.0</td><td class="benchmarkresult">37.8</td><td class="benchmarkresult">39.8</td><td class="benchmarkresult">69.8</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L706">std::string_view s = &quot;abcDef&quot;; std::from_chars(s.data(), s.data() + s.size(), res, 16);</a><span class="tooltiptext code">void ToIntFromChars16(benchmark::State&amp; state, const std::string_view&amp; 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(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
}
}</span></span></td><td></td><td class="benchmarkresult">9.32</td><td class="benchmarkresult">10.6</td><td class="benchmarkresult">8.94</td><td class="benchmarkresult">10.8</td><td class="benchmarkresult">25.8</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L735">stringa s = &quot;abcDef&quot;; int res = s.to_int&lt;int, true, 16, false></a><span class="tooltiptext code">template&lt;typename T>
void ToIntSimStr16(benchmark::State&amp; state, T t, int c) {
for (auto _: state) {
int res = t. template to_int&lt;int, true, 16, false, false>().value;
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
}</span></span></td><td></td><td class="benchmarkresult">12.2</td><td class="benchmarkresult">9.06</td><td class="benchmarkresult">13.5</td><td class="benchmarkresult">15.1</td><td class="benchmarkresult">19.8</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L735">ssa s = &quot;abcDef&quot;; int res = s.to_int&lt;int, true, 16, false></a><span class="tooltiptext code">template&lt;typename T>
void ToIntSimStr16(benchmark::State&amp; state, T t, int c) {
for (auto _: state) {
int res = t. template to_int&lt;int, true, 16, false, false>().value;
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
}</span></span></td><td></td><td class="benchmarkresult">12.6</td><td class="benchmarkresult">8.03</td><td class="benchmarkresult">13.1</td><td class="benchmarkresult">14.1</td><td class="benchmarkresult">19.8</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L735">lstringa&lt;20> s = &quot;abcDef&quot;; int res = s.to_int&lt;int, true, 16, false></a><span class="tooltiptext code">template&lt;typename T>
void ToIntSimStr16(benchmark::State&amp; state, T t, int c) {
for (auto _: state) {
int res = t. template to_int&lt;int, true, 16, false, false>().value;
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
}</span></span></td><td></td><td class="benchmarkresult">12.2</td><td class="benchmarkresult">8.60</td><td class="benchmarkresult">13.0</td><td class="benchmarkresult">15.6</td><td class="benchmarkresult">19.7</td></tr>
</tbody></table></div><script>bench_sets['Convert to unsigned \'abcDef\''] = {id:'bs16', tests:[
{name:'std::string s = "abcDef"; int res = std::strtol(s.c_str(), 0, 16);',data:[23.2,25.0,37.8,39.8,69.8]},
{name:'std::string_view s = "abcDef"; std::from_chars(s.data(), s.data() + s.size(), res, 16);',data:[9.32,10.6,8.94,10.8,25.8]},
{name:'stringa s = "abcDef"; int res = s.to_int<int, true, 16, false>',data:[12.2,9.06,13.5,15.1,19.8]},
{name:'ssa s = "abcDef"; int res = s.to_int<int, true, 16, false>',data:[12.6,8.03,13.1,14.1,19.8]},
{name:'lstringa<20> s = "abcDef"; int res = s.to_int<int, true, 16, false>',data:[12.2,8.60,13.0,15.6,19.7]}
]}</script>
<div class="benchset" id="bs17"><h4><a id="bs52606100125109966680" href="#bs52606100125109966680">#</a>&nbsp;Convert to int &#39; 1234567&#39;</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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L679">std::string s = &quot; 123456789&quot;; int res = std::strtol(s.c_str(), 0, 0);</a><span class="tooltiptext code">void ToIntStr0(benchmark::State&amp; state, const std::string&amp; s, int c) {
for (auto _: state) {
int res = std::strtol(s.c_str(), nullptr, 0);
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">А здесь уже парсинг произвольного числа.
And here we have parsing of an arbitrary number.</span></span></td><td class="benchmarkresult">29.0</td><td class="benchmarkresult">30.0</td><td class="benchmarkresult">48.0</td><td class="benchmarkresult">52.4</td><td class="benchmarkresult">99.5</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L750">stringa s = &quot; 123456789&quot;; int res = s.to_int&lt;int>; // Check overflow</a><span class="tooltiptext code">template&lt;typename T>
void ToIntSimStr0(benchmark::State&amp; state, T t, int c) {
for (auto _: state) {
int res = t. template to_int&lt;int>().value;
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
}</span></span></td><td></td><td class="benchmarkresult">18.2</td><td class="benchmarkresult">15.4</td><td class="benchmarkresult">19.5</td><td class="benchmarkresult">24.7</td><td class="benchmarkresult">24.9</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L765">ssa s = &quot; 123456789&quot;; int res = s.to_int&lt;int, false>; // No check overflow</a><span class="tooltiptext code">void ToIntNoOverflow(benchmark::State&amp; state, ssa t, int c) {
for (auto _: state) {
int res = t.to_int&lt;int, false>().value;
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
}</span></span></td><td></td><td class="benchmarkresult">14.7</td><td class="benchmarkresult">15.1</td><td class="benchmarkresult">17.7</td><td class="benchmarkresult">19.2</td><td class="benchmarkresult">19.3</td></tr>
</tbody></table></div><script>bench_sets['Convert to int \' 1234567\''] = {id:'bs17', tests:[
{name:'std::string s = " 123456789"; int res = std::strtol(s.c_str(), 0, 0);',data:[29.0,30.0,48.0,52.4,99.5]},
{name:'stringa s = " 123456789"; int res = s.to_int<int>; // Check overflow',data:[18.2,15.4,19.5,24.7,24.9]},
{name:'ssa s = " 123456789"; int res = s.to_int<int, false>; // No check overflow',data:[14.7,15.1,17.7,19.2,19.3]}
]}</script>
<div class="benchset" id="bs18"><h4><a id="bs182348477702821075660" href="#bs182348477702821075660">#</a>&nbsp;Convert to double &#39;1234.567e10&#39;</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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L795">std::string s = &quot;1234.567e10&quot;; double res = std::strtod(s.c_str(), nullptr);</a><span class="tooltiptext code">void ToDoubleStr(benchmark::State&amp; state, const std::string&amp; s, double c) {
for (auto _: state) {
char* ptr = nullptr;
double res = std::strtod(s.c_str(), &amp;ptr);
if (ptr == s.c_str()) {
state.SkipWithError(&quot;not equal&quot;);
}
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
}
}</span></span></td><td></td><td class="benchmarkresult">62.0</td><td class="benchmarkresult">72.4</td><td class="benchmarkresult">102</td><td class="benchmarkresult">125</td><td class="benchmarkresult">305</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L812">std::string_view s = &quot;1234.567e10&quot;; std::from_chars(s.data(), s.data() + s.size(), res);</a><span class="tooltiptext code">void ToDoubleFromChars(benchmark::State&amp; state, const std::string_view&amp; 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(&quot;not equal&quot;);
}
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
}
}</span></span></td><td></td><td class="benchmarkresult">25.6</td><td class="benchmarkresult">26.4</td><td class="benchmarkresult">70.7</td><td class="benchmarkresult">100.0</td><td class="benchmarkresult">109</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L828">ssa s = &quot;1234.567e10&quot;; double res = *s.to_double()</a><span class="tooltiptext code">template&lt;typename T>
void ToDoubleSimStr(benchmark::State&amp; state, T t, double c) {
for (auto _: state) {
auto r = t.template to_double&lt;false>();
if (!r) {
state.SkipWithError(&quot;not equal&quot;);
}
double res = *r;
#ifdef CHECK_RESULT
if (res != c) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(res);
benchmark::DoNotOptimize(t);
}
}</span></span></td><td></td><td class="benchmarkresult">29.0</td><td class="benchmarkresult">26.8</td><td class="benchmarkresult">38.8</td><td class="benchmarkresult">41.1</td><td class="benchmarkresult">42.9</td></tr>
</tbody></table></div><script>bench_sets['Convert to double \'1234.567e10\''] = {id:'bs18', tests:[
{name:'std::string s = "1234.567e10"; double res = std::strtod(s.c_str(), nullptr);',data:[62.0,72.4,102,125,305]},
{name:'std::string_view s = "1234.567e10"; std::from_chars(s.data(), s.data() + s.size(), res);',data:[25.6,26.4,70.7,100.0,109]},
{name:'ssa s = "1234.567e10"; double res = *s.to_double()',data:[29.0,26.8,38.8,41.1,42.9]}
]}</script>
<div class="benchset" id="bs19"><h4><a id="bs96505608161678391610" href="#bs96505608161678391610">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L852">std::stringstream str; ... str &lt;&lt; &quot;abbaabbaabbaabba&quot;;</a><span class="tooltiptext code">void AppendStreamConstLiteral(benchmark::State&amp; state) {
for (auto _: state) {
std::string result;
std::stringstream str;
for (size_t c = 0; c &lt; 64; c++) {
str &lt;&lt; TEXT_16;
}
result = str.str();
#ifdef CHECK_RESULT
if (result.size() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(str);
}
}</span></span></td><td></td><td class="benchmarkresult">1423</td><td class="benchmarkresult">1533</td><td class="benchmarkresult">5083</td><td class="benchmarkresult">6946</td><td class="benchmarkresult">6503</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L871">std::string str; ... str += &quot;abbaabbaabbaabba&quot;;</a><span class="tooltiptext code">void AppendStdStringConstLiteral(benchmark::State&amp; state) {
for (auto _: state) {
std::string result;
for (size_t c = 0; c &lt; 64; c++) {
result += TEXT_16;
}
#ifdef CHECK_RESULT
if (result.size() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
}
}</span></span></td><td></td><td class="benchmarkresult">439</td><td class="benchmarkresult">431</td><td class="benchmarkresult">1315</td><td class="benchmarkresult">1625</td><td class="benchmarkresult">825</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L887">lstringa&lt;8> str; ... str += &quot;abbaabbaabbaabba&quot;;</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstringConstLiteral(benchmark::State&amp; state) {
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 64; c++) {
result += TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
}
}</span></span></td><td></td><td class="benchmarkresult">424</td><td class="benchmarkresult">479</td><td class="benchmarkresult">867</td><td class="benchmarkresult">1160</td><td class="benchmarkresult">732</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L887">lstringa&lt;128> str; ... str += &quot;abbaabbaabbaabba&quot;;</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstringConstLiteral(benchmark::State&amp; state) {
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 64; c++) {
result += TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">Чем больше внутренний буфер, тем меньше раз требуется
аллокация, тем быстрее результат.
The larger the internal buffer, the fewer allocations are
required, and the faster the result.</span></span></td><td class="benchmarkresult">267</td><td class="benchmarkresult">319</td><td class="benchmarkresult">450</td><td class="benchmarkresult">614</td><td class="benchmarkresult">582</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L887">lstringa&lt;512> str; ... str += &quot;abbaabbaabbaabba&quot;;</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstringConstLiteral(benchmark::State&amp; state) {
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 64; c++) {
result += TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
}
}</span></span></td><td></td><td class="benchmarkresult">250</td><td class="benchmarkresult">285</td><td class="benchmarkresult">255</td><td class="benchmarkresult">409</td><td class="benchmarkresult">481</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L887">lstringa&lt;1024> str; ... str += &quot;abbaabbaabbaabba&quot;;</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstringConstLiteral(benchmark::State&amp; state) {
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 64; c++) {
result += TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
}
}</span></span></td><td></td><td class="benchmarkresult">139</td><td class="benchmarkresult">146</td><td class="benchmarkresult">146</td><td class="benchmarkresult">265</td><td class="benchmarkresult">416</td></tr>
</tbody></table></div><script>bench_sets['Append const literal of 16 bytes 64 times, 1024 total length'] = {id:'bs19', tests:[
{name:'std::stringstream str; ... str << "abbaabbaabbaabba";',data:[1423,1533,5083,6946,6503]},
{name:'std::string str; ... str += "abbaabbaabbaabba";',data:[439,431,1315,1625,825]},
{name:'lstringa<8> str; ... str += "abbaabbaabbaabba";',data:[424,479,867,1160,732]},
{name:'lstringa<128> str; ... str += "abbaabbaabbaabba";',data:[267,319,450,614,582]},
{name:'lstringa<512> str; ... str += "abbaabbaabbaabba";',data:[250,285,255,409,481]},
{name:'lstringa<1024> str; ... str += "abbaabbaabbaabba";',data:[139,146,146,265,416]}
]}</script>
<div class="benchset" id="bs20"><h4><a id="bs36931044816721597850" href="#bs36931044816721597850">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L912">std::stringstream str; ... str &lt;&lt; str_var &lt;&lt; &quot;abbaabbaabbaabba&quot;;</a><span class="tooltiptext code">void AppendStreamStrConstLiteral(benchmark::State&amp; state) {
std::string s1 = TEXT_16;
for (auto _: state) {
std::string result;
std::stringstream s;
for (size_t c = 0; c &lt; 32; c++) {
s &lt;&lt; s1 &lt;&lt; TEXT_16;
}
result = s.str();
#ifdef CHECK_RESULT
if (result.size() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
}
}</span></span></td><td></td><td class="benchmarkresult">1349</td><td class="benchmarkresult">1500</td><td class="benchmarkresult">5564</td><td class="benchmarkresult">6738</td><td class="benchmarkresult">6973</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L932">std::string str; ... str += str_var + &quot;abbaabbaabbaabba&quot;;</a><span class="tooltiptext code">void AppendStdStrStrConstLiteral(benchmark::State&amp; state) {
std::string p1 = TEXT_16;
for (auto _: state) {
std::string result;
for (size_t c = 0; c &lt; 32; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.size() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
}</span></span></td><td></td><td class="benchmarkresult">1243</td><td class="benchmarkresult">1394</td><td class="benchmarkresult">4477</td><td class="benchmarkresult">4494</td><td class="benchmarkresult">2270</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L950">lstringa&lt;8> str; ... str += str_var + &quot;abbaabbaabbaabba&quot;;</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstringStrConstLiteral(benchmark::State&amp; state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 32; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
}</span></span></td><td></td><td class="benchmarkresult">461</td><td class="benchmarkresult">499</td><td class="benchmarkresult">769</td><td class="benchmarkresult">971</td><td class="benchmarkresult">1025</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L950">lstringa&lt;128> str; ... str += str_var + &quot;abbaabbaabbaabba&quot;;</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstringStrConstLiteral(benchmark::State&amp; state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 32; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
}</span></span></td><td></td><td class="benchmarkresult">334</td><td class="benchmarkresult">434</td><td class="benchmarkresult">549</td><td class="benchmarkresult">647</td><td class="benchmarkresult">879</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L950">lstringa&lt;512> str; ... str += str_var + &quot;abbaabbaabbaabba&quot;;</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstringStrConstLiteral(benchmark::State&amp; state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 32; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
}</span></span></td><td></td><td class="benchmarkresult">319</td><td class="benchmarkresult">381</td><td class="benchmarkresult">333</td><td class="benchmarkresult">445</td><td class="benchmarkresult">749</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L950">lstringa&lt;1024> str; ... str += str_var + &quot;abbaabbaabbaabba&quot;;</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstringStrConstLiteral(benchmark::State&amp; state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 32; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
}</span></span></td><td></td><td class="benchmarkresult">228</td><td class="benchmarkresult">269</td><td class="benchmarkresult">215</td><td class="benchmarkresult">306</td><td class="benchmarkresult">694</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:'bs20', tests:[
{name:'std::stringstream str; ... str << str_var << "abbaabbaabbaabba";',data:[1349,1500,5564,6738,6973]},
{name:'std::string str; ... str += str_var + "abbaabbaabbaabba";',data:[1243,1394,4477,4494,2270]},
{name:'lstringa<8> str; ... str += str_var + "abbaabbaabbaabba";',data:[461,499,769,971,1025]},
{name:'lstringa<128> str; ... str += str_var + "abbaabbaabbaabba";',data:[334,434,549,647,879]},
{name:'lstringa<512> str; ... str += str_var + "abbaabbaabbaabba";',data:[319,381,333,445,749]},
{name:'lstringa<1024> str; ... str += str_var + "abbaabbaabbaabba";',data:[228,269,215,306,694]}
]}</script>
<div class="benchset" id="bs21"><h4><a id="bs8293767858383349360" href="#bs8293767858383349360">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L978">std::stringstream str; ... str &lt;&lt; str_var &lt;&lt; &quot;abbaabbaabbaabba&quot;; 2048 times</a><span class="tooltiptext code">void AppendStreamStrConstLiteralBig(benchmark::State&amp; state) {
std::string s1 = TEXT_16;
for (auto _: state) {
std::string result;
std::stringstream s;
for (size_t c = 0; c &lt; 2048; c++) {
s &lt;&lt; s1 &lt;&lt; TEXT_16;
}
result = s.str();
#ifdef CHECK_RESULT
if (result.size() != 1024 * 64) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
}
}</span></span></td><td></td><td class="benchmarkresult">74998</td><td class="benchmarkresult">89645</td><td class="benchmarkresult">212569</td><td class="benchmarkresult">338927</td><td class="benchmarkresult">344582</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L998">std::string str; ... str += str_var + &quot;abbaabbaabbaabba&quot;; 2048 times</a><span class="tooltiptext code">void AppendStdStrStrConstLiteralBig(benchmark::State&amp; state) {
std::string p1 = TEXT_16;
for (auto _: state) {
std::string result;
for (size_t c = 0; c &lt; 2048; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.size() != 1024 * 64) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
}</span></span></td><td></td><td class="benchmarkresult">70443</td><td class="benchmarkresult">91376</td><td class="benchmarkresult">183368</td><td class="benchmarkresult">237469</td><td class="benchmarkresult">121536</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1016">lstringa&lt;8> str; ... str += str_var + &quot;abbaabbaabbaabba&quot;; 2048 times</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstringStrConstLiteralBig(benchmark::State&amp; state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 2048; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024 * 64) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
}</span></span></td><td></td><td class="benchmarkresult">18578</td><td class="benchmarkresult">24896</td><td class="benchmarkresult">18492</td><td class="benchmarkresult">30325</td><td class="benchmarkresult">51397</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1016">lstringa&lt;128> str; ... str += str_var + &quot;abbaabbaabbaabba&quot;; 2048 times</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstringStrConstLiteralBig(benchmark::State&amp; state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 2048; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024 * 64) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
}</span></span></td><td></td><td class="benchmarkresult">18590</td><td class="benchmarkresult">21157</td><td class="benchmarkresult">16512</td><td class="benchmarkresult">28698</td><td class="benchmarkresult">47195</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1016">lstringa&lt;512> str; ... str += str_var + &quot;abbaabbaabbaabba&quot;; 2048 times</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstringStrConstLiteralBig(benchmark::State&amp; state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 2048; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024 * 64) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
}</span></span></td><td></td><td class="benchmarkresult">15811</td><td class="benchmarkresult">20898</td><td class="benchmarkresult">15660</td><td class="benchmarkresult">27579</td><td class="benchmarkresult">48258</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1016">lstringa&lt;1024> str; ... str += str_var + &quot;abbaabbaabbaabba&quot;; 2048 times</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstringStrConstLiteralBig(benchmark::State&amp; state) {
stringa p1 = TEXT_16;
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 2048; c++) {
result += p1 + TEXT_16;
}
#ifdef CHECK_RESULT
if (result.length() != 1024 * 64) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(p1);
}
}</span></span></td><td></td><td class="benchmarkresult">15906</td><td class="benchmarkresult">21053</td><td class="benchmarkresult">15990</td><td class="benchmarkresult">26870</td><td class="benchmarkresult">47889</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:'bs21', tests:[
{name:'std::stringstream str; ... str << str_var << "abbaabbaabbaabba"; 2048 times',data:[74998,89645,212569,338927,344582]},
{name:'std::string str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[70443,91376,183368,237469,121536]},
{name:'lstringa<8> str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[18578,24896,18492,30325,51397]},
{name:'lstringa<128> str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[18590,21157,16512,28698,47195]},
{name:'lstringa<512> str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[15811,20898,15660,27579,48258]},
{name:'lstringa<1024> str; ... str += str_var + "abbaabbaabbaabba"; 2048 times',data:[15906,21053,15990,26870,47889]}
]}</script>
<div class="benchset" id="bs22"><h4><a id="bs66949588770596833730" href="#bs66949588770596833730">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1043">std::stringstream str; ... str &lt;&lt; str_var1 &lt;&lt; str_var2;</a><span class="tooltiptext code">void AppendStream2String(benchmark::State&amp; 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 &lt; 32; c++) {
s &lt;&lt; s1 &lt;&lt; s2;
}
result = s.str();
#ifdef CHECK_RESULT
if (result.size() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
benchmark::DoNotOptimize(s2);
}
}</span></span></td><td></td><td class="benchmarkresult">1367</td><td class="benchmarkresult">1457</td><td class="benchmarkresult">4241</td><td class="benchmarkresult">6538</td><td class="benchmarkresult">7153</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1065">std::string str; ... str += str_var1 + str_var2;</a><span class="tooltiptext code">void AppendStdStr2String(benchmark::State&amp; state) {
std::string s1 = TEXT_16;
std::string s2 = TEXT_16;
for (auto _: state) {
std::string result;
for (size_t c = 0; c &lt; 32; c++) {
result += s1 + s2;
}
#ifdef CHECK_RESULT
if (result.size() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
benchmark::DoNotOptimize(s2);
}
}</span></span></td><td></td><td class="benchmarkresult">1353</td><td class="benchmarkresult">1597</td><td class="benchmarkresult">3791</td><td class="benchmarkresult">5100</td><td class="benchmarkresult">2679</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1086">lstringa&lt;16> str; ... str += str_var1 + str_var2;</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstring2String(benchmark::State&amp; state) {
stra s1 = TEXT_16;
stra s2 = TEXT_16;
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 32; c++) {
result += s1 + s2;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
benchmark::DoNotOptimize(s2);
}
}</span></span></td><td></td><td class="benchmarkresult">523</td><td class="benchmarkresult">581</td><td class="benchmarkresult">750</td><td class="benchmarkresult">1064</td><td class="benchmarkresult">1192</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1086">lstringa&lt;128> str; ... str += str_var1 + str_var2;</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstring2String(benchmark::State&amp; state) {
stra s1 = TEXT_16;
stra s2 = TEXT_16;
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 32; c++) {
result += s1 + s2;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
benchmark::DoNotOptimize(s2);
}
}</span></span></td><td></td><td class="benchmarkresult">436</td><td class="benchmarkresult">488</td><td class="benchmarkresult">499</td><td class="benchmarkresult">748</td><td class="benchmarkresult">1072</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1086">lstringa&lt;512> str; ... str += str_var1 + str_var2;</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstring2String(benchmark::State&amp; state) {
stra s1 = TEXT_16;
stra s2 = TEXT_16;
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 32; c++) {
result += s1 + s2;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
benchmark::DoNotOptimize(s2);
}
}</span></span></td><td></td><td class="benchmarkresult">395</td><td class="benchmarkresult">455</td><td class="benchmarkresult">372</td><td class="benchmarkresult">522</td><td class="benchmarkresult">969</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1086">lstringa&lt;1024> str; ... str += str_var1 + str_var2;</a><span class="tooltiptext code">template&lt;unsigned N>
void AppendLstring2String(benchmark::State&amp; state) {
stra s1 = TEXT_16;
stra s2 = TEXT_16;
for (auto _: state) {
lstringa&lt;N> result;
for (size_t c = 0; c &lt; 32; c++) {
result += s1 + s2;
}
#ifdef CHECK_RESULT
if (result.length() != 1024) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(s1);
benchmark::DoNotOptimize(s2);
}
}</span></span></td><td></td><td class="benchmarkresult">279</td><td class="benchmarkresult">347</td><td class="benchmarkresult">275</td><td class="benchmarkresult">389</td><td class="benchmarkresult">961</td></tr>
</tbody></table></div><script>bench_sets['Append 2 string of 16 bytes 32 times, 1024 total length'] = {id:'bs22', tests:[
{name:'std::stringstream str; ... str << str_var1 << str_var2;',data:[1367,1457,4241,6538,7153]},
{name:'std::string str; ... str += str_var1 + str_var2;',data:[1353,1597,3791,5100,2679]},
{name:'lstringa<16> str; ... str += str_var1 + str_var2;',data:[523,581,750,1064,1192]},
{name:'lstringa<128> str; ... str += str_var1 + str_var2;',data:[436,488,499,748,1072]},
{name:'lstringa<512> str; ... str += str_var1 + str_var2;',data:[395,455,372,522,969]},
{name:'lstringa<1024> str; ... str += str_var1 + str_var2;',data:[279,347,275,389,961]}
]}</script>
<div class="benchset" id="bs23"><h4><a id="bs130432147582115154460" href="#bs130432147582115154460">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1115">std::stringstream str; str &lt;&lt; &quot;test = &quot; &lt;&lt; k &lt;&lt; &quot; times&quot;;</a><span class="tooltiptext code">void AppendStreamStrNumStr(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned k = 1; k &lt;= 1&#39;000&#39;000&#39;000; k *= 10) {
std::stringstream t;
t &lt;&lt; &quot;test = &quot; &lt;&lt; k &lt;&lt; &quot; times&quot;;
std::string result = t.str();
#ifdef CHECK_RESULT
if (!result.starts_with(&quot;test = &quot;) || !result.ends_with(&quot; times&quot;)) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
}</span></span></td><td></td><td class="benchmarkresult">2983</td><td class="benchmarkresult">3363</td><td class="benchmarkresult">10371</td><td class="benchmarkresult">14863</td><td class="benchmarkresult">11771</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1133">std::string str = &quot;test = &quot; + std::to_string(k) + &quot; times&quot;;</a><span class="tooltiptext code">void AppendStdStringStrNumStr(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned k = 1; k &lt;= 1&#39;000&#39;000&#39;000; k *= 10) {
std::string result = &quot;test = &quot; + std::to_string(k) + &quot; times&quot;;
#ifdef CHECK_RESULT
if (!result.starts_with(&quot;test = &quot;) || !result.ends_with(&quot; times&quot;)) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
}</span></span></td><td></td><td class="benchmarkresult">489</td><td class="benchmarkresult">489</td><td class="benchmarkresult">1028</td><td class="benchmarkresult">1420</td><td class="benchmarkresult">1737</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1149">char buf[100]; sprintf(buf, &quot;test = %u times&quot;, k); std::string str = buf;</a><span class="tooltiptext code">void AppendSprintfStrNumStr(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned k = 1; k &lt;= 1&#39;000&#39;000&#39;000; k *= 10) {
char buf[100];
std::sprintf(buf, &quot;test = %u times&quot;, k);
std::string result = buf;
#ifdef CHECK_RESULT
if (!result.starts_with(&quot;test = &quot;) || !result.ends_with(&quot; times&quot;)) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
}</span></span></td><td></td><td class="benchmarkresult">1352</td><td class="benchmarkresult">1726</td><td class="benchmarkresult">2704</td><td class="benchmarkresult">3266</td><td class="benchmarkresult">5495</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1167">std::string str = std::format(&quot;test = {} times&quot;, k);</a><span class="tooltiptext code">void AppendFormatStrNumStr(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned k = 1; k &lt;= 1&#39;000&#39;000&#39;000; k *= 10) {
std::string result = std::format(&quot;test = {} times&quot;, k);
#ifdef CHECK_RESULT
if (!result.starts_with(&quot;test = &quot;) || !result.ends_with(&quot; times&quot;)) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
}</span></span></td><td></td><td class="benchmarkresult">1116</td><td class="benchmarkresult">1476</td><td class="benchmarkresult">1802</td><td class="benchmarkresult">2699</td><td class="benchmarkresult">2890</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1183">lstringa&lt;8> str; str.format(&quot;test = {} times&quot;, k);</a><span class="tooltiptext code">template&lt;typename T>
void AppendSimStrStrNumStrF(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned k = 1; k &lt;= 1&#39;000&#39;000&#39;000; k *= 10) {
T result;
result.format(&quot;test = {} times&quot;, k);
#ifdef CHECK_RESULT
if (!result.starts_with(&quot;test = &quot;) || !result.ends_with(&quot; times&quot;)) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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">1300</td><td class="benchmarkresult">1877</td><td class="benchmarkresult">2052</td><td class="benchmarkresult">2910</td><td class="benchmarkresult">4860</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1183">lstringa&lt;32> str; str.format(&quot;test = {} times&quot;, k);</a><span class="tooltiptext code">template&lt;typename T>
void AppendSimStrStrNumStrF(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned k = 1; k &lt;= 1&#39;000&#39;000&#39;000; k *= 10) {
T result;
result.format(&quot;test = {} times&quot;, k);
#ifdef CHECK_RESULT
if (!result.starts_with(&quot;test = &quot;) || !result.ends_with(&quot; times&quot;)) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">А в такую помещается. Используйте сразу буфера подходящего размера.
And it fits in this one. Use buffers of the appropriate size right away.</span></span></td><td class="benchmarkresult">952</td><td class="benchmarkresult">1239</td><td class="benchmarkresult">1013</td><td class="benchmarkresult">1721</td><td class="benchmarkresult">4213</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1201">lstringa&lt;8> str = &quot;test = &quot; + k + &quot; times&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void AppendSimStrStrNumStr(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned k = 1; k &lt;= 1&#39;000&#39;000&#39;000; k *= 10) {
T result = &quot;test = &quot;_ss + k + &quot; times&quot;;
#ifdef CHECK_RESULT
if (!result.starts_with(&quot;test = &quot;) || !result.ends_with(&quot; times&quot;)) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">Результат не помещается в SSO, возникает аллокация.
The result does not fit into SSO, an allocation occurs.</span></span></td><td class="benchmarkresult">280</td><td class="benchmarkresult">353</td><td class="benchmarkresult">807</td><td class="benchmarkresult">1075</td><td class="benchmarkresult">584</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1201">lstringa&lt;32> str = &quot;test = &quot; + k + &quot; times&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void AppendSimStrStrNumStr(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned k = 1; k &lt;= 1&#39;000&#39;000&#39;000; k *= 10) {
T result = &quot;test = &quot;_ss + k + &quot; times&quot;;
#ifdef CHECK_RESULT
if (!result.starts_with(&quot;test = &quot;) || !result.ends_with(&quot; times&quot;)) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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">148</td><td class="benchmarkresult">188</td><td class="benchmarkresult">152</td><td class="benchmarkresult">208</td><td class="benchmarkresult">332</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1201">stringa str = &quot;test = &quot; + k + &quot; times&quot;;</a><span class="tooltiptext code">template&lt;typename T>
void AppendSimStrStrNumStr(benchmark::State&amp; state) {
for (auto _: state) {
for (unsigned k = 1; k &lt;= 1&#39;000&#39;000&#39;000; k *= 10) {
T result = &quot;test = &quot;_ss + k + &quot; times&quot;;
#ifdef CHECK_RESULT
if (!result.starts_with(&quot;test = &quot;) || !result.ends_with(&quot; times&quot;)) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(k);
}
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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">147</td><td class="benchmarkresult">180</td><td class="benchmarkresult">149</td><td class="benchmarkresult">263</td><td class="benchmarkresult">594</td></tr>
</tbody></table></div><script>bench_sets['Append text, number, text'] = {id:'bs23', tests:[
{name:'std::stringstream str; str << "test = " << k << " times";',data:[2983,3363,10371,14863,11771]},
{name:'std::string str = "test = " + std::to_string(k) + " times";',data:[489,489,1028,1420,1737]},
{name:'char buf[100]; sprintf(buf, "test = %u times", k); std::string str = buf;',data:[1352,1726,2704,3266,5495]},
{name:'std::string str = std::format("test = {} times", k);',data:[1116,1476,1802,2699,2890]},
{name:'lstringa<8> str; str.format("test = {} times", k);',data:[1300,1877,2052,2910,4860]},
{name:'lstringa<32> str; str.format("test = {} times", k);',data:[952,1239,1013,1721,4213]},
{name:'lstringa<8> str = "test = " + k + " times";',data:[280,353,807,1075,584]},
{name:'lstringa<32> str = "test = " + k + " times";',data:[148,188,152,208,332]},
{name:'stringa str = "test = " + k + " times";',data:[147,180,149,263,594]}
]}</script>
<div class="benchset" id="bs24"><h4><a id="bs7106975351756760120" href="#bs7106975351756760120">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1231">std::string::find + substr + std::strtol</a><span class="tooltiptext code">void SplitConvertIntStdString(benchmark::State&amp; state) {
std::string numbers = NUMBER_LIST;
for (auto _: state) {
int total = 0;
for (size_t start = 0; start &lt; numbers.length(); ) {
int delim = numbers.find(&quot;-!-&quot;, 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(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(total);
benchmark::DoNotOptimize(numbers);
}
}</span></span></td><td></td><td class="benchmarkresult">255</td><td class="benchmarkresult">317</td><td class="benchmarkresult">518</td><td class="benchmarkresult">618</td><td class="benchmarkresult">658</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1255">ssa::splitter + ssa::as_int</a><span class="tooltiptext code">void SplitConvertIntSimStr(benchmark::State&amp; state) {
stra numbers = NUMBER_LIST;
for (auto _: state) {
int total = 0;
for (auto splitter = numbers.splitter(&quot;-!-&quot;); !splitter.is_done();) {
total += splitter.next().as_int&lt;int>();
}
#ifdef CHECK_RESULT
if (total != 218) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(total);
benchmark::DoNotOptimize(numbers);
}
}</span></span></td><td></td><td class="benchmarkresult">157</td><td class="benchmarkresult">143</td><td class="benchmarkresult">158</td><td class="benchmarkresult">329</td><td class="benchmarkresult">243</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1272">ssa::splitf + functor</a><span class="tooltiptext code">void SplitConvertIntSplitf(benchmark::State&amp; state) {
stra numbers = NUMBER_LIST;
for (auto _: state) {
int total = 0;
numbers.splitf&lt;void>(&quot;-!-&quot;, [&amp;](ssa&amp; part){total += part.as_int&lt;int>();});
#ifdef CHECK_RESULT
if (total != 218) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(total);
benchmark::DoNotOptimize(numbers);
}
}</span></span></td><td></td><td class="benchmarkresult">199</td><td class="benchmarkresult">145</td><td class="benchmarkresult">183</td><td class="benchmarkresult">241</td><td class="benchmarkresult">272</td></tr>
</tbody></table></div><script>bench_sets['Split text and convert to int'] = {id:'bs24', tests:[
{name:'std::string::find + substr + std::strtol',data:[255,317,518,618,658]},
{name:'ssa::splitter + ssa::as_int',data:[157,143,158,329,243]},
{name:'ssa::splitf + functor',data:[199,145,183,241,272]}
]}</script>
<div class="benchset" id="bs25"><h4><a id="bs151373809886162287550" href="#bs151373809886162287550">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1293">Naive (and wrong) replace symbols with std::string find + replace</a><span class="tooltiptext code">void ReplaceSymbolsStdStringNaiveWrong(benchmark::State&amp; state) {
std::string_view source =
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
;
std::vector&lt;std::pair&lt;u8s, std::string_view>> repl = {
{&#39;&amp;&#39;, &quot;&amp;amp;&quot;},
{&#39;-&#39;, &quot;&quot;},
{&#39;&lt;&#39;, &quot;&amp;lt;&quot;},
{&#39;>&#39;, &quot;&amp;gt;&quot;},
{&#39;\&#39;&#39;, &quot;&amp;#39;&quot;},
{&#39;\&quot;&#39;, &quot;&amp;quot;&quot;}
};
auto repl_all = [](std::string&amp; 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&amp; r : repl) {
repl_all(result, r.first, r.second);
}
#ifdef CHECK_RESULT
if (result
!=
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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">843</td><td class="benchmarkresult">924</td><td class="benchmarkresult">1164</td><td class="benchmarkresult">1431</td><td class="benchmarkresult">3275</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1347">replace symbols with std::string find_first_of + replace</a><span class="tooltiptext code">void ReplaceSymbolsStdStringNaiveRight(benchmark::State&amp; state) {
std::string_view source =
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
;
std::vector&lt;std::pair&lt;u8s, std::string_view>> repl = {
{&#39;-&#39;, &quot;&quot;},
{&#39;&lt;&#39;, &quot;&amp;lt;&quot;},
{&#39;>&#39;, &quot;&amp;gt;&quot;},
{&#39;\&#39;&#39;, &quot;&amp;#39;&quot;},
{&#39;\&quot;&#39;, &quot;&amp;quot;&quot;},
{&#39;&amp;&#39;, &quot;&amp;amp;&quot;},
};
for (auto _: state) {
std::string result{source};
std::string pattern;
for (const auto&amp; 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
!=
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">Дальше уже правильные реализации, не зависящие от конфликтующих замен.
Further, there are correct implementations that do not depend on
conflicting replacements.</span></span></td><td class="benchmarkresult">2378</td><td class="benchmarkresult">2915</td><td class="benchmarkresult">1997</td><td class="benchmarkresult">2636</td><td class="benchmarkresult">5069</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1401">replace symbols with std::string_view find_first_of + copy</a><span class="tooltiptext code">void ReplaceSymbolsStdString(benchmark::State&amp; state) {
std::string_view source =
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
;
const std::string_view repl_from = &quot;-&lt;>&#39;\&quot;&amp;&quot;;
const std::string_view repl_to[] = {&quot;&quot;, &quot;&amp;lt;&quot;, &quot;&amp;gt;&quot;, &quot;&amp;#39;&quot;, &quot;&amp;quot;&quot;, &quot;&amp;amp;&quot;};
for (auto _: state) {
std::string result;
for (size_t start = 0; start &lt; 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
!=
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">1090</td><td class="benchmarkresult">1097</td><td class="benchmarkresult">2301</td><td class="benchmarkresult">2944</td><td class="benchmarkresult">3253</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1454">replace runtime symbols with string expressions and without remembering all search results</a><span class="tooltiptext code">template&lt;bool UseVector>
void ReplaceSymbolsDynPatternSimStr(benchmark::State&amp; state) {
stra source =
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
;
std::vector&lt;std::pair&lt;u8s, ssa>> repl = {
{&#39;-&#39;, &quot;&quot;},
{&#39;&lt;&#39;, &quot;&amp;lt;&quot;},
{&#39;>&#39;, &quot;&amp;gt;&quot;},
{&#39;\&#39;&#39;, &quot;&amp;#39;&quot;},
{&#39;\&quot;&#39;, &quot;&amp;quot;&quot;},
{&#39;&amp;&#39;, &quot;&amp;amp;&quot;},
};
for (auto _: state) {
stringa result = expr_replace_symbols&lt;u8s, UseVector>{source, repl};
#ifdef CHECK_RESULT
if (result
!=
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">1226</td><td class="benchmarkresult">1593</td><td class="benchmarkresult">1421</td><td class="benchmarkresult">1831</td><td class="benchmarkresult">3098</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1454">replace runtime symbols with simstr and memorization of all search results</a><span class="tooltiptext code">template&lt;bool UseVector>
void ReplaceSymbolsDynPatternSimStr(benchmark::State&amp; state) {
stra source =
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
;
std::vector&lt;std::pair&lt;u8s, ssa>> repl = {
{&#39;-&#39;, &quot;&quot;},
{&#39;&lt;&#39;, &quot;&amp;lt;&quot;},
{&#39;>&#39;, &quot;&amp;gt;&quot;},
{&#39;\&#39;&#39;, &quot;&amp;#39;&quot;},
{&#39;\&quot;&#39;, &quot;&amp;quot;&quot;},
{&#39;&amp;&#39;, &quot;&amp;amp;&quot;},
};
for (auto _: state) {
stringa result = expr_replace_symbols&lt;u8s, UseVector>{source, repl};
#ifdef CHECK_RESULT
if (result
!=
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">965</td><td class="benchmarkresult">1176</td><td class="benchmarkresult">1301</td><td class="benchmarkresult">1620</td><td class="benchmarkresult">2461</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1501">replace const symbols with string expressions and without remembering all search results</a><span class="tooltiptext code">template&lt;bool UseVector>
void ReplaceSymbolsCons2PatternSimStr(benchmark::State&amp; state) {
stra source =
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
;
for (auto _: state) {
stringa result = e_repl_const_symbols&lt;UseVector>(source,
&#39;-&#39;, &quot;&quot;,
&#39;&lt;&#39;, &quot;&amp;lt;&quot;,
&#39;>&#39;, &quot;&amp;gt;&quot;,
&#39;\&#39;&#39;, &quot;&amp;#39;&quot;,
&#39;\&quot;&#39;, &quot;&amp;quot;&quot;,
&#39;&amp;&#39;, &quot;&amp;amp;&quot;
);
#ifdef CHECK_RESULT
if (result
!=
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">1100</td><td class="benchmarkresult">1365</td><td class="benchmarkresult">1201</td><td class="benchmarkresult">1505</td><td class="benchmarkresult">2686</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1501">replace const symbols with string expressions and memorization of all search results</a><span class="tooltiptext code">template&lt;bool UseVector>
void ReplaceSymbolsCons2PatternSimStr(benchmark::State&amp; state) {
stra source =
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
&quot; ksjd-fksjd \&quot;dkjfs-jkhdf dfj &#39; kdkd \&quot;dkfdkfkdjf&quot;
;
for (auto _: state) {
stringa result = e_repl_const_symbols&lt;UseVector>(source,
&#39;-&#39;, &quot;&quot;,
&#39;&lt;&#39;, &quot;&amp;lt;&quot;,
&#39;>&#39;, &quot;&amp;gt;&quot;,
&#39;\&#39;&#39;, &quot;&amp;#39;&quot;,
&#39;\&quot;&#39;, &quot;&amp;quot;&quot;,
&#39;&amp;&#39;, &quot;&amp;amp;&quot;
);
#ifdef CHECK_RESULT
if (result
!=
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
&quot; ksjdfksjd &amp;quot;dkjfsjkhdf dfj &amp;#39; kdkd &amp;quot;dkfdkfkdjf&quot;
) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">837</td><td class="benchmarkresult">988</td><td class="benchmarkresult">1111</td><td class="benchmarkresult">1441</td><td class="benchmarkresult">2207</td></tr>
</tbody></table></div><script>bench_sets['Replace symbols in text ~400 symbols'] = {id:'bs25', tests:[
{name:'Naive (and wrong) replace symbols with std::string find + replace',data:[843,924,1164,1431,3275]},
{name:'replace symbols with std::string find_first_of + replace',data:[2378,2915,1997,2636,5069]},
{name:'replace symbols with std::string_view find_first_of + copy',data:[1090,1097,2301,2944,3253]},
{name:'replace runtime symbols with string expressions and without remembering all search results',data:[1226,1593,1421,1831,3098]},
{name:'replace runtime symbols with simstr and memorization of all search results',data:[965,1176,1301,1620,2461]},
{name:'replace const symbols with string expressions and without remembering all search results',data:[1100,1365,1201,1505,2686]},
{name:'replace const symbols with string expressions and memorization of all search results',data:[837,988,1111,1441,2207]}
]}</script>
<div class="benchset" id="bs26"><h4><a id="bs96756339547767401190" href="#bs96756339547767401190">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1555">Short Naive (and wrong) replace symbols with std::string find + replace</a><span class="tooltiptext code">void ShortReplaceSymbolsStdStringNaiveWrong(benchmark::State&amp; state) {
std::string_view source =
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
;
std::vector&lt;std::pair&lt;u8s, std::string_view>> repl = {
{&#39;&amp;&#39;, &quot;&amp;amp;&quot;},
{&#39;-&#39;, &quot;&quot;},
{&#39;&lt;&#39;, &quot;&amp;lt;&quot;},
{&#39;>&#39;, &quot;&amp;gt;&quot;},
{&#39;\&#39;&#39;, &quot;&amp;#39;&quot;},
{&#39;\&quot;&#39;, &quot;&amp;quot;&quot;}
};
auto repl_all = [](std::string&amp; 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&amp; r : repl) {
repl_all(result, r.first, r.second);
}
#ifdef CHECK_RESULT
if (result
!=
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">158</td><td class="benchmarkresult">182</td><td class="benchmarkresult">304</td><td class="benchmarkresult">414</td><td class="benchmarkresult">449</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1595">Short replace symbols with std::string find_first_of + replace</a><span class="tooltiptext code">void ShortReplaceSymbolsStdStringNaiveRight(benchmark::State&amp; state) {
std::string_view source =
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
;
std::vector&lt;std::pair&lt;u8s, std::string_view>> repl = {
{&#39;-&#39;, &quot;&quot;},
{&#39;&lt;&#39;, &quot;&amp;lt;&quot;},
{&#39;>&#39;, &quot;&amp;gt;&quot;},
{&#39;\&#39;&#39;, &quot;&amp;#39;&quot;},
{&#39;\&quot;&#39;, &quot;&amp;quot;&quot;},
{&#39;&amp;&#39;, &quot;&amp;amp;&quot;},
};
for (auto _: state) {
std::string result{source};
std::string pattern;
for (const auto&amp; 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
!=
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">304</td><td class="benchmarkresult">332</td><td class="benchmarkresult">380</td><td class="benchmarkresult">504</td><td class="benchmarkresult">662</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1635">Short replace symbols with std::string_view find_first_of + copy</a><span class="tooltiptext code">void ShortReplaceSymbolsStdString(benchmark::State&amp; state) {
std::string_view source =
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
;
const std::string_view repl_from = &quot;-&lt;>&#39;\&quot;&amp;&quot;;
const std::string_view repl_to[] = {&quot;&quot;, &quot;&amp;lt;&quot;, &quot;&amp;gt;&quot;, &quot;&amp;#39;&quot;, &quot;&amp;quot;&quot;, &quot;&amp;amp;&quot;};
for (auto _: state) {
std::string result;
for (size_t start = 0; start &lt; 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
!=
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">159</td><td class="benchmarkresult">189</td><td class="benchmarkresult">314</td><td class="benchmarkresult">436</td><td class="benchmarkresult">455</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1674">Short replace runtime symbols with string expressions and without remembering all search results</a><span class="tooltiptext code">template&lt;bool UseVector>
void ShortReplaceSymbolsDynPatternSimStr(benchmark::State&amp; state) {
stra source =
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
;
std::vector&lt;std::pair&lt;u8s, ssa>> repl = {
{&#39;-&#39;, &quot;&quot;},
{&#39;&lt;&#39;, &quot;&amp;lt;&quot;},
{&#39;>&#39;, &quot;&amp;gt;&quot;},
{&#39;\&#39;&#39;, &quot;&amp;#39;&quot;},
{&#39;\&quot;&#39;, &quot;&amp;quot;&quot;},
{&#39;&amp;&#39;, &quot;&amp;amp;&quot;},
};
for (auto _: state) {
stringa result = expr_replace_symbols&lt;u8s, UseVector>{source, repl};
#ifdef CHECK_RESULT
if (result
!=
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">170</td><td class="benchmarkresult">214</td><td class="benchmarkresult">259</td><td class="benchmarkresult">364</td><td class="benchmarkresult">405</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1674">Short replace runtime symbols with simstr and memorization of all search results</a><span class="tooltiptext code">template&lt;bool UseVector>
void ShortReplaceSymbolsDynPatternSimStr(benchmark::State&amp; state) {
stra source =
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
;
std::vector&lt;std::pair&lt;u8s, ssa>> repl = {
{&#39;-&#39;, &quot;&quot;},
{&#39;&lt;&#39;, &quot;&amp;lt;&quot;},
{&#39;>&#39;, &quot;&amp;gt;&quot;},
{&#39;\&#39;&#39;, &quot;&amp;#39;&quot;},
{&#39;\&quot;&#39;, &quot;&amp;quot;&quot;},
{&#39;&amp;&#39;, &quot;&amp;amp;&quot;},
};
for (auto _: state) {
stringa result = expr_replace_symbols&lt;u8s, UseVector>{source, repl};
#ifdef CHECK_RESULT
if (result
!=
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">176</td><td class="benchmarkresult">214</td><td class="benchmarkresult">336</td><td class="benchmarkresult">473</td><td class="benchmarkresult">445</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1707">Short replace const symbols with string expressions and without remembering all search results</a><span class="tooltiptext code">template&lt;bool UseVector>
void ShortReplaceSymbolsCons2PatternSimStr(benchmark::State&amp; state) {
stra source =
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
;
for (auto _: state) {
stringa result = e_repl_const_symbols&lt;UseVector>(source,
&#39;-&#39;, &quot;&quot;,
&#39;&lt;&#39;, &quot;&amp;lt;&quot;,
&#39;>&#39;, &quot;&amp;gt;&quot;,
&#39;\&#39;&#39;, &quot;&amp;#39;&quot;,
&#39;\&quot;&#39;, &quot;&amp;quot;&quot;,
&#39;&amp;&#39;, &quot;&amp;amp;&quot;
);
#ifdef CHECK_RESULT
if (result
!=
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">127</td><td class="benchmarkresult">177</td><td class="benchmarkresult">212</td><td class="benchmarkresult">309</td><td class="benchmarkresult">280</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1707">Short replace const symbols with string expressions and memorization of all search results</a><span class="tooltiptext code">template&lt;bool UseVector>
void ShortReplaceSymbolsCons2PatternSimStr(benchmark::State&amp; state) {
stra source =
&quot;abcdefg124 &lt; jhsfjsh sjdfsh jfhjd &amp;&amp; jdjdj >&quot;
;
for (auto _: state) {
stringa result = e_repl_const_symbols&lt;UseVector>(source,
&#39;-&#39;, &quot;&quot;,
&#39;&lt;&#39;, &quot;&amp;lt;&quot;,
&#39;>&#39;, &quot;&amp;gt;&quot;,
&#39;\&#39;&#39;, &quot;&amp;#39;&quot;,
&#39;\&quot;&#39;, &quot;&amp;quot;&quot;,
&#39;&amp;&#39;, &quot;&amp;amp;&quot;
);
#ifdef CHECK_RESULT
if (result
!=
&quot;abcdefg124 &amp;lt; jhsfjsh sjdfsh jfhjd &amp;amp;&amp;amp; jdjdj &amp;gt;&quot;
) {
state.SkipWithError(&quot;not equal&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">139</td><td class="benchmarkresult">175</td><td class="benchmarkresult">293</td><td class="benchmarkresult">404</td><td class="benchmarkresult">320</td></tr>
</tbody></table></div><script>bench_sets['Replace symbols in text ~40 symbols'] = {id:'bs26', tests:[
{name:'Short Naive (and wrong) replace symbols with std::string find + replace',data:[158,182,304,414,449]},
{name:'Short replace symbols with std::string find_first_of + replace',data:[304,332,380,504,662]},
{name:'Short replace symbols with std::string_view find_first_of + copy',data:[159,189,314,436,455]},
{name:'Short replace runtime symbols with string expressions and without remembering all search results',data:[170,214,259,364,405]},
{name:'Short replace runtime symbols with simstr and memorization of all search results',data:[176,214,336,473,445]},
{name:'Short replace const symbols with string expressions and without remembering all search results',data:[127,177,212,309,280]},
{name:'Short replace const symbols with string expressions and memorization of all search results',data:[139,175,293,404,320]}
]}</script>
<div class="benchset" id="bs27"><h4><a id="bs77745698784557935900" href="#bs77745698784557935900">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1746">replace bb to ---- in std::string|64</a><span class="tooltiptext code">template&lt;size_t Long>
void ReplaceAllLongerStdString(benchmark::State&amp; state) {
std::string_view source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
std::string_view sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
std::string_view pattern = &quot;bb&quot;;
std::string_view repl = &quot;----&quot;;
std::string big_source, big_sample;
for (int i = 0; i &lt; 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(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">156</td><td class="benchmarkresult">207</td><td class="benchmarkresult">221</td><td class="benchmarkresult">282</td><td class="benchmarkresult">422</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1746">replace bb to ---- in std::string|256</a><span class="tooltiptext code">template&lt;size_t Long>
void ReplaceAllLongerStdString(benchmark::State&amp; state) {
std::string_view source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
std::string_view sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
std::string_view pattern = &quot;bb&quot;;
std::string_view repl = &quot;----&quot;;
std::string big_source, big_sample;
for (int i = 0; i &lt; 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(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">540</td><td class="benchmarkresult">587</td><td class="benchmarkresult">732</td><td class="benchmarkresult">919</td><td class="benchmarkresult">1316</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1746">replace bb to ---- in std::string|512</a><span class="tooltiptext code">template&lt;size_t Long>
void ReplaceAllLongerStdString(benchmark::State&amp; state) {
std::string_view source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
std::string_view sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
std::string_view pattern = &quot;bb&quot;;
std::string_view repl = &quot;----&quot;;
std::string big_source, big_sample;
for (int i = 0; i &lt; 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(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">1007</td><td class="benchmarkresult">1121</td><td class="benchmarkresult">1412</td><td class="benchmarkresult">1724</td><td class="benchmarkresult">2446</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1746">replace bb to ---- in std::string|1024</a><span class="tooltiptext code">template&lt;size_t Long>
void ReplaceAllLongerStdString(benchmark::State&amp; state) {
std::string_view source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
std::string_view sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
std::string_view pattern = &quot;bb&quot;;
std::string_view repl = &quot;----&quot;;
std::string big_source, big_sample;
for (int i = 0; i &lt; 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(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">2290</td><td class="benchmarkresult">2606</td><td class="benchmarkresult">3187</td><td class="benchmarkresult">3706</td><td class="benchmarkresult">5109</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1746">replace bb to ---- in std::string|2048</a><span class="tooltiptext code">template&lt;size_t Long>
void ReplaceAllLongerStdString(benchmark::State&amp; state) {
std::string_view source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
std::string_view sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
std::string_view pattern = &quot;bb&quot;;
std::string_view repl = &quot;----&quot;;
std::string big_source, big_sample;
for (int i = 0; i &lt; 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(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">5743</td><td class="benchmarkresult">6608</td><td class="benchmarkresult">7649</td><td class="benchmarkresult">9489</td><td class="benchmarkresult">11848</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1780">replace bb to ---- in lstringa&lt;8>|64</a><span class="tooltiptext code">template&lt;size_t N, size_t Count>
void ReplaceAllLongerSimString(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
lstringa&lt;N> result = big_source;
result.replace(&quot;bb&quot;, &quot;----&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">134</td><td class="benchmarkresult">167</td><td class="benchmarkresult">220</td><td class="benchmarkresult">288</td><td class="benchmarkresult">313</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1780">replace bb to ---- in lstringa&lt;8>|256</a><span class="tooltiptext code">template&lt;size_t N, size_t Count>
void ReplaceAllLongerSimString(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
lstringa&lt;N> result = big_source;
result.replace(&quot;bb&quot;, &quot;----&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">433</td><td class="benchmarkresult">555</td><td class="benchmarkresult">590</td><td class="benchmarkresult">759</td><td class="benchmarkresult">997</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1780">replace bb to ---- in lstringa&lt;8>|512</a><span class="tooltiptext code">template&lt;size_t N, size_t Count>
void ReplaceAllLongerSimString(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
lstringa&lt;N> result = big_source;
result.replace(&quot;bb&quot;, &quot;----&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">808</td><td class="benchmarkresult">1029</td><td class="benchmarkresult">1038</td><td class="benchmarkresult">1313</td><td class="benchmarkresult">1738</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1780">replace bb to ---- in lstringa&lt;8>|1024</a><span class="tooltiptext code">template&lt;size_t N, size_t Count>
void ReplaceAllLongerSimString(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
lstringa&lt;N> result = big_source;
result.replace(&quot;bb&quot;, &quot;----&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">1654</td><td class="benchmarkresult">2079</td><td class="benchmarkresult">1942</td><td class="benchmarkresult">2382</td><td class="benchmarkresult">3403</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1780">replace bb to ---- in lstringa&lt;8>|2048</a><span class="tooltiptext code">template&lt;size_t N, size_t Count>
void ReplaceAllLongerSimString(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
lstringa&lt;N> result = big_source;
result.replace(&quot;bb&quot;, &quot;----&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">3144</td><td class="benchmarkresult">3960</td><td class="benchmarkresult">3514</td><td class="benchmarkresult">4381</td><td class="benchmarkresult">6488</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1803">replace bb to ---- by init stringa|64</a><span class="tooltiptext code">template&lt;size_t Count>
void ReplaceAllLongerSimStringExpr(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), &quot;bb&quot;, &quot;----&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">92.8</td><td class="benchmarkresult">116</td><td class="benchmarkresult">170</td><td class="benchmarkresult">243</td><td class="benchmarkresult">197</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1803">replace bb to ---- by init stringa|256</a><span class="tooltiptext code">template&lt;size_t Count>
void ReplaceAllLongerSimStringExpr(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), &quot;bb&quot;, &quot;----&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">304</td><td class="benchmarkresult">334</td><td class="benchmarkresult">351</td><td class="benchmarkresult">545</td><td class="benchmarkresult">637</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1803">replace bb to ---- by init stringa|512</a><span class="tooltiptext code">template&lt;size_t Count>
void ReplaceAllLongerSimStringExpr(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), &quot;bb&quot;, &quot;----&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">692</td><td class="benchmarkresult">826</td><td class="benchmarkresult">791</td><td class="benchmarkresult">1166</td><td class="benchmarkresult">1461</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1803">replace bb to ---- by init stringa|1024</a><span class="tooltiptext code">template&lt;size_t Count>
void ReplaceAllLongerSimStringExpr(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), &quot;bb&quot;, &quot;----&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">1497</td><td class="benchmarkresult">1816</td><td class="benchmarkresult">1624</td><td class="benchmarkresult">2479</td><td class="benchmarkresult">3067</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1803">replace bb to ---- by init stringa|2048</a><span class="tooltiptext code">template&lt;size_t Count>
void ReplaceAllLongerSimStringExpr(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa----baaaaaaaa--------aaaaabaaaaaaaaaaaaaaaaaaaaa----a&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), &quot;bb&quot;, &quot;----&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">3011</td><td class="benchmarkresult">3707</td><td class="benchmarkresult">3034</td><td class="benchmarkresult">4975</td><td class="benchmarkresult">5928</td></tr>
</tbody></table></div><script>bench_sets['Replace All Str To Longer Size'] = {id:'bs27', tests:[
{name:'replace bb to ---- in std::string|64',data:[156,207,221,282,422]},
{name:'replace bb to ---- in std::string|256',data:[540,587,732,919,1316]},
{name:'replace bb to ---- in std::string|512',data:[1007,1121,1412,1724,2446]},
{name:'replace bb to ---- in std::string|1024',data:[2290,2606,3187,3706,5109]},
{name:'replace bb to ---- in std::string|2048',data:[5743,6608,7649,9489,11848]},
{name:'replace bb to ---- in lstringa<8>|64',data:[134,167,220,288,313]},
{name:'replace bb to ---- in lstringa<8>|256',data:[433,555,590,759,997]},
{name:'replace bb to ---- in lstringa<8>|512',data:[808,1029,1038,1313,1738]},
{name:'replace bb to ---- in lstringa<8>|1024',data:[1654,2079,1942,2382,3403]},
{name:'replace bb to ---- in lstringa<8>|2048',data:[3144,3960,3514,4381,6488]},
{name:'replace bb to ---- by init stringa|64',data:[92.8,116,170,243,197]},
{name:'replace bb to ---- by init stringa|256',data:[304,334,351,545,637]},
{name:'replace bb to ---- by init stringa|512',data:[692,826,791,1166,1461]},
{name:'replace bb to ---- by init stringa|1024',data:[1497,1816,1624,2479,3067]},
{name:'replace bb to ---- by init stringa|2048',data:[3011,3707,3034,4975,5928]}
]}</script>
<div class="benchset" id="bs28"><h4><a id="bs74494088982050398630" href="#bs74494088982050398630">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1825">replace bb to -- in std::string|64</a><span class="tooltiptext code">template&lt;size_t Long>
void ReplaceAllEqualStdString(benchmark::State&amp; state) {
std::string_view source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
std::string_view sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
std::string_view pattern = &quot;bb&quot;;
std::string_view repl = &quot;--&quot;;
std::string big_source, big_sample;
for (int i = 0; i &lt; 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(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">119</td><td class="benchmarkresult">144</td><td class="benchmarkresult">188</td><td class="benchmarkresult">239</td><td class="benchmarkresult">274</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1825">replace bb to -- in std::string|256</a><span class="tooltiptext code">template&lt;size_t Long>
void ReplaceAllEqualStdString(benchmark::State&amp; state) {
std::string_view source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
std::string_view sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
std::string_view pattern = &quot;bb&quot;;
std::string_view repl = &quot;--&quot;;
std::string big_source, big_sample;
for (int i = 0; i &lt; 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(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">410</td><td class="benchmarkresult">458</td><td class="benchmarkresult">453</td><td class="benchmarkresult">598</td><td class="benchmarkresult">866</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1825">replace bb to -- in std::string|512</a><span class="tooltiptext code">template&lt;size_t Long>
void ReplaceAllEqualStdString(benchmark::State&amp; state) {
std::string_view source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
std::string_view sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
std::string_view pattern = &quot;bb&quot;;
std::string_view repl = &quot;--&quot;;
std::string big_source, big_sample;
for (int i = 0; i &lt; 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(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">741</td><td class="benchmarkresult">803</td><td class="benchmarkresult">851</td><td class="benchmarkresult">1069</td><td class="benchmarkresult">1628</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1825">replace bb to -- in std::string|1024</a><span class="tooltiptext code">template&lt;size_t Long>
void ReplaceAllEqualStdString(benchmark::State&amp; state) {
std::string_view source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
std::string_view sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
std::string_view pattern = &quot;bb&quot;;
std::string_view repl = &quot;--&quot;;
std::string big_source, big_sample;
for (int i = 0; i &lt; 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(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">1470</td><td class="benchmarkresult">1544</td><td class="benchmarkresult">1566</td><td class="benchmarkresult">1998</td><td class="benchmarkresult">3142</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1825">replace bb to -- in std::string|2048</a><span class="tooltiptext code">template&lt;size_t Long>
void ReplaceAllEqualStdString(benchmark::State&amp; state) {
std::string_view source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
std::string_view sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
std::string_view pattern = &quot;bb&quot;;
std::string_view repl = &quot;--&quot;;
std::string big_source, big_sample;
for (int i = 0; i &lt; 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(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">2898</td><td class="benchmarkresult">3265</td><td class="benchmarkresult">3199</td><td class="benchmarkresult">3889</td><td class="benchmarkresult">6351</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1858">replace bb to -- in lstringa&lt;8>|64</a><span class="tooltiptext code">template&lt;size_t N, size_t Long>
void ReplaceAllEqualSimString(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
lstringa&lt;2048> big_source{Long, source}, big_sample{Long, sample};
for (auto _: state) {
lstringa&lt;N> result = big_source;
result.replace(&quot;bb&quot;, &quot;--&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">95.7</td><td class="benchmarkresult">116</td><td class="benchmarkresult">181</td><td class="benchmarkresult">228</td><td class="benchmarkresult">216</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1858">replace bb to -- in lstringa&lt;8>|256</a><span class="tooltiptext code">template&lt;size_t N, size_t Long>
void ReplaceAllEqualSimString(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
lstringa&lt;2048> big_source{Long, source}, big_sample{Long, sample};
for (auto _: state) {
lstringa&lt;N> result = big_source;
result.replace(&quot;bb&quot;, &quot;--&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">284</td><td class="benchmarkresult">328</td><td class="benchmarkresult">423</td><td class="benchmarkresult">517</td><td class="benchmarkresult">672</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1858">replace bb to -- in lstringa&lt;8>|512</a><span class="tooltiptext code">template&lt;size_t N, size_t Long>
void ReplaceAllEqualSimString(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
lstringa&lt;2048> big_source{Long, source}, big_sample{Long, sample};
for (auto _: state) {
lstringa&lt;N> result = big_source;
result.replace(&quot;bb&quot;, &quot;--&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">524</td><td class="benchmarkresult">643</td><td class="benchmarkresult">736</td><td class="benchmarkresult">896</td><td class="benchmarkresult">1245</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1858">replace bb to -- in lstringa&lt;8>|1024</a><span class="tooltiptext code">template&lt;size_t N, size_t Long>
void ReplaceAllEqualSimString(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
lstringa&lt;2048> big_source{Long, source}, big_sample{Long, sample};
for (auto _: state) {
lstringa&lt;N> result = big_source;
result.replace(&quot;bb&quot;, &quot;--&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">1113</td><td class="benchmarkresult">1242</td><td class="benchmarkresult">1346</td><td class="benchmarkresult">1631</td><td class="benchmarkresult">2359</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1858">replace bb to -- in lstringa&lt;8>|2048</a><span class="tooltiptext code">template&lt;size_t N, size_t Long>
void ReplaceAllEqualSimString(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
lstringa&lt;2048> big_source{Long, source}, big_sample{Long, sample};
for (auto _: state) {
lstringa&lt;N> result = big_source;
result.replace(&quot;bb&quot;, &quot;--&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
}
}</span></span></td><td></td><td class="benchmarkresult">2072</td><td class="benchmarkresult">2353</td><td class="benchmarkresult">2605</td><td class="benchmarkresult">3106</td><td class="benchmarkresult">4751</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1880">replace bb to -- by init stringa|64</a><span class="tooltiptext code">template&lt;size_t Count>
void ReplaceAllEqualSimStringExpr(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
ssa pattern = &quot;bb&quot;;
ssa repl = &quot;--&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), &quot;bb&quot;, &quot;--&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">80.2</td><td class="benchmarkresult">110</td><td class="benchmarkresult">153</td><td class="benchmarkresult">213</td><td class="benchmarkresult">161</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1880">replace bb to -- by init stringa|256</a><span class="tooltiptext code">template&lt;size_t Count>
void ReplaceAllEqualSimStringExpr(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
ssa pattern = &quot;bb&quot;;
ssa repl = &quot;--&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), &quot;bb&quot;, &quot;--&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">242</td><td class="benchmarkresult">295</td><td class="benchmarkresult">344</td><td class="benchmarkresult">438</td><td class="benchmarkresult">539</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1880">replace bb to -- by init stringa|512</a><span class="tooltiptext code">template&lt;size_t Count>
void ReplaceAllEqualSimStringExpr(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
ssa pattern = &quot;bb&quot;;
ssa repl = &quot;--&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), &quot;bb&quot;, &quot;--&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">415</td><td class="benchmarkresult">558</td><td class="benchmarkresult">605</td><td class="benchmarkresult">710</td><td class="benchmarkresult">828</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1880">replace bb to -- by init stringa|1024</a><span class="tooltiptext code">template&lt;size_t Count>
void ReplaceAllEqualSimStringExpr(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
ssa pattern = &quot;bb&quot;;
ssa repl = &quot;--&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), &quot;bb&quot;, &quot;--&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">888</td><td class="benchmarkresult">1142</td><td class="benchmarkresult">1034</td><td class="benchmarkresult">1289</td><td class="benchmarkresult">1676</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1880">replace bb to -- by init stringa|2048</a><span class="tooltiptext code">template&lt;size_t Count>
void ReplaceAllEqualSimStringExpr(benchmark::State&amp; state) {
ssa source = &quot;aaaaaaaaaaaaaaaaaaabbbaaaaaaaabbbbaaaaabaaaaaaaaaaaaaaaaaaaaabba&quot;;
ssa sample = &quot;aaaaaaaaaaaaaaaaaaa--baaaaaaaa----aaaaabaaaaaaaaaaaaaaaaaaaaa--a&quot;;
ssa pattern = &quot;bb&quot;;
ssa repl = &quot;--&quot;;
lstringa&lt;2048> big_source{Count, source}, big_sample{Count, sample};
for (auto _: state) {
stringa result = e_repl(big_source.to_str(), &quot;bb&quot;, &quot;--&quot;);
#ifdef CHECK_RESULT
if (result.to_str() != big_sample) {
std::cout &lt;&lt; result.length() &lt;&lt; &quot;: &quot; &lt;&lt; result &lt;&lt; &quot;\n\n&quot; &lt;&lt; big_sample.length() &lt;&lt; &quot;: &quot; &lt;&lt; big_sample &lt;&lt; &quot;\n\n&quot;;
state.SkipWithError(&quot;error in replace&quot;);
break;
}
#endif
benchmark::DoNotOptimize(result);
benchmark::DoNotOptimize(source);
benchmark::DoNotOptimize(pattern);
benchmark::DoNotOptimize(repl);
}
}</span></span></td><td></td><td class="benchmarkresult">1679</td><td class="benchmarkresult">2076</td><td class="benchmarkresult">1982</td><td class="benchmarkresult">2465</td><td class="benchmarkresult">3430</td></tr>
</tbody></table></div><script>bench_sets['Replace All Str To Same Size'] = {id:'bs28', tests:[
{name:'replace bb to -- in std::string|64',data:[119,144,188,239,274]},
{name:'replace bb to -- in std::string|256',data:[410,458,453,598,866]},
{name:'replace bb to -- in std::string|512',data:[741,803,851,1069,1628]},
{name:'replace bb to -- in std::string|1024',data:[1470,1544,1566,1998,3142]},
{name:'replace bb to -- in std::string|2048',data:[2898,3265,3199,3889,6351]},
{name:'replace bb to -- in lstringa<8>|64',data:[95.7,116,181,228,216]},
{name:'replace bb to -- in lstringa<8>|256',data:[284,328,423,517,672]},
{name:'replace bb to -- in lstringa<8>|512',data:[524,643,736,896,1245]},
{name:'replace bb to -- in lstringa<8>|1024',data:[1113,1242,1346,1631,2359]},
{name:'replace bb to -- in lstringa<8>|2048',data:[2072,2353,2605,3106,4751]},
{name:'replace bb to -- by init stringa|64',data:[80.2,110,153,213,161]},
{name:'replace bb to -- by init stringa|256',data:[242,295,344,438,539]},
{name:'replace bb to -- by init stringa|512',data:[415,558,605,710,828]},
{name:'replace bb to -- by init stringa|1024',data:[888,1142,1034,1289,1676]},
{name:'replace bb to -- by init stringa|2048',data:[1679,2076,1982,2465,3430]}
]}</script>
<div class="benchset" id="bs29"><h4><a id="bs8410196985047277720" href="#bs8410196985047277720">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L1977">hashStrMapA&lt;size_t> emplace &amp; find stringa;</a><span class="tooltiptext code">void HashMapSimStr(benchmark::State&amp; state) {
for (auto _: state) {
hashStrMapA&lt;size_t> store;
for (size_t idx = 0; idx &lt; bs_sim.size(); idx++) {
store.try_emplace(bs_sim[idx], idx);
}
#ifdef CHECK_RESULT
if (store.size() != bs_sim.size()) {
state.SkipWithError(&quot;bad inserts&quot;);
}
#endif
for (size_t idx = 0; idx &lt; bs_sim.size(); idx++) {
auto find = store.find(bs_sim[idx]);
size_t res = find->second;
#ifdef CHECK_RESULT
if (res != idx) {
state.SkipWithError(&quot;bad find&quot;);
}
#endif
benchmark::DoNotOptimize(res);
}
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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">3543478</td><td class="benchmarkresult">4503107</td><td class="benchmarkresult">3860152</td><td class="benchmarkresult">4964020</td><td class="benchmarkresult">3293483</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L2001">std::unordered_map&lt;std::string, size_t> emplace &amp; find std::string;</a><span class="tooltiptext code">void HashMapStdStr(benchmark::State&amp; state) {
for (auto _: state) {
std::unordered_map&lt;std::string, size_t> store;
for (size_t idx = 0; idx &lt; bs_std.size(); idx++) {
store.try_emplace(bs_std[idx], idx);
}
#ifdef CHECK_RESULT
if (store.size() != bs_std.size()) {
state.SkipWithError(&quot;bad inserts&quot;);
}
#endif
for (size_t idx = 0; idx &lt; bs_std.size(); idx++) {
auto find = store.find(bs_std[idx]);
size_t res = find->second;
#ifdef CHECK_RESULT
if (res != idx) {
state.SkipWithError(&quot;bad find&quot;);
}
#endif
benchmark::DoNotOptimize(res);
}
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">То же самое c std::string и std::unordered_map
Same thing with std::string and std::unordered_map</span></span></td><td class="benchmarkresult">3471945</td><td class="benchmarkresult">4213379</td><td class="benchmarkresult">5751400</td><td class="benchmarkresult">6943346</td><td class="benchmarkresult">3533999</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L2025">hashStrMapA&lt;size_t> emplace &amp; find ssa;</a><span class="tooltiptext code">void HashMapSimSsa(benchmark::State&amp; state) {
for (auto _: state) {
hashStrMapA&lt;size_t> store;
for (size_t idx = 0; idx &lt; bs_sim.size(); idx++) {
store.emplace(bs_sim[idx], idx);
}
#ifdef CHECK_RESULT
if (store.size() != bs_sim.size()) {
state.SkipWithError(&quot;bad inserts&quot;);
}
#endif
for (size_t idx = 0; idx &lt; 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(&quot;bad find&quot;);
}
#endif
benchmark::DoNotOptimize(res);
}
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">Теперь вставляем stringa, а ищем ssa
Now we insert stringa and search for ssa</span></span></td><td class="benchmarkresult">3607100</td><td class="benchmarkresult">4560080</td><td class="benchmarkresult">3389482</td><td class="benchmarkresult">4594823</td><td class="benchmarkresult">3281552</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L2050">std::unordered_map&lt;std::string, size_t> emplace &amp; find std::string_view;</a><span class="tooltiptext code">void HashMapStdStrView(benchmark::State&amp; state) {
for (auto _: state) {
std::unordered_map&lt;std::string, size_t> store;
for (size_t idx = 0; idx &lt; bs_std.size(); idx++) {
store.emplace(bs_std[idx], idx);
}
#ifdef CHECK_RESULT
if (store.size() != bs_std.size()) {
state.SkipWithError(&quot;bad inserts&quot;);
}
#endif
for (size_t idx = 0; idx &lt; 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(&quot;bad find&quot;);
}
#endif
benchmark::DoNotOptimize(res);
}
}
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">Вставляем std::string, а ищем std::string_view
We insert std::string and look for std::string_view</span></span></td><td class="benchmarkresult">4101611</td><td class="benchmarkresult">5115138</td><td class="benchmarkresult">6573724</td><td class="benchmarkresult">7269646</td><td class="benchmarkresult">4070724</td></tr>
</tbody></table></div><script>bench_sets['Hash Map insert and find'] = {id:'bs29', tests:[
{name:'hashStrMapA<size_t> emplace & find stringa;',data:[3543478,4503107,3860152,4964020,3293483]},
{name:'std::unordered_map<std::string, size_t> emplace & find std::string;',data:[3471945,4213379,5751400,6943346,3533999]},
{name:'hashStrMapA<size_t> emplace & find ssa;',data:[3607100,4560080,3389482,4594823,3281552]},
{name:'std::unordered_map<std::string, size_t> emplace & find std::string_view;',data:[4101611,5115138,6573724,7269646,4070724]}
]}</script>
<div class="benchset" id="bs30"><h4><a id="bs131384792586914680410" href="#bs131384792586914680410">#</a>&nbsp;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 Chrome 143, Clang-21</th></tr></thead><tbody>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L2260">Build func full name std::string;</a><span class="tooltiptext code">std::string build_full_name_std() const {
std::string str{has_ret_type_resolver ? &quot;any&quot;sv : type_names_sv[(unsigned)ret_type]};
str += &quot; &quot;;
str += std_name;
str += &quot;(&quot;;
bool add_comma = false;
for (const auto&amp; param : params) {
if (add_comma) {
str += &quot;, &quot;;
}
if (param.optional) {
str += &quot;[&quot;;
}
param.allowed_types.to_stdstr(str);
if (param.optional) {
str += &quot;]&quot;;
}
add_comma = true;
}
if (unlim_params) {
if (add_comma) {
str += &quot;, &quot;;
}
str += &quot;...&quot;;
}
str += &quot;)&quot;;
//std::cout &lt;&lt; &quot;Len=&quot; &lt;&lt; str.length() &lt;&lt; &quot;, Cap=&quot; &lt;&lt; str.capacity() &lt;&lt; &quot;\n&quot;;
return str;
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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">691</td><td class="benchmarkresult">1092</td><td class="benchmarkresult">1507</td><td class="benchmarkresult">1863</td><td class="benchmarkresult">3518</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L2292">Build func full name std::string 1;</a><span class="tooltiptext code">std::string build_full_name_std1() const {
std::string str{has_ret_type_resolver ? &quot;any&quot;sv : type_names_sv[(unsigned)ret_type]};
str += &quot; &quot; + std_name + &quot;(&quot;;
bool add_comma = false;
for (const auto&amp; param : params) {
if (add_comma) {
str += &quot;, &quot;;
}
if (param.optional) {
str += &quot;[&quot;;
}
param.allowed_types.to_stdstr(str);
if (param.optional) {
str += &quot;]&quot;;
}
add_comma = true;
}
if (unlim_params) {
if (add_comma) {
str += &quot;, &quot;;
}
str += &quot;...&quot;;
}
str += &quot;)&quot;;
//std::cout &lt;&lt; &quot;Len=&quot; &lt;&lt; str.length() &lt;&lt; &quot;, Cap=&quot; &lt;&lt; str.capacity() &lt;&lt; &quot;\n&quot;;
return str;
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">Почти тот же алгоритм, но несколько последовательных
+= к строке заменены на одно += + + +.
Almost the same algorithm, but several consecutive
+= to a string are replaced with a single += + + +.</span></span></td><td class="benchmarkresult">813</td><td class="benchmarkresult">1171</td><td class="benchmarkresult">1502</td><td class="benchmarkresult">2021</td><td class="benchmarkresult">3668</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L2322">Build func full name std::stream;</a><span class="tooltiptext code">std::string build_full_name_stream() const {
std::ostringstream str;
if (has_ret_type_resolver) {
str &lt;&lt; &quot;any&quot;;
} else {
str &lt;&lt; type_names_sv[(unsigned)ret_type];
}
str &lt;&lt; &quot; &quot; &lt;&lt; std_name &lt;&lt; &quot;(&quot;;
bool add_comma = false;
for (const auto&amp; param : params) {
if (add_comma) {
str &lt;&lt; &quot;, &quot;;
}
if (param.optional) {
str &lt;&lt; &quot;[&quot;;
}
param.allowed_types.to_stream(str);
if (param.optional) {
str &lt;&lt; &quot;]&quot;;
}
add_comma = true;
}
if (unlim_params) {
if (add_comma) {
str &lt;&lt; &quot;, &quot;;
}
str &lt;&lt; &quot;...&quot;;
}
str &lt;&lt; &quot;)&quot;;
return str.str();
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<span class="tooltiptext">Строим имя функции через std::ostringstream и <<
We construct the function name through std::ostringstream and <<</span></span></td><td class="benchmarkresult">2594</td><td class="benchmarkresult">2921</td><td class="benchmarkresult">7853</td><td class="benchmarkresult">11156</td><td class="benchmarkresult">12436</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L2233">Build func full name stringa;</a><span class="tooltiptext code">stringa build_full_name() const {
lstringa&lt;512> str = e_choice(has_ret_type_resolver, &quot;any&quot;, type_names[(unsigned)ret_type]) + &quot; &quot; + name + &quot;(&quot;;
bool add_comma = false;
for (const auto&amp; param : params) {
str += e_if(add_comma, &quot;, &quot;) + e_if(param.optional, &quot;[&quot;);
param.allowed_types.to_simstr(str);
if (param.optional) {
str += &quot;]&quot;;
}
add_comma = true;
}
return str + e_if(unlim_params, e_if(add_comma, &quot;, &quot;) + &quot;...&quot;) + &quot;)&quot;;
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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">487</td><td class="benchmarkresult">552</td><td class="benchmarkresult">784</td><td class="benchmarkresult">1063</td><td class="benchmarkresult">1711</td></tr>
<tr><td class="benchmarkname"><span class="tooltip"><a target="blank" href="https://github.com/orefkov/simstr/blob/rel1.6.6/bench/bench_str.cpp#L2248">Build func full name stringa 1;</a><span class="tooltiptext code">stringa build_full_name1() const {
lstringa&lt;512> str = e_choice(has_ret_type_resolver, &quot;any&quot;, type_names[(unsigned)ret_type]) + &quot; &quot; + name + &quot;(&quot;;
bool add_comma = false;
for (const auto&amp; param : params) {
str += e_if(add_comma, &quot;, &quot;) + e_if(param.optional, &quot;[&quot;) + param.allowed_types.get_simstr() + e_if(param.optional, &quot;]&quot;);
add_comma = true;
}
return str + e_if(unlim_params, e_if(add_comma, &quot;, &quot;) + &quot;...&quot;) + &quot;)&quot;;
}</span></span></td><td><span class="tooltip info">&nbsp;>>&nbsp;<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">637</td><td class="benchmarkresult">746</td><td class="benchmarkresult">908</td><td class="benchmarkresult">1235</td><td class="benchmarkresult">1966</td></tr>
</tbody></table></div><script>bench_sets['Build Full Func Name'] = {id:'bs30', tests:[
{name:'Build func full name std::string;',data:[691,1092,1507,1863,3518]},
{name:'Build func full name std::string 1;',data:[813,1171,1502,2021,3668]},
{name:'Build func full name std::stream;',data:[2594,2921,7853,11156,12436]},
{name:'Build func full name stringa;',data:[487,552,784,1063,1711]},
{name:'Build func full name stringa 1;',data:[637,746,908,1235,1966]}
]}</script></body></html>
Reference in New Issue View Git Blame Copy Permalink