feat(deep_causality_uncertain): Migrated internal compute graph to ConsTree from deep_causality_ast crate. (#372)

* doc(deep_causality_ast): updated README.md

Signed-off-by: Marvin Hansen <[email protected]>

* feat(deep_causality_ast): Added get_id method

Signed-off-by: Marvin Hansen <[email protected]>

* Updated plan to add higher-kinded types to uncertain crate.

Signed-off-by: Marvin Hansen <[email protected]>

* feat(deep_causality_ast): code optimization.

Signed-off-by: Marvin Hansen <[email protected]>

* Removed extensions from uncertain crate

Signed-off-by: Marvin Hansen <[email protected]>

* Trying a new approach with HKT-like traits with type bounds.

Signed-off-by: Marvin Hansen <[email protected]>

* Trying a new approach for HKT traits and extensions for Uncertain type

Signed-off-by: Marvin Hansen <[email protected]>

* feat(deep_causality_uncertain): Migrated internal compute graph to ConsTree from deep_causality_ast crate.

Signed-off-by: Marvin Hansen <[email protected]>

* Added a verdict to feature 008 HKT uncertain.

Signed-off-by: Marvin Hansen <[email protected]>

* test(deep_causality_uncertain): Increased test coverage.

Signed-off-by: Marvin Hansen <[email protected]>

---------

Signed-off-by: Marvin Hansen <[email protected]>

Author: marvin-hansen

Cargo.lock

@@ -3,7 +3,7 @@
  * Copyright (c) "2025" . The DeepCausality Authors and Contributors. All Rights Reserved.
  */
 use crate::Identifiable;
-use deep_causality_uncertain::Uncertain;
+use deep_causality_uncertain::{ProbabilisticType, Uncertain};
 
 /// Represents uncertain data entities in a context graph.
 ///
@@ -15,7 +15,10 @@ use deep_causality_uncertain::Uncertain;
 /// in how data is modeled. You may wrap sensor input, encoded strings,
 /// discrete values, or even external references.
 ///
-pub trait UncertainDatable<T>: Identifiable {
+pub trait UncertainDatable<T>: Identifiable
+where
+    T: ProbabilisticType,
+{
     /// Returns the contained data.
     ///
     /// If `Self::Data` is `Copy`, this will typically return a copy. Otherwise, it may

deep_causality/src/traits/contextuable/datable_uncertain.rs

@@ -29,9 +29,9 @@ fn test_display() {
 
     let point = Uncertain::<bool>::point(true);
     let effect4 = UncertainBool(point);
-    assert!(format!("{effect4}").contains("Point(true)"));
+    assert!(format!("{effect4}").contains("Value(Bool(true))"));
 
     let point = Uncertain::<f64>::point(4.0f64);
     let effect5 = UncertainFloat(point);
-    assert!(format!("{effect5}").contains("Point(4.0)"));
+    assert!(format!("{effect5}").contains("Value(Float(4.0))"));
 }

deep_causality/tests/types/reasoning_types/propagating_effect/display_tests.rs

@@ -1,8 +1,21 @@
 # `deep_causality_ast`
 
-[![Crates.io](https://img.shields.io/crates/v/deep_causality_ast.svg)](https://crates.io/crates/deep_causality_ast)
-[![Docs.rs](https://docs.rs/deep_causality_ast/badge.svg)](https://docs.rs/deep_causality_ast)
-[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+[![Crates.io][crates-badge]][crates-url]
+[![Docs.rs][docs-badge]][docs-url]
+[![MIT licensed][mit-badge]][mit-url]
+![Tests][test-url]
+
+[crates-badge]: https://img.shields.io/badge/Crates.io-Latest-blue
+[crates-url]: https://crates.io/crates/deep_causality_ast
+
+[docs-badge]: https://img.shields.io/badge/Docs.rs-Latest-blue
+[docs-url]: https://docs.rs/deep_causality_ast/latest/deep_causality_ast/
+
+[mit-badge]: https://img.shields.io/badge/License-MIT-blue.svg
+[mit-url]: https://github.com/deepcausality-rs/deep_causality/blob/main/LICENSE
+
+[test-url]: https://github.com/deepcausality-rs/deep_causality/actions/workflows/run_tests.yml/badge.svg
+
 
 A persistent, immutable, thread-safe tree data structure for the `deep_causality` project.
 

deep_causality_ast/README.md

@@ -54,6 +54,13 @@ impl<T> ConstTree<T> {
         self.node.children.get(index)
     }
 
+    /// Returns a unique identifier for the node pointed to by this `ConstTree`.
+    ///
+    /// The ID is the memory address of the underlying `Arc`'s allocation.
+    pub fn get_id(&self) -> usize {
+        Arc::as_ptr(&self.node) as usize
+    }
+
     /// Checks if the tree is a leaf node (i.e., has no children).
     pub fn is_leaf(&self) -> bool {
         self.node.children.is_empty()
@@ -102,7 +109,7 @@ impl<T> ConstTree<T> {
     /// # Examples
     /// ```
     /// use deep_causality_ast::ConstTree;
-    /// let tree = ConstTree::with_children(10, vec![ConstTree::new(20), ConstTree::new(30)]);
+    /// let tree = ConstTree::with_children(10, vec![ConstTree::from(20), ConstTree::from(30)]);
     /// let found_node = tree.find(|v| *v > 25).unwrap();
     /// assert_eq!(*found_node.value(), 30);
     /// ```

deep_causality_ast/src/const_tree/accessors.rs

@@ -11,3 +11,17 @@ impl<T: fmt::Display> fmt::Display for ConstTree<T> {
         self.fmt_recursive(f, 0)
     }
 }
+
+impl<T> ConstTree<T> {
+    // Private helper for Display trait to recursively print the tree with indentation.
+    pub(super) fn fmt_recursive(&self, f: &mut fmt::Formatter<'_>, indent: usize) -> fmt::Result
+    where
+        T: fmt::Display,
+    {
+        writeln!(f, "{:indent$}{}", "", self.node.value, indent = indent * 4)?; // 4 spaces per indent level
+        for child in &self.node.children {
+            child.fmt_recursive(f, indent + 1)?;
+        }
+        Ok(())
+    }
+}

deep_causality_ast/src/const_tree/display.rs

@@ -16,7 +16,6 @@ mod into_iter;
 mod iter;
 mod map;
 mod partial_eq;
-mod utils;
 
 // The internal, private representation of a single node in the tree.
 // Deriving Debug is useful for internal debugging.

deep_causality_ast/src/const_tree/mod.rs

@@ -7,7 +7,7 @@
 #![allow(unused_imports)]
 
 use deep_causality_ast::ConstTree;
-use std::sync::{Arc, Mutex};
+use std::sync::Arc;
 use std::thread;
 
 #[test]
@@ -71,6 +71,30 @@ fn test_depth() {
     assert_eq!(empty_children_tree.depth(), 1);
 }
 
+#[test]
+fn test_get_id() {
+    let tree1 = ConstTree::new(10);
+    let tree2 = ConstTree::new(10); // Same value, different allocation
+    let tree1_clone = tree1.clone();
+
+    // IDs should be non-zero memory addresses
+    assert_ne!(tree1.get_id(), 0);
+    assert_ne!(tree2.get_id(), 0);
+
+    // A clone should have the same ID as the original
+    assert_eq!(tree1.get_id(), tree1_clone.get_id());
+
+    // Independently created trees should have different IDs
+    assert_ne!(tree1.get_id(), tree2.get_id());
+
+    // Verify that ptr_eq and get_id are consistent
+    assert!(tree1.ptr_eq(&tree1_clone));
+    assert_eq!(tree1.get_id(), tree1_clone.get_id());
+
+    assert!(!tree1.ptr_eq(&tree2));
+    assert_ne!(tree1.get_id(), tree2.get_id());
+}
+
 #[test]
 fn test_modification_methods() {
     let original = ConstTree::with_children(10, vec![ConstTree::new(11)]);

deep_causality_ast/src/const_tree/utils.rs

@@ -13,7 +13,8 @@ rust_library(
     deps = [
         # Internal crates
         "//deep_causality_rand",
-        "//deep_causality_haft",
+        "//deep_causality_ast",
+        "//deep_causality_num",
     ],
 )