ScoreHeap

A heap optimized for frequent updates. Maintains a sorted list with partitions so only items within a modified partition need to be reindexed. Returns the highest score (int32) in the heap, else null if the heap is empty.

Reference

...

Working Example

...

Methods

...

Performance

...

TODO

...

Contributing

Feel free to make changes and submit pull requests whenever.

License

ScoreHeap uses the MIT license.