October 2007 - Boost - lists.preview.boost.org

Re: [boost] [GTL] - geometric template library - determininginterest
by Tom Brinkman 14 Oct '07

14 Oct '07

>> "It's time to abandon the traditional, but inaccurate, ideas of >> what it means to be object-oriented. Are you a true encapsulation >> believer? If so, I know you'll embrace non-friend non-member >> functions with the fervor they deserve." >> Think STL! Think STL algorithms! :-) Just for the record, I agree with Joel. Who is still writing old style OO "c++" libraries any more. I'm suprised that it is even being proposed here on boost. Please study boost::gil (from adobe) or boost::spirit to understand what a well written modern c++ library looks like.

1 0

[range] sub_range copy/assign workaround for msvc
by shunsuke 14 Oct '07

14 Oct '07

Hi, http://svn.boost.org/trac/boost/ticket/1284 can be resolved using the attached patch for sub_range.hpp. A similar bug has already been reported to Microsoft so that we can hope the next msvc will fix this bug. Regards, -- Shunsuke Sogame

1 0

Re: [boost] [GTL] - geometric template library - determininginterest
by Simonson, Lucanus J 14 Oct '07

14 Oct '07

>John Femiani wrote: >> Count me as interested in any attempt at a free generic geometry >> library. >> >> Is this purely 'rectilinear' -- I mean, when you say polygons do you >> mean any kind of polygon or only the kinds of polygons formed by the >> union of axis-aligned rectangles? Could I find the intersection of a >> star and a triangle? >> Gyuszi Suto wrote: >The polygons need to be formed by union of axis-aligned rectangles, yes. >In addition to that, GTL supports 45 degree polygons as well. >Can GTL intersect a star and a triangle? If both are limited to >rectilinear or 45 degreee edges, yes, >otherwise no. There is the strong possibility that I will be extending the GTL capabilities beyond 45 degree to allow arbitrary angles with the goal of providing best in class performance with a generic and productive interface. As we are all aware, this leads to the need to provide a mechanism to ensure numerical robustness at considerable cost in runtime. That mechanism would obviously include a generic interface for specifying the internal numerical data type to be used by the algorithm, with a default provided by the library. However, our intention is not to provide a comprehensive geometry library, which would be too broad in scope, but rather a starting point for generic geometry that the community can participate in and extend in the most useful directions. In looking at the recent submissions to boost related to geometry there is a fair amount of overlap with our library, particularly in what I call the basic types such as point2d. The ideal outcome from my point of view is that we all benefit from a synthesis of ideas and craft a boost geometry library together that goes beyond the code we will initially submit and will continue to be enhanced and extended with the participation of the community over time. Lucanus Simonson

17 97

Re: [boost] Boost Overload Documentation
by Marco 13 Oct '07

13 Oct '07

On Tue, 09 Oct 2007 16:11:38 +0200, Dean Michael Berris <mikhailberis(a)gmail.com> wrote: > By the way, have you tried the Boost Vault yet? You can upload your > implementation there: http://boost-consulting.com/vault . That way we > can get more people to check out the implementation and allow them to > use your implementation right away. > > I hope this helps! > Thanks for the advice. I registered to boost vault and uploaded my implementation to it. I thought that the boost vault was reserved to boost developers. This is the link: http://www.boost-consulting.com/vault/index.php?action=downloadfile&filenam… And thanks a lot for the documentation that you're writing. :-) Kind regards, Marco Cecchetti -- Using Opera's revolutionary e-mail client: http://www.opera.com/mail/

8 26

Will addressof be in C++0x?
by Andrey Semashev 13 Oct '07

13 Oct '07

Hi, I'm not sure I'm asking this question in the right list, so sorry if I've misplaced my post. I'd like to ask if boost::addressof is going to be proposed to be included in the upcoming C++ Standard. And what is more important to me, will it solve the problem of storing objects with custom operator& in STL containers and acquiring their addresses with std::allocator<T>::address. I'm sure such discussion must have went in the Committee or in this list, I've found some traces of it in the GMANE archive but I couldn't find any conclusion.

2 2

Dispatcher + Overload
by Marco Costalba 13 Oct '07

13 Oct '07

Now that we have an overload implementation I was starting to think how to integrate Dean dispatcher with overload. Integration from ABOVE: a dispatcher holds a fusion::vector of overloads objects instead of directly boost::functions, so that you can say d[0](7); d[0](7, "test"); This is the most natural and most immediate approach. But a perhaps more interesting approach is Integration from BELOW: In this case is overload that holds, instead of a tuple of boost:function objects a tuple of dispatcher opbjects. Currently dispatcher is single-signature, and this fits perfectly as a replacement for boost::function as used in overload. In this case we could have int foo1(); int foo2(); int bar(); overload<int(), int(int)> f; f.set(foo1); f.set(foo2); f.set(bar); f()[0]; //calls foo1 f()[1]; //calls foo2 f(7); //calls bar Just some rough ideas to get some comments... Thanks Marco

2 2

[ANN] Xpressive 2.0 pre
by Eric Niebler 12 Oct '07

12 Oct '07

It's a poorly kept secret that I've been adding new features to Xpressive on CVS HEAD for a while now. So here are the features already implemented (documentation forthcoming) for Xpressive 2.0: << Semantic Actions >> Specify code to execute when parts of a regex match, a-la Spirit's semantic actions. Eg.: if you want to parse a string of name/value pairs into a std::map, you might: std::map<std::string, int> result; std::string str("aaa=>1 bbb=>23 ccc=>456"); // Like "(\\w+)=>(\\d+)": sregex pair = ( (s1= +_w) >> "=>" >> (s2= +_d) ) [ ref(result)[s1] = as<int>(s2) ]; sregex rx = pair >> *(+_s >> pair); if(regex_match(str, rx)) { assert(result["aaa"] == 1); assert(result["bbb"] == 23); assert(result["ccc"] == 456); } The actions are placed on a queue and executed in order only when the regex match succeeds. << Custom Assertions >> Use the check() function to create a boolean predicate that can participate in the match. Here's a regex that recognizes two integers only if the first is less than the second: sregex rx = ( (s1= +_d) >> ' ' >> (s2= +_d) ) [ check( as<int>(s1) < as<int>(s2) ) ]; Unlike actions, predicates execute immediately. You can also define the predicate out-of-line as a function object. << Dynamic Regex Grammars with Named Regexes >> Using regex_compiler, you can map a name to a regex object, and then refer to that regex from another by name. In this way, you can build grammars from regexes at runtime. sregex_compiler comp; sregex rx = comp.compile("^bar(?$RE)baz$"); comp.compile("(?$RE=)\\d+ \\d+"); There's an alternate syntax for associating a name with a regex that you can use to nest a static regex in a dynamic one. Eg., the last line above could be: comp["RE"] = +_d >> ' ' >> +_d; With these changes, you can now nest static and dynamic regexes within each other freely, giving you lots of flexibility to build grammars and modify them on the fly. << Named Captures >> For dynamic regular expressions, you can create a named capture with (?P<name> ...). You can refer back to the named capture with (?P=name). In substitution strings (for use with regex_replace()), you can refer back to a named capture with \\g<name> when using the format_perl or format_all flags. And more .... I'd like to give props to Dave Jenkins who has been doing m4d things with this stuff already, and who has given me a laundry list of other features he'd like. The new features are only available in CVS HEAD, for now. Feedback is welcome. -- Eric Niebler Boost Consulting www.boost-consulting.com

3 7

[range] iterator_range/sub_range test patch
by shunsuke 12 Oct '07

12 Oct '07

Hi, The failures of iterator_range and sub_range.cpp seem to be fixed trivially. Wrap string literals with as_literal. Am I right? Here is a patch. http://svn.boost.org/trac/boost/ticket/1302 Regards, -- Shunsuke Sogame

3 3

[filesystem] operations_posix_windows missing std
by William SleemanIV 12 Oct '07

12 Oct '07

I am getting the following errors when trying to link the simple_ls example using SunStudio11 and 12: Undefined first referenced symbol in file std::allocator<char>::~allocator() /rdo/home/fsleeman/boost_1_32_0-install/lib/libboost_filesystem-sw-mt-d.a(operations_posix_windows.o) std::string::basic_string() /rdo/home/fsleeman/boost_1_32_0-install/lib/libboost_filesystem-sw-mt-d.a(operations_posix_windows.o) int std::string::_M_compare(const char*,const char*,const char*,const char*) /rdo/home/fsleeman/boost_1_32_0-install/lib/libboost_filesystem-sw-mt-d.a(path_posix_windows.o) int std::char_traits<char>::compare(const char*,const char*,unsigned long) /rdo/home/fsleeman/boost_1_32_0-install/lib/libboost_filesystem-sw-mt-d.a(path_posix_windows.o) std::string::basic_string(std::_String_reserve_t,unsigned long,const std::allocator<char>&) /rdo/home/fsleeman/boost_1_32_0-install/lib/libboost_filesystem-sw-mt-d.a(path_posix_windows.o) std::string &std::string::append<const char*>(__type_3,__type_3) /rdo/home/fsleeman/boost_1_32_0-install/lib/libboost_filesystem-sw-mt-d.a(path_posix_windows.o) ld: fatal: Symbol referencing errors. No output written to simple_ls The related lines in my Makefile are the following: CC -o simple_ls simple_ls.o -features=tmplife -features=tmplrefstatic -xarch=generic64 -L/usr/local/lib/sparcv9 -L/rdo/home/fsleeman/boost_1_32_0-install/lib -lCstd -lboost_filesystem-sw-mt-d CC -xarch=generic64 -I/rdo/home/fsleeman/boost_1_32_0-install/include/boost-1_32 -I/usr/local/include -c simple_ls.cpp Are some other options I am missing? I have had no trouble getting this to compile under g++. -Ford Sleeman NOTE: The information contained in this message may be privileged and confidential and protected from disclosure. If the reader of this message is not the intended recipient, you are hereby notified that any dissemination, distribution or copying of this communication is strictly prohibited. If you have received this communication in error, please notify us immediately by replying to the message and deleting it from your computer. -------------------------------------- VCU Health System http://www.vcuhealth.org

4 13

[intrusive] List implementation question.
by Markus Schöpflin 12 Oct '07

12 Oct '07

Hello, in boost/intrusive/list.hpp there is the following method of list_impl: template<class Iterator, class Disposer> void dispose_and_assign( Disposer disposer, Iterator b, Iterator e) { this->clear(disposer); this->insert(this->end(), b, e); } AFAICT, there is no clear() method taking a disposer as an argument. Shouldn't this read clear_and_dispose()? TIA, Markus

3 3