Struct CoAccessGraph 

pub struct CoAccessGraph { /* private fields */ }

Persistent, decaying co-access graph for one project.

Implementations

impl CoAccessGraph

pub fn record(&mut self, files: &[String])

Reinforce the mutual association of every pair in files (LTP) after decaying the whole graph one step (global forgetting). Self-pairs and duplicates are ignored. Bounded work: at most MAX_RECORD_FILES² pairs.

pub fn related(&self, file: &str, top_k: usize) -> Vec<(String, f64)>

Files most strongly associated with file, strongest first.

Trait Implementations

impl Clone for CoAccessGraph

fn clone(&self) -> CoAccessGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CoAccessGraph

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

Formats the value using the given formatter.

impl Default for CoAccessGraph

fn default() -> CoAccessGraph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for CoAccessGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for CoAccessGraph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.