d - Odd behaviour from Array in BinaryHeap -
i have tree-like structure using node objects references other node objects. node class. now, 1 of routines i'm writing needs minimum priority queue, i'm implementing using std.container.binaryheap , std.container.array. i'm instantiating follows:
node[] r; auto heap = binaryheap!(array!(node), "a > b")(array!node(r)); as part of routine, insert elements heap using insert , remove elements using removeany. now, routine works correctly, afterwards, tree-like structure breaks (my invariants fail), due nodes being missing. what's going on here , why happening?
could http://d.puremagic.com/issues/show_bug.cgi?id=6998 - std.container.array destroys class instances
Comments
Post a Comment