Andreas - good to see your submission. I briefly scanned it, and it looks
good :-) I'm hope to find some time to play with it in earnest.
Just wanted to comment on the UML/SDL comparison. I won't try to summarize
and relate to the earlier points, but here are a few thoughts:
1) I have a collea
Chris Russell wrote:
> [snip]
> Andreas wrote:
>
>> So, IMO there's no need for boost::fsm to provide communication
>> protocol primitives, because their functionality is pretty
>> orthogonal to what my library does. Users would want to use what
>> they're accustomed to. Most would presumably use b
Stefan Seefeld said:
> William E. Kempf wrote:
>
>> As soon as synchronization relies on *BOTH* a mutex and a sema/event,
>> you've got a race condition.
>
> hmm, I'm not sure I have the same definition for 'race condition' as you
> have. Of course I could write non-safe code that presents a race
William E. Kempf wrote:
As soon as synchronization relies on *BOTH* a mutex and a sema/event,
you've got a race condition.
hmm, I'm not sure I have the same definition for 'race condition' as
you have. Of course I could write non-safe code that presents a race
condition. Is your point that you wan
Stefan Seefeld said:
> William E. Kempf wrote:
>
>>>so what ? the 'real' queue length is kept private and doesn't matter
>>> much. It's the signaling of the semaphore that makes the change
>>> public.
>>
>>
>> This is a race condition. It also occurs when extracting data from
>> the queue. Wheth
[snip]
Andreas wrote:
> So, IMO there's no need for boost::fsm to provide communication protocol
> primitives, because their functionality is pretty orthogonal to what my
> library does. Users would want to use what they're accustomed to. Most
would
> presumably use boost::function.
>
... but giv
Maciej Sobczak wrote:
[...]
> What about providing both (condvars and semas), but with documenting
> known pros and cons?
Personally, I'd have no problems with some *separate* Boost.Semas (for
things meant to be done by the current POSIX/IPC semaphores: async-
signal-safe unlock operation, memor
Thank you so much John,
This is going to be extremely useful in helping me find the largest subset
of Boost that my company will allow me to use (license wise).
Regards,
Jaap Suter
> The bcp utility is a tool for extracting subsets of Boost, it's
> useful for Boost authors who want to distribut
Stefan Seefeld wrote:
[...]
> >>And then there is the other semaphore I use to count the free slots,
> >>which you didn't comment on, probably because it didn't fit into your
> >>arguments...
> >
> >
> > No, actually, it strengthens the argument, because you now have even more
> > state that needs
Dear Nicolas,
sorry for the late reply. Some other projects try to keep me busy.
First, I'd like to mention that in German-speaking countries, EDV
is a very common acronym for "Elektronische Datenverarbeitung"
("electronic data processing"), hence the library name might be
somewhat confusing
William E. Kempf wrote:
so what ? the 'real' queue length is kept private and doesn't matter
much. It's the signaling of the semaphore that makes the change public.
This is a race condition. It also occurs when extracting data from the
queue. Whether or not the "'real' queue length" is private
Stefan Seefeld wrote:
>
> Alexander Terekhov wrote:
>
> > I see that you're also "not fond" of following the links. Okay.
>
> that's starting to get annoying...
Yeah. My wife also says that this is something I do best. ;-)
>
> I did follow the links, I just don't happen to agree with what
>
+ Problems with MSVC++ 7.0 (as ever) and dereference (I guess this is
a problem with default types). Demonstrated with reverse_iterator:
int numbers[] = { 1,2,3,4,5,6,7 };
const int N = sizeof(numbers)/sizeof(int);
std::vector v( numbers, numbers + N );
typedef boost::reverse_iterator<
Stefan Seefeld said:
> Alexander Terekhov wrote:
>> This is far from elegant, because the queue data structure already
>> knows the number of messages either implicitly or with an extra
>> counter of its own.
>
> well, I need to know it explicitely when I want to extract the next one,
> so either
Hi,
Alexander Terekhov wrote:
and, believe
me, you'll realize rather quickly that monitors based on MESA/POSIX condvars
are much, much better than anything you could do with semas
I understand your point.
I have been using Windows API *before* I got a chance to read
"Programming with POSIX Thr
Hi all
I found that boost has very powerful configuration system
(boost/config.hpp and around...)
but why use macros?
there is another solution described here, let discuss it...
may be there are some troubles, invisible for me, that prevent from using
this technique
in libraries like boost?
/**
Alexander Terekhov wrote:
I see that you're also "not fond" of following the links. Okay.
that's starting to get annoying...
I did follow the links, I just don't happen to agree with what
was said there. No need to paste it again here.
This is far from elegant, because the queue data structure al
Bravo, John ! I have been hoping someone would come up with a way by which
developers could figure out fairly easily what part of Boost might need to
be distributed if only a single or a few Boost libraries were being used.
John Maddock wrote:
> Folks,
>
> I've put together a small tool for managi
--- Douglas Gregor <[EMAIL PROTECTED]> wrote:
Hi Doug,
> If you could figure out what alignment value you're trying to get a type for
> it would help greatly. One way you could do it would be to replace the
> static assertion lines with something that will halt the compile and give
> back the Ali
Maciej Sobczak wrote:
>
> Hi,
>
> Alexander Terekhov wrote:
>
> > Show me some code. I mean something that shows why do you need counting
> > semas.
>
> This wording is too strong. Going this way, we can *always* say that
> feature X is not deadly needed and can be replaced by two or more
> (p
On Sat, 7 Jun 2003, John Maddock wrote:
> A while ago Beman produced header dependency tables, unfortunately these
> began to get rather complicated and so were dropped, I've placed some
> alternative tables here:
>
> Boost header dependencies:
> http://www.regex.fsnet.co.uk/header_dependencies.ht
Stefan Seefeld wrote:
>
> 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.
>
A while ago Beman produced header dependency tables, unfortunately these
began to get rather complicated and so were dropped, I've placed some
alternative tables here:
Boost header dependencies:
http://www.regex.fsnet.co.uk/header_dependencies.html
Boost library dependencies:
http://www.regex.fsne
Folks,
I've put together a small tool for managing boost dependencies called bcp
(for boost copy).
The bcp utility is a tool for extracting subsets of Boost, it's useful for
Boost authors who want to distribute their library separately from Boost,
and for Boost users who want to distribute a subs
On Sat, 7 Jun 2003 10:33:20 +0100, "Paul A Bristow"
<[EMAIL PROTECTED]> wrote:
>None of the material is yet ready for inclusion in Boost,
>(with the possible exception of the C Macro values).
>
>What I would like to get is agreement on the presentation of constants.
You mean macros vs. constant v
> Should I
> explicitly ban copying in my subclass?
On second thoughts you can make your stream buffer class copyable if you
want - but the copy constructor must call the default constructor of the
base class and then explicitly set up the buffer position information in
it's body, IMO this is wha
> Actually, the problem I have is that GCC extended the copying ban to
> std::basic_streambuf<>, even though DR 50 only mentions std::ios_base.
> I know that copying stream bases or stream buffers are probably bad
> ideas, but I didn't feel comfortable leaving copy semantics out of my
> subclass's
Bohdan wrote:
[snip]
>> BTW, this double dispatch variant is only "cool" ;-) for cases where
>> the second stage of the double dispatch has to choose from only a
>> few different possibilities. That's because the second stage
>> performs a linear search.
>
> Second stage means inner states ?
No, I
Scott Woods wrote:
>> 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 sor
None of the material is yet ready for inclusion in Boost,
(with the possible exception of the C Macro values).
What I would like to get is agreement on the presentation of constants.
(Because there is much work in preparing the constants and I am
reluctant to do this without assurance that it wil
Hi,
Alexander Terekhov wrote:
Show me some code. I mean something that shows why do you need counting
semas.
This wording is too strong. Going this way, we can *always* say that
feature X is not deadly needed and can be replaced by two or more
(probably lower-level) features Y.
We could write a
On Thursday, June 5, 2003, at 8:26 AM, Ed Brey wrote:
[SNIP]
* Stream-buffer-wrapping Streams motivation: Why would someone want
an internal buffer (versus independent buffers as used by standard
streams)? (Example, please.)
The basic stream (template) classes support attaching a stream buffer
On Friday, June 6, 2003, at 11:46 AM, John Maddock wrote:
[Daryle suggested two new configuration macros to detect if
std::ios_base and std::basic_streambuf<> have been made explicitly
non-copyable. DR #50 recommends this change for std::ios_base. Recent
versions of GCC implement this change,
On Friday, June 6, 2003, at 6:45 AM, Jaap Suter wrote:
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.
[SNIP]
You can find the latest documentation, including a bigger FAQ
34 matches
Mail list logo
