1#ifndef LIBBIGWIG_VALUES_H
2#define LIBBIGWIG_VALUES_H
This structure holds the data blocks that overlap a given interval.
Definition bwValues.h:56
uint64_t * offset
Definition bwValues.h:58
uint64_t n
Definition bwValues.h:57
uint64_t * size
Definition bwValues.h:59
A node within an R-tree holding the index for data.
Definition bwValues.h:20
uint32_t * baseEnd
Definition bwValues.h:27
uint16_t nChildren
Definition bwValues.h:23
uint32_t * chrIdxStart
Definition bwValues.h:24
uint32_t * chrIdxEnd
Definition bwValues.h:26
uint64_t * dataOffset
Definition bwValues.h:28
uint8_t isLeaf
Definition bwValues.h:21
uint64_t * size
Definition bwValues.h:30
struct bwRTreeNode_t ** child
Definition bwValues.h:31
uint32_t * baseStart
Definition bwValues.h:25
union bwRTreeNode_t::@1 x
uint64_t idxSize
Definition bwValues.h:46
uint32_t chrIdxStart
Definition bwValues.h:42
uint32_t blockSize
Definition bwValues.h:40
uint32_t chrIdxEnd
Definition bwValues.h:44
uint64_t nItems
Definition bwValues.h:41
uint32_t baseEnd
Definition bwValues.h:45
uint64_t rootOffset
Definition bwValues.h:49
bwRTreeNode_t * root
Definition bwValues.h:50
uint32_t baseStart
Definition bwValues.h:43
uint32_t nItemsPerSlot
Definition bwValues.h:47