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§impl<'de, V> Deserialize<'de> for BedGraph<V>where
V: Deserialize<'de>,
impl<'de, V> Deserialize<'de> for BedGraph<V>where
V: Deserialize<'de>,
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl<V: PartialEq> PartialEq for BedGraph<V>
impl<V: PartialEq> PartialEq for BedGraph<V>
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> Pointable for T
impl<T> Pointable for T
source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.