- Boost - lists.boost.org

[Boost-bugs] [ boost-Bugs-1179641 ] boost::pool_allocator breaks with vector of vectors
by SourceForge.net 09 Apr '05

09 Apr '05

Bugs item #1179641, was opened at 2005-04-09 00:46 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=1179641&group_… Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Greg Rosenblatt (glr9940) Assigned to: Nobody/Anonymous (nobody) Summary: boost::pool_allocator breaks with vector of vectors Initial Comment: The resulting executable built with the following code under GCC 3.3.5 produces a segmentation fault when run: Note that switching the definition of EventVector to use a vector with a standard allocator will fix the problem. Also note that the definition of IndexVector doesn't seem to matter. #include <boost/pool/pool_alloc.hpp> #include <vector> #include <iostream> template <typename DataType> struct PooledVector { typedef std::vector<DataType, boost::pool_allocator<DataType> > Type; }; typedef PooledVector<int>::Type EventVector; //typedef std::vector<int> EventVector; //typedef PooledVector<EventVector>::Type IndexVector; typedef std::vector<EventVector> IndexVector; int main() { IndexVector iv; iv.push_back(EventVector()); iv.back().push_back(3); std::cout << "it works\n"; return 0; } ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1179641&group_… ------------------------------------------------------- SF email is sponsored by - The IT Product Guide Read honest & candid reviews on hundreds of IT Products from real users. Discover which products truly live up to the hype. Start reading now. http://ads.osdn.com/?ad_id=6595&alloc_id=14396&op=click _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

resolving a string to a type
by George M. Garner Jr. 09 Apr '05

09 Apr '05

Does boost provide a standard way to resolve a string to a type within a typelist? Regards, George.

1 0

[Boost-bugs] [ boost-Bugs-1179501 ] tools/bcp/bcp_imp.cpp (unknown identifier getline)
by SourceForge.net 08 Apr '05

08 Apr '05

Bugs item #1179501, was opened at 2005-04-08 22:13 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=1179501&group_… Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: squeeze (sqzme) Assigned to: Nobody/Anonymous (nobody) Summary: tools/bcp/bcp_imp.cpp (unknown identifier getline) Initial Comment: 108: while (getline(in, line)) { produces a linker error. Should be: 108: while (std::getline(in, line)) { ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1179501&group_… ------------------------------------------------------- SF email is sponsored by - The IT Product Guide Read honest & candid reviews on hundreds of IT Products from real users. Discover which products truly live up to the hype. Start reading now. http://ads.osdn.com/?ad_id=6595&alloc_id=14396&op=click _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[serialization1.32]:VC7.1 error C2039: 'integral_c_tag' : n'est pas membre de 'boost::mpl'
by Francis ANDRE 08 Apr '05

08 Apr '05

Hi Robert I got this error from error C2039: 'integral_c_tag' : n'est pas membre de 'boost::mpl' Here the beginning of level.hpp I got: ---------------------------------------------------------------------------- ------ #include <boost/mpl/int.hpp> #include <boost/mpl/integral_c.hpp> #include <boost/serialization/level_enum.hpp> #include <boost/serialization/traits.hpp> namespace boost { namespace serialization { // default serialization implementation level template<class T> struct implementation_level { template<class U> struct traits_class_level { typedef BOOST_DEDUCED_TYPENAME U::level type; }; typedef mpl::integral_c_tag tag; // <== problem here // #if BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(600)) // typedef ---------------------------------------------------------------------------- -------- >From what I check of the latest HEAD release from CVS, it should be integral_c instead of integral_c_tag?? Regards FA

2 1

[serialization] exception in destructor
by Vyacheslav E. Andrejev 08 Apr '05

08 Apr '05

Hello Robert, I spent a lot of time trying to understand where my program failed. Finally, I found that the cause was in destructor of basic_xml_oarchive class: template<class Archive> #if !defined(__BORLANDC__) BOOST_DECL_ARCHIVE_OR_WARCHIVE #endif basic_xml_oarchive<Archive>::~basic_xml_oarchive(){ if(!header) return; this->This()->put("</boost_serialization>\n"); } basic_text_oprimitive::put(const char * s) can throw an exception, causing unexpected termination of program when stack unwind. I heard many times that uncaught exception in destructor is not very good thing. Should we consider refactoring of this point in basic_xml_oarchive? Regards. Slava. -- Vyacheslav E. Andrejev System Architect, Excelsior, LLC

2 1

Bug in posix_time::ptime documentation?
by Wolfgang Fertsak 08 Apr '05

08 Apr '05

I don't know if this has been reported already, but in the ptime-class documentation (boost_1_32_0/doc/html/date_time/posix_time.html) in the section "Construct from Clock" is a list of the three construction functions second_clock::local_time() second_clock::universal_time() microsec_clock::local_time() The example for second_clock::universal_time() shows a call of second_clock::universal_day() - which will not compile. Kind regards, Wolfgang

2 1

Re: Logo Contest tally
by Jason Hise 08 Apr '05

08 Apr '05

Apologies to all, my program had a bug and called the winner far too soon. A corrected version is attached, and the winner should come out to 67b. -Jason #include <string> #include <vector> #include <list> #include <map> #include <iostream> using namespace std; int main ( ) { string s; list < string > vote; vector < list < string > > votes; map < string, size_t > candidates; while ( true ) { getline ( cin, s ); if ( cin.eof ( ) ) { if ( !vote.empty ( ) ) votes.push_back ( vote ); break; } if ( s == "vote:" ) { if ( !vote.empty ( ) ) { votes.push_back ( vote ); vote.clear ( ); } } else { candidates.insert ( map < string, size_t >::value_type ( s, 0 ) ); vote.push_back ( s ); } } bool winner = false; size_t min_votes; map < string, size_t >::iterator c_iter, c_next; vector < list < string > >::iterator vl_iter; while ( !winner ) { c_iter = candidates.begin ( ); while ( c_iter != candidates.end ( ) ) { cout << "clearing votes for " << c_iter->first << endl; c_iter->second = 0; ++c_iter; } vl_iter = votes.begin ( ); while ( vl_iter != votes.end ( ) ) { list < string >::iterator v_iter ( vl_iter->begin ( ) ); while ( v_iter != vl_iter->end ( ) ) { c_iter = candidates.find ( *v_iter ); if ( c_iter != candidates.end ( ) ) { ++( c_iter->second ); break; } ++v_iter; } ++vl_iter; } c_iter = candidates.begin ( ); min_votes = c_iter->second; winner = true; while ( c_iter != candidates.end ( ) ) { cout << c_iter->first << " has a total of " << c_iter->second << " votes" << endl; if ( c_iter->second != min_votes ) { winner = false; } if ( c_iter->second < min_votes ) { min_votes = c_iter->second; } ++c_iter; } if ( winner ) { if ( candidates.size ( ) > 1 ) { cout << endl << "TIE, WINNERS WERE:" << endl; } else { cout << endl << "WINNER:" << endl; } } c_iter = candidates.begin ( ); while ( c_iter != candidates.end ( ) ) { c_next = c_iter; ++c_next; if ( winner ) { cout << c_iter->first << endl; } else if ( c_iter->second == min_votes ) { cout << c_iter->first << " has been removed from the running" << endl; candidates.erase ( c_iter ); } c_iter = c_next; } } return 0; }

1 0

CVS problems
by Jonathan Turkanis 08 Apr '05

08 Apr '05

Hi, I'm getting "No space left on device" errors, apparently referring to the remote server, while trying to checkout boost via anonymous CVS. Who should I report this to? Jonathan

4 4

[Ann] Proposed Math library additions (complex number inverse trig functions).
by John Maddock 08 Apr '05

08 Apr '05

As part of the project to produce a Boost TR1 implementation I've implemented the additional algorithms in <complex> that are part of the TR: fabs asin asinh acos acosh atan atanh It occurs to me that maybe these should really be spun out as a separate library rather than "slipped in" as part of another submission (comments welcome on that). In the mean time these algorithms can be downloaded as part of the TR1 library here: http://boost-sandbox.sourceforge.net/vault/index.php?&direction=0&order=&di… All the inverse trig functions are defined for the full complex plain, and do the right thing even for exceptional input (no overflow or underflow during the computation if the result is actually representable). They also do the right thing for infinities and nan's, as specified by C99. The asin/asinh/acos/acosh algorithms have a theoretical max error bound of 9.5e (experimental bounds are much lower, about 4e), there is no theoretical work on atan/atanh that I know of, but experimentally the error bound seems lower than for asin/acos. This is some of the most heavily commented code I've written, so refer to the header for more information on the literature sources used etc. During the implementation I found that I needed a few other things that might make useful Boost components (part implemented, part wish list as noted below): log1p: ~~~~ This algorithm is part of C99, but by no means all compilers support it yet, I used a Taylor series expansion for small x: I'm aware that there are much more efficient methods, but optimizing compilers completely trash the logic of these (Intel C++ proved to be particularly bad). Series Summation (Kahan Method): ~~~~~~~~~~~~~~~~~~~~~~~~ I wrote a small routine to apply the Kahan summation method to a nullary-functor that generates successive terms in a series. Summation stops when the next term is below a particular threshold. I've found the Kahan method to be significantly more accurate for certain series, but again some highly optimizing compilers can cause small errors to creep in (I believe that the issue is double-rounding of intermediate terms on machines with extended-double registers). Probably my current interface to this one needs some more thought before it could be anything other than a detail, and if we're talking about wish lists, infinite product, and continued fraction evaluation would be useful additions too.... Floating point testing: ~~~~~~~~~~~~~~ Currently just a version of C99's isnan, and only works for quiet nan's with IEEE-conforming compilers. More of a wish list really, I could really use all the C99 fp-testing macros (as C++ functions obviously). Numeric constants: ~~~~~~~~~~~~~ Currently I've embedded the numeric constants used inside the implementation, a numeric constants library really would have simplified things... just a pity we could never agree on an interface last time this came up. Whew, I think that's all, thanks for reading this far! Regards, John.

2 6

[Wave] Library updated, test suite in place
by Hartmut Kaiser 08 Apr '05

08 Apr '05

Hi all, after Wave was accepted into Boost I've fixed all of the things mentioned during the review and reported afterwards by different people (thanks a lot for all the comments and help I've got!). Here are the main points: - I've fixed all the problems reported during the review and tried to incorporate all of the remarks done there as well. - The first version of a test suite was implemented and is integrated into the Boost regression process. This test suite currently consists out of more than 100 different unit tests from 2 categories: . Systematic testing of all aspects of the preprocessor as described in the Standard . Set of regression tests collected during the development of Wave over th elast couple of years. The test system is very flexible and is easy to extend. In the future I'll add even more unit tests to check even more details. Since it was asked here before: the test suite currently takes a couple of seconds to execute. The integration of Wave into the regression test procedure revealed some portability issues which I'm currently trying to resolve. - A new sample lexed_tokens was added. It shows how to use one of the C++ lexers included with the library only (without using the C++ preprocessing component). For the details see the Changlog file here: http://tinyurl.com/4fu8m. Overall, I think Boost.Wave is ready for prime time now and can be included into the next Boost release. Regards Hartmut

1 0