search

theodesp / go-heaps

Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
MIT License
96 stars 29 forks source link

Implement binomial heap #25

Closed mb-14 closed 5 years ago

mb-14 commented 5 years ago

8

codecov-io commented 5 years ago

Codecov Report

Merging #25 into master will decrease coverage by 1.09%. The diff coverage is 79.43%.

Impacted file tree graph

@@            Coverage Diff            @@
##           master      #25     +/-   ##
=========================================
- Coverage   82.58%   81.49%   -1.1%     
=========================================
  Files           3        4      +1     
  Lines         201      308    +107     
=========================================
+ Hits          166      251     +85     
- Misses         26       43     +17     
- Partials        9       14      +5
Impacted Files Coverage Δ
binomial/binomial_heap.go 79.43% <79.43%> (ø)

Continue to review full report at Codecov.

Legend - Click here to learn more Δ = absolute <relative> (impact), ø = not affected, ? = missing data Powered by Codecov. Last update ae69c43...75f3564. Read the comment docs.

theodesp commented 5 years ago

Cool