mirrors/codon
1
0
Fork 0
mirror of https://github.com/exaloop/codon.git synced 2025-06-03 15:03:52 +08:00
Code Issues Projects Releases Wiki Activity

added anonymous namespace and ran clang format

Browse Source
This commit is contained in:
Stephen Berry 2022-12-16 10:18:01 -06:00
parent 27c4ba3a0e
commit 3d60f30a23
1 changed files with 46 additions and 44 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

88
bench/binary_trees/binary_trees.cpp
View File

@ -5,52 +5,54 @@
#include <utility> #include <utility>
#include <vector> #include <vector>
struct Node { namespace {
std::unique_ptr<Node> left{}; struct Node {
std::unique_ptr<Node> right{}; std::unique_ptr<Node> left{};
}; std::unique_ptr<Node> right{};
};
inline std::unique_ptr<Node> make_tree(int d) { inline std::unique_ptr<Node> make_tree(int d) {
if (d > 0) { if (d > 0) {
return std::make_unique<Node>(Node{make_tree(d - 1), make_tree(d - 1)}); return std::make_unique<Node>(Node{make_tree(d - 1), make_tree(d - 1)});
} }
else { else {
return std::make_unique<Node>(); return std::make_unique<Node>();
}
}
inline int check_tree(const std::unique_ptr<Node>& node) {
if (!node->left)
return 1;
else
return 1 + check_tree(node->left) + check_tree(node->right);
}
inline int make_check(const std::pair<int, int> &itde) {
int i = itde.first, d = itde.second;
auto tree = make_tree(d);
return check_tree(tree);
}
struct ArgChunks {
int i, k, d, chunksize;
std::vector<std::pair<int, int>> chunk;
ArgChunks(int i, int d, int chunksize = 5000)
: i(i), k(1), d(d), chunksize(chunksize), chunk() {
assert(chunksize % 2 == 0);
}
bool next() {
chunk.clear();
while (k <= i) {
chunk.emplace_back(k++, d);
if (chunk.size() == chunksize)
return true;
} }
return !chunk.empty();
} }
};
inline int check_tree(const std::unique_ptr<Node>& node) {
if (!node->left)
return 1;
else
return 1 + check_tree(node->left) + check_tree(node->right);
}
inline int make_check(const std::pair<int, int> &itde) {
int i = itde.first, d = itde.second;
auto tree = make_tree(d);
return check_tree(tree);
}
struct ArgChunks {
int i, k, d, chunksize;
std::vector<std::pair<int, int>> chunk;
ArgChunks(int i, int d, int chunksize = 5000)
: i(i), k(1), d(d), chunksize(chunksize), chunk() {
assert(chunksize % 2 == 0);
}
bool next() {
chunk.clear();
while (k <= i) {
chunk.emplace_back(k++, d);
if (chunk.size() == chunksize)
return true;
}
return !chunk.empty();
}
};
} // namespace
int main(int argc, char *argv[]) { int main(int argc, char *argv[]) {
using clock = std::chrono::high_resolution_clock; using clock = std::chrono::high_resolution_clock;