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

Boost work-in-progress list?
by Eric Ocean 27 Oct '04

27 Oct '04

Is there a comprehensive list available on up-and-coming-but-not-yet-a-part-of-Boost libraries? The ones I'm currently aware of are very interesting, and I'd like to evaluate any others. Regards, Eric Ocean

2 1

About property maps and the Boost Graph module
by Ken Yasumoto-Nicolson 26 Oct '04

26 Oct '04

Hi folks, I've searched the archives and boost.org trying to find some help, but I still can't get my head around how the property maps are supposed to work. I'm pretty new to Boost, so I'm maybe not too familiar with the underlying concepts, etc, so forgive me if my question seems a little too basic! My problem is this: Given a directed graph with a single start and end point, I want for each node (vertex) to build a list of all the other nodes that can be reached from the current node. The algorithm is simple, I think: do a depth_first_search() and implement my code on dfs_visitor::finish_vector(). This skeleton I have done. However, the bit I can't get my head around is how to use property maps to collect the info. The key parts of my best effort so far are: struct statement_list_t { typedef boost::vertex_property_tag kind; }; typedef boost::property< statement_list_t, std::set<size_t> > StatementListProperty; typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, StatementListProperty, boost::no_property > ADJ_GRAPH; struct connection_detector : public boost::dfs_visitor<> { public: connection_detector() {} template <class Vertex, class Graph> void finish_vertex(Vertex u, const Graph& g) { /* for each child in out_edges( u, g ) current node set = union_of( current, child ) */ } } However, my questions are: 1. std::set<size_t> - is the size_t the best type to store a reference to a vector in? 2. In finish_vertex<> (or other places) how do I address the StatementListProperty value for a given vertex? 3. How would I use an Exterior Property Map instead? Thanks for any advice! Ken

4 3

shared_ptr and shared_from_this
by Timothy Ritchey 26 Oct '04

26 Oct '04

I have an interpreter that uses a visitor pattern while performing a reduction of the program tree. As part of the visitor pattern, each class that can be a node in the tree must respond to: virtual void accept(Visitor& v); where each node then implements by calling visitor with itself using the proper type. The function calls in visitor are like: void visit(shared_ptr<Node> node); void visit(shared_ptr<Type> node); etc. (where Type is a descendant of node BTW). Normally with the visitor pattern (GOF style in this case), the implementation of accept is simply: void Node::accept(Visitor &v) { v.visit(this); } I've tried adding enable_shared_from_this<...> as a superclass of my nodes, and returning shared_from_this(), which works in some cases, but in others just seems to hang. These occur in classes that are a little more complex. For example, I have a TypeTemplate<T> class that wraps to underlying types TypeTemplate<int>, TypeTemplate<float>, TypeTemplate<etc>. I've tried adding enable_shared_from_this<TypeTemplate<T> >, and then having an implmentation void TypeTemplate<T>::accept(Visitor &v) { v.visit(enable_shared_from_this<TypeTemplate<T> >::shared_from_this()); } but it just hangs on both vc7.1 on windows and Xcode on OS X. (I had to add the extra scoping because I got complaints that "shared_from_this() was ambiguous in multiple inheritance.") I read in some past postings that the shared_from_this template doesn't work so well for complex class hierarchies, and I am wondering if I am running into that. I was thinking of putting my own internal_weak_ptr into the classes, but was confused by some of the examples I have seen. Most of them seem to reference a static function create() which instantiates the weak_ptr, and returns a shared_ptr<X>. When I consider my situation: shared_ptr<Node> aNode(new Node(...)); Visitor v; aNode->accept(v); How does the accept implementation return a shared_ptr that is linked with aNode? I've looked through the enable_shared_from_this implementation, and can't figure out how it is supposed to work. even if I return shared_from_this(), I'm not sure now that is linked to aNode. Does everything have to go through a factory like create()? Sorry for the long rambling e-mail. I hope it makes sense what I am trying to do. Cheers, tim

2 2

"nested" spirit grammars and semantic actions
by Tim Robertson 26 Oct '04

26 Oct '04

Hi, I'm looking for advice on ways to "nest" spirit grammars that use semantic actions. In the past, I have written a spirit grammar that parses 2-dimensional array data from a file, and puts the data into an array object of my choosing. To do this, the grammar defines a new functor (array_insert) and calls the functor whenever a new array element is parsed. The functor puts the element into a reference to the destination object, held within the grammar: struct array_grammar { array_grammar(MyMatrix & m) : _inserter(m) {} struct array_inserter { array_inserter(MyMatrix & m) : _m(m) {} // operator() defined here... MyMatrix & _m; } // ...the usual grammar components... array_inserter _inserter; }; This works, as expected. However, I now have to write a parser for a file containing a collection of 2D arrays, where each array is delimited by tags (say, "BEGIN" and "END"). I would like to push each array into a std::vector of MyMatrix objects. Thus, it would be nice if I could re-use the array_grammar, and write a grammar which uses it to parse each array in the larger file: struct multi_array_grammar { multi_array_grammar(std::vector<MyMatrix> & v) : _inserter(v) {} struct array_inserter { array_inserter(std::vector<MyMatrix> & v) : _v(v) {} // ... operator(), etc. std::vector<MyMatrix> & _v; }; template <typename ScannerT> struct definition { definition(multi_array_grammar const & self) { array_begin = str_p("BEGIN"); array_end = str_p("END"); // Problem: how to create array_grammar with correct reference? array_grammar array(???); r = array_begin >> +array >> array_end; } }; array_inserter _inserter; }; The problem is that I can't figure out how to instantiate an array_grammar (which requires a reference to the current MyMatrix object) in order to parse the individual arrays. I have solved this problem by creating a functor in multi_array_grammar which calls the parse function for array_grammar directly, but this seems ugly to me. Do any of you have a better way? -Tim

2 1

[FSM] Saving/Restoring the state_machine
by spooky＠go.ro 25 Oct '04

25 Oct '04

Is it possible to save the current state of the state machine to a stream or by means of boost::serialize? Details: I am building a state machine using boost::fsm that is trying to follow the activity of items in a processing pipeline. I am trying to implement a procedure that allows the software to be turned off and on again without loosing the information about the current state. Naturally, I want to have a timer and, at some interval I checkpoint the state machine and save the binary representation to a file. The contents of the file are used during application startup to restore the state machine. Can I achieve this functionality with boost::fsm? Best regards, Emil Mieilica

2 1

tcp/ip software
by Greg Silverman 25 Oct '04

25 Oct '04

Since Boost does not have a library for TCP/IP, I was wondering what OO interface to sockets is most popular with Boost users? Greg Silverman Northrop Grumman Sunnyvale, CA

3 2

Boost under QNX 6.2.1
by Ghorashi, Ali 25 Oct '04

25 Oct '04

Dave, I'm also trying to compile boost_1_31_0 under qnx. Could you post the QNX libraries you mentioned? Ali Ghorashi (719) 277-5506 Hardware Engineering Lockheed Martin Mission Systems 9970 Federal Dr M/S 01P, Colorado Springs CO, 80920

1 0

RE: [Boost-users] About properties
by Townsend, Matthew 25 Oct '04

25 Oct '04

>... > >I guess the functionality he wants is like the property keyword in VC++. >Unfortunately this is a Microsoft only extension. This is acutally stolen by Microsoft from Borland Delphi's Object Pascal. I really liked the feature and wished C++ had a solution. I haven't spent any time thinking about adding it, or how to. >Any ideas? Suggestions? > >Thanks > >-delfin -matt _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

4 3

RE: [Boost-users] Re: Bjam and cygwin
by Foster, Gareth 25 Oct '04

25 Oct '04

Hmm, could well be, I just downloaded a binary of bjam rather than building it, so I bet the default download is a windows build. I did get the install to work like this, however, my project doesn't find the boost includes, even though I installed to /usr/local, shouldn't they be picked up there? What autotools magic do I need if that isn't the case? Thanks Gaz -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of David Abrahams Sent: 24 October 2004 07:00 To: boost-users(a)lists.boost.org Subject: [Boost-users] Re: Bjam and cygwin "Foster, Gareth" <gareth.foster(a)siemens.com> writes: > Just for other peoples information (these mails show up in an searchable > online archive somewhere afterall afaik), I fixed this problem by setting > the path 'in a windows' way, rather than a unix way, even though I was > building from the cygwin shell. That means ... > > bjam "-sTOOLS=GCC" "--target=/usr/local" install > > Becomes ... > > bjam "-sTOOLS=GCC" "--target=c:\cygwin\usr\local" install > > That's from memory, so excuse any slight inacuracies in the syntax there. It > does get rid of the <directory-guist> weirdness. > > Hope this helps somebody somewhere. > > Regards That's surely because you're using a bjam that was built for windows, not for Cygwin. If you rebuild bjam under Cygwin I think you'll see that Cygwin paths work. -- Dave Abrahams Boost Consulting http://www.boost-consulting.com _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

RE: [Boost-users] Bjam and cygwin
by Foster, Gareth 24 Oct '04

24 Oct '04

Just for other peoples information (these mails show up in an searchable online archive somewhere afterall afaik), I fixed this problem by setting the path 'in a windows' way, rather than a unix way, even though I was building from the cygwin shell. That means ... bjam "-sTOOLS=GCC" "--target=/usr/local" install Becomes ... bjam "-sTOOLS=GCC" "--target=c:\cygwin\usr\local" install That's from memory, so excuse any slight inacuracies in the syntax there. It does get rid of the <directory-guist> weirdness. Hope this helps somebody somewhere. Regards Gaz -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Foster, Gareth Sent: 18 October 2004 11:37 To: 'boost-users(a)lists.boost.org' Subject: [Boost-users] Bjam and cygwin Hello all, I keep getting the following errors using bjam ... "<directory-grist>" I have set the install to use GCC and install to /usr. I also tried with /usr/local. I read that it might be a windows/unix line break thing, but I tried the zip file, bz2 and normal tarball, extracting with the windows gui tools and the cygwin cli tools. What am I doing wrong? Thanks for any help. Gaz -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Joel Sent: 15 October 2004 00:55 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Spirit Foster, Gareth wrote: > Hello all, > > I am trying to find some source code that uses spirit to parse C++ and > convert it to HTML, i found some on google, but i misplaced it and i > can't find it again. It looked like it could have been an example > provided with the library, but i can't see it listed in the documentation. > > On a side note, anyone know the best way to use boost with cygwin? From > source? Is there even another way? See the repository: http://spirit.sourceforge.net/repository/applications/show_contents.php Cheers, -- Joel de Guzman http://www.boost-consulting.com http://spirit.sf.net _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

help with boost thread compile
by Sara Collins 23 Oct '04

23 Oct '04

This might be very easy for a lot of you but I've been banging my head on the wall. I just installed the boost library and tried to run a simple test file using boost.thread.mutex #include <boost/thread/mutex.hpp> int main() { boost::mutex m; } I got this compilation error message: undefined reference to `boost::mutex::mutex[in-charge]()' I guess I have to link in the libboost_thread.dll file somehow but I don't seem to find a solution how. Perharps I've been searching the wrong places. Please help the newbie. Thanks a lot in advance. _______________________________ Do you Yahoo!? Declare Yourself - Register online to vote today! http://vote.yahoo.com

3 3

shared_ptr race condition
by Sharon Paisner 22 Oct '04

22 Oct '04

I'm having a problem wherein the block of code below hangs at line 16. A race condition is being created with the shared_ptrs. The Call class contains an std::map of DialogPtrs (where a DialogPtr is just a boost::shared_ptr< Dialog >) - is it legal to use a boost::shared_ptr to wrap a class that contains a dynamically allocated container like a map? note: the createDialog() method is write-locked, so that the map cannot be accessed by more than one thread at a time. 1 int main( int argc, char *argv[] ) 2 { 3 AAFramework aa; 4 CallPtr call( new Call( aa ) ); 5 6 UriPtr callee( new Uri( "sip:name@domain" ) ); 7 call->setInitialCallee( callee ); 8 9 assert( call->getInitialCallee() == callee ); 10 11 TagPtr tag( new Tag() ); 12 CallIdPtr callId( new CallId() ); 13 UriPtr contact( new Uri( "sip:contact@domain" ) ); 14 UriPtr uriComplete( new Uri( "sip:complete@domain" ) ); 15 16 DialogPtr newDialog = call->createDialog( DT_CALLEE, tag, callId, contact, uriComplete ); 17 assert( call->getDialog( DT_CALLEE ) == newDialog ); 18 19 return EXIT_SUCCESS; 20 } one of the strangest aspects of this problem is that it occurs on some machines, but not others, and I have yet to determine the difference between the systems on which it works and the systems on which it doesn't work. Boost's use of so much inline code makes it very difficult to debug the program. in case it helps any, I'm using boost-1.31 and gcc-3.4.2. thanks, Sharon

2 1

[sandbox/socket]1.32/vc7.1: Who's in charge???
by Francis ANDRE 22 Oct '04

22 Oct '04

Hi I am trying to get the boost-sandbox/socket running but it seems that this socket library is out of sync, at least for vc7.1. Who is in charge of this library since Hugo DUNCAN has moved its code base out of the boost foundry?? Cheers Francis

5 13

boost::serialization problems
by Andrzej Cieslar 22 Oct '04

22 Oct '04

Hello, I'm having some problems trying to use the boost::serialization library. Here's why: I have a class hierarchy (~80 classes). I was trying to add the serialization abilities to the entire hierarchy (intrusive template-based version). Because I need to serialize things through pointers to base classes, I do the register_type on each class. But the compilation fails on MSVC 7.1 with "internal structure overflow" and "out of keys" errors. So I googled a little bit and found out that this is a known issue with MSVC and that the workaround is to split the .cpp file into smaller parts. So I did. But now the linker fails due to excessive .lib file size (I had to put the register_type function for each class in separate .cpp file) Ok so I switched to the polymorphic archives. It compiles fine, but fails at runtime when saving a null pointer. Here's a short example: --- #include <fstream> #include <boost/archive/polymorphic_text_oarchive.hpp> struct A { void serialize( boost::archive::polymorphic_oarchive & ar, const unsigned int version) {} }; int main(int argc, char* argv[]) { std::ofstream ofs("serialized.txt"); boost::archive::polymorphic_text_oarchive oa(ofs); A* a = 0; oa << a; } --- The failure is because of trying to dynamic_cast from interface_oarchive& to basic_oarchive&, which I believe are not related: oserializer.hpp, l.422: if(NULL == t){ basic_oarchive & boa = boost::smart_cast_reference<basic_oarchive &>(ar); Are these known issues or am I missing something? I'd be grateful for your help All best, Andrzej Cieslar ---------------------------------------------------- Pistolety wiatrówki bez zezwolenia w Militaria.pl Teraz do 30% taniej! http://klik.wp.pl/?adr=http%3A%2F%2Fadv.reklama.wp.pl%2Fas%2Fsklep1.html&si…

1 0

Newbie Question regarding \algorithm\string
by Ghorashi, Ali 22 Oct '04

22 Oct '04

Hello All, Just a quick question: Why isn't the \algorithm\string library not included in the standard boost download bundle? Thanks, A.G.

3 2

Using template in property types
by Stephen torri 22 Oct '04

22 Oct '04

I have a need to store an instance of a template class in each vertex of a adjacency_list. I was wondering if my idea below will do: template <class House_Type, class Number_Type> class Home { public: uint32_t id; House_Type type; Number_Type digits; }; The following classes are specific instances of the Home class: class Ranch_Home : public Home <std::string, uint8_t> {} class Tudor_Home : public Home <std::string, float> {} I was thinking that the property to store this would have to be something allows for either Home type to be stored at a vertex. struct house_obj{}; typedef property < house_obj, boost::shared_ptr< Home< House_Type_Base, Digit_Type_Base> > > VertexProperty; In this case the House_Type_Base and Digit_Type_Base what I am not sure about here. I want to use a Factory to create the appropriate Home based on a string I read from the file as was seen above. For example, for each line of the file I plan on using a boost spirit parser to parse the file since I need all three elements before calling the factory. 1 "Ranch" 20 2 "Tudor" 20509.0 So how can I use the property when the template arguments are objects that have no common base class between them? Stephen -- Email: storri(a)torri.org

1 0

Swap allocator problem in multi_array.hpp
by Ewan Campbell 20 Oct '04

20 Oct '04

When resizing a multi-dimensional array I receive the warning: d:\microsoft visual studio\vc98\include\xutility(100) : warning C4101: '_Tmp' : unreferenced local variable d:\boost\include\boost-1_31\boost\multi_array.hpp(246) : see reference to function template instantiation 'void __cdecl std::swap(class std::allocator<double> &,class std::allocator<double> &)' being compiled An unreference local variable is not exactly the end of the world, but it is churned out every time a file is compiled that include this function and I'd rather not disable this warning. I can find no mention of anyone else having this problem for such a widely used function (dynamically resizing arrays). The specific line that appears to be causing the problem is: swap(this->allocator_,new_array.allocator_); in "multi_array.hpp" I am resizing the array like so header file: typedef boost::multi_array<double, 2> array2d_type; typedef array2d_type::index index; Class CArrayConfiguration{ ... protected: ... array2d_type m_pReceiveArray; ... }; implementation file: m_pReceiveArray.resize(boost::extents[M][5]); // where M = 10 -> 1000 and it is this line that prompts the warning. I am using MSVC++ 6.0 on WinXP. If I initalising the array to shape and then resize it there is no problem, but I require it to be a class member variable. Thanks in advance, ec

4 6

Constructing vertex_iterator from vertex_descriptor
by Martin Magnusson 20 Oct '04

20 Oct '04

I'm using BGL, and I noticed that add_vertex returns a vertex_descriptor to the new vertex. However, I would like to have a vertex_iterator pointing to the same element. Is there a way to construct a vertex_iterator when given a vertex_descriptor? / martin

3 2

compiling bgl
by Emre Turkay 19 Oct '04

19 Oct '04

Hi all, I've compiled boost on windows with vc71. However, I don't see a generated binary file for the boost graph library, though it was generating in linux. Do I need to do some manual tricks? Thanks, Emre Turkay

2 1

[BGL]DIJKSTRA - ospf-example
by Khaled Saleh 18 Oct '04

18 Oct '04

I'm trying to grasp the BGL using the user guide and reference manual book by J.Seik et al. Trying the ospf-example (\boost_1_31_0\libs\graph\example) using Borland C++ 5.6.4 for Win32 raise the follwing error: "dijkstra_shortest_paths.hpp": E2285 Could not find a match for 'dijkstra_shortest_paths<VertexListGraph,Param,Tag,Rest>(const adjacency_list<vecS,vecS,directedS,no_property,property<edge_weight_t,int,no _property>,no_property,listS>,unsigned int,unsigned int * const,iterator_property_map<int *,vec_adj_list_vertex_id_map<no_property,unsigned int>,int,int &>,adj_list_edge_property_map<directed_tag,int,const int &,unsigned int,const property<edge_weight_t,int,no_property>,edge_weight_t>,vec_adj_list_vertex_i d_map<no_property,unsigned int>,undefined,const closed_plus<int>,undefined,undefined,const default_dijkstra_visitor)' in function void dijkstra_dispatch2<adjacency_list<vecS,vecS,directedS,no_property,property<e dge_weight_t,int,no_property>,no_property,listS>,const iterator_property_map<int *,vec_adj_list_vertex_id_map<no_property,unsigned int>,int,int &>,adj_list_edge_property_map<directed_tag,int,const int &,unsigned int,const property<edge_weight_t,int,no_property>,edge_weight_t>,vec_adj_list_vertex_i d_map<no_property,unsigned int>,bgl_named_params<unsigned int *,vertex_predecessor_t,no_property> >(const adjacency_list<vecS,vecS,directedS,no_property,property<edge_weight_t,int,no _property>,no_property,listS> &,unsigned int,iterator_property_map<int *,vec_adj_list_vertex_id_map<no_property,unsigned int>,int,int &>,adj_list_edge_property_map<directed_tag,int,const int &,unsigned int,const property<edge_weight_t,int,no_property>,edge_weight_t>,vec_adj_list_vertex_i d_map<no_property,unsigned int>,const bgl_named_params<unsigned int *,vertex_predecessor_t,no_property> &) at line 247 The offending line is: choose_param(get_param(params, graph_visitor), make_dijkstra_visitor(null_visitor()))); Please advise in order to get myself going. Best Regards

1 0

Vertex descriptor invalidation
by Greg Emerson 18 Oct '04

18 Oct '04

Re: Boost Graph Library I have a feeling I am having some problems due to add_edge and vertex invalidation. According to the table on http://www.boost.org/libs/graph/doc/adjacency_list.html decriptors are stable, but http://groups.yahoo.com/group/boost/message/5435 claims otherwise. Could you clear this up for me? Thanks much, Greg Emerson

3 3

Vertex descriptor invalidation (again)
by Greg Emerson 18 Oct '04

18 Oct '04

Sorry, I forgot to mention that I have set VertexList=vecS (and wish to keep it that way). Thanks again, Greg Emerson

2 1

Re: Extending the boost::thread class
by arno.schaefer＠sqs.de 18 Oct '04

18 Oct '04

"Ben Hutchings" <ben.hutchings(a)businesswebsoftware.com> schrieb im Newsbeitrag news:<416D5B83.4090404(a)businesswebsoftware.com>... > Why do you think you want suspend, resume and terminate? There are very > few safe uses for these operations, and programs that use them tend to > suffer from data corruption and/or deadlocks. I am in the situation, that I have a lot of existing C++ Code, which work in this way. All kind of threads are running in an endless loop and will be controlled from outside over the resume and terminate interfaces. I have to deliver a class what satisfy the given interface, because I will have no chance to rewrite all the other code, which run very well on our given plattforms (SUN, HP, AIX, Linux, Windows). So my point is, I want use the portable boost code as a base and manage the non portable parts by myself and looking now for the best way to do it without manipulating the boost source code. > It would be fairly easy to add support for priority settings to > Boost.Thread, but since priority values are only meaningful in the > context of a scheduling policy and policies vary between operating > systems it would be hard to provide a genuinely portable priority system. Can you link to some examples? regards Arno

2 1

Bjam and cygwin
by Foster, Gareth 18 Oct '04

18 Oct '04

Hello all, I keep getting the following errors using bjam ... "<directory-grist>" I have set the install to use GCC and install to /usr. I also tried with /usr/local. I read that it might be a windows/unix line break thing, but I tried the zip file, bz2 and normal tarball, extracting with the windows gui tools and the cygwin cli tools. What am I doing wrong? Thanks for any help. Gaz -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Joel Sent: 15 October 2004 00:55 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Spirit Foster, Gareth wrote: > Hello all, > > I am trying to find some source code that uses spirit to parse C++ and > convert it to HTML, i found some on google, but i misplaced it and i > can't find it again. It looked like it could have been an example > provided with the library, but i can't see it listed in the documentation. > > On a side note, anyone know the best way to use boost with cygwin? From > source? Is there even another way? See the repository: http://spirit.sourceforge.net/repository/applications/show_contents.php Cheers, -- Joel de Guzman http://www.boost-consulting.com http://spirit.sf.net _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

RE: [Boost-users] boost::bind, MSVC7.1 and volatile-qualification
by Schalk_Cronje＠McAfee.com 18 Oct '04

18 Oct '04

>I wouldn't go that way. After the great flame wars in >comp.programming.threads regarding the article, Andrei himself has >acknowledged that this might not be the proper way to do sychronization. >He's since proposed a better approach. >http://www.informit.com/articles/article.asp?p=25298 Oh right, I happened to attend his presentation he did this year at ACCU 2004.

1 0