Make low-level layout algorithm functions public

src/compute/flexbox.rs

@@ -21,7 +21,7 @@ use crate::tree::{LayoutTree, NodeId};
 use crate::debug::NODE_LOGGER;
 
 /// The public interface to Taffy's Flexbox algorithm implementation
-pub(crate) struct FlexboxAlgorithm;
+pub struct FlexboxAlgorithm;
 impl LayoutAlgorithm for FlexboxAlgorithm {
     const NAME: &'static str = "FLEXBOX";
 

src/compute/grid/mod.rs

@@ -34,7 +34,7 @@ mod types;
 mod util;
 
 /// The public interface to Taffy's CSS Grid algorithm implementation
-pub(crate) struct CssGridAlgorithm;
+pub struct CssGridAlgorithm;
 impl LayoutAlgorithm for CssGridAlgorithm {
     const NAME: &'static str = "CSS GRID";
 

src/compute/mod.rs

@@ -54,7 +54,7 @@ pub fn compute_layout(
 }
 
 /// A common interface that all Taffy layout algorithms conform to
-pub(crate) trait LayoutAlgorithm {
+pub trait LayoutAlgorithm {
     /// The name of the algorithm (mainly used for debug purposes)
     const NAME: &'static str;
 

src/lib.rs

@@ -42,4 +42,9 @@ mod resolve;
 mod sys;
 
 pub use crate::compute::compute_layout;
+#[cfg(feature = "flexbox")]
+pub use crate::compute::flexbox::FlexboxAlgorithm;
+#[cfg(feature = "grid")]
+pub use crate::compute::grid::CssGridAlgorithm;
+pub use crate::compute::LayoutAlgorithm;
 pub use crate::node::Taffy;

src/tree.rs

@@ -11,6 +11,12 @@ use slotmap::{DefaultKey, Key, KeyData};
 /// and u64 if needed.
 #[derive(Copy, Clone, Debug, PartialEq, Eq)]
 pub struct NodeId(u64);
+impl NodeId {
+    /// Create a new NodeId from a u64 value
+    pub const fn new(val: u64) -> Self {
+        Self(val)
+    }
+}
 
 impl From<u64> for NodeId {
     #[inline]