On Wed, 12 Jan 2011 03:45:11 -0500, Lars T. Kyllingstad
public@kyllingen.nospamnet wrote:
On Tue, 11 Jan 2011 15:13:13 +0100, spir wrote:
On 01/11/2011 02:22 PM, Steven Schveighoffer wrote:
A tree is a kind of set, so instead of insert() I'd like a name like
add().
(But maybe this is not
Sorry for being so late with my answer. I am busy for some days.
Steven Schveighoffer:
I don't really know what to do about fixing it.
It's not your fault. The forward reference errors I've found with RedBlackTree
are so bad that in the end I've created a different algorithm that doesn't use
OK. I will create a single bugzilla report for RedBlackTree.
http://d.puremagic.com/issues/show_bug.cgi?id=5451
Bye,
bearophile
On Tue, 11 Jan 2011 15:13:13 +0100, spir wrote:
On 01/11/2011 02:22 PM, Steven Schveighoffer wrote:
A tree is a kind of set, so instead of insert() I'd like a name like
add().
(But maybe this is not standard in D).
The function names must be consistent across containers, because the
point
On Mon, 10 Jan 2011 18:14:31 -0500, bearophile bearophileh...@lycos.com
wrote:
I've had to use a search tree, so RedBlackTree was the right data
structure. It seems to do what I need, so thank you for this useful data
structure. Some of the things I write here are questions or things that
On 01/11/2011 02:22 PM, Steven Schveighoffer wrote:
A tree is a kind of set, so instead of insert() I'd like a name like
add().
(But maybe this is not standard in D).
The function names must be consistent across containers, because the
point is that complexity and semantic requirements are
I've had to use a search tree, so RedBlackTree was the right data structure. It
seems to do what I need, so thank you for this useful data structure. Some of
the things I write here are questions or things that show my ignorance about
this implementation.
-
Please add some
