Skip to content

web search done right

inbound similarity cache

Mikkel Denker05242ac69d53
diff --git a/core/src/ranking/inbound_similarity.rs b/core/src/ranking/inbound_similarity.rs
index c50d2b77..757cbd5e 100644
--- a/core/src/ranking/inbound_similarity.rs
+++ b/core/src/ranking/inbound_similarity.rs
@@ -23,6 +23,7 @@ use std::{
sync::Arc,
};
+use dashmap::DashMap;
use serde::{Deserialize, Serialize};
use crate::{
@@ -38,6 +39,7 @@ pub struct Scorer {
liked: Vec<NodeScorer>,
disliked: Vec<NodeScorer>,
vectors: Arc<IntMap<bitvec_similarity::BitVec>>,
+ cache: DashMap<NodeID, f64>,
}
#[derive(Debug)]
@@ -57,7 +59,7 @@ impl NodeScorer {
}
impl Scorer {
- pub fn score(&self, node: &NodeID) -> f64 {
+ fn calculate_score(&self, node: &NodeID) -> f64 {
match self.vectors.get(&node.0) {
Some(vec) => (self.disliked.len() as f64
+ (self
@@ -74,6 +76,15 @@ impl Scorer {
None => 0.0,
}
}
+ pub fn score(&self, node: &NodeID) -> f64 {
+ if let Some(cached) = self.cache.get(node) {
+ return *cached;
+ }
+
+ let score = self.calculate_score(node);
+ self.cache.insert(*node, score);
+ score
+ }
}
#[derive(Clone, Debug)]
@@ -180,6 +191,7 @@ impl InboundSimilarity {
liked,
disliked,
vectors: self.vectors.clone(),
+ cache: DashMap::new(),
}
}