You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In large graphs we're wasting ~8% of the heap for duplicate arrays in AdjacentNodes.offsets.
That array is only ever mutated in AdjacentNodes.setOffset in a very constraint and straighforward way, so we could easily optimise it.
E.g. we could have a global TIntObjectMap as a cache that maps from the checksum of a given offset array to the array.
The text was updated successfully, but these errors were encountered:
In large graphs we're wasting ~8% of the heap for duplicate arrays in
AdjacentNodes.offsets
.That array is only ever mutated in
AdjacentNodes.setOffset
in a very constraint and straighforward way, so we could easily optimise it.E.g. we could have a global
TIntObjectMap
as a cache that maps from the checksum of a given offset array to the array.The text was updated successfully, but these errors were encountered: