I am hacking up a fibonacci heap implementation, in which all the nodes are @mut cells, and unless I want to grow T:Copys all over the place, comparing against data already in the heap is impossible, because today you need immutable pointers to use Ord.
I am hacking up a fibonacci heap implementation, in which all the nodes are
@mutcells, and unless I want to growT:Copys all over the place, comparing against data already in the heap is impossible, because today you need immutable pointers to useOrd.