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

[WIP] new NonEmptyLazyList #2905

Closed

Conversation

kailuowang
Copy link
Contributor

@kailuowang kailuowang commented Jun 21, 2019

This PR only includes an initial step for #2903. which makes the existing tests for NonEmptyStream Scala 2.12- specific.

The next step will be creating a new type based NonEmptyLazyList following the example of NonEmptySet and NonEmptyChain and then create a test suite for it.

@codecov-io
Copy link

codecov-io commented Jun 21, 2019

Codecov Report

Merging #2905 into master will decrease coverage by 0.18%.
The diff coverage is n/a.

Impacted file tree graph

@@            Coverage Diff             @@
##           master    #2905      +/-   ##
==========================================
- Coverage   94.26%   94.08%   -0.19%     
==========================================
  Files         363      363              
  Lines        6945     6945              
  Branches      181      181              
==========================================
- Hits         6547     6534      -13     
- Misses        398      411      +13
Impacted Files Coverage Δ
core/src/main/scala/cats/data/OneAnd.scala 78.37% <0%> (-17.57%) ⬇️

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 6cb8d70...8a2432c. Read the comment docs.

@kailuowang
Copy link
Contributor Author

continued on #2930

@kailuowang kailuowang closed this Jul 3, 2019
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