theodesp / go-heaps

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

Treap Implementation #26

Closed koneko096 closed 5 years ago

koneko096 commented 5 years ago

This treap implementation utilize two powerful operation: split and merge

codecov-io commented 5 years ago

Codecov Report

Merging #26 into master will decrease coverage by 2.14%. The diff coverage is 74.28%.

Impacted file tree graph

@@            Coverage Diff             @@
##           master      #26      +/-   ##
==========================================
- Coverage   82.58%   80.44%   -2.15%     
==========================================
  Files           3        4       +1     
  Lines         201      271      +70     
==========================================
+ Hits          166      218      +52     
- Misses         26       43      +17     
- Partials        9       10       +1
Impacted Files Coverage Δ
treap/treap.go 74.28% <74.28%> (ø)

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

theodesp commented 5 years ago

@koneko096 Check my comments

theodesp commented 5 years ago

Ta