Struct JoinGraph 

pub struct JoinGraph { /* private fields */ }

Implementations

impl JoinGraph

pub fn new() -> Self

pub fn add_relation( &mut self, name: impl Into<String>, rows: f64, ) -> JoinGraphResult<usize>

pub fn add_relation_with_cost( &mut self, name: impl Into<String>, rows: f64, access_cost: f64, ) -> JoinGraphResult<usize>

pub fn add_edge( &mut self, left_idx: usize, right_idx: usize, selectivity: f64, ) -> JoinGraphResult<()>

pub fn relation_count(&self) -> usize

pub fn edges_between(&self, s1: u64, s2: u64) -> Vec<&JoinEdge>

All edges connecting a left subset to a right subset of the graph. An edge is “between” (s1, s2) when one endpoint is in s1 and the other is in s2.

pub fn full_set(&self) -> u64

pub fn neighbors(&self, node: usize) -> Vec<usize>

Indices of every relation directly connected to node by any edge. Each call walks the edge list once: O(|edges|).

Trait Implementations

impl Clone for JoinGraph

fn clone(&self) -> JoinGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for JoinGraph

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

Formats the value using the given formatter.

impl Default for JoinGraph

fn default() -> JoinGraph

Returns the “default value” for a type.