- Boost-users - lists.boost.org

Compilation problem with 1.37.0 on OS X
by Stephen Blinkhorn 07 Feb '09

07 Feb '09

Hello Boost people, I have problems compiling a project after upgrading to Boost 1.37.0 from an earlier version, dating back to July 08 ish. This is on Mac OS X 10.5.6, XCode 3.1 etc. Swapping back to my older Boost install resolves all problems. Errors: Precompiling /Developer/SDKs/MacOSX10.5.sdk/System/Library/Frameworks/ AppKit.framework/Headers/AppKit.h powerpc-apple-darwin9-gcc-4.0.1: installation problem, cannot exec '/ Developer/usr/bin/../libexec/gcc/powerpc-apple-darwin9/4.0.1/cc1obj': Argument list too long I don't understand why this causes problems, happens on two different machines after reinstalling GCC etc. Curious. Stephen

2 1

Problem with Iterator passing inside an index... a little complex...
by Rodrigo Dias Ferreira 06 Feb '09

06 Feb '09

Hi There, I am using the Boost.MultiIndex and I am facing a problem that I am try to resolving (debbuging) already about 20 hours... I think I get the problem isolated, but I don't know how to solve, and I don't know if this it is implemented. So I decided to make a example, it is a little big, but I put it as resumed as I could and post here in order to know if anyone could help me out. I will try to explain briefly here, I will copy the main() code right under the explanation, but the whole code of the example is in the end of the e-mail (with the classes and functions) If you want you could try to run too see what is the problem that I am talking about.) When I try to access an pair of iterators pair<propIt,propIt> that I stored inside a class (propertystream_h), somehow is changing to where the iterator points, I think it could be because the object which has originate (Graph) the index is created, stored in in a static index (which I call _graphRep) from the DynamicGraphs, passed to a handler (Graph_h), and then after the Graph goes out of scope it is destroyed. When the Graph_h._localGraph (copy of the iterator->Graph returned by the insertion in the _graphRep) access its member _globalProperties (which is an index containing the fields: {string _key, string _value, propertystream_h _props} from the struct globalPropSchema) through a iterator (let's call it: gpit), then it is fine. But then when I try to access through the gpit->_props._propRangeIt.first, the iterator of the propertystream_h (_propRangeIt.first), then the iterators, some how are messed up. ( -> in this example it points to last element, and then when I get next, never finds the end(). (sometimes it return some trash, sometimes I get segmentation fault). So I would like to know why it is messing with the iterator? And how could I solve this problem? that's it, best regards, Rodrigo P.S.: I hope someone can help me... copy of the main(): int main(){ DynamicGraphs dg; Graph_h graph_h; propertystream_h propS; property_h prop_h; GlobalPropIterator gpit; GlobalProp_h gp_h; propertystream_h ps_h; property_h p_h; graph_h = dg.createGraph("COI:0351-123-4555"); if (!graph_h) cout << "Unsuccessful creation!"<<endl; else cout << "Successful creation!" <<endl; //It works, because it takes from the _localPropRep, and it passes it as value!!! ps_h = graph_h->lookupLocalProp("name"); while(!ps_h.end()){ cout << "LocalProperties: "; p_h=ps_h.next(); cout << "Key: " << p_h.key() << " Value: " << p_h.value() <<endl; } // It does not work, because is accessing the propertystream_h from // the _globalPropRep (index of the tuple // {string globalkey, string value, propertystream_h props} // the propertystream_h it has as member a pair of iterators for another index. // -> after a lot of debugging (about 16h) OI found out that // it seems that during the creation of a graph, // when it passes the graph to graph_h, and goes out of scope, it keep the // iterator reference to the first element, but just that... the next // gives me segmentation fault. Anyone knows how to pass the graph and the its members // the indexes-repositories as value, so it would not depend on the pointing to // the graph that was freed from the memory? gpit = graph_h->properties("*"); if (!gpit) cout << "Not found any property in the globalProperties Repository."<<endl; else{ int i=0; while (!gpit.end()) { gp_h = gpit.next(); cout << "While_1::Iteration_" << ++i << endl; cout << "GlobalProperty key: " << gp_h.key() << endl; cout << "GlobalProperty value: " << gp_h.value() << endl; ps_h = gp_h.propertyStreamHandler(); int j = 0; while (!ps_h.end()){ p_h = ps_h.next(); cout << "While_2::Iteration" << ++j << endl; cout << "GlobalProperty::PropertyStream: key " << p_h.key() << endl; cout << "GlobalProperty::PropertyStream: value " << p_h.value() << endl; } } } } Here it is the code: /* * IndexProblem.cpp * * Created on: Feb 6, 2009 * Author: rodrigo */ #include <boost/multi_index_container.hpp> #include <boost/multi_index/hashed_index.hpp> #include <boost/multi_index/member.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/composite_key.hpp> #include <boost/tuple/tuple.hpp> #include <boost/tokenizer.hpp> #include <boost/lambda/lambda.hpp> #include <climits> #include <iomanip> #include <iostream> #include <ctime> #include <string> #if !defined(NDEBUG) #define BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING #define BOOST_MULTI_INDEX_ENABLE_SAFE_MODE #endif using std::string; using std::pair; using std::ostream; using std::cout; using std::endl; using boost::multi_index_container; using namespace boost::multi_index; struct property { string _key; string _value; /// Default Constructor property(){} /// Constructor with parameters: initialize the name and graph property(string key, string value) : _key(key), _value(value) {} /// Copy Contructor property(const property &pm) : _key(pm._key), _value(pm._value) {} //For debugging TODO: delete later friend ostream& operator<<(ostream& os, const property &p){ os << "Key: " << p._key << " value: " << p._value << endl; return os; } }; /// Indexing in the data structure PropMap typedef multi_index_container< property, indexed_by< hashed_non_unique< BOOST_MULTI_INDEX_MEMBER(property, string, _key) > > > propIndex; typedef propIndex::iterator propIt; class property_h { private: /// Access to properties through the iterator propIt _pit; public: /// Default Constructor property_h(){} /// Constructor with Parameters: for lookup of Nodes property_h (const propIt &it) : _pit(it){} /// Constructor with Parameters: for lookup of Nodes property_h (const property_h &h) : _pit(h._pit){} /// Returns the key from the property being handled string key() const {return _pit->_key;} /// Returns the value from the property being handled string value() const {return _pit->_value;} }; class propertystream_h { /// _propRangeIt: for keeping a range in order to iterate over the graphs pair<propIt,propIt> _propRangeIt; /// _noMatches: true if there are no matches during the lookup function bool _noMatches; public: /// Default Constructor propertystream_h() : _noMatches(true){} /// Constructor with parameters for local lookup propertystream_h(pair<propIt,propIt> rangeIt, bool noMatches) : _propRangeIt(rangeIt), _noMatches(noMatches){ } /// Default Constructor propertystream_h(const propertystream_h &ps) : _propRangeIt(ps._propRangeIt), _noMatches(ps._noMatches){} // returns null_h on end of stream ... property_h next(){ return property_h(_propRangeIt.first++); } /// This function returns true whenever is the end of the stream bool end(){ return (_propRangeIt.first == _propRangeIt.second); } /// Overload operator!: shows if a creation was unsuccessful bool operator!(){ return _noMatches; } }; struct globalPropSchema{ string _key; string _value; propertystream_h _props; /// Default Constructor globalPropSchema() : _key(""), _value(""), _props(){} /// Parameter Constructor globalPropSchema(string k, string value, propertystream_h props) : _key(k), _value(value), _props(props){} /// Copy Constructor globalPropSchema(const globalPropSchema &gps) : _key(gps._key), _value(gps._value), _props(gps._props){} //TODO: Delete it: Debug friend ostream& operator<<(ostream &os, const globalPropSchema &gps){ os << "Key: " << gps._key << " Value: "<< gps._value << " PropertyStreamAdress: " << &gps._props <<endl; return os; } }; typedef multi_index_container< globalPropSchema, indexed_by< ordered_non_unique< composite_key< globalPropSchema, BOOST_MULTI_INDEX_MEMBER(globalPropSchema, string, _key), BOOST_MULTI_INDEX_MEMBER(globalPropSchema, string, _value) >, composite_key_compare< std::greater<string>, std::less<string> > > > > grobalProperties; /// Iterator for the data structure of the global properties index typedef grobalProperties::iterator globalPropIt; class GlobalProp_h{ private: /// Access to globalPropertiest items through the iterator globalPropIt _gpit; public: /// Default Constructor GlobalProp_h(){} /// Constructor with Parameters: for lookup of Nodes GlobalProp_h (const globalPropIt &it) : _gpit(it){} /// Copy Constructor GlobalProp_h (const GlobalProp_h &gph) : _gpit(gph._gpit){} /// Access to key of globalPropeties items string key(){ return _gpit->_key;} /// Access to value of globalPropeties items string value(){return _gpit->_value;} propertystream_h propertyStreamHandler(){ return _gpit->_props; } }; /// Iterator for the data structure of the global properties index typedef grobalProperties::iterator globalPropIt; class GlobalPropIterator{ private: /// _propRangeIt: for keeping a range in order to iterate over the graphs pair<globalPropIt,globalPropIt> _globalPropRangeIt; /// _noMatches: true if there are no matches during the lookup function bool _noMatches; public: /// Default Constructor GlobalPropIterator(){} /// Constructor with parameters for local lookup GlobalPropIterator(pair<globalPropIt,globalPropIt> rangeIt, bool noMatches) : _globalPropRangeIt(rangeIt), _noMatches(noMatches){} /// Default Constructor GlobalPropIterator(const GlobalPropIterator &gpi) : _globalPropRangeIt(gpi._globalPropRangeIt), _noMatches(gpi._noMatches){} // returns null_h on end of stream ... GlobalProp_h next(){ return GlobalProp_h(_globalPropRangeIt.first++); } /// This function returns true whenever is the end of the stream bool end(){ return (_globalPropRangeIt.first == _globalPropRangeIt.second); } /// Overload operator!: shows if a creation was unsuccessful bool operator!(){ return _noMatches; } }; class Graph { private: propIndex _localPropRep; /// Repository for the properties of the global properties related to the graph; grobalProperties _globalPropRep; public: // TODO: Really constructors /// Default Constructor Graph() {} /// Copy constructors Graph(const Graph &g) : _localPropRep(g._localPropRep), _globalPropRep(g._globalPropRep){} bool addProperty(string key, string value); GlobalPropIterator properties(string pattern) const; /// Function to lookup Local Properties propertystream_h lookupLocalProp(string pattern); friend class Graph_h; }; /// GraphMap: Data Structure for setting an index in the uniqueGraphName and retrieving handler Graph_h struct graphMap { string _name; Graph _graph; /// Default Constructor graphMap(){} /// Constructor with parameters: initialize the name and graph graphMap(string uniqueGraphName, Graph graph) : _name(uniqueGraphName), _graph (graph) {} /// Constructor with parameters: initialize the name and graph graphMap(const graphMap &gm) : _name(gm._name), _graph (gm._graph) {} }; ///ordered_unique Index in the data structure graph_hm typedef multi_index_container< graphMap, indexed_by< ordered_unique< BOOST_MULTI_INDEX_MEMBER(graphMap,string,_name) > > > graphIndex; /// Defing an iterator for the graphMapIndex typedef graphIndex::iterator graphIt; class Graph_h { private: /// \brief GraphIterator: Iterator pointing to the Graph graphIt _git; Graph _localGraph; bool _createSuccess; public: /// Default Constructor Graph_h() : _createSuccess(false) {} /// Constructor with Parameters: for creation of Graphs Graph_h ( pair<graphIt,bool> creation) : _git(creation.first), _createSuccess(creation.second){ _localGraph = creation.first->_graph; } /// Constructor with Parameters: for lookup of Graphs Graph_h (const graphIt &it) : _git(it), _createSuccess(false){ _localGraph = it->_graph; } /// Constructor with Parameters: for lookup of Graphs Graph_h (const Graph_h &h) : _git(h._git), _localGraph(h._localGraph), _createSuccess(h._createSuccess){} bool operator!(){ return !_createSuccess; } /// Operator-> overloading: allows access to graph members Graph* operator->() {return &_localGraph;} }; propertystream_h Graph::lookupLocalProp(string pattern){ pair<propIt,propIt> rangeIt; propIt rangeItfirst = _localPropRep.find(pattern); rangeIt.first = rangeItfirst; rangeIt.second = _localPropRep.end(); if (rangeIt.first != _localPropRep.end()) // second parameter means that the variable noMatches, so false in case that found the key return propertystream_h(rangeIt, false); else //No matches return propertystream_h(rangeIt, true); } GlobalPropIterator Graph::properties(string pattern) const{ pair<globalPropIt,globalPropIt> globalRangePropIt; bool noMatchesTmp=false; //Whole range if (!pattern.compare("*")){ globalRangePropIt.first = _globalPropRep.begin(); globalRangePropIt.second = _globalPropRep.end(); } if (globalRangePropIt.first == globalRangePropIt.second) noMatchesTmp = true; return GlobalPropIterator(globalRangePropIt, noMatchesTmp); } bool Graph::addProperty(string key, string value){ bool boolLocal, boolGlobal; pair <propIt,propIt> rangePropIt; string globalKey = "graph:"; globalKey.append(key); // "graph:namePorperty" boolLocal = _localPropRep.insert(property(key,value)).second; //Defining the whole range for iterate over the local properties rangePropIt.first = _localPropRep.begin(); rangePropIt.second = _localPropRep.end(); //Debug propIt it = rangePropIt.first; cout << "How it should be showed when accessing the iterator..."<<endl; while (rangePropIt.first != rangePropIt.second){ cout << "DEBUG@addProperty: " << *(rangePropIt.first++); } cout << endl; rangePropIt.first = it; //Debug boolGlobal = _globalPropRep.insert( globalPropSchema( globalKey, value, propertystream_h(rangePropIt, false) ) ).second; return (boolLocal && boolGlobal); } class DynamicGraphs { public: /// Data member to represent the graph repository (using ordered_unique index) static graphIndex _graphRep; Graph_h createGraph(string uniqueGraphName); }; graphIndex DynamicGraphs::_graphRep; /// Creation of Graph in DynamicGraphs Graph_h DynamicGraphs::createGraph(string uniqueGraphName){ Graph g; g.addProperty("name", uniqueGraphName); //Test g.addProperty("age", "Unknown"); g.addProperty("color", "blue"); return Graph_h( _graphRep.insert( graphMap( uniqueGraphName, g ) ) ); } int main(){ DynamicGraphs dg; Graph_h graph_h; propertystream_h propS; property_h prop_h; GlobalPropIterator gpit; GlobalProp_h gp_h; propertystream_h ps_h; property_h p_h; graph_h = dg.createGraph("COI:0351-123-4555"); if (!graph_h) cout << "Unsuccessful creation!"<<endl; else cout << "Successful creation!" <<endl; //It works, because it takes from the _localPropRep, and it passes it as value!!! ps_h = graph_h->lookupLocalProp("name"); while(!ps_h.end()){ cout << "LocalProperties: "; p_h=ps_h.next(); cout << "Key: " << p_h.key() << " Value: " << p_h.value() <<endl; } // It does not work, because is accessing the propertystream_h from // the _globalPropRep (index of the tuple // {string globalkey, string value, propertystream_h props} // the propertystream_h it has as member a pair of iterators for another index. // -> after a lot of debugging (about 16h) OI found out that // it seems that during the creation of a graph, // when it passes the graph to graph_h, and goes out of scope, it keep the // iterator reference to the first element, but just that... the next // gives me segmentation fault. Anyone knows how to pass the graph and the its members // the indexes-repositories as value, so it would not depend on the pointing to // the graph that was freed from the memory? gpit = graph_h->properties("*"); if (!gpit) cout << "Not found any property in the globalProperties Repository."<<endl; else{ int i=0; while (!gpit.end()) { gp_h = gpit.next(); cout << "While_1::Iteration_" << ++i << endl; cout << "GlobalProperty key: " << gp_h.key() << endl; cout << "GlobalProperty value: " << gp_h.value() << endl; ps_h = gp_h.propertyStreamHandler(); int j = 0; while (!ps_h.end()){ p_h = ps_h.next(); cout << "While_2::Iteration" << ++j << endl; cout << "GlobalProperty::PropertyStream: key " << p_h.key() << endl; cout << "GlobalProperty::PropertyStream: value " << p_h.value() << endl; } } } } -- ************************************************* Rodrigo Dias Ferreira Master Student of Computational Engineering Technische Universität Dresden - Germany Mobile Phone:+49 171 3158797 E-mail: rodrigodias(a)gmx.de ************************************************* Jetzt 1 Monat kostenlos! GMX FreeDSL - Telefonanschluss + DSL für nur 17,95 Euro/mtl.!* http://dsl.gmx.de/?ac=OM.AD.PD003K11308T4569a

2 1

boost::interprocess::managed_mapped_file and cross arch?
by Ben Martin 06 Feb '09

06 Feb '09

Hi, Has anyone got any tips on using boost::interprocess::managed_mapped_file with the managed_mapped_file::segment_manager allocators and the boost/interprocess/containers in a memory mapped file which can be used across x64 and arm platforms? As everything should be using offset pointers, I get the feeling that there should be some way to make this cross platform utopia happen but thought I'd ask before serious tinkering attempts.

2 1

std::back_inserter() with move semantics?
by Robert Dailey 06 Feb '09

06 Feb '09

Hi, I'm currently using std::back_inserter on a ptr_vector, and the values being inserted are boost::unique_ptr's. back_inserter does simple assignment but I need it to call boost::move() on the thing being assigned (inserted). Does boost have an algorithm that can do this?

1 1

boost::bind
by Hansi 06 Feb '09

06 Feb '09

Hello, I have a problem using boost::bind (version 1.34.1). I don't know whot I make wrong but I think that I can use it in my case. Or I'm wrong? I use VS2005. in some external header file I have the declaration typedef void (* FUNCTION)(int ,void *); void SetCallback(FUNCTION cb); Now I want to call a function inside my class. Maybe with bind? I have tested the following: SetCallback(boost::bind<void>(boost::mem_fn(&Program::OnCallback),this,_1,_2)); but this does not work..have anyone an hint how I can do that? Regards Hansjörg

3 3

[ptr_container] ptr_map and cloning issues
by Robert Dailey 06 Feb '09

06 Feb '09

I have a ptr_map as follows: typedef boost::ptr_map<std::string, Texture> TextureContainer; I only use forward declarations of Texture where needed. When I'm iterating over an instance of TextureContainer, I expect to not have to do more than use the forward declaration since technically we're only iterating pointer values and the definition of Texture is not needed for this. So when I do this: TextureContainer myTextures; TextureContainer::const_iterator it = myTextures.find( "some key" ); The above (second line) results in an extremely complex and long compiler error, but the important part of the error says what I have pasted below. Why is this error happening? Is it trying to clone Texture objects? This shouldn't be happening. *boost/ptr_container/clone_allocator.hpp(34) : error C2514: 'rs::Texture' : class has no constructors C:\IT\work\planb\components\rs/renderer/TextureFwd.hpp(6) : see declaration of 'rs::Texture' C:\IT\work\planb\third_party\boost\1_37_0\boost/ptr_container/clone_allocator.hpp(55) : see reference to function template instantiation 'T *boost::new_clone<U>(const T &)' being compiled*

3 7

boost and std collisons in c++0x
by Ein Held 06 Feb '09

06 Feb '09

Hello I would like to know more about boost's general attitude towards c++0x and the collisions of boost with std. As of now, we move both, ::boost- and ::std-namesspace in the global namespace via using xxx. This is exactly what we want - boost and the stl are both such fundamental libraries that using an explicit namespace specifier everytime we want to use content of these namespaces is not accaptable. This would just blow the code and make it unreadable. Once we move up to c++0x, we will not be able to keep this way of coding up. ::std::tr1 is merged into ::std and so the former tr1 classes will collide with the boost ones if explicit namespace identifiers are missing. I would like to stress the fact that code, perfectly fine to the boost documentation, will fail to compiler most likely. #include <iostream> //This one might include <array> using namespace std; #include <boost/array.hpp> using namespace boost; array<int,1> blub; //fail Is there anything planned to prevent this happen? Thank you

6 8

[iterator] - does there exist an opposite of Function Output Iterator?
by Michael Fawcett 06 Feb '09

06 Feb '09

http://www.boost.org/doc/libs/1_37_0/libs/iterator/doc/function_output_iter… Shows a unary function being adapted as an OutputIterator. Does Boost have something that does the opposite, i.e. takes an OutputIterator and adapts it as a unary function object? In my own code I currently have: template <typename OutputIterator> struct output_iterator_function { explicit output_iterator_function(OutputIterator i) : iter(i) { } template <typename T> void operator()(const T &v) { *iter++ = v; } OutputIterator iter; }; template <typename OutputIterator> output_iterator_function<OutputIterator> make_output_iterator_function(OutputIterator i) { return output_iterator_function<OutputIterator>(i); } If this doesn't already exist in Boost.Iterator, it seems like it would nicely complement the already existing function_output_iterator. --Michael Fawcett

3 4

glibc detected corrupted doubly-linked list (unit test)
by Ross Boylan 05 Feb '09

05 Feb '09

I get error shown below when I try to test my program. It appears to be coming directly out of the unit test framework, though this is after a test, and so my code could have done something. Can anyone help me determine what is going on or how to fix it? Valgrind shows the error, but it's source is mysterious. This was generated on Debian GNU/Linux etch with 64 bit Xeon and gcc. The same tests run fine on Debian testing with 32 bit AMD and OS-X on 64 bit powerpc (although I think the older version of the OS on the machine is mostly 32 bit). *** glibc detected *** corrupted double-linked list: 0x00000000005fd2a0 *** Program received signal SIGABRT, Aborted. 0x00002affd559207b in *__GI_raise () from /usr/lib/debug/libc.so.6 Current language: auto; currently c (gdb) where #0 0x00002affd559207b in *__GI_raise () from /usr/lib/debug/libc.so.6 #1 0x00002affd559384e in *__GI_abort () from /usr/lib/debug/libc.so.6 #2 0x00002affd55c85f9 in __libc_message () from /usr/lib/debug/libc.so.6 #3 0x00002affd55cd9cc in malloc_consolidate () from /usr/lib/debug/libc.so.6 #4 0x00002affd55cf789 in _int_malloc () from /usr/lib/debug/libc.so.6 #5 0x00002affd55d116d in *__GI___libc_malloc () from /usr/lib/debug/libc.so.6 #6 0x00002affd518f93d in operator new () from /usr/lib/libstdc++.so.6 #7 0x00002affd516e5d1 in std::string::_Rep::_S_create () from /usr/lib/libstdc++.so.6 #8 0x00002affd516ef8b in std::string::_Rep::_M_clone () from /usr/lib/libstdc++.so.6 #9 0x00002affd516f895 in std::string::reserve () from /usr/lib/libstdc ++.so.6 #10 0x00002affd51690a5 in std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::overflow () from /usr/lib/libstdc++.so.6 #11 0x00002affd516da8d in std::basic_streambuf<char, std::char_traits<char> >::xsputn () from /usr/lib/libstdc++.so.6 #12 0x00002affd5163512 in std::operator<< <std::char_traits<char> > () from /usr/lib/libstdc++.so.6 #13 0x00002affd4fbb175 in boost::unit_test::results_collector_t::test_unit_finish () from /usr/lib/libboost_unit_test_framework-gcc-mt-1_33_1.so.1.33.1 #14 0x00002affd4fb8180 in boost::unit_test::framework_impl::visit () from /usr/lib/libboost_unit_test_framework-gcc-mt-1_33_1.so.1.33.1 #15 0x00002affd4fc9f1b in boost::unit_test::traverse_test_tree () from /usr/lib/libboost_unit_test_framework-gcc-mt-1_33_1.so.1.33.1 #16 0x00002affd4fb72d8 in boost::unit_test::framework::run () from /usr/lib/libboost_unit_test_framework-gcc-mt-1_33_1.so.1.33.1 #17 0x00002affd4fc2b35 in main () from /usr/lib/libboost_unit_test_framework-gcc-mt-1_33_1.so.1.33.1 #18 0x00002affd557f4ca in __libc_start_main () from /usr/lib/debug/libc.so.6 #19 0x000000000040420a in _start () at ../sysdeps/x86_64/elf/start.S:113 -- Ross Boylan wk: (415) 514-8146 185 Berry St #5700 ross(a)biostat.ucsf.edu Dept of Epidemiology and Biostatistics fax: (415) 514-8150 University of California, San Francisco San Francisco, CA 94107-1739 hm: (415) 550-1062

1 0

Citing Boost libraries
by Niko Vuokko 05 Feb '09

05 Feb '09

Hi, I remembered once seeing an entry on the website saying how one should cite the Boost project. Now however I can't find it when I'd need it. Thus, is 'Boost Project, http://www.boost.org' enough or is there some policy on citing? Niko Vuokko

2 1