[−][src]Struct handlegraph::packedgraph::graph::PackedGraph
Implementations
impl PackedGraph
[src]
pub fn new() -> Self
[src]
pub fn with_path_mut_ctx<F>(&mut self, path_id: PathId, f: F) where
F: Fn(&mut PackedPathMut<'b>) -> Vec<StepUpdate>,
[src]
F: Fn(&mut PackedPathMut<'b>) -> Vec<StepUpdate>,
pub fn zip_all_paths_mut_ctx<T, I, F>(&mut self, iter: I, f: F) where
I: IndexedParallelIterator<Item = T>,
T: Send + Sync,
F: Fn(T, PathId, &mut PackedPathMut<'b>) -> Vec<StepUpdate> + Send + Sync,
[src]
I: IndexedParallelIterator<Item = T>,
T: Send + Sync,
F: Fn(T, PathId, &mut PackedPathMut<'b>) -> Vec<StepUpdate> + Send + Sync,
pub fn with_all_paths_mut_ctx<F>(&mut self, f: F) where
F: Fn(PathId, &mut PackedPathMut<'b>) -> Vec<StepUpdate> + Sync + Send,
[src]
F: Fn(PathId, &mut PackedPathMut<'b>) -> Vec<StepUpdate> + Sync + Send,
pub fn with_all_paths_mut_ctx_chn<F>(&mut self, f: F) where
F: Fn(PathId, &mut PackedPathMut<'b>) -> Vec<StepUpdate> + Sync,
[src]
F: Fn(PathId, &mut PackedPathMut<'b>) -> Vec<StepUpdate> + Sync,
Trait Implementations
impl AdditiveHandleGraph for PackedGraph
[src]
pub fn append_handle(&mut self, sequence: &[u8]) -> Handle
[src]
pub fn create_handle<T: Into<NodeId>>(
&mut self,
sequence: &[u8],
node_id: T
) -> Handle
[src]
&mut self,
sequence: &[u8],
node_id: T
) -> Handle
pub fn create_edge(&mut self, Edge: Edge)
[src]
impl Clone for PackedGraph
[src]
pub fn clone(&self) -> PackedGraph
[src]
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl Debug for PackedGraph
[src]
impl Default for PackedGraph
[src]
impl<'a> GraphPathNames for &'a PackedGraph
[src]
type PathName = IterView<'a, u8>
The iterator on the name of a path.
pub fn get_path_id(self, name: &[u8]) -> Option<PathId>
[src]
pub fn get_path_name(self, id: PathId) -> Option<Self::PathName>
[src]
pub fn get_path_name_vec(self, id: PathId) -> Option<Vec<u8>>
[src]
pub fn has_path(self, name: &[u8]) -> bool
[src]
impl GraphPaths for PackedGraph
[src]
type StepIx = StepPtr
pub fn path_count(&self) -> usize
[src]
pub fn path_len(&self, id: PathId) -> Option<usize>
[src]
pub fn path_circular(&self, id: PathId) -> Option<bool>
[src]
pub fn path_handle_at_step(
&self,
id: PathId,
index: Self::StepIx
) -> Option<Handle>
[src]
&self,
id: PathId,
index: Self::StepIx
) -> Option<Handle>
pub fn path_first_step(&self, id: PathId) -> Option<Self::StepIx>
[src]
pub fn path_last_step(&self, id: PathId) -> Option<Self::StepIx>
[src]
pub fn path_next_step(
&self,
id: PathId,
ix: Self::StepIx
) -> Option<Self::StepIx>
[src]
&self,
id: PathId,
ix: Self::StepIx
) -> Option<Self::StepIx>
pub fn path_prev_step(
&self,
id: PathId,
ix: Self::StepIx
) -> Option<Self::StepIx>
[src]
&self,
id: PathId,
ix: Self::StepIx
) -> Option<Self::StepIx>
impl<'a> GraphPathsRef for &'a PackedGraph
[src]
type PathRef = PackedPathRef<'a>
pub fn get_path_ref(self, id: PathId) -> Option<Self::PathRef>
[src]
impl HandleGraph for PackedGraph
[src]
pub fn min_node_id(&self) -> NodeId
[src]
pub fn max_node_id(&self) -> NodeId
[src]
pub fn node_count(&self) -> usize
[src]
pub fn edge_count(&self) -> usize
[src]
pub fn total_length(&self) -> usize
[src]
impl<'a> IntoEdges for &'a PackedGraph
[src]
type Edges = EdgesIter<&'a PackedGraph>
The iterator through all the edges in the graph.
pub fn edges(self) -> Self::Edges
[src]
impl<'a> IntoHandles for &'a PackedGraph
[src]
type Handles = NodeIdHandles<IndexMapIter<'a>>
The iterator through all of the graph's handles.
pub fn handles(self) -> Self::Handles
[src]
pub fn has_node<I: Into<NodeId>>(self, n_id: I) -> bool
[src]
impl<'a> IntoNeighbors for &'a PackedGraph
[src]
type Neighbors = EdgeListHandleIter<'a>
pub fn neighbors(self, handle: Handle, dir: Direction) -> Self::Neighbors
[src]
pub fn degree(self, handle: Handle, dir: Direction) -> usize
[src]
pub fn has_edge(self, left: Handle, right: Handle) -> bool
[src]
impl<'a> IntoNodeOccurrences for &'a PackedGraph
[src]
type Occurrences = OccurrencesIter<'a>
An iterator through the steps on a path, by PathId
and StepIx
.
pub fn steps_on_handle(self, handle: Handle) -> Option<Self::Occurrences>
[src]
impl<'a> IntoPathIds for &'a PackedGraph
[src]
impl<'a> IntoSequences for &'a PackedGraph
[src]
type Sequence = PackedSeqIter<'a>
pub fn sequence(self, handle: Handle) -> Self::Sequence
[src]
pub fn node_len(self, handle: Handle) -> usize
[src]
pub fn sequence_vec(self, handle: Handle) -> Vec<u8>
[src]
pub fn subsequence(self, handle: Handle, start: usize, len: usize) -> Vec<u8>
[src]
pub fn base(self, handle: Handle, index: usize) -> Option<u8>
[src]
impl MutableGraphPaths for PackedGraph
[src]
pub fn create_path(&mut self, name: &[u8], circular: bool) -> Option<PathId>
[src]
pub fn destroy_path(&mut self, id: PathId) -> bool
[src]
pub fn path_append_step(
&mut self,
id: PathId,
handle: Handle
) -> Option<Self::StepIx>
[src]
&mut self,
id: PathId,
handle: Handle
) -> Option<Self::StepIx>
pub fn path_prepend_step(
&mut self,
id: PathId,
handle: Handle
) -> Option<Self::StepIx>
[src]
&mut self,
id: PathId,
handle: Handle
) -> Option<Self::StepIx>
pub fn path_insert_step_after(
&mut self,
id: PathId,
index: Self::StepIx,
handle: Handle
) -> Option<Self::StepIx>
[src]
&mut self,
id: PathId,
index: Self::StepIx,
handle: Handle
) -> Option<Self::StepIx>
pub fn path_remove_step(
&mut self,
id: PathId,
step: Self::StepIx
) -> Option<Self::StepIx>
[src]
&mut self,
id: PathId,
step: Self::StepIx
) -> Option<Self::StepIx>
pub fn path_flip_step(
&mut self,
id: PathId,
step: Self::StepIx
) -> Option<Self::StepIx>
[src]
&mut self,
id: PathId,
step: Self::StepIx
) -> Option<Self::StepIx>
pub fn path_rewrite_segment(
&mut self,
id: PathId,
from: Self::StepIx,
to: Self::StepIx,
new_segment: &[Handle]
) -> Option<(Self::StepIx, Self::StepIx)>
[src]
&mut self,
id: PathId,
from: Self::StepIx,
to: Self::StepIx,
new_segment: &[Handle]
) -> Option<(Self::StepIx, Self::StepIx)>
pub fn path_set_circularity(&mut self, id: PathId, circular: bool) -> Option<()>
[src]
impl MutableHandles for PackedGraph
[src]
pub fn divide_handle(
&mut self,
handle: Handle,
offsets: Vec<usize>
) -> Vec<Handle>
[src]
&mut self,
handle: Handle,
offsets: Vec<usize>
) -> Vec<Handle>
pub fn apply_orientation(&mut self, handle: Handle) -> Handle
[src]
pub fn split_handle(
&mut self,
handle: Handle,
offset: usize
) -> (Handle, Handle)
[src]
&mut self,
handle: Handle,
offset: usize
) -> (Handle, Handle)
impl PathSequences for PackedGraph
[src]
pub fn path_bases_len(&self, id: PathId) -> Option<usize>
[src]
pub fn path_step_at_base(&self, id: PathId, pos: usize) -> Option<Self::StepIx>
[src]
pub fn path_step_base_offset(
&self,
id: PathId,
index: Self::StepIx
) -> Option<usize>
[src]
&self,
id: PathId,
index: Self::StepIx
) -> Option<usize>
impl SpaceUsage for PackedGraph
[src]
pub fn is_stack_only() -> bool
[src]
pub fn heap_bytes(&self) -> usize
[src]
pub fn total_bytes(&self) -> usize
[src]
pub fn stack_bytes() -> usize
[src]
impl SubtractiveHandleGraph for PackedGraph
[src]
pub fn remove_handle(&mut self, handle: Handle) -> bool
[src]
pub fn remove_edge(&mut self, edge: Edge) -> bool
[src]
pub fn clear_graph(&mut self)
[src]
impl TransformNodeIds for PackedGraph
[src]
Auto Trait Implementations
impl RefUnwindSafe for PackedGraph
impl Send for PackedGraph
impl Sync for PackedGraph
impl Unpin for PackedGraph
impl UnwindSafe for PackedGraph
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> MutableHandleGraph for T where
T: AdditiveHandleGraph + SubtractiveHandleGraph + MutableHandles + TransformNodeIds,
[src]
T: AdditiveHandleGraph + SubtractiveHandleGraph + MutableHandles + TransformNodeIds,
impl<T> Pointable for T
pub const ALIGN: usize
type Init = T
The type for initializers.
pub unsafe fn init(init: <T as Pointable>::Init) -> usize
pub unsafe fn deref<'a>(ptr: usize) -> &'a T
pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T
pub unsafe fn drop(ptr: usize)
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,