- Boost - lists.boost.org

[Boost-bugs] [ boost-Bugs-946917 ] Minor coding issue
by SourceForge.net 03 May '04

03 May '04

Bugs item #946917, was opened at 2004-05-03 14:32 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=946917&group_i… Category: date_time Group: None Status: Open Resolution: None Priority: 5 Submitted By: Pieter (morban) Assigned to: Jeff Garland (az_sw_dude) Summary: Minor coding issue Initial Comment: The functions: gregorian_calendar_base<ymd_type_,date_int_type_>::fr om_day_number(date_int_type dayNumber) and: gregorian_calendar_base<ymd_type_,date_int_type_>::fr om_julian_day_number(date_int_type dayNumber) in "gregorian_calander.ipp" share the same code, except for the static_cast to year_type (which is static_cast<unsigned short> in the first and static_cast<year_type> in the second of these functions. It seems that the one of these functions is redundant (and that the first one has a wrong type cast)... ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=946917&group_i… ------------------------------------------------------- This SF.Net email is sponsored by: Oracle 10g Get certified on the hottest thing ever to hit the market... Oracle 10g. Take an Oracle 10g class now, and we'll give you the exam FREE. http://ads.osdn.com/?ad_id=3149&alloc_id=8166&op=click _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

ssh and repository
by Victor A. Wagner Jr. 03 May '04

03 May '04

Ok, it's broken yet again <sigh> and as Jonathan Wakely <cow(a)compsoc.man.ac.uk> says (I don't know where he's finding that info, I've been ALL OVER sourceforge.net) the root name is in EVERY directory...it's not a "just change my command line" Victor A. Wagner Jr. http://rudbek.com The five most dangerous words in the English language: "There oughta be a law"

6 7

Hotfix or full 1.31.1 release? [mainly regex]
by John Maddock 03 May '04

03 May '04

Folks, I'm starting to accumulate a number of regex fixes/patches now, that could usefully be released as either a hotfix for 1.31.0, or combined with other 1.31.0 fixes to make a full 1.31.1 release. So which should it be - this is mainly going to be determined by whether the regression testers are prepared to switch their testing back to the release branch I guess. John.

3 3

Re: Re: [BGL] forced client complexity
by Provisional Dissonance 02 May '04

02 May '04

>Yea, but first the original poster should indicate if this is what he's >looking for -- I never needed this myself. What I was looking for, really, was dialog on existing design strategies. It sounds like your issues with property maps mirror my confusion with the library design, though. While I can fully appreciate the desire to write generic code, it feels like BGL has pushed the complexity of creating and enforcing coupling between the generic graph/node/visitor/algorithm/etc onto the client. At a basic conceptual level, I think of a graph as a data structure composed of nodes and edges. If I'm modeling a family tree, I expect the nodes to be objects of some family-member class. C++ exposes many robust and elegant methods for modeling the family-member - why should I, as a client, have to use property-maps at all? If the node's "index" is related to the object, why would it not be a natural member of the node-type's class? If, instead, it is a synthesized construct for communication between a graph and the algorithm operating over it, why should the client be responsible for its maintenance instead of the framework? What are the advantages of this approach? What are the disadvantages of simplifying things for the client? This is the type of design issue that I intended to question with my initial post. -prs __________________________________ Do you Yahoo!? Yahoo! Small Business $15K Web Design Giveaway http://promotions.yahoo.com/design_giveaway/

6 16

bind question/request
by Max Khesin 02 May '04

02 May '04

I am refactoring code that looks something like this: if (op == LN::FILTER_IN || op == LN::FILTER_NOT_IN) { where += handle_set_operation(column, type, format, op, expr_set); } else if (op == LN::FILTER_RANGE) { where += handle_range_operation(column, type, format, op, expr_set); } else if (op == LN::FILTER_NULL || op == LN::FILTER_NOT_NULL) { where += handle_null_operation(column, op); } ... This would obviously be handled better with a map of some sort (has to map int to function). The problem here is that some functions have more arguments than others, precluding the possibility of uniform type for the function value of the map. I cannot just go and change the function sig to include dummy values ('cause it's a dumb idea). This situation made me think of boost.function/boost.bind, which allows to effectively shorten the function parameter list by binding some of the args. so given int f(int a, int b) { return a + b; } bind(f, _1, 5)(x); is equivalent to f(x, 5); and by extension bind(f, _1, _2, _0)(x, y, z) would be equivalent to f(x, y) thoughts? thanks. This email and any files transmitted with it are confidential and intended solely for the use of the individual or entity to whom they are addressed. If you have received this email in error please notify the system manager. This message contains confidential information and is intended only for the individual named. If you are not the named addressee you should not disseminate, distribute or copy this e-mail.

5 4

ssh to CVS updates
by Victor A. Wagner Jr. 02 May '04

02 May '04

I finally got the boost stuff updating.... I downloaded UltraEdit to fix all the root files ... it might be worth paying for the program JUST to have that feature.... it did it in one step in about 4 seconds (609 files updated). so now that I've got that working again I get this when attempting to run bjam in the status sub-directory: C:\Projects\boost>cd status C:\Projects\boost\status>bjam -sTOOLS=vc7.1 1>status.log C:\Projects\boost\status>mgrep (('serror's)`('starget)`(skipped's)) status.log Grep - Version 1.11 Copyright (C) 1986-94, Metadigm, Inc. All Rights Reserved Copyright (C) 2000-2; Victor A. Wagner Jr. All Rights Reserved File: status.log ...found 25149 targets... ...updating 101 targets... C:\Projects\boost\boost\graph\graph_test.hpp(375) : error C2065: 'x' : undeclared identifier C:\Projects\boost\boost\graph\graph_test.hpp(380) : error C3861: 'x': identifier not found, even with argument-dependent lookup C:\Projects\boost\boost\graph\graph_test.hpp(384) : error C3861: 'x': identifier not found, even with argument-dependent lookup ...skipped <@boost!libs!graph!test\subgraph.test\vc7.1\debug>subgraph.CMD for lack of <@boost!libs!graph!test\subgraph.test\vc7.1\debug>subgraph.obj... ...skipped <@boost!libs!graph!test\subgraph.test\vc7.1\debug>subgraph.exe for lack of <@boost!libs!graph!test\subgraph.test\vc7.1\debug>subgraph.CMD... ...skipped <@boost!libs!graph!test\subgraph.test\vc7.1\debug>subgraph.run for lack of <@boost!libs!graph!test\subgraph.test\vc7.1\debug>subgraph.exe... ...failed updating 1 target... ...skipped 4 targets... ...updated 96 targets... =============================================================================================== this is the additional information about the 1st error: ..\libs\graph\test\subgraph.cpp(114) : see reference to function template instantiation 'void boost::graph_test<Graph>::test_vertex_property_graph<int,boost::vertex_color_t>(const std::vector<_Ty> &,PropertyTag,Graph &)' being compiled with [ Graph=subgraph_t, _Ty=int, PropertyTag=boost::vertex_color_t ] ================================================================================================= I'm still unable to access what used to be :ssh:vawjr@cvs.boost-sandbox.sourceforge.net:22:/cvsroot/boost-sandbox here is the relevant info C:\Projects\boost-sandbox>cvs login Logging in to :ssh:vawjr@cvs.sourceforge.net:22:/cvsroot/boost-sandbox CVS password: ******* C:\Projects\boost-sandbox>cvs co -c C:\Projects\boost-sandbox>cvs update -dPA cvs update: Updating . cvs update: failed to create lock directory for `/cvsroot/boost-sandbox/boost-sandbox' (/cvsroot/boost-sandbox/boost-sandbox/#cvs.lock): Permission denied cvs update: failed to obtain dir lock in repository `/cvsroot/boost-sandbox/boost-sandbox' cvs [update aborted]: read lock failed - giving up ======================================================================================================= that cvs co -c doesn't complain leads me to believe that it's working to SOME extent not sure what the permission problem is. Victor A. Wagner Jr. http://rudbek.com The five most dangerous words in the English language: "There oughta be a law"

1 0

Generative programming support in boost
by Dave Gomboc 01 May '04

01 May '04

I'm revisiting Czarnecki and Eisenecker's work (Generative Programming: Methods, Tools, and Applications) from 2000. I'm wondering what is available in boost that exploits (or even advances) on the techniques and code examples given there. It occurs to me that both the concept_check and the mpl library have something to offer in this respect. At the very least, there are few obvious things (e.g. if, apply_if, etc. in mpl). Is anyone actively applying boost code in this area? (I did find a series of posts from February 2002 on this topic, but not much since then.) Dave

4 3

Re: [boost] Generative programming support in boost
by JOAQUIN LOPEZ MU?Z 01 May '04

01 May '04

----- Mensaje original ----- De: Dave Gomboc <dave(a)cs.ualberta.ca> Fecha: Sábado, Mayo 1, 2004 4:04 am Asunto: [boost] Generative programming support in boost > I'm revisiting Czarnecki and Eisenecker's work (Generative > Programming:Methods, Tools, and Applications) from 2000. I'm > wondering what is > available in boost that exploits (or even advances) on the techniques > and code examples given there. > > It occurs to me that both the concept_check and the mpl library have > something to offer in this respect. At the very least, there are few > obvious things (e.g. if, apply_if, etc. in mpl). Is anyone actively > applying boost code in this area? > FWIW, multi_index_container crucially depends on MPL to construct the container out of a typelist of index specifiers (mpl::fold stuff). Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

RE: [boost] Generative programming support in boost
by Reece Dunn 01 May '04

01 May '04

Dave Gomboc wrote: >I'm revisiting Czarnecki and Eisenecker's work (Generative Programming: >Methods, Tools, and Applications) from 2000. I'm wondering what is >available in boost that exploits (or even advances) on the techniques >and code examples given there. >It occurs to me that both the concept_check and the mpl library have >something to offer in this respect. At the very least, there are few >obvious things (e.g. if, apply_if, etc. in mpl). Is anyone actively >applying boost code in this area? Have you had a look at Boost.Spirit and the related Phoenix/Fusion libraries? Spirit is a lexer/parser generator that allows you to write BNF grammars in C++ that are close to the actual BNF grammar declerations, as well as providing a set of grammar recognisers like real numbers. See the documentation for more information. Spirit allows you to bind actions to the grammar (e.g. summing the numbers read from a file/user input). There is closure support, alliowing a grammar rule to have data bound to it, and the Phoenix/Fusion library provides a mechanism for writing lazily evaluated C++-like code (e.g. if, while as well as STL actions such as push_back and assign). e.g. std::vector< float > v; ... rule<> = real_p[ push_back_p( v ) ] >> ',' >> real_p[ push_back_p( v ) ] NOTE: The Spirit documentation contains this example with a more detailed explanation. There is also the Lambda library - which is currently being rewritten to sit on top of the Fusion framework - that allows you to use Lambda expressions in C++ code, e.g.: std::for_each( c.begin(), c.end(), n += _1 ); // see Lambda docs for correct usage There has also been a review of the FC++ library (see the mail archives for details) that attempts to provide a functional language framework, and although it has not yet been accepted into Boost, there are some powerful concepts like Lazy Lists. It provides its own Lambda implementation and equivalent of Boost.Function/Boost,Bind. Even though this is functional programming (like Haskell) there is a heavy reliance on template metaprogramming as well as adding to the existing generative framework. If you want to find out how extensively the MPL library is used in Boost, do a search for "mpl::". I know that the Serialisation library is using it. Also, there are several workarounds for the current lack of typeof/auto in various libraries that need it. My I/O formatters library (boost-sandbox/outfmt) uses a technique similar to this to map a type to a classification (e.g. container, array, n-ary) in order to build the appropriate formatter so that it can be correctly written to/read from a C++ stream. The documentation is currently out of synch with the implementation and examples, but I am revising it at the moment. Also, the STL provides generative support with iterators/iterator_traits, algorithms and functors. The Boost library has enhanced these with the Iterator Adaptors library, a better iterator_traits and other stuff. Hope that helped. Regards, Reece _________________________________________________________________ Express yourself with cool emoticons - download MSN Messenger today! http://www.msn.co.uk/messenger

1 0

BOOST_TRY, can we make it into CVS?
by Pavel Vozenilek 01 May '04

01 May '04

I would like to ask someone with write access to CVS to create file boost/details/exception_helpers.hpp (or so) with content: #include <boost/config.hpp> #include <boost/detail/workaround.hpp> #if !(defined BOOST_NO_EXCEPTIONS) # define BOOST_TRY { try # define BOOST_CATCH(x) catch(x) # define BOOST_RETHROW throw; # define BOOST_CATCH_END } #else # if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) # define BOOST_TRY { if ("") # define BOOST_CATCH(x) else if (!"") # else # define BOOST_TRY { if (true) # define BOOST_CATCH else if (false) # endif # define BOOST_RETHROW # define BOOST_CATCH_END } #endif circular_buffer, serialization and multi_index_container may use this code. It was discussed on the list and reaction was rather positive. TIA /Pavel

2 1