SortedNodeIdSlice

swh_graph_stdlib::collections

Struct SortedNodeIdSlice 

Source 
pub struct SortedNodeIdSlice<S: AsRef<[NodeId]> + ?Sized>(pub S);
Expand description

A slice of NodeId whose values are in ascending order

§Safety

Unsafe code should not rely on this to be sorted, as safe code can build arbitrary instances

Tuple Fields§

§0: S

Trait Implementations§

Source§

impl<S: Debug + AsRef<[NodeId]> + ?Sized> Debug for SortedNodeIdSlice<S>

Source§

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

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

impl<S: AsRef<[NodeId]>> Deref for SortedNodeIdSlice<S>

Source§

type Target = S

The resulting type after dereferencing.
Source§

fn deref(&self) -> &Self::Target

Dereferences the value.
Source§

impl<'a, S: AsRef<[NodeId]>> From<&'a SortedNodeIdSlice<S>> for SortedNodeIdSlice<&'a [NodeId]>

Source§

fn from(v: &'a SortedNodeIdSlice<S>) -> Self

Converts to this type from the input type.
Source§

impl<'a> IntoIterator for SortedNodeIdSlice<&'a [NodeId]>

Source§

type Item = usize

The type of the elements being iterated over.
Source§

type IntoIter = Copied<Iter<'a, usize>>

Which kind of iterator are we turning this into?
Source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
Source§

impl<S: PartialEq + AsRef<[NodeId]> + ?Sized> PartialEq for SortedNodeIdSlice<S>

Source§

fn eq(&self, other: &SortedNodeIdSlice<S>) -> 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<S: AsRef<[NodeId]> + ?Sized> ReadNodeSet for SortedNodeIdSlice<S>

Source§

fn contains(&self, node: usize) -> bool

Runs in logarithmic time, as it performs a binary search

Source§

impl<S: Eq + AsRef<[NodeId]> + ?Sized> Eq for SortedNodeIdSlice<S>

Source§

impl<S: AsRef<[NodeId]> + ?Sized> StructuralPartialEq for SortedNodeIdSlice<S>

Auto Trait Implementations§

§

impl<S> Freeze for SortedNodeIdSlice<S>
where S: Freeze + ?Sized,

§

impl<S> RefUnwindSafe for SortedNodeIdSlice<S>
where S: RefUnwindSafe + ?Sized,

§

impl<S> Send for SortedNodeIdSlice<S>
where S: Send + ?Sized,

§

impl<S> Sync for SortedNodeIdSlice<S>
where S: Sync + ?Sized,

§

impl<S> Unpin for SortedNodeIdSlice<S>
where S: Unpin + ?Sized,

§

impl<S> UnwindSafe for SortedNodeIdSlice<S>
where S: UnwindSafe + ?Sized,

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> CastableFrom<T> for T

Source§

fn cast_from(value: T) -> T

Call Self as W
Source§

impl<T> CastableFrom<T> for T

Source§

fn cast_from(value: T) -> T

Call Self as W
Source§

impl<T, U> CastableInto<U> for T
where U: CastableFrom<T>,

Source§

fn cast(self) -> U

Call W::cast_from(self)
Source§

impl<T, U> CastableInto<U> for T
where U: CastableFrom<T>,

Source§

fn cast(self) -> U

Call W::cast_from(self)
Source§

impl<T> DowncastableFrom<T> for T

Source§

fn downcast_from(value: T) -> T

Truncate the current UnsignedInt to a possibly smaller size
Source§

impl<T> DowncastableFrom<T> for T

Source§

fn downcast_from(value: T) -> T

Truncate the current UnsignedInt to a possibly smaller size
Source§

impl<T, U> DowncastableInto<U> for T
where U: DowncastableFrom<T>,

Source§

fn downcast(self) -> U

Call W::downcast_from(self)
Source§

impl<T, U> DowncastableInto<U> for T
where U: DowncastableFrom<T>,

Source§

fn downcast(self) -> U

Call W::downcast_from(self)
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, W> HasTypeWitness<W> for T
where W: MakeTypeWitness<Arg = T>, T: ?Sized,

Source§

const WITNESS: W = W::MAKE

A constant of the type witness
Source§

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

Source§

const TYPE_EQ: TypeEq<T, <T as Identity>::Type> = TypeEq::NEW

Proof that Self is the same type as Self::Type, provides methods for casting between Self and Self::Type.
Source§

type Type = T

The same type as Self, used to emulate type equality bounds (T == U) with associated type equality constraints (T: Identity<Type = U>).
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
Source§

impl<I> IntoIteratorExt<I> for I
where I: IntoIterator,

Source§

fn into_into_lender(self) -> FromIntoIter<I>

Turn this IntoIterator into a IntoLender without allocation. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

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

Initializes a with the given initializer. Read more
Source§

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

Dereferences the given pointer. Read more
Source§

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

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

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

impl<P, T> Receiver for P
where P: Deref<Target = T> + ?Sized, T: ?Sized,

Source§

type Target = T

🔬This is a nightly-only experimental API. (arbitrary_self_types)
The target type on which the method may be called.
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> Splat<T> for T

Source§

fn splat(value: T) -> T

Source§

impl<T> Splat<T> for T

Source§

fn splat(value: T) -> T

Source§

impl<T> SwhBackwardGraph for T
where T: Deref, <T as Deref>::Target: SwhBackwardGraph,

Source§

type Predecessors<'succ> = <<T as Deref>::Target as SwhBackwardGraph>::Predecessors<'succ> where T: 'succ

Source§

fn predecessors( &self, node_id: usize, ) -> <T as SwhBackwardGraph>::Predecessors<'_>

Return an IntoIterator over the predecessors of a node.
Source§

fn indegree(&self, node_id: usize) -> usize

Return the number of predecessors of a node.
Source§

impl<T> SwhForwardGraph for T
where T: Deref, <T as Deref>::Target: SwhForwardGraph,

Source§

type Successors<'succ> = <<T as Deref>::Target as SwhForwardGraph>::Successors<'succ> where T: 'succ

Source§

fn successors(&self, node_id: usize) -> <T as SwhForwardGraph>::Successors<'_>

Return an IntoIterator over the successors of a node.
Source§

fn outdegree(&self, node_id: usize) -> usize

Return the number of successors of a node.
Source§

impl<T> SwhGraph for T
where T: Deref, <T as Deref>::Target: SwhGraph,

Source§

fn path(&self) -> &Path

Return the base path of the graph
Source§

fn is_transposed(&self) -> bool

Returns whether the graph is in the ori->snp->rel,rev->dir->cnt direction (with a few dir->rev arcs)
Source§

fn num_nodes(&self) -> usize

Return the largest node id in the graph plus one. Read more
Source§

fn has_node(&self, node_id: usize) -> bool

Returns whether the given node id exists in the graph Read more
Source§

fn num_arcs(&self) -> u64

Return the number of arcs in the graph.
Source§

fn has_arc(&self, src_node_id: usize, dst_node_id: usize) -> bool

Return whether there is an arc going from src_node_id to dst_node_id.
Source§

fn num_nodes_by_type(&self) -> Result<HashMap<NodeType, usize>, Error>

Returns the number of nodes of each type, if known.
Source§

fn actual_num_nodes(&self) -> Result<usize, Error>

Returns the number of nodes in the graph, if known.
Source§

fn num_arcs_by_type( &self, ) -> Result<HashMap<(NodeType, NodeType), usize>, Error>

Returns the number of arcs of each type, if known.
Source§

fn iter_nodes<'a>( &'a self, pl: impl ProgressLog + 'a, ) -> impl Iterator<Item = usize> + 'a

Returns an iterator on all the nodes Read more
Source§

fn par_iter_nodes<'a>( &'a self, pl: impl ConcurrentProgressLog + 'a, ) -> impl ParallelIterator<Item = usize> + 'a
where Self: Sync,

Returns a parallel iterator on all the nodes Read more
Source§

impl<T> SwhGraphWithProperties for T
where T: Deref, <T as Deref>::Target: SwhGraphWithProperties,

Source§

type Maps = <<T as Deref>::Target as SwhGraphWithProperties>::Maps

Source§

type Timestamps = <<T as Deref>::Target as SwhGraphWithProperties>::Timestamps

Source§

type Persons = <<T as Deref>::Target as SwhGraphWithProperties>::Persons

Source§

type Contents = <<T as Deref>::Target as SwhGraphWithProperties>::Contents

Source§

type Strings = <<T as Deref>::Target as SwhGraphWithProperties>::Strings

Source§

type LabelNames = <<T as Deref>::Target as SwhGraphWithProperties>::LabelNames

Source§

fn properties( &self, ) -> &SwhGraphProperties<<T as SwhGraphWithProperties>::Maps, <T as SwhGraphWithProperties>::Timestamps, <T as SwhGraphWithProperties>::Persons, <T as SwhGraphWithProperties>::Contents, <T as SwhGraphWithProperties>::Strings, <T as SwhGraphWithProperties>::LabelNames>

Source§

impl<T> SwhLabeledBackwardGraph for T
where T: Deref, <T as Deref>::Target: SwhLabeledBackwardGraph,

Source§

type LabeledArcs<'arc> = <<T as Deref>::Target as SwhLabeledBackwardGraph>::LabeledArcs<'arc> where T: 'arc

Source§

type LabeledPredecessors<'succ> = <<T as Deref>::Target as SwhLabeledBackwardGraph>::LabeledPredecessors<'succ> where T: 'succ

Source§

fn untyped_labeled_predecessors( &self, node_id: usize, ) -> <T as SwhLabeledBackwardGraph>::LabeledPredecessors<'_>

Return an IntoIterator over the predecessors of a node along with a list of labels of each arc
Source§

fn labeled_predecessors( &self, node_id: usize, ) -> impl Iterator<Item = (usize, impl Iterator<Item = EdgeLabel>)>
where Self: Sized + SwhGraphWithProperties, Self::Maps: Maps,

Return an IntoIterator over the predecessors of a node along with a list of labels of each arc
Source§

impl<T> SwhLabeledForwardGraph for T
where T: Deref, <T as Deref>::Target: SwhLabeledForwardGraph,

Source§

type LabeledArcs<'arc> = <<T as Deref>::Target as SwhLabeledForwardGraph>::LabeledArcs<'arc> where T: 'arc

Source§

type LabeledSuccessors<'succ> = <<T as Deref>::Target as SwhLabeledForwardGraph>::LabeledSuccessors<'succ> where T: 'succ

Source§

fn untyped_labeled_successors( &self, node_id: usize, ) -> <T as SwhLabeledForwardGraph>::LabeledSuccessors<'_>

Return an IntoIterator over the successors of a node along with a list of labels of each arc
Source§

fn labeled_successors( &self, node_id: usize, ) -> impl Iterator<Item = (usize, impl Iterator<Item = EdgeLabel>)> + IntoFlattenedLabeledArcsIterator<EdgeLabel>
where Self: Sized + SwhGraphWithProperties, Self::Maps: Maps,

Return an IntoIterator over the successors of a node along with a list of labels of each arc
Source§

impl<T> To<T> for T

Source§

fn to(self) -> T

Source§

impl<T> To<T> for T

Source§

fn to(self) -> T

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

impl<T> UpcastableFrom<T> for T

Source§

fn upcast_from(value: T) -> T

Extend the current UnsignedInt to a possibly bigger size.
Source§

impl<T> UpcastableFrom<T> for T

Source§

fn upcast_from(value: T) -> T

Extend the current UnsignedInt to a possibly bigger size.
Source§

impl<T, U> UpcastableInto<U> for T
where U: UpcastableFrom<T>,

Source§

fn upcast(self) -> U

Call W::upcast_from(self)
Source§

impl<T, U> UpcastableInto<U> for T
where U: UpcastableFrom<T>,

Source§

fn upcast(self) -> U

Call W::upcast_from(self)
Source§

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

Source§

fn vzip(self) -> V