- Boost - lists.boost.org

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

Bug in boost::filesystem (1.33.1)
by Jorge Lodos 15 Mar '07

15 Mar '07

Hi The function BOOST_FILESYSTEM_DECL path system_complete( const path & ph ) in operations_posix_windows.cpp contains the following code: char buf[MAX_PATH]; char * pfn; std::size_t len = ::GetFullPathNameA( ph.string().c_str(), sizeof(buf) , buf, &pfn ); if ( !len ) { boost::throw_exception( filesystem_error( "boost::filesystem::system_complete", ph, "size is 0" ) ); } buf[len] = '\0'; If the full path name is larger than MAX_PATH, the last line will cause a buffer overflow. This bug is not present in 1.34. Best regards Jorge Lodos

1 0

[HEAD] [patch] BoostBook update WARNING for WIN32 in Python Script
by Dean Michael Berris 15 Mar '07

15 Mar '07

I just noticed that the WARNING for WIN32 users of BoostBook points to an old URL of the xslt-proc for win32. Attached is a trivial patch to change the warning. -- Dean Michael C. Berris http://cplusplus-soup.blogspot.com/ mikhailberis AT gmail DOT com +63 928 7291459

1 0

[Sorting] How would developers like me to implement the library?
by Sam Schetterer 15 Mar '07

15 Mar '07

Would users prefer that it is their own responsiblity to write the proper functions for a type or should a class be provided with virtual functions that are redefined as needed? Just wondering.

1 0