3 ms·
I'd like to raise my hat to some absolutely fabulous documentation. That's one of the best READMEs I've seen in a very long time.
by Blackthorn 10y ago
I'd like to raise my hat to some absolutely fabulous documentation. That's one of the best READMEs I've seen in a very long time.
- pzh 10y agoThe README is really good for users of the library. I was looking for a description of the algorithm, though, and I couldn't find any. Does anyone know what algorithm this library implements? (e.g. a literature reference would be helpful). I'm familiar with a couple of PQ implementations based on skip-lists: Sundell & Tsigas and Linden & Jonsson--but this library doesn't seem to be based on any of them.