Remove dependency graph query.

This query was never actually used by dix.
We can include it again if we ever need it.

Author: Dragyx

src/lib.rs

@@ -34,9 +34,6 @@ mod store;
 pub mod version;
 use version::Version;
 
-#[derive(Deref, Debug, Clone, Copy, PartialEq, Eq, Hash)]
-struct DerivationId(i64);
-
 /// A validated store path. Always starts with `/nix/store`.
 ///
 /// Can be created using `StorePath::try_from(path_buf)`.

src/store.rs

@@ -26,7 +26,6 @@ use log::warn;
 use size::Size;
 
 use crate::{
-  DerivationId,
   StorePath,
   store::{
     db_eager::EagerDBConnection,
@@ -62,11 +61,6 @@ pub trait StoreBackend<'a> {
     &self,
     path: &Path,
   ) -> Result<Box<dyn Iterator<Item = StorePath> + '_>>;
-  #[expect(dead_code)]
-  fn query_dependency_graph(
-    &self,
-    path: &Path,
-  ) -> Result<Box<dyn Iterator<Item = (DerivationId, DerivationId)> + '_>>;
 }
 
 /// wrapper trait for debug information
@@ -243,16 +237,6 @@ impl<'a> StoreBackend<'a> for CombinedStoreBackend<'a> {
     self
       .fallback_query(|backend, path| (**backend).query_dependents(path), path)
   }
-
-  fn query_dependency_graph(
-    &self,
-    path: &Path,
-  ) -> Result<Box<dyn Iterator<Item = (DerivationId, DerivationId)> + '_>> {
-    self.fallback_query(
-      |backend, path| (**backend).query_dependency_graph(path),
-      path,
-    )
-  }
 }
 
 #[cfg(test)]
@@ -331,14 +315,6 @@ mod test {
     ) -> Result<Box<dyn Iterator<Item = StorePath> + '_>> {
       unimplemented!()
     }
-
-    fn query_dependency_graph(
-      &self,
-      _path: &Path,
-    ) -> Result<Box<dyn Iterator<Item = (DerivationId, DerivationId)> + '_>>
-    {
-      unimplemented!()
-    }
   }
 
   #[test]

src/store/db_eager.rs

@@ -13,7 +13,6 @@ use anyhow::{
 use rusqlite::Row;
 
 use crate::{
-  DerivationId,
   StorePath,
   path_to_canonical_string,
   store::{
@@ -116,17 +115,4 @@ impl<'a> StoreBackend<'a> for EagerDBConnection<'_> {
       Ok(StorePath(row.get::<_, String>(0)?.into()))
     })
   }
-
-  fn query_dependency_graph(
-    &self,
-    path: &std::path::Path,
-  ) -> Result<
-    Box<dyn Iterator<Item = (crate::DerivationId, crate::DerivationId)> + '_>,
-  > {
-    self.execute_row_query_with_path(
-      queries::QUERY_DEPENDENCY_GRAPH,
-      path,
-      |row| Ok((DerivationId(row.get(0)?), DerivationId(row.get(1)?))),
-    )
-  }
 }

src/store/db_lazy.rs

@@ -25,7 +25,6 @@ use rusqlite::{
 use size::Size;
 
 use crate::{
-  DerivationId,
   StorePath,
   path_to_canonical_string,
   store::{
@@ -256,19 +255,4 @@ impl<'a> StoreBackend<'a> for LazyDBConnection<'_> {
       Ok(StorePath(row.get::<_, String>(0)?.into()))
     })
   }
-
-  /// Returns all edges of the dependency graph.
-  ///
-  /// You might want to build an adjacency list from the resulting
-  /// edges.
-  fn query_dependency_graph(
-    &self,
-    path: &Path,
-  ) -> Result<Box<dyn Iterator<Item = (DerivationId, DerivationId)> + '_>> {
-    self.execute_row_query_with_path(
-      queries::QUERY_DEPENDENCY_GRAPH,
-      path,
-      |row| Ok((DerivationId(row.get(0)?), DerivationId(row.get(1)?))),
-    )
-  }
 }

src/store/nix_command.rs

@@ -18,7 +18,6 @@ use anyhow::{
 use size::Size;
 
 use crate::{
-  DerivationId,
   StorePath,
   store::StoreBackend,
 };
@@ -108,17 +107,4 @@ impl<'a> StoreBackend<'a> for CommandBackend {
   ) -> Result<Box<dyn Iterator<Item = StorePath> + '_>> {
     nix_command_query(&["--query", "--requisites", &*path.to_string_lossy()])
   }
-
-  /// This is currently not supported by this final fallback
-  ///
-  /// Always returns an error
-  fn query_dependency_graph(
-    &self,
-    path: &Path,
-  ) -> Result<Box<dyn Iterator<Item = (DerivationId, DerivationId)> + '_>> {
-    Err(anyhow!(
-      "The nix command backend does not support querying the dependency \
-       graph. (path: {path:?})"
-    ))
-  }
 }

src/store/queries.rs

@@ -1,17 +1,3 @@
-pub(crate) const QUERY_DEPENDENCY_GRAPH: &str = "
-      WITH RECURSIVE
-        graph(p, c) AS (
-          SELECT id as par, reference as chd
-          FROM ValidPaths
-          JOIN Refs ON referrer = id
-          WHERE path = ?
-        UNION
-          SELECT referrer as par, reference as chd FROM Refs
-          JOIN graph ON referrer = c
-        )
-      SELECT p, c from graph;
-    ";
-
 pub(crate) const QUERY_DEPENDENTS: &str = "
       WITH RECURSIVE
         graph(p) AS (