Struct net_ensembles::watts_strogatz::SmallWorldWS

source · [−]

pub struct SmallWorldWS<T, R> { /* private fields */ }

Expand description

Implements small-world graph ensemble

Note the implemented traits!

Implementations

source

impl<T, R> SmallWorldWS<T, R>

source

pub fn neighbor_distance(&self) -> NonZeroUsize

Returns neigbor distance of the initial ring

A neighbor distance of 1 means, in the original ring structure every node is connected to its two nearest neigbors, a neighbor distance of 2 means, it is connected to its 4 nearest neigbors and so on

The graph will contain neighbor_distance * system size (i.e. graph.vertex_count()) connections

source

pub fn rewire_prob(&self) -> f64

retunrs rewire probability the ensemble is set to

On average, a fraction of rewire_prob nodes should be rewired

source

impl<T, R> SmallWorldWS<T, R>where
T: Node,
R: Rng,

source

pub fn new(
 n: u32,
 neighbor_distance: NonZeroUsize,
 rewire_probability: f64,
 rng: R
) -> Result<Self, WSCreationError>

Initialize a WS - a small-world ensemble

n is the system size, i.e., how many nodes there should be in the created graphs
neighbor_distance is needed for the initial ring structure. See also WS::neigbor_distance
rewire_probability - each edge will be rewired with a probability of rewire_probability - see also WS::rewire_prob
rng - random number generator

Trait Implementations

source

impl<T, R> AsRef<GenericGraph<T, WSContainer<T>>> for SmallWorldWS<T, R>

source

fn as_ref(&self) -> &WSGraph<T>

Converts this type into a shared reference of the (usually inferred) input type.

source

impl<T: Clone, R: Clone> Clone for SmallWorldWS<T, R>

source

fn clone(&self) -> SmallWorldWS<T, R>

Returns a copy 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<T, R> Contained<T> for SmallWorldWS<T, R>where
T: Node,

source

fn get_contained(&self, index: usize) -> Option<&T>

Returns a reference to the element stored in the specified node or None if out of Bounds

source

fn get_contained_mut(&mut self, index: usize) -> Option<&mut T>

Returns a mutable reference to the element stored in the specified node or None if out of Bounds

source

unsafe fn get_contained_unchecked(&self, index: usize) -> &T

For a save alternative see get_contained Read more

source

unsafe fn get_contained_unchecked_mut(&mut self, index: usize) -> &mut T

Returns a mutable reference to the element stored in the specified node Read more

source

impl<T: Debug, R: Debug> Debug for SmallWorldWS<T, R>

source

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

Formats the value using the given formatter. Read more

source

impl<'de, T, R> Deserialize<'de> for SmallWorldWS<T, R>where
T: Deserialize<'de>,
R: Deserialize<'de>,

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<T, R> GraphIterators<T, GenericGraph<T, WSContainer<T>>, WSContainer<T>> for SmallWorldWS<T, R>where
T: Node + SerdeStateConform,
R: Rng,

source

fn contained_iter(&self) -> ContainedIter<'_, T, WSContainer<T>>ⓘNotable traits for ContainedIter<'a, T, A>`impl<'a, T, A> Iterator for ContainedIter<'a, T, A>where T: 'a + Node, A: AdjContainer<T>, type Item = &'a T;`

get iterator over additional information stored at each vertex in order of the indices

iterator returns a Node (for example EmptyNode or whatever you used)

similar to self.container_iter().map(|container| container.contained())

source

fn contained_iter_neighbors(
 &self,
 index: usize
) -> NContainedIter<'_, T, WSContainer<T>, IterWrapper<'_>>ⓘNotable traits for NContainedIter<'a, T, A, I>`impl<'a, T, A, I> Iterator for NContainedIter<'a, T, A, I>where T: 'a, A: AdjContainer<T>, I: Iterator<Item = &'a usize> + 'a, type Item = &'a T;`

iterate over additional information of neighbors of vertex index

iterator returns &T

sort_adj will affect the order

panics if index out of bounds

source

fn contained_iter_neighbors_with_index(
 &self,
 index: usize
) -> NIContainedIter<'_, T, WSContainer<T>>ⓘNotable traits for NIContainedIter<'a, T, A>`impl<'a, T, A> Iterator for NIContainedIter<'a, T, A>where T: 'a + Node, A: AdjContainer<T>, type Item = (usize, &'a T);`

iterate over additional information of neighbors of vertex index

iterator returns (index_neighbor,&T)

sort_adj will affect the order

panics if index out of bounds

source

fn container_iter(&self) -> Iter<'_, WSContainer<T>>

get iterator over AdjContainer in order of the indices

iterator returns AdjContainer<Node>, i.e., A

source

fn container_iter_neighbors(
 &self,
 index: usize
) -> NContainerIter<'_, T, WSContainer<T>, IterWrapper<'_>>ⓘNotable traits for NContainerIter<'a, T, A, I>`impl<'a, T, A, I> Iterator for NContainerIter<'a, T, A, I>where T: 'a, A: AdjContainer<T>, I: Iterator<Item = &'a usize> + 'a, type Item = &'a A;`

iterate over additional information of neighbors of vertex index

iterator returns &T

sort_adj will affect the order

panics if index out of bounds

source

fn dfs(&self, index: usize) -> Dfs<'_, T, WSContainer<T>>ⓘNotable traits for Dfs<'a, T, A>`impl<'a, T, A> Iterator for Dfs<'a, T, A>where T: 'a, A: AdjContainer<T>, type Item = &'a T;`

returns Iterator Read more

source

fn dfs_with_index(&self, index: usize) -> DfsWithIndex<'_, T, WSContainer<T>>ⓘNotable traits for DfsWithIndex<'a, T, A>`impl<'a, T, A> Iterator for DfsWithIndex<'a, T, A>where T: 'a, A: AdjContainer<T>, type Item = (usize, &'a T);`

returns Iterator Read more

source

fn bfs_index_depth(&self, index: usize) -> Bfs<'_, T, WSContainer<T>>ⓘNotable traits for Bfs<'a, T, A>`impl<'a, T, A> Iterator for Bfs<'a, T, A>where T: 'a, A: AdjContainer<T>, type Item = (usize, &'a T, usize);`

returns Iterator Read more

source

impl<T, R> GraphIteratorsMut<T, GenericGraph<T, WSContainer<T>>, WSContainer<T>> for SmallWorldWS<T, R>where
T: Node + SerdeStateConform,
R: Rng,

source

fn contained_iter_neighbors_mut(
 &mut self,
 index: usize
) -> NContainedIterMut<'_, T, WSContainer<T>, IterWrapper<'_>>ⓘNotable traits for NContainedIterMut<'a, T, A, I>`impl<'a, T, A, I> Iterator for NContainedIterMut<'a, T, A, I>where T: 'a, A: AdjContainer<T>, I: Iterator<Item = &'a usize> + 'a, type Item = &'a mut T;`

iterate over mutable additional information of neighbors of vertex index

iterator returns &mut T

sort_adj will affect the order

panics if index out of bounds

source

fn contained_iter_neighbors_mut_with_index(
 &mut self,
 index: usize
) -> INContainedIterMut<'_, T, WSContainer<T>>ⓘNotable traits for INContainedIterMut<'a, T, A>`impl<'a, T, A> Iterator for INContainedIterMut<'a, T, A>where T: 'a + Node, A: AdjContainer<T>, type Item = (usize, &'a mut T);`

iterate over mutable additional information of neighbors of vertex index

iterator returns (index_neighbor: usize, neighbor: &mut T)

sort_adj will affect the order

panics if index out of bounds

source

fn contained_iter_mut(&mut self) -> ContainedIterMut<'_, T, WSContainer<T>>ⓘNotable traits for ContainedIterMut<'a, T, A>`impl<'a, T, A> Iterator for ContainedIterMut<'a, T, A>where T: 'a + Node, A: AdjContainer<T>, type Item = &'a mut T;`

get iterator over mutable additional information stored at each vertex in order of the indices

iterator returns a Node (for example EmptyNode or whatever you used)

source

impl<T, R> HasRng<R> for SmallWorldWS<T, R>where
R: Rng,

source

fn swap_rng(&mut self, rng: &mut R)

If you need to exchange the internal rng Read more

source

fn rng(&mut self) -> &mut R

Access RNG Read more

source

impl<T, R> Serialize for SmallWorldWS<T, R>where
T: Serialize,
R: Serialize,

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<T, R> SimpleSample for SmallWorldWS<T, R>where
R: Rng,

source

fn randomize(&mut self)

Randomizes self according to model Read more

source

fn simple_sample<F>(&mut self, times: usize, f: F)where
F: FnMut(&Self),

do the following times times: Read more

source

fn simple_sample_vec<F, G>(&mut self, times: usize, f: F) -> Vec<G, Global>where
F: FnMut(&Self) -> G,

do the following times times: Read more

source

impl<T, R> WithGraph<T, GenericGraph<T, WSContainer<T>>> for SmallWorldWS<T, R>

source

fn at(&self, index: usize) -> &T

access additional information at index

source

fn at_mut(&mut self, index: usize) -> &mut T

mutable access to additional information at index

source

fn graph(&self) -> &WSGraph<T>

returns reference to the underlying topology aka, the GenericGraph

use this to call functions regarding the topology

source

fn sort_adj(&mut self)

sorts Adjecaency List

Auto Trait Implementations

impl<T, R> RefUnwindSafe for SmallWorldWS<T, R>where
R: RefUnwindSafe,
T: RefUnwindSafe,

impl<T, R> Send for SmallWorldWS<T, R>where
R: Send,
T: Send,

impl<T, R> Sync for SmallWorldWS<T, R>where
R: Sync,
T: Sync,

impl<T, R> Unpin for SmallWorldWS<T, R>where
R: Unpin,
T: Unpin,

impl<T, R> UnwindSafe for SmallWorldWS<T, R>where
R: UnwindSafe,
T: UnwindSafe,

Blanket Implementations

source

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

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

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

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

impl<S, T> Cast<T> for Swhere
T: Conv<S>,

fn cast(self) -> T

Cast from Self to T

fn try_cast(self) -> Result<T, Error>

Try converting from Self to T

impl<S, T> CastFloat<T> for Swhere
T: ConvFloat<S>,

fn cast_trunc(self) -> T

Cast to integer, truncating Read more

fn cast_nearest(self) -> T

Cast to the nearest integer Read more

fn cast_floor(self) -> T

Cast the floor to an integer Read more

fn cast_ceil(self) -> T

Cast the ceiling to an integer Read more

fn try_cast_trunc(self) -> Result<T, Error>

Try converting to integer with truncation Read more

fn try_cast_nearest(self) -> Result<T, Error>

Try converting to the nearest integer Read more

fn try_cast_floor(self) -> Result<T, Error>

Try converting the floor to an integer Read more

fn try_cast_ceil(self) -> Result<T, Error>

Try convert the ceiling to an integer Read more

impl<T> Conv<T> for T

fn conv(v: T) -> T

Convert from T to Self

fn try_conv(v: T) -> Result<T, Error>

Try converting from T to Self

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · 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.

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::<T>()

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> ToOwned for Twhere
T: Clone,

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 for Twhere
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

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

fn vzip(self) -> V

source

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

source

Struct net_ensembles::watts_strogatz::SmallWorldWS

Implementations

impl<T, R> SmallWorldWS<T, R>

pub fn neighbor_distance(&self) -> NonZeroUsize

pub fn rewire_prob(&self) -> f64

impl<T, R> SmallWorldWS<T, R>where T: Node, R: Rng,

pub fn new( n: u32, neighbor_distance: NonZeroUsize, rewire_probability: f64, rng: R) -> Result<Self, WSCreationError>

Trait Implementations

impl<T, R> AsRef<GenericGraph<T, WSContainer<T>>> for SmallWorldWS<T, R>

fn as_ref(&self) -> &WSGraph<T>

impl<T: Clone, R: Clone> Clone for SmallWorldWS<T, R>

fn clone(&self) -> SmallWorldWS<T, R>

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

impl<T, R> Contained<T> for SmallWorldWS<T, R>where T: Node,

fn get_contained(&self, index: usize) -> Option<&T>

fn get_contained_mut(&mut self, index: usize) -> Option<&mut T>

unsafe fn get_contained_unchecked(&self, index: usize) -> &T

unsafe fn get_contained_unchecked_mut(&mut self, index: usize) -> &mut T

impl<T: Debug, R: Debug> Debug for SmallWorldWS<T, R>

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

impl<'de, T, R> Deserialize<'de> for SmallWorldWS<T, R>where T: Deserialize<'de>, R: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

impl<T, R> GraphIterators<T, GenericGraph<T, WSContainer<T>>, WSContainer<T>> for SmallWorldWS<T, R>where T: Node + SerdeStateConform, R: Rng,

fn contained_iter(&self) -> ContainedIter<'_, T, WSContainer<T>>ⓘNotable traits for ContainedIter<'a, T, A>impl<'a, T, A> Iterator for ContainedIter<'a, T, A>where T: 'a + Node, A: AdjContainer<T>, type Item = &'a T;

fn contained_iter_neighbors_with_index( &self, index: usize) -> NIContainedIter<'_, T, WSContainer<T>>ⓘNotable traits for NIContainedIter<'a, T, A>impl<'a, T, A> Iterator for NIContainedIter<'a, T, A>where T: 'a + Node, A: AdjContainer<T>, type Item = (usize, &'a T);

fn container_iter(&self) -> Iter<'_, WSContainer<T>>

fn dfs(&self, index: usize) -> Dfs<'_, T, WSContainer<T>>ⓘNotable traits for Dfs<'a, T, A>impl<'a, T, A> Iterator for Dfs<'a, T, A>where T: 'a, A: AdjContainer<T>, type Item = &'a T;

fn dfs_with_index(&self, index: usize) -> DfsWithIndex<'_, T, WSContainer<T>>ⓘNotable traits for DfsWithIndex<'a, T, A>impl<'a, T, A> Iterator for DfsWithIndex<'a, T, A>where T: 'a, A: AdjContainer<T>, type Item = (usize, &'a T);

fn bfs_index_depth(&self, index: usize) -> Bfs<'_, T, WSContainer<T>>ⓘNotable traits for Bfs<'a, T, A>impl<'a, T, A> Iterator for Bfs<'a, T, A>where T: 'a, A: AdjContainer<T>, type Item = (usize, &'a T, usize);

impl<T, R> GraphIteratorsMut<T, GenericGraph<T, WSContainer<T>>, WSContainer<T>> for SmallWorldWS<T, R>where T: Node + SerdeStateConform, R: Rng,

fn contained_iter_neighbors_mut_with_index( &mut self, index: usize) -> INContainedIterMut<'_, T, WSContainer<T>>ⓘNotable traits for INContainedIterMut<'a, T, A>impl<'a, T, A> Iterator for INContainedIterMut<'a, T, A>where T: 'a + Node, A: AdjContainer<T>, type Item = (usize, &'a mut T);

fn contained_iter_mut(&mut self) -> ContainedIterMut<'_, T, WSContainer<T>>ⓘNotable traits for ContainedIterMut<'a, T, A>impl<'a, T, A> Iterator for ContainedIterMut<'a, T, A>where T: 'a + Node, A: AdjContainer<T>, type Item = &'a mut T;

impl<T, R> HasRng<R> for SmallWorldWS<T, R>where R: Rng,

fn swap_rng(&mut self, rng: &mut R)

fn rng(&mut self) -> &mut R

impl<T, R> Serialize for SmallWorldWS<T, R>where T: Serialize, R: Serialize,

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

impl<T, R> SimpleSample for SmallWorldWS<T, R>where R: Rng,

fn randomize(&mut self)

fn simple_sample<F>(&mut self, times: usize, f: F)where F: FnMut(&Self),

fn simple_sample_vec<F, G>(&mut self, times: usize, f: F) -> Vec<G, Global>where F: FnMut(&Self) -> G,

impl<T, R> WithGraph<T, GenericGraph<T, WSContainer<T>>> for SmallWorldWS<T, R>

fn at(&self, index: usize) -> &T

fn at_mut(&mut self, index: usize) -> &mut T

fn graph(&self) -> &WSGraph<T>

fn sort_adj(&mut self)

Auto Trait Implementations

impl<T, R> RefUnwindSafe for SmallWorldWS<T, R>where R: RefUnwindSafe, T: RefUnwindSafe,

impl<T, R> Send for SmallWorldWS<T, R>where R: Send, T: Send,

impl<T, R> Sync for SmallWorldWS<T, R>where R: Sync, T: Sync,

impl<T, R> Unpin for SmallWorldWS<T, R>where R: Unpin, T: Unpin,

impl<T, R> UnwindSafe for SmallWorldWS<T, R>where R: UnwindSafe, T: UnwindSafe,

Blanket Implementations

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<S, T> Cast<T> for Swhere T: Conv<S>,

fn cast(self) -> T

fn try_cast(self) -> Result<T, Error>

impl<S, T> CastFloat<T> for Swhere T: ConvFloat<S>,

fn cast_trunc(self) -> T

fn cast_nearest(self) -> T

fn cast_floor(self) -> T

fn cast_ceil(self) -> T

fn try_cast_trunc(self) -> Result<T, Error>

fn try_cast_nearest(self) -> Result<T, Error>

fn try_cast_floor(self) -> Result<T, Error>

fn try_cast_ceil(self) -> Result<T, Error>

impl<T> Conv<T> for T

fn conv(v: T) -> T

fn try_conv(v: T) -> Result<T, Error>

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::<T>()

impl<T, R> SmallWorldWS<T, R>where
T: Node,
R: Rng,

pub fn new(
n: u32,
neighbor_distance: NonZeroUsize,
rewire_probability: f64,
rng: R
) -> Result<Self, WSCreationError>

impl<T, R> Contained<T> for SmallWorldWS<T, R>where
T: Node,

impl<'de, T, R> Deserialize<'de> for SmallWorldWS<T, R>where
T: Deserialize<'de>,
R: Deserialize<'de>,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where
__D: Deserializer<'de>,

impl<T, R> GraphIterators<T, GenericGraph<T, WSContainer<T>>, WSContainer<T>> for SmallWorldWS<T, R>where
T: Node + SerdeStateConform,
R: Rng,

fn contained_iter(&self) -> ContainedIter<'_, T, WSContainer<T>>ⓘNotable traits for ContainedIter<'a, T, A>`impl<'a, T, A> Iterator for ContainedIter<'a, T, A>where T: 'a + Node, A: AdjContainer<T>, type Item = &'a T;`

fn contained_iter_neighbors_with_index(
&self,
index: usize
) -> NIContainedIter<'_, T, WSContainer<T>>ⓘNotable traits for NIContainedIter<'a, T, A>`impl<'a, T, A> Iterator for NIContainedIter<'a, T, A>where T: 'a + Node, A: AdjContainer<T>, type Item = (usize, &'a T);`

fn dfs(&self, index: usize) -> Dfs<'_, T, WSContainer<T>>ⓘNotable traits for Dfs<'a, T, A>`impl<'a, T, A> Iterator for Dfs<'a, T, A>where T: 'a, A: AdjContainer<T>, type Item = &'a T;`

fn dfs_with_index(&self, index: usize) -> DfsWithIndex<'_, T, WSContainer<T>>ⓘNotable traits for DfsWithIndex<'a, T, A>`impl<'a, T, A> Iterator for DfsWithIndex<'a, T, A>where T: 'a, A: AdjContainer<T>, type Item = (usize, &'a T);`

fn bfs_index_depth(&self, index: usize) -> Bfs<'_, T, WSContainer<T>>ⓘNotable traits for Bfs<'a, T, A>`impl<'a, T, A> Iterator for Bfs<'a, T, A>where T: 'a, A: AdjContainer<T>, type Item = (usize, &'a T, usize);`

impl<T, R> GraphIteratorsMut<T, GenericGraph<T, WSContainer<T>>, WSContainer<T>> for SmallWorldWS<T, R>where
T: Node + SerdeStateConform,
R: Rng,

fn contained_iter_neighbors_mut_with_index(
&mut self,
index: usize
) -> INContainedIterMut<'_, T, WSContainer<T>>ⓘNotable traits for INContainedIterMut<'a, T, A>`impl<'a, T, A> Iterator for INContainedIterMut<'a, T, A>where T: 'a + Node, A: AdjContainer<T>, type Item = (usize, &'a mut T);`

fn contained_iter_mut(&mut self) -> ContainedIterMut<'_, T, WSContainer<T>>ⓘNotable traits for ContainedIterMut<'a, T, A>`impl<'a, T, A> Iterator for ContainedIterMut<'a, T, A>where T: 'a + Node, A: AdjContainer<T>, type Item = &'a mut T;`

impl<T, R> HasRng<R> for SmallWorldWS<T, R>where
R: Rng,

impl<T, R> Serialize for SmallWorldWS<T, R>where
T: Serialize,
R: Serialize,

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

impl<T, R> SimpleSample for SmallWorldWS<T, R>where
R: Rng,

fn simple_sample<F>(&mut self, times: usize, f: F)where
F: FnMut(&Self),

fn simple_sample_vec<F, G>(&mut self, times: usize, f: F) -> Vec<G, Global>where
F: FnMut(&Self) -> G,

impl<T, R> RefUnwindSafe for SmallWorldWS<T, R>where
R: RefUnwindSafe,
T: RefUnwindSafe,

impl<T, R> Send for SmallWorldWS<T, R>where
R: Send,
T: Send,

impl<T, R> Sync for SmallWorldWS<T, R>where
R: Sync,
T: Sync,

impl<T, R> Unpin for SmallWorldWS<T, R>where
R: Unpin,
T: Unpin,

impl<T, R> UnwindSafe for SmallWorldWS<T, R>where
R: UnwindSafe,
T: UnwindSafe,

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

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

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

impl<S, T> Cast<T> for Swhere
T: Conv<S>,

impl<S, T> CastFloat<T> for Swhere
T: ConvFloat<S>,

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

impl<T> ToOwned for Twhere
T: Clone,

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

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

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

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

impl<T> SerdeStateConform for Twhere
T: Serialize,