- Boost - lists.boost.org

const_pointer_cast for shared_ptr
by Colin Rafferty 05 Aug '04

05 Aug '04

I would like to propose adding const_pointer_cast<> to shared_ptr, in exactly the same way that there is dynamic_pointer_cast<> and static_pointer_cast<>. I am surprised that it is missing. Is there a reason for that? If not, I will submit a patch that implements this. Thanks. -- Colin

5 4

[Boost-bugs] [ boost-Bugs-1003889 ] tokenizer and signed char
by SourceForge.net 05 Aug '04

05 Aug '04

Bugs item #1003889, was opened at 2004-08-05 04:41 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=1003889&group_… Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: tokenizer and signed char Initial Comment: boost::tokenizer incorrect works on platforms on which plain char is signed. For example, at least in boost::char_delimiters_separator::is_nonret should be explicit conversion from char type to int type. Something like this std::isspace (std::char_traits<Char>::to_int_type(E)). Minimal reproducer for this issue which uses Russian letters results in assert in MSVC 7.1: // cl /Zi /MDd -D_DEBUG test.cpp #include <boost\tokenizer.hpp> #include <string> #include <iostream> using namespace std; using namespace boost; int main() { string s = "Здравствуй мир!"; tokenizer<> tok(s); for (tokenizer<>::iterator beg=tok.begin(); beg! =tok.end();++beg) { cout << *beg << "\n"; } } ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1003889&group_… ------------------------------------------------------- This SF.Net email is sponsored by OSTG. Have you noticed the changes on Linux.com, ITManagersJournal and NewsForge in the past few weeks? Now, one more big change to announce. We are now OSTG- Open Source Technology Group. Come see the changes on the new OSTG site. www.ostg.com _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

CVS snapshot problems (Was: [Boost-docs] Re: howto include .xml from doxygen autodoc into html from boostbook)
by Aleksey Gurtovoy 05 Aug '04

05 Aug '04

David Abrahams writes: > Larry Evans <cppljevans(a)cox-internet.com> writes: > > > [snip] > >> I've checked in a potential fix. By the way, which version of > >> Doxygen are you using? > > Since I was having trouble with boost-cvs, I downloaded the tar.bz2 > > file: > > http://www.boost-consulting.com/boost.tar.bz2 > > That might be several days old. I've been periodically getting > messages from my cron job that the tar.bz2 it downloads from SF is > corrupted. That's pretty bad, especially given that it's supposed to be an *hourly* snapshot. A few people are running regressions against it under this assumption. Should we provide an alternative resource for them? -- Aleksey Gurtovoy MetaCommunications Engineering

1 0

Re[3]: [boost] Re: Re[2]: Re: Windows MSVC thread exit handlerfor staticlylinkedBoost.Thread
by Ferdinand Prantl 05 Aug '04

05 Aug '04

Hi Roland, _RTLDLL reminds me of borland or some other compiler, microsoft sets _DLL internally, if you use dynamic runtime (/MD or MDd). some essential for threading: if _MSC_VER: microsoft or intel (__INTEL_COMPILER for intel specific) then _MT: if multithreaded runtime then _DLL: if dynamic runtime Ferda > -----Original Message----- > From: boost-bounces(a)lists.boost.org > [mailto:boost-bounces@lists.boost.org] On Behalf Of Roland > > Just beeing curious. How does the _RTLDLL getting set? > I experimented with > #ifdef _RTLDLL > #error "DLL RT" > #else > #error "STATIC RT" > #endif > > No matter which runtime I select it always seems not to be defined. > > Roland

2 1

RE: [boost] VC 7.1 level 4 warnings (thread, lexical_cast)
by Brian Braatz 05 Aug '04

05 Aug '04

Paul A Bristow Wrote: > And I also note that there was an deficiency in lexical cast which, AFAIK > as > not been fixed. We don't seem to have the mecahnism for maintenance > working > as well as initial review, if the original author loses interest - an > increasing problem? [Brian Braatz] Suggestion: Identify those orphaned libraries in one place (one email) Communicate to this group the orphaned libraries Ask for volunteers to maintain said libraries

2 1

Re: Boost Mathematicians
by Michael Stevens 05 Aug '04

05 Aug '04

Hi Dave, hi all, I read with interest you plans for reviving MTL. It is certainly a shame that development of MTL was been stagnant for so long. It certainly had many interesting design features and I used it for all my work for many years. That said I switched to using and developing uBLAS long ago and it has an excellent design. On Saturday 05 June 2004 13:53, David Abrahams wrote: > "Neal D. Becker" <ndbecker2(a)verizon.net> writes: > > David Abrahams wrote: > >> Tom Brinkman <reportbase(a)yahoo.com> writes: > >>> In short, lets tell the world that this is the > >>> premiere place for advanced mathmatical library > >>> development, as I believe that it could be. > >>> > >>> Comments? > >> > >> 1. I think oonumerics.org has the jump on us here, though the site > >> seems to be douwn at this moment. > >> > >> 2. I will be starting work on a rewrite of MTL (the Matrix > >> Template Library) for linear algebra soon. > > > > What do you plan for MTL? How is it different than ublas? > > MTL is aimed at linear algebra, whereas IIUC ublas is not. Well the L and A in uBLAS certainly stand for Linear Algebra! Of course the B stands for Basic and uBLAS's primary aim is to provide the standard set of BLAS functions in a modern C++ environment. Of course as it stands the complete uBLAS library is more then just the BLAS functions and includes some common Linear Algebra algorithms and many useful types. That said I think it is important to separate BLAS functions from domain specific linear algebra algorithm development. This is something that proved itself since the seventies. > There's a lot more to what's in the current plan than I can lay out > here, but the focus will be on support for different kinds of matrices > with combinations of these aspects > > o Shape > o Orientation > o Symmetry > o Sparsity > o Blocking > o Upper / Lower storage > o Unit diagonal Other then the many forms of blocking (other then banded) uBLAS supports all these in its design. This really is its strength! To a large extent they can even be combine these properties where it makes mathematical sense. For example you can wrap up one of a number of sparse matrix types in a symmetric adaptor. > > and operations like: > > o scalar-vector (vector-scalar) multiplication > o vector addition (and subtraction) > o apply linear operator (left) > o norm > o inner product > o triangular solve Other then 'apply linear operator' these are all in uBLAS! > with expression templates, and of course, zero abstraction penalty ;-) Of course uBLAS does this all with ET, but the abstraction penalty may not be zero :-) Other then the lack of ET in the current MTL the big difference between the two libraries is the definition of iterators. Neither design seems to be perfect with regard to efficiency. Since uBLAS is already in Boost and has a well established and clean user syntax it would seem strange to ignore it. For the perspective of building further Linear Algebra algorithms it would not be too hard to use the syntax sufficiently portably so that a future MTL with expression templates could not be used interchangeably. Michael -- ___________________________________ Michael Stevens Systems Engineering Navigation Systems, Estimation and Bayesian Filtering http://bayesclasses.sf.net ___________________________________

13 20

Boost.Test fails to build on IRIX/mipspro
by Aleksey Gurtovoy 05 Aug '04

05 Aug '04

See http://www.meta-comm.com/engineering/boost-regression/developer/test.html -- Aleksey Gurtovoy MetaCommunications Engineering

2 2

Boost License future considerations
by Michael Glassford 04 Aug '04

04 Aug '04

Thinking about the problems we're having now contacting people to get permission to switch to the Boost license, I got to wondering what would happen if at some point in the future the Boost license needed to be changed (for instance, due to some legal challenge). I assume the possibility of it changing was considered; after all, usually if you give something a 1.0 version number you leave open the possibility of a version 1.1 or 2.0. What could we do to avoid even worse problems if that ever happens? Would it make sense to have people add their names to a blanket permissions file (or add explicit permission in their submissions) that would allow the copyright for their submissions to be updated under certain circumstances in the event that they could not be contacted for permission? What legal issues would be involved in such a case? Just a thought, Mike

5 12

Review Wizard Status Report
by Tom Brinkman 04 Aug '04

04 Aug '04

1) Proposed Library Review Schedule We have eight very interesting libraries to consider for inclusion into boost the next few months. If there are no objections, I will schedule reviews for next four libraries, as follows: (please contact me for adjustments to this schedule) More IO - Daryle Walker August 18, 2004 Iostreams - Jonathan Turkanis August 28, 2004 Output Formatters - Reece Dunn September 7, 2004 Pointer Containers - Thorsten Ottosen September 17, 2004 Named Params - David Abrahams & Daniel Wallin To be Determined Wave - Hartmut Kaiser To be Determined Policy Pointer - David Held To be Determined Finite State Machine (FSM) - Andreas Huber To be Determined 2) Algorithm Mini-Reviews If there are no objections, I will also schedule a mini-review of some of the algorithms from wiki starting September15, 2004. The format of the boost algorithms review has yet to be established and will evolve over time. Please contact me if you have any suggestions as to how this first boost algorithms review proceeds. 3) Review Managers Needed Please contact me if you would like to serve as a review manager for a library under consideration for inclusion into boost. It would be greatly appreciated and is a great way for you to network with other boost users. Tom Brinkman Boost Review Wizard __________________________________ Do you Yahoo!? New and Improved Yahoo! Mail - 100MB free storage! http://promotions.yahoo.com/new_mail

4 3

RE: [boost] Review Wizard Status Report
by Rozental, Gennadiy 04 Aug '04

04 Aug '04

> 2) Algorithm Mini-Reviews > > If there are no objections, I will also schedule a > mini-review of some of the algorithms from wiki > starting September15, 2004. The format of the boost > algorithms review has yet to be established and will > evolve over time. > > Please contact me if you have any suggestions as to > how this first boost algorithms review proceeds. Does my submission get into this picture? > 3) Review Managers Needed > > Please contact me if you would like to serve as a > review manager for a library > under consideration for inclusion into boost. It > would be greatly appreciated > and is a great way for you to network with other boost > users. I am ready to help, though it's subject to schedule conflicts resolution. > > Tom Brinkman > Boost Review Wizard Gennadiy.

1 0