浠ュ悗浣跨敤寰楃潃鐨?br>
#include <iostream>
#include <vector>
#include <algorithm>
#include <boost/assign.hpp>
#include <boost/function.hpp>
using namespace std;
using namespace boost;
using namespace boost::assign;
inline void print_(int t){cout<<t<<" ";}
inline void print(vector<int>& vec)
{
for_each(vec.begin(),vec.end(),print_);
cout<<endl;
}
//! 鍏ㄦ帓鍒楁祴璇?/span>
void test1()
{
vector<int> vec;
vec += 1,2,3,4,5,6,7,8;
sort(vec.begin(),vec.end());
int i = 0;
do
{
print(vec);
i++;
}
while(next_permutation(vec.begin(),vec.end()));
std::cout<<i<<std::endl;
}
//! 緇勫悎嫻嬭瘯
size_t test2(int n,int m,boost::function<void(std::vector<int>& vec)> fn)
{
vector<int> p,set;
p.insert(p.end(),m,1);
p.insert(p.end(),n-m,0);
for(int i = 0;i != p.size();++i)
set.push_back(i+1);
vector<int> vec;
size_t cnt = 0;
do{
for(int i = 0;i != p.size();++i)
if(p[i])
vec.push_back(set[i]);
fn(vec);
cnt ++;
vec.clear();
}while(prev_permutation( p.begin(), p.end()));
return cnt;
}
int main()
{
test1();
std::cout<<test2(20,3,print)<<std::endl;
return 0;
}
....................................................................................................................#include <vector>
#include <algorithm>
#include <boost/assign.hpp>
#include <boost/function.hpp>
using namespace std;
using namespace boost;
using namespace boost::assign;
inline void print_(int t){cout<<t<<" ";}
inline void print(vector<int>& vec)
{
for_each(vec.begin(),vec.end(),print_);
cout<<endl;
}
//! 鍏ㄦ帓鍒楁祴璇?/span>
void test1()
{
vector<int> vec;
vec += 1,2,3,4,5,6,7,8;
sort(vec.begin(),vec.end());
int i = 0;
do
{
print(vec);
i++;
}
while(next_permutation(vec.begin(),vec.end()));
std::cout<<i<<std::endl;
}
//! 緇勫悎嫻嬭瘯
size_t test2(int n,int m,boost::function<void(std::vector<int>& vec)> fn)
{
vector<int> p,set;
p.insert(p.end(),m,1);
p.insert(p.end(),n-m,0);
for(int i = 0;i != p.size();++i)
set.push_back(i+1);
vector<int> vec;
size_t cnt = 0;
do{
for(int i = 0;i != p.size();++i)
if(p[i])
vec.push_back(set[i]);
fn(vec);
cnt ++;
vec.clear();
}while(prev_permutation( p.begin(), p.end()));
return cnt;
}
int main()
{
test1();
std::cout<<test2(20,3,print)<<std::endl;
return 0;
}
]]>
鍦ㄤ嬌鐢ㄧ殑鏃跺欓渶瑕佽緇嗘敞鎰?br>
std::string tag;
boost::tokenizer<> tok(std::string("鐚?nbsp;鐙?nbsp;鐚?/span>"));
for(boost::tokenizer<>::iterator beg=tok.begin();beg!=tok.end();++beg)
{
tag += *beg;
tag += "+";
}
std::cout<<tag<<std::endl;boost::tokenizer<> tok(std::string("鐚?nbsp;鐙?nbsp;鐚?/span>"));
for(boost::tokenizer<>::iterator beg=tok.begin();beg!=tok.end();++beg)
{
tag += *beg;
tag += "+";
}
澶у璇磋緇撴灉鍚?br>
]]>
涓涓棶棰樺氨鏄紩鎿庝腑鐨凴efPtr璁捐鏈夌偣闂
绱㈡т笅涓紩鎿庣増鏈氨鏄敤boost搴撳惂
鍏嶅緱涓浜涘熀紜闇瑕佽嚜宸卞啓
瑕佷嬌鐢╞oost搴撳叾涓殑鏅鴻兘鎸囬拡蹇呬笉鍙皯
鏋楁灄鎬繪繪湁濂藉嚑涓被鍨?br>涓嶈繃甯哥敤寰楄繕鏄?涓?br>scoped_ptr,
shared_ptr,
weak_ptr
榪欓噷鍏堣shared_ptr
瀹冭繕鏄紩鐢ㄨ鏁扮被鍨嬬殑鎸囬拡鍜?br>璨屼技姣旇緝濂界敤(浣嗘槸鏍規湰榪樻槸鍦ㄤ簬浣跨敤鐨勪漢)
涓轟簡姝ｇ‘浣跨敤瀹冮渶瑕佹敞鎰忓嚑涓棶棰?br>1.澶氱嚎紼嬬幆澧冨拰寰幆寮曠敤
搴旇閰嶅悎weak_ptr
2.浣跨敤浜唖hared_ptr灝變笉搴旇浣跨敤鍏朵粬鍐呭瓨綆＄悊鏈哄埗
3.涓嶈鏋勯犱復鏃剁殑shared_tr浣滀負鍑芥暟鍙傛暟
4.鍏朵粬...
]]>
#include <cstdlib>
#include <iostream>
#include <boost/pool/pool.hpp>
#include <boost/pool/object_pool.hpp>
using namespace std;
using namespace boost;
class Object
{
public:
Object(){cout<<"new obj"<<endl;}
~Object(){cout<<"delete obj"<<endl;}
};
int main(int argc, char *argv[])
{
//!姣忔鍒嗛厤鐨勫潡鐨勫ぇ灝?/span>
const int blocksize = sizeof(int);
boost::pool<> alloc(blocksize);
for(int i = 0; i < 100; i++)
{
//! 鍒嗛厤
int* ptr = (int*)alloc.malloc();
cout<<*ptr<<endl;
//! 閲婃斁
alloc.free(ptr);
}
//!object pool姣忔闇瑕佹寚瀹氬璞″ぇ灝?nbsp;
boost::object_pool<Object> pool_alloc;
for(int i = 0;i < 100;i++)
{
//! 鍒嗛厤鍐呭瓨
void* mem = pool_alloc.malloc();
//! 鏋勯?/span>
Object *obj = new(mem)Object();
//! 鏋愭瀯
pool_alloc.destroy(obj);
}
system("PAUSE");
return EXIT_SUCCESS;
}
//! ccsdu2004 #include <iostream>
#include <boost/pool/pool.hpp>
#include <boost/pool/object_pool.hpp>
using namespace std;
using namespace boost;
class Object
{
public:
Object(){cout<<"new obj"<<endl;}
~Object(){cout<<"delete obj"<<endl;}
};
int main(int argc, char *argv[])
{
//!姣忔鍒嗛厤鐨勫潡鐨勫ぇ灝?/span>
const int blocksize = sizeof(int);
boost::pool<> alloc(blocksize);
for(int i = 0; i < 100; i++)
{
//! 鍒嗛厤
int* ptr = (int*)alloc.malloc();
cout<<*ptr<<endl;
//! 閲婃斁
alloc.free(ptr);
}
//!object pool姣忔闇瑕佹寚瀹氬璞″ぇ灝?nbsp;
boost::object_pool<Object> pool_alloc;
for(int i = 0;i < 100;i++)
{
//! 鍒嗛厤鍐呭瓨
void* mem = pool_alloc.malloc();
//! 鏋勯?/span>
Object *obj = new(mem)Object();
//! 鏋愭瀯
pool_alloc.destroy(obj);
}
system("PAUSE");
return EXIT_SUCCESS;
}
]]>
#include <boost/function.hpp>
鍩烘湰鐨刦unction瀵硅薄渚嬪瓙
boost::function<int(const char*,&int)> f;
浠ｇ爜璇ュ嚱瀛愬搴旂殑鍑芥暟鍏惰繑鍥炲間負int綾誨瀷,濂規湁涓?涓弬鏁板垎鍒負const char*鍜?amp;int綾誨瀷
涓涓畝鍗曠殑渚嬪瓙濡備笅鎵紺?
#include <iostream>
#include <boost/function.hpp>
inline int Sum(const int a,const int b)
{
return a + b;
}
int main()
{
boost::function<int(const int,const int)> sum_ptr;
sum_ptr = ∑
std::cout<<"1+2=:?"<<sum_ptr(1,2);
system("PAUSE");
return EXIT_SUCCESS;
}
濡傛灉瀵瑰簲鐨勫嚱鏁頒負綾葷殑鎴愬憳鍑芥暟鍒欏叾浣跨敤渚嬪瓙鍙弬鑰冧笅闈㈢殑璇存槑:#include <boost/function.hpp>
inline int Sum(const int a,const int b)
{
return a + b;
}
int main()
{
boost::function<int(const int,const int)> sum_ptr;
sum_ptr = ∑
std::cout<<"1+2=:?"<<sum_ptr(1,2);
system("PAUSE");
return EXIT_SUCCESS;
}
#include <iostream>
#include <boost/function.hpp>
#include <functional>
struct Adder
{
Adder(int val):value(val){}
int Add(int x){return x*value;}
int value;
};
int main()
{
//! 瀵瑰簲鍑芥暟榪斿洖鍊糹nt鍙傛暟涓篿nt
boost::function<int(int)>f;
Adder add(7);
//! 緇戝畾鎴愬憳鍑芥暟鍒癰oost::function<
>
f = std::bind1st(std::mem_fun(&Adder::Add),&add);
std::cout<<f(5)<<std::endl;
system("PAUSE");
return EXIT_SUCCESS;
}
瀵逛簬浠垮嚱瀛愬垯鍙互榪欐牱鍋?#include <boost/function.hpp>
#include <functional>
struct Adder
{
Adder(int val):value(val){}
int Add(int x){return x*value;}
int value;
};
int main()
{
//! 瀵瑰簲鍑芥暟榪斿洖鍊糹nt鍙傛暟涓篿nt
boost::function<int(int)>f;
Adder add(7);
//! 緇戝畾鎴愬憳鍑芥暟鍒癰oost::function<
>f = std::bind1st(std::mem_fun(&Adder::Add),&add);
std::cout<<f(5)<<std::endl;
system("PAUSE");
return EXIT_SUCCESS;
}
#include <iostream>
#include <boost/function.hpp>
#include <functional>
struct Div
{
float operator()(int x, int y)const
{
return((float)x)/y;
}
};
int main()
{
//! 2
boost::function<float(int,int)> div;
div = Div();
std::cout<<div(1,2)<<std::endl;
system("PAUSE");
return EXIT_SUCCESS;
}
//! ccsdu2004 #include <boost/function.hpp>
#include <functional>
struct Div
{
float operator()(int x, int y)const
{
return((float)x)/y;
}
};
int main()
{
//! 2
boost::function<float(int,int)> div;
div = Div();
std::cout<<div(1,2)<<std::endl;
system("PAUSE");
return EXIT_SUCCESS;
}
]]>
鍩烘湰鐨勭爺鍙戝涓?
#include <cstdlib>
#include <iostream>
#include <boost/filesystem.hpp>
using namespace std;
namespace fs = boost::filesystem;
int main(int argc, char *argv[])
{
std::cout<<"sizeof(intmax_t)is:"<<sizeof(boost::intmax_t)<<'\n';
fs::path path("main.cpp",fs::native);
if(!fs::exists(path))
{
return -1;
}
if(!fs::is_regular(path))
return -1;
std::cout<<"size is:"<<fs::file_size(path)<<"瀛楄妭"<<std::endl;
fs::path full_path(fs::initial_path<fs::path>());
full_path = fs::system_complete(fs::path("main.cpp"));
//! 鑾峰彇緇欏畾鏂囦歡鍏ㄨ礬寰?nbsp;
cout<<"full path name is:"<<full_path.file_string()<<std::endl;
//! 媯嫻嬫槸涓嶆槸璺緞
cout<<"is path:"<<fs::is_directory(full_path)<<std::endl;
unsigned long file_count = 0;
unsigned long dir_count = 0;
unsigned long other_count = 0;
unsigned long err_count = 0;
full_path = fs::system_complete(fs::path("C:\\WINDOWS"));
//! 鐩綍榪唬
fs::directory_iterator end_iter;
for(fs::directory_iterator dir_itr(full_path);dir_itr != end_iter;++dir_itr)
{
try
{
if(fs::is_directory(dir_itr->status()))
{
++dir_count;
std::cout<<dir_itr->path().filename()<<"[directory]\n";
}
else if(fs::is_regular_file(dir_itr->status()))
{
++file_count;
std::cout<<dir_itr->path().filename()<<"\n";
//! 鍏ㄨ礬寰勫悕瀛?nbsp;
std::cout<<dir_itr->path().native_file_string()<<std::endl;
}
else
{
++other_count;
std::cout << dir_itr->path().filename() <<"[other]\n";
}
}
catch(const std::exception & ex)
{
++err_count;
std::cout<<dir_itr->path().filename()<<" "<<ex.what()<<std::endl;
}
}
std::cout<<"\n"<<file_count<<"files\n"<<dir_count<<" directories\n"<<other_count<<" others\n"<<err_count<<" errors\n";
//! 鐢熸垚鏂囦歡鐩綍
fs::create_directories(fs::path("filesystem"));
system("PAUSE");
return EXIT_SUCCESS;
}
//! ccsdu2004
boost鏂囦歡緋葷粺榪樹笉閿?br>瑕佹槸鍐嶅姞鍏ュ鍘嬬緝鍖呮垨鑰呰祫婧愬寘鐨勬敮鎸佸氨鏇村ソ浜?#include <iostream>
#include <boost/filesystem.hpp>
using namespace std;
namespace fs = boost::filesystem;
int main(int argc, char *argv[])
{
std::cout<<"sizeof(intmax_t)is:"<<sizeof(boost::intmax_t)<<'\n';
fs::path path("main.cpp",fs::native);
if(!fs::exists(path))
{
return -1;
}
if(!fs::is_regular(path))
return -1;
std::cout<<"size is:"<<fs::file_size(path)<<"瀛楄妭"<<std::endl;
fs::path full_path(fs::initial_path<fs::path>());
full_path = fs::system_complete(fs::path("main.cpp"));
//! 鑾峰彇緇欏畾鏂囦歡鍏ㄨ礬寰?nbsp;
cout<<"full path name is:"<<full_path.file_string()<<std::endl;
//! 媯嫻嬫槸涓嶆槸璺緞
cout<<"is path:"<<fs::is_directory(full_path)<<std::endl;
unsigned long file_count = 0;
unsigned long dir_count = 0;
unsigned long other_count = 0;
unsigned long err_count = 0;
full_path = fs::system_complete(fs::path("C:\\WINDOWS"));
//! 鐩綍榪唬
fs::directory_iterator end_iter;
for(fs::directory_iterator dir_itr(full_path);dir_itr != end_iter;++dir_itr)
{
try
{
if(fs::is_directory(dir_itr->status()))
{
++dir_count;
std::cout<<dir_itr->path().filename()<<"[directory]\n";
}
else if(fs::is_regular_file(dir_itr->status()))
{
++file_count;
std::cout<<dir_itr->path().filename()<<"\n";
//! 鍏ㄨ礬寰勫悕瀛?nbsp;
std::cout<<dir_itr->path().native_file_string()<<std::endl;
}
else
{
++other_count;
std::cout << dir_itr->path().filename() <<"[other]\n";
}
}
catch(const std::exception & ex)
{
++err_count;
std::cout<<dir_itr->path().filename()<<" "<<ex.what()<<std::endl;
}
}
std::cout<<"\n"<<file_count<<"files\n"<<dir_count<<" directories\n"<<other_count<<" others\n"<<err_count<<" errors\n";
//! 鐢熸垚鏂囦歡鐩綍
fs::create_directories(fs::path("filesystem"));
system("PAUSE");
return EXIT_SUCCESS;
}
//! ccsdu2004
]]>
//! boost搴撳紩瀵?.minmax
#include <list>
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <boost/algorithm/minmax.hpp>
#include <boost/algorithm/minmax_element.hpp>
using namespace std;
inline void Print(int i)
{
std::cout<<i<<std::endl;
}
inline int Rand()
{
return rand()%10;
}
int main()
{
list<int> l;
typedef list<int>::const_iterator iterator;
//! 浣跨敤緇欏畾娉涘嚱瀛愮敓鎴?2涓殢鏈烘暟騫舵帹鍏ラ摼琛?nbsp;
generate_n(front_inserter(l),12,Rand);
std::for_each(l.begin(),l.end(),Print);
std::cout<<"list size is:"<<l.size()<<std::endl;
//! 鑾峰彇緇欏畾搴忓垪鐨勫澶ф渶灝忓?榪斿洖涓簊td::pair<..,..>
pair<iterator,iterator> result = boost::minmax_element(l.begin(),l.end());
cout<<"the smallest element is:"<<*(result.first)<<endl;
cout<<"the largest element is:"<<*(result.second)<<endl;
//! 鑾峰彇絎竴涓渶灝忓厓绱?nbsp;
iterator minitr = boost::first_min_element(l.begin(),l.end());
cout<<"first min element is:"<<*minitr<<endl;
system("PAUSE");
return 1;
}
//! 鍚庤:浼間箮娌＄湅鍒頒粈涔堝己澶х殑鍔熻兘
#include <list>
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <boost/algorithm/minmax.hpp>
#include <boost/algorithm/minmax_element.hpp>
using namespace std;
inline void Print(int i)
{
std::cout<<i<<std::endl;
}
inline int Rand()
{
return rand()%10;
}
int main()
{
list<int> l;
typedef list<int>::const_iterator iterator;
//! 浣跨敤緇欏畾娉涘嚱瀛愮敓鎴?2涓殢鏈烘暟騫舵帹鍏ラ摼琛?nbsp;
generate_n(front_inserter(l),12,Rand);
std::for_each(l.begin(),l.end(),Print);
std::cout<<"list size is:"<<l.size()<<std::endl;
//! 鑾峰彇緇欏畾搴忓垪鐨勫澶ф渶灝忓?榪斿洖涓簊td::pair<..,..>
pair<iterator,iterator> result = boost::minmax_element(l.begin(),l.end());
cout<<"the smallest element is:"<<*(result.first)<<endl;
cout<<"the largest element is:"<<*(result.second)<<endl;
//! 鑾峰彇絎竴涓渶灝忓厓绱?nbsp;
iterator minitr = boost::first_min_element(l.begin(),l.end());
cout<<"first min element is:"<<*minitr<<endl;
system("PAUSE");
return 1;
}
//!ccsdu2004
]]>