@effekt-lang/effekt 0.77.0 → 0.78.0

package/libraries/common/array.effekt

@@ -63,9 +63,10 @@ extern def unsafeAllocate[T](size: Int) at global: Array[T] =
 
 /// Fills a given array in-place.
 def fill[T](arr: Array[T], filler: T): Unit = {
-  arr.foreachIndex { (idx, _) =>
-    arr.set(idx, filler)
-  }
+  val n = arr.size
+  def go(i: Int): Unit =
+    if (i < n) { arr.set(i, filler); go(i + 1) }
+  go(0)
 }
 
 /// Creates a new Array of size `size` filled with the value `init`

package/libraries/common/bytearray.effekt

@@ -113,17 +113,35 @@ def build(size: Int) { index: Int => Byte }: ByteArray = {
   arr
 }
 
+/// Copies `length`-many bytes from `from` to `to`
+/// starting at `start` (in `from`) and `offset` (in `to`).
+/// The ranges may overlap, even within the same bytearray: the source bytes are
+/// read before any are written. Panics if out of bounds.
+///
+/// O(N)
+def copy(from: ByteArray, start: Int, to: ByteArray, offset: Int, length: Int): Unit =
+  if (length < 0 || start < 0 || offset < 0
+      || start + length > from.size || offset + length > to.size) {
+    <{ "bytearray::copy: range out of bounds" }>
+  } else {
+    unsafeCopy(from, start, to, offset, length)
+  }
+
+/// `copy` without its bounds check.
+/// Corrupts memory if misused; prefer `copy`.
+extern def unsafeCopy(from: ByteArray, start: Int, to: ByteArray, offset: Int, length: Int) at global: Unit =
+  js "bytearray$copy(${from}, ${start}, ${to}, ${offset}, ${length})"
+  chez "(bytevector-copy! ${from} ${start} ${to} ${offset} ${length})"
+  llvm """
+    %z = call %Pos @c_bytearray_copy(%Pos ${from}, %Int ${start}, %Pos ${to}, %Int ${offset}, %Int ${length})
+    ret %Pos %z
+  """
+
 def resize(source: ByteArray, size: Int): ByteArray = {
   val target = allocate(size)
-  val n = min(source.size, target.size)
-  def go(i: Int): ByteArray =
-    if (i < n) {
-      target.set(i, source.get(i))
-      go(i + 1)
-    } else {
-      target
-    }
-  go(0)
+  // safe: `min` establishes the bound for both ranges ~> no check is needed
+  unsafeCopy(source, 0, target, 0, min(source.size, size))
+  target
 }
 
 /// Sorts a given bytearray `arr` in-place using a counting sort,
@@ -190,6 +208,21 @@ extern def toString(arr: ByteArray) at {}: String =
   chez "(utf8->string ${arr})"
 
 extern js """
+  function bytearray$copy(src, srcOff, dst, dstOff, n) {
+    // for small `n`, it's faster to copy manually to avoid allocating `subarray`
+    if (n < 40) {
+      if (srcOff < dstOff) {
+        for (let i = n - 1; i >= 0; --i) dst[dstOff + i] = src[srcOff + i];
+      } else {
+        for (let i = 0; i < n; ++i) dst[dstOff + i] = src[srcOff + i];
+      }
+    } else {
+      // safe: `set` clones the source region first when both share a buffer
+      dst.set(src.subarray(srcOff, srcOff + n), dstOff);
+    }
+    return $effekt.unit;
+  }
+
   function bytearray$set(bytes, index, value) {
     bytes[index] = value;
     return $effekt.unit;
@@ -242,22 +275,8 @@ extern def compareByteArrayImpl(b1: ByteArray, b2: ByteArray) at {}: Int =
   """
   chez "(bytearray$compare ${b1} ${b2})"
 
-def compareByteArray(b1: ByteArray, b2: ByteArray): Ordering = {
-  val ret = compareByteArrayImpl(b1, b2)
-  if (ret == 0) {
-    Equal()
-  } else if (ret < 0) {
-    Less()
-  } else { // ret > 0
-    Greater()
-  }
-}
-
-def compareStringBytes(left: String, right: String): Ordering = {
-  val l = left.fromString
-  val r = right.fromString
-  compareByteArray(l, r)
-}
+def compareByteArray(b1: ByteArray, b2: ByteArray): Ordering =
+  compareByteArrayImpl(b1, b2).fromInt
 
 
 // Streaming

package/libraries/common/char.effekt

@@ -144,6 +144,10 @@ extern def infixGte(x: Char, y: Char) at {}: Bool =
     ret %Pos %adt_boolean
   """
 
+def compareChar(x: Char, y: Char): Ordering =
+  if (x == y) Equal()
+  else if (x < y) Less()
+  else Greater()
 
 /**
  * Determines the number of bytes needed by a codepoint
@@ -155,18 +159,21 @@ def utf8ByteCount(codepoint: Char): Int = codepoint match {
   case c and c >= '\u0080'  and c <= '\u07FF'   => 2
   case c and c >= '\u0800'  and c <= '\uFFFF'   => 3
   case c and c >= '\u10000' and c <= '\u10FFFF' => 4
-  case c => panic("Not a valid code point")
+  case c => <{ "Not a valid code point" }>
 }
 
 def utf16UnitCount(codepoint: Char): Int = codepoint match {
   case c and c >= '\u0000'  and c <= '\uFFFF'   => 1
-  case c and c >= '\u10000' and c <= '\u10FFFF' => 4
-  case c => panic("Not a valid code point")
+  case c and c >= '\u10000' and c <= '\u10FFFF' => 2
+  case c => <{ "Not a valid code point" }>
 }
 
+/// How many index units `c` occupies in the unit that `length` and `unsafeCharAt`
+/// use on this backend. Adding it to a code-point boundary gives the next character.
 extern def charWidth(c: Char) at {}: Int =
-  // JavaScript strings are UTF-16 where every unicode character after 0xffff takes two units
-  js "(${c} > 0xffff) ? 2 : 1"
+  js { utf16UnitCount(c) }
+  chez { 1 }
+  llvm { utf8ByteCount(c) }
 
 
 def decodeChar(): Char / {next[Byte], stop} = {

package/libraries/common/effekt.effekt

@@ -191,20 +191,25 @@ extern def random() at io: Double =
 // extern io def freshGlobal[T](t: T): Ref[T] at global = js "$effekt.fresh(${t})"
 
 
-// Equality
+// Comparison
 // ========
 
 /// Result of comparison between two objects according to some order:
 ///
 /// - `Less()` means that the first object is *before* the first in the order,
-/// - `Equal()` means that the two objects are the same in the order,
-/// - and `Greater()` means that the second object is *before* the first in the order.
+/// - `Equal()` means that the two objects are the same in the order, and
+/// - `Greater()` means that the second object is *before* the first in the order.
 type Ordering {
   Less();
   Equal();
   Greater()
 }
 
+def ordering::fromInt(n: Int): Ordering =
+  if (n == 0) Equal()
+  else if (n < 0) Less()
+  else Greater()
+
 def compareInt(n: Int, m: Int) =
   if (n == m) Equal()
   else if (n < m) Less()
@@ -215,16 +220,8 @@ extern def genericCompareImpl[R](x: R, y: R) at {}: Int =
 
 /// Compares two values of the same type, returning an `Ordering`.
 /// Only available on the JavaScript backend.
-def genericCompare[R](x: R, y: R): Ordering = {
-  val ret = genericCompareImpl(x, y)
-  if (ret == 0) {
-    Equal()
-  } else if (ret < 0) {
-    Less()
-  } else { // ret > 0
-    Greater()
-  }
-}
+def genericCompare[R](x: R, y: R): Ordering =
+  genericCompareImpl(x, y).fromInt
 
 def println(o: Ordering): Unit = println(o.show)
 

package/libraries/common/list.effekt

@@ -820,6 +820,28 @@ def partition[A](l: List[A]) { pred: A => Bool }: (List[A], List[A]) = {
   (lefts.reverse, rights.reverse)
 }
 
+/// List functions that we discourage to use, but should still be available
+namespace slow {
+  /// Find the first element in a list which satisfies a given predicate.
+  /// If there is no such element, returns None.
+  /// 
+  /// Examples:
+  /// ```
+  /// > [].slow::find{ x => x.mod(2) == 0 }
+  /// None()
+  /// > [1, 3, 6].slow::find{ x => x.mod(2) == 0 }
+  /// Some(6)
+  /// > [2, 4, 6].slow::find{ x => x.mod(2) == 0 }
+  /// Some(2)
+  /// ```
+  /// 
+  /// O(N)
+  def find[A](list: List[A]){ pred: A => Bool }: Option[A] = list match {
+    case Cons(x, xs) => if (pred(x)) Some(x) else find(xs){pred}
+    case Nil() => None()
+  }
+}
+
 /// Utilities for sorting, see 'sortBy' for more details.
 namespace sort {
   /// Splits the given list into monotonic segments (so a list of lists).

package/libraries/common/string.effekt

@@ -210,6 +210,28 @@ namespace internal {
       do emit(c.utf8ByteCount)
     }
   }
+
+  def compareCodePoints(left: String, right: String): Ordering = {
+    val ln = left.length
+    val rn = right.length
+    def go(i: Int, j: Int): Ordering =
+      if (i >= ln) { if (j >= rn) Equal() else Less() }
+      else if (j >= rn) Greater()
+      else {
+        val a = unsafeCharAt(left, i)
+        val b = unsafeCharAt(right, j)
+        compareChar(a, b) match {
+          case Equal() =>
+            // equal code points have equal widths, so take the step only once
+            val w = a.charWidth
+            go(i + w, j + w)
+          case Less() => Less()
+          case Greater() => Greater()
+        }
+      }
+
+    go(0, 0)
+  }
 }
 
 /// Returns the number of bytes that the given `str` would take up in a UTF-8 encoding.
@@ -235,6 +257,12 @@ extern def utf8ByteLength(str: String) at {io, global}: Int =
 // extern def unsafeIndexOf(str: String, sub: String) at {}: Int =
 //   js "${str}.indexOf(${sub})"
 
+/// Compares two strings lexicographically by code point.
+/// Identical on every backend.
+extern def compareStringBytes(left: String, right: String) at {}: Ordering =
+  llvm { compareByteArray(fromString(left), fromString(right)) }
+  default { internal::compareCodePoints(left, right) }
+
 def charAt(str: String, index: Int): Char / Exception[OutOfBounds] =
   if (index < 0 || index >= length(str))
     do raise(OutOfBounds(), "Index out of bounds: " ++ show(index) ++ " in string: '" ++ str ++ "'")

package/libraries/common/stringbuffer.effekt

@@ -28,11 +28,11 @@ def flushableStringBuffer[A] { program: () => A / { write, flush } }: A = {
     program()
   } with write { string =>
     val bytes = fromString(string)
-    ensureCapacity(bytes.size)
-    bytes.foreach { b =>
-      buffer.set(position, b)
-      position = position + 1
-    }
+    val n = bytes.size
+    ensureCapacity(n)
+    // safe: `ensureCapacity` just established the target range
+    bytearray::unsafeCopy(bytes, 0, buffer, position, n)
+    position = position + n
     resume(())
   } with flush {
     val string = buffer.resize(position).toString()

package/libraries/llvm/bytearray.c

@@ -56,6 +56,17 @@ uint8_t* c_bytearray_data(const struct Pos arr) {
     return data;
 }
 
+struct Pos c_bytearray_copy(const struct Pos source, const Int sourceOffset,
+                            const struct Pos target, const Int targetOffset,
+                            const Int length) {
+  // memmove, not memcpy: the ranges may overlap, and may even be the same bytearray
+  memmove(c_bytearray_data(target) + targetOffset,
+          c_bytearray_data(source) + sourceOffset, length);
+  erasePositive(source);
+  erasePositive(target);
+  return Unit;
+}
+
 struct Pos c_bytearray_construct(const uint64_t n, const uint8_t *data) {
     struct Pos arr = c_bytearray_new(n);
     memcpy(c_bytearray_data(arr), data, n);
@@ -134,11 +145,9 @@ struct Pos c_bytearray_concatenate(const struct Pos left, const struct Pos right
     uint64_t left_size = left.tag;
     uint64_t right_size = right.tag;
     const struct Pos concatenated = c_bytearray_new(left_size + right_size);
-    for (uint64_t j = 0; j < concatenated.tag; ++j)
-        c_bytearray_data(concatenated)[j]
-            = j < left_size
-            ? c_bytearray_data(left)[j]
-            : c_bytearray_data(right)[j - left_size];
+    // two memcpys rather than a byte loop with a branch per byte
+    memcpy(c_bytearray_data(concatenated), c_bytearray_data(left), left_size);
+    memcpy(c_bytearray_data(concatenated) + left_size, c_bytearray_data(right), right_size);
 
     erasePositive(left);
     erasePositive(right);

package/libraries/llvm/forward-declare-c.ll

@@ -25,6 +25,7 @@ declare %Int @c_bytearray_size(%Pos)
 declare %Byte @c_bytearray_get(%Pos, %Int)
 declare %Pos @c_bytearray_set(%Pos, %Int, %Byte)
 
+declare %Pos @c_bytearray_copy(%Pos, %Int, %Pos, %Int, %Int)
 declare ptr @c_bytearray_data(%Pos)
 declare %Pos @c_bytearray_construct(i64, ptr)
 

package/licenses/eclipse public license, version 2.0 - epl-2.0.html

@@ -1,9 +1,9 @@
 <!doctype html><html lang=en><head><meta charset=utf-8><meta http-equiv=X-UA-Compatible content="IE=edge"><meta name=viewport content="width=device-width,initial-scale=1"><title>Eclipse Public License 2.0 (EPL) | The Eclipse Foundation</title>
-<meta property="og:title" content="Eclipse Public License 2.0 (EPL) | The Eclipse Foundation"><meta name=twitter:title content="Eclipse Public License 2.0 (EPL) | The Eclipse Foundation"><meta name=description content="The Eclipse Foundation provides our global community of individuals and organisations with a mature, scalable, and business-friendly environment for open source …"><meta property="og:description" content="The Eclipse Foundation provides our global community of individuals and organisations with a mature, scalable, and business-friendly environment for open source …"><meta name=twitter:description content="The Eclipse Foundation provides our global community of individuals and organisations with a mature, scalable, and business-friendly environment for open source …"><meta name=author content="Wayne Beaton"><link href=/favicon.ico rel=icon type=image/x-icon><meta property="og:image" content="https://www.eclipse.org/images/og-image-template_hu_cdf3b1afdf89db6f.png"><meta name=twitter:image content="https://www.eclipse.org/images/og-image-template_hu_cdf3b1afdf89db6f.png"><meta name=twitter:card content="summary"><meta name=twitter:site content="@eclipsefdn"><meta name=twitter:creator content="@eclipsefdn"><meta property="og:url" content="https://www.eclipse.org/legal/epl-2.0/"><meta property="og:type" content="website"><meta property="og:site_name" content="Eclipse Foundation"><meta name=keywords content="epl,epl-2.0,legal,foundation,eclipse,eclipse public license,license,licenses"><meta name=generator content="Hugo 0.144.2"><link rel=canonical href=https://www.eclipse.org/legal/epl-2.0/><link rel=alternate href=https://www.eclipse.org//legal/epl-2.0/index.xml type=application/rss+xml title><script>(function(e,t,n,s,o){e[s]=e[s]||[],e[s].push({"gtm.start":(new Date).getTime(),event:"gtm.js"});var a=t.getElementsByTagName(n)[0],i=t.createElement(n),r=s!="dataLayer"?"&l="+s:"";i.async=!0,i.src="https://www.googletagmanager.com/gtm.js?id="+o+r,a.parentNode.insertBefore(i,a)})(window,document,"script","dataLayer","GTM-5WLCZXC")</script><script>var tableClasses="table"</script><link href="https://fonts.googleapis.com/css2?family=Roboto:ital,wght@0,100;0,300;0,400;0,500;0,700;0,900;1,100;1,300;1,400;1,500;1,700;1,900&display=swap" rel=stylesheet type=text/css>  <script type="module" crossorigin src="/public/assets/legal/epl-2.0/index-Br5FsgwB.js"></script>
-  <link rel="modulepreload" crossorigin href="/public/assets/main-DMD1QOmo.js">
+<meta property="og:title" content="Eclipse Public License 2.0 (EPL) | The Eclipse Foundation"><meta name=twitter:title content="Eclipse Public License 2.0 (EPL) | The Eclipse Foundation"><meta name=description content="The Eclipse Foundation provides our global community of individuals and organisations with a mature, scalable, and business-friendly environment for open source …"><meta property="og:description" content="The Eclipse Foundation provides our global community of individuals and organisations with a mature, scalable, and business-friendly environment for open source …"><meta name=twitter:description content="The Eclipse Foundation provides our global community of individuals and organisations with a mature, scalable, and business-friendly environment for open source …"><meta name=author content="Wayne Beaton"><link href=/favicon.ico rel=icon type=image/x-icon><meta property="og:image" content="https://www.eclipse.org/images/og-image-template_hu_cdf3b1afdf89db6f.png"><meta name=twitter:image content="https://www.eclipse.org/images/og-image-template_hu_cdf3b1afdf89db6f.png"><meta name=twitter:card content="summary"><meta name=twitter:site content="@eclipsefdn"><meta name=twitter:creator content="@eclipsefdn"><meta property="og:url" content="https://www.eclipse.org/legal/epl-2.0/"><meta property="og:type" content="website"><meta property="og:site_name" content="Eclipse Foundation"><meta name=keywords content="epl,epl-2.0,legal,foundation,eclipse,eclipse public license,license,licenses"><meta name=generator content="Hugo 0.144.2"><link rel=canonical href=https://www.eclipse.org/legal/epl-2.0/><link rel=alternate href=https://www.eclipse.org//legal/epl-2.0/index.xml type=application/rss+xml title><script>(function(e,t,n,s,o){e[s]=e[s]||[],e[s].push({"gtm.start":(new Date).getTime(),event:"gtm.js"});var a=t.getElementsByTagName(n)[0],i=t.createElement(n),r=s!="dataLayer"?"&l="+s:"";i.async=!0,i.src="https://www.googletagmanager.com/gtm.js?id="+o+r,a.parentNode.insertBefore(i,a)})(window,document,"script","dataLayer","GTM-5WLCZXC")</script><script>var tableClasses="table"</script><link href="https://fonts.googleapis.com/css2?family=Roboto:ital,wght@0,100;0,300;0,400;0,500;0,700;0,900;1,100;1,300;1,400;1,500;1,700;1,900&display=swap" rel=stylesheet type=text/css>  <script type="module" crossorigin src="/public/assets/legal/epl-2.0/index-KKbnVOd8.js"></script>
+  <link rel="modulepreload" crossorigin href="/public/assets/main-BKIcjYwC.js">
   <link rel="modulepreload" crossorigin href="/public/assets/get-body-content-D33PtpOf.js">
   <link rel="modulepreload" crossorigin href="/public/assets/generate-body-content-BZFBJ1cI.js">
-  <link rel="stylesheet" crossorigin href="/public/assets/main-BSGkhNuL.css">
+  <link rel="stylesheet" crossorigin href="/public/assets/main-BzlpBkIh.css">
 </head><body><noscript><iframe src="https://www.googletagmanager.com/ns.html?id=GTM-5WLCZXC" height=0 width=0 style=display:none;visibility:hidden></iframe></noscript><a href=#main class=skip-link>Skip to content</a><div class=eclipsefdn-featured-story-banner data-publish-target=eclipse_org></div><header class="header-wrapper header-wrapper" id=header><div class="navigation-bar dark"><div class=container><div class=navigation-bar-inner><div class=navigation-bar-left><a class="focus-highlight focus-inverse" href=/><img class=navigation-bar-brand src=https://www.eclipse.org/eclipse.org-common/themes/solstice/public/images/logo/eclipse-foundation-white-orange.svg alt="Eclipse Foundation"></a></div><nav class="navigation-bar-nav hidden-xs hidden-sm"><ul><li><button type=button class="btn btn-link" data-target=join-us-menu>Join us</button></li><li><button type=button class="btn btn-link" data-target=what-we-do-menu>What we do</button></li><li><button type=button class="btn btn-link" data-target=resources-menu>Resources</button></li><li><button type=button class="btn btn-link" data-target=about-us-menu>About us</button></li></ul></nav><div class=navigation-bar-right><div class="navigation-bar-controls hidden-xs hidden-sm"><ul><li class=dropdown><a class="dropdown-toggle link-unstyled focus-highlight" tabindex=0 id=search-dropdown-toggle data-toggle=dropdown href=# aria-label=Search><i class="fa-solid fa-magnifying-glass" aria-hidden=true></i></a><form class="search-bar dropdown-menu dropdown-menu-right" aria-labelledby=search-dropdown-toggle action=https://www.eclipse.org/home/search/ method=get><input class=search-bar-input name=q placeholder=Search>
 <button class="btn btn-link" type=submit>
 <i class="fa-solid fa-arrow-right"></i></button></form></li><li class=dropdown><a class="dropdown-toggle focus-highlight" id=user-menu href=# data-toggle=dropdown aria-haspopup=true aria-expanded=false tabindex=0><i class="fa-regular fa-user" aria-hidden=true></i></a><ul class="dropdown-menu dropdown-menu-right" aria-labelledby=user-menu><li><a href=https://accounts.eclipse.org/user><i class="fa-solid fa-user margin-right-10" aria-hidden=true></i>