@effekt-lang/effekt 0.56.0 → 0.57.0

package/libraries/common/resizable_array.effekt

@@ -21,42 +21,26 @@ def size[T](arr: ResizableArray[T]) = arr.rawSizePtr.get
 
 /// Allocate a new, empty dynamic array with given initial capacity
 def resizableArray[T](capacity: Int): ResizableArray[T] = {
-  ResizableArray(ref(0), ref(allocate(capacity)))
+  ResizableArray(ref(0), ref(unsafeAllocate(capacity)))
 }
 
-/// Allocate a new, empty dynamic array
+/// Aallocate a new, empty dynamic array
 def resizableArray[T](): ResizableArray[T] = resizableArray(8)
 
+
 /// Throw an OutOfBounds exception if index is not a valid index into arr
-def boundsCheck[T](arr: ResizableArray[T], index: Int): Unit / Exception[OutOfBounds] = {
+def boundsCheck[T](arr: ResizableArray[T], index: Int): Unit / Exception[OutOfBounds] =
   if (index < 0 || index >= arr.size) {
     do raise(OutOfBounds(), "Array index out of bounds: " ++ show(index))
   }
-}
 
-/// get the element at position index in the array
-///
-/// precondition: index is a valid index into the array
-///
-/// O(1)
-def unsafeGet[T](arr: ResizableArray[T], index: Int): T = {
-  arr.rawContentPtr.get.unsafeGet(index)
-}
+
 /// get the element at position index in the array
 ///
 /// O(1)
 def get[T](arr: ResizableArray[T], index: Int): T / Exception[OutOfBounds] = {
   arr.boundsCheck(index);
-  arr.unsafeGet(index)
-}
-
-/// set the element at position index in the array
-///
-/// precondition: index is a valid index into the array
-///
-/// O(1)
-def unsafeSet[T](arr: ResizableArray[T], index: Int, value: T): Unit = {
-  arr.rawContentPtr.get.unsafeSet(index, value)
+  arr.rawContentPtr.get.get(index)
 }
 
 /// set the element at position index in the array
@@ -64,19 +48,7 @@ def unsafeSet[T](arr: ResizableArray[T], index: Int, value: T): Unit = {
 /// O(1)
 def set[T](arr: ResizableArray[T], index: Int, value: T): Unit / Exception[OutOfBounds] = {
   arr.boundsCheck(index);
-  arr.unsafeSet(index, value)
-}
-
-/// swap the elements at the given positions in the array
-///
-/// precondition: both are valid indices into the array
-///
-/// O(1)
-def unsafeSwap[T](arr: ResizableArray[T], index1: Int, index2: Int): Unit = {
-  val raw = arr.rawContentPtr.get
-  val tmp = raw.unsafeGet(index1)
-  raw.unsafeSet(index1, raw.unsafeGet(index2))
-  raw.unsafeSet(index2, tmp)
+  arr.rawContentPtr.get.set(index, value)
 }
 
 /// swap the elements at the given positions in the array
@@ -84,22 +56,10 @@ def unsafeSwap[T](arr: ResizableArray[T], index1: Int, index2: Int): Unit = {
 /// O(1)
 def swap[T](arr: ResizableArray[T], index1: Int, index2: Int): Unit / Exception[OutOfBounds] = {
   arr.boundsCheck(max(index1, index2))
-  arr.unsafeSwap(index1, index2)
-}
-
-/// Change the dynamic to have exactly the given capacity
-///
-/// precondition: given capacity is at least the size of the array
-///
-/// O(n)
-def unsafeSetCapacity[T](arr: ResizableArray[T], capacity: Int): Unit = {
-  with on[OutOfBounds].panic
-  val oldRaw = arr.rawContentPtr.get
-  if (oldRaw.size != capacity) { 
-    val newRaw = array::allocate(capacity)
-    oldRaw.copy(0, newRaw, 0, arr.size)
-    arr.rawContentPtr.set(newRaw)
-  }
+  val raw = arr.rawContentPtr.get
+  val tmp = raw.get(index1)
+  raw.set(index1, raw.get(index2))
+  raw.set(index2, tmp)
 }
 
 /// Change the resizable array to have exactly the given capacity.
@@ -110,16 +70,21 @@ def setCapacity[T](arr: ResizableArray[T], capacity: Int): Unit / Exception[OutO
   if (arr.size > capacity) {
     do raise(OutOfBounds(), "Cannot change capacity of ResizableArray to " ++ capacity.show ++ " below size " ++ arr.size.show)
   }
-  arr.unsafeSetCapacity(capacity)
+  val oldRaw = arr.rawContentPtr.get
+  if (oldRaw.size != capacity) { 
+    val newRaw = array::unsafeAllocate(capacity)
+    oldRaw.copy(0, newRaw, 0, arr.size)
+    arr.rawContentPtr.set(newRaw)
+  }
 }
 
 /// If the shrinkThreshold is reached, shrink by growFactor, otherwise do nothing
 ///
 /// O(n)
-def maybeShrink[T](arr: ResizableArray[T]): Unit = {
+def maybeShrink[T](arr: ResizableArray[T]): Unit / Exception[OutOfBounds] = {
   if(arr.size.toDouble < arr.rawContentPtr.get.size.toDouble * shrinkThreshold) {
     val newCap = max(arr.size, (arr.rawContentPtr.get.size.toDouble / growFactor).ceil)
-    arr.unsafeSetCapacity(newCap)
+    arr.setCapacity(newCap)
   }
 }
 
@@ -144,11 +109,11 @@ def setResizing[T](arr: ResizableArray[T], index: Int, value: T): Unit / Excepti
     do raise(OutOfBounds(), "Negative index " ++ index.show)
   }
   if (index < arr.size) {
-    arr.rawContentPtr.get.unsafeSet(index, value)
+    arr.rawContentPtr.get.set(index, value)
   }
   ensureCapacity(arr, index + 1)
-  arr.rawContentPtr.get.unsafeSet(index, value)
-  arr.rawSizePtr.set(index + 1)
+  arr.rawContentPtr.get.set(index, value)
+  if (index >= arr.size) arr.rawSizePtr.set(index + 1)
 }
 
 /// Add a new element at the end of the resizable array.
@@ -166,9 +131,10 @@ def add[T](arr: ResizableArray[T], value: T): Int = {
 ///
 /// O(1) amortized, O(n) worst case
 def popRight[T](arr: ResizableArray[T]): T / Exception[OutOfBounds] = {
-  arr.boundsCheck(arr.size - 1)
-  arr.rawSizePtr.set(arr.size - 1)
-  val r = arr.unsafeGet(arr.size)
+  val last = arr.size - 1
+  arr.boundsCheck(last)
+  val r = arr.rawContentPtr.get.get(last)
+  arr.rawSizePtr.set(last)
   arr.maybeShrink()
   r
 }
@@ -176,51 +142,51 @@ def popRight[T](arr: ResizableArray[T]): T / Exception[OutOfBounds] = {
 
 def foreachIndex[T](arr: ResizableArray[T]){ body: (Int, T) => Unit }: Unit = {
   each(0, arr.size) { i =>
-    body(i, arr.rawContentPtr.get.unsafeGet(i))
+    body(i, arr.rawContentPtr.get.get(i))
   }
 }
-def foreachIndex[T](arr: ResizableArray[T]){ body: (Int, T) {Control} => Unit }: Unit = {
+def foreachIndex[T](arr: ResizableArray[T]){ body: (Int, T) {Label} => Unit }: Unit = {
   each(0, arr.size) { (i){label} =>
-    body(i, arr.rawContentPtr.get.unsafeGet(i)){label}
+    body(i, arr.rawContentPtr.get.get(i)){label}
   }
 }
 def foreach[T](arr: ResizableArray[T]){ body: T => Unit }: Unit = {
   each(0, arr.size) { i =>
-    body(arr.rawContentPtr.get.unsafeGet(i))
+    body(arr.rawContentPtr.get.get(i))
   }
 }
-def foreach[T](arr: ResizableArray[T]){ body: (T) {Control} => Unit }: Unit = {
+def foreach[T](arr: ResizableArray[T]){ body: (T) {Label} => Unit }: Unit = {
   each(0, arr.size) { (i){label} =>
-    body(arr.rawContentPtr.get.unsafeGet(i)){label}
+    body(arr.rawContentPtr.get.get(i)){label}
   }
 }
-def foreachIndexReversed[T](arr: ResizableArray[T]){ body: (Int, T){Control} => Unit }: Unit = {
+def foreachIndexReversed[T](arr: ResizableArray[T]){ body: (Int, T){Label} => Unit }: Unit = {
   var i = arr.size - 1
   loop { {l} =>
     if (i < 0) { l.break() }
-    body(i, arr.rawContentPtr.get.unsafeGet(i)){l}
+    body(i, arr.rawContentPtr.get.get(i)){l}
     i = i - 1
   }
 }
 def foreachIndexReversed[T](arr: ResizableArray[T]){ body: (Int, T) => Unit }: Unit = {
   var i = arr.size - 1
   while(i >= 0) {
-    body(i, arr.rawContentPtr.get.unsafeGet(i))
+    body(i, arr.rawContentPtr.get.get(i))
     i = i - 1
   }
 }
-def foreachReversed[T](arr: ResizableArray[T]){ body: (T){Control} => Unit }: Unit = {
+def foreachReversed[T](arr: ResizableArray[T]){ body: (T){Label} => Unit }: Unit = {
   var i = arr.size - 1
   loop { {l} =>
     if (i < 0) { l.break() }
-    body(arr.rawContentPtr.get.unsafeGet(i)){l}
+    body(arr.rawContentPtr.get.get(i)){l}
     i = i - 1
   }
 }
 def foreachReversed[T](arr: ResizableArray[T]){ body: T => Unit }: Unit = {
   var i = arr.size - 1
   while (i >= 0) { 
-    body(arr.rawContentPtr.get.unsafeGet(i))
+    body(arr.rawContentPtr.get.get(i))
     i = i - 1
   }
 }
@@ -228,7 +194,7 @@ def foreachReversed[T](arr: ResizableArray[T]){ body: T => Unit }: Unit = {
 def toList[T](arr: ResizableArray[T]): List[T] = {
   def go(i: Int, acc: List[T]): List[T] = {
     if (i < 0) { acc } else {
-      go(i - 1, Cons(arr.unsafeGet(i), acc))
+      go(i - 1, Cons(arr.rawContentPtr.get.get(i), acc))
     }
   }
   go(arr.size - 1, Nil())

package/libraries/common/seq.effekt

@@ -579,14 +579,14 @@ def each[A](seq: Seq[A]) { consume: (A) => Unit }: Unit = {
   }
 }
 
-def each[A](seq: Seq[A]) { f: (A) {Control} => Unit }: Unit = try {
+def each[A](seq: Seq[A]) { f: (A) {Label} => Unit }: Unit = try {
   seq.each { (el) =>
-    try { f(el) {inner} } with inner: Control {
+    try { f(el) {inner} } with inner: Label {
       def break() = outer.break()
       def continue() = ()
     }
   }
-} with outer: Control {
+} with outer: Label {
   def break() = ()
   def continue() = ()
 }
@@ -627,14 +627,14 @@ def eachReverse[A](seq: Seq[A]) { consume: A => Unit }: Unit = {
   }
 }
 
-def eachReverse[A](seq: Seq[A]) { f: (A) {Control} => Unit }: Unit = try {
+def eachReverse[A](seq: Seq[A]) { f: (A) {Label} => Unit }: Unit = try {
   seq.eachReverse { (el) =>
-    try { f(el) {inner} } with inner: Control {
+    try { f(el) {inner} } with inner: Label {
       def break() = outer.break()
       def continue() = ()
     }
   }
-} with outer: Control {
+} with outer: Label {
   def break() = ()
   def continue() = ()
 }
@@ -854,7 +854,7 @@ def map[A, B](seq: Seq[A]) { f: A => B }: Seq[B] = {
   result
 }
 
-def map[A, B](seq: Seq[A]) { f: (A) {Control} => B }: Seq[B] = {
+def map[A, B](seq: Seq[A]) { f: (A) {Label} => B }: Seq[B] = {
   var result: Seq[B] = Empty()
   seq.each { (a) {label} => result = result.consRight(f(a) {label}) }
   result

package/libraries/common/stream.effekt

@@ -15,8 +15,6 @@ effect emit[A](value: A): Unit
 /// The producer can decide to `stop` emitting values.
 effect read[A](): A / stop
 
-/// Signal from a producer to a consumer that there are no further values.
-effect stop(): Nothing
 
 /// Like `for[A, R]`, but ignores the result of the stream, and consequently
 /// works for any type. Use this to annotate the type of stream elements
@@ -50,25 +48,8 @@ def fix[T] { one: T => Unit / emit[T] } { stream: => Unit / emit[T] }: Unit =
   }
 
 
-def boundary { program: () => Unit / stop }: Unit = {
-  returning::boundary[Unit]{program}
-  ()
-}
-
-/// Run `program` forever until `stop` is thrown.
-def exhaustively { program: () => Unit / stop }: Unit =
-  try {
-    def go(): Unit = {
-      program()
-      go()
-    }
-    go()
-  } with stop {
-    ()
-  }
-
 def many[A] { action: () => A / stop }: Unit / emit[A] =
-  exhaustively { do emit(action()) }
+  loop { do emit(action()) }
 
 def some[A] { action: () => A / stop }: Unit / { emit[A], stop } = {
   do emit(action())
@@ -230,7 +211,7 @@ def zip[A, B] { stream1: () => Unit / emit[A] } { stream2: () => Unit / emit[B]
   with source[A] { stream1 }
   with source[B] { stream2 }
 
-  exhaustively {
+  loop {
     action(do read(), do read())
   }
 }
@@ -241,7 +222,7 @@ def zipLongest[A, B] { stream1: () => Unit / emit[A] } { stream2: () => Unit / e
   with source[A] { stream1 }
   with source[B] { stream2 }
 
-  exhaustively {
+  loop {
      try {
       val a = do read[A]()
       try {

package/libraries/common/string.effekt

@@ -245,7 +245,7 @@ def feed[R](string: String) { reader: () => R / read[Char] } =
 
 def each(string: String): Unit / emit[Char] =
   feed(string) {
-    exhaustively {
+    loop {
       do emit(do read())
     }
   }

package/libraries/common/stringbuffer.effekt

@@ -30,7 +30,7 @@ def stringBuffer[A] { prog: => A / StringBuffer }: A = {
       val bytes = fromString(str)
       ensureCapacity(bytes.size)
       bytes.foreach { b =>
-        buffer.unsafeSet(pos, b)
+        buffer.set(pos, b)
         pos = pos + 1
       }
       resume(())

package/libraries/llvm/rts.ll

@@ -97,6 +97,7 @@
 declare ptr @malloc(i64)
 declare void @free(ptr)
 declare ptr @realloc(ptr, i64)
+declare noalias ptr @calloc(i64, i64)
 declare void @memcpy(ptr, ptr, i64)
 declare i64 @llvm.ctlz.i64 (i64 , i1)
 declare i64 @llvm.fshr.i64(i64, i64, i64)

package/licenses/mit license - mit-license.html

@@ -1481,7 +1481,7 @@ _stq.push([ "clickTrackerInit", "210318891", "395" ]);
 <script data-service="jetpack-statistics" data-category="statistics" type="text/plain" data-cmplz-src="https://stats.wp.com/e-202552.js" id="jetpack-stats-js" defer="defer" data-wp-strategy="defer"></script>
 <script type="text/javascript" id="cmplz-cookiebanner-js-extra">
 /* <![CDATA[ */
-var complianz = {"prefix":"cmplz_","user_banner_id":"1","set_cookies":[],"block_ajax_content":"","banner_version":"127","version":"7.4.4.2","store_consent":"","do_not_track_enabled":"1","consenttype":"optin","region":"eu","geoip":"","dismiss_timeout":"","disable_cookiebanner":"1","soft_cookiewall":"","dismiss_on_scroll":"","cookie_expiry":"365","url":"https://opensource.org/wp-json/complianz/v1/","locale":"lang=en&locale=en_US","set_cookies_on_root":"","cookie_domain":"","current_policy_id":"22","cookie_path":"/","categories":{"statistics":"statistics","marketing":"marketing"},"tcf_active":"","placeholdertext":"Click to accept {category} cookies and enable this content","css_file":"https://opensource.org/wp-content/uploads/complianz/css/banner-{banner_id}-{type}.css?v=127","page_links":{"eu":{"cookie-statement":{"title":"","url":"https://opensource.org/blog/top-open-source-licenses-in-2025"}}},"tm_categories":"","forceEnableStats":"","preview":"","clean_cookies":"","aria_label":"Click to accept {category} cookies and enable this content"};
+var complianz = {"prefix":"cmplz_","user_banner_id":"1","set_cookies":[],"block_ajax_content":"","banner_version":"127","version":"7.4.4.2","store_consent":"","do_not_track_enabled":"1","consenttype":"optin","region":"eu","geoip":"","dismiss_timeout":"","disable_cookiebanner":"1","soft_cookiewall":"","dismiss_on_scroll":"","cookie_expiry":"365","url":"https://opensource.org/wp-json/complianz/v1/","locale":"lang=en&locale=en_US","set_cookies_on_root":"","cookie_domain":"","current_policy_id":"22","cookie_path":"/","categories":{"statistics":"statistics","marketing":"marketing"},"tcf_active":"","placeholdertext":"Click to accept {category} cookies and enable this content","css_file":"https://opensource.org/wp-content/uploads/complianz/css/banner-{banner_id}-{type}.css?v=127","page_links":{"eu":{"cookie-statement":{"title":"","url":"https://opensource.org/peru_to_ms_spanish-php"}}},"tm_categories":"","forceEnableStats":"","preview":"","clean_cookies":"","aria_label":"Click to accept {category} cookies and enable this content"};
 //# sourceURL=cmplz-cookiebanner-js-extra
 /* ]]> */
 </script>
@@ -1497,11 +1497,11 @@ const a=JSON.parse(document.getElementById("wp-emoji-settings").textContent),o=(
 /* ]]> */
 </script>
 
-<script>(function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9b29139d7f9e565f',t:'MTc2NjUwNTY3Ng=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();</script></body>
+<script>(function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9b2918211ce7e7eb',t:'MTc2NjUwNTg2MQ=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();</script></body>
 </html>
 <!--
-	generated 10 seconds ago
-	generated in 0.716 seconds
-	served from batcache in 0.004 seconds
-	expires in 290 seconds
+	generated 99 seconds ago
+	generated in 0.712 seconds
+	served from batcache in 0.003 seconds
+	expires in 201 seconds
 -->

package/licenses/the bsd license - bsd-license.html

@@ -1483,7 +1483,7 @@ _stq.push([ "clickTrackerInit", "210318891", "373" ]);
 <script data-service="jetpack-statistics" data-category="statistics" type="text/plain" data-cmplz-src="https://stats.wp.com/e-202552.js" id="jetpack-stats-js" defer="defer" data-wp-strategy="defer"></script>
 <script type="text/javascript" id="cmplz-cookiebanner-js-extra">
 /* <![CDATA[ */
-var complianz = {"prefix":"cmplz_","user_banner_id":"1","set_cookies":[],"block_ajax_content":"","banner_version":"127","version":"7.4.4.2","store_consent":"","do_not_track_enabled":"1","consenttype":"optin","region":"eu","geoip":"","dismiss_timeout":"","disable_cookiebanner":"1","soft_cookiewall":"","dismiss_on_scroll":"","cookie_expiry":"365","url":"https://opensource.org/wp-json/complianz/v1/","locale":"lang=en&locale=en_US","set_cookies_on_root":"","cookie_domain":"","current_policy_id":"22","cookie_path":"/","categories":{"statistics":"statistics","marketing":"marketing"},"tcf_active":"","placeholdertext":"Click to accept {category} cookies and enable this content","css_file":"https://opensource.org/wp-content/uploads/complianz/css/banner-{banner_id}-{type}.css?v=127","page_links":{"eu":{"cookie-statement":{"title":"","url":"https://opensource.org/meeting-minutes/minutes20090610"}}},"tm_categories":"","forceEnableStats":"","preview":"","clean_cookies":"","aria_label":"Click to accept {category} cookies and enable this content"};
+var complianz = {"prefix":"cmplz_","user_banner_id":"1","set_cookies":[],"block_ajax_content":"","banner_version":"127","version":"7.4.4.2","store_consent":"","do_not_track_enabled":"1","consenttype":"optin","region":"eu","geoip":"","dismiss_timeout":"","disable_cookiebanner":"1","soft_cookiewall":"","dismiss_on_scroll":"","cookie_expiry":"365","url":"https://opensource.org/wp-json/complianz/v1/","locale":"lang=en&locale=en_US","set_cookies_on_root":"","cookie_domain":"","current_policy_id":"22","cookie_path":"/","categories":{"statistics":"statistics","marketing":"marketing"},"tcf_active":"","placeholdertext":"Click to accept {category} cookies and enable this content","css_file":"https://opensource.org/wp-content/uploads/complianz/css/banner-{banner_id}-{type}.css?v=127","page_links":{"eu":{"cookie-statement":{"title":"","url":"https://opensource.org/peru_to_ms_spanish-php"}}},"tm_categories":"","forceEnableStats":"","preview":"","clean_cookies":"","aria_label":"Click to accept {category} cookies and enable this content"};
 //# sourceURL=cmplz-cookiebanner-js-extra
 /* ]]> */
 </script>
@@ -1499,11 +1499,9 @@ const a=JSON.parse(document.getElementById("wp-emoji-settings").textContent),o=(
 /* ]]> */
 </script>
 
-<script>(function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9b29139c3d1a565f',t:'MTc2NjUwNTY3Ng=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();</script></body>
+<script>(function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9b2918202b82e7eb',t:'MTc2NjUwNTg2MQ=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();</script></body>
 </html>
 <!--
-	generated 13 seconds ago
-	generated in 0.846 seconds
-	served from batcache in 0.004 seconds
-	expires in 287 seconds
+	generated in 0.697 seconds
+	170535 bytes batcached for 300 seconds
 -->

package/licenses/the mit license - mit.html

@@ -1497,11 +1497,11 @@ const a=JSON.parse(document.getElementById("wp-emoji-settings").textContent),o=(
 /* ]]> */
 </script>
 
-<script>(function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9b29139cbe49565f',t:'MTc2NjUwNTY3Ng=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();</script></body>
+<script>(function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9b2918209c3ae7eb',t:'MTc2NjUwNTg2MQ=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();</script></body>
 </html>
 <!--
-	generated 79 seconds ago
+	generated 217 seconds ago
 	generated in 0.758 seconds
 	served from batcache in 0.003 seconds
-	expires in 221 seconds
+	expires in 83 seconds
 -->

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@effekt-lang/effekt",
   "author": "Jonathan Brachthäuser",
-  "version": "0.56.0",
+  "version": "0.57.0",
   "repository": {
     "type": "git",
     "url": "git+https://github.com/effekt-lang/effekt.git"