Notes
Notes - notes.io |
#include <iostream>
#include <chrono>
#include <random>
#include <limits>
#include <cstdint>
#include "logging/log.h"
#include "utility/time.h"
using namespace sisl;
template<typename T>
std::pair<std::string, std::vector<double>> log_numeric_performance(int amount, std::string name)
{
name += "/iterations:" + std::to_string(amount);
std::vector<T> stored_keys;
std::mt19937 rng { std::random_device()() };
std::uniform_int_distribution<T> distribution(std::numeric_limits<T>::min(), std::numeric_limits<T>::max());
// generate a vector of random ints
for (int i = 0; i < amount; ++i)
{
stored_keys.push_back(distribution(rng));
}
auto log = logging::get_logger(name);
std::vector<double> results;
for (auto elem : stored_keys)
{
auto const start = utility::get_steady_time_now();
LOG_INFO(log) << elem << LOG_END_NO_CLASS_NAME();
auto const end = utility::get_steady_time_now();
auto duration = std::chrono::duration_cast<std::chrono::nanoseconds>( end - start ).count();
results.push_back(duration);
}
return std::make_pair(name,results);
}
std::pair<std::string, std::vector<double>> log_double_performance(int amount, std::string name)
{
name += "/iterations:" + std::to_string(amount);
std::vector<double> stored_keys;
std::mt19937 rng { std::random_device()() };
std::uniform_real_distribution<double> distribution(std::numeric_limits<double>::min(), std::numeric_limits<double>::max());
// generate a vector of random ints
for (int i = 0; i < amount; ++i)
{
stored_keys.push_back(distribution(rng));
}
auto log = logging::get_logger(name);
std::vector<double> results;
for (auto elem : stored_keys)
{
auto const start = utility::get_steady_time_now();
LOG_INFO(log) << elem << LOG_END_NO_CLASS_NAME();
auto const end = utility::get_steady_time_now();
auto duration = std::chrono::duration_cast<std::chrono::nanoseconds>( end - start ).count();
results.push_back(duration);
}
return std::make_pair(name,results);
}
/**
* Generate a random string
* @param min_len
* @param max_len
* @return
*/
inline std::string get_random_string(int min_len, int max_len)
{
static const char alphanum[] =
"0123456789"
"ABCDEFGHIJKLMNOPQRSTUVWXYZ"
"abcdefghijklmnopqrstuvwxyz";
// Keep engine as static else we might get similar results
static std::mt19937 rng { std::random_device()() };
std::uniform_int_distribution<int> distribution(0, (sizeof(alphanum) - 1));
auto const random_num = distribution(rng);
int const len = (random_num % (max_len - min_len)) + min_len;
std::string result;
for (int i = 0; i < len; ++i)
{
result += alphanum[distribution(rng)];
}
return result;
}
std::pair<std::string, std::vector<double>> log_string_performance(int iterations, int min_len, int max_len, std::string name)
{
name += "/iterations:" + std::to_string(iterations) + "/min_len:" + std::to_string(min_len) + "/max_len:" + std::to_string(max_len);
std::vector<std::string> stored_keys;
// generate a vector of random ints
for (int i = 0; i < iterations; ++i)
{
stored_keys.push_back(get_random_string(min_len, max_len));
}
auto log = logging::get_logger(name);
std::vector<double> results;
for (auto const& elem : stored_keys)
{
auto const start = utility::get_steady_time_now();
LOG_INFO(log) << elem << LOG_END_NO_CLASS_NAME();
auto const end = utility::get_steady_time_now();
auto duration = std::chrono::duration_cast<std::chrono::nanoseconds>( end - start ).count();
results.push_back(duration);
}
return std::make_pair(name,results);
}
std::pair<std::string, std::vector<double>> log_multiple_string_performance(int iterations, int min_len, int max_len, std::string name)
{
// log multiple strings in the same log message
name += "/iterations:" + std::to_string(iterations) + "/min_len:" + std::to_string(min_len) + " * 3/max_len:" + std::to_string(max_len) + " * 3";
std::vector<std::string> stored_keys;
// generate a vector of random ints
for (int i = 0; i < iterations * 3; ++i)
{
stored_keys.push_back(get_random_string(min_len, max_len));
}
auto log = logging::get_logger(name);
std::vector<double> results;
for (int i = 0; i < stored_keys.size(); i += 3)
{
if (i+2 >= stored_keys.size())
{
break;
}
auto const start = utility::get_steady_time_now();
LOG_INFO(log) << stored_keys[i] << stored_keys[i+1] << stored_keys[i+2] << LOG_END_NO_CLASS_NAME();
auto const end = utility::get_steady_time_now();
auto duration = std::chrono::duration_cast<std::chrono::nanoseconds>( end - start ).count();
results.push_back(duration);
}
return std::make_pair(name,results);
}
std::pair<std::string, std::vector<double>> log_multiple_string_and_int_performance(int iterations, int min_len, int max_len, std::string name)
{
// log multiple strings in the same log message
name += "/iterations:" + std::to_string(iterations) + "/min_len:" + std::to_string(min_len) + " * 2/max_len:" + std::to_string(max_len) + " * 2";
std::vector<std::string> stored_strings;
// generate a vector of random strings
for (int i = 0; i < iterations * 2; ++i)
{
stored_strings.push_back(get_random_string(min_len, max_len));
}
std::vector<std::int32_t> stored_ints;
std::mt19937 rng { std::random_device()() };
std::uniform_int_distribution<std::int32_t> distribution(std::numeric_limits<std::int32_t>::min(), std::numeric_limits<std::int32_t>::max());
// generate a vector of random ints
for (int i = 0; i < iterations * 2; ++i)
{
stored_ints.push_back(distribution(rng));
}
auto log = logging::get_logger(name);
std::vector<double> results;
for (int i = 0; i < stored_strings.size(); i += 2)
{
if (i+1 >= stored_strings.size())
{
break;
}
auto const start = utility::get_steady_time_now();
LOG_INFO(log) << stored_strings[i] << stored_ints[i] << stored_strings[i+1] << stored_ints[i+1] << LOG_END_NO_CLASS_NAME();
auto const end = utility::get_steady_time_now();
auto duration = std::chrono::duration_cast<std::chrono::nanoseconds>( end - start ).count();
results.push_back(duration);
}
return std::make_pair(name,results);
}
int main()
{
logging::logging_config default_log_cfg;
logging::config(default_log_cfg);
logging::start();
// let the logger start
std::this_thread::sleep_for(std::chrono::milliseconds(1));
std::vector<std::pair<std::string, std::vector<double>>> results;
// Int bench
{
auto res = log_numeric_performance<std::uint32_t>(300'000, "log_uint32_t");
results.push_back(res);
}
{
auto res = log_numeric_performance<std::uint32_t>(300'000, "log_uint32_t");
results.push_back(res);
}
{
auto res = log_double_performance(300'000, "log_double");
results.push_back(res);
}
{
auto res = log_string_performance(300'000, 100, 200, "log_string");
results.push_back(res);
}
{
auto res = log_multiple_string_performance(300'000, 100, 200, "log_multiple_string");
results.push_back(res);
}
{
auto res = log_multiple_string_and_int_performance(300'000, 100, 200, "log_multiple_string_and_int");
results.push_back(res);
}
logging::flush();
logging::stop();
std::cout << "***--- Results --- ***" << std::endl;
for (auto [test_name, vec_results] : results )
{
std::sort(vec_results.begin(), vec_results.end(), std::less<>());
//
double median;
if (vec_results.size() % 2 == 0)
{
median = (vec_results[vec_results.size() / 2 - 1] + vec_results[vec_results.size() / 2]) / 2;
}
else
{
median = vec_results[vec_results.size() / 2];
}
//
double mean = std::accumulate(vec_results.begin(), vec_results.end(), 0.0)/vec_results.size();
//
double percentile_10 = vec_results[static_cast<std::size_t>(vec_results.size() * 0.1)];
double percentile_20 = vec_results[static_cast<std::size_t>(vec_results.size() * 0.2)];
double percentile_30 = vec_results[static_cast<std::size_t>(vec_results.size() * 0.3)];
double percentile_50 = vec_results[static_cast<std::size_t>(vec_results.size() * 0.5)];
double percentile_75 = vec_results[static_cast<std::size_t>(vec_results.size() * 0.75)];
double percentile_90 = vec_results[static_cast<std::size_t>(vec_results.size() * 0.9)];
double percentile_95 = vec_results[static_cast<std::size_t>(vec_results.size() * 0.95)];
double percentile_99 = vec_results[static_cast<std::size_t>(vec_results.size() * 0.99)];
std::cout << std::endl;
std::cout << "---" << test_name << "---" << std::endl;
std::cout << "min " << vec_results.front() << " ns" << std::endl;
std::cout << "mean " << mean << " ns" << std::endl;
std::cout << "median " << median << " ns" << std::endl;
std::cout << "10th percentile " << percentile_10 << " ns" << std::endl;
std::cout << "20th percentile " << percentile_20 << " ns" << std::endl;
std::cout << "30th percentile " << percentile_30 << " ns" << std::endl;
std::cout << "50th percentile " << percentile_50 << " ns" << std::endl;
std::cout << "75th percentile " << percentile_75 << " ns" << std::endl;
std::cout << "90th percentile " << percentile_90 << " ns" << std::endl;
std::cout << "95th percentile " << percentile_95 << " ns" << std::endl;
std::cout << "99th percentile " << percentile_99 << " ns" << std::endl;
}
return 0;
}
|
Notes.io is a web-based application for taking notes. You can take your notes and share with others people. If you like taking long notes, notes.io is designed for you. To date, over 8,000,000,000 notes created and continuing...
With notes.io;
- * You can take a note from anywhere and any device with internet connection.
- * You can share the notes in social platforms (YouTube, Facebook, Twitter, instagram etc.).
- * You can quickly share your contents without website, blog and e-mail.
- * You don't need to create any Account to share a note. As you wish you can use quick, easy and best shortened notes with sms, websites, e-mail, or messaging services (WhatsApp, iMessage, Telegram, Signal).
- * Notes.io has fabulous infrastructure design for a short link and allows you to share the note as an easy and understandable link.
Fast: Notes.io is built for speed and performance. You can take a notes quickly and browse your archive.
Easy: Notes.io doesn’t require installation. Just write and share note!
Short: Notes.io’s url just 8 character. You’ll get shorten link of your note when you want to share. (Ex: notes.io/q )
Free: Notes.io works for 12 years and has been free since the day it was started.
You immediately create your first note and start sharing with the ones you wish. If you want to contact us, you can use the following communication channels;
Email: [email protected]
Twitter: http://twitter.com/notesio
Instagram: http://instagram.com/notes.io
Facebook: http://facebook.com/notesio
Regards;
Notes.io Team