Struct BedGraph 

pub struct BedGraph<V> {
    pub chrom: String,
    pub start: u64,
    pub end: u64,
    pub value: V,
}

The bedGraph format allows display of continuous-valued data in track format. This display type is useful for probability scores and transcriptome data.

Fields

chrom: String

start: u64

end: u64

value: V

Implementations

impl<V> BedGraph<V>

pub fn new<C>(chrom: C, start: u64, end: u64, value: V) -> Self

where C: Into<String>,

pub fn from_bed<B: BEDLike>(bed: &B, value: V) -> Self

Trait Implementations

impl<V> Archive for BedGraph<V>

where String: Archive, u64: Archive, V: Archive,

type Archived = ArchivedBedGraph<V>

The archived representation of this type.

type Resolver = BedGraphResolver<V>

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

fn resolve(&self, resolver: Self::Resolver, out: Place<Self::Archived>)

Creates the archived version of this value at the given position and writes it to the given output.

const COPY_OPTIMIZATION: CopyOptimization<Self> = _

An optimization flag that allows the bytes of this type to be copied directly to a writer instead of calling serialize.

impl<V> BEDLike for BedGraph<V>

fn chrom(&self) -> &str

Return the chromosome name of the record

fn set_chrom(&mut self, chrom: &str) -> &mut Self

Change the chromosome name of the record

fn start(&self) -> u64

Return the 0-based start position of the record

fn set_start(&mut self, start: u64) -> &mut Self

Change the 0-based start position of the record

fn end(&self) -> u64

Return the end position (non-inclusive) of the record

fn set_end(&mut self, end: u64) -> &mut Self

Change the end position (non-inclusive) of the record

fn name(&self) -> Option<&str>

Return the name of the record

fn score(&self) -> Option<Score>

Return the score of the record

fn strand(&self) -> Option<Strand>

Return the strand of the record

fn len(&self) -> u64

Return the length of the record. Return 0 if the end position is smaller than the start position.

fn compare(&self, other: &Self) -> Ordering

fn overlap<B: BEDLike>(&self, other: &B) -> Option<GenomicRange>

Return the overlap

fn n_overlap<B: BEDLike>(&self, other: &B) -> u64

Return the size of overlap between two records

fn to_genomic_range(&self) -> GenomicRange

Convert the record to a GenomicRange

fn split_by_len(&self, bin_size: u64) -> impl Iterator<Item = GenomicRange>

Split into consecutive records with the specified length. The length of the last record may be shorter.

fn rsplit_by_len(&self, bin_size: u64) -> impl Iterator<Item = GenomicRange>

Split into consecutive records with the specified length starting from the end. The result is in reverse order compared to split_by_len. The length of the last record may be shorter.

impl<V: Clone> Clone for BedGraph<V>

fn clone(&self) -> BedGraph<V>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<V: Debug> Debug for BedGraph<V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<__D: Fallible + ?Sized, V> Deserialize<BedGraph<V>, __D> for Archived<BedGraph<V>>

where String: Archive, <String as Archive>::Archived: Deserialize<String, __D>, u64: Archive, <u64 as Archive>::Archived: Deserialize<u64, __D>, V: Archive, <V as Archive>::Archived: Deserialize<V, __D>,

fn deserialize( &self, deserializer: &mut __D, ) -> Result<BedGraph<V>, <__D as Fallible>::Error>

Deserializes using the given deserializer

impl<V> Display for BedGraph<V>

where V: Display,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<V> FromStr for BedGraph<V>

where V: FromStr, <V as FromStr>::Err: Debug,

type Err = ParseError

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl<V: PartialEq> PartialEq for BedGraph<V>

fn eq(&self, other: &BedGraph<V>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<__S: Fallible + ?Sized, V> Serialize<__S> for BedGraph<V>

where String: Serialize<__S>, u64: Serialize<__S>, V: Serialize<__S>,

fn serialize( &self, serializer: &mut __S, ) -> Result<<Self as Archive>::Resolver, <__S as Fallible>::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.

impl<V> StructuralPartialEq for BedGraph<V>