flightsimulatorplatfrom/pilotclient
1
0
Fork 0
mirror of https://github.com/swift-project/pilotclient.git synced 2026-03-22 14:55:36 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: clang format line length

Browse Source
This commit is contained in:
Lars Toenning
2024-11-16 19:27:30 +01:00
parent c7779e1461
commit 1a0b2a8c5f
1352 changed files with 25994 additions and 26603 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
samples/misc/samplesalgorithm.cpp
View File

@@ -29,10 +29,7 @@ namespace swift::sample
int CSamplesAlgorithm::samples()
{
swift::misc::CSequence<int> seq;
for (int i = 1; i <= 100; ++i)
{
seq.push_back(i);
}
for (int i = 1; i <= 100; ++i) { seq.push_back(i); }
const int samples = 200;
swift::misc::CSequence<int> means;
{
@@ -42,7 +39,9 @@ namespace swift::sample
means.push_back(std::accumulate(randoms.cbegin(), randoms.cend(), 0) / 10);
}
int mean = std::accumulate(means.cbegin(), means.cend(), 0) / samples;
int stdDev = std::sqrt(std::accumulate(means.cbegin(), means.cend(), 0, [&](int a, int n) { return a + (n - mean) * (n - mean); }) / samples);
int stdDev = std::sqrt(std::accumulate(means.cbegin(), means.cend(), 0,
[&](int a, int n) { return a + (n - mean) * (n - mean); }) /
samples);
qDebug() << "randomElements";
qDebug() << "means:" << means;
qDebug() << "mean of the means:" << mean;
@@ -56,7 +55,9 @@ namespace swift::sample
means.push_back(std::accumulate(randoms.cbegin(), randoms.cend(), 0) / 10);
}
int mean = std::accumulate(means.cbegin(), means.cend(), 0) / samples;
int stdDev = std::sqrt(std::accumulate(means.cbegin(), means.cend(), 0, [&](int a, int n) { return a + (n - mean) * (n - mean); }) / samples);
int stdDev = std::sqrt(std::accumulate(means.cbegin(), means.cend(), 0,
[&](int a, int n) { return a + (n - mean) * (n - mean); }) /
samples);
qDebug() << "sampleElements";
qDebug() << "means:" << means;
qDebug() << "mean of the means:" << mean;
@@ -69,7 +70,10 @@ namespace swift::sample
qDebug() << "topologicallySortedInsert";
QStringList dst;
int count = 0;
auto cmp = [&](const QString &a, const QString &b) { count++; return a[0] == b[0] && a[1] < b[1]; };
auto cmp = [&](const QString &a, const QString &b) {
count++;
return a[0] == b[0] && a[1] < b[1];
};
for (const auto &s : src) { swift::misc::topologicallySortedInsert(dst, s, cmp); }
qDebug() << count << "comparisons";
qDebug() << dst;