pub struct ShardPageRankState {
pub vertex_count: usize,
pub rank: Vec<f64>,
pub next_rank: Vec<f64>,
pub out_degrees: Vec<usize>,
pub is_dangling: Vec<bool>,
pub boundary_edges: HashMap<u32, Vec<(String, u16)>>,
pub incoming_contributions: HashMap<String, f64>,
}Expand description
Per-shard PageRank state maintained across supersteps.
Fields§
§vertex_count: usize§rank: Vec<f64>§next_rank: Vec<f64>§out_degrees: Vec<usize>§is_dangling: Vec<bool>§boundary_edges: HashMap<u32, Vec<(String, u16)>>§incoming_contributions: HashMap<String, f64>Implementations§
Source§impl ShardPageRankState
impl ShardPageRankState
Sourcepub fn init<F>(
vertex_count: usize,
out_degrees: Vec<usize>,
_ghost_lookup: F,
csr_out_edges: &dyn Fn(u32) -> Vec<(String, bool, u16)>,
) -> Self
pub fn init<F>( vertex_count: usize, out_degrees: Vec<usize>, _ghost_lookup: F, csr_out_edges: &dyn Fn(u32) -> Vec<(String, bool, u16)>, ) -> Self
Initialize from local CSR partition.
Sourcepub fn superstep(
&mut self,
damping: f64,
global_n: usize,
local_edge_iter: &dyn Fn(u32) -> Vec<u32>,
) -> (f64, HashMap<u16, Vec<(String, f64)>>)
pub fn superstep( &mut self, damping: f64, global_n: usize, local_edge_iter: &dyn Fn(u32) -> Vec<u32>, ) -> (f64, HashMap<u16, Vec<(String, f64)>>)
Execute one superstep. Returns (local_delta, outbound_contributions).
pub fn apply_incoming_contributions( &mut self, node_id_to_local: &dyn Fn(&str) -> Option<u32>, )
pub fn add_remote_contribution(&mut self, vertex_name: String, value: f64)
Trait Implementations§
Auto Trait Implementations§
impl Freeze for ShardPageRankState
impl RefUnwindSafe for ShardPageRankState
impl Send for ShardPageRankState
impl Sync for ShardPageRankState
impl Unpin for ShardPageRankState
impl UnsafeUnpin for ShardPageRankState
impl UnwindSafe for ShardPageRankState
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
Source§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
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> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Returns the layout of the type.
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Returns whether the given value has been niched. Read more
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out indicating that a T is niched.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.