undo comments

Author: stringhandler

src/dag.rs

@@ -347,7 +347,7 @@ pub trait DagLike: Sized {
 /// with the returned nodes. To correct this, you need to call
 /// [`PostOrderIterItem::unswap`].
 ///
-/// To avoid confusion, this structure cannot be directly constructed.
+/// To avoid confusion, this structure cannot be directly costructed.
 /// Instead it is implicit in the [`DagLike::rtl_post_order_iter`]
 /// method.
 #[derive(Clone, Debug)]

src/jet/elements/c_env.rs

@@ -192,9 +192,7 @@ pub(super) fn new_tx(
     };
 
     // Explicitly drop raw_annexes so Rust doesn't try any funny business dropping it early.
-    // Drop raw_inputs first since it contains pointers into raw_annexes and we don't want
-    // them to dangle. (It'd be safe since they're raw pointers, but still bad mojo.)
-    drop(raw_inputs);
+    // Drop raw_inputs first since it contains pointers into raw_annexes
     drop(raw_annexes);
     ret
 }

src/node/convert.rs

@@ -57,7 +57,7 @@ pub enum Hide {
 /// 4. Finally, the node's data is passed to [`Self::convert_data`], whose job
 ///    it is to compute the cached data for the new node. For `case` combinators
 ///    where one child was pruned, `convert_data` will receive an `assertl` or
-///    `assertr`, as appropriate, rather than a `case`.
+///    `assertl`, as appropriate, rather than a `case`.
 ///
 /// If any method returns an error, then iteration is aborted immediately and
 /// the error returned to the caller. If the converter would like to recover

src/node/mod.rs

@@ -609,7 +609,7 @@ impl<N: Marker> Node<N> {
 
     /// Contruct a node from its constituent parts.
     ///
-    /// This method can be used to directly construct a node. It will compute the CMR
+    /// This method can be used to directly costruct a node. It will compute the CMR
     /// automatically based on the value of `inner` but requires that `cached_data`
     /// be provided.
     ///