intervaltree ~master (2021-02-23T02:32:27Z)

IITree.findOverlapsWith

intervaltree iitree IITree

Locate and return intervals overlapping parameter qinterval in contig

qinterval must have members "start" and "end" (just like IntervalType stored in the tree, but the types needn't be the same).

Note that because the cgranges IITree stores contig this must be included, unlike the other interval tree implementations.

findOverlapsWith may also be called with \0-terminated contig, integer start, end

  1. auto findOverlapsWith(const(char)[] contig, T qinterval)
  2. const(cr_intv_t)[] findOverlapsWith(const(char)* contig, T start, T end)
    struct IITree(IntervalType)
    const(cr_intv_t)[]
    findOverlapsWith
    (
    T
    )
    (
    const(char)* contig
    ,
    T start
    ,
    T end
    )
    if (
    is(T == int) ||
    is(T == uint)
    ||
    is(T == long)
    ||
    is(T == ulong)
    )
    if (
    __traits(hasMember, IntervalType, "start") &&
    __traits(hasMember, IntervalType, "end")
    )

Meta

Source

See Implementation

intervaltree iitree IITree aliasesdestructorsfunctionspostblitsvariables

Page generated by adrdox