Open
Conversation
…ency across large queries
Collaborator
Codecov Report
@@ Coverage Diff @@
## master #28 +/- ##
==========================================
- Coverage 74.71% 66.79% -7.92%
==========================================
Files 1 1
Lines 1574 1801 +227
==========================================
+ Hits 1176 1203 +27
- Misses 398 598 +200
Continue to review full report at Codecov.
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
update to gr.findoverlaps(by = ...). Much more efficient for big queries to be matched per levels specified in "by" metadata field. Previously, by queries first search for all possible overlaps and then filters on matching by queries. The newer implementation uses constructor function gr_construct_by which enables findOverlaps to search for overlaps only within factor levels rather than post-filtering.
Also added gaps functionality for GRangesLists. gr.setdiff2(by = ...) makes use of both gaps with grangeslists and also the new by implementation. New method gr.spreduce reduces by levels of a metadata field.
Also gr.start, gr.end, gr.flipstrand, are all now modified to work with grangeslists