@effekt-lang/effekt 0.18.0 → 0.19.0

package/libraries/common/regex.effekt

@@ -0,0 +1,64 @@
+module regex
+
+import string
+
+extern include chez "text/pregexp.scm"
+
+extern type Regex
+
+record Match(matched: String, index: Int)
+
+extern pure def regex(str: String): Regex =
+  js "new RegExp(${str})"
+  chez "(pregexp ${str})"
+  vm "regex::regex(String)"
+
+def exec(reg: Regex, str: String): Option[Match] = {
+  val v = internal::exec(reg, str)
+  if (v.isUndefined)
+    None()
+  else
+    Some(Match(internal::matched(v), internal::index(v)))
+}
+
+namespace internal {
+
+  /// The type RegexMatch is used internally to represent platform
+  /// dependent results of matching a regex.
+  extern type RegexMatch
+    // js: { matched: String, index: Int } | undefined
+    // vm: scala.util.matching.Regex.Match | null
+
+  extern pure def matched(r: RegexMatch): String =
+    js "${r}.matched"
+    chez "(vector-ref ${r} 0)"
+    vm "regex::matched(RegexMatch)"
+
+  extern pure def index(r: RegexMatch): Int =
+    js "${r}.index"
+    chez "(vector-ref ${r} 1)"
+    vm "regex::index(RegexMatch)"
+
+  extern js """
+    function regex$exec(reg, str) {
+      var res = reg.exec(str);
+      if (res === null) { return undefined }
+      else { return { matched: res[0], index: res.index } }
+    }
+  """
+
+  extern chez """
+  (define regex-exec
+    (lambda (regex str)
+      (let* ([positions (pregexp-match-positions regex str)]
+        [match (pregexp-match regex str)])
+    (if (and positions match)
+        (vector (car match) (caar positions))
+        #f))))
+  """
+
+  extern io def exec(reg: Regex, str: String): RegexMatch =
+    js "regex$exec(${reg}, ${str})"
+    chez "(regex-exec ${reg} ${str})"
+    vm "regex::exec(Regex, String)"
+}

package/libraries/common/set.effekt

@@ -0,0 +1,234 @@
+module set
+
+import map
+
+/// Ordered finite immutable set, backed by balanced binary trees of logarithmic depth.
+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] =
+  Set(internal::empty(), compare)
+
+/// Create a new empty set using a generic comparison function.
+/// Only available on JavaScript backends!
+///
+/// O(1)
+def emptyGeneric[A](): Set[A] =
+  Set(
+    internal::empty(),
+    box { (left: A, right: A) => genericCompare(left, right) }
+  )
+
+/// Check if set `s` is empty.
+///
+/// O(1)
+def isEmpty[A](s: Set[A]): Bool = internal::isEmpty(s.tree)
+
+/// Check if set `s` is nonempty.
+///
+/// O(1)
+def nonEmpty[A](s: Set[A]): Bool = internal::nonEmpty(s.tree)
+
+/// Create a new set containing a single `element`.
+/// Requires a pure, first-class comparison function.
+///
+/// O(1)
+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.
+/// Only available on the JavaScript backends!
+///
+/// O(1)
+def singletonGeneric[A](element: A): Set[A] =
+  Set(
+    internal::singleton(element, ()),
+    box { (left: A, right: A) => genericCompare(left, right) }
+  )
+
+/// Get the size of the set (the number of its elements).
+///
+/// O(1)
+def size[A](s: Set[A]): Int = internal::size(s.tree)
+
+/// Insert a new element `a` into the set `s`.
+///
+/// O(log N)
+def insert[A](s: Set[A], a: A): Set[A] = {
+  val newTree = internal::put(s.tree, s.compare, a, ())
+  Set(newTree, s.compare)
+}
+
+/// Create a set from a given map by ignoring the values.
+///
+/// O(N)
+def fromMapKeys[K, V](map: Map[K, V]): Set[K] =
+  Set(internal::forget(map.tree), map.compare)
+
+/// Create a map from a set and a function,
+/// reusing the set's comparison.
+///
+/// O(N)
+def toMap[K, V](keys: Set[K]) { valueOf: K => V }: Map[K, V] = {
+  val newTree: internal::Tree[K, V] = internal::map(keys.tree) { (k, _v) => valueOf(k) }
+  Map(newTree, keys.compare)
+}
+
+/// Create a set from a given list and a pure, first-class comparison function.
+///
+/// O(N log N)
+/// O(N) if the list is sorted
+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)
+}
+
+/// Create a set from a given list with a generic comparison function.
+/// Works only on the JavaScript backends!
+///
+/// O(N log N)
+/// O(N) if the list is sorted
+def fromListGeneric[A](list: List[A]): Set[A] = {
+  val compare: (A, A) => Ordering at {} = box { (left, right) => genericCompare(left, right) }
+  val tree: internal::Tree[A, Unit] = internal::fromList(list.map { k => (k, ()) }, compare)
+  Set(tree, compare)
+}
+
+/// Traverse all elements in order, running the function `action` on each element.
+///
+/// Law: `s.foreach { action } === s.toList.foreach { action }`
+///
+/// O(N)
+def foreach[A](s: Set[A]) { action: A => Unit }: Unit =
+  internal::foreach(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 =>
+    acc = Cons(a, acc)
+  }
+  acc.reverse
+}
+
+/// Check if a predicate holds for all elements in a given set.
+///
+/// O(N)
+def all[A](s: Set[A]) { predicate : A => Bool }: Bool = {
+  var result = true
+  s.foreach { a =>
+    if (not(predicate(a))) { result = false }
+  }
+  result
+}
+
+/// Check if a predicate holds for at least one element in a given set.
+///
+/// O(N)
+def any[A](s: Set[A]) { predicate: A => Bool }: Bool = {
+  var result = false
+  s.foreach { a =>
+    if (predicate(a)) { result = true }
+  }
+  result
+}
+
+/// Check if a set contains a given element.
+///
+/// O(log N)
+def contains[A](s: Set[A], a: A): Bool =
+  internal::get(s.tree, s.compare, a) match {
+    case None() => false
+    case Some(v) => true
+  }
+
+
+/// Check if set `s1` is a subset of set `s2`.
+///
+/// O(N log N)
+def subset[A](s1: Set[A], s2: Set[A]): Bool = {
+  s1.all { a =>
+    s2.contains(a)
+  }
+}
+
+/// Check if set `s1` is a superset of set `s2`.
+///
+/// O(N log N)
+def superset[A](s1: Set[A], s2: Set[A]): Bool = {
+  s2.subset(s1)
+}
+
+/// Remove an element from a set.
+/// If the element is not in the set, the original set is returned.
+///
+/// O(log N)
+def delete[A](s: Set[A], a: A): Set[A] = {
+  val newTree = internal::delete(s.tree, s.compare, a)
+  Set(newTree, s.compare)
+}
+
+/// Remove many elements from a set.
+///
+/// O(M log N) where M is the size of the list.
+def deleteMany[A](s: Set[A], list: List[A]): Set[A] = {
+  var tmp = s
+  list.foreach { a =>
+    tmp = tmp.delete(a)
+  }
+  tmp
+}
+
+/// Construct a new set which contains all elements of `s1`
+/// except those where the element is in `s2`.
+/// Uses an explicit comparison function.
+///
+/// O(???)
+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)
+}
+
+/// Construct a new set which contains all elements of `s1`
+/// except those where the element is in `s2`.
+/// Uses a comparison function from `s1`.
+///
+/// O(???)
+def difference[A](s1: Set[A], s2: Set[A]): Set[A] =
+  s1.difference(s2, s1.compare)
+
+/// Construct a new set which contains both elements of `s1` and `s2`.
+/// Uses an explicit comparison function.
+///
+/// O(???)
+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)
+}
+
+/// Construct a new set which contains both elements of `s1` and `s2`.
+/// Uses a comparison function from `s1`.
+///
+/// O(???)
+def union[A](s1: Set[A], s2: Set[A]): Set[A] =
+  s1.union(s2, s1.compare)
+
+/// Construct a new set which contains only elements which are in both of `s1` and `s2`.
+/// Uses an explicit comparison function.
+///
+/// O(???)
+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)
+}
+
+/// Construct a new set which contains only elements which are in both of `s1` and `s2`.
+/// Uses a comparison function from `s1`.
+///
+/// O(???)
+def intersection[A](s1: Set[A], s2: Set[A]): Set[A] =
+  s1.intersection(s2, s1.compare)

package/libraries/common/stream.effekt

@@ -2,6 +2,9 @@ module stream
 
 import array
 import bytearray
+import map
+import set
+
 import io/filesystem
 import io/error
 
@@ -63,6 +66,26 @@ def each(bytes: ByteArray): Unit / emit[Byte] = {
   go(0)
 }
 
+/// Turns a `map` into a producer of a push stream
+/// of `(key, value)` pairs by emitting each contained *in order*.
+def each[K, V](map: Map[K, V]): Unit / emit[(K, V)] =
+  map.foreach { (k, v) => do emit((k, v)) }
+
+/// Turns a `map` into a producer of a push stream
+/// of its keys by emitting each contained *in order*.
+def eachKey[K, V](map: Map[K, V]): Unit / emit[K] =
+  map.foreach { (k, _v) => do emit(k) }
+
+/// Turns a `map` into a producer of a push stream
+/// of its values by emitting each contained.
+def eachValue[K, V](map: Map[K, V]): Unit / emit[V] =
+  map.foreach { (_k, v) => do emit(v) }
+
+/// Turns a `set` into a producer of a push stream
+/// by emitting each contained *in order*.
+def each[A](set: Set[A]): Unit / emit[A] =
+  set.foreach { x => do emit(x) }
+
 // not option
 // not dequeue
 // not queue
@@ -168,6 +191,28 @@ def feed[T, R](list: List[T]) { reader: () => R / read[T] }: R = {
   }
 }
 
+def collectMap[K, V, R](compare: (K, K) => Ordering at {}) { stream: () => R / emit[(K, V)] }: (R, Map[K, V]) =
+  try {
+    (stream(), map::empty(compare))
+  } with emit[(K, V)] { case (k, v) =>
+    val (r, map) = resume(());
+    (r, map.put(k, v))
+  }
+
+def collectMap[K, V](compare: (K, K) => Ordering at {}) { stream: () => Any / emit[(K, V)] }: Map[K, V] =
+  collectMap[K, V, Any](compare){stream}.second
+
+def collectSet[A, R](compare: (A, A) => Ordering at {}) { stream: () => R / emit[A] }: (R, Set[A]) =
+  try {
+    (stream(), set::empty(compare))
+  } with emit[A] { (v) =>
+    val (r, set) = resume(());
+    (r, set.insert(v))
+  }
+
+def collectSet[A](compare: (A, A) => Ordering at {}) { stream: () => Any / emit[A] }: Set[A] =
+  collectSet[A, Any](compare){stream}.second
+
 def feed[T, R](array: Array[T]) { reader: () => R / read[T] }: R = {
   var i = 0
   try {

package/libraries/common/string.effekt

@@ -243,11 +243,13 @@ extern pure def toInt(ch: Char): Int =
   js "${ch}"
   chez "${ch}"
   llvm "ret %Int ${ch}"
+  vm "string::toInt(Char)"
 
 extern pure def toChar(codepoint: Int): Char =
   js "${codepoint}"
   chez "${codepoint}"
   llvm "ret %Int ${codepoint}"
+  vm "string::toChar(Int)"
 
 
 extern pure def infixLt(x: Char, y: Char): Bool =
@@ -259,6 +261,7 @@ extern pure def infixLt(x: Char, y: Char): Bool =
     %adt_boolean = insertvalue %Pos zeroinitializer, i64 %fat_z, 0
     ret %Pos %adt_boolean
   """
+  vm "string::infixLt(Char, Char)"
 
 extern pure def infixLte(x: Char, y: Char): Bool =
   js "(${x} <= ${y})"
@@ -269,6 +272,7 @@ extern pure def infixLte(x: Char, y: Char): Bool =
     %adt_boolean = insertvalue %Pos zeroinitializer, i64 %fat_z, 0
     ret %Pos %adt_boolean
   """
+  vm "string::infixLte(Char, Char)"
 
 extern pure def infixGt(x: Char, y: Char): Bool =
   js "(${x} > ${y})"
@@ -279,6 +283,7 @@ extern pure def infixGt(x: Char, y: Char): Bool =
     %adt_boolean = insertvalue %Pos zeroinitializer, i64 %fat_z, 0
     ret %Pos %adt_boolean
   """
+  vm "string::infixGt(Char, Char)"
 
 extern pure def infixGte(x: Char, y: Char): Bool =
   js "(${x} >= ${y})"
@@ -289,6 +294,7 @@ extern pure def infixGte(x: Char, y: Char): Bool =
     %adt_boolean = insertvalue %Pos zeroinitializer, i64 %fat_z, 0
     ret %Pos %adt_boolean
   """
+  vm "string::infixGte(Char, Char)"
 
 
 /**
@@ -327,3 +333,4 @@ extern pure def unsafeCharAt(str: String, n: Int): Char =
     %x = call %Int @c_bytearray_character_at(%Pos ${str}, %Int ${n})
     ret %Int %x
   """
+  vm "string::unsafeCharAt(String, Int)"

package/libraries/llvm/bytearray.c

@@ -152,16 +152,45 @@ struct Pos c_bytearray_equal(const struct Pos left, const struct Pos right) {
         erasePositive(right);
         return BooleanFalse;
     }
-    for (uint64_t j = 0; j < left_size; ++j) {
-        if (c_bytearray_data(left)[j] != c_bytearray_data(right)[j]) {
-            erasePositive(left);
-            erasePositive(right);
-            return BooleanFalse;
-        }
+
+    int cmp = memcmp(c_bytearray_data(left), c_bytearray_data(right), left_size);
+    erasePositive(left);
+    erasePositive(right);
+    return (cmp == 0 ? BooleanTrue : BooleanFalse);
+}
+
+Int c_bytearray_compare(const struct Pos left, const struct Pos right) {
+    uint64_t left_size = left.tag;
+    uint64_t right_size = right.tag;
+    uint64_t min_size = (left_size < right_size) ? left_size : right_size;
+    
+    uint8_t* left_data = c_bytearray_data(left);
+    uint8_t* right_data = c_bytearray_data(right);
+
+    if (left_data == right_data) {
+        erasePositive(left);
+        erasePositive(right);   
+        return 0;
     }
+
+    int cmp = memcmp(left_data, right_data, min_size);
+
     erasePositive(left);
     erasePositive(right);
-    return BooleanTrue;
+
+    if (cmp < 0) {
+        return -1;
+    } else if (cmp > 0) {
+        return 1;
+    }
+    
+    if (left_size < right_size) {
+        return -1;
+    } else if (left_size > right_size) {
+        return 1;
+    }
+
+    return 0;
 }
 
 // TODO deprecate

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

@@ -37,6 +37,7 @@ declare %Pos @c_bytearray_show_Double(double)
 
 declare %Pos @c_bytearray_concatenate(%Pos, %Pos)
 declare %Pos @c_bytearray_equal(%Pos, %Pos)
+declare %Int @c_bytearray_compare(%Pos, %Pos)
 
 declare %Pos @c_bytearray_substring(%Pos, i64, i64)
 declare %Int @c_bytearray_character_at(%Pos, i64)

package/libraries/llvm/main.c

@@ -40,4 +40,5 @@ int main(int argc, char *argv[]) {
     uv_loop_t *loop = uv_default_loop();
     uv_run(loop, UV_RUN_DEFAULT);
     uv_loop_close(loop);
+    return 0;
 }

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

@@ -1,4 +1,4 @@
-<!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/logos/eclipse-foundation-400x400.png"><meta name=twitter:image content="https://www.eclipse.org/images/logos/eclipse-foundation-400x400.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.110.0"><link rel=canonical href=https://www.eclipse.org/legal/epl-2.0/><link rel=alternate href=/legal/epl-2.0/index.xml type=application/rss+xml title><link rel=stylesheet href="/public/css/styles.css?v=1737314120"><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></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 class=sr-only href=#content>Skip to main content</a><header class="header-wrapper header-wrapper" id=header><div class=header-toolbar><div class=container><div class=header-toolbar-row><div class="toolbar-btn toolbar-search-btn dropdown"><button class=dropdown-toggle id=toolbar-search type=button data-toggle=dropdown tabindex=0 aria-label=Search>
+<!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/logos/eclipse-foundation-400x400.png"><meta name=twitter:image content="https://www.eclipse.org/images/logos/eclipse-foundation-400x400.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.110.0"><link rel=canonical href=https://www.eclipse.org/legal/epl-2.0/><link rel=alternate href=/legal/epl-2.0/index.xml type=application/rss+xml title><link rel=stylesheet href="/public/css/styles.css?v=1737918922"><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></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 class=sr-only href=#content>Skip to main content</a><header class="header-wrapper header-wrapper" id=header><div class=header-toolbar><div class=container><div class=header-toolbar-row><div class="toolbar-btn toolbar-search-btn dropdown"><button class=dropdown-toggle id=toolbar-search type=button data-toggle=dropdown tabindex=0 aria-label=Search>
 <i class="fa fa-search fa-lg" aria-role=none></i></button><div class="toolbar-search-bar-wrapper dropdown-menu dropdown-menu-right" aria-labelledby=toolbar-search><form action=https://www.eclipse.org/home/search method=get><div class=search-bar><input class=search-bar-input name=q placeholder=Search>
 <button>
 <i class="fa fa-search" type=submit></i></button></div></form></div></div><div class="toolbar-btn toolbar-user-menu-btn dropdown"><button class=dropdown-toggle id=toolbar-user-menu type=button data-toggle=dropdown tabindex=0 aria-label="User Menu">
@@ -57,5 +57,5 @@ open source software collaboration and innovation.</p></div><div class=mega-menu
 <i class="fa-brands fa-linkedin-in fa-stack-1x fa-inverse" aria-hidden=true></i>
 <span class=sr-only>Linkedin account</span></span></a></li></ul></div></div><div class="footer-sections row equal-height-md font-bold"><div class=col-md-15><div class=row><section id=footer-eclipse-foundation class="footer-section col-sm-8"><div class=menu-heading>Eclipse Foundation</div><ul class=nav><li><a href=https://www.eclipse.org/org/>About</a></li><li><a href=https://projects.eclipse.org/>Projects</a></li><li><a href=https://www.eclipse.org/collaborations/>Collaborations</a></li><li><a href=https://www.eclipse.org/membership/>Membership</a></li><li><a href=https://www.eclipse.org/sponsor/>Sponsor</a></li></ul></section><section id=footer-legal class="footer-section col-sm-8"><div class=menu-heading>Legal</div><ul class=nav><li><a href=https://www.eclipse.org/legal/privacy/>Privacy Policy</a></li><li><a href=https://www.eclipse.org/legal/terms-of-use/>Terms of Use</a></li><li><a href=https://www.eclipse.org/legal/compliance/>Compliance</a></li><li><a href=https://www.eclipse.org/org/documents/Community_Code_of_Conduct.php>Code of Conduct</a></li><li><a href=https://www.eclipse.org/legal/>Legal Resources</a></li><li><a class=toolbar-manage-cookies href=# onclick=event.preventDefault()>Manage Cookies</a></li></ul></section><section id=footer-more class="footer-section col-sm-8"><div class=menu-heading>More</div><ul class=nav><li><a href=https://www.eclipse.org/security/>Report a Vulnerability</a></li><li><a href=https://status.eclipse.org/>Service Status</a></li><li><a href=https://www.eclipse.org/org/foundation/contact.php>Contact Us</a></li><li><a href=https://www.eclipse.org/projects/support/>Support</a></li></ul></section></div></div><div id=footer-end class="footer-section col-md-8 col-md-offset-1 col-sm-24"><div class=footer-end-newsletter><form id=mc-embedded-subscribe-form action=https://eclipsecon.us6.list-manage.com/subscribe/post method=post novalidate target=_blank><label class=footer-end-newsletter-label for=email>Subscribe to our Newsletter</label><div class=footer-end-newsletter-input-wrapper><input class=footer-end-newsletter-input type=email id=email name=EMAIL autocomplete=email placeholder="Enter your email address"><div><i class="fa fa-solid fa-envelope fa-lg" aria-hidden=true></i></div></div><input type=hidden name=u value=eaf9e1f06f194eadc66788a85>
 <input type=hidden name=id value=46e57eacf1>
-<input id=mc-embedded-subscribe type=submit name=subscribe hidden></form></div></div></div><div class="col-sm-24 margin-top-20"><div class=row><div id=copyright class=col-md-16><p id=copyright-text>Copyright &copy; Eclipse Foundation AISBL. All Rights Reserved.</p></div></div></div><a href=# class=scrollup>Back to the top</a></div></footer><div id=footer-js><script src="/public/js/main.js?v1.0?v=1737314120"></script>
+<input id=mc-embedded-subscribe type=submit name=subscribe hidden></form></div></div></div><div class="col-sm-24 margin-top-20"><div class=row><div id=copyright class=col-md-16><p id=copyright-text>Copyright &copy; Eclipse Foundation AISBL. All Rights Reserved.</p></div></div></div><a href=# class=scrollup>Back to the top</a></div></footer><div id=footer-js><script src="/public/js/main.js?v1.0?v=1737918922"></script>
 <script>(function(){})(jQuery,document)</script></div></body></html>

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

@@ -298,7 +298,7 @@ jQuery(function(jQuery){jQuery.datepicker.setDefaults({"closeText":"Close","curr
 <script type="text/javascript" src="https://c0.wp.com/c/6.7.1/wp-includes/js/jquery/ui/dialog.min.js" id="jquery-ui-dialog-js"></script>
 <script type="text/javascript" id="events-manager-js-extra">
 /* <![CDATA[ */
-var EM = {"ajaxurl":"https:\/\/opensource.org\/wp-admin\/admin-ajax.php","locationajaxurl":"https:\/\/opensource.org\/wp-admin\/admin-ajax.php?action=locations_search","firstDay":"1","locale":"en","dateFormat":"yy-mm-dd","ui_css":"https:\/\/opensource.org\/wp-content\/plugins\/events-manager\/includes\/css\/jquery-ui\/build.min.css","show24hours":"0","is_ssl":"1","autocomplete_limit":"10","calendar":{"breakpoints":{"small":560,"medium":908,"large":false}},"phone":"","datepicker":{"format":"Y-m-d"},"search":{"breakpoints":{"small":650,"medium":850,"full":false}},"url":"https:\/\/opensource.org\/wp-content\/plugins\/events-manager","bookingInProgress":"Please wait while the booking is being submitted.","tickets_save":"Save Ticket","bookingajaxurl":"https:\/\/opensource.org\/wp-admin\/admin-ajax.php","bookings_export_save":"Export Bookings","bookings_settings_save":"Save Settings","booking_delete":"Are you sure you want to delete?","booking_offset":"30","bookings":{"submit_button":{"text":{"default":"Submit Booking","free":"Submit Booking","payment":"Submit Booking - %s","processing":"Processing ..."}},"update_listener":""},"bb_full":"Sold Out","bb_book":"Book Now","bb_booking":"Booking...","bb_booked":"Booking Submitted","bb_error":"Booking Error. Try again?","bb_cancel":"Cancel","bb_canceling":"Canceling...","bb_cancelled":"Cancelled","bb_cancel_error":"Cancellation Error. Try again?","txt_search":"Search","txt_searching":"Searching...","txt_loading":"Loading...","cache":"1","api_nonce":"78434fac4e","attendance_api_url":"https:\/\/opensource.org\/wp-json\/events-manager\/v1\/attendance"};
+var EM = {"ajaxurl":"https:\/\/opensource.org\/wp-admin\/admin-ajax.php","locationajaxurl":"https:\/\/opensource.org\/wp-admin\/admin-ajax.php?action=locations_search","firstDay":"1","locale":"en","dateFormat":"yy-mm-dd","ui_css":"https:\/\/opensource.org\/wp-content\/plugins\/events-manager\/includes\/css\/jquery-ui\/build.min.css","show24hours":"0","is_ssl":"1","autocomplete_limit":"10","calendar":{"breakpoints":{"small":560,"medium":908,"large":false}},"phone":"","datepicker":{"format":"Y-m-d"},"search":{"breakpoints":{"small":650,"medium":850,"full":false}},"url":"https:\/\/opensource.org\/wp-content\/plugins\/events-manager","bookingInProgress":"Please wait while the booking is being submitted.","tickets_save":"Save Ticket","bookingajaxurl":"https:\/\/opensource.org\/wp-admin\/admin-ajax.php","bookings_export_save":"Export Bookings","bookings_settings_save":"Save Settings","booking_delete":"Are you sure you want to delete?","booking_offset":"30","bookings":{"submit_button":{"text":{"default":"Submit Booking","free":"Submit Booking","payment":"Submit Booking - %s","processing":"Processing ..."}},"update_listener":""},"bb_full":"Sold Out","bb_book":"Book Now","bb_booking":"Booking...","bb_booked":"Booking Submitted","bb_error":"Booking Error. Try again?","bb_cancel":"Cancel","bb_canceling":"Canceling...","bb_cancelled":"Cancelled","bb_cancel_error":"Cancellation Error. Try again?","txt_search":"Search","txt_searching":"Searching...","txt_loading":"Loading...","cache":"1","api_nonce":"2142c68a49","attendance_api_url":"https:\/\/opensource.org\/wp-json\/events-manager\/v1\/attendance"};
 /* ]]> */
 </script>
 <script type="text/javascript" src="https://149753425.v2.pressablecdn.com/wp-content/plugins/events-manager/includes/js/events-manager.js?ver=6.6.3" id="events-manager-js"></script>
@@ -861,6 +861,10 @@ form.customize-unpreviewable {
     height: auto;
     border-radius: 8px;
     margin-bottom: 10px;
+}
+
+.updated {
+	display: none;
 }		</style>
 		</head>
 
@@ -1026,7 +1030,7 @@ form.customize-unpreviewable {
 			<li id="menu-item-5429" class="menu-item menu-item-type-post_type menu-item-object-page menu-item-5429"><a href="https://go.opensource.org/osaid-latest">OSAI Definition</a></li>
 					<li id="menu-item-5421" class="menu-item menu-item-type-post_type menu-item-object-page menu-item-5428"><a href="https://opensource.org/ai/process">Process</a></li>
 			<li id="menu-item-5430" class="menu-item menu-item-type-post_type menu-item-object-page menu-item-5430"><a href="https://opensource.org/ai/timeline">Timeline</a></li>
-					<li id="menu-item-24456" class="menu-item menu-item-type-post_type menu-item-object-page menu-item-24456"><a href="https://opensource.org/ai/faqs">FAQs</a></li>
+					<li id="menu-item-24456" class="menu-item menu-item-type-post_type menu-item-object-page menu-item-24456"><a href="https://opensource.org/ai/faq">FAQ</a></li>
 					<li id="menu-item-17410" class="menu-item menu-item-type-post_type menu-item-object-page menu-item-17410"><a href="https://opensource.org/ai/forums">Forum</a></li>
 				</ul>
 			</div>
@@ -1251,37 +1255,37 @@ wp.jpI18nLoader.state = {"baseUrl":"https://opensource.org/wp-content/languages/
 <script type="text/javascript" src="https://149753425.v2.pressablecdn.com/wp-content/plugins/gutenberg/build/url/index.min.js?ver=499ac283dc628dfb623e" id="wp-url-js"></script>
 <script type="text/javascript" id="jetpack-instant-search-js-before">
 /* <![CDATA[ */
-var JetpackInstantSearchOptions=JSON.parse(decodeURIComponent("%7B%22overlayOptions%22%3A%7B%22colorTheme%22%3A%22light%22%2C%22enableInfScroll%22%3Atrue%2C%22enableFilteringOpensOverlay%22%3Atrue%2C%22enablePostDate%22%3Atrue%2C%22enableSort%22%3Atrue%2C%22highlightColor%22%3A%22%23fdd7b9%22%2C%22overlayTrigger%22%3A%22submit%22%2C%22resultFormat%22%3A%22expanded%22%2C%22showPoweredBy%22%3Atrue%2C%22defaultSort%22%3A%22relevance%22%2C%22excludedPostTypes%22%3A%5B%22attachment%22%5D%7D%2C%22homeUrl%22%3A%22https%3A%5C%2F%5C%2Fopensource.org%22%2C%22locale%22%3A%22en-US%22%2C%22postsPerPage%22%3A12%2C%22siteId%22%3A210318891%2C%22postTypes%22%3A%7B%22post%22%3A%7B%22singular_name%22%3A%22Post%22%2C%22name%22%3A%22Posts%22%7D%2C%22page%22%3A%7B%22singular_name%22%3A%22Page%22%2C%22name%22%3A%22Pages%22%7D%2C%22attachment%22%3A%7B%22singular_name%22%3A%22Media%22%2C%22name%22%3A%22Media%22%7D%2C%22supporter%22%3A%7B%22singular_name%22%3A%22Supporter%22%2C%22name%22%3A%22Supporters%22%7D%2C%22board-member%22%3A%7B%22singular_name%22%3A%22Board%20Member%22%2C%22name%22%3A%22Board%20Members%22%7D%2C%22license%22%3A%7B%22singular_name%22%3A%22License%22%2C%22name%22%3A%22Licenses%22%7D%2C%22meeting-minutes%22%3A%7B%22singular_name%22%3A%22Meeting%20Minutes%22%2C%22name%22%3A%22Meeting%20Minutes%22%7D%2C%22press-mentions%22%3A%7B%22singular_name%22%3A%22Press%20mentions%22%2C%22name%22%3A%22Press%20mentions%22%7D%7D%2C%22webpackPublicPath%22%3A%22https%3A%5C%2F%5C%2Fopensource.org%5C%2Fwp-content%5C%2Fplugins%5C%2Fjetpack%5C%2Fjetpack_vendor%5C%2Fautomattic%5C%2Fjetpack-search%5C%2Fbuild%5C%2Finstant-search%5C%2F%22%2C%22isPhotonEnabled%22%3Atrue%2C%22isFreePlan%22%3Afalse%2C%22apiRoot%22%3A%22https%3A%5C%2F%5C%2Fopensource.org%5C%2Fwp-json%5C%2F%22%2C%22apiNonce%22%3A%2278434fac4e%22%2C%22isPrivateSite%22%3Afalse%2C%22isWpcom%22%3Afalse%2C%22hasOverlayWidgets%22%3Atrue%2C%22widgets%22%3A%5B%7B%22filters%22%3A%5B%7B%22name%22%3A%22Post%20Types%22%2C%22type%22%3A%22post_type%22%2C%22count%22%3A6%2C%22widget_id%22%3A%22jetpack-search-filters-4%22%2C%22filter_id%22%3A%22post_type_0%22%7D%2C%7B%22name%22%3A%22Categories%22%2C%22type%22%3A%22taxonomy%22%2C%22taxonomy%22%3A%22category%22%2C%22count%22%3A5%2C%22widget_id%22%3A%22jetpack-search-filters-4%22%2C%22filter_id%22%3A%22taxonomy_1%22%7D%2C%7B%22name%22%3A%22Tags%22%2C%22type%22%3A%22taxonomy%22%2C%22taxonomy%22%3A%22post_tag%22%2C%22count%22%3A5%2C%22widget_id%22%3A%22jetpack-search-filters-4%22%2C%22filter_id%22%3A%22taxonomy_2%22%7D%2C%7B%22name%22%3A%22Year%22%2C%22type%22%3A%22date_histogram%22%2C%22count%22%3A5%2C%22field%22%3A%22post_date%22%2C%22interval%22%3A%22year%22%2C%22widget_id%22%3A%22jetpack-search-filters-4%22%2C%22filter_id%22%3A%22date_histogram_3%22%7D%5D%2C%22widget_id%22%3A%22jetpack-search-filters-4%22%7D%5D%2C%22widgetsOutsideOverlay%22%3A%5B%5D%2C%22hasNonSearchWidgets%22%3Afalse%2C%22preventTrackingCookiesReset%22%3Afalse%7D"));
+var JetpackInstantSearchOptions=JSON.parse(decodeURIComponent("%7B%22overlayOptions%22%3A%7B%22colorTheme%22%3A%22light%22%2C%22enableInfScroll%22%3Atrue%2C%22enableFilteringOpensOverlay%22%3Atrue%2C%22enablePostDate%22%3Atrue%2C%22enableSort%22%3Atrue%2C%22highlightColor%22%3A%22%23fdd7b9%22%2C%22overlayTrigger%22%3A%22submit%22%2C%22resultFormat%22%3A%22expanded%22%2C%22showPoweredBy%22%3Atrue%2C%22defaultSort%22%3A%22relevance%22%2C%22excludedPostTypes%22%3A%5B%22attachment%22%5D%7D%2C%22homeUrl%22%3A%22https%3A%5C%2F%5C%2Fopensource.org%22%2C%22locale%22%3A%22en-US%22%2C%22postsPerPage%22%3A12%2C%22siteId%22%3A210318891%2C%22postTypes%22%3A%7B%22post%22%3A%7B%22singular_name%22%3A%22Post%22%2C%22name%22%3A%22Posts%22%7D%2C%22page%22%3A%7B%22singular_name%22%3A%22Page%22%2C%22name%22%3A%22Pages%22%7D%2C%22attachment%22%3A%7B%22singular_name%22%3A%22Media%22%2C%22name%22%3A%22Media%22%7D%2C%22supporter%22%3A%7B%22singular_name%22%3A%22Supporter%22%2C%22name%22%3A%22Supporters%22%7D%2C%22board-member%22%3A%7B%22singular_name%22%3A%22Board%20Member%22%2C%22name%22%3A%22Board%20Members%22%7D%2C%22license%22%3A%7B%22singular_name%22%3A%22License%22%2C%22name%22%3A%22Licenses%22%7D%2C%22meeting-minutes%22%3A%7B%22singular_name%22%3A%22Meeting%20Minutes%22%2C%22name%22%3A%22Meeting%20Minutes%22%7D%2C%22press-mentions%22%3A%7B%22singular_name%22%3A%22Press%20mentions%22%2C%22name%22%3A%22Press%20mentions%22%7D%7D%2C%22webpackPublicPath%22%3A%22https%3A%5C%2F%5C%2Fopensource.org%5C%2Fwp-content%5C%2Fplugins%5C%2Fjetpack%5C%2Fjetpack_vendor%5C%2Fautomattic%5C%2Fjetpack-search%5C%2Fbuild%5C%2Finstant-search%5C%2F%22%2C%22isPhotonEnabled%22%3Atrue%2C%22isFreePlan%22%3Afalse%2C%22apiRoot%22%3A%22https%3A%5C%2F%5C%2Fopensource.org%5C%2Fwp-json%5C%2F%22%2C%22apiNonce%22%3A%222142c68a49%22%2C%22isPrivateSite%22%3Afalse%2C%22isWpcom%22%3Afalse%2C%22hasOverlayWidgets%22%3Atrue%2C%22widgets%22%3A%5B%7B%22filters%22%3A%5B%7B%22name%22%3A%22Post%20Types%22%2C%22type%22%3A%22post_type%22%2C%22count%22%3A6%2C%22widget_id%22%3A%22jetpack-search-filters-4%22%2C%22filter_id%22%3A%22post_type_0%22%7D%2C%7B%22name%22%3A%22Categories%22%2C%22type%22%3A%22taxonomy%22%2C%22taxonomy%22%3A%22category%22%2C%22count%22%3A5%2C%22widget_id%22%3A%22jetpack-search-filters-4%22%2C%22filter_id%22%3A%22taxonomy_1%22%7D%2C%7B%22name%22%3A%22Tags%22%2C%22type%22%3A%22taxonomy%22%2C%22taxonomy%22%3A%22post_tag%22%2C%22count%22%3A5%2C%22widget_id%22%3A%22jetpack-search-filters-4%22%2C%22filter_id%22%3A%22taxonomy_2%22%7D%2C%7B%22name%22%3A%22Year%22%2C%22type%22%3A%22date_histogram%22%2C%22count%22%3A5%2C%22field%22%3A%22post_date%22%2C%22interval%22%3A%22year%22%2C%22widget_id%22%3A%22jetpack-search-filters-4%22%2C%22filter_id%22%3A%22date_histogram_3%22%7D%5D%2C%22widget_id%22%3A%22jetpack-search-filters-4%22%7D%5D%2C%22widgetsOutsideOverlay%22%3A%5B%5D%2C%22hasNonSearchWidgets%22%3Afalse%2C%22preventTrackingCookiesReset%22%3Afalse%7D"));
 /* ]]> */
 </script>
 <script type="text/javascript" src="https://149753425.v2.pressablecdn.com/wp-content/plugins/jetpack/jetpack_vendor/automattic/jetpack-search/build/instant-search/jp-search.js?minify=false&amp;ver=da5ecd9f722e7fcb409e" id="jetpack-instant-search-js"></script>
-<script data-service="jetpack-statistics" data-category="statistics" type="text/plain" data-cmplz-src="//stats.wp.com/w.js?ver=202504" id="jp-tracks-js"></script>
+<script data-service="jetpack-statistics" data-category="statistics" type="text/plain" data-cmplz-src="//stats.wp.com/w.js?ver=202505" id="jp-tracks-js"></script>
 <script type="text/javascript" id="osi-theme-scripts-js-before">
 /* <![CDATA[ */
 const OSI_LICENSE_DB = {"ajaxURL":"https:\/\/opensource.org\/wp-admin\/admin-ajax.php","action":"osi_license_db"}
 /* ]]> */
 </script>
 <script type="text/javascript" src="https://149753425.v2.pressablecdn.com/wp-content/themes/osi/assets/js/build/theme.js?ver=1724798073" id="osi-theme-scripts-js"></script>
-<script data-service="jetpack-statistics" data-category="statistics" type="text/plain" data-cmplz-src="https://stats.wp.com/e-202504.js" id="jetpack-stats-js" data-wp-strategy="defer"></script>
+<script data-service="jetpack-statistics" data-category="statistics" type="text/plain" data-cmplz-src="https://stats.wp.com/e-202505.js" id="jetpack-stats-js" data-wp-strategy="defer"></script>
 <script type="text/javascript" id="jetpack-stats-js-after">
 /* <![CDATA[ */
 _stq = window._stq || [];
-_stq.push([ "view", JSON.parse("{\"v\":\"ext\",\"blog\":\"210318891\",\"post\":\"395\",\"tz\":\"0\",\"srv\":\"opensource.org\",\"hp\":\"atomic\",\"ac\":\"3\",\"amp\":\"0\",\"j\":\"1:14.3-a.1\"}") ]);
+_stq.push([ "view", JSON.parse("{\"v\":\"ext\",\"blog\":\"210318891\",\"post\":\"395\",\"tz\":\"0\",\"srv\":\"opensource.org\",\"hp\":\"atomic\",\"ac\":\"3\",\"amp\":\"0\",\"j\":\"1:14.3-a.3\"}") ]);
 _stq.push([ "clickTrackerInit", "210318891", "395" ]);
 /* ]]> */
 </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":"67","version":"7.2.0","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":"16","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=67","page_links":{"eu":{"cookie-statement":{"title":"","url":"https:\/\/opensource.org\/license\/mpl-2-0"}}},"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":"67","version":"7.2.0","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":"16","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=67","page_links":{"eu":{"cookie-statement":{"title":"","url":"https:\/\/opensource.org\/license\/cvw"}}},"tm_categories":"","forceEnableStats":"","preview":"","clean_cookies":"","aria_label":"Click to accept {category} cookies and enable this content"};
 /* ]]> */
 </script>
 <script defer type="text/javascript" src="https://149753425.v2.pressablecdn.com/wp-content/plugins/complianz-gdpr/cookiebanner/js/complianz.min.js?ver=1736534359" id="cmplz-cookiebanner-js"></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:'904bff21bdea07c8',t:'MTczNzM0MzkzOC4wMDAwMDA='};var a=document.createElement('script');a.nonce='';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:'9085b008ed428224',t:'MTczNzk0ODg3My4wMDAwMDA='};var a=document.createElement('script');a.nonce='';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 7 seconds ago
-	generated in 0.522 seconds
+	generated 6 seconds ago
+	generated in 0.574 seconds
 	served from batcache in 0.003 seconds
-	expires in 293 seconds
+	expires in 294 seconds
 -->