Struct fbas_analyzer::NodeIdSetVecResult

pub struct NodeIdSetVecResult { /* fields omitted */ }

Wraps a vector of node ID sets. Node ID sets are stored in shrunken form to preserve memory.

Implementations

impl NodeIdSetVecResult

pub fn unwrap(self) -> Vec<NodeIdSet>

pub fn into_vec_vec(self) -> Vec<Vec<NodeId>>

pub fn involved_nodes(&self) -> NodeIdSet

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn contains_empty_set(&self) -> bool

pub fn describe(&self) -> (usize, usize, (usize, usize, f64), Vec<usize>)

Returns (number_of_sets, number_of_distinct_nodes, <minmaxmean_set_size>, )

pub fn minmaxmean(&self) -> (usize, usize, f64)

Returns (min_set_size, max_set_size, mean_set_size)

pub fn min(&self) -> usize

Returns the cardinality of the smallest member set

pub fn max(&self) -> usize

Returns the cardinality of the largest member set

pub fn mean(&self) -> f64

Returns the mean cardinality of all member sets

pub fn histogram(&self) -> Vec<usize>

Returns [ #members with size 0, #members with size 1, ... , #members with maximum size ]

pub fn merged_by_org(&self, organizations: &Organizations) -> Self

Merge contained nodes so that all nodes of the same organization get the same ID. The remaining node sets might be non-minimal w.r.t. each other, or contain duplicates! You will usually want to chain this with .minimal_sets().

pub fn minimal_sets(&self) -> Self

Removes all non-minimal sets and sorts the remaining sets.

pub fn without_nodes(&self, nodes: &[NodeId]) -> Self

pub fn without_nodes_pretty<'a>(
    &self,
    nodes: &[&'a str],
    fbas: &Fbas,
    organizations: Option<&Organizations>
) -> Self

impl NodeIdSetVecResult

pub fn into_pretty_vec_vec(
    self,
    fbas: &Fbas,
    organizations: Option<&Organizations>
) -> Vec<Vec<String>>

Transforms result into a vector of vectors of public keys and/or organization names. The passed FBAS should be the same as the one used for analysis, otherwise the IDs might not not match. Preserves the original (typically node ID-based) ordering.

Trait Implementations

impl AnalysisResult for NodeIdSetVecResult

fn into_id_string(self) -> String

fn into_pretty_string(
    self,
    fbas: &Fbas,
    organizations: Option<&Organizations>
) -> String

fn into_describe_string(self) -> String

impl Clone for NodeIdSetVecResult

fn clone(&self) -> NodeIdSetVecResult

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for NodeIdSetVecResult

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

Formats the value using the given formatter.

impl Default for NodeIdSetVecResult

fn default() -> NodeIdSetVecResult

Returns the "default value" for a type.

impl Eq for NodeIdSetVecResult

impl Hash for NodeIdSetVecResult

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given [Hasher].

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].

impl PartialEq<NodeIdSetVecResult> for NodeIdSetVecResult

fn eq(&self, other: &NodeIdSetVecResult) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &NodeIdSetVecResult) -> bool

This method tests for !=.

impl Serialize for NodeIdSetVecResult

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

Serialize this value into the given Serde serializer.

impl StructuralEq for NodeIdSetVecResult

impl StructuralPartialEq for NodeIdSetVecResult