- Boost-users - lists.boost.org

program_options: Allowing unknown options in config files
by Kevin Channon 26 Nov '08

26 Nov '08

Hi, I'm trying to use the Program Options library to parse command line arguments and config files. I can do this with moderate success. I am currently stuck on a solution to the problem of unrecognized options that are present in a config file. It seems that parse_config_file() does not have an obvious way to not abort reading a config file once it finds something that isn't declared in the options description. Any help on how to get around this (or just a kind of "hey you missed this bit of the manual" kind of pointer) would be very welcome. Thanks, Kevin

1 0

Maintenance Guidelines wiki page (Revison 8)
by vicente.botet 26 Nov '08

26 Nov '08

Hi, I have updated the Maintenance Guidelines wiki page. I have take in account the minor proof-reading modifications from Steve Watanave which I have overridden by error (thanks Steve!),and added a lot of thinks, maybe too much :) Please read this mail completely before jumping to the page. This page need to be completed and reworked. Please be free to add new sections to the page or improve the current ones directly or post your comments or suggestions to this list. Here it is the table of contents. [C] 1. Motivation [C] 2. Introduction [C] 1. User code breaking cases [I] 2. Versioning individual Boost libraries [O] 3. Deprecating features [I] 4. Cross version testing [C] 3. Documentation [O] 1. Tag Boost library with specific library version [developer] [O] 2. Make feature request for each feature [developer, user] [I] 3. Include the tracked tickets on the Release notes [developer] [I] 4. List the test cases associated to the trac system tickets [developer] [I] 5. List the dependency upon other Boost library [developer] [O] 6. Document behavior differences between release and debug variants [O] 7. Document behavior differences between toolsets [developer] [C] 4. Coding [O] 1. Don't use using directives [user] [C] 2. Avoid the use of include all features files at the /boost level [user] [C] 3. Be careful with the use of using namespace header files [developer] [C] 4. Don't overload functions that are used by the TR1 (using using)[developer] [O] 5. Avoid include-all-features files at the /boost level [C] 6. Don't refine functions overloading without ensuring the same behavior [C] 7. Avoid the inclusion of symbols at the boost or boost::detail namespace [C] 8. Avoid different external behavior depending on the variant release or debug [O] 9. Avoid to change interfaces [developer] [O] 1. Don't delete files prematurely [developer] [O] 2. Don't delete namespaces prematurely [developer] [O] 3. Don't delete classes/functions/variables prematurely [developer] [O] 4. Don't modify functions prototypes prematurely [developer] [O] 5. Remove the deprecated features on a given release [developer] [C] 5. Test [C] 1. Test headers [developer] [C] 1. Include each header files twice [developer] [I] 2. include each couple of header files in both orders [C] 3. Include all header files [C] 4. link all the header files twice [C] 2. Don't forget to test [C] 1. The implicitly generated member functions [C] 2. The removed default member functions when you declare a constructor [C] 3. The deleted (private) default member functions [C] 4. The explicit constructors [C] 5. The implicit constructors or conversions [C] 6. The const-ness of variables, function parameters and function return types [I] 3. Separate the functional test from the unit test (implementation test) [I] 4. Track regression test on the trac system tickets [I] 5. Preserve the functional test from the preceding versions [developer] [C] 6. Inspections [O] 1. Announce new library features [developer] [C] 2. Inspect the code [developer, user, RM] [C] 3. Check that every modification has been documented [developer, user, RM] [C] 4. Check that every modification has been tested [developer, user, RM] [U] 7. Developer guidelines [U] 8. User guidelines [U] 9. Release manager guidelines Tasks I plan to do: 1* Add the motivation 2* Add other examples of user code break in 2.1 3* Update the Developer, User and Release manager guidelines cross reference (7,8,9) 4* Separate on 4 pages. Main, Documentation, Coding, Test and Inspections 5* Complete incomplete guidelines [C] and improve some of them [I] Note that some guidelines applied to the developer library could be done by other people that would need SVN writtig permission. In particular the Functional Test and some documentation reports. (See below points C and E) Other points I see: A* See if the Jamfile to test the headers from Steve can be adapted to tests (Steve?) 5.1.2 Include each couple of header files in both orders B* See if the difference between source and binary compatibility is desirable (ALL) C* See if the functional test can be written by a team of interested users to don't overload the developers. These tests could in addition include multi-library tests and be stored in a directory independent from the developers one (Interested users?) D* See which configurations (deprecated or not) could be tested by the current test team. (Release Manager Team?) E* See how the following points can be automated and where this information can be included in the documentation. A separated page make possible that this task could be done by other people than the developer. (Some one knowing the Track system?) 3.3. Include the tracked tickets on the Release notes 3.4. List the test cases associated to the trac system tickets F* See how the dependencies between libraries can be automated (Release Manager Team?, CMAKE project?) 3.5. List the dependency upon other Boost library In order to know if I'm going on the right direction, I would like the interested people reply to this post stating for each section, if it is OK[O], must be completed[C]/improved [I], must be updated [U], must be removed [R] and of course any idea is welcome. You can access it directly at "https://svn.boost.org/trac/boost/wiki/Guidelines/MaintenanceGuidelines" or at "https://svn.boost.org/trac/boost/wiki" >Guidelines >Maintenance Guidelines Best regards, Vicente

3 2

How to handle an adjacency matrix on large size
by Navin Shaw 26 Nov '08

26 Nov '08

Dear Friends, I am a fresh programmer and I have assigned a work where I need to handle a graph of very large size(around lakhs by lakhs matrix) with a huge amount of data. I heard that using boost library this can be done very easily, If anybody have any idea kindly guide me. Thanks in advance................ -- Thanks & Regards--- Navin Shaw

1 0

Re: [Boost-users] class API return a const&, optional, shared_ptr
by Emre Turkay 26 Nov '08

26 Nov '08

I see you have three nice options here, 1. Return a shared_ptr. 2. Return a reference and throw exception for invalid indexes. 3. Return an optional. I think all three of them are nice and safe. emre > I have a class A that holds a container of objects of type B indexed by int > for e.g. > > Typically, I have a function of A > > class A { > public: > const B& getB(int <index> ) const; > private: > std::map< int, shared_ptr<B> > listOfBs_; > }; > > The implementation of getB could be > > const B& A::getB(int <index> ) const > { > //what to do if index not found > } > > A number of solutions I think of: > > 1. > boost::optional<const B&> getB(int <index> ) const > { > } > > > 2. > change signature to > const B* getB(int <index> ) const > > > 3. > Define a > static const B notFoundB; > const B& A::getB(int <index> ) const > returns notFoundB when not found and have API users compare return value > with notFoundB > > > I suppose the cheapest in overhead/performance is 2... optional must have > some time overhead? > > Are there advised solutions? Favourites in terms of style? > > Regards,

1 0

hash_map use with serialization in Visual Studio 2005
by Mauricio Gomes 25 Nov '08

25 Nov '08

Dear all, I am learning to use the serialization library and I am having some difficulties in using hash_map. In the code below if I change to std::map it works fine. #include <cstddef> // NULL #include <iomanip> #include <iostream> #include <fstream> #include <string> #include <hash_map> #include <boost/archive/tmpdir.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/utility.hpp> #include <boost/serialization/list.hpp> #include <boost/serialization/hash_map.hpp> #include <boost/serialization/map.hpp> #include <boost/serialization/assume_abstract.hpp> template <typename StringType, typename SettingKeyType, typenameSettingValueType> void save_setting (StringType application_name, SettingKeyType key, SettingValueType value) { typedef stdext::hash_map<SettingKeyType, SettingValueType> Config; static stdext::hash_map<StringType, Config> app_configs; // key = application_name, value = settings map. Config cfg = app_configs[application_name]; cfg[key] = value; StringType file_name = application_name + ".cfg"; // Compose configuration file name. std::ofstream ofs (file_name.c_str ()); boost::archive::text_oarchive oa (ofs); oa << cfg; } int main(int argc, char *argv[]) { save_setting<std::string, int, std::string> ("test_app", 1, "value1"); } However if I try to use stdext::hash_map then it fails to compile with the following error: 1>c:\boost_1_37_0\boost\serialization\access.hpp(109) : error C2039: 'serialize' : is not a member of 'stdext::hash_map<_Kty,_Ty>' 1> with 1> [ 1> _Kty=int, 1> _Ty=std::string 1> ] It is most likely related to the fact that hash_map is not in the std namespace. I have searched the boost-users list and I have found this: http://lists.boost.org/boost-users/2005/08/13183.php but it refers to a GNU/Linux environment. Has this been addressed in 1.37 (that's the version I am using) ? Any suggestions ? Thank you in advance for your help. -- Mauricio Gomes

1 0

[dataflow][iostreams]Can someone Compare/Contrast
by Duane McKinney 25 Nov '08

25 Nov '08

If it has already been done I appologize. They seem very similar to me. Is it just a matter of style? It seems like dataflow lends itself better to dealing with blocks/frames of data than the iostreams library. I would appreciate any clarification though.

2 2

Exception when constructing empty list in shared memory (boost::interprocess::list)
by Roland 25 Nov '08

25 Nov '08

Hello all (Hi Ion) Here's a small piece of code that causes an exception to be thrown (when it shouldn't). The environment is MSVC8 (VS2005SP1) with Boost 1.37. The code is an adaption of one of the samples in the interprocess documentation. The samples creates a vector of ClassWithList in shared memory. Then it creates an instance of ClassWithList and push_back()'s it onto the vector. >From what I can gather, the List member (which is a list<>) is constructed in shared memory, and deep within, it calls class segment_manager_base<MemoryAlgorithm>::allocate_many(size, 0). The MemoryAlgorithm is rb_tree_best_fit<..>. allocate_many (imo correctly) returns NULL for a 0-element allocation, which causes the exception to be thrown. Replacing the member variable type "list<>" with a "vector<>" makes everything work nicely. (allocate_many() is not used in that case). Thanks roland PS: Other than this, interprocess::* has been great! #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/containers/list.hpp> #include <boost/interprocess/allocators/allocator.hpp> int main () { using namespace boost::interprocess; //Typedefs typedef managed_shared_memory::segment_manager SegmentManager; typedef struct ListElem { int nValue; } ListElem; typedef allocator<ListElem, SegmentManager> ListElemAllocator; typedef list<ListElem, ListElemAllocator> ListElemList; typedef allocator<void, SegmentManager> VoidAllocator; class ClassWithList { public: ClassWithList(const VoidAllocator &alloc) : List(alloc) {} ListElemList List; }; typedef allocator<ClassWithList, SegmentManager> ClassWithListAllocator; typedef vector<ClassWithList, ClassWithListAllocator> ClassWithListVector; shared_memory_object::remove("myshm"); try{ managed_shared_memory shm(create_only, "myshm", 10000); //Create allocators VoidAllocator voidallocator(shm.get_segment_manager()); ClassWithListAllocator classwithlistallocator(shm.get_segment_manager()); //Create a vector of strings in shared memory. ClassWithListVector *pVector = shm.construct<ClassWithListVector>("classwithlistvector")(classwithlistalloc ator); ClassWithList classwithlist(voidallocator); pVector->push_back(classwithlist); // exception thrown here -> bad_alloc (segment_manager.hpp, line 132) /* here's the faulting function: multiallocation_iterator allocate_many(std::size_t elem_bytes, std::size_t num_elements) { multiallocation_iterator ret = MemoryAlgorithm::allocate_many(elem_bytes, num_elements); if(!ret) throw bad_alloc(); // <--- this throws, num_elements is 0, // elem_bytes is 12, // ret is NULL'ish (ret.next_alloc_.next_ is 1, type is offset_ptr<void>) return ret; } */ shm.destroy_ptr(pVector); } catch(...){ shared_memory_object::remove("myshm"); throw; } shared_memory_object::remove("myshm"); return 0; } Stacktrace: kernel32.dll!_RaiseException@16() + 0x52 bytes msvcr80d.dll!_CxxThrowException(void * pExceptionObject=0x0013e078, const _s__ThrowInfo * pThrowInfo=0x00450394) Line 161 C++ > BoostTest.exe!boost::interprocess::segment_manager_base<boost::interprocess: :rbtree_best_fit<boost::interprocess::mutex_family,boost::interprocess::offs et_ptr<void>,0> >::allocate_many(unsigned int elem_bytes=0x0000000c, unsigned int num_elements=0x00000000) Line 130 C++ BoostTest.exe!?allocate_many@?$allocator@U?$list_node@UListElem@?1?main@V?$o ffset_ptr@X@interprocess@boost@@@detail@interprocess@boost@@V?$segment_manag er@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V?$offset_ptr@X@23@ $0A@@interprocess@boost@@Viset_index@23@@34@@interprocess@boost@@QAE?AV?$tra nsform_iterator@V?$basic_multiallocation_iterator@V?$offset_ptr@X@interproce ss@boost@@@detail@interprocess@boost@@U?$cast_functor@U?$list_node@UListElem @?1?main@V?$offset_ptr@X@interprocess@boost@@@detail@interprocess@boost@@@23 4@@23@II@Z(unsigned int elem_size=0x00000001, unsigned int num_elements=0x00000000) Line 195 + 0x30 bytes C++ BoostTest.exe!?allocate_individual@?$allocator@U?$list_node@UListElem@?1?mai n@V?$offset_ptr@X@interprocess@boost@@@detail@interprocess@boost@@V?$segment _manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V?$offset_ptr @X@23@$0A@@interprocess@boost@@Viset_index@23@@34@@interprocess@boost@@QAE?A V?$transform_iterator@V?$basic_multiallocation_iterator@V?$offset_ptr@X@inte rprocess@boost@@@detail@interprocess@boost@@U?$cast_functor@U?$list_node@ULi stElem@?1?main@V?$offset_ptr@X@interprocess@boost@@@detail@interprocess@boos t@@@234@@23@I@Z(unsigned int num_elements=0x00000000) Line 229 + 0x3f bytes C++ BoostTest.exe!??$allocate_many_and_construct@Vconst_iterator@?$list@UListEle m@?1?main@V?$allocator@UListElem@?1?main@V?$segment_manager@DV?$rbtree_best_ fit@Umutex_family@interprocess@boost@@V?$offset_ptr@X@23@$0A@@interprocess@b oost@@Viset_index@23@@interprocess@boost@@@interprocess@boost@@@interprocess @boost@@Vinsertion_functor@234@@?$node_alloc_holder@V?$allocator@UListElem@? 1?main@V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boo st@@V?$offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess @boost@@@interprocess@boost@@V?$list_impl@U?$listopt@U?$base_hook_traits@U?$ list_node@UListElem@?1?main@V?$offset_ptr@X@interprocess@boost@@@detail@inte rprocess@boost@@U?$list_node_traits@V?$offset_ptr@X@interprocess@boost@@@int rusive@4@$0A@Udefault_tag@64@$00@detail@intrusive@boost@@I$00@intrusive@boos t@@@intrusive@3@@detail@interprocess@boost@@QAE?AVconst_iterator@?$list@ULis tElem@?1?main@V?$allocator@UListElem@?1?main@V?$segment_manager@DV?$rbtree_b est_fit@Umutex_family@interprocess@boost@@V?$offs(boost::interprocess::?$lis t@UListElem@?1?main@V?$allocator@UListElem@?1?main@V?$segment_manager@DV?$rb tree_best_fit@Umutex_family@interprocess@boost@@V?$offset_ptr@X@23@$0A@@inte rprocess@boost@@Viset_index@23@@interprocess@boost@@@interprocess@boost@@::c onst_iterator beg={...}, int n=0x00000000, boost::interprocess::?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main @V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V? $offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boost @@@interprocess@boost@@::insertion_functor inserter={...}) Line 304 + 0x17 bytes C++ BoostTest.exe!??$priv_create_and_insert_nodes@Vconst_iterator@?$list@UListEl em@?1?main@V?$allocator@UListElem@?1?main@V?$segment_manager@DV?$rbtree_best _fit@Umutex_family@interprocess@boost@@V?$offset_ptr@X@23@$0A@@interprocess@ boost@@Viset_index@23@@interprocess@boost@@@interprocess@boost@@@interproces s@boost@@@?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main@V?$segment _manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V?$offset_ptr @X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boost@@@interpro cess@boost@@@interprocess@boost@@AAEXVconst_iterator@012@00U?$integral_const ant@I$01@detail@12@Uforward_iterator_tag@std@@@Z(boost::interprocess::?$list @UListElem@?1?main@V?$allocator@UListElem@?1?main@V?$segment_manager@DV?$rbt ree_best_fit@Umutex_family@interprocess@boost@@V?$offset_ptr@X@23@$0A@@inter process@boost@@Viset_index@23@@interprocess@boost@@@interprocess@boost@@::co nst_iterator pos={...}, boost::interprocess::?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main @V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V? $offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boost @@@interprocess@boost@@::const_iterator beg={...}, boost::interprocess::?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main @V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V? $offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boost @@@interprocess@boost@@::const_iterator end={...}, boost::interprocess::detail::integral_constant<unsigned int,2> __formal={...}, boost::interprocess::detail::integral_constant<unsigned int,2> __formal={...}) Line 1288 + 0x137 bytes C++ BoostTest.exe!??$priv_create_and_insert_nodes@Vconst_iterator@?$list@UListEl em@?1?main@V?$allocator@UListElem@?1?main@V?$segment_manager@DV?$rbtree_best _fit@Umutex_family@interprocess@boost@@V?$offset_ptr@X@23@$0A@@interprocess@ boost@@Viset_index@23@@interprocess@boost@@@interprocess@boost@@@interproces s@boost@@@?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main@V?$segment _manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V?$offset_ptr @X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boost@@@interpro cess@boost@@@interprocess@boost@@AAEXVconst_iterator@012@00@Z(boost::interpr ocess::?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main@V?$segment_ma nager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V?$offset_ptr@X@ 23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boost@@@interproces s@boost@@::const_iterator pos={...}, boost::interprocess::?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main @V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V? $offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boost @@@interprocess@boost@@::const_iterator beg={...}, boost::interprocess::?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main @V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V? $offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boost @@@interprocess@boost@@::const_iterator end={...}) Line 1246 C++ BoostTest.exe!??$priv_insert_dispatch@Vconst_iterator@?$list@UListElem@?1?ma in@V?$allocator@UListElem@?1?main@V?$segment_manager@DV?$rbtree_best_fit@Umu tex_family@interprocess@boost@@V?$offset_ptr@X@23@$0A@@interprocess@boost@@V iset_index@23@@interprocess@boost@@@interprocess@boost@@@interprocess@boost@ @@?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main@V?$segment_manager @DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V?$offset_ptr@X@23@$0 A@@interprocess@boost@@Viset_index@23@@interprocess@boost@@@interprocess@boo st@@@interprocess@boost@@AAEXVconst_iterator@012@00U?$bool_@$0A@@detail@12@@ Z(boost::interprocess::?$list@UListElem@?1?main@V?$allocator@UListElem@?1?ma in@V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@ V?$offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boo st@@@interprocess@boost@@::const_iterator p={...}, boost::interprocess::?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main @V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V? $offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boost @@@interprocess@boost@@::const_iterator first={...}, boost::interprocess::?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main @V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V? $offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boost @@@interprocess@boost@@::const_iterator last={...}, boost::interprocess::detail::bool_<0> __formal={...}) Line 1310 C++ BoostTest.exe!??$insert@Vconst_iterator@?$list@UListElem@?1?main@V?$allocato r@UListElem@?1?main@V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@int erprocess@boost@@V?$offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@ @interprocess@boost@@@interprocess@boost@@@interprocess@boost@@@?$list@UList Elem@?1?main@V?$allocator@UListElem@?1?main@V?$segment_manager@DV?$rbtree_be st_fit@Umutex_family@interprocess@boost@@V?$offset_ptr@X@23@$0A@@interproces s@boost@@Viset_index@23@@interprocess@boost@@@interprocess@boost@@@interproc ess@boost@@QAEXVconst_iterator@012@00@Z(boost::interprocess::?$list@UListEle m@?1?main@V?$allocator@UListElem@?1?main@V?$segment_manager@DV?$rbtree_best_ fit@Umutex_family@interprocess@boost@@V?$offset_ptr@X@23@$0A@@interprocess@b oost@@Viset_index@23@@interprocess@boost@@@interprocess@boost@@::const_itera tor p={...}, boost::interprocess::?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main @V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V? $offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boost @@@interprocess@boost@@::const_iterator first={...}, boost::interprocess::?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main @V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V? $offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boost @@@interprocess@boost@@::const_iterator last={...}) Line 795 C++ BoostTest.exe!??0?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main@V?$ segment_manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V?$off set_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boost@@@i nterprocess@boost@@@interprocess@boost@@QAE@ABV012@@Z(const boost::interprocess::?$list@UListElem@?1?main@V?$allocator@UListElem@?1?main @V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boost@@V? $offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess@boost @@@interprocess@boost@@ & x={...}) Line 364 + 0xcf bytes C++ BoostTest.exe!`main'::`3'::ClassWithList::ClassWithList(const main::__l3::ClassWithList & __that=) + 0x2f bytes C++ BoostTest.exe!??$_Construct@VClassWithList@?2?main@V1?2?main@@std@@YAXPAVCla ssWithList@?2??main@@9@ABV1?2??2@9@@Z(main::__l3::ClassWithList * _Ptr=0x003700a0, const main::__l3::ClassWithList & _Val=) Line 53 + 0x33 bytes C++ BoostTest.exe!??$_Uninit_copy@V?$constant_iterator@VClassWithList@?2?main@H@ interprocess@boost@@PAVClassWithList@?2?main@@std@@YAPAVClassWithList@?2??ma in@@9@V?$constant_iterator@VClassWithList@?2?main@H@interprocess@boost@@0PAV 1?2??2@9@U_Nonscalar_ptr_iterator_tag@0@U_Range_checked_iterator_tag@0@@Z(bo ost::interprocess::?$constant_iterator@VClassWithList@?2?main@H _First={...}, boost::interprocess::?$constant_iterator@VClassWithList@?2?main@H _Last={...}, main::__l3::ClassWithList * _Dest=0x003700a0, std::_Nonscalar_ptr_iterator_tag __formal={...}, std::_Nonscalar_ptr_iterator_tag __formal={...}) Line 55 + 0x1e bytes C++ BoostTest.exe!??$uninitialized_copy@V?$constant_iterator@VClassWithList@?2?m ain@H@interprocess@boost@@PAVClassWithList@?2?main@@std@@YAPAVClassWithList@ ?2??main@@9@V?$constant_iterator@VClassWithList@?2?main@H@interprocess@boost @@0PAV1?2??2@9@@Z(boost::interprocess::?$constant_iterator@VClassWithList@?2 ?main@H _First={...}, boost::interprocess::?$constant_iterator@VClassWithList@?2?main@H _Last={...}, main::__l3::ClassWithList * _Dest=0x003700a0) Line 102 + 0x85 bytes C++ BoostTest.exe!?uninitialized_copy_all_to@?$advanced_insert_aux_proxy@VClassW ithList@?2?main@V?$constant_iterator@VClassWithList@?2?main@H@interprocess@b oost@@PAV1?2?main@@detail@interprocess@boost@@UAEXPAVClassWithList@?2??main@ @9@@Z(main::__l3::ClassWithList * p=0x003700a0) Line 57 + 0xa3 bytes C++ BoostTest.exe!?priv_range_insert_new_allocation@?$vector@VClassWithList@?2?m ain@V?$allocator@VClassWithList@?2?main@V?$segment_manager@DV?$rbtree_best_f it@Umutex_family@interprocess@boost@@V?$offset_ptr@X@23@$0A@@interprocess@bo ost@@Viset_index@23@@interprocess@boost@@@interprocess@boost@@@interprocess@ boost@@AAEXPAVClassWithList@?2??main@@9@I0IAAU?$advanced_insert_aux_int@VCla ssWithList@?2?main@PAV1?2?main@@detail@23@@Z(main::__l3::ClassWithList * new_start=0x003700a0, unsigned int new_cap=0x00000001, main::__l3::ClassWithList * pos=0x00000000, unsigned int n=0x00000001, boost::interprocess::detail::?$advanced_insert_aux_int@VClassWithList@?2?mai n@PAV1?2?main@ & interf={...}) Line 1440 + 0x19 bytes C++ BoostTest.exe!?priv_range_insert@?$vector@VClassWithList@?2?main@V?$allocato r@VClassWithList@?2?main@V?$segment_manager@DV?$rbtree_best_fit@Umutex_famil y@interprocess@boost@@V?$offset_ptr@X@23@$0A@@interprocess@boost@@Viset_inde x@23@@interprocess@boost@@@interprocess@boost@@@interprocess@boost@@AAEXV?$o ffset_ptr@VClassWithList@?2?main@@23@IAAU?$advanced_insert_aux_int@VClassWit hList@?2?main@PAV1?2?main@@detail@23@@Z(boost::interprocess::?$offset_ptr@VC lassWithList@?2?main@ pos={...}, const unsigned int n=0x00000001, boost::interprocess::detail::?$advanced_insert_aux_int@VClassWithList@?2?mai n@PAV1?2?main@ & interf={...}) Line 1387 C++ BoostTest.exe!??$priv_range_insert@V?$constant_iterator@VClassWithList@?2?ma in@H@interprocess@boost@@@?$vector@VClassWithList@?2?main@V?$allocator@VClas sWithList@?2?main@V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@inter process@boost@@V?$offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@i nterprocess@boost@@@interprocess@boost@@@interprocess@boost@@AAEXV?$offset_p tr@VClassWithList@?2?main@@12@V?$constant_iterator@VClassWithList@?2?main@H@ 12@1Uforward_iterator_tag@std@@@Z(boost::interprocess::?$offset_ptr@VClassWi thList@?2?main@ pos={...}, boost::interprocess::?$constant_iterator@VClassWithList@?2?main@H first={...}, boost::interprocess::?$constant_iterator@VClassWithList@?2?main@H last={...}, std::forward_iterator_tag __formal={...}) Line 1319 C++ BoostTest.exe!??$priv_insert_dispatch@V?$constant_iterator@VClassWithList@?2 ?main@H@interprocess@boost@@@?$vector@VClassWithList@?2?main@V?$allocator@VC lassWithList@?2?main@V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@in terprocess@boost@@V?$offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23 @@interprocess@boost@@@interprocess@boost@@@interprocess@boost@@AAEXV?$vecto r_const_iterator@V?$offset_ptr@VClassWithList@?2?main@@interprocess@boost@@@ detail@12@V?$constant_iterator@VClassWithList@?2?main@H@12@1U?$bool_@$0A@@41 2@@Z(boost::interprocess::detail::?$vector_const_iterator@V?$offset_ptr@VCla ssWithList@?2?main@@interprocess@boost@@ pos={...}, boost::interprocess::?$constant_iterator@VClassWithList@?2?main@H first={...}, boost::interprocess::?$constant_iterator@VClassWithList@?2?main@H last={...}, boost::interprocess::detail::bool_<0> __formal={...}) Line 1925 C++ BoostTest.exe!??$insert@V?$constant_iterator@VClassWithList@?2?main@H@interp rocess@boost@@@?$vector@VClassWithList@?2?main@V?$allocator@VClassWithList@? 2?main@V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interprocess@boo st@@V?$offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@interprocess @boost@@@interprocess@boost@@@interprocess@boost@@QAEXV?$vector_const_iterat or@V?$offset_ptr@VClassWithList@?2?main@@interprocess@boost@@@detail@12@V?$c onstant_iterator@VClassWithList@?2?main@H@12@1@Z(boost::interprocess::detail ::?$vector_const_iterator@V?$offset_ptr@VClassWithList@?2?main@@interprocess @boost@@ pos={...}, boost::interprocess::?$constant_iterator@VClassWithList@?2?main@H first={...}, boost::interprocess::?$constant_iterator@VClassWithList@?2?main@H last={...}) Line 1149 C++ BoostTest.exe!?insert@?$vector@VClassWithList@?2?main@V?$allocator@VClassWit hList@?2?main@V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interproc ess@boost@@V?$offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@inter process@boost@@@interprocess@boost@@@interprocess@boost@@QAEXV?$vector_const _iterator@V?$offset_ptr@VClassWithList@?2?main@@interprocess@boost@@@detail@ 23@IABVClassWithList@?2??main@@9@@Z(boost::interprocess::detail::?$vector_co nst_iterator@V?$offset_ptr@VClassWithList@?2?main@@interprocess@boost@@ p={...}, unsigned int n=0x00000001, const main::__l3::ClassWithList & x=) Line 1159 + 0xc3 bytes C++ BoostTest.exe!?insert@?$vector@VClassWithList@?2?main@V?$allocator@VClassWit hList@?2?main@V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interproc ess@boost@@V?$offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@inter process@boost@@@interprocess@boost@@@interprocess@boost@@QAE?AV?$vector_iter ator@V?$offset_ptr@VClassWithList@?2?main@@interprocess@boost@@@detail@23@V? $vector_const_iterator@V?$offset_ptr@VClassWithList@?2?main@@interprocess@bo ost@@@523@ABVClassWithList@?2??main@@9@@Z(boost::interprocess::detail::?$vec tor_const_iterator@V?$offset_ptr@VClassWithList@?2?main@@interprocess@boost@ @ position={...}, const main::__l3::ClassWithList & x=) Line 1107 C++ BoostTest.exe!?push_back@?$vector@VClassWithList@?2?main@V?$allocator@VClass WithList@?2?main@V?$segment_manager@DV?$rbtree_best_fit@Umutex_family@interp rocess@boost@@V?$offset_ptr@X@23@$0A@@interprocess@boost@@Viset_index@23@@in terprocess@boost@@@interprocess@boost@@@interprocess@boost@@QAEXABVClassWith List@?2??main@@9@@Z(const main::__l3::ClassWithList & x=) Line 925 + 0x2d bytes C++ BoostTest.exe!main() Line 59 C++ BoostTest.exe!__tmainCRTStartup() Line 597 + 0x19 bytes C BoostTest.exe!mainCRTStartup() Line 414 C kernel32.dll!_BaseProcessStart@4() + 0x23 bytes

2 3

[MultiIndex]How to add B+ Tree index into multiIndex?
by fgmailbox 25 Nov '08

25 Nov '08

How to add B+ Tree index and T-Tree index into multiIndex. with this, multiindex will become a real memory db to support large scale data query. your can find B+ tree code in http://idlebox.net/2007/stx-btree/ and firebird database source code. 2008-11-25 fgmailbox

2 1

HELP: boost + VS6
by Andrew Wan 25 Nov '08

25 Nov '08

Is there anyone out there who still use VS6 + boost? Need help building the test libraries.

1 1

[lambda] Subscripting in lamda expressions.
by Robert Jones 25 Nov '08

25 Nov '08

Here's a little quick and dirty square matirx multiply I've written. Ok. I know this leaves a lot to be desired on the quality front, but I'm not in a position to rewrite the whole system here! The lambda function argument to accumulate is clearly not right, but how I write something that implements the intention here? Thanks, Rob. typedef int block[ BLOCK_SIZE ][ BLOCK_SIZE ]; void matrix_product( block & result, const block & l, const block & r ) { typedef boost :: counting_iterator< unsigned > Iter; using namespace boost :: lambda; for ( unsigned y = 0; y != BLOCK_SIZE; ++ y ) for ( unsigned x = 0; x != BLOCK_SIZE; ++ x ) result[ y ][ x ] = std :: accumulate( Iter( 0 ), Iter( BLOCK_SIZE ), 0, l[ y ][ _1 ] * r[ _1 ][ x ] ); }

2 1