Skip to content

Make patience algorithm more stack friendly#19

Open
satabin wants to merge 1 commit into
masterfrom
patience/stack-friendly
Open

Make patience algorithm more stack friendly#19
satabin wants to merge 1 commit into
masterfrom
patience/stack-friendly

Conversation

@satabin

@satabin satabin commented Aug 24, 2017

Copy link
Copy Markdown
Member

Inspired by the issue raised in diffson (see gnieh/diffson#63), turning
the Stacked.chain computation into a tail recursive method makes it
possible to use Patience algorithm on big arrays.

Inspired by the issue raised in diffson (see gnieh/diffson#63), turning
the `Stacked.chain` computation into a tail recursive method makes it
possible to use Patience algorithm on big arrays.
@satabin satabin added this to the 0.1.2 milestone Aug 24, 2017
@satabin satabin self-assigned this Aug 24, 2017
@codecov-io

Copy link
Copy Markdown

Codecov Report

Merging #19 into master will increase coverage by 0.16%.
The diff coverage is 100%.

Impacted file tree graph

@@            Coverage Diff             @@
##           master      #19      +/-   ##
==========================================
+ Coverage   38.63%   38.79%   +0.16%     
==========================================
  Files          43       43              
  Lines        1522     1526       +4     
  Branches      167      166       -1     
==========================================
+ Hits          588      592       +4     
  Misses        934      934
Impacted Files Coverage Δ
src/main/scala/gnieh/diff/Patience.scala 84.84% <100%> (+0.97%) ⬆️

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

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants