Expand documentation for Entry data type

ekmett / heaps

Asymptotically optimal Brodal/Okasaki heaps

http://hackage.haskell.org/package/heaps

BSD 3-Clause "New" or "Revised" License

29 stars 10 forks source link

Closed quchen closed 9 years ago

quchen commented 9 years ago

Took me longer than a second to recognize the utility of 'Entry' so I decided to extend its documentation a bit.

ekmett commented 9 years ago

Thanks. I may just switch Heap to having the 2-argument form as the Entry case is vastly more common.

quchen commented 9 years ago

Good idea. If you really want a pure heap, you can just store () in it then.