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

How to use Iterator Adaptors?
by keithmac66 11 Jun '02

11 Jun '02

Hi, I'm struggling to understand how to use Iterator Adaptors, due to a lack of simple examples. This is disappointing, given that supposedly "Using iterator_adaptor, you can easily implement an iterator class" (www.boost.org/libs/utility/iterator_adaptors.htm) Can anyone help, by explaining how to implement a random access iterator for a custom collection class? e.g.: template <class T> class DumbCollection { public: DumbCollection(T data[10]) { for (int i = 0; i < 10; i++) m_data[i] = data[i]; } iterator begin(); iterator end(); private: T m_data[10]; }; Thanks, Keith

7 15

how to compile the boost/regex without comand line
by Aza Lsaja 11 Jun '02

11 Jun '02

Hi, I'm new on this list as well as on C++ world. I try to install boost library but failed. This is what I did: [Win98, MSVC 6.0 without service pack] 1. Download and extract the zip file to root directory. I have C:\boost_1_27_0 now. (success) 2. Download Boost.Build for windows from sourceforge, unpack and installing, reboot (success) 3. go to c:\boost_1_27_0 directory, then execute this in command prompt: jam -sBOOST_ROOT=. -sTOOLS="msvc" (fail) the dos prompt yield many lines but I cant read it. It's too fast. I think it's error messages. Or maybe I missing some procedure? please let me know. I guess my compiler is broken and I need MSVC service pack. But, I can't download it at this time. Acctually, I just want to use the boost's regex library. Can I compile the regex manually (by the IDE) so I can use it with include ( #include <boost/regex.hpp> ) in my codes? If yes, how? Sorry for my english, I hope you understand me. Thanks. Aza ------------------- Kemudahan Hosting PlasaCom ---------------------------------- Hosting menjadi lebih mudah dan murah dengan keringanan 50% biaya registrasi mail hosting dan webhosting selama bulan Juni 2002. Klik http://idc.plasa.com untuk pendaftaran ---------------------------------------------------------------------------------

3 2

[BGL] How can my visitors visit?
by �ڱ�� 11 Jun '02

11 Jun '02

Compiling below, It's OK. but executing, visitors do nothing. What's the problem? Is this slicing problem? why? thank you in advance. ---------------------- below ------------------------ // bfs visitor 1. just printing every vertex in breath first order. struct graph_printer1 : public default_bfs_visitor { template<typename Vertex, typename Graph> void discover_vertex(Vertex u, Graph& g) { cout << " graph printer 1" << u <<"\n"; } }; // bfs visitor 2. same as visitor 1 except message. struct graph_printer2 : public default_bfs_visitor { template<typename Vertex, typename Graph> void discover_vertex(Vertex u, Graph& g) { cout << " graph printer 2" << u <<"\n"; } }; // graph wrapper class graph_wrapper { protected: adjacency_list<vecS, vecS, bidirectionalS, VertexProperty, EdgeProperty> m_graph; public: // HERE. this Visit function does nothing.!! void Visit(default_bfs_visitor* vis, int vertexID ) { breadth_first_search(m_graph, vertex(vertexID, m_graph), visitor(*vis)); } }; int main() { graph_wrapper holder; graph_printer1 vis1; graph_printer2 vis2; holder.Visit(&vis1); holder.Visit(&vis2); return 0; } ---------------------------------------- Ki-Soo, Park e-mail: park(a)erhouse.co.kr wfms123(a)hotmail.com

1 0

Hi!
by rajanik3 11 Jun '02

11 Jun '02

Hi! Could some body tell me how to use boost libraries in Unix. I am using tcsh shell. After downloading, what should I change in order for the compiler to locate the boost library headers. Thanks, Raj.

1 0

thread::join() usage
by rgalek2002 10 Jun '02

10 Jun '02

Hi, I have an application which starts a number of threads, and I want the application to wait for the threads to finish before exiting. Standard stuff, I know, but never having used threads before I am wondering what the stadard way is to accomplish this. I have (psuedo code) for (each record in database) { thread thrd(func(), data); } I could imagine storing all my thread objects in a list, and then calling join() on each one. For example something like list <thread> threads; for (each rec in db) { thread thrd(func(), data); threads.insert(threads.begin(),thrd); } list<thread>::iterator i; for (i=threads.begin(); i!=threads.end(); i++) { thread t = *i; t.join(); } Does this seem reasonable? Is there a better/standard way? One thing I don't like here is that each join will block, when what I would like to do is something more like join_all(); Thanks, Rich

2 1

Intel-win32 Build Problem
by thorneg 09 Jun '02

09 Jun '02

I'm getting errors in xtime.cpp relating to uint64_t when building with the Intel-win32 v6.0 compiler. The errors are: xtime.cpp libs\thread\build\../src\xtime.cpp(80): error: namespace "boost" has no member "uint64_t" const boost::uint64_t TIMESPEC_TO_FILETIME_OFFSET = ((boost::uint64_t)27111902UL << 32) + (boost::uint64_t)3577643008UL; Has anyone else run into this? Any help is appreciated. Glenn

1 0

Dynamic Bitset Formal Review June 8-17
by Mat Marcus 08 Jun '02

08 Jun '02

The formal review of Dynamic Bitset by Chuck Alison and Jeremy Siek will commence today Saturday June 8th and run through Monday, June 17th. The library is currently available at <http://groups.yahoo.com/group/boost/files/dyn_bitset.tar.gz> Below is an excerpt from the library's documentation: The dyn_bitset class represents a set of bits. It provides accesses to the value of individual bits via an operator[] and provides all of the bitwise operators that one can apply to builtin integers, such as operator&& and operator<<. The number of bits in the set is specified at runtime via a parameter to the constructor of the dyn_bitset. Each bit represents either the Boolean value true (set) or false (reset). To toggle a bit is to change the value to true if it is false and to false if it is true. Each bit has a non-negative position pos. The position pos == 0 corresponds to the least significant bit and pos == size() - 1 is the most significant bit. When converting an instance of dyn_bitset to or from an unsigned long, the bit position pos corresponds to the bit value 1 << pos. The dyn_bitset class is nearly identical to the std::bitset class. The difference is that the size of the dyn_bitset (the number of bits) is specified at run-time during the construction of a dyn_bitset object, whereas the size of a std::bitset is specified at compile-time through an integer template parameter. For information about submitting a Formal Review, see http://www.boost.org/more/formal_review_process.htm Please try out the library and comment during the review period. Be sure to say whether or not you think the library should be accepted by Boost. Compiler notes: This library has been tested using the following compiler platforms: Gcc 2.95 and 3.01 Kai C++ Metrowerks Codewarrior 8 (beta, Mac) Visual C++ 7.0 Comeau The library presently requires template friend support and is known not to compile with CodeWarrior 7.2 or Visual C++ 6.0. The library has not been tested with Borland. The Formal Review manager is Mat Marcus.

1 0

MacOS.hpp and PowerPlant incompatibility
by Bobby Thomale 08 Jun '02

08 Jun '02

I am trying to use the boost libraries with a PowerPlant project on the MacOS, and I ran into a small incompatibility between the headers. I am not sure which codebase is at fault here. The issue is with the __MACH__ symbol. In the Boost code where it is checking for what platform I am using, it correctly identifies my platform as MacOS. Then, in a file called MacOS.hpp, it uses the __MACH__ symbol to determine if I am using the BSD standard C libraries or MSL. (I am using MSL.) It does this by checking for the EXISTANCE of the __MACH__ symbol, not the value of it: // If __MACH__, we're using the BSD standard C library, not the MSL: #if defined(__MACH__) However, in the PowerPlant header PP_Macros.h, the __MACH__ symbol is defined and set to zero: #ifndef __dest_os // For MSL #ifndef __MACH__ #define __MACH__ 0 #endif #if __MACH__ #include <ansi_prefix.mach.h> #else #define __dest_os __mac_os #endif #endif I was able to work around the problem for now by making the Boost libraries check for both the existance of __MACH__ and the value: #if defined(__MACH__) && __MACH__ Seems to work. However, I am curious. Which way is the right way? Is the __MACH__ symbol's existance or its value supposed to signal whether or not it is "turned on"? The boost headers seem to think it is its existance, but the PowerPlant headers seem to think it is its value. I want to report the problem, but I am not sure whose code needs to change, PowerPlant or Boost. Ideas? -- Bobby --------------------------------------------------------------------- Bobby Thomale Senior Software Developer Inoveon Corporation http://www.inoveon.com/ ---------------------------------------------------------------------

4 5

[BGL] How can I use vertex object rather than integer?
by �ڱ�� 07 Jun '02

07 Jun '02

for example, class Node { public: int m_id; }; class Edge { public: int from_node_id; int to_node_id; }; How can I use this class to make graph? many examples show only integer id graph.. thanks in advance ---------------------------------------- Ki-Soo, Park HP: 82-11-9040-4957 e-mail: park(a)erhouse.co.kr wfms123(a)hotmail.com

4 3

[BGL] how to use visitor with functor?
by �ڱ�� 06 Jun '02

06 Jun '02

Can I use visitor with functor ? In BGL example on visitor, int main() { : boost::breadth_first_search (G, vertex(0, G), visitor(make_bfs_visitor( std::make_pair(print_edge("tree", on_tree_edge()), print_edge("cycle", on_non_tree_edge()))))); : } I want to do like this boost::breadth_first_search (G, vertex(0, G), visitor(make_bfs_visitor( std::make_pair(print_edge("tree", on_tree_edge(), MyFunctor1() ), print_edge("cycle", on_non_tree_edge(), MyFunction2() ))))); can i do this? how? why? thanks in advance.. ps. ths is my first posting. ---------------------------------------- Ki-Soo, Park e-mail: park(a)erhouse.co.kr wfms123(a)hotmail.com

2 1