Skip to main content

IDTag

Struct IDTag 

Source
pub struct IDTag { /* private fields */ }
Expand description

type for IDs and tags together

Implementations§

Source§

impl IDTag

Source

pub fn new(id: ID, tag: Tag) -> IDTag

Source

pub fn tag(&self) -> Tag

Trait Implementations§

Source§

impl Clone for IDTag

Source§

fn clone(&self) -> IDTag

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for IDTag

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<'de> Deserialize<'de> for IDTag

Source§

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 Hash for IDTag

Source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
Source§

impl Ord for IDTag

Source§

fn cmp(&self, other: &IDTag) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · Source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · Source§

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · Source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized,

Restrict a value to a certain interval. Read more
Source§

impl PartialEq for IDTag

Source§

fn eq(&self, other: &IDTag) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

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

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

impl PartialOrd for IDTag

Source§

fn partial_cmp(&self, other: &IDTag) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · Source§

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

Tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · Source§

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

Tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 · Source§

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

Tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · Source§

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

Tests greater than or equal to (for self and other) and is used by the >= operator. Read more
Source§

impl ReadData for IDTag

Source§

fn new(id: ID, tag: Tag) -> Self

generate a read data from an ID and a tag
Source§

fn read_data( gene_ids: &mut BiMap<String, ID>, read_name: &[u8], tag: Tag, ) -> Self

geneate a read data, IDs and IDTags can only be generated from Marbel reads
Source§

fn get_tag(&self) -> Option<Tag>

if available, get a tag
Source§

fn read_datas() -> ReadDatas

retrun a ReadDatas enum to check which kind of ReadData is present
Source§

impl Serialize for IDTag

Source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. Read more
Source§

impl SummaryData<IDTag> for IDData

Source§

fn print( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data
Source§

fn print_ol( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in for json
Source§

fn print_json( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in one line
Source§

fn mem(&self) -> usize

get the size of the structure, including contents of boxed slices
Source§

fn valid(&self, config: &SummaryConfig) -> bool

check if node is valid according to: min kmer obs, group fraction, p-value
Source§

fn ids(&self) -> Option<&[ID]>

get the IDs, returns None if data is insufficient
Source§

fn summarize<K: Kmer, F: Iterator<Item = KmerDataItem<K, IDTag>>>( items: F, config: &SummaryConfig, ) -> (bool, Exts, Self)

summarize k-mers
Source§

fn summarizer() -> Summarizers

check summerizer kind
Source§

fn tags(&self) -> Option<Tags>

get Tags and the overall count, returns None if data is insufficient
Source§

fn sum(&self) -> Option<u32>

get the number of observations, returns None if data is insufficient
Source§

fn p_value(&self, _config: &SummaryConfig) -> Option<f32>

get the p-value, returns None if data is insufficient
Source§

fn fold_change(&self, _config: &SummaryConfig) -> Option<f32>

get the log2(fold change), returns None if data is insufficient
Source§

fn sample_count(&self) -> Option<usize>

get the number of samples the sequence was observed in, returns None if data is insufficient
Source§

fn edge_mults(&self) -> Option<&EdgeMult>

get the coverage of the node edges
Source§

fn quality(&self) -> Option<BaseQuality>

get the quality of the node k-mer
Source§

fn fix_edge_data(&mut self, _exts: Exts)

fix the EdgeMult by removing hanging edges
Source§

fn set_edge_mults(&mut self, _edge_mults: Option<EdgeMult>)

set the edge mults
Source§

fn mapped_ids(&self) -> Option<&[ID]>

get a reference to the mapped ids, returns None if data is insufficient
Source§

fn set_mapped_ids(&mut self, _mapped_ids: Box<[ID]>)

add mapped ids to the node data
Source§

fn mapped_edge_ids(&self) -> Option<&EdgeMap>

get a reference to the IDs mapped to the node edges, returns None id data is insuffivient
Source§

fn set_mapped_edge_ids(&mut self, _mapped_edge_ids: Option<EdgeMap>)

add mapped IDs to the node’s edges
Source§

fn join_test(&self, other: &Self) -> bool

check if the data can be joined into one
Source§

impl SummaryData<IDTag> for IDEMData

Source§

fn print( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data
Source§

fn print_ol( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in for json
Source§

fn print_json( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in one line
Source§

fn mem(&self) -> usize

get the size of the structure, including contents of boxed slices
Source§

fn valid(&self, config: &SummaryConfig) -> bool

check if node is valid according to: min kmer obs, group fraction, p-value
Source§

fn edge_mults(&self) -> Option<&EdgeMult>

get the coverage of the node edges
Source§

fn set_edge_mults(&mut self, edge_mults: Option<EdgeMult>)

set the edge mults
Source§

fn fix_edge_data(&mut self, exts: Exts)

fix the EdgeMult by removing hanging edges
Source§

fn ids(&self) -> Option<&[ID]>

get the IDs, returns None if data is insufficient
Source§

fn join_test(&self, other: &Self) -> bool

check if the data can be joined into one
Source§

fn summarize<K: Kmer, F: Iterator<Item = KmerDataItem<K, IDTag>>>( items: F, config: &SummaryConfig, ) -> (bool, Exts, Self)

summarize k-mers
Source§

fn summarizer() -> Summarizers

check summerizer kind
Source§

fn tags(&self) -> Option<Tags>

get Tags and the overall count, returns None if data is insufficient
Source§

fn sum(&self) -> Option<u32>

get the number of observations, returns None if data is insufficient
Source§

fn p_value(&self, _config: &SummaryConfig) -> Option<f32>

get the p-value, returns None if data is insufficient
Source§

fn fold_change(&self, _config: &SummaryConfig) -> Option<f32>

get the log2(fold change), returns None if data is insufficient
Source§

fn sample_count(&self) -> Option<usize>

get the number of samples the sequence was observed in, returns None if data is insufficient
Source§

fn quality(&self) -> Option<BaseQuality>

get the quality of the node k-mer
Source§

fn mapped_ids(&self) -> Option<&[ID]>

get a reference to the mapped ids, returns None if data is insufficient
Source§

fn set_mapped_ids(&mut self, _mapped_ids: Box<[ID]>)

add mapped ids to the node data
Source§

fn mapped_edge_ids(&self) -> Option<&EdgeMap>

get a reference to the IDs mapped to the node edges, returns None id data is insuffivient
Source§

fn set_mapped_edge_ids(&mut self, _mapped_edge_ids: Option<EdgeMap>)

add mapped IDs to the node’s edges
Source§

impl SummaryData<IDTag> for IDMapEMData

Source§

fn print( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data
Source§

fn print_ol( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in for json
Source§

fn print_json( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in one line
Source§

fn mem(&self) -> usize

get the size of the structure, including contents of boxed slices
Source§

fn valid(&self, config: &SummaryConfig) -> bool

check if node is valid according to: min kmer obs, group fraction, p-value
Source§

fn edge_mults(&self) -> Option<&EdgeMult>

get the coverage of the node edges
Source§

fn set_edge_mults(&mut self, edge_mults: Option<EdgeMult>)

set the edge mults
Source§

fn fix_edge_data(&mut self, exts: Exts)

fix the EdgeMult by removing hanging edges
Source§

fn ids(&self) -> Option<&[ID]>

get the IDs, returns None if data is insufficient
Source§

fn mapped_ids(&self) -> Option<&[ID]>

get a reference to the mapped ids, returns None if data is insufficient
Source§

fn set_mapped_ids(&mut self, mapped_ids: Box<[ID]>)

add mapped ids to the node data
Source§

fn join_test(&self, other: &Self) -> bool

check if the data can be joined into one
Source§

fn summarize<K: Kmer, F: Iterator<Item = KmerDataItem<K, IDTag>>>( items: F, config: &SummaryConfig, ) -> (bool, Exts, Self)

summarize k-mers
Source§

fn summarizer() -> Summarizers

check summerizer kind
Source§

fn tags(&self) -> Option<Tags>

get Tags and the overall count, returns None if data is insufficient
Source§

fn sum(&self) -> Option<u32>

get the number of observations, returns None if data is insufficient
Source§

fn p_value(&self, _config: &SummaryConfig) -> Option<f32>

get the p-value, returns None if data is insufficient
Source§

fn fold_change(&self, _config: &SummaryConfig) -> Option<f32>

get the log2(fold change), returns None if data is insufficient
Source§

fn sample_count(&self) -> Option<usize>

get the number of samples the sequence was observed in, returns None if data is insufficient
Source§

fn quality(&self) -> Option<BaseQuality>

get the quality of the node k-mer
Source§

fn mapped_edge_ids(&self) -> Option<&EdgeMap>

get a reference to the IDs mapped to the node edges, returns None id data is insuffivient
Source§

fn set_mapped_edge_ids(&mut self, _mapped_edge_ids: Option<EdgeMap>)

add mapped IDs to the node’s edges
Source§

impl SummaryData<IDTag> for IDMapEMQualityData

Source§

fn print( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data
Source§

fn print_ol( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in for json
Source§

fn print_json( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in one line
Source§

fn quality(&self) -> Option<BaseQuality>

get the quality of the node k-mer
Source§

fn mem(&self) -> usize

get the size of the structure, including contents of boxed slices
Source§

fn valid(&self, config: &SummaryConfig) -> bool

check if node is valid according to: min kmer obs, group fraction, p-value
Source§

fn edge_mults(&self) -> Option<&EdgeMult>

get the coverage of the node edges
Source§

fn set_edge_mults(&mut self, edge_mults: Option<EdgeMult>)

set the edge mults
Source§

fn fix_edge_data(&mut self, exts: Exts)

fix the EdgeMult by removing hanging edges
Source§

fn ids(&self) -> Option<&[ID]>

get the IDs, returns None if data is insufficient
Source§

fn mapped_ids(&self) -> Option<&[ID]>

get a reference to the mapped ids, returns None if data is insufficient
Source§

fn set_mapped_ids(&mut self, mapped_ids: Box<[ID]>)

add mapped ids to the node data
Source§

fn join_test(&self, other: &Self) -> bool

check if the data can be joined into one
Source§

fn summarize<K: Kmer, F: Iterator<Item = KmerDataItem<K, IDTag>>>( items: F, config: &SummaryConfig, ) -> (bool, Exts, Self)

summarize k-mers
Source§

fn summarizer() -> Summarizers

check summerizer kind
Source§

fn tags(&self) -> Option<Tags>

get Tags and the overall count, returns None if data is insufficient
Source§

fn sum(&self) -> Option<u32>

get the number of observations, returns None if data is insufficient
Source§

fn p_value(&self, _config: &SummaryConfig) -> Option<f32>

get the p-value, returns None if data is insufficient
Source§

fn fold_change(&self, _config: &SummaryConfig) -> Option<f32>

get the log2(fold change), returns None if data is insufficient
Source§

fn sample_count(&self) -> Option<usize>

get the number of samples the sequence was observed in, returns None if data is insufficient
Source§

fn mapped_edge_ids(&self) -> Option<&EdgeMap>

get a reference to the IDs mapped to the node edges, returns None id data is insuffivient
Source§

fn set_mapped_edge_ids(&mut self, _mapped_edge_ids: Option<EdgeMap>)

add mapped IDs to the node’s edges
Source§

impl SummaryData<IDTag> for IDSumData

Source§

fn print( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data
Source§

fn print_ol( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in for json
Source§

fn print_json( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in one line
Source§

fn sum(&self) -> Option<u32>

get the number of observations, returns None if data is insufficient
Source§

fn mem(&self) -> usize

get the size of the structure, including contents of boxed slices
Source§

fn valid(&self, config: &SummaryConfig) -> bool

check if node is valid according to: min kmer obs, group fraction, p-value
Source§

fn ids(&self) -> Option<&[ID]>

get the IDs, returns None if data is insufficient
Source§

fn summarize<K: Kmer, F: Iterator<Item = KmerDataItem<K, IDTag>>>( items: F, config: &SummaryConfig, ) -> (bool, Exts, Self)

summarize k-mers
Source§

fn summarizer() -> Summarizers

check summerizer kind
Source§

fn tags(&self) -> Option<Tags>

get Tags and the overall count, returns None if data is insufficient
Source§

fn p_value(&self, _config: &SummaryConfig) -> Option<f32>

get the p-value, returns None if data is insufficient
Source§

fn fold_change(&self, _config: &SummaryConfig) -> Option<f32>

get the log2(fold change), returns None if data is insufficient
Source§

fn sample_count(&self) -> Option<usize>

get the number of samples the sequence was observed in, returns None if data is insufficient
Source§

fn edge_mults(&self) -> Option<&EdgeMult>

get the coverage of the node edges
Source§

fn quality(&self) -> Option<BaseQuality>

get the quality of the node k-mer
Source§

fn fix_edge_data(&mut self, _exts: Exts)

fix the EdgeMult by removing hanging edges
Source§

fn set_edge_mults(&mut self, _edge_mults: Option<EdgeMult>)

set the edge mults
Source§

fn mapped_ids(&self) -> Option<&[ID]>

get a reference to the mapped ids, returns None if data is insufficient
Source§

fn set_mapped_ids(&mut self, _mapped_ids: Box<[ID]>)

add mapped ids to the node data
Source§

fn mapped_edge_ids(&self) -> Option<&EdgeMap>

get a reference to the IDs mapped to the node edges, returns None id data is insuffivient
Source§

fn set_mapped_edge_ids(&mut self, _mapped_edge_ids: Option<EdgeMap>)

add mapped IDs to the node’s edges
Source§

fn join_test(&self, other: &Self) -> bool

check if the data can be joined into one
Source§

impl SummaryData<IDTag> for IDTagsCountsData

Source§

fn print( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data
Source§

fn print_ol( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in for json
Source§

fn print_json( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in one line
Source§

fn tags(&self) -> Option<Tags>

get Tags and the overall count, returns None if data is insufficient
Source§

fn sum(&self) -> Option<u32>

get the number of observations, returns None if data is insufficient
Source§

fn sample_count(&self) -> Option<usize>

get the number of samples the sequence was observed in, returns None if data is insufficient
Source§

fn mem(&self) -> usize

get the size of the structure, including contents of boxed slices
Source§

fn p_value(&self, config: &SummaryConfig) -> Option<f32>

get the p-value, returns None if data is insufficient
Source§

fn fold_change(&self, config: &SummaryConfig) -> Option<f32>

get the log2(fold change), returns None if data is insufficient
Source§

fn valid(&self, config: &SummaryConfig) -> bool

check if node is valid according to: min kmer obs, group fraction, p-value
Source§

fn ids(&self) -> Option<&[ID]>

get the IDs, returns None if data is insufficient
Source§

fn summarize<K: Kmer, F: Iterator<Item = KmerDataItem<K, IDTag>>>( items: F, config: &SummaryConfig, ) -> (bool, Exts, Self)

summarize k-mers
Source§

fn summarizer() -> Summarizers

check summerizer kind
Source§

fn edge_mults(&self) -> Option<&EdgeMult>

get the coverage of the node edges
Source§

fn quality(&self) -> Option<BaseQuality>

get the quality of the node k-mer
Source§

fn fix_edge_data(&mut self, _exts: Exts)

fix the EdgeMult by removing hanging edges
Source§

fn set_edge_mults(&mut self, _edge_mults: Option<EdgeMult>)

set the edge mults
Source§

fn mapped_ids(&self) -> Option<&[ID]>

get a reference to the mapped ids, returns None if data is insufficient
Source§

fn set_mapped_ids(&mut self, _mapped_ids: Box<[ID]>)

add mapped ids to the node data
Source§

fn mapped_edge_ids(&self) -> Option<&EdgeMap>

get a reference to the IDs mapped to the node edges, returns None id data is insuffivient
Source§

fn set_mapped_edge_ids(&mut self, _mapped_edge_ids: Option<EdgeMap>)

add mapped IDs to the node’s edges
Source§

fn join_test(&self, other: &Self) -> bool

check if the data can be joined into one
Source§

impl SummaryData<IDTag> for IDTagsCountsPEMData

Source§

fn print( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data
Source§

fn print_ol( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in for json
Source§

fn print_json( &self, translator: &Translator, config: &SummaryConfig, id_group_translator: Option<&HashMap<ID, ID>>, ) -> String

format the node data in one line
Source§

fn tags(&self) -> Option<Tags>

get Tags and the overall count, returns None if data is insufficient
Source§

fn sum(&self) -> Option<u32>

get the number of observations, returns None if data is insufficient
Source§

fn sample_count(&self) -> Option<usize>

get the number of samples the sequence was observed in, returns None if data is insufficient
Source§

fn mem(&self) -> usize

get the size of the structure, including contents of boxed slices
Source§

fn p_value(&self, config: &SummaryConfig) -> Option<f32>

get the p-value, returns None if data is insufficient
Source§

fn fold_change(&self, config: &SummaryConfig) -> Option<f32>

get the log2(fold change), returns None if data is insufficient
Source§

fn valid(&self, config: &SummaryConfig) -> bool

check if node is valid according to: min kmer obs, group fraction, p-value
Source§

fn edge_mults(&self) -> Option<&EdgeMult>

get the coverage of the node edges
Source§

fn set_edge_mults(&mut self, edge_mults: Option<EdgeMult>)

set the edge mults
Source§

fn fix_edge_data(&mut self, exts: Exts)

fix the EdgeMult by removing hanging edges
Source§

fn ids(&self) -> Option<&[ID]>

get the IDs, returns None if data is insufficient
Source§

fn join_test(&self, other: &Self) -> bool

check if the data can be joined into one
Source§

fn summarize<K: Kmer, F: Iterator<Item = KmerDataItem<K, IDTag>>>( items: F, config: &SummaryConfig, ) -> (bool, Exts, Self)

summarize k-mers
Source§

fn summarizer() -> Summarizers

check summerizer kind
Source§

fn quality(&self) -> Option<BaseQuality>

get the quality of the node k-mer
Source§

fn mapped_ids(&self) -> Option<&[ID]>

get a reference to the mapped ids, returns None if data is insufficient
Source§

fn set_mapped_ids(&mut self, _mapped_ids: Box<[ID]>)

add mapped ids to the node data
Source§

fn mapped_edge_ids(&self) -> Option<&EdgeMap>

get a reference to the IDs mapped to the node edges, returns None id data is insuffivient
Source§

fn set_mapped_edge_ids(&mut self, _mapped_edge_ids: Option<EdgeMap>)

add mapped IDs to the node’s edges
Source§

impl Copy for IDTag

Source§

impl Eq for IDTag

Source§

impl StructuralPartialEq for IDTag

Auto Trait Implementations§

§

impl Freeze for IDTag

§

impl RefUnwindSafe for IDTag

§

impl Send for IDTag

§

impl Sync for IDTag

§

impl Unpin for IDTag

§

impl UnsafeUnpin for IDTag

§

impl UnwindSafe for IDTag

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
§

impl<Q, K> Comparable<K> for Q
where Q: Ord + ?Sized, K: Borrow<Q> + ?Sized,

§

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<T> ConstructibleKey for T
where T: Hash + Debug + PartialEq + Send + Sync,

Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

Source§

impl<N> NodeTrait for N
where N: Copy + Ord + Hash,

§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Scalar for T
where T: 'static + Clone + PartialEq + Debug,