@grain/stdlib 0.4.0 → 0.4.4

package/CHANGELOG.md

@@ -1,5 +1,70 @@
 # Changelog
 
+### [0.4.4](https://www.github.com/grain-lang/grain/compare/stdlib-v0.4.3...stdlib-v0.4.4) (2021-12-11)
+
+
+### Features
+
+* **stdlib:** Add reverse function to String module ([#1027](https://www.github.com/grain-lang/grain/issues/1027)) ([df761db](https://www.github.com/grain-lang/grain/commit/df761db55b3e14e31190090ae008ce5047135c09))
+* **stdlib:** Add rotate function in Array module ([#838](https://www.github.com/grain-lang/grain/issues/838)) ([98fc577](https://www.github.com/grain-lang/grain/commit/98fc577ee754317cd2421bfaa8e3c1e049488949))
+* **stdlib:** Add sort function to Array module ([#1012](https://www.github.com/grain-lang/grain/issues/1012)) ([9091930](https://www.github.com/grain-lang/grain/commit/9091930344224925bb7b2e1ef6f879c79a5c2f62))
+* **stdlib:** Implement List.sort via mergesort ([#1014](https://www.github.com/grain-lang/grain/issues/1014)) ([a076e20](https://www.github.com/grain-lang/grain/commit/a076e200013114ccf16c2e6cbe814af1ec09c1ce))
+* **stdlib:** Number.parseInt ([#1051](https://www.github.com/grain-lang/grain/issues/1051)) ([abafb58](https://www.github.com/grain-lang/grain/commit/abafb587e54219a32ed77ba09863bb2d6a80bac8))
+
+
+### Bug Fixes
+
+* **graindoc:** Ensure value_description is resolved to outcome before printing ([#1070](https://www.github.com/grain-lang/grain/issues/1070)) ([5eb05cc](https://www.github.com/grain-lang/grain/commit/5eb05cc2dedc3b933e194be86dd5d3c3656d6490))
+* **stdlib:** Add bounds checking to Buffer addStringSlice & addBytesSlice ([#1065](https://www.github.com/grain-lang/grain/issues/1065)) ([06fe512](https://www.github.com/grain-lang/grain/commit/06fe512e863aeeb855ccf3e3b83bcd3bc8854723))
+* **stdlib:** Fix String.encode GC ([#1067](https://www.github.com/grain-lang/grain/issues/1067)) ([0ab38c9](https://www.github.com/grain-lang/grain/commit/0ab38c9f4aa0ee84688ba5c6bec1521b380d38b1))
+* **stdlib:** Removed memory leak in Hash module ([#1045](https://www.github.com/grain-lang/grain/issues/1045)) ([01a81c6](https://www.github.com/grain-lang/grain/commit/01a81c6a2573cca94b2d57d0fc70693d39f810a1))
+* **stdlib:** Removed memory leaks in Buffer module ([#1047](https://www.github.com/grain-lang/grain/issues/1047)) ([d33017b](https://www.github.com/grain-lang/grain/commit/d33017b37e988d3facbca2e30e3de4fb8c7b5b8a))
+* **stdlib:** Support arrays of any type in Array rotate ([#1048](https://www.github.com/grain-lang/grain/issues/1048)) ([3ceb1cf](https://www.github.com/grain-lang/grain/commit/3ceb1cf04c1604f49077e8733dcccb6cdaaf9f3a))
+* **stdlib:** Support empty arrays in Array rotate ([3ceb1cf](https://www.github.com/grain-lang/grain/commit/3ceb1cf04c1604f49077e8733dcccb6cdaaf9f3a))
+
+### [0.4.3](https://www.github.com/grain-lang/grain/compare/stdlib-v0.4.2...stdlib-v0.4.3) (2021-10-27)
+
+
+### Features
+
+* **stdlib:** Add cycle function to Array module ([#993](https://www.github.com/grain-lang/grain/issues/993)) ([c595622](https://www.github.com/grain-lang/grain/commit/c595622b28366655dfd5447270e8f9fc3f988a67))
+
+
+### Bug Fixes
+
+* **compiler:** Ensure TExpApp is always expansive in Grain ([ef0a69f](https://www.github.com/grain-lang/grain/commit/ef0a69fb4418d318b3227e5db7e743a026762274))
+* **compiler:** Handle let-mut value restriction, such that mutable lets are always expansive ([ef0a69f](https://www.github.com/grain-lang/grain/commit/ef0a69fb4418d318b3227e5db7e743a026762274))
+* **compiler:** Properly handle value restriction on function application & mutable vars ([#988](https://www.github.com/grain-lang/grain/issues/988)) ([ef0a69f](https://www.github.com/grain-lang/grain/commit/ef0a69fb4418d318b3227e5db7e743a026762274))
+* **runtime:** Add types to boxed GC functions to avoid weak type errors ([ef0a69f](https://www.github.com/grain-lang/grain/commit/ef0a69fb4418d318b3227e5db7e743a026762274))
+* **stdlib:** Fixed memory leak in String.explode ([#1001](https://www.github.com/grain-lang/grain/issues/1001)) ([c479a05](https://www.github.com/grain-lang/grain/commit/c479a05f48abcc4c9e98d5cf0ba698230d41031b))
+
+### [0.4.2](https://www.github.com/grain-lang/grain/compare/stdlib-v0.4.1...stdlib-v0.4.2) (2021-10-11)
+
+
+### Features
+
+* **compiler:** Inline not `(!)` operator ([#937](https://www.github.com/grain-lang/grain/issues/937)) ([3f5e9a9](https://www.github.com/grain-lang/grain/commit/3f5e9a962ec8565f4fb79a1ee36d7b492da5cf11))
+* **stdlib:** Add Conv.wasmI32ToNumber function ([#978](https://www.github.com/grain-lang/grain/issues/978)) ([c93ade8](https://www.github.com/grain-lang/grain/commit/c93ade873b51acca556e19a7483a5f29b4b6caa9))
+* **stdlib:** Add string trim functions to String module ([#951](https://www.github.com/grain-lang/grain/issues/951)) ([e55de8f](https://www.github.com/grain-lang/grain/commit/e55de8fc0335b45252da9741a80b46a702cdb5b6))
+* **stdlib:** Regular Expressions ([#680](https://www.github.com/grain-lang/grain/issues/680)) ([9601e16](https://www.github.com/grain-lang/grain/commit/9601e1655f1ffc76b700efef317366457c5614ef))
+
+
+### Bug Fixes
+
+* **stdlib:** Fix Char.code memory issue ([#928](https://www.github.com/grain-lang/grain/issues/928)) ([dfa31d8](https://www.github.com/grain-lang/grain/commit/dfa31d8aa60a41d08494f3817bdb628a30d83f41))
+* **stdlib:** Fix issue with list printing ([#894](https://www.github.com/grain-lang/grain/issues/894)) ([e2a33a9](https://www.github.com/grain-lang/grain/commit/e2a33a9607bd076abbf6375389f1a7896775e6bc))
+* **stdlib:** Fix memory issue in list printing ([#912](https://www.github.com/grain-lang/grain/issues/912)) ([3e0a805](https://www.github.com/grain-lang/grain/commit/3e0a8059a36d1042fa06d6aed54565ced116fd87))
+* **stdlib:** Fix memory leaks in Char stdlib ([#929](https://www.github.com/grain-lang/grain/issues/929)) ([99cc94b](https://www.github.com/grain-lang/grain/commit/99cc94b3e2010c7fa6b2c244758dbbe13e43f903))
+
+### [0.4.1](https://www.github.com/grain-lang/grain/compare/stdlib-v0.4.0...stdlib-v0.4.1) (2021-09-07)
+
+
+### Bug Fixes
+
+* **stdlib:** Annotate generic types in Buffer ([#876](https://www.github.com/grain-lang/grain/issues/876)) ([ad46b9e](https://www.github.com/grain-lang/grain/commit/ad46b9e6b0d2d9d562b56e5cbf1ae6751028d93a))
+* **stdlib:** Correct fdPwrite return value ([#875](https://www.github.com/grain-lang/grain/issues/875)) ([ceaf6af](https://www.github.com/grain-lang/grain/commit/ceaf6af52889f5d7c8a16df9a5a9ae5ff6752105))
+* **stdlib:** Correct type signatures on some Array functions ([#880](https://www.github.com/grain-lang/grain/issues/880)) ([04bf4d3](https://www.github.com/grain-lang/grain/commit/04bf4d3066cf80de8cb3da834124e29558c6d21a))
+
 ## [0.4.0](https://www.github.com/grain-lang/grain/compare/stdlib-v0.3.2...stdlib-v0.4.0) (2021-09-06)
 
 

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2017-2021 Oscar Spencer <oscar@grain-lang.org> and Philip Blair <philip@grain-lang.org>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,34 @@
+# @grain/stdlib
+
+The standard library for the Grain language.
+
+## Why
+
+This package provides a distributable copy of the Grain standard library. Currently, it is available through npm.
+
+## Installation
+
+Usually, you won't need to install this package. However, if you need it, install it with npm:
+
+```sh
+npm install @grain/stdlib
+```
+
+## Usage
+
+Grain programs will search for an imported module in the `stdlib` if not available in your other search paths.
+
+For example, you can import the `number` stdlib:
+
+```grain
+import Number from "number"
+Number.abs(-1)
+```
+
+## API
+
+This package includes generated markdown documentation, but we recommend using our API docs on [grain-lang.org](https://grain-lang.org/docs/stdlib/pervasives).
+
+## License
+
+MIT

package/array.gr

@@ -232,6 +232,24 @@ export let copy = (array) => {
   init(length(array), n => array[n])
 }
 
+/**
+ * Iterates an array a given number of times, calling an iterator function on each element.
+ *
+ * @param fn: The iterator function to call with each element
+ * @param n: The number of times to iterate the given array
+ * @param array: The array to iterate
+ *
+ * @since v0.4.4
+ */
+export let cycle = (fn, n, array) => {
+  let length = length(array)
+  for (let mut iteration = 0; iteration < n; iteration += 1) {
+    for (let mut count = 0; count < length; count += 1) {
+      fn(array[count]): (Void)
+    }
+  }
+}
+
 /**
  * Iterates an array, calling an iterator function on each element.
  *
@@ -243,10 +261,8 @@ export let copy = (array) => {
  */
 export let forEach = (fn, array) => {
   let length = length(array)
-  let mut count = 0
-  while (count < length) {
-    fn(array[count])
-    count = incr(count)
+  for (let mut count = 0; count < length; count += 1) {
+    fn(array[count]): (Void)
   }
 }
 
@@ -262,10 +278,8 @@ export let forEach = (fn, array) => {
  */
 export let forEachi = (fn, array) => {
   let length = length(array)
-  let mut count = 0
-  while (count < length) {
-    fn(array[count], count)
-    count = incr(count)
+  for (let mut count = 0; count < length; count += 1) {
+    fn(array[count], count): (Void)
   }
 }
 
@@ -435,9 +449,12 @@ export let fillRange = (value, start, stop, array) => {
   }
 
   let mut index = startIndex
-  while (index < stopIndex && index < length) {
-    array[index] = value
+  for (
+    let mut index = startIndex;
+    index < stopIndex && index < length;
     index += 1
+  ) {
+    array[index] = value
   }
   void
 }
@@ -520,11 +537,9 @@ export let fromList = (list) => {
 export let contains = (search, array) => {
   // TODO: This should use recursion when we can pattern match arrays
   let len = length(array)
-  let mut index = 0
   let mut found = false
-  while ((!found) && (index < len)) {
-    found = (array[index] == search)
-    index += 1
+  for (let mut index = 0; !found && index < len; index += 1) {
+    found = array[index] == search
   }
   found
 }
@@ -552,7 +567,7 @@ export let find = (fn, array) => {
         matchedItem = array[count]
         count = length
       } else {
-        count = incr(count)
+        count += 1
       }
     }
     if(!matching) {
@@ -586,7 +601,7 @@ export let findIndex = (fn, array) => {
         matchedIndex = count
         count = length
       } else {
-        count = incr(count)
+        count += 1
       }
     }
     if(!matching) {
@@ -607,14 +622,14 @@ export let findIndex = (fn, array) => {
  *
  * @since v0.2.0
  */
-export let product = (array1, array2) => {
+export let product = (array1: Array<a>, array2: Array<b>) => {
   let lenA = length(array1)
   let lenB = length(array2)
   let mut indexA = -1
 
   init(lenA * lenB, n => {
     if(n % lenB == 0){
-      indexA = incr(indexA)
+      indexA += 1
     } else {
       indexA = indexA
     }
@@ -635,12 +650,9 @@ export let count = (fn, array) => {
   let length = length(array)
   let mut position = 0
   let mut count = 0
-  while (position < length) {
+  for (let mut position = 0; position < length; position += 1) {
     if(fn(array[position])) {
-      count = incr(count)
-      position = incr(position)
-    } else {
-      position = incr(position)
+      count += 1
     }
   }
   count
@@ -658,14 +670,10 @@ export let count = (fn, array) => {
  */
 export let counti = (fn, array) => {
   let length = length(array)
-  let mut position = 0
   let mut count = 0
-  while (position < length) {
-    if(fn(array[position], position)) {
-      count = incr(count)
-      position = incr(position)
-    } else {
-      position = incr(position)
+  for (let mut position = 0; position < length; position += 1) {
+    if (fn(array[position], position)) {
+      count += 1
     }
   }
   count
@@ -688,7 +696,7 @@ export let filter = (fn, array) => {
   forEach((el) => {
     if (fn(el)) {
       filtered[position] = el
-      position = incr(position)
+      position += 1
     }
   }, array)
   init(position, (index) => {
@@ -713,7 +721,7 @@ export let filteri = (fn, array) => {
   forEachi((el, index) => {
     if (fn(el, index)) {
       filtered[position] = el
-      position = incr(position)
+      position += 1
     }
   }, array)
   init(position, (index) => {
@@ -750,7 +758,7 @@ export let unique = (array) => {
  *
  * @since v0.4.0
  */
-export let zip = (array1, array2) => {
+export let zip = (array1: Array<a>, array2: Array<b>) => {
   let len = length(array1)
   if (len != length(array2)) {
     fail "arguments to zip must be same length"
@@ -805,6 +813,18 @@ export let join = (separator: String, items: Array<String>) => {
   }
 }
 
+/**
+ * A simple helper function to convert a negative array index
+ * number to its positive positional equivalent.
+ */
+let wrapNegativeIndex = (arrLen, idx) => {
+  if (idx >= 0) {
+    idx
+  } else {
+    arrLen + idx
+  }
+}
+
 /**
  * Slices an array given zero-based start and end indexes. The value
  * at the end index will not be included in the result.
@@ -821,17 +841,8 @@ export let join = (separator: String, items: Array<String>) => {
  */
 export let slice = (startIndex, endIndex, array) => {
   let arrayLength = length(array)
-
-  let wrapNegativeIndex = idx => {
-    if (idx >= 0) {
-      idx
-    } else {
-      arrayLength + idx
-    }
-  }
-
-  let startIndex = wrapNegativeIndex(startIndex)
-  let endIndex = wrapNegativeIndex(endIndex)
+  let startIndex = wrapNegativeIndex(arrayLength, startIndex)
+  let endIndex = wrapNegativeIndex(arrayLength, endIndex)
   // Ensure we aren't working with an `end` value that is too big
   let endIndex = if (endIndex > arrayLength) {
     arrayLength
@@ -848,3 +859,84 @@ export let slice = (startIndex, endIndex, array) => {
     init(newLength, n => array[startIndex + n])
   }
 }
+
+/**
+ * Sorts an array in-place.
+ *
+ * Ordering is calculated using a comparator function which takes two array elements and must return 0 if both are equal, a positive number if the first is greater, and a negative number if the first is smaller.
+ * @param comp: The comparator function used to indicate sort order
+ * @param array: The array to be sorted
+ * @since v0.4.5
+ */
+export let sort = (comp, array) => {
+  let partition = (low, high) => {
+    let pivot = array[high]
+    let mut i = low - 1
+    for(let mut j = low; j < high; j += 1) {
+      if(comp(array[j], pivot) < 0){
+        i += 1
+        let temp = array[i]
+        array[i] = array[j]
+        array[j] = temp
+      }
+    }
+    let temp = array[i + 1]
+    array[i + 1] = array[high]
+    array[high] = temp
+    i + 1
+  }
+  let rec quicksort = (low, high) => {
+    if(low < high){
+      let partitionIndex = partition(low, high)
+      quicksort(partitionIndex + 1, high)
+      quicksort(low, partitionIndex - 1)
+    }
+  }
+  let len = length(array)
+  quicksort(0, len - 1)
+}
+
+/**
+ * Rotates an array by n elements to the right, in place.
+ *
+ * If n is negative, the array will be rotated by n elements
+ * to the left. See examples.
+ *
+ * @param n: The number of elements to rotate by
+ * @param arr: The array to be rotated
+ *
+ * @example let array = [> 1, 2, 3, 4, 5]; rotate(2, arr); arr == [> 4, 5, 1, 2, 3]
+ * @example let array = [> 1, 2, 3, 4, 5]; rotate(-1, arr); arr == [> 2, 3, 4, 5, 1]
+ * @since v0.4.5
+ */
+export let rotate = (n, arr) => {
+  let rec gcd = (a, b) => {
+    if (b == 0) {
+      a
+    }
+    else{
+      gcd(b, a % b)
+    }
+  }
+
+  let arrLen = length(arr)
+  if (arrLen > 0) {
+    let k = n % arrLen
+    let mut d = -1
+    let mut j  = 0
+    for (let mut i = 0; i < gcd(arrLen, k); i += 1) {
+      j = i
+      let temp = arr[i]
+      while (true) {
+        d = (j - k) % arrLen
+        if (d == i) {
+          break
+        }
+        let newVal = arr[d]
+        arr[j] = newVal
+        j = d
+      }
+      arr[j] = temp
+    }
+  }
+}

package/array.md

@@ -48,7 +48,7 @@ Returns:
 
 |type|description|
 |----|-----------|
-|`Number`|The amount of elements in the array|
+|`Number`|The number of elements in the array|
 
 ### Array.**make**
 
@@ -263,6 +263,27 @@ Returns:
 |----|-----------|
 |`Array<a>`|The new array containing the elements from the input|
 
+### Array.**cycle**
+
+<details disabled>
+<summary tabindex="-1">Added in <code>next</code></summary>
+No other changes yet.
+</details>
+
+```grain
+cycle : ((a -> Void), Number, Array<a>) -> Void
+```
+
+Iterates an array a given number of times, calling an iterator function on each element.
+
+Parameters:
+
+|param|type|description|
+|-----|----|-----------|
+|`fn`|`a -> Void`|The iterator function to call with each element|
+|`n`|`Number`|The number of times to iterate the given array|
+|`array`|`Array<a>`|The array to iterate|
+
 ### Array.**forEach**
 
 <details>
@@ -278,7 +299,7 @@ Returns:
 </details>
 
 ```grain
-forEach : ((a -> b), Array<a>) -> Void
+forEach : ((a -> Void), Array<a>) -> Void
 ```
 
 Iterates an array, calling an iterator function on each element.
@@ -287,7 +308,7 @@ Parameters:
 
 |param|type|description|
 |-----|----|-----------|
-|`fn`|`a -> b`|The iterator function to call with each element|
+|`fn`|`a -> Void`|The iterator function to call with each element|
 |`array`|`Array<a>`|The array to iterate|
 
 ### Array.**forEachi**
@@ -305,7 +326,7 @@ Parameters:
 </details>
 
 ```grain
-forEachi : (((a, Number) -> b), Array<a>) -> Void
+forEachi : (((a, Number) -> Void), Array<a>) -> Void
 ```
 
 Iterates an array, calling an iterator function with each element.
@@ -315,7 +336,7 @@ Parameters:
 
 |param|type|description|
 |-----|----|-----------|
-|`fn`|`(a, Number) -> b`|The iterator function to call with each element|
+|`fn`|`(a, Number) -> Void`|The iterator function to call with each element|
 |`array`|`Array<a>`|The array to iterate|
 
 ### Array.**map**
@@ -350,7 +371,7 @@ Returns:
 
 |type|description|
 |----|-----------|
-|`Array<a>`|The new array with mapped values|
+|`Array<b>`|The new array with mapped values|
 
 ### Array.**mapi**
 
@@ -377,7 +398,7 @@ Returns:
 
 |type|description|
 |----|-----------|
-|`Array<a>`|The new array with mapped values|
+|`Array<b>`|The new array with mapped values|
 
 ### Array.**reduce**
 
@@ -404,7 +425,7 @@ Parameters:
 |-----|----|-----------|
 |`fn`|`(a, b) -> a`|The reducer function to call on each element, where the value returned will be the next accumulator value|
 |`initial`|`a`|The initial value to use for the accumulator on the first iteration|
-|`array`|`Array<a>`|The array to iterate|
+|`array`|`Array<b>`|The array to iterate|
 
 Returns:
 
@@ -444,7 +465,7 @@ Parameters:
 |-----|----|-----------|
 |`fn`|`(a, b, Number) -> a`|The reducer function to call on each element, where the value returned will be the next accumulator value|
 |`initial`|`a`|The initial value to use for the accumulator on the first iteration|
-|`array`|`Array<a>`|The array to iterate|
+|`array`|`Array<b>`|The array to iterate|
 
 Returns:
 
@@ -479,7 +500,7 @@ Returns:
 
 |type|description|
 |----|-----------|
-|`Array<a>`|The new array|
+|`Array<b>`|The new array|
 
 ### Array.**every**
 
@@ -581,7 +602,7 @@ Parameters:
 ### Array.**reverse**
 
 <details disabled>
-<summary tabindex="-1">Added in <code>next</code></summary>
+<summary tabindex="-1">Added in <code>0.4.0</code></summary>
 No other changes yet.
 </details>
 
@@ -740,7 +761,7 @@ No other changes yet.
 </details>
 
 ```grain
-product : (Array<a>, Array<a0>) -> Array<(a, a0)>
+product : (Array<a>, Array<b>) -> Array<(a, b)>
 ```
 
 Combines two arrays into a Cartesian product of tuples containing
@@ -751,13 +772,13 @@ Parameters:
 |param|type|description|
 |-----|----|-----------|
 |`array1`|`Array<a>`|The array to provide values for the first tuple element|
-|`array2`|`Array<a>`|The array to provide values for the second tuple element|
+|`array2`|`Array<b>`|The array to provide values for the second tuple element|
 
 Returns:
 
 |type|description|
 |----|-----------|
-|`Array<(a, a0)>`|The new array containing all pairs of `(a, b)`|
+|`Array<(a, b)>`|The new array containing all pairs of `(a, b)`|
 
 ### Array.**count**
 
@@ -897,12 +918,12 @@ Returns:
 ### Array.**zip**
 
 <details disabled>
-<summary tabindex="-1">Added in <code>next</code></summary>
+<summary tabindex="-1">Added in <code>0.4.0</code></summary>
 No other changes yet.
 </details>
 
 ```grain
-zip : (Array<a>, Array<a0>) -> Array<(a, a0)>
+zip : (Array<a>, Array<b>) -> Array<(a, b)>
 ```
 
 Produces a new array filled with tuples of elements from both given arrays.
@@ -916,18 +937,18 @@ Parameters:
 |param|type|description|
 |-----|----|-----------|
 |`array1`|`Array<a>`|The array to provide values for the first tuple element|
-|`array2`|`Array<a>`|The array to provide values for the second tuple element|
+|`array2`|`Array<b>`|The array to provide values for the second tuple element|
 
 Returns:
 
 |type|description|
 |----|-----------|
-|`Array<(a, a0)>`|The new array containing indexed pairs of `(a, b)`|
+|`Array<(a, b)>`|The new array containing indexed pairs of `(a, b)`|
 
 ### Array.**unzip**
 
 <details disabled>
-<summary tabindex="-1">Added in <code>next</code></summary>
+<summary tabindex="-1">Added in <code>0.4.0</code></summary>
 No other changes yet.
 </details>
 
@@ -952,7 +973,7 @@ Returns:
 ### Array.**join**
 
 <details disabled>
-<summary tabindex="-1">Added in <code>next</code></summary>
+<summary tabindex="-1">Added in <code>0.4.0</code></summary>
 No other changes yet.
 </details>
 
@@ -978,7 +999,7 @@ Returns:
 ### Array.**slice**
 
 <details disabled>
-<summary tabindex="-1">Added in <code>next</code></summary>
+<summary tabindex="-1">Added in <code>0.4.0</code></summary>
 No other changes yet.
 </details>
 
@@ -1006,3 +1027,58 @@ Returns:
 |----|-----------|
 |`Array<a>`|The subset of the array that was sliced|
 
+### Array.**sort**
+
+<details disabled>
+<summary tabindex="-1">Added in <code>next</code></summary>
+No other changes yet.
+</details>
+
+```grain
+sort : (((a, a) -> Number), Array<a>) -> Void
+```
+
+Sorts an array in-place.
+
+Ordering is calculated using a comparator function which takes two array elements and must return 0 if both are equal, a positive number if the first is greater, and a negative number if the first is smaller.
+
+Parameters:
+
+|param|type|description|
+|-----|----|-----------|
+|`comp`|`(a, a) -> Number`|The comparator function used to indicate sort order|
+|`array`|`Array<a>`|The array to be sorted|
+
+### Array.**rotate**
+
+<details disabled>
+<summary tabindex="-1">Added in <code>next</code></summary>
+No other changes yet.
+</details>
+
+```grain
+rotate : (Number, Array<a>) -> Void
+```
+
+Rotates an array by n elements to the right, in place.
+
+If n is negative, the array will be rotated by n elements
+to the left. See examples.
+
+Parameters:
+
+|param|type|description|
+|-----|----|-----------|
+|`n`|`Number`|The number of elements to rotate by|
+|`arr`|`Array<a>`|The array to be rotated|
+
+Examples:
+
+```grain
+let array = [> 1, 2, 3, 4, 5]; rotate(2, arr); arr == [> 4, 5, 1, 2, 3]
+```
+
+```grain
+let array = [> 1, 2, 3, 4, 5]; rotate(-1, arr); arr == [> 2, 3, 4, 5, 1]
+```
+