@effekt-lang/effekt 0.76.0 → 0.78.0

package/libraries/common/set.effekt

@@ -9,7 +9,7 @@ record Set[A](tree: internal::Tree[A, Unit], compare: (A, A) => Ordering at {})
 /// Create a new empty set using a pure, first-class comparison function.
 ///
 /// O(1)
-def empty[A](compare: (A, A) => Ordering at {}): Set[A] =
+def empty[A](?compare: (A, A) => Ordering at {}): Set[A] =
   Set(internal::empty(), compare)
 
 /// Create a new empty set using a generic comparison function.
@@ -36,7 +36,7 @@ def nonEmpty[A](s: Set[A]): Bool = internal::nonEmpty(s.tree)
 /// Requires a pure, first-class comparison function.
 ///
 /// O(1)
-def singleton[A](element: A, compare: (A, A) => Ordering at {}): Set[A] =
+def singleton[A](element: A, ?compare: (A, A) => Ordering at {}): Set[A] =
   Set(internal::singleton(element, ()), compare)
 
 /// Create a new set containing a single `element` and a generic comparison function.
@@ -81,7 +81,7 @@ def toMap[K, V](keys: Set[K]) { valueOf: K => V }: Map[K, V] = {
 ///
 /// O(N log N)
 /// O(N) if the list is sorted
-def fromList[A](list: List[A], compare: (A, A) => Ordering at {}): Set[A] = {
+def fromList[A](list: List[A], ?compare: (A, A) => Ordering at {}): Set[A] = {
   val tree: internal::Tree[A, Unit] = internal::fromList(list.map { k => (k, ()) }, compare)
   Set(tree, compare)
 }
@@ -105,15 +105,23 @@ def fromListGeneric[A](list: List[A]): Set[A] = {
 def foreach[A](s: Set[A]) { action: A => Unit }: Unit =
   internal::foreach(s.tree) { (k, _v) => action(k) }
 
+/// Traverse all elements in *reverse* order, running the function `action` on each element.
+///
+/// Law: `s.foreachReversed { action } === s.toList.reverse.foreach { action }`
+///
+/// O(N)
+def foreachReversed[A](s: Set[A]) { action: A => Unit }: Unit =
+  internal::foreachReversed(s.tree) { (k, _v) => action(k) }
+
 /// Create a list from a given set.
 ///
 /// O(N)
 def toList[A](s: Set[A]): List[A] = {
   var acc = Nil()
-  s.foreach { a =>
+  s.foreachReversed { a =>
     acc = Cons(a, acc)
   }
-  acc.reverse
+  acc
 }
 
 /// Check if a predicate holds for all elements in a given set.
@@ -189,7 +197,7 @@ def deleteMany[A](s: Set[A], list: List[A]): Set[A] = {
 /// Uses an explicit comparison function.
 ///
 /// O(???)
-def difference[A](s1: Set[A], s2: Set[A], compare: (A, A) => Ordering at {}): Set[A] = {
+def difference[A](s1: Set[A], s2: Set[A], ?compare: (A, A) => Ordering at {}): Set[A] = {
   val newTree = internal::difference(s1.tree, s2.tree, compare)
   Set(newTree, compare)
 }
@@ -206,7 +214,7 @@ def difference[A](s1: Set[A], s2: Set[A]): Set[A] =
 /// Uses an explicit comparison function.
 ///
 /// O(???)
-def union[A](s1: Set[A], s2: Set[A], compare: (A, A) => Ordering at {}): Set[A] = {
+def union[A](s1: Set[A], s2: Set[A], ?compare: (A, A) => Ordering at {}): Set[A] = {
   val newTree = internal::union(s1.tree, s2.tree, compare) { (_k, _v1, _v2) => () }
   Set(newTree, compare)
 }
@@ -222,7 +230,7 @@ def union[A](s1: Set[A], s2: Set[A]): Set[A] =
 /// Uses an explicit comparison function.
 ///
 /// O(???)
-def intersection[A](s1: Set[A], s2: Set[A], compare: (A, A) => Ordering at {}): Set[A] = {
+def intersection[A](s1: Set[A], s2: Set[A], ?compare: (A, A) => Ordering at {}): Set[A] = {
   val newTree = internal::intersection(s1.tree, s2.tree, compare) { (_k, _v1, _v2) => () }
   Set(newTree, compare)
 }
@@ -245,17 +253,20 @@ def each[A](set: Set[A]): Unit / emit[A] =
 
 /// Collects elements emitted by a push stream producer `stream` into a new set
 /// using provided `compare` function, discarding the result of the producer.
-def collect[A](compare: (A, A) => Ordering at {}) { stream: () => Unit / emit[A] }: Set[A] =
+def collect[A](?compare: (A, A) => Ordering at {}) { stream: () => Unit / emit[A] }: Set[A] =
   returning::collect[A, Unit](compare){stream}.second
 
 namespace returning {
   /// Collects elements emitted by a push stream producer `stream` into a new set
   /// using provided `compare` function, returning the result of the producer as well as the collected set.
-  def collect[A, R](compare: (A, A) => Ordering at {}) { stream: () => R / emit[A] }: (R, Set[A]) =
-    try {
-      (stream(), empty(compare))
+  def collect[A, R](?compare: (A, A) => Ordering at {}) { stream: () => R / emit[A] }: (R, Set[A]) = {
+    var set = set::empty(compare)
+    val r = try {
+      stream()
     } with emit[A] { (v) =>
-      val (r, set) = resume(());
-      (r, set.insert(v))
+      set = set.insert(v)
+      resume(())
     }
+    (r, set)
+  }
 }

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>