IITree

Implicit Interval Tree

struct IITree (

IntervalType

) if (

__traits(hasMember, IntervalType, "start") &&

__traits(hasMember, IntervalType, "end")

) {

cgranges_t* cr;

bool indexed;

alias add = insert;

cr_intv_t* insert(S contig, IntervalType* i, bool trackGC, bool GCptr);

cr_intv_t* insert(S contig, IntervalType i, bool trackGC);

cr_intv_t* insert(I i, bool trackGC);

cr_intv_t* insert(const(char)* contig, T start, T end);

void index();

auto findOverlapsWith(const(char)[] contig, T qinterval);

const(cr_intv_t)[] findOverlapsWith(const(char)* contig, T start, T end);

}

Destructor

~this ~this(): Undocumented in source.

Postblit

this(this) this(this): Undocumented in source.

Members

Aliases

add alias add = insert: Undocumented in source.

Functions

findOverlapsWith auto findOverlapsWith(const(char)[] contig, T qinterval)
const(cr_intv_t)[] findOverlapsWith(const(char)* contig, T start, T end): Locate and return intervals overlapping parameter qinterval in contig
index void index(): Index the data structure -- required after all inserts completed, before query
insert cr_intv_t* insert(S contig, IntervalType* i, bool trackGC, bool GCptr)
cr_intv_t* insert(S contig, IntervalType i, bool trackGC)
cr_intv_t* insert(I i, bool trackGC)
cr_intv_t* insert(const(char)* contig, T start, T end): Insert interval for contig

Variables

cr cgranges_t* cr;: encapsulated range
indexed bool indexed;: ensure the IITree is indexed before query

Meta

Source

See Implementation

intervaltree iitree structs

IITree