search

theodesp / go-heaps

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

fixes #31: Delete-for-Binomial-Heap #39

Closed safwan-moha closed 5 years ago

codecov-io commented 5 years ago

Codecov Report

Merging #39 into master will increase coverage by 1.1%. The diff coverage is 84.37%.

Impacted file tree graph

@@            Coverage Diff            @@
##           master      #39     +/-   ##
=========================================
+ Coverage   84.33%   85.43%   +1.1%     
=========================================
  Files           7        7             
  Lines         696      728     +32     
=========================================
+ Hits          587      622     +35     
  Misses         78       78             
+ Partials       31       28      -3
Impacted Files Coverage Δ
binomial/binomial_heap.go 86.33% <84.37%> (+6.89%) :arrow_up:

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 cb91ced...e9b7e7a. Read the comment docs.

theodesp commented 5 years ago

@safwan-moha Great. Check my comments. Ta.

safwan-moha commented 5 years ago

@safwan-moha Great. Check my comments. Ta.

@theodesp did you add comments?

theodesp commented 5 years ago

Aa sorry I forgot to submit them.

theodesp commented 5 years ago

Cool Thank you!

theodesp commented 5 years ago

@all-contributors please add @safwan-moha for tests and code

allcontributors[bot] commented 5 years ago

@theodesp

I've put up a pull request to add @safwan-moha! :tada: