pub struct BedGraph<V> {
pub chrom: String,
pub start: u64,
pub end: u64,
pub value: V,
}Expand description
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: VImplementations§
Trait Implementations§
Source§impl<V> BEDLike for BedGraph<V>
impl<V> BEDLike for BedGraph<V>
Source§fn set_start(&mut self, start: u64) -> &mut Self
fn set_start(&mut self, start: u64) -> &mut Self
Change the 0-based start position of the record
Source§fn set_end(&mut self, end: u64) -> &mut Self
fn set_end(&mut self, end: u64) -> &mut Self
Change the end position (non-inclusive) of the record
Source§fn len(&self) -> u64
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
Source§fn n_overlap<B: BEDLike>(&self, other: &B) -> u64
fn n_overlap<B: BEDLike>(&self, other: &B) -> u64
Return the size of overlap between two records
Source§fn to_genomic_range(&self) -> GenomicRange
fn to_genomic_range(&self) -> GenomicRange
Convert the record to a
GenomicRangeSource§fn split_by_len(&self, bin_size: u64) -> impl Iterator<Item = 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.
Source§fn rsplit_by_len(&self, bin_size: u64) -> impl Iterator<Item = GenomicRange>
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.Source§impl<'__de, V, __Context> BorrowDecode<'__de, __Context> for BedGraph<V>where
V: BorrowDecode<'__de, __Context>,
impl<'__de, V, __Context> BorrowDecode<'__de, __Context> for BedGraph<V>where
V: BorrowDecode<'__de, __Context>,
Source§fn borrow_decode<__D: BorrowDecoder<'__de, Context = __Context>>(
decoder: &mut __D,
) -> Result<Self, DecodeError>
fn borrow_decode<__D: BorrowDecoder<'__de, Context = __Context>>( decoder: &mut __D, ) -> Result<Self, DecodeError>
Attempt to decode this type with the given BorrowDecode.
impl<V> StructuralPartialEq for BedGraph<V>
Auto Trait Implementations§
impl<V> Freeze for BedGraph<V>where
V: Freeze,
impl<V> RefUnwindSafe for BedGraph<V>where
V: RefUnwindSafe,
impl<V> Send for BedGraph<V>where
V: Send,
impl<V> Sync for BedGraph<V>where
V: Sync,
impl<V> Unpin for BedGraph<V>where
V: Unpin,
impl<V> UnwindSafe for BedGraph<V>where
V: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more