search

JuliaCollections / LeftChildRightSiblingTrees.jl

Memory-efficient representation of a tree with arbitrary number of children/node
MIT License
16 stars 5 forks source link

add islastsibling method #7

Closed Arkoniak closed 4 years ago

Arkoniak commented 4 years ago

This is a useful method that completes LeftChildRightSiblingTrees api. Also did a small redesign of internal functions, made them decoupled from actual definition of the last sibling.

codecov-io commented 4 years ago

Codecov Report

Merging #7 into master will increase coverage by 0.23%. The diff coverage is 88.88%.

Impacted file tree graph

@@            Coverage Diff             @@
##           master       #7      +/-   ##
==========================================
+ Coverage   89.13%   89.36%   +0.23%     
==========================================
  Files           2        2              
  Lines          92       94       +2     
==========================================
+ Hits           82       84       +2     
  Misses         10       10
Impacted Files Coverage Δ
src/LeftChildRightSiblingTrees.jl 92.85% <88.88%> (+0.17%) :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 0565033...41c20f9. Read the comment docs.

timholy commented 4 years ago

Great idea, thanks!

timholy commented 4 years ago

Will come out soon as v0.1.2: https://github.com/JuliaRegistries/General/pull/8918