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:
( "debug.log-deb
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 th
Torbjörn Gyllebring <[EMAIL PROTECTED]> wrote:
> struct B
> {
> int f(int i){ cout << i << "\t";}
> int g(int i) const { cout << i << "\n";}
> };
>
> int main(int argc, char *argv[])
> {
> vector ivec;
> for(int i = 0; i < 10; ++i)
> ivec.push_back( i);
> B b;
> for_each( ivec.begin(), ivec
Jeffrey Hsu wrote:
Is there any interest in a generic implementation of the
Lengauer-Tarjan algorithm to compute the immediate dominator
tree of a flow graph in almost-linear time?
I'd be interested; however, I've no immediate use. I'm only
interested because I'm interested in compilers and analyz
Beman Dawes wrote:
> One possible short-term fix might be to run the MPL tests separately,
> and post them as a separate table.
That's what we plan to do, although format of the table probably going
to be different - please see below.
> Long term, some kind of hierarchical approach might help wit
Hi!
Im new to the list but I got an idea I want to share, maybe this is old and
well known
but for me it's new and solves a very real problem.
While using STL i often end up writing code like:
for( containertype::iterator itr = cont.begin(); itr != cont.end(); ++itr)
object->doThing( *itr);
whe
Is there any interest in a generic implementation of the
Lengauer-Tarjan algorithm to compute the immediate dominator
tree of a flow graph in almost-linear time?
Jeffrey
___
Unsubscribe & other changes:
> I've found a little problem in boost_no_std_wstreambuf.cxx
> The code uses std::ptrdiff_t but doesn't #include
>
> I hesitated to add that #include because I don't know wether
> all relevant compilers already support that.
>
> With the current code, the results for Comeau C++ on Linux
> are wr
Hi all,
This is an update of smart_assert - 3rd gear allowed now ;-).
I've attached it; you can also get it from:
www.torjo.com/smart_assert.zip.
Features that were present before (and still are ;-)):
- simple and straightforward usage
- multiple levels of assertions (warn, debug, etc.)
what us
I forgot to say it, multiindex.zip is in the Files section.
Joaquín M López Muñoz
Telefónica, Investigación y Desarrollo
Joaquín Mª López Muñoz ha escrito:
> Hi all,
>
> I'm (slowly) working on multiindex_set, an std::set-like container
> supporting multiple indices, much in the spirit of a rela
Hi Daryle,
Daryle Walker wrote:
> [I wrote this half-asleep a few days ago. You could add things like
> signals/slots, better list management, etc. Take this suggestion as a
> very general guideline, not as actual code to use.]
>
> I haven't looked at the command-line/config library under revi
Aleksey Chernoraenko wrote:
>> I wrote a C++ wrapper library around libxml2 (http://xmlsoft.org/),
>> and would like to submit it to boost. It currently provides a DOM-like
>> and a SAX-like interface, is parametrized for the (possibly unicode
>> enabled) string type, and has already proven its va
Has anyone had problems getting the new wave preprocessor (cpp.cpp) to
compile?
NMotably any position_policy error messages (not defined in spirit and
such...)
Also i've been getting some linker errors -
I'm using gcc 3.2.1 (is that the problem?)
any clues will be appreciated.
regards,
-fas
Hartm
Dear Boosters,
SGI MIPSpro C++ can not compile programs, which use date_time library.
The compiler complains as follows:
cc-3354 CC: ERROR File =
/home/i004/i00400/src/boost/boost/date_time/time_system_split.hpp, Line = 35
A non-integral operation is not allowed in a nontype template argument.
Schoenborn, Oliver wrote:
- You always have A owns A_impl owns B owns B_impl refs A (what your
original code seems to say), in this case B_impl contains an RRef
instead of a DynObj and everything works
I'd like to hear whether that's your case or not.
No. A and B are completely symmetrical. Th
consider the following code :
test.cpp
*
#include
#include
#include
#include
#include
#include
using namespace std ;
using namespace boost ;
using namespace boost::lambda;
int main(){
int i = 1 ;
cout << ( _1+i)(i=2) << endl;
}
On Thursday, May 29, 2003, at 21:25 America/Denver, Larry Evans wrote:
Gregory Colvin wrote:
[snip]
Do you really need a precise collector? Boehm's collector works just
fine.
Most people don't, but some do. In Jones and Lins _Garbage Collection_
there's mention of "misidentification" or "false"
Gregory Colvin wrote:
[snip]
Do you really need a precise collector? Boehm's collector works just fine.
Most people don't, but some do. In Jones and Lins _Garbage Collection_
there's mention of "misidentification" or "false" pointers in
applications with large compress bitmaps. Also, for high
> -Original Message-
> From: Chuck Messenger [mailto:[EMAIL PROTECTED]
> Sent: Thursday, May 29, 2003 4:47 PM
> To: [EMAIL PROTECTED]
> Subject: [boost] Re: Cyclic smart pointers (holy grail: the
> uber-pointer)
>
>
> Schoenborn, Oliver wrote:
>
> >>>- You always have A owns A_impl own
On Thursday, May 29, 2003, at 20:52 America/Denver, Larry Evans wrote:
Gregory Colvin wrote:
Check out
http://www.hpl.hp.com/personal/Hans_Boehm/gc/gcinterface.html
[snip]
On Thursday, May 29, 2003, at 19:57 America/Denver, Larry Evans wrote:
Gregory Colvin wrote:
[snip]
> It is not that hard
Gregory Colvin wrote:
Check out
http://www.hpl.hp.com/personal/Hans_Boehm/gc/gcinterface.html
[snip]
On Thursday, May 29, 2003, at 19:57 America/Denver, Larry Evans wrote:
Gregory Colvin wrote:
[snip]
> It is not that hard to write a new(gc) and gc_allocator
> using Boehm's collector, for t
Also check out
http://www.hpl.hp.com/personal/Hans_Boehm/gc/gc_source/gc_cpph.txt
for a gc base clase to inherit from.
On Thursday, May 29, 2003, at 20:20 America/Denver, Gregory Colvin
wrote:
Check out
http://www.hpl.hp.com/personal/Hans_Boehm/gc/gcinterface.html
which provides a gc_a
Check out
http://www.hpl.hp.com/personal/Hans_Boehm/gc/gcinterface.html
which provides a gc_alloc, and for new(gc) all you need is something
like this:
struct gc_t {};
static const gc_t gc;
void* operator new (size_t n, const gc_t&) { return GC_malloc(n); }
void* operator new[](
Gregory Colvin wrote:
[snip]
> It is not that hard to write a new(gc) and gc_allocator
> using Boehm's collector, for those who don't want to have
> the collector take over all memory allocation.
I found John Max Skaller's posts on such a gc_allocator:
http://aspn.activestate.com/ASPN/Mail/Mes
> -Original Message-
> From: Stefan Seefeld [mailto:[EMAIL PROTECTED]
> Sent: Friday, 30 May 2003 2:56 AM
> To: [EMAIL PROTECTED]
> Subject: [boost] an XML API in boost
>
>
> hi there,
>
> I'v been wondering for quite a while whether a generic XML C++ library
> would be an interesting
Schoenborn, Oliver wrote:
- You always have A owns A_impl owns B owns B_impl refs A (what your
original code seems to say), in this case B_impl contains an RRef
instead of a DynObj and everything works
I'd like to hear whether that's your case or not.
No. A and B are completely symmetrical. Th
[I wrote this half-asleep a few days ago. You could add things like
signals/slots, better list management, etc. Take this suggestion as a
very general guideline, not as actual code to use.]
I haven't looked at the command-line/config library under review right
now. I have seen recent discuss
Peter Dimov wrote:
...
This is a graph. The classic "tree structure" combined with reference
counting can only represent (possibly multiply linked) DAGs, but not general
graphs.
One possible representation of a general graph is a vertex pool and a
separate edge pool. This avoids the ownership issue
Hi all,
I'm (slowly) working on multiindex_set, an std::set-like container
supporting multiple indices, much in the spirit of a relational table.
On instantiation time, a tuple of comparison predicates is provided
as well as information on which of them are to be treated as unique
(no duplicates).
> Stefan Seefeld wrote:
> ...are tailored towards java, and there is often either no C++ mapping or
one that I consider rather poor
> as it doesn't make any use of C++ specific idioms.
>
> I wrote a C++ wrapper library around libxml2 (http://xmlsoft.org/),
> and would like to submit it to boost. I
> -Original Message-
> From: Chuck Messenger [mailto:[EMAIL PROTECTED]
> Sent: Thursday, May 29, 2003 8:26 AM
> To: [EMAIL PROTECTED]
> Subject: [boost] Cyclic smart pointers (holy grail: the uber-pointer)
>
>
> Schoenborn, Oliver wrote:
>
> > The above code does not make sense from a s
hi there,
I'v been wondering for quite a while whether a generic XML C++ library
would be an interesting project (providing DOM- and SAX- like as well as
other APIs), in particular because all the standard interfaces that
are released by the W3C (and others) are tailored towards java, and
there is
On Thursday, May 29, 2003, at 09:57 America/Denver, Larry Evans wrote:
Gregory Colvin wrote:
[snip]
It seems that rather than take the route of modifying all the
standard containers one might as well just provide a special
operator new(gc) and gc_allocator that can track all the memory
blocks on t
Gregory Colvin wrote:
[snip]
It seems that rather than take the route of modifying all the
standard containers one might as well just provide a special
operator new(gc) and gc_allocator that can track all the memory
blocks on the heap that might contain a shared_ptr. Then one
can either replace gl
Larry Evans wrote:
[snip]
See if the current stl_container.cpp can at least traverse your pointer
graph correctly.
Unfortunately, stl_container.cpp can't work with the stl because it prototypes
a "slight" modification to stl to make stl easily gc'ed. If you want to work
with the current stl, you'
On Thursday, May 29, 2003, at 08:45 America/Denver, Chuck Messenger
wrote:
...
And so, sp_collector suffers the same problem as shared_cyclic_ptr,
and requires the same remedy: that is, it is necessary to be able to
"tag" a container as being one which might hold "internal"
shared_ptr's.
Any i
Hi,
I've found a little problem in boost_no_std_wstreambuf.cxx
The code uses std::ptrdiff_t but doesn't #include
I hesitated to add that #include because I don't know wether
all relevant compilers already support that.
With the current code, the results for Comeau C++ on Linux
are wrong.
Regards,
Chuck Messenger wrote:
Larry Evans wrote:
[snip]
Right. scoped_cyclic_ptr (in shared_cyclic_ptr.zip) works around this by
using a smart ptr enumerator
function specialized for each type of container. The specialized
function
is then used to access all the smart ptrs in the container (via the
be
Hi Reece,
The boost sandbox is a CVS repository used by Boost developers to hold
works-in-progress so they are available to other Boost developers.
Thank you for your indications. I' ve from long time put eternity on
sourceforge at the address:
http://sourceforge.net/projects/eternity-it
It co
Chuck Messenger wrote:
> What is the status of sp_collector.cpp? It's distributed as part of
> Boost right now. Is it intended to remain part of the shared_ptr
> library? It sounds like it should suit my purposes quite well, after
> all...
sp_collector.cpp has a "gift" status. ;-) Meaning that
Chuck Messenger wrote:
> Schoenborn, Oliver wrote:
>
> Imagine that I'm supplying a network simulation library. I have:
>
> #include
> #include
> #include
> #include
>
> using namespace std;
> using namespace boost;
>
> struct Node;
>
> struct NodeImpl :
> /// START CODE ///
> // Boost Unit Test Library:
> #include
> #include
You included test_exec_monitor.
> // Individual Components:
> // None - just a clean compile would be nice!
>
> using namespace boost::unit_test_framework;
>
> test_suite* init_unit_tes
I tried out sp_collector.cpp. Here's my code (the Network Simulation
Library):
#include
#include
#include
#include
using namespace std;
using namespace boost;
struct NodeImpl;
NodeImpl* NodeImpl_Create(int id);
struct Node {
Node(int id) : pimpl_
On Thursday, May 29, 2003, at 12:29 AM, Daryle Walker wrote:
I'm trying to fix up the I/O library submission I gave a few months
ago, and came up with an issue with a copy constructor and GCC. I
explicitly wrote a copy constructor for a new stream-buffer class
template. I just added test cod
I think that it would be handy to introduce "null vertex value" into BGL. For
example, I'm computing some 'alternative vertices' in some function. If no
such vertex exists, I'd like to record this fact, so that when the function
is called again on the same vertex, I don't have to do anything. I
Peter Dimov wrote:
Larry Evans wrote:
Chuck Messenger wrote:
The basic idea is to intercept all memory allocations -- p = new X;
--
saving the info with "map[p] = sizeof(X);". To find the
interconnections between objects, you do this:
for (map_type::iterator it = map.begin(); it != map.end();
46 matches
Mail list logo
