Support Requests item #748869, was opened at 2003-06-04 14:10
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=207586aid=748869group_id=7586
Category: None
Group: None
Status: Open
Hi,
I am a newbie to boost, and I don't know if this issue has been addressed.
I am trying to build the boost libraries on a Win2k machine with MSVC++ 6
installed, so I downloaded bjam, added it to the path, added the boost
libraries path to the include path and started the build with the
Support Requests item #748903, was opened at 2003-06-04 14:57
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=207586aid=748903group_id=7586
Category: None
Group: None
Status: Open
Vladimir Prus wrote:
There've been a fair amount of suggested changes, many of which are
documented on Wiki [1], and since the author himself keeps track of
the issues, I won't reiterate them here - except for stressing the
need for
a) extensively reworked and extended documentation,
Daryle Walker wrote:
I fixed up the I/O library I had reviewed a few months ago. It was
some little things last week, but some big documentation and testing
this week. It's in the sandbox if you want to try it out.
Looking at today's version in the sandbox, I still see the following
Aleksey Gurtovoy wrote:
b) resolving the 'wchar_t' support issue before the library makes
into official Boost distribution.
I'm actually not that happy about solving general issue alone...
You don't have to. I am sure a lot of people on this list have dealt
with the issue and would
At 02:10 AM 6/5/2003, Daryle Walker wrote:
On Wednesday, June 4, 2003, at 3:54 PM, Beman Dawes wrote:
Hum... I just had a thought. Is it possible to detect if wchar_t is a
typedef at compile time?
Yes, I think so. Won't boost::is_same unsigned short, wchar_t
::value be true if wchar_t is a
[2003-06-04] Adrian Michel wrote:
Hi,
I am a newbie to boost, and I don't know if this issue has been addressed.
I am trying to build the boost libraries on a Win2k machine with MSVC++ 6
installed, so I downloaded bjam, added it to the path, added the boost
libraries path to the include path
Bohdan wrote:
Recently i heard something about Double Dispatch within FSM discussion.
Sorry for bothering, but where can i find something about it ?
Sources/Article ?
Thanks for help.
In addition to other references, you might find the following paper
submitted to ISO in the post-Oxford
I'm baffled that they want to penalize (time and space) those for whom a
naked semaphore works. It's blatantly clear to anyone who's had to write a
mutex that it's additional code on TOP of a semaphore.
we always implemented semaphore first, then added the mutex wrapper for
those who needed
Maybe the /EHa option will help.
Paul A. Bristow wrote:
This now looks very extensively tested. But when I tried to build the test.cpp
using MSVC 7.0 and Boost 1.30, there are zillions of errors from the test
modules. Do I need to use a more recent version of the test code?
Thanks
Paul
a poor implementation is no reason to ass/u/me that the concept is poor
At Wednesday 2003-06-04 12:23, you wrote:
Nicolas Fleury wrote:
[...]
http://google.com/groups?selm=3CED3306.DF6DB829%40web.de
(Subject: Re: many semaphores)
Would it be possible to post some code that experience has
Victor A. Wagner, Jr. wrote:
I'm baffled that they want to penalize (time and space) those for whom a
naked semaphore works. It's blatantly clear to anyone who's had to write a
mutex that it's additional code on TOP of a semaphore.
Optimization stratergies aside (they are different for
Ooops, sorry ... i was terribly unclear.
Andreas Huber wrote:
boost::fsm no longer uses acyclic visitor! The current double dispatch
implementation (which was inspired by Aleksey's fsm lib) uses one virtual
call followed by a linear search for a suitable reaction, using one RTTI
comparison per
Victor A. Wagner, Jr. wrote:
I'm baffled that they want to penalize (time and space) those for whom a
naked semaphore works.
Show me please an example illustrating naked semaphore in work.
It's blatantly clear to anyone who's had to write a
mutex that it's
Hi,
Victor A. Wagner, Jr. wrote:
I've also never actually _seen_ the implementation of a semaphore with a
mutex and a condition variable, and don't readily envision it.
Well...
My university background considering synchronization was based on Modula
and some abstract course where semas and
Alexander Terekhov wrote:
Victor A. Wagner, Jr. wrote:
I'm baffled that they want to penalize (time and space) those for whom a
naked semaphore works. It's blatantly clear to anyone who's had to write a
mutex that it's additional code on TOP of a semaphore.
Optimization stratergies aside (they
In this comp.lang.c++.moderated thread
(http://www.google.com/groups?selm=2045294.t6ppZr3Erj%40technoboredom.net),
there was the following request:
--- Start quote ---
For some reason (I want to pass function pointers to certain libraries) I'd
like to convert a member function into a real
Sorry, I forgot - as with all Boost test-suite examples, language extensions
MUST be enabled (and also /EHa option for WINNT).
Now OK MSVC 7.1 with Boost 1.30 at warning 3 and a few warnings at level 4 (from
your test.cpp - lots from the test suite, but this is probably inevitable).
Paul
Paul A
Gregory Colvin wrote:
[...]
Let's say:
- you can easily detect weither an object was allocated on the stack
or on
the heap;
- a smart pointer contained within an object can somehow access it's
object
header when the object was allocated on the heap with a placement
operator
new();
Hello,
I've got a struct derived from boost::default_dfs_visitor that I've been
using w/out any problems in an invocation of boost::depth_first_search.
The call that works looks like:
boost::depth_first_search(g, boost::visitor(MyDfsVisitor));
^- NP. compiles and executes fine.
Now I'm trying to
Scott,
Specification and Description Language also known as ITU Z.100. Check
it
out at;
http://www.sdl-forum.org/SDL/
Thanks for the link. I've had a look at the SDL-2000 slide show.
http://www.informatik.hu-berlin.de/~holz/SDLTutorial/SDL2000Tutorial.zip
AFAICT, SDL FSMs are *very*
Terje Slettebø [EMAIL PROTECTED] wrote in message
news:[EMAIL PROTECTED]
[snip]
int main()
{
function_ptrint (A*, int), A::a_member fn;
// The rest the same
A a;
int r=fn(a, 3); // sets r to 9
}
Is it similar (in principle) to
Bohdan,
Ooops, sorry ... i was terribly unclear.
Andreas Huber wrote:
boost::fsm no longer uses acyclic visitor! The current double
dispatch implementation (which was inspired by Aleksey's fsm lib)
uses one virtual call followed by a linear search for a suitable
reaction, using one RTTI
From: Pavel Vozenilek [EMAIL PROTECTED]
Terje Sletteb [EMAIL PROTECTED] wrote in message
news:[EMAIL PROTECTED]
[snip]
int main()
{
function_ptrint (A*, int), A::a_member fn;
// The rest the same
A a;
int r=fn(a, 3); // sets r to 9
}
Is it similar (in principle)
Philippe A. Bouchard wrote:
[...]
Let's say the placement operator new is using malloc(), then we could
do
some reverse lookup into mallinfo to find the heap block in which some
address is related to. This information could then be cached into
the smart pointer itself making
this is a product i used a few years ago. its a pretty complete
implementation
of SDL - you draw SDL, push a button and it generates the target system
in C (that's what the brochures say ;-). it is very much targeted at large
communities of FSMs.
the sort of thing that i queried a while ago
I see the need for two new configuration macros. The need popped up
when I was trying to add a copy constructor to a stream buffer template
class (for completeness) but GCC blocked it.
The std::basic_streambuf class template and the std::ios_base class
don't mention any copying semantics in
Stefan Seefeld wrote:
[...]
But binary semaphore are only a (small) subclass of semaphores, and I'd
use semaphores mostly to represent value *and* lock, where the value's
domain is larger than just 1/0.
Show me some code. I mean something that shows why do you need counting
semas.
regards,
David Abrahams [EMAIL PROTECTED] wrote:
but the installer I used puts it in
C:\Program Files\Microsoft VisualStudio .NET
I think you missed yet another space
C:\Program Files\Microsoft Visual Studio .NET
^
B.
In message [EMAIL PROTECTED], Terje Slettebø
[EMAIL PROTECTED] writes
From: Pavel Vozenilek [EMAIL PROTECTED]
lexical_cast constructs and destroys std::stringstream
(including dynamic memory allocation/free.)
each time a conversion is done.
Maybe specialised version of lexical_cast can be
I am a newbie to boost, and I don't know if this issue has been addressed.
I am trying to build the boost libraries on a Win2k machine with MSVC++ 6
installed, so I downloaded bjam, added it to the path, added the boost
libraries path to the include path and started the build with the command
I see the need for two new configuration macros. The need popped up
when I was trying to add a copy constructor to a stream buffer template
class (for completeness) but GCC blocked it.
The std::basic_streambuf class template and the std::ios_base class
don't mention any copying semantics in
Bugs item #749762, was opened at 2003-06-05 15:14
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=107586aid=749762group_id=7586
Category: None
Group: None
Status: Open
Resolution: None
Alexander Terekhov [EMAIL PROTECTED] writes:
So quit complaining ineffectively and submit a DR with suggested
wording changes. [That is a non-boost issue, BTW. If you want to
discuss it, you should take it elsewhere]
I've just forwarded to you my reply to a message that I was asked to
NOT
Bronek Kozicki [EMAIL PROTECTED] writes:
David Abrahams [EMAIL PROTECTED] wrote:
but the installer I used puts it in
C:\Program Files\Microsoft VisualStudio .NET
I think you missed yet another space
C:\Program Files\Microsoft Visual Studio .NET
Correct.
--
Dave Abrahams
Boost
Apologies - this is a _user_ list question. I've moved the discussion to the
appropriate list. Please don't continue this thread here. - Regard Chris
___
Unsubscribe other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Does/will program options support this style:
-w1=10 -w2=20
w1 and w2 are options (with args) that act just the same as long options, but
use a single '-' instead of the usual '--'.
___
Unsubscribe other changes:
Neal,
Neal D. Becker wrote:
Does/will program options support this style:
-w1=10 -w2=20
w1 and w2 are options (with args) that act just the same as long options,
but use a single '-' instead of the usual '--'.
this style is supported already. The 'cmdline::allow_long_disguise' style
To all,
Today is the start of the formal review of the Math Constants library by
Paul Bristow. The review will run until Sunday June 15th. I will be serving
as review manager.
The Math Constants library is a collection of very accurate mathematical
constants for C ++ (and C) programs. These are
Currently (last I tested) program options when used with variable map will set
bool options to false even though they were not specified on the command
line. What I'd prefer is that all options be left alone unless they are set
on the command line. I've been bitten by this unexpected
Does anyone else think it's confusing that:
const float e = 0.5772156649015328606065120900824024310422F; // Euler e
I would have expected e to be 2.71828...
___
Unsubscribe other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Neal D. Becker wrote:
Currently (last I tested) program options when used with variable map will
set bool options to false even though they were not specified on the
command
line. What I'd prefer is that all options be left alone unless they are
set
on the command line. I've been bitten
On Friday 06 June 2003 10:10 am, Vladimir Prus wrote:
Neal D. Becker wrote:
Currently (last I tested) program options when used with variable map
will set bool options to false even though they were not specified on the
command
line. What I'd prefer is that all options be left alone
Neal,
Yes, that's true. All bool options implicitly have default value of
false. In fact, I think this is quite reasonable. Unless some switch is
on, it's off. This saves the user the need to check if option is present.
Could you describe how this behaviour has bitten you? There's probably a
AFAICT, a serious omission is that it doesn't say the DAG must have
nonnegative edge weights.
--
Dave Abrahams
Boost Consulting
www.boost-consulting.com
___
Unsubscribe other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Gregory Colvin wrote:
On Wednesday, Jun 4, 2003, at 08:22 America/Denver, Philippe A.
Bouchard wrote:
Greetings Boost,
I am not that much familiar with garbage collection techniques so
please
excuse me if the technique I am thinking of is already used
somewhere.
[...]
What do you
Neal D. Becker wrote:
On Friday 06 June 2003 10:39 am, Vladimir Prus wrote:
Neal,
[...]
I can appreciate the usefulness of the current behavior, and I also
know that there is a workaround (.default_value(true)), but this only
works if you notice the unexpected behaviour!
The only
IMHO a very useful addon to your library can be routine
to convert class to function which calls class destructor.
code
template typename T
void destruct( void * buf )
{
reinterpret_castT*(buf)-~T();
}
typedef void (*destruct_fn_type)( void * buf );
//like
Jan,
I'm looking forward to the opportunity of having a close look
at your cyclic_buffer. But for now, a few perhaps shallow
comments...
1. How about push_front()? (in std::list style)
And pop_front()?
For the sake of generality.
The vague concept I have in mind is
On Fri, 6 Jun 2003 06:45:45 -0700, Jaap Suter
[EMAIL PROTECTED] wrote:
To all,
Today is the start of the formal review of the Math Constants library by
Paul Bristow. The review will run until Sunday June 15th.
I tried to have a look but was assailed by a fairly large amount of
material :-) Can
OK - Sorry I have chosen a poor example -
I should have stuck to pi throughout!
but I hope the review can concentrate on what emerged previously
as the _really_ tricky issue of how to _present_ the values in C++,
before we tackle the much easier,
(if still contentious) issue of individual names
Alexander Terekhov [EMAIL PROTECTED] writes:
Okay. But fix the http://www.boost.org/more/error_handling.html;, please.
I don't think there's anything to be fixed, but if you post a patch
I'll happily consider it.
FYI, Forward-Inline
snip
Would you vote against it? Why?
I'm not going to
David Abrahams wrote:
Alexander Terekhov [EMAIL PROTECTED] writes:
Okay. But fix the http://www.boost.org/more/error_handling.html;, please.
I don't think there's anything to be fixed, but if you post a patch
I'll happily consider it.
Yeah. open source.
FYI, Forward-Inline
From: Bohdan [EMAIL PROTECTED]
IMHO a very useful addon to your library can be routine
to convert class to function which calls class destructor.
snip
//no virtual functions, no runtime polymorphism
void * ptr = new MyClass;
destruct_fn_type df =
I have several class templates for producing standard streambufs based on
classes with read, write and seek functions (or a suitable subset thereof.)
I have used them successfully to access tcp connections, cryptographic
routines, OLE compound documents, zip files, etc.
There are
Did you read this:
http://www.boost.org/tools/build/msvc-tools.html
Boost.Build - msvc toolset
Thanks - this solved the build problem.
I build and run some of the thread samples, and they cause memory leaks.
Actually, just including the thread.hpp file, linking with the appropriate
Andreas Huber [EMAIL PROTECTED] wrote in message
news:[EMAIL PROTECTED]
You can find Aleksey's fsm lib here:
http://www.mywikinet.com/mpl/fsm_example_25_jul_02.zip
In my library, you can look for simple_state::react_impl() which is the
override for the abstract state_base::react_impl(). The
Roland Richter [EMAIL PROTECTED] writes:
David Abrahams wrote:
This is going to break every boost library and every user which is
depending on the current CVS version of iterator_adaptors. The new
adaptors are so much better designed and easier to use that making the
transition should be
SourceForge.net [EMAIL PROTECTED] writes:
I am using boost_1_30_0 under Linux 9 on a PC.
The compiler complains
/home/mcobb/boost_1_30_0/boost/type_traits/detail/is_mem_fun_pointer_impl.hpp:47:
parse
error before `' token
What compiler?
line 47 is
template class R, class T ,
Daryle Walker [EMAIL PROTECTED] writes:
What about people that don't read these mailing list, and won't find
out about this change until they download 1.31? Will the current
versions be kept in a depreciated directory (for at least/most one
release) so those users can have a gentler
Hi Nigel!
Quoting Nigel Stewart [EMAIL PROTECTED]:
Jan,
I'm looking forward to the opportunity of having a close look
at your cyclic_buffer. But for now, a few perhaps shallow
comments...
1.How about push_front()? (in std::list style)
And pop_front()?
For the sake of
Alexander Terekhov wrote:
Show me some code. I mean something that shows why do you need counting
semas.
I'm using a bounded task queue (with the producer/consumer pattern),
where the queue is implemented with std::queue, a mutex, and two semaphores.
One semaphore counts the available tasks, the
On Thursday 05 of June 2003 15:38, Vladimir Prus wrote:
Aleksey Gurtovoy wrote:
I think the general conclusion was that one should be able to use both
'char' and 'wchar_t' versions of the library facilities in the same
program.
Ehm... in fact I gleaned quite the opposite conclusion, and
I currently vote neither yes nor no. I just need to get a better
understanding of what is intended to be included into boost from the files
provided.
On Fri, 06 Jun 2003 19:21:08 +0200, Paul A Bristow wrote:
but I hope the review can concentrate on what emerged previously as the
_really_
Hi Jan,
1. How about push_front()? (in std::list style)
And pop_front()?
Imagine you have a cyclic buffer which is full. When you add (push_back or
insert) a new item into this buffer the first (oldest) item will be removed.
Ahh, I see that your conceptualisation is based on
66 matches
Mail list logo
