Skip to content

web search done right

less approximations in similar sites finder

Mikkel Denkerc68c7ca96ccc
diff --git a/core/src/ranking/inbound_similarity.rs b/core/src/ranking/inbound_similarity.rs
index 423857e1..b41051c9 100644
--- a/core/src/ranking/inbound_similarity.rs
+++ b/core/src/ranking/inbound_similarity.rs
@@ -85,7 +85,7 @@ impl Scorer {
.iter()
.map(|disliked| disliked.sim(node, vec))
.sum::<f64>())
- / (self.liked.len() + 1) as f64)
+ / self.liked.len().max(1) as f64)
.max(0.0),
None => 0.0,
}
diff --git a/core/src/similar_sites.rs b/core/src/similar_sites.rs
index dc30b08e..60e28203 100644
--- a/core/src/similar_sites.rs
+++ b/core/src/similar_sites.rs
@@ -100,7 +100,7 @@ impl SimilarSitesFinder {
top_backlink_nodes.reverse();
let mut potential_nodes = IntSet::new();
- for (backlink_node, _) in top_backlink_nodes.into_iter().take(MAX_SIMILAR_SITES) {
+ for (backlink_node, _) in top_backlink_nodes {
for edge in self.webgraph.raw_outgoing_edges(&NodeID(backlink_node)) {
potential_nodes.insert(edge.to.0);
}