pub struct SerGraph<K: Hash, SD> { /* private fields */ }Expand description
serialize a SerGraph together with its hashed tags and IDs and a config
Implementations§
Source§impl<K: Kmer, SD> SerGraph<K, SD>
impl<K: Kmer, SD> SerGraph<K, SD>
Sourcepub fn new<DI>(
graph: DebruijnGraph<K, SD>,
translator: Translator,
config: SummaryConfig,
) -> SerGraph<K, SD>where
SD: SummaryData<DI>,
pub fn new<DI>(
graph: DebruijnGraph<K, SD>,
translator: Translator,
config: SummaryConfig,
) -> SerGraph<K, SD>where
SD: SummaryData<DI>,
make a new SerGraph
Sourcepub fn deserialize_from<P: AsRef<Path> + Debug, DI>(path: P) -> SerGraph<K, SD>
pub fn deserialize_from<P: AsRef<Path> + Debug, DI>(path: P) -> SerGraph<K, SD>
deserialize a SerGraph
Sourcepub fn graph(&self) -> &DebruijnGraph<K, SD>
pub fn graph(&self) -> &DebruijnGraph<K, SD>
get a reference of the underlying DebruijnGraph<K, SD>
Sourcepub fn translator(&self) -> &Translator
pub fn translator(&self) -> &Translator
get a reference of the underlying translator (hashed tags and IDs)
Sourcepub fn config(&self) -> &SummaryConfig
pub fn config(&self) -> &SummaryConfig
get a reference of the underlying SummaryConfig
Sourcepub fn parameters(&self) -> (usize, Summarizers)
pub fn parameters(&self) -> (usize, Summarizers)
get the set parameters (k, summarizer) of the SerGraph
Sourcepub fn dissolve(self) -> (DebruijnGraph<K, SD>, Translator, SummaryConfig)
pub fn dissolve(self) -> (DebruijnGraph<K, SD>, Translator, SummaryConfig)
get the underlying graph, hashed tags, hashed labels and config
Trait Implementations§
Source§impl<'de, K, SD> Deserialize<'de> for SerGraph<K, SD>
impl<'de, K, SD> Deserialize<'de> for SerGraph<K, SD>
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
Auto Trait Implementations§
impl<K, SD> Freeze for SerGraph<K, SD>
impl<K, SD> RefUnwindSafe for SerGraph<K, SD>where
K: RefUnwindSafe,
SD: RefUnwindSafe,
impl<K, SD> Send for SerGraph<K, SD>
impl<K, SD> Sync for SerGraph<K, SD>
impl<K, SD> Unpin for SerGraph<K, SD>
impl<K, SD> UnsafeUnpin for SerGraph<K, SD>
impl<K, SD> UnwindSafe for SerGraph<K, SD>where
K: UnwindSafe,
SD: 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> 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§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.