- Boost - lists.boost.org

RE: [boost] Re: static sized strings
by Reece Dunn 18 May '04

18 May '04

Martin wrote: >Do you plan to add more of the basic_string members? I intend to (hopefully) have as close to the basic_string interface as I can get to help interoperability. I have been working on getting core functionality up and running initially, but I am working on adding more basic_string members. >Many of the string algorithms (e.g. trim & replace) seem to require insert >& >erase? I haven't included these yet, but I shall work to get them implemented as soon as I can. I am also thinking about how to implement substrings: either create a std::basic_string or have an internal/external type that operates on const char * instead of const char[ n ], etc. Then there's the issue of compilers/standard libraries that don't have the correct std::reverse_iterator, std::iterator_traits, std::basic_[i/o]stream implementations (sigh). Regards, Reece _________________________________________________________________ Express yourself with cool new emoticons http://www.msn.co.uk/specials/myemo

1 0

RE: [boost] Is there interest in a decimal floating-point class?
by Michiel Salters 18 May '04

18 May '04

> -----Original Message----- > From: boost-bounces(a)lists.boost.org > [mailto:boost-bounces@lists.boost.org]On Behalf Of Jeff Garland > Sent: maandag 17 mei 2004 14:34 > To: boost(a)lists.boost.org > Subject: Re: [boost] Is there interest in a decimal floating-point > class? > > > On Sun, 16 May 2004 19:26:51 +0200, Richard Kaiser wrote > > I want to ask the boost community if there is interest in a decimal > > floating-point class implementing one or more of the decimal > > floating-point types that are intended to become part of a future C > > and C++ standard. > > At this moment I don't need this, but I've need something > like this in the past and suspect I will again. So I'd like to > see it. Only question is will the compiler vendors get > there first if it's already clear this is going in the standard? It's just a proposal, and I doubt it will become part of the standard. P.J.Plauger wasn't very positive, and NNI (Dutch) voted against it. I'm not aware of other formal votes, though. One problem I saw was that the proposal implemented its types as core language, with semantics that I felt were hard if not impossible to achieve for UDTs (w.r.t. conversion sequences) Regards, -- Michiel Salters Consultant Software Engineering LogicaCMG RTSE1, the Netherlands Michiel.Salters(a)logicacmg.com This e-mail and any attachment is for authorised use by the intended recipient(s) only. It may contain proprietary material, confidential information and/or be subject to legal privilege. It should not be copied, disclosed to, retained or used by, any other party. If you are not an intended recipient then please promptly delete this e-mail and any attachment and all copies and inform the sender. Thank you.

1 0

RE: [boost] Re: [iterator facade] Why is dereference const?
by Max Khesin 18 May '04

18 May '04

> "Neal D. Becker" <ndbecker2(a)verizon.net> writes: Good suggestion! I'll post the modified code if anyone is interested. Yes pleaze. 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.

3 5

RE: [boost] [Test] Test library failing to build on MetaComm inte l-win32-7.1-vc6
by Rozental, Gennadiy 18 May '04

18 May '04

> Looks simple enough to fix... > > Doug Do you have any suggestions? Gennadiy. P.S. It also fails on Borland, Cameu, and sun compilers. Any suggestions/help very welcome

2 1

[Signals] Borland compile problems
by Douglas Gregor 18 May '04

18 May '04

Hello Borland users/developers, I am unable to get the new Signals implementation to play nicely with Borland and have given up. It seems to want to instantiate classes that should not be instantiated, causing a whole mess of problems I haven't solved. Help would be appreciated; otherwise we might need to drop Borland support to move the library forward :( Doug

2 2

[MPL] Compile-time math metafunctions.
by Cromwell Enage 18 May '04

18 May '04

Hi, all! I spent a bit of time reading Pete Isenesee's article, "Fast Math Using Template Metaprogramming", which can be found in Game Programming Gems, Section 1.2, and it inspired me to implement compile-time versions of some of the standard math functions. Two of the metafunctions even work for complex numbers, using the components as input instead of any particular complex number class. My work so far can be found here: <http://groups.yahoo.com/group/boost/files/mpl_math.zip> Yes, it also provides the math constant PI. Perhaps a constants library can be built on top of this one? I'm holding off on putting this mini-library in the Sandbox until the file hierarchy is reasonably stable; I'm not even sure if the classes are well-structured at this point. For this reason, I'm also holding off on writing documentation; I'm hoping the example program would be simple enough to understand. Please send feedback! Cromwell Enage __________________________________ Do you Yahoo!? SBC Yahoo! - Internet access at a great low price. http://promo.yahoo.com/sbc/

4 5

[Boost-bugs] [ boost-Bugs-955768 ] undirected adjacency_matrix example segfaults at print_graph
by SourceForge.net 18 May '04

18 May '04

Bugs item #955768, was opened at 2004-05-18 11:58 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=955768&group_i… Category: graph Group: None Status: Open Resolution: None Priority: 5 Submitted By: Burnce (burnce) Assigned to: Jeremy Siek (jsiek) Summary: undirected adjacency_matrix example segfaults at print_graph Initial Comment: Example 2 from http://www.boost.org/libs/graph/doc/adjacency_matrix.html creates a segfault in the second to last line boost::print_graph(ug, name); Details follow: Program received signal SIGSEGV, Segmentation fault. 0x0804a276 in bool boost::detail::get_edge_exists<char>(char const&, ...) (edge_proxy=@0xc804bbe9) at adjacency_matrix.hpp:84 /usr/include/boost/graph/adjacency_matrix.hpp:84:2923:beg:0x804a276 (gdb) up #1 0x0804ab6b in boost::detail::undir_adj_matrix_out_edge_iter<unsigned, __gnu_cxx::__normal_iterator<char*, std::vector<char, std::allocator<char> > >, unsigned, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned> >::dereference() const (this=0xbfffead0) at adjacency_matrix.hpp:228 (gdb) up #2 0x0804ab0c in dereference<boost::detail::undir_adj_matrix_out_edge_iter<size_t, __gnu_cxx::__normal_iterator<char*, std::vector<char, std::allocator<char> > >, size_t, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t> > > (f=@0xbfffead0) at iterator_facade.hpp:341 (gdb) up #3 0x0804aae2 in boost::iterator_facade<boost::detail::undir_adj_matrix_out_edge_iter<unsigned, __gnu_cxx::__normal_iterator<char*, std::vector<char, std::allocator<char> > >, unsigned, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned> >, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned>, boost::random_access_traversal_tag, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned>, int>::operator*() const (this=0xbfffead0) at iterator_facade.hpp:442 (gdb) up #4 0x0804aa7b in boost::filter_iterator<boost::detail::does_edge_exist, boost::detail::undir_adj_matrix_out_edge_iter<unsigned, __gnu_cxx::__normal_iterator<char*, std::vector<char, std::allocator<char> > >, unsigned, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned> > >::satisfy_predicate() (this=0xbfffead0) at filter_iterator.hpp:102 /usr/include/boost/iterator/filter_iterator.hpp:102:2993:beg:0x804aa7b (gdb) up #5 0x0804a9fd in filter_iterator (this=0xbfffead0, f={<No data fields>}, x={<iterator_adaptor<boost::detail::undir_adj_matrix_out_edge_iter<unsigned int, __gnu_cxx::__normal_iterator<char*, std::vector<char, std::allocator<char> > >, unsigned int, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned int> >,__gnu_cxx::__normal_iterator<char*, std::vector<char, std::allocator<char> > >,boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned int>,boost::use_default,boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned int>,int>> = {<iterator_facade<boost::detail::undir_adj_matrix_out_edge_iter<unsigned int, __gnu_cxx::__normal_iterator<char*, std::vector<char, std::allocator<char> > >, unsigned int, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned int> >,boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned int>,boost::random_access_traversal_tag,boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned int>,int>> = {<No data fields>}, m_iterator = {<iterator<std::random_access_iterator_tag,char,int,char*,char&>> = {<No data fields>}, _M_current = 0x804d050 ""}}, m_src = 0, m_inc = 3221220248, m_targ = 0, m_n = 6}, end={<iterator_adaptor<boost::detail::undir_adj_matrix_out_edge_iter<unsigned int, __gnu_cxx::__normal_iterator<char*, std::vector<char, std::allocator<char> > >, unsigned int, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned int> >,__gnu_cxx::__normal_iterator<char*, std::vector<char, std::allocator<char> > >,boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned int>,boost::use_default,boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned int>,int>> = {<iterator_facade<boost::detail::undir_adj_matrix_out_edge_iter<unsigned int, __gnu_cxx::__normal_iterator<char*, std::vector<char, std::allocator<char> > >, unsigned int, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned int> >,boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned int>,boost::random_access_traversal_tag,boost::detail::matrix_edge_desc_impl<boost::undirected_tag, unsigned int>,int>> = {<No data fields>}, m_iterator = {<iterator<std::random_access_iterator_tag,char,int,char*,char&>> = {<No data fields>}, _M_current = 0x804d065 ""}}, m_src = 0, m_inc = 3221220260, m_targ = 0, m_n = 6}) at filter_iterator.hpp:61 (gdb) up #6 0x08049f60 in std::pair<boost::adjacency_matrix<boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, std::allocator<bool> >::out_edge_iterator, boost::adjacency_matrix<boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, std::allocator<bool> >::out_edge_iterator> boost::out_edges<boost::no_property, boost::no_property, boost::no_property, std::allocator<bool> >(boost::adjacency_matrix<boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, std::allocator<bool> >::vertex_descriptor, boost::adjacency_matrix<boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, std::allocator<bool> > const&) (u=0, g_=@0xbfffed70) at adjacency_matrix.hpp:529 (gdb) up #7 0x08049cc7 in void boost::print_graph_dispatch<boost::adjacency_matrix<boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, std::allocator<bool> >, char const*>(boost::adjacency_matrix<boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, std::allocator<bool> > const&, char const*, boost::undirected_tag) (G=@0xbfffed70, name=0x804b0fc "ABCDEF") at graph_utility.hpp:201 (gdb) up #8 0x08048e28 in void boost::print_graph<boost::adjacency_matrix<boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, std::allocator<bool> >, char const*>(boost::adjacency_matrix<boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, std::allocator<bool> > const&, char const*) (G=@0xbfffed70, name=0x804b0fc "ABCDEF") at graph_utility.hpp:211 (gdb) up #9 0x08048a9a in main () at undirected_adj_matrix.cc:25 ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=955768&group_i… ------------------------------------------------------- This SF.Net email is sponsored by: SourceForge.net Broadband Sign-up now for SourceForge Broadband and get the fastest 6.0/768 connection for only $19.95/mo for the first 3 months! http://ads.osdn.com/?ad_id=2562&alloc_id=6184&op=click _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

RE: Newbie to Regex simple test failure...
by Stephan T. Lavavej 18 May '04

18 May '04

[Richard Latter] > I am using regex for the first time on MSVC 6 You DO know that MSVC 6 is an abomination against everything good in the world, right? Right? > bool TestStr (std::string& szExpr Hungarian notation is evil. And here, you're not even using it correctly. std::string's aren't lame null-terminated C strings. And you should take the first argument by const reference. > bool bResult=false; This would, uhhh, be better written as return regex_match(... I guess you do this in TestStr2, which doesn't take either of its arguments by const reference like it should. > boost::regex_match(szSearch, cExpr); Wouldn't you like to be a Koenig lookup too?</Johnny Five> > it appears thta the boost::regex declaration > fails Is the regex, which you do not provide here, correctly formed? > 1. Wht doesn't any of the functions work? I'd tend to blame your crummy compiler (although Boost does bend over backwards to support twentieth century technology). Stephan T. Lavavej http://nuwen.net

1 0

Re: [boost] Re: Re: [iterator facade] Why is dereference const?
by John Torjo 18 May '04

18 May '04

>>> >>Yes, there is. >>rtl (Range Templates Library) has a generate_iterator. >> >>You have a generator, and a stopper. From these, you create an input >>iterator sequence. The stopper tells you when you've reached end. >> >>For instance: >>// input iterator sequence - 20 fibonacci numbers >>generated(fibonacci(), gen_n(20)) >> >>// input iterator sequence - fibonacci numbers up to 200 >>generated(fibonacci(), gen_upto(200)) >> >>You can use it like this: >>rng::copy( generated(fibonacci(), gen_upto(200)), >>std::ostream_iterator<int>(std::cout," ")); >> >>The rtl (and the generate* examples) can be found at: >>www.torjo.com/code/for_boost.zip >> >> > >The RTL approach looks very interesting. There is a lot to digest here. > >What is the state of maturity of this code? Would you consider it ready for >use? > I would think so. I've used it successfully in 6 projects so far, 3 of them being > 100000 lines of code each. Best, John -- John Torjo Freelancer -- john(a)torjo.com -- http://www.torjo.com/logview/ - viewing/filtering logs is just too easy!

1 0

RE: [boost] Re: static sized strings
by Reece Dunn 17 May '04

17 May '04

John Nagle wrote: > That's an older version, though; the strings have >no length field, and you said you were putting one in. >Should I do that? I have been busy with other things. I have finally gotten around to updating the code, which now includes: * internal length tracking * null-termination as a given (i.e. it will no longer work in data structure headers for signature checking, etc.) * safe_strings.hpp uses your strategy of putting the C-string functions in the global namespace (I would have liked a better approach to this). #include <boost/fixed_string/safe_strings.hpp> // ... boost::char_string< 15 > cstr; strcpy( cstr, "Meine Grosse Welt!" ); std::cout << cstr << '\n'; sprintf( cstr, "Hello %d Worlds!", 10 ); std::cout << cstr << '\n'; Results in: Meine Grosse W Hello 10 World Regards, Reece _________________________________________________________________ Use MSN Messenger to send music and pics to your friends http://www.msn.co.uk/messenger

2 1