Boost.Integer defines specialized for integers.

1. types for integers with number of bits

#include <boost/cstdint.hpp>
#include <iostream> int main()
{
boost::int8_t i8 = ;
std::cout << sizeof(i8) << std::endl; #ifndef BOOST_NO_INT64_T
boost::uint64_t ui64 = ;
std::cout << sizeof(ui64) << std::endl;
#endif boost::int_least8_t il8 = ;
std::cout << sizeof(il8) << std::endl; boost::uint_least32_t uil32 = ;
std::cout << sizeof(uil32) << std::endl; boost::int_fast8_t if8 = ;
std::cout << sizeof(if8) << std::endl; boost::uint_fast16_t uif16 = ;
std::cout << sizeof(uif16) << std::endl;
}

output:

1

8

1

4

1

8

types such as boost::int8_t and boost::uint64_t carry the exact memory size in their names. Thus boost::int8_t contains exactly 8 bits, and boost::uint64_t contains exactly 64 bits.

types such as boost::int_least8_t and boost::uint_least32_t contain at least as many bits as their names say. It is possible that the memory size of boost::int_least8_t will be greater than 8 bits and that of boost::uint_least32_t will be greater than 32 bits.

Types such as boost::int_fast8_t and boost::uint_fast16_t also have a minimum size. Their actual size is set to a value that guarantees the best performance.

2. more specialized types for integers

#include <boost/cstdint.hpp>
#include <iostream> int main()
{
boost::intmax_t imax = ;
std::cout << sizeof(imax) << std::endl; std::cout << sizeof(UINT8_C()) << std::endl; #ifndef BOOST_NO_INT64_T
std::cout << sizeof(INT64_C()) << std::endl;
#endif return ;
}

output

8

4

8

Boost.Integer defines two types, boost::intmax_t and boost::uintmax_t, for the maximum width integer types available on a platform.

Boost.Accumulators

An accumulator is a container that calculates a new result every time a value is inserted. The value isn't necessary stored in the accumulator. Instead the accumulator continuously updates intermediary results as it is fed new values.

1. boost::accumulators::tag::count

#include <boost/accumulators/accumulators.hpp>
#include <boost/accumulators/statistics.hpp>
#include <iostream> using namespace boost::accumulators; int main()
{
accumulator_set<int, features<tag::count>> acc;
acc();
acc(-);
acc();
std::cout << count(acc) << std::endl;
return ;
}

boost::accumulators::accumulator_set is a template that expects as its first parameter the type of the values that will be processed. The second parameter specifies the accumulators you want to use.

An object of type boost::accumulators::accumulator_set can be used like a function. Values can be passed by calling operator(). They are immediately processed. The values passed must have the same type as was passed as the first template parameter to boost::accumulators::accumulator_set.

For every feature, there is an identically named extrator. An extrator receives the current result of an accumulator.

2. using mean and variance

#include <boost/accumulators/accumulators.hpp>
#include <boost/accumulators/statistics.hpp>
#include <iostream> using namespace boost::accumulators; int main()
{
accumulator_set<double, features<tag::mean, tag::variance>> acc;
acc();
acc();
acc();
acc();
acc();
std::cout << mean(acc) << std::endl;
std::cout << variance(acc) << std::endl;
return ;
}

uses the two features boost::accumulators::tag::mean and boost::accumulators::tag::variance to calculate the mean and the variance of five values. The accumulators selected with boost::accumulators::tag::variance uses weight. If weights are not set explicitly, all values are given the same weight.

3. calculating the weighted variance

#include <boost/accumulators/accumulators.hpp>
#include <boost/accumulators/statistics.hpp>
#include <iostream> using namespace boost::accumulators; int main()
{
accumulator_set<double, features<tag::mean, tag::variance>, int> acc;
acc(, weight = );
acc(, weight = );
acc(, weight = );
acc(, weight = );
acc(, weight = );
std::cout << mean(acc) << std::endl;
std::cout << variance(acc) << std::endl;
return ;
}

Boost.Accumulators uses Boost.Parameter to pass additional parameters, such as weights, as name/value pairs. The parameter name for weights is weight. You can treat the parameter like a variable and assign a value. The name/value pair is passed as an additional parameter after every value to the accumulator.

Boost.MinMax

1. boost::minmax()

#include <boost/algorithm/minmax.hpp>
#include <boost/tuple/tuple.hpp>
#include <iostream> int main()
{
int i = ;
int j = ; boost::tuples::tuple<const int&, const int&> t = boost::minmax(i, j); std::cout << t.get<>() << std::endl;
std::cout << t.get<>() << std::endl;
return ;
}

boost::minmax() returns two values as a tuple. The first reference in the tuple points to the minimum and the second to the maximum.

2. boost::minmax_element()

#include <boost/algorithm/minmax_element.hpp>
#include <array>
#include <utility>
#include <iostream> int main()
{
typedef std::array<int, > array;
array a{{, , , }}; std::pair<array::iterator, array::iterator> p = boost::minmax_element(a.begin(), a.end()); std::cout << *p.first << std::endl;
std::cout << *p.second << std:endl; return ;
}

Unlike boost::minmax(), boost::minmax_element() returns a std::pair containing two iterators. The first iterator points to the minimum and the second points to the maximum.

Boost.Random

1.

#include <boost/random.hpp>
#include <boost/random/random_device.hpp>
#include <iostream>
#include <ctime>
#include <cstdint> int main()
{
std::time_t now = std::time();
boost::random::mt19937 gen{static_cast<std::uint32_t>(now)};
std::cout << gen() << std::endl; boost::random::bernoulli_distribution<> dist1;
std::cout << dist1(gen) << std::endl; boost::random::uniform_int_distribution<> dist2{, };
std::cout << dist2(gen) << std::endl; boost::random::random_device gen2;
std::cout << gen2() << std::endl; return ;
}

Nearly all of the random number generators provided by Boost.Random are pseudo-random number generators. Pseudo-random number generators don’t generate real random numbers. They are based on algorithms that generate seemingly random numbers. boost::random::mt19937 is one of these pseudo-random number generators.

boost::random::random_device is a non-deterministic random number generator, which is a random number generator that can generate real random numbers. There is no algorithm that needs to be initialized. Thus, predicting the random numbers is impossible. Non-deterministic random number generators are often used in security-related applications.

Because a coin has only two sides, the random number generator should return 0 or 1. boost::random::bernoulli_distribution is a distribution that returns one of two possible results.

uses a distribution that is often needed: boost::random::uniform_int_distribution. This distribution lets you define the range of random numbers you need.

Boost.NumericConversion

1.

#include <boost/numeric/conversion/cast.hpp>
#include <iostream> int main()
{
try {
int i = 0x10000;
short s = boost::numeric_cast<short>(i);
std::cout << s << std::endl;
} catch (boost::numeric::bad_numeric_cast &e)
{
std::cerr << e.what() << std::endl;
} return ;
}

boost::numeric_cast does the same conversion as C++, but it verifies whether the conversion can take place without changing the value being converted. Example above of verification fails, and an exception of type boost::numeric::bad_numeric_cast is thrown because 0x10000 is too big to be placed in a variable of type short.

boost number handling的更多相关文章

  1. jqu

    1 /*2 * 说明:3 * 本源代码的中文注释乃Auscarlin呕心沥血所作.旨在促进jQuery的传播以及向广大jQuery爱好者提供一个进阶4 *的途径,以让各位更加深入地了解jQuery,学 ...

  2. 优秀的PHP开源项目集合

    包管理Package Management Package Management Related 框架 框架组件 微框架Micro Frameworks 内容管理系统Content Managemen ...

  3. github上所有大于800 star OC框架

    https://github.com/XCGit/awesome-objc-frameworks#awesome-objc-frameworks awesome-objc-frameworks ID ...

  4. PHP框架、库和软件资源大全(整理篇)

    php的资料 https://github.com/ziadoz/awesome-php Awesome PHP A curated list of amazingly awesome PHP lib ...

  5. Lucene学习总结之八:Lucene的查询语法,JavaCC及QueryParser

    一.Lucene的查询语法 Lucene所支持的查询语法可见http://lucene.apache.org/java/3_0_1/queryparsersyntax.html (1) 语法关键字 + ...

  6. ios7毛玻璃效果实现

    首先看效果:       核心代码: //加模糊效果,image是图片,blur是模糊度 - (UIImage *)blurryImage:(UIImage *)image withBlurLevel ...

  7. C++开源代码项目汇总

    Google的C++开源代码项目 v8  -  V8 JavaScript EngineV8 是 Google 的开源 JavaScript 引擎.V8 采用 C++ 编写,可在谷歌浏览器(来自 Go ...

  8. Squid调试和故障处理

    http://blog.zhdata.com/tag/squid第16章 调试和故障处理 16.1 一些通用问题 在讨论通用debug前,我先提起一些经常发生的问题. 16.1.1 “Failed t ...

  9. Google的C++开源代码项

    转:http://blog.csdn.net/wenrenhua08/article/details/40040903 v8  -  V8 JavaScript EngineV8 是 Google 的 ...

随机推荐

  1. Spring中@Async-异步处理

    在Java应用中,绝大多数情况下都是通过同步的方式来实现交互处理的:但是在处理与第三方系统交互的时候,容易造成响应迟缓的情况,之前大部分都是使用多线程来完成此类任务,其实,在spring 3.x之后, ...

  2. php面试专题---15、MySQL数据库基础考察点

    php面试专题---15.MySQL数据库基础考察点 一.总结 一句话总结: 注意:只写精品 1.mysql定义int(3),那么我存1234就错了么? 不是:无影响:只会影响显示字符的个数:可以为整 ...

  3. “The creator of this fault did not specify a Reason” Exception

    “The creator of this fault did not specify a Reason” Exception if(!DidItPass) { InvalidRoutingCodeFa ...

  4. MySQL备份之XtraBackup工具使用

    数据库的完整备份 [root@vhost1 ~]# innobackupex --defaults-file=/mysqldata/3306/my.cnf  --user=root   --passw ...

  5. Codeforces Round #410 (Div. 2)B. Mike and strings(暴力)

    传送门 Description Mike has n strings s1, s2, ..., sn each consisting of lowercase English letters. In ...

  6. Git003--创建版本库

    Git--创建版本库 本文来自于:https://www.liaoxuefeng.com/wiki/0013739516305929606dd18361248578c67b8067c8c017b000 ...

  7. Ubuntu TTy字体

    目的:修改tty终端下的字体大小,中文显示,字体美观问题 Linux版本:xubuntu14.04 当切换到tty终端模式式,中文乱码,且字体太小,影响阅读.在网上搜了一些资料,将问题及解决方案记录如 ...

  8. kmp(最长前缀与后缀)

    http://acm.hdu.edu.cn/showproblem.php?pid=1358 Period Problem Description For each prefix of a given ...

  9. pandas分组聚合案例

    美国2012年总统候选人政治献金数据分析 导入包 import numpy as np import pandas as pd from pandas import Series,DataFrame ...

  10. CF208E Blood Cousins

    Blood Cousins 题目描述 小C喜欢研究族谱,这一天小C拿到了一整张族谱. 小C先要定义一下k-祖先. x的1-祖先指的是x的父亲 x的k-祖先指的是x的(k-1)-祖先的父亲 小C接下来要 ...