From 38d024e7b6e5f5180588da5fb6dd11669521bb33 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Christina=20S=C3=B8rensen?= <christina@cafkafk.com>
Date: Wed, 18 Dec 2024 07:33:31 +0100
Subject: [PATCH] feat(jq): satellite
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Signed-off-by: Christina Sørensen <christina@cafkafk.com>
---
 jq/satellite/satellite.jq        | 53 +++++++++++++++++++++++++++++++-
 jq/satellite/test-satellite.bats | 12 ++++----
 2 files changed, 58 insertions(+), 7 deletions(-)

diff --git a/jq/satellite/satellite.jq b/jq/satellite/satellite.jq
index 6d0c541..6cec96d 100644
--- a/jq/satellite/satellite.jq
+++ b/jq/satellite/satellite.jq
@@ -1 +1,52 @@
-"Remove this line and implement your solution" | halt_error
+# Create a tree node from head and LR branches.
+def node(head; l; r): {v: head, l: l, r: r};
+
+# Create an order object to iterate over, letting build_tree be tail recurison
+# optimized by taking a single object argument.
+def order(preord; inord): {preorder: preord, inorder: inord};
+
+def build_tree:
+  # Gets root node of (sub)tree
+  (.preorder | first) as $root |
+
+  # Gets root nodes index in inorder set
+  (.inorder  | index($root)) as $root_index |
+
+  # Ensure pre-order and post-order has same length
+  if  (.preorder|length) != (.inorder|length)
+    then "traversals must have the same length" | halt_error
+
+  # Ensure pre-order and post-order contains same elements
+  elif (.preorder|sort) != (.inorder|sort)
+    then "traversals must have the same elements" | halt_error
+
+  # Ensure no repeated items (contingent on previous checks)
+  elif (.preorder|sort) != (.preorder|sort|unique)
+    then "traversals must contain unique items" | halt_error
+
+  # Return empty if pre-order and post-order aren't empty (contingent on
+  # previous checks)
+  elif  .preorder|length  == 0
+    then {}
+
+  # Return head node if pre-order and post-order has single node (contingent on
+  # previous checks)
+  elif  .preorder|length  == 1
+    then node(.preorder[0];{};{})
+
+  # Create the tree :3
+  else
+    node(
+      .preorder[0];
+      order(
+        .preorder[1:$root_index+1];
+        .inorder[:$root_index]
+      ) | build_tree;
+      order(
+        .preorder[$root_index+1:];
+        .inorder[$root_index+1:]
+      ) | build_tree
+    )
+  end;
+
+build_tree
diff --git a/jq/satellite/test-satellite.bats b/jq/satellite/test-satellite.bats
index ed6c562..360b9c9 100644
--- a/jq/satellite/test-satellite.bats
+++ b/jq/satellite/test-satellite.bats
@@ -13,7 +13,7 @@ assert_objects_equal() {
 }
 
 @test 'Empty tree' {
-    #[[ $BATS_RUN_SKIPPED == "true" ]] || skip
+    #
 
     run jq -c -f satellite.jq << 'END_INPUT'
         {
@@ -28,7 +28,7 @@ END_INPUT
 }
 
 @test 'Tree with one item' {
-    [[ $BATS_RUN_SKIPPED == "true" ]] || skip
+
 
     run jq -c -f satellite.jq << 'END_INPUT'
         {
@@ -47,7 +47,7 @@ END_INPUT
 }
 
 @test 'Tree with many items' {
-    [[ $BATS_RUN_SKIPPED == "true" ]] || skip
+
 
     run jq -c -f satellite.jq << 'END_INPUT'
         {
@@ -74,7 +74,7 @@ END_INPUT
 }
 
 @test 'Reject traversals of different length' {
-    [[ $BATS_RUN_SKIPPED == "true" ]] || skip
+
 
     run jq -c -f satellite.jq << 'END_INPUT'
         {
@@ -96,7 +96,7 @@ END_INPUT
 }
 
 @test 'Reject inconsistent traversals of same length' {
-    [[ $BATS_RUN_SKIPPED == "true" ]] || skip
+
 
     run jq -c -f satellite.jq << 'END_INPUT'
         {
@@ -119,7 +119,7 @@ END_INPUT
 }
 
 @test 'Reject traversals with repeated items' {
-    [[ $BATS_RUN_SKIPPED == "true" ]] || skip
+
 
     run jq -c -f satellite.jq << 'END_INPUT'
         {