DaddyFrosty/yoga
1
0
Fork 0
Code Issues 96 Pull Requests 31 Actions Packages Projects Releases 33 Wiki Activity

Fix typos. (#1629)

Browse Source 
Summary:
This fixes a variety of spelling mistakes in file names, identifiers, and comments.

Pull Request resolved: https://github.com/facebook/yoga/pull/1629

Reviewed By: NickGerleman

Differential Revision: D54987359

Pulled By: yungsters

fbshipit-source-id: 6b7ca20f4855f5f654036672bc10f8b079288acd
This commit is contained in:
Bruce Mitchener
2024-03-19 02:52:40 -07:00
committed by Facebook GitHub Bot
parent 6ef7be293a
commit 9dcd8ba9dc
20 changed files with 49 additions and 47 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
benchmark/Benchmark.cpp
View File

@@ -21,9 +21,9 @@ namespace facebook::yoga {
using namespace nlohmann;
using namespace std::chrono;
constexpr uint32_t kNumRepititions = 100;
constexpr uint32_t kNumRepetitions = 100;
using SteadyClockDurations =
std::array<steady_clock::duration, kNumRepititions>;
std::array<steady_clock::duration, kNumRepetitions>;
static bool inputsMatch(
float actualWidth,
@@ -333,23 +333,23 @@ BenchmarkResult generateBenchmark(json& capture) {
static void printBenchmarkResult(
const std::string& name,
SteadyClockDurations& durations) {
std::array<double, kNumRepititions> timesInMs{};
std::array<double, kNumRepetitions> timesInMs{};
double mean = 0;
for (uint32_t i = 0; i < kNumRepititions; i++) {
for (uint32_t i = 0; i < kNumRepetitions; i++) {
auto ms = duration<double, std::milli>(durations[i]).count();
timesInMs[i] = ms;
mean += ms;
}
mean /= kNumRepititions;
mean /= kNumRepetitions;
std::sort(timesInMs.begin(), timesInMs.end());
double median = timesInMs[kNumRepititions / 2];
double median = timesInMs[kNumRepetitions / 2];
double variance = 0;
for (uint32_t i = 0; i < kNumRepititions; i++) {
for (uint32_t i = 0; i < kNumRepetitions; i++) {
variance += std::pow(timesInMs[i] - mean, 2);
}
variance /= kNumRepititions;
variance /= kNumRepetitions;
double stddev = std::sqrt(variance);
printf("%s: median: %lf ms, stddev: %lf ms\n", name.c_str(), median, stddev);
@@ -370,7 +370,7 @@ void benchmark(std::filesystem::path& capturesDir) {
std::string captureName = capture.path().stem().string();
std::cout << "Starting benchmark for " << captureName << std::endl;
for (uint32_t i = 0; i < kNumRepititions; i++) {
for (uint32_t i = 0; i < kNumRepetitions; i++) {
BenchmarkResult result = generateBenchmark(j);
treeCreationDurations[i] = result.treeCreationDuration;
layoutDurations[i] = result.layoutDuration;