Skip to content

Bump to 0.4.8, include changes for pointer arithmetic and also allow … #67

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.

Sign up for GitHub

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

Merged
dpryan79 merged 1 commit into from
Jan 17, 2025
Merged

Bump to 0.4.8, include changes for pointer arithmetic and also allow … #67

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion bigWig.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -56,7 +56,7 @@ extern "C" {
/*!
* The library version number
*/
#define LIBBIGWIG_VERSION 0.4.7
#define LIBBIGWIG_VERSION 0.4.8

/*!
* If 1, then this library was compiled with remote file support.
Expand Down
4 changes: 1 addition & 3 deletions bwValues.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -135,8 +135,7 @@ static bwOverlapBlock_t *overlapsLeaf(bwRTreeNode_t *node, uint32_t tid, uint32_
if(!o) return NULL;

for(i=0; i<node->nChildren; i++) {
if(tid < node->chrIdxStart[i]) break;
if(tid > node->chrIdxEnd[i]) continue;
if(tid < node->chrIdxStart[i] || tid > node->chrIdxEnd[i]) continue;

/*
The individual blocks can theoretically span multiple contigs.
Expand All @@ -162,7 +161,6 @@ static bwOverlapBlock_t *overlapsLeaf(bwRTreeNode_t *node, uint32_t tid, uint32_
if(!o->size) goto error;

for(i=0; i<node->nChildren; i++) {
if(tid < node->chrIdxStart[i]) break;
if(tid < node->chrIdxStart[i] || tid > node->chrIdxEnd[i]) continue;
if(node->chrIdxStart[i] != node->chrIdxEnd[i]) {
if(tid == node->chrIdxStart[i]) {
Expand Down
Loading