- Boost-users - lists.preview.boost.org

multi-index container: a more general basic usage example 1
by Alexander Schuh 18 Sep '05

18 Sep '05

Hi, in Example 1 there is a structure: struct employee { int id; std::string name; int age; … }; Is it possible to create automatically A) container with id as an index B) a view with name as index C) a view with age as index ? For this example it is easy to create the containers and views by hand but I plan to use at least 10 structures with many dimensions. For some containers I also need hash_indices - so there is really a lot of similar code, which I don’t want to have. Also I want to provide iterators or one general (template) iterator for all dimensions. How would you write such a general iterator? There should be a function that takes for example “employee_name” or “employee_id” as a parameter to query the employee container. It would also be interesting to have a function that creates an iterator based only on the Information, for example, multi_index::container(1)_index(2). Is there a function that calculates the max. index number of a certain container? Thank you very much, Alex Schuh -- No virus found in this outgoing message. Checked by AVG Anti-Virus. Version: 7.0.344 / Virus Database: 267.11.1/104 - Release Date: 16.09.2005

2 1

[Graph] Help on custom VertexList
by Nicola Vitacolonna 18 Sep '05

18 Sep '05

Hi everybody, I want to use my custom container as a vertex list in a graph. I have followed the documentation, but I don't know exactly how I should overload the push() and erase() functions. The following example code, using boost::array, gives an error: "no matching function for call to 'container_category(boost::array<void*, 10ul>&)". Can someone help me? One more question: is it possible to get a reference to the vertex container, given an adjacency_list<...> object? Nicola #include <boost/graph/adjacency_list.hpp> #include <boost/array.hpp> struct arrayS { }; namespace boost { template <class ValueType> struct container_gen<arrayS, ValueType> { typedef array<ValueType, 10> type; }; } int main(int,char*[]) { typedef boost::adjacency_list<boost::vecS, arrayS, boost::bidirectionalS> Graph; Graph g(10); boost::add_vertex(g); boost::add_vertex(g); boost::add_edge(vertex(0, g), vertex(1, g), g); return 0; }

2 1

[MPL] vector_c which contains string literals
by Hossein Haeri 18 Sep '05

18 Sep '05

Dear MPL maniacs, AFAIK, there is no mpl::vetor_c which can hold string literals. Or is it? If not, isn't there any way to implement one? Any voluteers please? Thanks in Advance, --Hossein ___________________________________________________________ Yahoo! Messenger - NEW crystal clear PC to PC calling worldwide with voicemail http://uk.messenger.yahoo.com

2 2

Question about proper container/algorithm to use for fast dictionary lookup
by Elisha Berns 18 Sep '05

18 Sep '05

Hi, This question is whether Boost already has, or perhaps needs to have a container type that is specifically designed for fast word lookup in a UNICODE dictionary. It has occurred to me that an associative container that is specifically designed for word lookup may be much faster than the standard containers such as map, hash_map, associative_vector as they are general purpose containers. So the more detailed questions are: 1) What type of algorithm/container should be used here? 2) Would its performance be much better than a general purpose associative container? Thanks, Elisha Berns e.berns(a)computer.org tel. (310) 556 - 8332 fax (310) 556 - 2839

3 3

BGL - randomize_property & bundled properties
by Giulio Veronesi 17 Sep '05

17 Sep '05

Hi all, Is it possible to use the randomize_property routines with boundled properties? If so, could you please explain me how? For istance let us consider the following example: struct MyVertexAttr { int attr; }; typedef adjacency_list<vecS, vecS, bidirectionalS, MyvertexAttr, MyEdgeAttr> MyGraph; MyGraph g(...); Now I would like to randomly assign a number in [1,10] to the 'attr' property of each vertex. randomize_property<????????>(g, MyRandGenerator); What is the correct invocation of the randomize_property function? Thanks in advance, Giulio

1 0

regex and ICU
by louis 17 Sep '05

17 Sep '05

Hi, I am trying to build the regex library with ICU (MSVC 6.0). I get the following error: Z:\dev\3rd\boost_1_33_0\boost/regex/icu.hpp(42) : error C2039: 'Locale' : is not a member of '`global namespace'' Any help would be greatly appreciated. Thanks Louis

3 3

[Pre-processing] String Litereal Comparison for Equality
by Hossein Haeri 17 Sep '05

17 Sep '05

Dear all, Is there anyway (say using a utility in BOOST_PP) at pre-processing phase to compare string literals for equality? TIA, --Hossein ___________________________________________________________ Yahoo! Messenger - NEW crystal clear PC to PC calling worldwide with voicemail http://uk.messenger.yahoo.com

2 2

Build errors and crash with 1.33.0 under Mac OS X CodeWarrior
by Allen Cronce 17 Sep '05

17 Sep '05

Hi all, I just updated from boost 1.32.0 to 1.33.0 for a CodeWarrior MSL/carbon project under Mac OS X. There were several build errors stemming from the fact that "check" is already defined in /usr/include/AssertMacros.h. For now I dealt with this my modifying my copy of the boost libraries to substitute _check for check. This is of course an ugly solution, but I wanted to move forward. Unfortunately now I'm seeing crashes with code that worked fine with 1.32.0. Here's some test code that demonstrates the crash: _tprintf(_T("\nTest a vector of boost shared_ptr's:\n")); typedef boost::shared_ptr<std::string> SharedPtrString; typedef vector<SharedPtrString> StringContainer; typedef vector<SharedPtrString>::iterator StringContainerIterator; { SharedPtrString sharedPtrString1(new std::string("Hi there!")); SharedPtrString sharedPtrString2(new std::string("Hi there!")); _tprintf( _T(" sharedPtrString1->c_str() = \"%s\"\n"), sharedPtrString1->c_str() ); _tprintf( _T(" sharedPtrString2->c_str() = \"%s\"\n"), sharedPtrString2->c_str() ); } // We never get here because of an access error Basically when the SharedPtrString goes out of scope, I get an access error deep in the allocation code. Does anyone have suggestions for resolving these issues? Note that I could go back to 1.32.0, but I want to use the new Pointer Container Library. Best regards, -- Allen Cronce

3 6

[iostream]: Simple sinks result in runtime error
by Marius Renn 17 Sep '05

17 Sep '05

Hi all, This is my first post, so please let me know if I am doing anything wrong. I am having trouble using the new iostream headers in Boost 3.3. I cannot get simple Sinks to function correctly. Take the following code for example: namespace bio = boost::iostreams; int main() { typedef bio::stream<bio::null_sink> nullsink; nullsink out; out << "Ignore me"; } This code always results in a runtime assertion failure: /usr/local/include/boost/iostreams/detail/optional.hpp:54: failed assertion `initialized_' What am I doing wrong? Any help would be greatly appreciated. Cheers, Marius

2 1

compiling boost.signals without exception
by Martin Sarrazac 17 Sep '05

17 Sep '05

Hi, compiler: mingw gcc 3.4.4 I would like to compile boost.signals without exception handling, I read somewhere about the <exception-handling> feature so I tried: bjam --builddir=c:\temp -sTOOLS=mingw "-sBUILD=debug <exception-handling>off <runtime-link>dynamic <threading>single" --libdir=C:\boost\lib\noe --with-signals -d2 install without success, it compiles fine but not without exception handling. specifically the -fno-exception command line option should be passed to gcc and it's not. I had a look at tools/build/v1/gcc-tools.jam and I found this line for rtti support for instance: flags gcc C++FLAGS <rtti>off : -fno-rtti ; However there is nothing equivalent for exceptions... On a side note I don't know how to give a new tag to the 'no exception' version of the library, so I compiled it in an other directory (--libdir=C:\boost\lib\noe). However I would much prefer to give it a specific name. Is there somewhere information about all the -sBUILD flags can be found? Can't seem to locate it. Thanks for your help

2 1