You might want to read
http://www.objectmentor.com/resources/articles/lsp.pdf for
a rationale of the LSP. A somewhat different view is expressed in
http://alistair.cockburn.us/crystal/articles/cdos/constructivedesconstructionofsubtyping.htm.
Am Son, 2003-03-23 um 14.00 schrieb David Abrahams:
> L
Hi there,
I am using 1.29.0 on a Linux PC running Mandrake 8.1, and I am using
gcc-2.96 (GNU CPP version 2.96 2731 (Mandrake Linux 8.1
2.96-0.62mdk).
See the following code. Topological sort has all sorts of problems with
directed graphs (using adjacency lists) having two vertices and a singl
Hi Jeremy (and Edward),
I am just now reading that unfortunate Edward Diener thread. Normally I
am a quiet Boost
list/code consumer, but this is the time, I think, to speak up (a
little), just to let you know
that there are guys out here that very much appreciate Jeremy's
contributions to Boost.
E
