D graph library -- update

[Joseph Rushton Wakeling]

On 07/12/2013 12:37 AM, Dmitry Olshansky wrote:
> Append new value to values.
> 
> Then use 'values.length-1' (new length - 1 i.e. the old length) as an item to
> insert into sortedIndices.
> 
> The last step is to figure out what range to call lowerBound on - I'd say
> something like:
> 
> assumeSorted(sortedIndices.map!(x => values[x]))
> 
> then use that to find a suitable place to insert in sortedIndices.

Thanks very much for that, I'll try it out and report back on performance. :-)

I think I may move the discussion over to D.learn as I have some other new
profiling results to follow up on -- it'll be an interesting lesson in how to
manage memory for performance.