开源 企业版 高校版 私有云 模力方舟 AI 队友
代码拉取完成,页面将自动刷新
捐赠
捐赠前请先登录
扫描微信二维码支付
取消
支付完成
支付提示
将跳转至支付宝完成支付
确定
取消
1 Star 0 Fork 0

Lyric/cppcodec

加入 Gitee
与超过 1400万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
已有帐号? 立即登录
文件
master
分支 (1)
标签 (2)
master
v0.2
v0.1
master
分支 (1)
标签 (2)
master
v0.2
v0.1
克隆/下载
克隆/下载
提示
下载代码请复制以下命令到终端执行
为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置
初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置
1 生成 RSA 密钥
2 获取 RSA 公钥内容,并配置到 SSH公钥
在 Gitee 上使用 SVN,请访问 使用指南
使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议 配置并使用私人令牌 替代登录密码进行克隆、推送等操作
Username for 'https://gitee.com': userName
Password for 'https://userName@gitee.com': # 私人令牌
master
分支 (1)
标签 (2)
master
v0.2
v0.1
cppcodec
/
test
/
benchmark_cppcodec.cpp
cppcodec
/
test
/
benchmark_cppcodec.cpp
benchmark_cppcodec.cpp 5.89 KB
一键复制 编辑 原始数据 按行查看 历史
Valentin 提交于 2018年07月16日 11:24 +08:00 . Deleted unused parameters (#47)
/**
* Copyright (C) 2018 Jakob Petsovits
* All rights reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*/
#include <cppcodec/hex_lower.hpp>
#include <cppcodec/base32_rfc4648.hpp>
#include <cppcodec/base64_rfc4648.hpp>
#include <chrono>
#include <iostream>
#include <iomanip>
#include <random>
#include <stdint.h>
#include <string>
#include <vector>
#define BENCHMARK_ENCODING_STR true
#define BENCHMARK_DECODING_STR true
#define BENCHMARK_DECODING_VEC_U8 true
const size_t max_iterations = 1000000; // 1m iterations ought to be enough for anybody
const size_t iteration_max_ms = 500; // half a second
uint8_t random_uint8()
{
static std::random_device rd;
static std::mt19937 pseudo_random(rd());
static std::uniform_int_distribution<int> dist(0, 255);
return static_cast<uint8_t>(dist(pseudo_random));
}
template <typename Codec>
void benchmark(std::ostream& stream, const std::vector<size_t>& decoded_sizes)
{
using clock = std::chrono::high_resolution_clock;
// Measure decoding into both uint8_t and string.
std::vector<double> time_encoding_str(decoded_sizes.size());
std::vector<double> time_decoding_vec_u8(decoded_sizes.size());
std::vector<double> time_decoding_str(decoded_sizes.size());
std::vector<std::vector<uint8_t>> decoded_vec_u8(decoded_sizes.size());
std::vector<std::string> decoded_str(decoded_sizes.size());
std::vector<std::string> encoded_str(decoded_sizes.size());
for (size_t i = 0; i < decoded_sizes.size(); ++i) {
decoded_vec_u8[i].resize(decoded_sizes[i]);
for (size_t j = 0; j < decoded_sizes[i]; ++j) {
decoded_vec_u8[i][j] = random_uint8();
}
}
auto flags = stream.flags();
auto precision = stream.precision();
stream << std::fixed << std::setprecision(4);
#if BENCHMARK_ENCODING_STR
stream << "Encoding:\n";
for (size_t i = 0; i < decoded_sizes.size(); ++i) {
encoded_str[i] = Codec::encode(decoded_vec_u8[i]);
clock::time_point start = clock::now();
clock::time_point end = start + std::chrono::milliseconds(iteration_max_ms);
size_t j = 0;
for (; j < max_iterations; ++j) {
if (clock::now() > end) {
break;
}
encoded_str[i] = Codec::encode(decoded_vec_u8[i]);
}
time_encoding_str[i] = std::chrono::duration_cast<std::chrono::microseconds>(
clock::now() - start).count() / static_cast<double>(j);
stream << (i == 0 ? "" : "\t") << decoded_sizes[i] << ": "
<< time_encoding_str[i] << std::flush;
}
stream << "\n";
#else
// Even if we're not benchmarking encoding, we still need the encoded strings.
for (size_t i = 0; i < decoded_sizes.size(); ++i) {
encoded_str[i] = Codec::encode(decoded_vec_u8[i]);
}
#endif // BENCHMARK_ENCODING_STR
#if BENCHMARK_DECODING_STR
stream << "Decoding to string:\n";
for (size_t i = 0; i < decoded_sizes.size(); ++i) {
decoded_str[i] = std::string();
clock::time_point start = clock::now();
clock::time_point end = start + std::chrono::milliseconds(iteration_max_ms);
size_t j = 0;
for (; j < max_iterations; ++j) {
if (clock::now() > end) {
break;
}
decoded_str[i] = Codec::template decode<std::string>(encoded_str[i]);
}
time_decoding_str[i] = std::chrono::duration_cast<std::chrono::microseconds>(
clock::now() - start).count() / static_cast<double>(j);
stream << (i == 0 ? "" : "\t") << decoded_sizes[i] << ": "
<< time_decoding_str[i] << std::flush;
}
stream << "\n";
#endif // BENCHMARK_DECODING_STR
#if BENCHMARK_DECODING_VEC_U8
stream << "Decoding to vector<uint8_t>:\n";
for (size_t i = 0; i < decoded_sizes.size(); ++i) {
decoded_vec_u8[i] = std::vector<uint8_t>();
clock::time_point start = clock::now();
clock::time_point end = start + std::chrono::milliseconds(iteration_max_ms);
size_t j = 0;
for (; j < max_iterations; ++j) {
if (clock::now() > end) {
break;
}
decoded_vec_u8[i] = Codec::decode(encoded_str[i]);
}
time_decoding_vec_u8[i] = std::chrono::duration_cast<std::chrono::microseconds>(
clock::now() - start).count() / static_cast<double>(j);
stream << (i == 0 ? "" : "\t") << decoded_sizes[i] << ": "
<< time_decoding_vec_u8[i] << std::flush;
}
stream << "\n";
#endif // BENCHMARK_DECODING_VEC_U8
stream << std::setprecision(precision) << "\n";
stream.flags(flags);
}
int main()
{
std::vector<size_t> decoded_sizes = {
1, 4, 8, 16, 32, 64, 128, 256, 2048, 4096, 32768
};
std::cout << "base64_rfc4648: [decoded size: microseconds]\n";
benchmark<cppcodec::base64_rfc4648>(std::cout, decoded_sizes);
return 0;
}
Loading...
举报
举报成功
我们将于2个工作日内通过站内信反馈结果给你!
请认真填写举报原因,尽可能描述详细。
请选择举报类型
取消
发送
误判申诉

此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。

如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。

取消
提交

简介

暂无描述
取消

发行版

暂无发行版

贡献者

全部

语言

近期动态

不能加载更多了
编辑仓库简介
简介内容
主页
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/lyric/cppcodec.git
git@gitee.com:lyric/cppcodec.git
lyric
cppcodec
cppcodec
master
点此查找更多帮助

搜索帮助

评论
仓库举报
回到顶部
登录提示
该操作需登录 Gitee 帐号,请先登录后再操作。
立即登录
没有帐号,去注册

AltStyle によって変換されたページ (->オリジナル) /