nidx-binding 6.9.1.post587__tar.gz → 6.9.1.post590__tar.gz

{nidx_binding-6.9.1.post587 → nidx_binding-6.9.1.post590}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: nidx_binding
-Version: 6.9.1.post587
+Version: 6.9.1.post590
 Classifier: Programming Language :: Rust
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Programming Language :: Python :: Implementation :: PyPy

{nidx_binding-6.9.1.post587 → nidx_binding-6.9.1.post590}/nidx_protos/pyproject.toml

@@ -10,7 +10,7 @@ build-backend = "pdm.backend"
 
 [project]
 name = "nidx_protos"
-version = "6.9.1.post587"
+version = "6.9.1.post590"
 license = "AGPL-3.0-or-later"
 description = "Protobuf definitions for nucliadb/nidx"
 authors = [{ name = "Nuclia", email = "nucliadb@nuclia.com" }]

{nidx_binding-6.9.1.post587 → nidx_binding-6.9.1.post590}/pyproject.toml

@@ -13,7 +13,7 @@ classifiers = [
     "Programming Language :: Python :: Implementation :: CPython",
     "Programming Language :: Python :: Implementation :: PyPy",
 ]
-version = "6.9.1.post587"
+version = "6.9.1.post590"
 
 [project.urls]
 Homepage = "https://nuclia.com"

{nidx_binding-6.9.1.post587 → nidx_binding-6.9.1.post590}/src/searcher/shard_selector.rs

@@ -215,23 +215,21 @@ impl ShardSelector {
             .collect()
     }
 
-    /// List the nodes that contain a shard. If the local node is in the list, it will always be returned first
+    /// List the nodes that contain a shard in order of preference.
+    /// This way we preferentially send all requests for a shard to the same node to improve caching.
     pub fn nodes_for_shard(&self, shard: &Uuid) -> Vec<SearcherNode> {
         let nodes = self._nodes_for_shard(self.nodes.list_nodes(), shard);
-        // See if some of this nodes are me, and put them first
-        let mut searcher_nodes = Vec::new();
-        let mut has_this_node = false;
-        for node in nodes {
-            if node == self.nodes.this_node() {
-                has_this_node = true;
-            } else {
-                searcher_nodes.push(SearcherNode::Remote(node));
-            }
-        }
-        if has_this_node {
-            searcher_nodes.insert(0, SearcherNode::This);
-        }
-        searcher_nodes
+
+        nodes
+            .into_iter()
+            .map(|n| {
+                if n == self.nodes.this_node() {
+                    SearcherNode::This
+                } else {
+                    SearcherNode::Remote(n)
+                }
+            })
+            .collect()
     }
 
     fn _nodes_for_shard(&self, mut nodes: Vec<String>, shard: &Uuid) -> Vec<String> {