Refctor LA01

src/large_assignment_01/large_assignment_01.sml → src/la1/la1.sml

@@ -9,6 +9,7 @@
 
 
 (* 
+ *  1
  *  Type: `int * int * int -> bool`
  *  Desc: The triangle inequality theorem states that the sum of any 
  *        two sides of a triangle must be greater than or equal to the 
@@ -22,6 +23,7 @@ fun triangle(0, _, _) = false
 
 
 (*
+ *  2
  *  Type: `real * real * real -> bool`
  *  Desc: The triangle inequality theorem states that the sum
  *        of any two sides of a triangle must be greater than
@@ -41,6 +43,7 @@ fun triangleR(a, b, c) =
 
 
 (*
+ *  3
  *  Type: `int * 'a list -> 'a list`
  *  Desc: Given an integer n and a list l, cycle n elements
  *        from the list to the end of the list. You can assume
@@ -54,6 +57,7 @@ fun triangleR(a, b, c) =
 
 
 (*
+ *  4
  *  Type: `'a list -> 'a list`
  *  Desc: Mirror the list. You may not use any reverse function
  *        (even as a helper function).
@@ -65,6 +69,7 @@ fun triangleR(a, b, c) =
 
 
 (*
+ *  5
  *  Type: `int list * int -> int list`
  *  Desc: Take a list l and an integer n and return a list that
  *        contains all the elements in l that are greater than
@@ -75,6 +80,7 @@ fun triangleR(a, b, c) =
 
 
 (*
+ *  6
  *  Type: `''a list * ''a list -> bool`
  *  Desc: Return true if the first list is a suffix of the
  *        second list and false otherwise. Do not reverse
@@ -101,6 +107,7 @@ fun suffix([], _) = true
 
 
 (*
+ *  7
  *  Type: `'a list * int → 'a`
  *  Desc: This function takes a list and an integer i and
  *        returns the ith element in the list. Start the
@@ -112,6 +119,7 @@ fun get([], _) = raise Empty
 
 
 (*
+ *  8
  *  Type: `'a list * int * int → 'a list`
  *  Desc: This function takes a list and two integers i and j
  *        and returns a subList that includes everything from
@@ -137,13 +145,15 @@ fun subList([], _, _) = []
 
 
 (*
+ *  9
  *  Type: `'a list → 'a list`
  *  Desc: Reverse the list without using append
  *)
 fun reverse li = foldl (fn(cur, acc) => cur::acc) [] li;
 
 
 (*
+ *  10
  *  Type: `'a list * ('a → 'b) → 'b list`
  *  Desc: Apply a function to a list of elements. You may not
  *        use map, foldr, or foldl.
@@ -156,6 +166,7 @@ fun apply([], f) = []
 
 
 (*
+ *  11
  *  Type: `'a list * 'b * ('a * 'b → 'b) → 'b`
  *  Desc: Take a list, a starting value, and a function and
  *        collapse the list down using the function. You may
@@ -170,6 +181,7 @@ fun collapse([], startVal, f) = startVal
 
 
 (*
+ *  12
  *  Type: `('a * 'a → bool) → 'a list → 'a list`
  *  Desc: Sort a list using the quicksort method, but make it
  *        general enough so that you can pass in a function and
@@ -190,6 +202,7 @@ fun quicksort f [] = []
 
 
 (*
+ *  13
  *  Type: `('a * 'a → bool) → 'a list → 'a list`
  *  Desc: Sort a list using the bubble sort method, but make it
  *        general enough so that you can pass in a function and
@@ -215,6 +228,7 @@ fun bubbleSort f [] = []
 
 
 (*
+ *  14
  *  Type: `('a * 'a → bool) → 'a list → 'a list`
  *  Desc: Sort a list using the insertion sort method, but make it
  *        general enough so that you can pass in a function and
@@ -232,6 +246,7 @@ fun insertionSort f [] = []
 
 
 (*
+ *  15
  *  Type: `string → string → bool`
  *  Desc: Determine if a string is a substring of another
  *        string.
@@ -257,6 +272,7 @@ fun substring "" "" = true
 
 
 (*
+ *  16
  *  Type: `'a → 'a list → int`
  *  Desc: Determine the index of the first occurrence of a value in a list. 
  *        Indexing should start at 0.
@@ -277,6 +293,7 @@ fun indexOf target li =
 
 
 (*
+ *  17
  *  Type: `int → int → string`
  *  Desc: Turn a decimal number into a string representation of base N. 
  *        The input for N will be an integer between 2 and 10 (inclusive).
@@ -300,6 +317,7 @@ fun dec2BaseN base n =
 
 
 (*
+ *  18
  *  Type: `int → 'a list → 'a list`
  *  Desc: Drop every nth element in a list.
  *)
@@ -320,6 +338,7 @@ fun dropNth _ [] = []
 
 
 (*
+ *  19
  *  Type: `'a list list → 'a list`
  *  Desc: Takes a list of lists and flattens it so that it is
  *        now just a single list of elements. It should contain
@@ -331,6 +350,7 @@ fun flatten li = foldr (fn(cur, acc) => cur @ acc) [] li;
 
 
 (*
+ *  20
  *  Type: `('a * 'b → 'b) → 'b → 'a list list → 'b list`
  *  Desc: Take a list of lists, a function, and a starting
  *        value. Apply the function recursively to each list,
@@ -342,6 +362,7 @@ fun condenseLists f startVal li = foldr (fn(cur, acc) => collapse(cur, startVal,
 
 
 (*
+ *  21
  *  Type: `('a → bool) → 'a list → 'a list`
  *  Desc: Remove all the elements from a list for which the
  *        given function returns true. This should be a
@@ -351,6 +372,7 @@ fun remove f li = foldr (fn(cur, acc) => if f(cur) then acc else cur::acc) [] li
 
 
 (*
+ *  22
  *  Type: `'a list → 'a list`
  *  Desc: Take a list and create a new list where every element
  *        is repeated three times. Do not use append.
@@ -359,6 +381,7 @@ fun triplist li = foldr (fn(cur, acc) => cur::cur::cur::acc) [] li;
 
 
 (*
+ *  23
  *  Type: `'a list → int → 'a list`
  *  Desc: Take a list l and an integer n and create a list that
  *        repeats l n times.
@@ -368,6 +391,7 @@ fun repeat li 0 = []
 
 
 (*
+ *  24
  *  Type: `'a list → ('a → bool) → ('a → 'a) → 'a list`
  *  Desc: Takes a list l, a function f, and a function g. It
  *        then returns a list where all the elements in l for
@@ -378,6 +402,7 @@ fun filterApply li f g = foldr (fn(cur, acc) => if f(cur) then g(cur)::acc else
 
 
 (*
+ *  25
  *  Type: `int → int → int → int list`
  *  Desc: Given three integers (a, d, and l), create a
  *        list of length l that contains an arithmetic
@@ -390,6 +415,7 @@ fun arithSeq a d 0 = []
 
 
 (*
+ *  26
  *  Type: `'a → 'a list → bool`
  *  Desc: Return true if the element is in the list, 
  *        false otherwise.
@@ -399,6 +425,7 @@ fun element x [] = false
 
 
 (*
+ *  27
  *  Type: `'a list → bool`
  *  Desc: Return true if the list is a set, meaning that
  *        it has no duplicate values. Return false
@@ -409,6 +436,7 @@ fun isSet([]) = true
 
 
 (*
+ *  28
  *  Type: `'a list * 'a list → 'a list`
  *  Desc: Combine two lists, which you can assume are
  *        sets, to produce the union of the two sets. The
@@ -421,6 +449,7 @@ fun union([], []) = []
 
 
 (*
+ *  29
  *  Type: `'a list * 'a list → 'a list`
  *  Desc: Combine two lists, which you can assume are
  *        sets, to produce the intersection of the two
@@ -437,6 +466,7 @@ fun intersection(li1, li2) =
 
 
 (*
+ *  30
  *  Type: `'a list * 'a list → 'a list`
  *  Desc: Combine two lists, which you can assume are
  *        sets, to produce the difference of the two sets
@@ -449,6 +479,7 @@ fun difference([], _) = []
 
 
 (*
+ *  31
  *  Type: `'a list * 'a list → 'a list`
  *  Desc: Combine two lists, which you can assume are
  *        sets, to produce the xor of the two sets (i.e.
@@ -460,6 +491,7 @@ fun xor(li1, li2) = union(difference(li1, li2), difference(li2, li1));
 
 
 (*
+ *  32
  *  Type: `'a list → 'a list list`
  *  Desc: Given a list that you can assume is a set,
  *        return the powerset of the set (i.e. the set of

test-la-01.sh

@@ -1,4 +1,4 @@
 #!/bin/bash
 #
-#./test --rootdir tests/tests-large_assignment_01 --failed-first --log-cli-level WARNING $@
-./test --rootdir tests/tests-large_assignment_01 --nl --log-cli-level INFO
+#./test --rootdir tests/tests-la1 --failed-first --log-cli-level WARNING $@
+./test --rootdir tests/tests-la1 --nl --log-cli-level INFO

tests/tests-large_assignment_01/test_apply.sml → tests/tests-la1/test_apply.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 val testCasesApplyInt = [

tests/tests-large_assignment_01/test_arithSeq.sml → tests/tests-la1/test_arithSeq.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 (* Test cases for arithSeq *)

tests/tests-large_assignment_01/test_bubbleSort.sml → tests/tests-la1/test_bubbleSort.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 (* Integer Test Cases *)

tests/tests-large_assignment_01/test_collapse.sml → tests/tests-la1/test_collapse.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 val testCasesCollapseInt = [

tests/tests-large_assignment_01/test_condenseLists.sml → tests/tests-la1/test_condenseLists.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 (* Test cases for integer lists *)

tests/tests-large_assignment_01/test_cycle.sml → tests/tests-la1/test_cycle.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 val testCycle = [

tests/tests-large_assignment_01/test_dec2BaseN.sml → tests/tests-la1/test_dec2BaseN.sml

@@ -2,7 +2,7 @@
 
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 (* Test cases for the dec2BaseN function *)

tests/tests-large_assignment_01/test_difference.sml → tests/tests-la1/test_difference.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 (* Helper function to compare lists as sets (order doesn't matter) *)

tests/tests-large_assignment_01/test_dropNth.sml → tests/tests-la1/test_dropNth.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 (* Integer List Test Cases *)

tests/tests-large_assignment_01/test_element.sml → tests/tests-la1/test_element.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 (* Test cases for integer lists *)

tests/tests-large_assignment_01/test_filterApply.sml → tests/tests-la1/test_filterApply.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 (* Helper function to append "x" to a string *)

tests/tests-large_assignment_01/test_flatten.sml → tests/tests-la1/test_flatten.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 (* Test cases for integer lists *)

tests/tests-large_assignment_01/test_get.sml → tests/tests-la1/test_get.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 val testCasesGetInt = [

tests/tests-large_assignment_01/test_gtList.sml → tests/tests-la1/test_gtList.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 val testCasesGtList = [

tests/tests-large_assignment_01/test_indexOf.sml → tests/tests-la1/test_indexOf.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 (* Test cases for the indexOf function *)

tests/tests-large_assignment_01/test_insertionSort.sml → tests/tests-la1/test_insertionSort.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 (* Integer Test Cases *)

tests/tests-large_assignment_01/test_intersection.sml → tests/tests-la1/test_intersection.sml

@@ -1,6 +1,6 @@
 (* Large Assignment 01 Tests *)
 
-use "src/large_assignment_01/large_assignment_01.sml";
+use "src/la1/la1.sml";
 use "tests/utils.sml";
 
 (* Helper function to compare lists as sets (order doesn't matter) *)