+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Skip to content
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms lecture¶
+TODO¶
+-
+
- [ ] Add RNG seed +
- [ ] A function must test its input in public functions. Consider using a
unsafe_function
+ - [ ] A function may choose not to test its input in private functions. +
- [ ] A function must not test itself, it must be tested externally instead +
- [ ] Add 'Design by Contract' and the role of assert, picture from https://en.wikipedia.org/wiki/File:Design_by_contract.svg +
- [ ] Add that 'Design by Contract' as a formal language extension is deferred in https://peps.python.org/pep-0316/ +
- [ ] Add Defensive programming and Offensive programming +
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/algorithms/algorithms_lecture/phil_karlton_with_fish.jpg b/algorithms/algorithms_lecture/phil_karlton_with_fish.jpg
new file mode 100644
index 000000000..91dafbdde
Binary files /dev/null and b/algorithms/algorithms_lecture/phil_karlton_with_fish.jpg differ
diff --git a/algorithms/algorithms_lecture/programming_formalism_course.png b/algorithms/algorithms_lecture/programming_formalism_course.png
new file mode 100644
index 000000000..f5c55d988
Binary files /dev/null and b/algorithms/algorithms_lecture/programming_formalism_course.png differ
diff --git a/algorithms/algorithms_lecture/programming_formalism_logo_25_cropped.png b/algorithms/algorithms_lecture/programming_formalism_logo_25_cropped.png
new file mode 100644
index 000000000..9b7f312ad
Binary files /dev/null and b/algorithms/algorithms_lecture/programming_formalism_logo_25_cropped.png differ
diff --git a/algorithms/algorithms_lecture/styles.css b/algorithms/algorithms_lecture/styles.css
new file mode 100644
index 000000000..0925932e4
--- /dev/null
+++ b/algorithms/algorithms_lecture/styles.css
@@ -0,0 +1,7 @@
+.reveal section p {
+ font-size: 1.0em;
+}
+
+.reveal section pre code {
+ font-size: 1.0em;
+}
diff --git a/algorithms/algorithms_lecture/the_clean_coder.png b/algorithms/algorithms_lecture/the_clean_coder.png
new file mode 100644
index 000000000..811101546
Binary files /dev/null and b/algorithms/algorithms_lecture/the_clean_coder.png differ
diff --git a/algorithms/algorithms_lecture/vancouver.csl b/algorithms/algorithms_lecture/vancouver.csl
new file mode 100644
index 000000000..e39efa8d8
--- /dev/null
+++ b/algorithms/algorithms_lecture/vancouver.csl
@@ -0,0 +1,351 @@
+
+
diff --git a/algorithms/assert/index.html b/algorithms/assert/index.html
new file mode 100644
index 000000000..df69809de
--- /dev/null
+++ b/algorithms/assert/index.html
@@ -0,0 +1,2373 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Skip to content
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+The role of
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ assert¶
+
+
+Learning objectives
+-
+
- Understand design by contract +
- Understand algorithm names increase expressiveness of code +
- Understand difference between
ifandassertin function writing
+
The role of assert within functions¶
+Within functions, assert is used for:
-
+
- as a stub +
- to do things in debug mode only +
- to document assumptions a developer makes +
assert differs between debug and release¶
+$ cat assert.py
+assert 1 == 2
+
+$ python -O assert.py
+
+$ python assert.py
+Traceback (most recent call last):
+ File "/home/richel/assert.py", line 1, in <module>
+ assert 1 == 2
+AssertionError
+assert as a stub¶
+
+assert in debug mode¶
+def align_two_dna_sequences(dna_sequences):
+ """Internal function to align two DNA sequences"""
+ assert len(dna_sequences) == 2 # TODO
+Superior to documentation, as it cannot be ignored.
+++Assert liberally to document internal assumptions and invariants
+@sutter2004cpp chapter 68.
+
assert to document assumptions a developer makes¶
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/algorithms/components.png b/algorithms/components.png
new file mode 100644
index 000000000..ee1ef6a85
Binary files /dev/null and b/algorithms/components.png differ
diff --git a/algorithms/design_by_contract.png b/algorithms/design_by_contract.png
new file mode 100644
index 000000000..cc58352d9
Binary files /dev/null and b/algorithms/design_by_contract.png differ
diff --git a/algorithms/fibonacci_squares.png b/algorithms/fibonacci_squares.png
new file mode 100644
index 000000000..26ddc4338
Binary files /dev/null and b/algorithms/fibonacci_squares.png differ
diff --git a/algorithms/function_design/index.html b/algorithms/function_design/index.html
new file mode 100644
index 000000000..d7612b20f
--- /dev/null
+++ b/algorithms/function_design/index.html
@@ -0,0 +1,2839 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Skip to content
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Function design¶
+
+
+Learning objectives
+-
+
- Understand design by contract +
- Understand algorithm names increase expressiveness of code +
- Understand difference between
ifandassertin function writing
+
Intro¶
+Problem¶
+How do I write functions [1] that are:
+-
+
- easy to use +
- correct +
- fast [2] +
References;
+-
+
- [1] For now, we use
algorithm == function, + as the definition of an algorithm is + 'a step-by-step procedure for solving a problem or accomplishing some + end'[dictionary definition]
+ - [2] pick any vague definition +
What is a good function? 1/3¶
+A good function ...
+. . .
+-
+
- Sometimes: is documented
[Ram, 2013][tidyverse style guideline of functions]
+ - Is small
[Martin, 2009]+ @cpp_core_guidelines_functions +[tidyverse style guideline of functions]
+ - Has a good (
) name [Martin, 2009]+ @cpp_core_guidelines_functions[tidyverse style guideline of functions]+ @pep_20 @hitchhikers_guide_to_python_general_concepts
+ - Is easy to use correctly and hard to use incorrectly + @meyers2005effective + @cpp_core_guidelines_functions @pep_20 +
- Does one thing correctly
[Martin, 2009]+ @cpp_core_guidelines_functions +[tidyverse style guideline of functions]
+ - Is tested @martin2011clean @cpp_core_guidelines_functions
+
[tidyverse style guideline of functions]
+ - Raises helpful exceptions
[Martin, 2009]+ @cpp_core_guidelines_functions +[tidyverse style guideline of functions]@pep_20
+ - Fast iff needed @cpp_core_guidelines_functions +
Design by contract¶
+
+ ++
A good function is documented¶
+def sort_1(x):
+ """Sort list `x` in-place.
+
+ Returns nothing
+ """
+
+def sort_2(x):
+ """Sort list `x`.
+
+ Returns the sorted list.
+ """
+
+assert sort_1.__doc__
+assert sort_2.__doc__
+
+
+Prefer R?
+ +Mandatory in some contexts [Ram, 2013]
+[tidyverse style guideline of functions].
A good function has a good name¶
+++There are only two hard things in Computer Science: +cache invalidation and naming things
+Phil Karlton
+
-
+
- starts with a verb
[tidyverse style guideline of functions]
+ - readable @pep_20 +
- intention-revealing
[Martin, 2009]
+ - pronounceable
[Martin, 2009]
+ - searchable
[Martin, 2009]
+ - not cute
[Martin, 2009]
+ - no pun
[Martin, 2009]
+ - carefully @cpp_core_guidelines_functions +
Examples of bad function names?¶
+Could you give examples of bad function names?
+. . .
+-
+
calculate: calculates what?
+
. . .
+-
+
calc_bfgt: calculates what??
+
. . .
+-
+
prime: a prime number is a data type. What does this function do?
+
. . .
+-
+
needleman_wunch: this is a technique to get a DNA alignment.
+
. . .
+Example 1¶
+Imagine two DNA sequences:
+ +How would you call the algorithm that detects the location
+of the * (but not of the x, as the * comes earlier)?
Solutions 1¶
+-
+
get_first_mismatch_pos,get_first_mismatch_locus, +find_first_mismatch_pos,find_first_mismatch_locus
+- your answer that ...
-
+
- starts with a verb +
- is as English as possible +
- only uses common abbreviations +
+
Example 2¶
+Imagine two DNA sequences:
+ +How would you call the algorithm that detects all the locations of the *s?
Solutions 2¶
+-
+
find_mismatch_positions,find_mismatch_loci, +get_mismatch_positions,get_mismatch_loci
+- your answer that ...
-
+
- starts with a verb +
- is as English as possible +
- only uses common abbreviations +
+
Example 3¶
+Imagine two DNA sequences:
+ +How would you call the algorithm that makes the sequences
+have as much similarities as possible, by possibly inserting a -
Solutions 3¶
+-
+
align_seqs,align_sequences,align_dna_sequences,align_dna_seqs, +calc_aligned_seqs,get_aligned_seqs
+- your answer that
-
+
- starts with a verb +
- is as English as possible +
- only uses common abbreviations +
+
A good function has a clear name¶
+-
+
- F.1: "Package" meaningful operations as carefully named functions +
- Use verbs, strive for names that are concise and meaningful +
A function has a clear interface 1/3¶
+Comment on this function from Pythonpool:
+i=2
+
+def Prime(no, i):
+ if no == i:
+ return True
+ elif no % i == 0:
+ return False
+ return Prime(no, i + 1)
+. . .
+Function names start with lowercase character, name does not start with a +verb, input is not checked, clumsy interface:
+assert Prime(2, 2)
+assert Prime(3, 2)
+assert Prime(3, 3) # Nothing stops me!
+assert not Prime(4, 2)
+assert Prime(5, 2)
+The classic on refactoring is @fowler2018refactoring.
+A function has a clear interface 2/3¶
+Comment on this function again:
+def is_prime(no, i = 2):
+ assert isinstance(no, int)
+ assert isinstance(i, int)
+ if no == i:
+ return True
+ elif no % i == 0:
+ return False
+ return is_prime(no, i + 1)
+. . .
+-
+
- Clumsy interface: +
assert is_prime(2)
+assert is_prime(2, 2) # Nothing stops me!
+assert is_prime(3)
+assert not is_prime(4)
+assert is_prime(5)
+A function has a clear interface 3/3¶
+Comment on this function again:
+def is_prime(no):
+ if not isinstance(no, int):
+ raise TypeError("'no' must be integer")
+ return is_prime_internal(no)
+
+def is_prime_internal(no, i = 2):
+ assert isinstance(no, int)
+ assert isinstance(i, int)
+ if no == i:
+ return True
+ elif no % i == 0:
+ return False
+ return is_prime_internal(no, i + 1)
+
+assert is_prime(2)
+assert is_prime(3)
+assert not is_prime(4)
+assert is_prime(5)
+. . .
+I think it is OK, please correct me :-)
+A function does one thing correctly¶
+A function should perform a single logical operation [CppCore F.2], +hence don't:
+ +Do:
+ +You rarely need and in a function name. Possible exception:
+mean and standard deviation
What is a good function? 2/3¶
+A good function:
+-
+
- Has a clear name +
- Does one thing correctly +
- Is tested +
- Gives clear error messages +
- Is documented +
- Fast iff needed +
A good function is tested¶
+-
+
- F.2: A function should perform a single logical operation [CppCore F.2] + A function that performs a single operation is simpler to understand, test, and reuse. +
- Joint Strike Fighter Coding Standards, section 3: + Testability: Source code should be written to facilitate testability +
Example 2¶
+Imagine two DNA sequences:
+ +The function align_dna_seqs aligns two DNA sequences to this:
Which tests would you write?
+Solutions 2¶
+assert align_dna_seqs(
+ "AAACCCGGGTTT", "ATACCCGGGTAT"
+ ) == {
+ "AAACCCGGGTTT", "ATACC-GGGTTT"
+ }
+assert align_dna_seqs(
+ { "AAACCCGGGTTT", "ATACCCGGGTAT" }
+) ==
+ { "AAACCCGGGTTT", "ATACC-GGGTTT" }
+
+
+Prefer R?
+ +What is a good function? 3/3¶
+A good function:
+-
+
- Has a clear name +
- Does one thing correctly +
- Is tested +
- Gives clear error messages +
- Is documented +
- Fast iff needed +
References¶
+-
+
[dictionary definition]+ https://www.merriam-webster.com/dictionary/algorithm
+[Martin, 2009]Martin, Robert C. + Clean code: a handbook of agile software craftsmanship. Pearson Education, 2009.
+[Ram, 2013]Ram, K. "rOpenSci-open tools for open science." + AGU Fall Meeting Abstracts. Vol. 2013. 2013.
+[tidyverse style guideline of functions]+ https://style.tidyverse.org/functions.html
+[CppCore F.2]F.2: A function should perform a single logical operation, + https://isocpp.github.io/CppCoreGuidelines/CppCoreGuidelines#Rf-logical
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/algorithms/index.html b/algorithms/index.html
new file mode 100644
index 000000000..7e6912812
--- /dev/null
+++ b/algorithms/index.html
@@ -0,0 +1,2388 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Skip to content
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms¶
+
+
+Learning objectives
+-
+
- Understand design by contract +
- Understand algorithm names increase expressiveness of code +
- Understand difference between
ifandassertin function writing
+
Intro¶
+How do I write functions [1] that are:
+-
+
- easy to use +
- correct +
- fast [2] +
References;
+-
+
- [1] For now, we use
algorithm == function, + as the definition of an algorithm is + 'a step-by-step procedure for solving a problem or + accomplishing some end' @dictionary_algorithm
+ -
+
[2] pick any vague definition
+
+ - + + +
- assert +
- Recursive algorithms +
Discuss¶
+-
+
- Function design is hard +
- Documentation helps +
- TDD helps +
asserthelps
+
Course material¶
+ + + +| Description | +HTML | +QMD | +|
|---|---|---|---|
| Algorithms lecture | +algorithms_lecture.pdf |
+algorithms_lecture.html |
+here | +
the code layout-ed items will become links in the future
-
+
- GitHub repository with exercises: + https://github.com/richelbilderbeek/programming_formalisms_algorithms +
Links¶
+ + + + + + + + + + + + + + +
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/algorithms/phil_karlton_with_fish.jpg b/algorithms/phil_karlton_with_fish.jpg
new file mode 100644
index 000000000..91dafbdde
Binary files /dev/null and b/algorithms/phil_karlton_with_fish.jpg differ
diff --git a/algorithms/programming_formalism_course.png b/algorithms/programming_formalism_course.png
new file mode 100644
index 000000000..f5c55d988
Binary files /dev/null and b/algorithms/programming_formalism_course.png differ
diff --git a/algorithms/programming_formalism_logo_25_cropped.png b/algorithms/programming_formalism_logo_25_cropped.png
new file mode 100644
index 000000000..9b7f312ad
Binary files /dev/null and b/algorithms/programming_formalism_logo_25_cropped.png differ
diff --git a/algorithms/recursive_algorithms/index.html b/algorithms/recursive_algorithms/index.html
new file mode 100644
index 000000000..0b0071d85
--- /dev/null
+++ b/algorithms/recursive_algorithms/index.html
@@ -0,0 +1,2497 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Skip to content
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Recursive algorithms¶
+
+
+Learning objectives
+-
+
- Understand design by contract +
- Understand algorithm names increase expressiveness of code +
- Understand difference between
ifandassertin function writing
+
Recursive algorithms¶
+-
+
- Iterative: use a for-loop +
- Recursive: a function that calls itself +
Example 1: factorial¶
+n |
+n! |
+
|---|---|
| 0 | +1 | +
| 1 | +1 | +
| 2 | +2 * 1 = 2 | +
| 3 | +3 * 2 * 1 = 6 | +
| 4 | +4 * 3 * 2 * 1 = 24 | +
| 5 | +5 * 4! |
+
n |
+n * (n-1)! |
+
Exercise 1: factorial¶
+-
+
- Develop a function to get the factorial of a number +
- If the function used a for-loop, create another function that uses recursion, or the other way around +
- Write the code of the function as a pair and/or with help of an AI +
+
+
+Example 2¶
+Fibonacci sequence:
+| N | +0 | +1 | +2 | +3 | +4 | +5 | +6 | +7 | +8 | +9 | +10 | +
|---|---|---|---|---|---|---|---|---|---|---|---|
Fn |
+0 | +1 | +1 | +2 | +3 | +5 | +8 | +13 | +21 | +34 | +55 | +
Example 2¶
+| N | +Fn |
+
|---|---|
| 0 | +0 | +
| 1 | +1 | +
| 2 | +1 | +
| 3 | +Fn(1) + Fn(2) |
+
n |
+Fn(n - 2) + Fn(n - 1) |
+
Exercise¶
+-
+
- Develop a function to get the nth value in the Fibonacci sequence +
- If the function used a for-loop, create another function that uses recursion, or vice versa +
- Write the code of the function as a pair and/or with help of an AI +
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/algorithms/the_clean_coder.png b/algorithms/the_clean_coder.png
new file mode 100644
index 000000000..811101546
Binary files /dev/null and b/algorithms/the_clean_coder.png differ
diff --git a/assets/UU_logo_color.svg b/assets/UU_logo_color.svg
new file mode 100644
index 000000000..2c9c1b6c0
--- /dev/null
+++ b/assets/UU_logo_color.svg
@@ -0,0 +1,347 @@
+
+
+
+
diff --git a/assets/UU_logo_vit.svg b/assets/UU_logo_vit.svg
new file mode 100644
index 000000000..4d14d7348
--- /dev/null
+++ b/assets/UU_logo_vit.svg
@@ -0,0 +1,782 @@
+
+
+
diff --git a/assets/UU_logotyper_digitalt_svg_2022.svg b/assets/UU_logotyper_digitalt_svg_2022.svg
new file mode 100644
index 000000000..aac08e4c9
--- /dev/null
+++ b/assets/UU_logotyper_digitalt_svg_2022.svg
@@ -0,0 +1,748 @@
+
+
+
diff --git a/assets/empty/index.html b/assets/empty/index.html
new file mode 100644
index 000000000..97c17179d
--- /dev/null
+++ b/assets/empty/index.html
@@ -0,0 +1,2189 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Empty
+ + + + + + + + + + + + + + + +
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/assets/images/favicon.png b/assets/images/favicon.png
new file mode 100644
index 000000000..1cf13b9f9
Binary files /dev/null and b/assets/images/favicon.png differ
diff --git a/assets/javascripts/bundle.83f73b43.min.js b/assets/javascripts/bundle.83f73b43.min.js
new file mode 100644
index 000000000..43d8b70f6
--- /dev/null
+++ b/assets/javascripts/bundle.83f73b43.min.js
@@ -0,0 +1,16 @@
+"use strict";(()=>{var Wi=Object.create;var gr=Object.defineProperty;var Di=Object.getOwnPropertyDescriptor;var Vi=Object.getOwnPropertyNames,Vt=Object.getOwnPropertySymbols,Ni=Object.getPrototypeOf,yr=Object.prototype.hasOwnProperty,ao=Object.prototype.propertyIsEnumerable;var io=(e,t,r)=>t in e?gr(e,t,{enumerable:!0,configurable:!0,writable:!0,value:r}):e[t]=r,$=(e,t)=>{for(var r in t||(t={}))yr.call(t,r)&&io(e,r,t[r]);if(Vt)for(var r of Vt(t))ao.call(t,r)&&io(e,r,t[r]);return e};var so=(e,t)=>{var r={};for(var o in e)yr.call(e,o)&&t.indexOf(o)<0&&(r[o]=e[o]);if(e!=null&&Vt)for(var o of Vt(e))t.indexOf(o)<0&&ao.call(e,o)&&(r[o]=e[o]);return r};var xr=(e,t)=>()=>(t||e((t={exports:{}}).exports,t),t.exports);var zi=(e,t,r,o)=>{if(t&&typeof t=="object"||typeof t=="function")for(let n of Vi(t))!yr.call(e,n)&&n!==r&&gr(e,n,{get:()=>t[n],enumerable:!(o=Di(t,n))||o.enumerable});return e};var Mt=(e,t,r)=>(r=e!=null?Wi(Ni(e)):{},zi(t||!e||!e.__esModule?gr(r,"default",{value:e,enumerable:!0}):r,e));var co=(e,t,r)=>new Promise((o,n)=>{var i=p=>{try{s(r.next(p))}catch(c){n(c)}},a=p=>{try{s(r.throw(p))}catch(c){n(c)}},s=p=>p.done?o(p.value):Promise.resolve(p.value).then(i,a);s((r=r.apply(e,t)).next())});var lo=xr((Er,po)=>{(function(e,t){typeof Er=="object"&&typeof po!="undefined"?t():typeof define=="function"&&define.amd?define(t):t()})(Er,function(){"use strict";function e(r){var o=!0,n=!1,i=null,a={text:!0,search:!0,url:!0,tel:!0,email:!0,password:!0,number:!0,date:!0,month:!0,week:!0,time:!0,datetime:!0,"datetime-local":!0};function s(k){return!!(k&&k!==document&&k.nodeName!=="HTML"&&k.nodeName!=="BODY"&&"classList"in k&&"contains"in k.classList)}function p(k){var ft=k.type,qe=k.tagName;return!!(qe==="INPUT"&&a[ft]&&!k.readOnly||qe==="TEXTAREA"&&!k.readOnly||k.isContentEditable)}function c(k){k.classList.contains("focus-visible")||(k.classList.add("focus-visible"),k.setAttribute("data-focus-visible-added",""))}function l(k){k.hasAttribute("data-focus-visible-added")&&(k.classList.remove("focus-visible"),k.removeAttribute("data-focus-visible-added"))}function f(k){k.metaKey||k.altKey||k.ctrlKey||(s(r.activeElement)&&c(r.activeElement),o=!0)}function u(k){o=!1}function d(k){s(k.target)&&(o||p(k.target))&&c(k.target)}function y(k){s(k.target)&&(k.target.classList.contains("focus-visible")||k.target.hasAttribute("data-focus-visible-added"))&&(n=!0,window.clearTimeout(i),i=window.setTimeout(function(){n=!1},100),l(k.target))}function L(k){document.visibilityState==="hidden"&&(n&&(o=!0),X())}function X(){document.addEventListener("mousemove",J),document.addEventListener("mousedown",J),document.addEventListener("mouseup",J),document.addEventListener("pointermove",J),document.addEventListener("pointerdown",J),document.addEventListener("pointerup",J),document.addEventListener("touchmove",J),document.addEventListener("touchstart",J),document.addEventListener("touchend",J)}function te(){document.removeEventListener("mousemove",J),document.removeEventListener("mousedown",J),document.removeEventListener("mouseup",J),document.removeEventListener("pointermove",J),document.removeEventListener("pointerdown",J),document.removeEventListener("pointerup",J),document.removeEventListener("touchmove",J),document.removeEventListener("touchstart",J),document.removeEventListener("touchend",J)}function J(k){k.target.nodeName&&k.target.nodeName.toLowerCase()==="html"||(o=!1,te())}document.addEventListener("keydown",f,!0),document.addEventListener("mousedown",u,!0),document.addEventListener("pointerdown",u,!0),document.addEventListener("touchstart",u,!0),document.addEventListener("visibilitychange",L,!0),X(),r.addEventListener("focus",d,!0),r.addEventListener("blur",y,!0),r.nodeType===Node.DOCUMENT_FRAGMENT_NODE&&r.host?r.host.setAttribute("data-js-focus-visible",""):r.nodeType===Node.DOCUMENT_NODE&&(document.documentElement.classList.add("js-focus-visible"),document.documentElement.setAttribute("data-js-focus-visible",""))}if(typeof window!="undefined"&&typeof document!="undefined"){window.applyFocusVisiblePolyfill=e;var t;try{t=new CustomEvent("focus-visible-polyfill-ready")}catch(r){t=document.createEvent("CustomEvent"),t.initCustomEvent("focus-visible-polyfill-ready",!1,!1,{})}window.dispatchEvent(t)}typeof document!="undefined"&&e(document)})});var qr=xr((hy,On)=>{"use strict";/*!
+ * escape-html
+ * Copyright(c) 2012-2013 TJ Holowaychuk
+ * Copyright(c) 2015 Andreas Lubbe
+ * Copyright(c) 2015 Tiancheng "Timothy" Gu
+ * MIT Licensed
+ */var $a=/["'&<>]/;On.exports=Pa;function Pa(e){var t=""+e,r=$a.exec(t);if(!r)return t;var o,n="",i=0,a=0;for(i=r.index;i