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. php面试专题---9、会话控制考点

    php面试专题---9.会话控制考点 一.总结 一句话总结: 面向对象.设计模式这些特别好用,需要融会贯通 1.请写出PHP类权限控制修饰符? public.protected.private 2.p ...

  2. Android中国官网资源网站

    现在android开发者官网在中国有中文版已经不是太大的新闻,为了平时查询资料和学习方便,记录如下. PS:建议用Google浏览器浏览,你懂的!! https://developers.google ...

  3. pve之daemon

    pmxcfs The Proxmox Cluster file system (“pmxcfs”) is a database-driven file system for storing confi ...

  4. vue.js + element 搭建后台管理系统 笔记(一)

    此文仅记录本人在搭建后台系统过程中遇到的难点及注意点,如果能帮到各位自然是极好的~~~ 项目主要架构:vueJS.elementUI.scss 一.项目初始化 首先需要安装nodejs,安装方法就不在 ...

  5. no suitable ctr exists to convert from 'int' to 'std::basic_string<char,std::char_traits<char>,std::allocator<char> >

    int xfun(int *a,int n) { int x = *a;//a的类型是int *,a+1跳动一个int的长度 ; pa < a + n; pa++)//指向同一个类型的指针比较大 ...

  6. poj2431Expedition

    A group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poo ...

  7. poj1163The Triangle(动态规划,记忆化搜索)

    7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 (Figure 1) Figure 1 shows a number triangle. Write a program that calc ...

  8. Js类的静态方法与实例方法区分以及jQuery如何拓展两种方法

    上学时C#老师讲到对象有两类方法,静态方法(Static)和实例方法(非Static),当时不理解静态是为何意,只是强记. 后来从事前端工作,一直在对类(即对象,Js中严格来说没有类的定义,虽众所周知 ...

  9. 自动发现项目中的url

    def check_url_exclude(url): """ 判断url是否需要自动被发现,如果不是则移除 :param url: 自动发现的url :return: ...

  10. 高德地图POI采集(URL-API)

    新手从零学起,成功跑通,记一下,技术大神们多多指点. ———————————————— 1-概述 POI:兴趣点.对于百度.高德等电子地图来说,一个POI是地图上的一个店铺/商场/小区等等. 这次要解 ...