Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

# create a link list example #8

Open
wants to merge 2 commits into
base: master
Choose a base branch
from

Conversation

kostasfilios
Copy link

This is a linked list implementation with immutable usage on Node data class, also import benchmark test for complexity testing

@codecov-io
Copy link

codecov-io commented Jan 16, 2020

Codecov Report

Merging #8 into master will increase coverage by 0.08%.
The diff coverage is 70%.

Impacted file tree graph

@@             Coverage Diff              @@
##             master       #8      +/-   ##
============================================
+ Coverage     62.87%   62.95%   +0.08%     
  Complexity      266      266              
============================================
  Files            47       48       +1     
  Lines           862      872      +10     
  Branches        177      181       +4     
============================================
+ Hits            542      549       +7     
  Misses          279      279              
- Partials         41       44       +3
Impacted Files Coverage Δ Complexity Δ
.../io/uuddlrlrba/ktalgs/datastructures/LinkedList.kt 70% <70%> (ø) 0 <0> (?)

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 a8fa9ed...6cfae04. Read the comment docs.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants