Vladimir Prus wrote:
What is wrong with Xerces-C++ library
(http://xml.apache.org/xerces-c/index.html) ?
Probably, the fact that its tarball is comparable in size to the entire
Boost?
And, related, performance of the libxml2 is far better then any
compotitor. Of course, it remains to be shown
Hi,
I have probably encountered a bug in the library. I'm not able to put
a bool option in the config file. Regardles how I specify the option there,
parsing always fails with the exception:
config file options should have required parameter
Defintion of the option:
(
From: Chuck Messenger [mailto:[EMAIL PROTECTED]
No. A and B are completely symmetrical. They each equally
own the other.
Not possible. This has nothing to do with NoPtr or
boost::shared_ptr, it's even true for raw pointers. E.g.
...
Just look at my Node example -- you'll see
Hi Pavol
Pavol Droba wrote:
Hi,
I have probably encountered a bug in the library. I'm not able to put
a bool option in the config file. Regardles how I specify the option
there, parsing always fails with the exception:
config file options should have required parameter
That's really a
C99 has a header fenv.h which provides types, macros, and functions to
provide access to the floating-point environment.
Some Boost code in the Interval Library uses this header, or has to do
workarounds if not present. Metrowerks, GCC, and Dinkumware currently ship
the header, but many others
At 07:15 AM 5/30/2003, Aleksey Gurtovoy wrote:
IMO it's worth to step back and try to answer a couple of big picture
questions:
Yes, that's a good idea.
1) What are the target audiences for the regression test results?
2) What kind of information these audiences are looking to find in
there?
Schoenborn, Oliver wrote:
From: Chuck Messenger [mailto:[EMAIL PROTECTED]
No. A and B are completely symmetrical. They each equally
own the other.
Not possible. This has nothing to do with NoPtr or
boost::shared_ptr, it's even true for raw pointers. E.g.
...
Just look at my Node example --
Stefan Seefeld wrote:
Vladimir Prus wrote:
What is wrong with Xerces-C++ library
(http://xml.apache.org/xerces-c/index.html) ?
Probably, the fact that its tarball is comparable in size to the entire
Boost?
And, related, performance of the libxml2 is far better then any
compotitor. Of course,
On Friday, May 30, 2003, at 09:56 America/Denver, Chuck Messenger wrote:
...
What I'm trying to develop (or even better, find) is a workable C++
library which supports cyclic structures, handling garbage collection
for you, without resorting to a systemic (and non-portable) approach
like the
Gregory Colvin wrote:
On Friday, May 30, 2003, at 09:56 America/Denver, Chuck Messenger wrote:
...
What I'm trying to develop (or even better, find) is a workable C++
[snip]
their relative advantages and disadvantages are. If someone could
pull this information together it might help to get
On Friday, May 30, 2003, at 10:18 America/Denver, Larry Evans wrote:
Gregory Colvin wrote:
On Friday, May 30, 2003, at 09:56 America/Denver, Chuck Messenger
wrote:
...
What I'm trying to develop (or even better, find) is a workable C++
[snip]
their relative advantages and disadvantages are. If
Gregory Colvin wrote:
On Friday, May 30, 2003, at 09:56 America/Denver, Chuck Messenger wrote:
...
What I'm trying to develop (or even better, find) is a workable C++
library which supports cyclic structures, handling garbage collection
for you, without resorting to a systemic (and
Gregory Colvin wrote:
On Friday, May 30, 2003, at 10:18 America/Denver, Larry Evans wrote:
[snip]
http://groups.yahoo.com/group/boost/files/shared_cyclic_ptr/
draft-compare.zip might be a good starting point. It
doesn't include the latest additions and still needs work :(.
Wow.
Thanks (I
Thanks, but your description of cyclic_ptr is pretty far off the mark.
It does not maintain a global map, and copying cyclic_ptr cost the same
as copying shared_ptr. The special assignment mode is used only during
the mark phase of a collection, and costs more or less the same as any
other
On Friday, May 30, 2003, at 11:58 America/Denver, Larry Evans wrote:
Gregory Colvin wrote:
On Friday, May 30, 2003, at 10:18 America/Denver, Larry Evans wrote:
[snip]
http://groups.yahoo.com/group/boost/files/shared_cyclic_ptr/
draft-compare.zip might be a good starting point. It
doesn't
The bug is in the documentation.
All of the compilers are right. The complier can choose to evaluate
i=2 before _1+i which results in the lambda functor
_1 + 2
or _1+i before i=2 which gives
_1 + 1
Anyway, the point of the documentation was to say that the lambda functor
stores the value
Gregory Colvin wrote:
Thanks, but your description of cyclic_ptr is pretty far off the mark.
Sorry -- hopefully you'll forgive my ignorance. I'm just throwing out
what I understand to be the case, in the hopes that someone (such as
yourself) would set me straight...
It does not maintain a
On Friday, May 30, 2003, at 12:38 America/Denver, Chuck Messenger wrote:
Gregory Colvin wrote:
Thanks, but your description of cyclic_ptr is pretty far off the mark.
Sorry -- hopefully you'll forgive my ignorance. I'm just throwing out
what I understand to be the case, in the hopes that someone
Gregory Colvin wrote:
Suppose I have the structure:
struct Image {
char huge_image[ONE_ZILLION];
cyclic_ptrwhatever ptr;
};
As I understand it, in order to discover 'ptr', you'd invoke
operator=() on each Image structure you came to. Correct, or incorrect?
Correct. So
Here's a patch to depth_first_search.hpp in BGL in version 1.30.0 of boost
that implements nonrecursive depth first search. This reduces or eliminates
the problem of stack overflow that occurs with DFS in large graphs. There
also may be a performance gain in some cases. If anyone has a test
Support Requests item #746345, was opened at 2003-05-30 21:21
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=207586aid=746345group_id=7586
Category: None
Group: None
Status: Open
Chuck Messenger wrote:
Gregory Colvin wrote:
[snip]
There are a few attempts laying around various places in Boost, but
I've lost track of where they all are, how they all work, and what
their relative advantages and disadvantages are. If someone could
pull this information together it
For what it's worth, I've had great success using James Clark's expat to
populate directed graphs abstracted by a BGL adjacency list. I'm too busy to
document and submit to the sandbox at the moment but that should give anyone
interested enough information to go do it. Parenthetically, I've found
Kudos to Kwee H. Tan for a great BGL article in this month's CUJ! Make sure
to read it and let it sink in... There are far-reaching implications IMHO if
you read between the line a bit.
- Regards
Chris
___
Unsubscribe other changes:
Having used the spirit lib to parse XML input in both mulit-byte and unicode input,
(in connection with the serialization library). I want to second the suggestion
to look into spirit in this context. The spirit package includes two examples
for parsing XML. It seems to me that the more
There are two member functions that I think would be very useful for
tuples.
The first is assign(). Its signature would by
template class X1, ..., XN, Y1, ... YN
tupleX1, .. XN tupleX1, .. XN::assign(const Y1 y1, ... const YN yn)
If x is an object of type tupleX1, X2, ..., XN then
26 matches
Mail list logo
