- Boost - lists.boost.org

[Report] 36 regressions on RC_1_34_0 (2007-03-16)
by Douglas Gregor 16 Mar '07

16 Mar '07

Boost Regression test failures Report time: 2007-03-16T03:15:54Z This report lists all regression test failures on release platforms. Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/i… 36 failures in 4 libraries iostreams (6) optional (6) parameter (1) python (23) |iostreams| bzip2_test: msvc-7.1 msvc-8.0 gzip_test: msvc-7.1 msvc-8.0 zlib_test: msvc-7.1 msvc-8.0 |optional| optional_test: msvc-6.5 msvc-6.5 msvc-6.5_stlport4 msvc-7.0 optional_test_ref_fail2: msvc-7.1 msvc-8.0 |parameter| python_test: gcc-cygwin-3.4.4 |python| builtin_converters: gcc-3.4.5_linux gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 import_: cw-9.4 gcc-mingw-3.4.2 gcc-mingw-3.4.5 intel-vc71-win-9.1 msvc-6.5 msvc-6.5 msvc-6.5_stlport4 msvc-7.0 msvc-7.1 msvc-7.1 msvc-7.1 msvc-7.1_stlport4 msvc-8.0 msvc-8.0 msvc-8.0 map_indexing_suite: gcc-3.4.5_linux gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64

1 0

[Boost-bugs] [ boost-Bugs-1682161 ] iostreams file_descriptor::write fails under Win32
by SourceForge.net 16 Mar '07

16 Mar '07

Bugs item #1682161, was opened at 2007-03-16 07:30 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=1682161&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: None Status: Open Resolution: None Priority: 5 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: iostreams file_descriptor::write fails under Win32 Initial Comment: in 1.33.1, file_descriptor::write(), append mode implemented as #ifdef BOOST_IOSTREAMS_WINDOWS if (pimpl_->flags_ & impl::has_handle) { if (pimpl_->flags_ & impl::append) { ::SetFilePointer(pimpl_->handle_, 0, NULL, FILE_END); if (::GetLastError() != NO_ERROR) throw detail::bad_seek(); it is common mistake to call GetLastError() without checking function return value first. MSDN has special note for SetFilePointer(): "Note If the function returns a value other than INVALID_SET_FILE_POINTER, the call to SetFilePointer has succeeded. You do not need to call GetLastError." So, file_descriptor::write() fails, if there is old uncleaned "last" error Regards, valeri.antonov(a)gmail.com ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1682161&group_… ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys-and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[ping] The review of Intrusive library started March 12
by Joaquín Mª López Muñoz 16 Mar '07

16 Mar '07

As we approach the mid review of Ion Gaztañaga's Intrusive library, I would like to encourage you to consider submitting your review reports. So far we've received three reviews only, I hope more Boost members step in and contribute to this global effort which constitutes the cornerstone of Boost renowned quality standards. If you love and use Boost, remember that active involvement is a nice way of repaying the benefit you have obtained from this community. If you plan to submit a review before the deadline but are still working on it, I'd appreciate receiving a short notice so that I can estimate the final number of reviewers. Also, if you'd like to do a review but can't do it on time, please let me know so as to consider the possibility to ask for a period extension. The Review Manager, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

Re: [boost] Copy editing documentation
by Nava Whiteford 16 Mar '07

16 Mar '07

> >I'm reading though the boost unit testing documentation at: > > > >http://www.boost.org/libs/test/doc/components/utf/index.html > > > >It's good, but I think could probably do with some basic copy > >editing. As I'm reading though it anyway I'd be happy to do it, is this ok? What > >procedure should I follow to do this? > > I've alrady tried to do this, but failed because it is generated using > Dreamweaver. Unless you have this software, and devise a > CVS/SVN method of working togther with others, especially Gennadiy, it's > difficult to work jointly. (This is why using Boost.Book > aka Quickbook/Docbook is a more promising methodology) Well, I've been asked to teach a short course on unit testing in C++. I might consider converting this in to DocBook format if it becomes useful for me. Btw, how widely is the Boost Unit testing library used? It seems that many libraries in Boost opt not to use it? > IMO, it is also the *structure* of the documentation that is causing most > difficulty. I'd be interested in hearing your views. As an aside could the class documentation not be generated directly from the source using something like Doxygen?

12 20

[Boost-bugs] [ boost-Feature Requests-1681992 ] provide detach() function for shared pointer
by SourceForge.net 16 Mar '07

16 Mar '07

Feature Requests item #1681992, was opened at 2007-03-16 03:32 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=357586&aid=1681992&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: smart_ptr Group: None Status: Open Resolution: None Priority: 5 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Peter Dimov (pdimov) Summary: provide detach() function for shared pointer Initial Comment: I suggest that we should provide a new method T* detachPtr() for shared_ptr to let the shared_ptr pass owner ship to other fuctions or applications. It is a comman case that user will have to let the share_ptr give up the owenership of the objec, pass the object to other application let that application take care the objcet's life. But there is no method to do so. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=357586&aid=1681992&group_… ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys-and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[Sorting] Vault files
by Sam Schetterer 16 Mar '07

16 Mar '07

I have uploaded a zip file containing documentation and source code for my high-speed sorting library to Vault.

1 0

Re: [boost] Any interest in a sorting library with a multitude of sorts?
by Sam Schetterer 16 Mar '07

16 Mar '07

On March 14, 2007, Ben Bear wrote: >I'm care for how many times of collecting the radix sort needed while >sort some very long string, such as "012..9abc..zABC..Z". > >2007/3/14, Giovanni Piero Deretta < gpderetta(a)gmail.com>: > On 3/14/07, Michael Marcin < mmarcin(a)method-solutions.com> wrote: > > Giovanni Piero Deretta wrote: > > > > > > Isn't sort + stable sort enough? > > > > > > Do we really need specialized interfaces for these? > > > > > > > I for one would like a generic radix sort where I could specify the number > > of bits to grab and where in a UDT to grab each bit or a range of bits from. > > > > Do you really see no use for a O(n) sorting algorithm? > > > > I was speaking about the various "reverse sort", "sort by field", > "sort by two fields" etc. I definitely think that a radix sort would > be useful. > > gpd > _______________________________________________ To answer your question, "Three-way radix quicksort uses 2N ln N byte comparisons, on the average, to sort N (arbitraily long) keys."(Sedgewick 446). There is your answer. The running time of radix quicksort is k + 2N ln N, where N is the number of keys, and k is the number of bytes. Normal quicksort has a running time of k(2N ln N), with the same variables. To answer your question for radix sort, you would not use it for strings. If you did, however, then the number of collection times would be kN, where k is the number of bytes and N is the number of items.

1 0

Any interest in a sorting library with a multitude of sorts?
by Sam Schetterer 16 Mar '07

16 Mar '07

This sorting library would have quicksorts, radix quicksorts, radixsorts, mergsorts, a sorted-array class, and an interface class to be inherited from to allow sorting. _________________________________________________________________ Find a local pizza place, movie theater, and more.then map the best route! http://maps.live.com/?icid=hmtag1&FORM=MGAC01

7 8

[Smart Pointers] typo in documentation?
by Yuriy Koblents-Mishke 15 Mar '07

15 Mar '07

Quote: "The smart pointer library provides --five-- smart pointer class templates..." http://boost.org/libs/smart_ptr/smart_ptr.htm Is not it --six-- ? The same in http://boost.org/libs/libraries.htm Memory ... smart_ptr - ---Five--- smart pointer class templates, from Greg Colvin, Beman Dawes, Peter Dimov, and Darin Adler. ...

1 0

[Sorting Library] Implementation of sorting API
by Sam Schetterer 15 Mar '07

15 Mar '07

Earlier, I asked if users would like to be able to define their own operators of if they wanted to redefine functions inherited from a interface class. I have decided to have users define their own operators because it is simpler, uses less space, is faster, and the sorting functions are easier to understand.

1 0